{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02734359,0.00033302407,0.9713429,0.00013669001,0.000026956423,0.00001342119,0.000008981922,0.00019130622,0.0006029611],"genre_scores_gemma":[0.9457512,0.0003236889,0.052848917,0.00007113045,0.00007220988,0.000051631127,0.000025174477,0.000038237824,0.00081782625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906725,0.0003634281,0.000034563072,0.0001918773,0.00026626344,0.00007661238],"domain_scores_gemma":[0.9950335,0.0035928765,0.0004731346,0.00034400108,0.00049232476,0.000064121145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079658,0.0007893438,0.0008847408,0.00029190557,0.00040850783,0.00066114054,0.0008163638,0.0008355173,0.00052163407],"category_scores_gemma":[0.011300262,0.00036683865,0.0003089787,0.0006730657,0.001091082,0.0011536517,0.00082892907,0.000996639,0.00014575607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004949067,0.000015438882,0.00036273646,0.000029734856,0.00002099071,0.000023596036,0.0000383556,0.9769101,0.0018584827,0.0029757342,0.0001994965,0.017515892],"study_design_scores_gemma":[0.0000032619316,0.000014658751,0.00006597466,0.0000014680834,0.0000025388567,0.0000043419254,0.0000026434902,0.9982888,0.0003754018,0.0011896688,0.00004867307,0.0000025211614],"about_ca_topic_score_codex":0.0035510762,"about_ca_topic_score_gemma":0.0023532363,"teacher_disagreement_score":0.0035510762,"about_ca_system_score_codex":0.00072665926,"about_ca_system_score_gemma":0.0008687757,"threshold_uncertainty_score":0.010998368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22996348,0.0014699616,0.7603473,0.000301604,0.000023926983,0.000041121286,0.00011197877,0.00021442107,0.0075262343],"genre_scores_gemma":[0.9931064,0.0004972727,0.0058174953,0.000026611584,0.00001941979,0.000013827859,0.00003539253,0.000014875802,0.0004687182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.00025626822,0.000019911125,0.000081409766,0.00022933562,0.00015062375],"domain_scores_gemma":[0.9974567,0.0016907662,0.00027130492,0.0001336413,0.00037293826,0.00007465662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097213074,0.000698983,0.0005580878,0.00095808954,0.00027558004,0.00071940746,0.0006313439,0.0005207138,0.00058119965],"category_scores_gemma":[0.005139716,0.00024198838,0.00032818917,0.00080746086,0.0009532497,0.0008514772,0.0009123781,0.00034781155,0.00009853179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039072052,0.0000071605255,0.001287897,0.000024179986,0.00001788066,0.00014488757,0.00003374475,0.9845233,0.0018336051,0.006697225,0.00019010364,0.0052009625],"study_design_scores_gemma":[9.660475e-7,0.000011027314,0.00037485,0.0000023875866,0.0000049840323,0.000034066958,0.000012283804,0.9980081,0.0004008141,0.0010707566,0.000076701035,0.0000030582407],"about_ca_topic_score_codex":0.0052775,"about_ca_topic_score_gemma":0.0019523974,"teacher_disagreement_score":0.0052775,"about_ca_system_score_codex":0.0013421176,"about_ca_system_score_gemma":0.00047906634,"threshold_uncertainty_score":0.0104935765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014478043,0.0025483288,0.96905005,0.0008855181,0.00021498285,0.00007790033,0.00038757003,0.002837564,0.009520054],"genre_scores_gemma":[0.4155119,0.003094429,0.5677578,0.0010218781,0.00020068773,0.00040523006,0.002164683,0.0012561029,0.008587242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949567,0.0017420355,0.00021241045,0.0007730616,0.0017193274,0.00059641706],"domain_scores_gemma":[0.985076,0.010502441,0.0004679074,0.002050556,0.0016595135,0.0002434545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060372893,0.0018830237,0.0012908624,0.0012762892,0.001015927,0.0027678143,0.0023614822,0.0026691458,0.008280878],"category_scores_gemma":[0.038214967,0.00052960543,0.00110832,0.001734289,0.0017244493,0.0036684233,0.002608409,0.0032064298,0.0057423324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015976643,0.00017872117,0.0042592515,0.00085845497,0.00019086749,0.000410687,0.0005891078,0.5061235,0.01815191,0.1510645,0.020409014,0.29616636],"study_design_scores_gemma":[0.000020517151,0.00006241735,0.0005560202,0.000077725825,0.000024662788,0.00036562124,0.00009468171,0.9602941,0.010227883,0.0245793,0.0036455076,0.000051485506],"about_ca_topic_score_codex":0.0067080273,"about_ca_topic_score_gemma":0.004720885,"teacher_disagreement_score":0.008280878,"about_ca_system_score_codex":0.002659492,"about_ca_system_score_gemma":0.0030912152,"threshold_uncertainty_score":0.03192866},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017512579,0.0005255124,0.97476,0.00019720213,0.00013465174,0.00006393399,0.000052419866,0.0004534859,0.0063002873],"genre_scores_gemma":[0.7295415,0.00044348813,0.2649155,0.0002455854,0.00013338857,0.00011791466,0.00006565437,0.000030127867,0.0045067635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993604,0.0001702883,0.000042522373,0.00017331606,0.00015180085,0.00010165626],"domain_scores_gemma":[0.9993376,0.00014714588,0.000120931596,0.00017812091,0.00015685109,0.00005934525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006348614,0.0009445426,0.00092863385,0.0004649003,0.0008962286,0.000935143,0.0015692418,0.0009226649,0.0022920575],"category_scores_gemma":[0.0009548381,0.00033990675,0.0007276242,0.00087368436,0.0007256313,0.0013335884,0.0013217259,0.0009054517,0.0010040901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082022673,0.00027181316,0.0016587495,0.0006684094,0.00022693691,0.0013231124,0.0008286292,0.16865543,0.2854494,0.15083474,0.008481673,0.3807809],"study_design_scores_gemma":[0.00015627244,0.00062485144,0.0005107971,0.00006470938,0.00012831204,0.0019059791,0.00009329434,0.92873496,0.04223829,0.014186968,0.011220499,0.00013509147],"about_ca_topic_score_codex":0.0007644271,"about_ca_topic_score_gemma":0.00090267544,"teacher_disagreement_score":0.0022920575,"about_ca_system_score_codex":0.00055092503,"about_ca_system_score_gemma":0.0008036673,"threshold_uncertainty_score":0.0076677203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081818566,0.00025518326,0.90026015,0.0011670318,0.00008351173,0.00023435296,0.0001296916,0.000076451295,0.015975086],"genre_scores_gemma":[0.91933334,0.00053367304,0.06475952,0.00041123692,0.00011637209,0.00040614363,0.00007258541,0.000041355237,0.014325832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996833,0.0018294015,0.000063059684,0.00035143504,0.00049887155,0.00042421083],"domain_scores_gemma":[0.9955017,0.0034374373,0.0003761052,0.000113637914,0.00032264186,0.0002484849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029155544,0.0015638266,0.0020522713,0.00095643423,0.0008854746,0.0022825522,0.002235166,0.0022135295,0.0028082137],"category_scores_gemma":[0.006324911,0.0005204054,0.0009766686,0.00084990426,0.0024556944,0.002413834,0.0015739871,0.0016295818,0.00041392213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019641068,0.00006868419,0.00041653845,0.00006358589,0.0000523147,0.0003694941,0.00013984274,0.82444155,0.0012722382,0.16819836,0.0007381564,0.004042781],"study_design_scores_gemma":[0.000037350277,0.000055437064,0.00007548354,0.0000074357968,0.000010688143,0.000054306518,0.000025937747,0.97856873,0.00010893249,0.020700669,0.00034012733,0.0000148590125],"about_ca_topic_score_codex":0.0052566915,"about_ca_topic_score_gemma":0.003144668,"teacher_disagreement_score":0.0052566915,"about_ca_system_score_codex":0.0024584,"about_ca_system_score_gemma":0.001558386,"threshold_uncertainty_score":0.017836988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058486454,0.00063450326,0.9379458,0.00020512714,0.00016126476,0.000037823527,0.00006002022,0.00048028555,0.0019887267],"genre_scores_gemma":[0.77138335,0.00024677883,0.22633079,0.00018193814,0.00008245278,0.00003484212,0.0000799489,0.00003206686,0.0016278172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.0002627626,0.00004999588,0.0002653635,0.00029447695,0.00010121989],"domain_scores_gemma":[0.99794596,0.0010920106,0.00020828213,0.00030672038,0.0003660981,0.0000809599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014220583,0.0006324469,0.00094386295,0.0005198011,0.00035668863,0.0008813256,0.0013737568,0.00085669867,0.0007100621],"category_scores_gemma":[0.004467642,0.00033362623,0.0002955663,0.0007373499,0.0005506439,0.0014085338,0.00093991205,0.00083765085,0.00029643322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014112693,0.00036128954,0.002858244,0.00019073831,0.00014426597,0.0003174204,0.00016341131,0.55780977,0.088367,0.0412276,0.002617158,0.30453184],"study_design_scores_gemma":[0.00003269343,0.00013241258,0.00024925577,0.000006075204,0.000020358091,0.00012601021,0.0000070567216,0.9867735,0.009474515,0.0024751956,0.00068239856,0.00002054016],"about_ca_topic_score_codex":0.0010800754,"about_ca_topic_score_gemma":0.0015157495,"teacher_disagreement_score":0.0014220583,"about_ca_system_score_codex":0.00056361814,"about_ca_system_score_gemma":0.0012333093,"threshold_uncertainty_score":0.0075206757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8602265,0.0014315669,0.12429331,0.00033000982,0.00003369665,0.000041522362,0.00018368637,0.00018358759,0.01327613],"genre_scores_gemma":[0.99697244,0.00023211777,0.0025028205,0.000013559396,0.0000064714886,0.000007787858,0.000017552451,0.000007262655,0.0002399615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989549,0.0004263739,0.00004341938,0.00010393559,0.0002195933,0.00025173379],"domain_scores_gemma":[0.9895571,0.008322862,0.0010968894,0.0006109978,0.00026959757,0.0001426995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017613859,0.000625657,0.00047104748,0.00074379635,0.00060920767,0.00132318,0.0006249296,0.0004394907,0.0008634844],"category_scores_gemma":[0.008118678,0.00020329474,0.0002788914,0.00067783316,0.0014022874,0.0020164521,0.0010057541,0.0005774722,0.00010817926],"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.0018996003,0.00011117252,0.0036770825,0.00026967097,0.00006365874,0.00035843166,0.00031198765,0.76932836,0.029930472,0.17288539,0.00033715914,0.020827051],"study_design_scores_gemma":[0.000052179777,0.00028424483,0.0016918725,0.000077013814,0.00006402474,0.00030901685,0.0001815018,0.9197066,0.037305713,0.039518267,0.0007437636,0.00006572143],"about_ca_topic_score_codex":0.0013739184,"about_ca_topic_score_gemma":0.0013359949,"teacher_disagreement_score":0.0017613859,"about_ca_system_score_codex":0.0009566497,"about_ca_system_score_gemma":0.000875029,"threshold_uncertainty_score":0.009315252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007850379,0.00016153797,0.98771346,0.00019237831,0.00002577892,0.000044619184,0.000013646342,0.00005282846,0.003945384],"genre_scores_gemma":[0.49459663,0.0007817196,0.49819615,0.0001951281,0.00010345411,0.00024086398,0.000042584896,0.00009046469,0.0057529015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993061,0.00034114046,0.000019863555,0.000079748235,0.00018974276,0.000063371626],"domain_scores_gemma":[0.9995584,0.0001594074,0.00006751478,0.000051758616,0.00013971936,0.000023092036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012226892,0.0005706735,0.00041225093,0.0005995564,0.0004035175,0.0008733931,0.0010937128,0.0008168377,0.0017393851],"category_scores_gemma":[0.0014721209,0.00036954595,0.00046931548,0.000401297,0.0005165253,0.0010251992,0.0005062164,0.00076145603,0.00025085316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038895614,0.0000548538,0.0003982664,0.00009912793,0.000021123818,0.000089942776,0.00005024105,0.85569924,0.011613504,0.0822827,0.0010494898,0.048602663],"study_design_scores_gemma":[0.000004375495,0.000034779103,0.000054962893,0.000006071906,0.0000054072,0.000036273454,0.000010958152,0.9883393,0.0013393925,0.008394951,0.001768817,0.000004706238],"about_ca_topic_score_codex":0.0006673809,"about_ca_topic_score_gemma":0.0008809646,"teacher_disagreement_score":0.0017393851,"about_ca_system_score_codex":0.0011263828,"about_ca_system_score_gemma":0.00090374507,"threshold_uncertainty_score":0.008172512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036964566,0.0009492412,0.95445687,0.00026472285,0.000037557504,0.000043192573,0.00012238717,0.000119576245,0.0070418175],"genre_scores_gemma":[0.89823705,0.0010940047,0.09442369,0.00008920018,0.000067418,0.00012191556,0.00011255481,0.000049410544,0.0058047404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993375,0.00024060624,0.000024411862,0.00009207574,0.00021272444,0.00009258133],"domain_scores_gemma":[0.9993248,0.0004124552,0.000081214064,0.000041139625,0.00012356533,0.000016801894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683949,0.0011397272,0.00090931886,0.0003852902,0.00030791125,0.001387294,0.00067582773,0.00081890455,0.0019530663],"category_scores_gemma":[0.0018351008,0.00042744458,0.00043370778,0.0005852177,0.00065728585,0.0009493519,0.00070273946,0.0006282125,0.00044835362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056142566,0.000031273088,0.0002128134,0.00009300073,0.00003693412,0.00013254234,0.000066749395,0.9499868,0.00627535,0.030527895,0.00066182937,0.011918707],"study_design_scores_gemma":[0.000009008568,0.000026890537,0.00006327361,0.0000047703543,0.000008746404,0.000036182242,0.000013939522,0.99480647,0.000918948,0.0037855092,0.0003193533,0.0000068387844],"about_ca_topic_score_codex":0.0020218156,"about_ca_topic_score_gemma":0.0020151178,"teacher_disagreement_score":0.0020218156,"about_ca_system_score_codex":0.0010437524,"about_ca_system_score_gemma":0.0006778135,"threshold_uncertainty_score":0.0075730085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15192412,0.00075945037,0.8314006,0.0004961738,0.00006889009,0.000108307206,0.0001400365,0.00011753934,0.014984916],"genre_scores_gemma":[0.96188086,0.0006550627,0.035232563,0.00007641258,0.000058483616,0.00014256078,0.00006833008,0.000038477665,0.0018472415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678373,0.0019208916,0.000095588235,0.0002458865,0.00046291898,0.0004910202],"domain_scores_gemma":[0.9933503,0.004820372,0.00071033556,0.0003993177,0.00039745565,0.00032220935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033917427,0.0018566162,0.0016623179,0.00078324357,0.000853983,0.0018928427,0.0010879133,0.0013911526,0.001934355],"category_scores_gemma":[0.008567564,0.00083913165,0.000856233,0.00102916,0.0023583544,0.0024238855,0.0024814492,0.0013166518,0.0005547429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031755798,0.00011129085,0.00054164836,0.00015366882,0.000064785505,0.00056591426,0.00022948683,0.8029753,0.004738532,0.18034317,0.0009065576,0.0090521155],"study_design_scores_gemma":[0.000033561144,0.00010460602,0.00010598746,0.000018977675,0.000021957101,0.00016308241,0.00008294058,0.93030113,0.0015275329,0.067185864,0.00042777072,0.000026640253],"about_ca_topic_score_codex":0.0005925713,"about_ca_topic_score_gemma":0.0004985345,"teacher_disagreement_score":0.0033917427,"about_ca_system_score_codex":0.0011700635,"about_ca_system_score_gemma":0.0010110751,"threshold_uncertainty_score":0.017937481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007000195,0.00010445783,0.9919228,0.000069661866,0.000023365154,0.00003230529,0.000016567808,0.00013171602,0.0006988318],"genre_scores_gemma":[0.2788189,0.00030561347,0.71750796,0.0001774366,0.00006301225,0.00027979392,0.00014066407,0.00006395001,0.0026426103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994134,0.00016532802,0.0000304524,0.00010834755,0.00020895156,0.00007355],"domain_scores_gemma":[0.9989196,0.00061924435,0.00010537498,0.000064530344,0.00023688196,0.000054427695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661203,0.0004701315,0.0008544914,0.0005313782,0.00076644175,0.00070734904,0.0015741535,0.00080479914,0.0014403557],"category_scores_gemma":[0.0036230984,0.00040204404,0.0004041758,0.00057660264,0.00062583346,0.0012420169,0.0010002728,0.0010580367,0.00044816456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000461381,0.00014888555,0.0017147862,0.00015972904,0.00009569152,0.00015373934,0.0004909818,0.5665742,0.016045189,0.066723965,0.0034386634,0.34399274],"study_design_scores_gemma":[0.000038735212,0.00005023563,0.00011756138,0.000009887323,0.0000126388195,0.000063978536,0.000022556762,0.9898142,0.0015454588,0.007095645,0.0012123102,0.000016729255],"about_ca_topic_score_codex":0.003356213,"about_ca_topic_score_gemma":0.003945892,"teacher_disagreement_score":0.003356213,"about_ca_system_score_codex":0.00082761963,"about_ca_system_score_gemma":0.0021057695,"threshold_uncertainty_score":0.0066733956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029116048,0.00016772609,0.9683896,0.00019079387,0.0000119188635,0.000030128613,0.000024060835,0.00008166531,0.0019881292],"genre_scores_gemma":[0.85959816,0.00029343783,0.137665,0.00007702212,0.000046873814,0.00018480489,0.00005086334,0.000052095947,0.0020317794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990883,0.00051031273,0.000020661282,0.0000822847,0.00018963158,0.00010894923],"domain_scores_gemma":[0.9987337,0.0009855779,0.00009586131,0.000067928544,0.00007623193,0.000040805524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015409567,0.000844329,0.0008684343,0.0005474475,0.00043164694,0.0008906955,0.001021043,0.0010759014,0.0011221076],"category_scores_gemma":[0.0046873186,0.00052392145,0.00050585665,0.0009272855,0.00095714343,0.0013543468,0.001245444,0.00065909466,0.00019616507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000948312,0.000059667145,0.00023220258,0.00005462269,0.000023600625,0.000071623326,0.00010071958,0.9291954,0.00262454,0.04154909,0.0007160413,0.025277592],"study_design_scores_gemma":[0.000009623786,0.000018344394,0.000020355767,0.0000018785034,0.0000036309693,0.0000072872012,0.00000770611,0.98544204,0.0003840146,0.013928935,0.00017394008,0.0000022203483],"about_ca_topic_score_codex":0.0014515726,"about_ca_topic_score_gemma":0.0013753879,"teacher_disagreement_score":0.0015409567,"about_ca_system_score_codex":0.0008677577,"about_ca_system_score_gemma":0.00073125353,"threshold_uncertainty_score":0.008149445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047177304,0.00035550672,0.9514123,0.00010461412,0.000022983677,0.00003404122,0.00006521796,0.00022020531,0.0006077336],"genre_scores_gemma":[0.48970467,0.00036814096,0.5080983,0.00007069425,0.00006039918,0.00016306846,0.0002133305,0.000041542917,0.0012798128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00027873318,0.000033173586,0.0000561439,0.00018196071,0.000034144574],"domain_scores_gemma":[0.9986148,0.0008610805,0.00017806288,0.00016141163,0.00014423189,0.00004030176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010664962,0.0004866623,0.0005681856,0.00055510335,0.00031528596,0.00041787667,0.0004991257,0.00060115056,0.0008621735],"category_scores_gemma":[0.0060707256,0.00037012188,0.000207744,0.0006891983,0.00048893486,0.0007440704,0.0006931026,0.0005053814,0.00040864124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086438004,0.00008275236,0.0023410073,0.00022295267,0.000056644218,0.00027631884,0.00030623222,0.52960813,0.05014886,0.05488195,0.0009169597,0.36029384],"study_design_scores_gemma":[0.000026346292,0.00010230942,0.0004600084,0.000029654326,0.00000913444,0.00010463748,0.000022788447,0.97711813,0.010686758,0.010458491,0.00096499774,0.0000167981],"about_ca_topic_score_codex":0.0007837289,"about_ca_topic_score_gemma":0.00124641,"teacher_disagreement_score":0.0010664962,"about_ca_system_score_codex":0.00035387135,"about_ca_system_score_gemma":0.0008588265,"threshold_uncertainty_score":0.0056402087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709292,0.00052671554,0.024658807,0.00019083577,0.00003904492,0.000013569935,0.00006965902,0.00022630734,0.0033459251],"genre_scores_gemma":[0.9986721,0.000077812925,0.0010299704,0.000024397445,0.000015547304,0.0000028027575,0.000021449348,0.00001743773,0.00013832723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975285,0.0007606798,0.00008337253,0.00023617224,0.0010118587,0.00037943939],"domain_scores_gemma":[0.9875021,0.010004085,0.0006859095,0.00057315757,0.0009790227,0.0002556448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015739189,0.0006541263,0.00067521713,0.00062614435,0.0006661723,0.0011251887,0.00026625898,0.0011255683,0.0006823484],"category_scores_gemma":[0.014467875,0.00032396914,0.00016380328,0.0006366228,0.00082130526,0.0010688514,0.00068847684,0.00043744905,0.00028073668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003255917,0.00028639857,0.024082806,0.00022521181,0.00017609222,0.0013555794,0.0003634811,0.7029922,0.215236,0.008784037,0.00052717264,0.042715043],"study_design_scores_gemma":[0.00013813624,0.0017699752,0.02083613,0.000056893343,0.000114675575,0.0011906846,0.00014021392,0.82807773,0.14147355,0.0052310065,0.0008196945,0.00015130985],"about_ca_topic_score_codex":0.001247296,"about_ca_topic_score_gemma":0.0007157414,"teacher_disagreement_score":0.0015739189,"about_ca_system_score_codex":0.00062234857,"about_ca_system_score_gemma":0.0006072385,"threshold_uncertainty_score":0.008323789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80702007,0.001691154,0.17837626,0.0002663609,0.00009269946,0.000046063367,0.00021852572,0.0005096565,0.0117791565],"genre_scores_gemma":[0.99514836,0.0002188657,0.0041202395,0.000018831206,0.000006634735,0.000006461472,0.000028769146,0.000005620874,0.00044611227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935013,0.00021497373,0.00003377198,0.00009023321,0.00014872389,0.0001622504],"domain_scores_gemma":[0.99398106,0.0043199523,0.0004455784,0.0004999053,0.0006317208,0.000121882214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020977855,0.0005710927,0.00074933324,0.0004162593,0.0003299007,0.0010689049,0.0009335139,0.00070270797,0.0011934459],"category_scores_gemma":[0.005924247,0.00019484099,0.0002711549,0.00041179644,0.00085169787,0.0015859884,0.0005250103,0.00025462403,0.00021115932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001059192,0.00008465802,0.0018455012,0.0001809862,0.00008208719,0.00027806574,0.000120460856,0.9351347,0.01398325,0.025639175,0.0008883396,0.020703612],"study_design_scores_gemma":[0.000043790224,0.00040951883,0.00060353475,0.000013191427,0.000051337105,0.00015108238,0.000064745895,0.98015755,0.009484306,0.008412475,0.0005838279,0.00002466717],"about_ca_topic_score_codex":0.00242144,"about_ca_topic_score_gemma":0.0026300712,"teacher_disagreement_score":0.00242144,"about_ca_system_score_codex":0.0006558288,"about_ca_system_score_gemma":0.00065101346,"threshold_uncertainty_score":0.011094272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01931797,0.00026781516,0.9737291,0.0002236696,0.000036279147,0.000023172199,0.00008808055,0.00010620359,0.006207696],"genre_scores_gemma":[0.6995095,0.0025003268,0.2829673,0.00043577576,0.00035710615,0.00031757212,0.0005715922,0.00039819174,0.012942665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839514,0.00046180218,0.000056830002,0.00017822091,0.00069032615,0.00021773763],"domain_scores_gemma":[0.9947988,0.0032832536,0.00041277477,0.00052035134,0.0008343784,0.00015041437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019204243,0.0009101584,0.0004952394,0.0017448773,0.0006182074,0.0016699503,0.0012582577,0.0009265093,0.0031150128],"category_scores_gemma":[0.014327297,0.00041003645,0.0005893596,0.0016582877,0.002550972,0.0031521658,0.001834687,0.0022563622,0.0013486249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053632077,0.000012639456,0.0003978608,0.000047033842,0.0000066364696,0.00008201995,0.000105050574,0.11705585,0.0022198334,0.86035,0.00089992804,0.018769434],"study_design_scores_gemma":[0.000009385112,0.000018524539,0.0001413679,0.000030349123,0.0000048244947,0.00010738509,0.000026938807,0.6067225,0.0013947642,0.38954523,0.001977888,0.000020911848],"about_ca_topic_score_codex":0.001286578,"about_ca_topic_score_gemma":0.0008556116,"teacher_disagreement_score":0.0031150128,"about_ca_system_score_codex":0.0013728876,"about_ca_system_score_gemma":0.0009221099,"threshold_uncertainty_score":0.01042068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0893085,0.0011828075,0.9006259,0.00056101213,0.00021476312,0.00016034808,0.00030640187,0.0016488797,0.0059913932],"genre_scores_gemma":[0.6753197,0.00034890822,0.31822973,0.00021655198,0.00004989733,0.00023571754,0.00036638064,0.00012681795,0.0051064105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994784,0.00009634776,0.000029612049,0.000071427305,0.000248938,0.00007526864],"domain_scores_gemma":[0.9987245,0.00036050368,0.00012103411,0.00019679153,0.00051493954,0.00008210802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034476,0.00029692,0.0003153049,0.00041242602,0.0005992482,0.00046954927,0.00058944384,0.00041893244,0.0011355268],"category_scores_gemma":[0.002193478,0.00011628003,0.000192434,0.0005517814,0.0004964662,0.0005970081,0.0007378848,0.00051528093,0.00036648297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009441985,0.00020139453,0.0027192852,0.00068707665,0.00005852475,0.00067667646,0.0005682905,0.30029452,0.09671617,0.1319572,0.020676758,0.44449982],"study_design_scores_gemma":[0.000098955505,0.0002848735,0.000361384,0.00006821053,0.000025713149,0.00047435943,0.00008030414,0.93084836,0.029564979,0.024137078,0.013986773,0.00006903465],"about_ca_topic_score_codex":0.0025147924,"about_ca_topic_score_gemma":0.0027937535,"teacher_disagreement_score":0.0025147924,"about_ca_system_score_codex":0.00063199014,"about_ca_system_score_gemma":0.0014884518,"threshold_uncertainty_score":0.0050002933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4351961,0.00079416047,0.5596259,0.0004315439,0.000087236804,0.00009123621,0.000024705969,0.00092275935,0.0028263284],"genre_scores_gemma":[0.96020275,0.0001311678,0.038963296,0.00007511129,0.000027563206,0.000017066435,0.000007847247,0.000019240788,0.000555963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.00047337517,0.000048030568,0.00016605515,0.00019423924,0.00024750945],"domain_scores_gemma":[0.9965958,0.0016538781,0.0004074341,0.00058479904,0.00054856634,0.0002096595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021393695,0.00062945765,0.00066559156,0.0005211741,0.00066954474,0.00097096997,0.0018283885,0.0004454449,0.0004901124],"category_scores_gemma":[0.0059196716,0.00036803875,0.00021142402,0.00031765047,0.000751359,0.0018341955,0.0014096355,0.00063309254,0.00015720121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003682644,0.00040808198,0.009760652,0.0002860286,0.00017594374,0.00066163467,0.0009985346,0.45645785,0.112213455,0.09489564,0.0026843224,0.3177752],"study_design_scores_gemma":[0.0000734732,0.0003205232,0.0007530023,0.000031947264,0.000056593137,0.00015041759,0.000084862186,0.9522506,0.03954043,0.005173066,0.0015324885,0.00003265996],"about_ca_topic_score_codex":0.0013634163,"about_ca_topic_score_gemma":0.0018792786,"teacher_disagreement_score":0.0021393695,"about_ca_system_score_codex":0.0009031215,"about_ca_system_score_gemma":0.0007352518,"threshold_uncertainty_score":0.011314213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076615766,0.00075151795,0.91722834,0.00021713802,0.000034253364,0.000032285985,0.000026124651,0.000055666027,0.0050389324],"genre_scores_gemma":[0.96553046,0.0004183071,0.032885034,0.000054804008,0.00003345894,0.0000375365,0.000011818709,0.000012825589,0.0010156371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999495,0.00018911916,0.000014532186,0.00006144633,0.00012754093,0.000112343645],"domain_scores_gemma":[0.9989567,0.0007865438,0.00009659106,0.000032858974,0.000099161836,0.000028078495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008178677,0.0007723604,0.0007092742,0.00036648806,0.00033264962,0.0009848854,0.0005013573,0.00065386324,0.00076890783],"category_scores_gemma":[0.003070123,0.00042359086,0.00030895454,0.000510301,0.0008794206,0.0008243945,0.0005413502,0.0004653492,0.00012946616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065064116,0.000036897683,0.0003615685,0.00005848964,0.000029159643,0.000093078175,0.000052109503,0.9649938,0.0043228217,0.014718914,0.0003277111,0.014940384],"study_design_scores_gemma":[0.000008095002,0.000025465533,0.00008111521,0.0000038101832,0.0000071636537,0.000020915717,0.000017717131,0.99313486,0.00047546808,0.006087892,0.00013368817,0.0000037869515],"about_ca_topic_score_codex":0.0023028848,"about_ca_topic_score_gemma":0.002214741,"teacher_disagreement_score":0.0023028848,"about_ca_system_score_codex":0.00081415795,"about_ca_system_score_gemma":0.0009074139,"threshold_uncertainty_score":0.0059071183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14176314,0.00018128045,0.85491145,0.00009289555,0.00003173763,0.0000739187,0.00029889436,0.00093387166,0.0017128502],"genre_scores_gemma":[0.5720919,0.00026654196,0.42393625,0.00005802254,0.000023529818,0.00013488201,0.00057378475,0.0001628074,0.0027523143],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947554,0.00012510504,0.000031669144,0.0000845276,0.00023856468,0.00004462668],"domain_scores_gemma":[0.9979267,0.0008597731,0.00029972865,0.00033500185,0.0005144889,0.0000642415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827001,0.00034853464,0.00032658738,0.0016805769,0.0004326618,0.000584636,0.00054456457,0.00034992266,0.0010706144],"category_scores_gemma":[0.003165913,0.00023820487,0.00018479268,0.0011287841,0.0004663355,0.00080603216,0.00046095598,0.00037384516,0.00024069863],"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.00044445292,0.000080557584,0.0072779134,0.0003666078,0.00007588831,0.00044023234,0.00043776975,0.33905277,0.09997044,0.084770024,0.0039122975,0.46317106],"study_design_scores_gemma":[0.000012467978,0.000051852152,0.0013324795,0.00001862639,0.000011507265,0.00023360222,0.00003703297,0.9395887,0.028072095,0.028360736,0.0022551934,0.000025628684],"about_ca_topic_score_codex":0.0020427988,"about_ca_topic_score_gemma":0.0039703236,"teacher_disagreement_score":0.0020427988,"about_ca_system_score_codex":0.0006616552,"about_ca_system_score_gemma":0.0007973504,"threshold_uncertainty_score":0.0048006773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051397234,0.00047112425,0.93430907,0.0004786319,0.000051668736,0.00006801781,0.00020532412,0.00019054211,0.0128283845],"genre_scores_gemma":[0.94155973,0.0010243029,0.052873846,0.0002516766,0.00013404178,0.00028262727,0.00017894075,0.000109311186,0.0035854562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979254,0.00058181124,0.00008454997,0.00021370905,0.0008474545,0.0003470303],"domain_scores_gemma":[0.98701817,0.009775491,0.0009832487,0.0007298743,0.0011017798,0.00039141884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033529482,0.0010188213,0.00095869997,0.0010698049,0.0008524797,0.0024353955,0.0018220353,0.0008535734,0.0030864857],"category_scores_gemma":[0.01725778,0.00060753425,0.00062375795,0.0013644042,0.0028955773,0.003006539,0.0020771667,0.0024049056,0.00046233155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658384,0.00004002512,0.00045443958,0.00012988251,0.000028990295,0.00021708576,0.00025718161,0.15638398,0.0056368215,0.8272884,0.00087583205,0.008560837],"study_design_scores_gemma":[0.000023277798,0.000060264,0.00029458845,0.00003158052,0.000011200351,0.00023774826,0.000095357354,0.71609455,0.0039878846,0.277898,0.0012195718,0.000045985245],"about_ca_topic_score_codex":0.0007826374,"about_ca_topic_score_gemma":0.0005107438,"teacher_disagreement_score":0.0033529482,"about_ca_system_score_codex":0.0020328658,"about_ca_system_score_gemma":0.0010413146,"threshold_uncertainty_score":0.017732322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04833427,0.0005044904,0.94857603,0.00024486837,0.00007730732,0.000030850835,0.000052682426,0.00026419305,0.0019152605],"genre_scores_gemma":[0.8542979,0.00077452586,0.1409711,0.000120222336,0.00005053207,0.00007679948,0.00006845399,0.000051124218,0.003589402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995239,0.00012895974,0.000021452865,0.000110998095,0.00017679535,0.000037934093],"domain_scores_gemma":[0.99890745,0.0006777602,0.00019495531,0.00007436229,0.0001155343,0.000030038434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083710236,0.0003178471,0.0005005195,0.00036037422,0.00037051903,0.00050064933,0.0005037056,0.0008056762,0.00059001497],"category_scores_gemma":[0.0029579648,0.00022817009,0.0002224717,0.00044358385,0.0009009114,0.0011205192,0.0008574267,0.0006953888,0.00018933522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065402954,0.00007361708,0.0012716125,0.00035375683,0.00006436728,0.00025835863,0.00034161168,0.60370326,0.14761792,0.1633167,0.0015391092,0.08080566],"study_design_scores_gemma":[0.000035605575,0.000058329217,0.00021411972,0.0000099950485,0.000008232758,0.00006717372,0.000015593852,0.9628932,0.019027598,0.01636058,0.0012788667,0.000030684678],"about_ca_topic_score_codex":0.0009038101,"about_ca_topic_score_gemma":0.0006204773,"teacher_disagreement_score":0.0009038101,"about_ca_system_score_codex":0.0006175466,"about_ca_system_score_gemma":0.00064736063,"threshold_uncertainty_score":0.00448066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3312328,0.002873509,0.6490822,0.0011536689,0.00016619131,0.00010242401,0.0003194056,0.00034463758,0.014725201],"genre_scores_gemma":[0.97735924,0.00070842874,0.018855073,0.00011249505,0.000056248893,0.00008062263,0.000068914036,0.00003404303,0.002724995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00026142807,0.00002998584,0.00013709045,0.00027290694,0.0002772379],"domain_scores_gemma":[0.9930855,0.004620166,0.0010767074,0.00028591705,0.0007169265,0.0002147633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012484768,0.0010631426,0.00076646515,0.00062522956,0.00059520337,0.00093099085,0.00127535,0.0011491878,0.00096261513],"category_scores_gemma":[0.009962129,0.00035778337,0.00033295134,0.000896997,0.0015086994,0.0018640272,0.00088446855,0.0010252954,0.00021063448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015180756,0.000032559885,0.0008048392,0.00011949447,0.000024051442,0.00022511832,0.00013860264,0.85387456,0.0075096968,0.12805052,0.00080417166,0.008264618],"study_design_scores_gemma":[0.000024571604,0.000054202716,0.00013068569,0.000016385506,0.000007944161,0.00006556147,0.000022814398,0.97778875,0.0017086087,0.019780511,0.00038544246,0.000014470133],"about_ca_topic_score_codex":0.005496336,"about_ca_topic_score_gemma":0.0035366993,"teacher_disagreement_score":0.005496336,"about_ca_system_score_codex":0.0021249854,"about_ca_system_score_gemma":0.0016550369,"threshold_uncertainty_score":0.015417874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06915918,0.0004916952,0.9202302,0.00029850876,0.0000932476,0.00004490689,0.00008673383,0.0004803229,0.0091151325],"genre_scores_gemma":[0.8862705,0.00027623447,0.109711304,0.00011277947,0.000044598313,0.000031972893,0.00008050328,0.000056432847,0.0034156307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985619,0.0004398533,0.00007832989,0.0001179476,0.00067007245,0.0001319032],"domain_scores_gemma":[0.9978473,0.0008058049,0.00015404486,0.00057258847,0.0005651663,0.000055124645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012899898,0.0005681225,0.0007475768,0.0003863817,0.00042914218,0.0010952125,0.0006662507,0.0011131385,0.001200735],"category_scores_gemma":[0.005029251,0.00023512798,0.0003594658,0.00060501724,0.0011536727,0.0013399266,0.00081275107,0.00096973346,0.000467363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052114215,0.000047786813,0.0009636328,0.00022043496,0.00004851741,0.00040687103,0.00014993036,0.58361435,0.031765513,0.3309933,0.0016470689,0.049621474],"study_design_scores_gemma":[0.000022807526,0.00008824533,0.00012472448,0.000019466106,0.000013678102,0.00022970444,0.00001153959,0.9565961,0.014934502,0.026860403,0.0010724043,0.000026509855],"about_ca_topic_score_codex":0.0011817282,"about_ca_topic_score_gemma":0.0009988706,"teacher_disagreement_score":0.0012899898,"about_ca_system_score_codex":0.0008063887,"about_ca_system_score_gemma":0.0012823055,"threshold_uncertainty_score":0.0068222284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032652553,0.0013717097,0.9595757,0.00023613808,0.00015787792,0.000066637826,0.000042855812,0.0005754316,0.005321043],"genre_scores_gemma":[0.6340608,0.0017402208,0.3480527,0.00030280917,0.00016743664,0.000105589395,0.00013036634,0.0000689848,0.015371076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00012811666,0.000025927722,0.000031778156,0.00021252208,0.00003239825],"domain_scores_gemma":[0.9991448,0.00027243694,0.00007634496,0.00009710528,0.0003754617,0.000033899327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746853,0.00039767745,0.0004130973,0.00034472957,0.00031609618,0.0004734929,0.00045894764,0.00062452443,0.0014958931],"category_scores_gemma":[0.0016661412,0.00017500829,0.00032203438,0.000262513,0.0003516437,0.0005483883,0.00041373793,0.00058539986,0.0010628671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013591519,0.00010480585,0.0032374568,0.0007473073,0.00019047188,0.0012788267,0.0004340945,0.10515199,0.3434044,0.074802734,0.005934641,0.4633542],"study_design_scores_gemma":[0.000075569915,0.00096685207,0.0010719555,0.00008599824,0.00015614534,0.002371556,0.00006579154,0.78863925,0.16997096,0.007715084,0.028765643,0.000115232775],"about_ca_topic_score_codex":0.0007291763,"about_ca_topic_score_gemma":0.0011946714,"teacher_disagreement_score":0.0014958931,"about_ca_system_score_codex":0.00027752883,"about_ca_system_score_gemma":0.0007567432,"threshold_uncertainty_score":0.0050042868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629249,0.00016431585,0.9210915,0.00014655085,0.00002915764,0.000034563727,0.0000759429,0.00031919905,0.0018461787],"genre_scores_gemma":[0.5639768,0.00023500038,0.4316471,0.0001283028,0.000035135094,0.000072534924,0.00029638037,0.00010834246,0.0035003636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.00031551658,0.000050162973,0.0000753455,0.00036166978,0.000092304675],"domain_scores_gemma":[0.99888486,0.00046491277,0.0001437715,0.00028042533,0.00018201827,0.000044056444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819632,0.00048056306,0.0006053976,0.00026901966,0.0002754823,0.00061987917,0.00082930987,0.0005150835,0.00074091856],"category_scores_gemma":[0.002359261,0.00024690756,0.00030928725,0.00048696413,0.00053527235,0.00075785565,0.0009381308,0.0006124597,0.00027874307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000506412,0.000090651396,0.0010132786,0.00020561046,0.00008893661,0.00015523979,0.00016744925,0.7061461,0.062147044,0.09431277,0.001496104,0.13367036],"study_design_scores_gemma":[0.000016898986,0.000039148552,0.00013067239,0.000004718757,0.000004988547,0.00004328501,0.000005661839,0.98245424,0.011061936,0.0057032458,0.00052734977,0.000007802012],"about_ca_topic_score_codex":0.0012212064,"about_ca_topic_score_gemma":0.0031119594,"teacher_disagreement_score":0.0012212064,"about_ca_system_score_codex":0.0004529493,"about_ca_system_score_gemma":0.0015215077,"threshold_uncertainty_score":0.0036066175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063508945,0.00024389013,0.9911197,0.00008639225,0.000019559973,0.000020986052,0.000048493934,0.00007404547,0.0020360658],"genre_scores_gemma":[0.7268203,0.0017360009,0.26600495,0.00032417968,0.00027415706,0.00026682598,0.0002712345,0.00016430694,0.0041380515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973546,0.0011918598,0.000095257026,0.0003357095,0.00080278784,0.00021984475],"domain_scores_gemma":[0.9968155,0.0019527792,0.0004327999,0.00027998214,0.00046661397,0.000052374908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031023754,0.0020020162,0.0015101394,0.0006094766,0.00034789045,0.0013114635,0.0012901532,0.0010208372,0.00147599],"category_scores_gemma":[0.0067998054,0.00059472164,0.00067716744,0.0011036941,0.001353236,0.001624363,0.0012149273,0.0011201724,0.00071579264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014355268,0.00004942767,0.0002332144,0.00024638412,0.00010783,0.00017775566,0.00010359748,0.89681476,0.013152861,0.059780076,0.0013574739,0.027833039],"study_design_scores_gemma":[0.000016412312,0.00011895901,0.00009445408,0.000017614273,0.000028886674,0.00008977314,0.00001787508,0.9794556,0.004046265,0.015425464,0.00066834054,0.000020373956],"about_ca_topic_score_codex":0.00064484554,"about_ca_topic_score_gemma":0.0005334894,"teacher_disagreement_score":0.0031023754,"about_ca_system_score_codex":0.000784466,"about_ca_system_score_gemma":0.0009427408,"threshold_uncertainty_score":0.016407132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6357677,0.0010632365,0.3488241,0.00031032358,0.000120709745,0.00013775971,0.00035816638,0.0002538469,0.013164199],"genre_scores_gemma":[0.98010224,0.00025221793,0.016381128,0.000037155092,0.00003311602,0.00006019065,0.00023028017,0.000021228196,0.0028823907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899226,0.0002654737,0.000047836813,0.00020095617,0.00038960678,0.00010375083],"domain_scores_gemma":[0.99651515,0.0020718707,0.00038809553,0.00018482687,0.00071989204,0.000120164936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017055268,0.000308269,0.0004853866,0.0015883498,0.0005662795,0.0008509844,0.0007810207,0.00039383923,0.0015425003],"category_scores_gemma":[0.00698595,0.0002411093,0.0002734994,0.0009887358,0.0004465984,0.0014084472,0.00086912763,0.00020887614,0.00025279794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043942657,0.00009940317,0.018503176,0.00017394681,0.00009574426,0.00068795757,0.00033597846,0.86289555,0.006033151,0.07017664,0.0024931135,0.03806587],"study_design_scores_gemma":[0.000017782906,0.00009577166,0.0030506134,0.000010255586,0.000022699307,0.00023044736,0.0002462294,0.9765335,0.0031400628,0.015580043,0.0010479536,0.00002469204],"about_ca_topic_score_codex":0.0014670745,"about_ca_topic_score_gemma":0.0013612062,"teacher_disagreement_score":0.0017055268,"about_ca_system_score_codex":0.0006692143,"about_ca_system_score_gemma":0.0004611777,"threshold_uncertainty_score":0.009019792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00598495,0.00018380383,0.9897713,0.000089318055,0.000020226897,0.00001891021,0.000014749775,0.00015477715,0.0037618708],"genre_scores_gemma":[0.352595,0.0009920527,0.63859284,0.00013307879,0.000093392555,0.0001394473,0.00012730357,0.00013443847,0.0071923705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.00034041528,0.000026944004,0.000056686342,0.00031128706,0.000046621175],"domain_scores_gemma":[0.99929583,0.0004072647,0.000060886687,0.00007662399,0.00014009155,0.00001931611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045158,0.00074805046,0.0005830481,0.0003261241,0.00036898203,0.0006317918,0.00037872704,0.00059294445,0.0014084338],"category_scores_gemma":[0.0025901636,0.0002468906,0.00035861283,0.0005376678,0.0008273563,0.0007286491,0.00077540544,0.00060933194,0.0007442949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009771087,0.00003148668,0.0005700531,0.0001423944,0.000049301325,0.00022060558,0.00033200267,0.70909536,0.013375677,0.13222653,0.0031199432,0.14073889],"study_design_scores_gemma":[0.000007276077,0.000022490925,0.000065588516,0.000008990396,0.0000025974646,0.00005989589,0.000012381181,0.9828479,0.0033076897,0.011360575,0.0022940491,0.000010501701],"about_ca_topic_score_codex":0.003384116,"about_ca_topic_score_gemma":0.0034735517,"teacher_disagreement_score":0.003384116,"about_ca_system_score_codex":0.0005776563,"about_ca_system_score_gemma":0.0010971951,"threshold_uncertainty_score":0.006728828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012549386,0.0001496239,0.9845732,0.00007683175,0.000023385122,0.00003901323,0.000017074055,0.00026542586,0.002306084],"genre_scores_gemma":[0.5465861,0.00037684286,0.44820854,0.0001526633,0.000053173422,0.00014206271,0.00005938343,0.000085614534,0.004335681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972934,0.000077624776,0.000011898912,0.000053040963,0.0000863013,0.00004177351],"domain_scores_gemma":[0.99960476,0.00008872127,0.00006928643,0.00006758704,0.00014522843,0.000024456727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031750245,0.00042977696,0.0002873446,0.00037510585,0.0005953636,0.00050951866,0.0005510243,0.00059806113,0.0015899923],"category_scores_gemma":[0.0010694142,0.00015585717,0.00024394259,0.00034833452,0.0004751699,0.0008846637,0.00047197836,0.00064533984,0.000695775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005645345,0.000093785646,0.0010167907,0.00030137663,0.00007051094,0.0004730796,0.0004069479,0.3180018,0.16380009,0.20552862,0.0042668423,0.30547562],"study_design_scores_gemma":[0.000049921488,0.0003465833,0.00028762154,0.00006045843,0.000026620473,0.00072492886,0.000058874193,0.862321,0.09219604,0.025852142,0.01802581,0.000049909206],"about_ca_topic_score_codex":0.0015743363,"about_ca_topic_score_gemma":0.0019250619,"teacher_disagreement_score":0.0015899923,"about_ca_system_score_codex":0.0007118434,"about_ca_system_score_gemma":0.0008030839,"threshold_uncertainty_score":0.0053189993},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036414,0.00054827915,0.95861775,0.000182684,0.000089631205,0.00006515631,0.000062835126,0.0009672244,0.0030523548],"genre_scores_gemma":[0.57101184,0.0004282437,0.42486736,0.00013492709,0.000045287423,0.00008552989,0.00009955023,0.00006692147,0.003260259],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995333,0.00009266501,0.000030244903,0.000055749875,0.00024216111,0.000045923807],"domain_scores_gemma":[0.9991165,0.00034386574,0.00009496846,0.00019469991,0.0002126133,0.0000374365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035851542,0.00046904627,0.00046855537,0.00047588584,0.00042817008,0.0005579069,0.0007669627,0.00051839143,0.0014120921],"category_scores_gemma":[0.0017729349,0.00017808612,0.00019791682,0.0004837036,0.0006206281,0.00069148815,0.0009758361,0.00095578795,0.00038286962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040488236,0.00012856648,0.0013419696,0.00041039815,0.000038638234,0.00034237246,0.00024993584,0.114350274,0.39899898,0.116284646,0.002733321,0.36471605],"study_design_scores_gemma":[0.000039437466,0.00023271513,0.00047459188,0.000049062044,0.000019207971,0.00030678845,0.000025602701,0.7544463,0.223158,0.016016401,0.0051796255,0.000052341657],"about_ca_topic_score_codex":0.0005690787,"about_ca_topic_score_gemma":0.0009427547,"teacher_disagreement_score":0.0014120921,"about_ca_system_score_codex":0.00037866586,"about_ca_system_score_gemma":0.0006181414,"threshold_uncertainty_score":0.0047239065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015820155,0.000104729064,0.9977197,0.00003572478,0.00001323919,0.000009822938,0.00001243128,0.0000884433,0.0004338565],"genre_scores_gemma":[0.14787559,0.0004256096,0.84892756,0.00006564358,0.000059210226,0.00013550022,0.0001340482,0.00013106629,0.0022457202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931335,0.0002887062,0.000027614968,0.000051951185,0.00027902235,0.000039383838],"domain_scores_gemma":[0.99861526,0.0009803247,0.000087644534,0.0001609696,0.00013157315,0.000024216317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011186694,0.00065198273,0.0005931508,0.0005610944,0.00040121266,0.0011657764,0.000840275,0.0007602742,0.0024928618],"category_scores_gemma":[0.006259747,0.0003378718,0.00036084777,0.0006150667,0.0007039755,0.0014595537,0.0009877435,0.0011657365,0.0010595265],"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.00020894162,0.00005085801,0.0009473867,0.0002977706,0.000055646204,0.00016865156,0.0002015644,0.5228605,0.013552624,0.25733277,0.0018852025,0.20243806],"study_design_scores_gemma":[0.0000071830223,0.000018663424,0.00010412244,0.0000131875195,0.00000522735,0.00008067864,0.00000823598,0.9713021,0.0033867497,0.023717353,0.001343167,0.000013276495],"about_ca_topic_score_codex":0.0008254279,"about_ca_topic_score_gemma":0.001280276,"teacher_disagreement_score":0.0024928618,"about_ca_system_score_codex":0.00062746013,"about_ca_system_score_gemma":0.00090434327,"threshold_uncertainty_score":0.008339524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64355975,0.000962717,0.31679398,0.0003782489,0.00009980507,0.000081501414,0.00031288274,0.00037630313,0.03743481],"genre_scores_gemma":[0.9710155,0.00019028861,0.02568916,0.000042343563,0.000017908646,0.00002274343,0.00012936164,0.000023008712,0.0028696507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988551,0.00028912473,0.000047874873,0.0000963383,0.0005096242,0.00020188895],"domain_scores_gemma":[0.99922585,0.00028233862,0.00009935415,0.00012315653,0.00023987328,0.000029372615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582055,0.0005705758,0.0004835026,0.00040548603,0.00052895915,0.0010244899,0.00033458276,0.0007166783,0.0009771287],"category_scores_gemma":[0.0024566795,0.00014319007,0.00036385967,0.000537625,0.000583771,0.0005331854,0.00066840986,0.00034176424,0.0005616666],"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.00036998984,0.000060986644,0.0033734445,0.0001345601,0.0000898582,0.0006110678,0.00020159468,0.784565,0.062345587,0.09550153,0.0013987755,0.051347632],"study_design_scores_gemma":[0.000017120106,0.00012887374,0.00080143975,0.000021592983,0.000021094975,0.00026903994,0.000046603538,0.94318974,0.046041217,0.007566782,0.0018815531,0.000014983578],"about_ca_topic_score_codex":0.0050783744,"about_ca_topic_score_gemma":0.0037158837,"teacher_disagreement_score":0.0050783744,"about_ca_system_score_codex":0.0009796405,"about_ca_system_score_gemma":0.0020115727,"threshold_uncertainty_score":0.010097623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30550343,0.002286076,0.6833886,0.00043169426,0.000042130257,0.000035156965,0.00027577035,0.00033720362,0.007700004],"genre_scores_gemma":[0.9912587,0.00048656377,0.007364968,0.000038115453,0.000028165265,0.000025416239,0.00007069856,0.000027202554,0.000700272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988305,0.0004432606,0.00004648147,0.00013677414,0.0003790702,0.00016393106],"domain_scores_gemma":[0.9930768,0.005467978,0.0005112432,0.0004178298,0.00043082435,0.00009527673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020835288,0.0006060347,0.00095419114,0.0007564955,0.0005353104,0.00094515027,0.0008291028,0.0008750557,0.0011440384],"category_scores_gemma":[0.0101594385,0.00042413778,0.0003592404,0.0010603034,0.0016676212,0.0021190967,0.0010412292,0.0005807124,0.00025466116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000484773,0.000012482696,0.00096386607,0.00005803977,0.000016869735,0.00025390915,0.00011210976,0.97510296,0.0014131898,0.017770572,0.00028412163,0.003963438],"study_design_scores_gemma":[0.000005835417,0.000026452402,0.0005523103,0.000009539716,0.0000075911307,0.00016535085,0.00004520303,0.9876133,0.0003624648,0.011017385,0.00018322056,0.000011329191],"about_ca_topic_score_codex":0.0022460844,"about_ca_topic_score_gemma":0.0016799266,"teacher_disagreement_score":0.0022460844,"about_ca_system_score_codex":0.0020225537,"about_ca_system_score_gemma":0.0005779058,"threshold_uncertainty_score":0.014674664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63657415,0.0026293134,0.33593926,0.0006688668,0.00006474464,0.00006865489,0.00074308895,0.000581906,0.022730066],"genre_scores_gemma":[0.9955023,0.00031183954,0.0031086088,0.00002277318,0.000022091222,0.000016605949,0.00006938996,0.00001725435,0.00092923874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886537,0.0004039205,0.000053204665,0.00011070715,0.0003186647,0.00024811382],"domain_scores_gemma":[0.99471706,0.0037242507,0.0005305923,0.0002774364,0.0006546637,0.00009595126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015470093,0.0009229207,0.0009890392,0.00051331124,0.0004394666,0.0010541053,0.00077884225,0.000975957,0.0021259584],"category_scores_gemma":[0.0061288457,0.0003694313,0.00047227496,0.0007875447,0.0011649634,0.0011121146,0.0010632018,0.0005741067,0.0003866061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026037422,0.000024135754,0.00169135,0.00012029236,0.000060657378,0.00071138307,0.00018064342,0.96718955,0.0053088786,0.016643772,0.00067684427,0.0071320496],"study_design_scores_gemma":[0.000009489392,0.00004686669,0.0008884885,0.000010315934,0.000020678544,0.00021213129,0.000053497057,0.9951256,0.00086407346,0.0025911673,0.00016446793,0.000013238698],"about_ca_topic_score_codex":0.0042349445,"about_ca_topic_score_gemma":0.002258552,"teacher_disagreement_score":0.0042349445,"about_ca_system_score_codex":0.0013882548,"about_ca_system_score_gemma":0.00051756785,"threshold_uncertainty_score":0.010072529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15298057,0.0027591002,0.8343578,0.00049913436,0.00004371694,0.000043354776,0.00025718263,0.00025817446,0.0088009],"genre_scores_gemma":[0.9823079,0.0016038272,0.013457874,0.00007568379,0.00007098777,0.00005280225,0.000110087974,0.000058293128,0.0022625842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904245,0.00036370233,0.000039625054,0.00010180473,0.00029304737,0.00015930369],"domain_scores_gemma":[0.9922537,0.0062407185,0.0005639186,0.00024228453,0.0005985709,0.0001008939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380062,0.00084398995,0.001090094,0.0010008104,0.00042992018,0.000930806,0.00075647177,0.0007180904,0.0015770677],"category_scores_gemma":[0.007927967,0.00033770196,0.00058076443,0.0010640505,0.0011744832,0.0015184995,0.0009264166,0.0008970581,0.00027048122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041763313,0.000017951592,0.0013971259,0.000085924665,0.00003298033,0.00031878307,0.00013012675,0.9648747,0.0015462216,0.025386402,0.00047934003,0.0056886193],"study_design_scores_gemma":[0.0000018493032,0.000014070723,0.00044026045,0.000007763125,0.000008009736,0.000074398784,0.000035158915,0.99423474,0.00025997014,0.0047656856,0.00015149196,0.000006548345],"about_ca_topic_score_codex":0.0036550334,"about_ca_topic_score_gemma":0.0024690165,"teacher_disagreement_score":0.0036550334,"about_ca_system_score_codex":0.0016360647,"about_ca_system_score_gemma":0.00065999164,"threshold_uncertainty_score":0.011870503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16766591,0.0008907778,0.8225439,0.00026570732,0.000118319855,0.0000636806,0.000047248497,0.00028507292,0.008119338],"genre_scores_gemma":[0.8733469,0.00026563695,0.124497615,0.000108687884,0.000042850003,0.000065132284,0.000024863808,0.000012008478,0.0016362913],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996846,0.00010221154,0.00002012012,0.00005537243,0.0000817082,0.000056012857],"domain_scores_gemma":[0.99935216,0.00030221447,0.000101977406,0.00015490463,0.000061357736,0.000027402279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031734112,0.00034526555,0.00027003547,0.0002558649,0.00027383314,0.00037011516,0.0004681045,0.00046998454,0.00072637334],"category_scores_gemma":[0.0010298039,0.00013054542,0.00016356574,0.00039387977,0.0006139969,0.00061779446,0.00057041604,0.00039211503,0.00021379009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00127867,0.00014779353,0.001910236,0.00049781636,0.00008163988,0.0007205427,0.00058380404,0.13191877,0.43736088,0.19399048,0.0013262555,0.23018311],"study_design_scores_gemma":[0.0002864055,0.001032237,0.0011691368,0.00007561884,0.00008088606,0.0018794248,0.00012537894,0.692044,0.22991695,0.059056327,0.014193509,0.00014011624],"about_ca_topic_score_codex":0.000113485374,"about_ca_topic_score_gemma":0.00015995248,"teacher_disagreement_score":0.00072637334,"about_ca_system_score_codex":0.00022011009,"about_ca_system_score_gemma":0.00026357835,"threshold_uncertainty_score":0.0024299622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6038422,0.0010401867,0.37693122,0.0017633125,0.00042234626,0.0005516246,0.00017458158,0.0068709347,0.008403605],"genre_scores_gemma":[0.9609382,0.00011876031,0.036810238,0.00018292059,0.000051788316,0.00005984539,0.00007638824,0.0001160649,0.0016457374],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966426,0.0008277212,0.0002617657,0.00043540995,0.00087462354,0.0009578471],"domain_scores_gemma":[0.97528195,0.009060779,0.003305646,0.007403508,0.002632602,0.002315415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004857189,0.0011896294,0.0014953534,0.001092035,0.0025038372,0.00321213,0.0026760076,0.0020551942,0.0033253455],"category_scores_gemma":[0.028949784,0.00054748915,0.0005984588,0.00066350226,0.0017267714,0.0067512286,0.004827469,0.0021983176,0.0011933555],"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.00627206,0.002976235,0.058278576,0.0007279023,0.00037591445,0.0016999211,0.0031084882,0.20220731,0.15227821,0.100045174,0.024834586,0.4471957],"study_design_scores_gemma":[0.00029337523,0.0008227456,0.0022235943,0.000048876096,0.00009559187,0.00056960096,0.00045630714,0.93764436,0.029134734,0.019396309,0.009236728,0.000077763536],"about_ca_topic_score_codex":0.003995556,"about_ca_topic_score_gemma":0.003787967,"teacher_disagreement_score":0.004857189,"about_ca_system_score_codex":0.0014513279,"about_ca_system_score_gemma":0.0028727876,"threshold_uncertainty_score":0.025687516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009907058,0.00011775361,0.98793215,0.00008110332,0.000043089385,0.000060267255,0.00005777915,0.00035135396,0.0014493255],"genre_scores_gemma":[0.13558385,0.00021390441,0.8586009,0.000080196325,0.0000380944,0.00020025915,0.00024450303,0.000080267106,0.004958029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.000111390036,0.00003739698,0.00008235347,0.00026803106,0.000035046618],"domain_scores_gemma":[0.99933904,0.00020661668,0.000062984065,0.00013147804,0.00023755185,0.000022289545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045495213,0.00052514864,0.0006508292,0.0005807824,0.0005474808,0.0005691208,0.0010704793,0.0006519399,0.0017666884],"category_scores_gemma":[0.0015572016,0.00028549533,0.00031475408,0.0007189045,0.00045996904,0.0007011497,0.0006617561,0.0008013456,0.00068385975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032149447,0.000072900715,0.001020133,0.00022643596,0.00006167362,0.00019827849,0.00013954546,0.17038187,0.06969008,0.056536105,0.00335081,0.69800067],"study_design_scores_gemma":[0.0000634102,0.0000775988,0.00035176933,0.000016909235,0.00001916111,0.00027867622,0.000013306555,0.93334717,0.04737129,0.011905287,0.0065274085,0.00002792068],"about_ca_topic_score_codex":0.0016051274,"about_ca_topic_score_gemma":0.0026658666,"teacher_disagreement_score":0.0017666884,"about_ca_system_score_codex":0.00055042957,"about_ca_system_score_gemma":0.0015683948,"threshold_uncertainty_score":0.005910158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035414055,0.0019718446,0.98660547,0.00022870016,0.00017894169,0.000035321165,0.0001359416,0.00025041692,0.007051871],"genre_scores_gemma":[0.46399397,0.016910711,0.47852543,0.0009457654,0.0012333577,0.0006274756,0.0007869223,0.0008194625,0.03615692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794155,0.00040358157,0.00008743276,0.00018867978,0.0011733978,0.00020534077],"domain_scores_gemma":[0.99486285,0.0032669308,0.00033785723,0.0005691313,0.0008754428,0.00008769121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025375301,0.0019143852,0.0013233538,0.001616887,0.0005955461,0.0019231885,0.0027807532,0.001892369,0.0034356674],"category_scores_gemma":[0.018918779,0.00067014515,0.0009085741,0.0016953303,0.001737294,0.003814166,0.0015373484,0.0034871723,0.002378869],"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.00005530411,0.00003426027,0.00056578603,0.00016260982,0.00003359851,0.000252128,0.00021894234,0.7164287,0.0026813613,0.24484187,0.004455809,0.030269606],"study_design_scores_gemma":[0.0000060626944,0.000011581326,0.000128894,0.000036177033,0.00000843229,0.00011315759,0.000014484241,0.9534508,0.00060372386,0.042601686,0.0030058848,0.000019037214],"about_ca_topic_score_codex":0.0042938455,"about_ca_topic_score_gemma":0.002485644,"teacher_disagreement_score":0.0042938455,"about_ca_system_score_codex":0.0018794521,"about_ca_system_score_gemma":0.00094515557,"threshold_uncertainty_score":0.01363647},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028408466,0.00046547828,0.96108574,0.00018045153,0.00006927181,0.00014373411,0.00039357334,0.00034646477,0.008906968],"genre_scores_gemma":[0.34583905,0.0008522014,0.6424163,0.0002533342,0.00008539884,0.00046764236,0.00083179364,0.00015741262,0.009096856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943954,0.00012073258,0.000047693204,0.00009493342,0.00024649606,0.000050562878],"domain_scores_gemma":[0.9990827,0.0002919108,0.00011606836,0.00020611423,0.00024907687,0.000054180728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041610163,0.00060540944,0.00054473407,0.00061522616,0.0004293392,0.0007646723,0.00095559127,0.0005228848,0.0037358266],"category_scores_gemma":[0.002435151,0.000260377,0.0003494186,0.0011919286,0.0006744649,0.0011138078,0.0012069213,0.00079040055,0.0011713014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044241085,0.00008975008,0.00076528906,0.000488892,0.000037942824,0.0004455734,0.00019328283,0.12527688,0.103851005,0.5584436,0.0040677236,0.20589769],"study_design_scores_gemma":[0.000091236216,0.00034681844,0.0006681744,0.0001347457,0.000030432566,0.001133077,0.000068533314,0.56933177,0.11557091,0.26468652,0.047799934,0.0001379753],"about_ca_topic_score_codex":0.00062076095,"about_ca_topic_score_gemma":0.00074328383,"teacher_disagreement_score":0.0037358266,"about_ca_system_score_codex":0.00042574617,"about_ca_system_score_gemma":0.00088400644,"threshold_uncertainty_score":0.012497604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49835438,0.0004039352,0.49074626,0.00022548051,0.000012085123,0.00017332021,0.00035869464,0.00044377949,0.009282101],"genre_scores_gemma":[0.87137467,0.00022452704,0.12528634,0.00006288,0.00001102836,0.00013904911,0.0005870318,0.00005097571,0.002263562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.000066819906,0.000021594335,0.00006382546,0.00010620106,0.000044228105],"domain_scores_gemma":[0.9983726,0.0011356622,0.0001512242,0.0001642378,0.00012381085,0.00005252084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036031497,0.0002698445,0.00037209157,0.00084995036,0.00035974727,0.0005888405,0.0005196787,0.00034538293,0.0015880112],"category_scores_gemma":[0.0036950905,0.00023235496,0.00028876498,0.0009499676,0.00062826107,0.0009202325,0.00064848573,0.0004853429,0.00018841134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005552658,0.00023503721,0.010501134,0.00045359944,0.00007240343,0.00052712276,0.0006135304,0.520075,0.06294985,0.22730432,0.0027475555,0.17396514],"study_design_scores_gemma":[0.000029315963,0.0000755759,0.0009450664,0.000021010439,0.000012932065,0.00017194476,0.000045115306,0.93397254,0.011835717,0.05175918,0.0011170252,0.0000144639835],"about_ca_topic_score_codex":0.0011128024,"about_ca_topic_score_gemma":0.0017663816,"teacher_disagreement_score":0.0015880112,"about_ca_system_score_codex":0.000414735,"about_ca_system_score_gemma":0.0008152393,"threshold_uncertainty_score":0.005312443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22109605,0.002389326,0.76280516,0.0007759855,0.000044928605,0.000071450966,0.00013590003,0.00016671173,0.012514547],"genre_scores_gemma":[0.99022514,0.0012301791,0.007240151,0.000050360886,0.00003922757,0.000042821022,0.000054699492,0.000016574284,0.0011008551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.000110827095,0.000010700551,0.00003856251,0.00009519205,0.000052735144],"domain_scores_gemma":[0.99825495,0.0011099529,0.00022512523,0.000059574642,0.0002983167,0.000052050906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390628,0.00046953716,0.0003349156,0.0011347748,0.0004331531,0.000573947,0.0006561227,0.00052007166,0.00085888745],"category_scores_gemma":[0.0044583813,0.00019185287,0.00029088542,0.000841042,0.0007134553,0.0009761908,0.0006261079,0.00039561215,0.00015135306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002782634,0.0000137057705,0.0017155185,0.00005880643,0.000016840324,0.00023950536,0.00013727715,0.9422028,0.0028180166,0.04555215,0.00059394713,0.006623489],"study_design_scores_gemma":[0.0000019829406,0.000019053548,0.00046970323,0.0000057746856,0.0000073275355,0.000079282414,0.00004831158,0.9898498,0.00020856905,0.009013656,0.00029114555,0.000005342112],"about_ca_topic_score_codex":0.0060983226,"about_ca_topic_score_gemma":0.0037504272,"teacher_disagreement_score":0.0060983226,"about_ca_system_score_codex":0.0010186009,"about_ca_system_score_gemma":0.00048992323,"threshold_uncertainty_score":0.012125671},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06920928,0.00039148892,0.92912596,0.00010127897,0.00003569975,0.00002075015,0.000014751856,0.00015532026,0.0009454424],"genre_scores_gemma":[0.77325916,0.000505534,0.22376849,0.000088654495,0.00010710624,0.000040562325,0.00003440668,0.000035964546,0.0021600667],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995135,0.000108355925,0.000024411294,0.00007098353,0.00024036512,0.00004240132],"domain_scores_gemma":[0.9995414,0.00019596286,0.00010601692,0.00004499188,0.00009462996,0.000016960928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005738799,0.00057404157,0.00057451916,0.00026364822,0.00030743837,0.0005240731,0.00044016505,0.0006218313,0.00043392304],"category_scores_gemma":[0.001804467,0.0002929885,0.00027179884,0.00032229943,0.00063856127,0.00103606,0.0006780017,0.0004569597,0.00020255582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008001116,0.00014801763,0.0042686076,0.00039739234,0.00013855171,0.00061671843,0.00030186554,0.33673814,0.34455416,0.022344505,0.0008154001,0.2888765],"study_design_scores_gemma":[0.00003291909,0.00016189259,0.001039377,0.000021202479,0.000035255853,0.00042299944,0.00003684381,0.9073562,0.0849067,0.004978655,0.0009706739,0.000037232916],"about_ca_topic_score_codex":0.00044513034,"about_ca_topic_score_gemma":0.0006373394,"teacher_disagreement_score":0.0006218313,"about_ca_system_score_codex":0.00033802295,"about_ca_system_score_gemma":0.00046976414,"threshold_uncertainty_score":0.0030349493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06055177,0.000535251,0.93658566,0.0001455641,0.00007738736,0.00009532817,0.00006721108,0.00050906534,0.0014327591],"genre_scores_gemma":[0.61519986,0.0003789668,0.38221416,0.0001013642,0.00008936672,0.00011564471,0.00010295113,0.00005450097,0.0017431508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.000322942,0.00008871662,0.0001130388,0.00040116036,0.00006669652],"domain_scores_gemma":[0.9977209,0.00059518474,0.0004627148,0.0007665999,0.00035336261,0.00010123854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010115635,0.0005735587,0.00048758075,0.0005375486,0.000650446,0.000433392,0.0009919708,0.00062137446,0.0007768351],"category_scores_gemma":[0.003728975,0.00024549186,0.00047490696,0.0005127784,0.0007276748,0.0009803935,0.00097440253,0.0007399328,0.00041590453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012960683,0.0001416003,0.0031695408,0.00054403045,0.00013852053,0.0012820429,0.0008987295,0.15950756,0.31084344,0.112782046,0.0018721579,0.40752438],"study_design_scores_gemma":[0.00017192638,0.0010826542,0.0014799152,0.00011371229,0.000115805095,0.0028435502,0.000082516046,0.7056189,0.2461427,0.02578695,0.016355835,0.00020548597],"about_ca_topic_score_codex":0.00023430285,"about_ca_topic_score_gemma":0.00024061532,"teacher_disagreement_score":0.0010115635,"about_ca_system_score_codex":0.00040062293,"about_ca_system_score_gemma":0.00061113667,"threshold_uncertainty_score":0.0053497553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13452932,0.0016071673,0.8216374,0.0011701705,0.00012583626,0.000088894325,0.00049830845,0.00027184907,0.04007096],"genre_scores_gemma":[0.95242184,0.0010586662,0.04188519,0.0002569528,0.000056946265,0.00014276845,0.00024301137,0.000056736913,0.003877806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.00026696458,0.000020826616,0.00013568271,0.00026125953,0.00018168788],"domain_scores_gemma":[0.99415684,0.0045756875,0.00038497345,0.000306764,0.00040379204,0.00017199846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015358727,0.00062912836,0.00060724805,0.0009965232,0.0007485075,0.0012628008,0.0014397927,0.0009835393,0.0032202424],"category_scores_gemma":[0.006592476,0.00026566887,0.00049027917,0.0006911528,0.0014135863,0.0021132324,0.0010586426,0.0020064416,0.00023934181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008838611,0.000039084032,0.00033851663,0.00011820772,0.00002114795,0.00011715982,0.00013701628,0.4009312,0.00455912,0.58000207,0.0024701194,0.0111779915],"study_design_scores_gemma":[0.000011476752,0.000052991847,0.00021111929,0.000029583001,0.000011045909,0.00012629358,0.00006742631,0.7689247,0.0016800304,0.22490898,0.0039524734,0.000023976609],"about_ca_topic_score_codex":0.002206363,"about_ca_topic_score_gemma":0.0023492877,"teacher_disagreement_score":0.0032202424,"about_ca_system_score_codex":0.0023977798,"about_ca_system_score_gemma":0.0008478711,"threshold_uncertainty_score":0.017397165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31656775,0.0034954448,0.62407047,0.0016980072,0.0001568576,0.00007898881,0.0005917125,0.00042520597,0.052915532],"genre_scores_gemma":[0.9841957,0.0010065712,0.012173912,0.00016954931,0.00006597564,0.00008298022,0.000094250485,0.00003609834,0.0021751106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00044678507,0.000037858732,0.0001714574,0.00035229442,0.00033597884],"domain_scores_gemma":[0.9941426,0.0042930036,0.00033998743,0.000498638,0.00061756937,0.000108161235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649498,0.00069179304,0.0010079478,0.00073661347,0.00053107087,0.0018100138,0.0011120087,0.0009949764,0.0023234875],"category_scores_gemma":[0.008744347,0.00025605963,0.00040774894,0.0010232939,0.0027892338,0.0029566092,0.0014978425,0.00092912104,0.00041619185],"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.00024032884,0.000035296667,0.0002621014,0.00015266983,0.000041908756,0.00018836914,0.00019183634,0.58560765,0.004301214,0.39511874,0.0018552941,0.012004551],"study_design_scores_gemma":[0.00002468862,0.00007713315,0.00023858382,0.00005326942,0.000020780548,0.00022721059,0.00008452237,0.84993553,0.0027668425,0.14501005,0.001522733,0.000038587783],"about_ca_topic_score_codex":0.0021435816,"about_ca_topic_score_gemma":0.0008732342,"teacher_disagreement_score":0.0023234875,"about_ca_system_score_codex":0.001985458,"about_ca_system_score_gemma":0.0016438774,"threshold_uncertainty_score":0.014405608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31908244,0.0015505361,0.675443,0.00036805114,0.00004211608,0.00007317019,0.00010944152,0.00022908085,0.0031021389],"genre_scores_gemma":[0.9809233,0.00060603465,0.017372081,0.000023528302,0.000025305384,0.000027828304,0.000028205843,0.000014616094,0.000979073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980205,0.0008342977,0.000091859205,0.00021612633,0.0005438719,0.00029334906],"domain_scores_gemma":[0.9771494,0.018551614,0.0022022172,0.00087800133,0.00108864,0.00013004817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040493635,0.0014510632,0.0015787248,0.00080691284,0.00039829794,0.0010885488,0.0010349015,0.0013196768,0.00039172816],"category_scores_gemma":[0.01661766,0.00061257713,0.00053641136,0.0010384792,0.0018347899,0.0022135242,0.000986106,0.0007061428,0.00016688432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017753418,0.000032615855,0.0014358727,0.00010689791,0.00006124409,0.0004784764,0.00015331926,0.9752838,0.0031536978,0.01396926,0.00012728325,0.0050200927],"study_design_scores_gemma":[0.000012731627,0.000066005894,0.00036222802,0.0000068226955,0.000025943036,0.0001379187,0.000027725839,0.9948968,0.0017403227,0.0026203014,0.00008740799,0.000015753174],"about_ca_topic_score_codex":0.003544305,"about_ca_topic_score_gemma":0.0021916379,"teacher_disagreement_score":0.0040493635,"about_ca_system_score_codex":0.0012202495,"about_ca_system_score_gemma":0.000751253,"threshold_uncertainty_score":0.021415293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024336647,0.00043344358,0.96844494,0.00035644154,0.00018966869,0.00006297278,0.00003673783,0.00044917298,0.00568998],"genre_scores_gemma":[0.8152054,0.0004183624,0.17761955,0.00021858675,0.00021815565,0.00014519595,0.00006369863,0.00007832114,0.0060327323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.00013102854,0.000042702828,0.00015221669,0.00027198595,0.00013655095],"domain_scores_gemma":[0.9987835,0.00037023047,0.00009537586,0.00034339598,0.00029945147,0.0001079796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010340081,0.0005326465,0.00063003233,0.00043595542,0.0007515742,0.0012592167,0.0022707593,0.0006649975,0.0037263525],"category_scores_gemma":[0.0025570297,0.00027745898,0.00030187317,0.0007875132,0.0009962076,0.002078626,0.0011969922,0.0015864068,0.00059573085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005047434,0.0003121403,0.001458959,0.00017884285,0.00006148653,0.00028999688,0.00028471512,0.27921024,0.05071085,0.39825118,0.0089274505,0.2598094],"study_design_scores_gemma":[0.00006827521,0.00010634055,0.00015365878,0.000011124383,0.000027360644,0.00013047644,0.000020662746,0.91387874,0.0124543,0.062039968,0.0110764755,0.00003269996],"about_ca_topic_score_codex":0.001824197,"about_ca_topic_score_gemma":0.0019283217,"teacher_disagreement_score":0.0037263525,"about_ca_system_score_codex":0.0009835426,"about_ca_system_score_gemma":0.0014972157,"threshold_uncertainty_score":0.012465954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8309012,0.0008705796,0.16163509,0.00024511278,0.00003968998,0.000043613956,0.00011524735,0.00012566744,0.006023837],"genre_scores_gemma":[0.9872307,0.00015297001,0.011486771,0.000016445496,0.000010520581,0.0000074151462,0.000014584888,0.0000033992167,0.0010772608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.000069451526,0.000008571478,0.000039074348,0.00008700745,0.00003893664],"domain_scores_gemma":[0.99922097,0.00044288448,0.00014939591,0.000056530593,0.00010360528,0.000026629004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004485182,0.0005985168,0.00048139706,0.00020136558,0.00059018534,0.0006347567,0.0005154317,0.0006140252,0.00077394187],"category_scores_gemma":[0.0010544233,0.0001754795,0.00024989853,0.00025239697,0.0005885112,0.000842919,0.00055252865,0.0003284286,0.00017949236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012582884,0.00032932012,0.007906627,0.00063568767,0.00022654688,0.0019124806,0.00069710717,0.5034129,0.3496788,0.07169109,0.0011614774,0.061089624],"study_design_scores_gemma":[0.00004305108,0.0004651069,0.0010223588,0.000012239953,0.00007617313,0.00049251335,0.0000916742,0.95976686,0.031012751,0.0060119866,0.0009645054,0.000040818333],"about_ca_topic_score_codex":0.0011248308,"about_ca_topic_score_gemma":0.0020618367,"teacher_disagreement_score":0.0011248308,"about_ca_system_score_codex":0.00041413112,"about_ca_system_score_gemma":0.00040279134,"threshold_uncertainty_score":0.0030047894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030706348,0.000119612654,0.9681267,0.000028011276,0.000011515501,0.000018106477,0.00004095984,0.00038924947,0.0005593946],"genre_scores_gemma":[0.5382855,0.00021641614,0.46062768,0.000027626787,0.000013902766,0.000041697305,0.00010911829,0.00006114039,0.00061689335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933654,0.00016956571,0.000035967496,0.00008079639,0.00032659748,0.000050425006],"domain_scores_gemma":[0.99864155,0.0007137091,0.00018185578,0.00018409493,0.00024799438,0.00003082408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364617,0.0005771121,0.0005730617,0.00069914194,0.00032393422,0.000693313,0.0006122155,0.00041274677,0.0005993156],"category_scores_gemma":[0.004776802,0.00028881067,0.00020120302,0.00042705217,0.0006188258,0.0011461447,0.0007309525,0.0007738836,0.00020380593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027975434,0.00005673346,0.0032910928,0.00022412074,0.000055364297,0.00019903177,0.0003474963,0.6460323,0.09420364,0.037401788,0.0008889396,0.21701975],"study_design_scores_gemma":[0.000008168438,0.000032027183,0.00035533583,0.000011641889,0.00000572732,0.00007180124,0.000017674678,0.9662837,0.0281037,0.0047399425,0.00035101373,0.000019302533],"about_ca_topic_score_codex":0.0015466448,"about_ca_topic_score_gemma":0.0019377936,"teacher_disagreement_score":0.0015466448,"about_ca_system_score_codex":0.00048517872,"about_ca_system_score_gemma":0.000751798,"threshold_uncertainty_score":0.0035202503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049325414,0.00019780712,0.98748404,0.00012215505,0.00015513228,0.00010739449,0.00022457854,0.00086590793,0.0059103793],"genre_scores_gemma":[0.14860663,0.0010831499,0.8304265,0.0003916879,0.00020341054,0.00025766253,0.0011615427,0.000234246,0.017635288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994055,0.00007543015,0.000033089473,0.00007044904,0.00036578838,0.000049755632],"domain_scores_gemma":[0.9993144,0.00013429197,0.000045895715,0.00018163882,0.00028850668,0.000035218105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040645857,0.00071341894,0.00065821235,0.00054195634,0.0004883419,0.00090375636,0.0010164804,0.0005206284,0.004024907],"category_scores_gemma":[0.0015586272,0.00029565394,0.00049895473,0.00056512456,0.0005087136,0.00088712847,0.00088683644,0.0014956233,0.0034789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007531113,0.00010678548,0.0006270917,0.00052684057,0.00008822923,0.0007581007,0.00018892299,0.118587166,0.30307987,0.16175762,0.012959934,0.40056634],"study_design_scores_gemma":[0.00015892451,0.00030782385,0.00048331454,0.000083516425,0.00010713407,0.001938127,0.000051012415,0.6633887,0.2192892,0.042068712,0.07195946,0.00016409883],"about_ca_topic_score_codex":0.0020705606,"about_ca_topic_score_gemma":0.0040763915,"teacher_disagreement_score":0.004024907,"about_ca_system_score_codex":0.00044925994,"about_ca_system_score_gemma":0.001852763,"threshold_uncertainty_score":0.01346463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08266108,0.0062861377,0.88724124,0.0015638528,0.0002663304,0.00008905488,0.00027611697,0.00025661106,0.021359429],"genre_scores_gemma":[0.8857031,0.003827649,0.09809843,0.00025337862,0.00030123047,0.00016233296,0.00019672135,0.00012030691,0.011336926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949527,0.00026298704,0.000014184522,0.00006721392,0.00008970795,0.00007062678],"domain_scores_gemma":[0.9993887,0.00041251993,0.00007126862,0.000021159667,0.00007109457,0.000035207788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730549,0.0006826066,0.00064359576,0.00037005078,0.00049195794,0.0014491216,0.00041190622,0.0008494706,0.0015551375],"category_scores_gemma":[0.002029085,0.00046750114,0.00019786926,0.0009166713,0.00065919483,0.0007416716,0.0005531336,0.0006958313,0.00025786084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045421995,0.000024780229,0.00022939824,0.00006336368,0.000013049052,0.000039838196,0.000024105226,0.9649535,0.00091789133,0.01764001,0.001224847,0.014823923],"study_design_scores_gemma":[0.000011696417,0.000014641381,0.000077093864,0.0000055076616,0.000004385144,0.0000086852015,0.000014386893,0.9900552,0.00031974365,0.008552546,0.0009329671,0.0000032626963],"about_ca_topic_score_codex":0.0082217455,"about_ca_topic_score_gemma":0.004829531,"teacher_disagreement_score":0.0082217455,"about_ca_system_score_codex":0.0015880823,"about_ca_system_score_gemma":0.0012655074,"threshold_uncertainty_score":0.016347766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015544592,0.00015306352,0.9815247,0.00007786624,0.000031757918,0.000027172484,0.000025498257,0.00039781,0.0022175177],"genre_scores_gemma":[0.4288836,0.00042666154,0.56604207,0.000110749985,0.00006654584,0.00020397955,0.00015030014,0.000106853535,0.004009206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994529,0.0001563594,0.000026610482,0.000048694852,0.0002655695,0.00004985551],"domain_scores_gemma":[0.99908173,0.0004069849,0.00006336966,0.00016588111,0.00026202522,0.000020005693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618687,0.0005041468,0.00032633432,0.00037560792,0.0003457377,0.00049637817,0.00053297833,0.00044505866,0.0011562185],"category_scores_gemma":[0.002203803,0.00023016325,0.00028511832,0.0005063933,0.00050896924,0.0006162702,0.00057237933,0.00060769496,0.00045686887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039185394,0.000113389935,0.001053802,0.00019643699,0.00008493518,0.00031732587,0.00020470168,0.40626937,0.09078492,0.15170224,0.0039392556,0.3449417],"study_design_scores_gemma":[0.000020949723,0.00006281469,0.00014470592,0.0000095244495,0.000010280546,0.00010173937,0.0000065902373,0.96010804,0.019769503,0.017518403,0.0022358096,0.000011668976],"about_ca_topic_score_codex":0.00083156704,"about_ca_topic_score_gemma":0.0011853786,"teacher_disagreement_score":0.0011562185,"about_ca_system_score_codex":0.00044560904,"about_ca_system_score_gemma":0.0008054836,"threshold_uncertainty_score":0.0038679242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08705599,0.0104485825,0.8930557,0.0015770652,0.00018901857,0.00022659526,0.0006994005,0.002072186,0.0046753865],"genre_scores_gemma":[0.8889016,0.0022840942,0.105020575,0.0005098569,0.00050593115,0.0004105222,0.00079075835,0.0002726822,0.0013039702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98364913,0.010359831,0.0007659026,0.0019598096,0.00260936,0.0006558782],"domain_scores_gemma":[0.914952,0.07021727,0.005851178,0.0043544574,0.0040309015,0.00059422554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017930305,0.001950617,0.0031787024,0.006209061,0.00054241036,0.0028893542,0.0016111088,0.0031348716,0.0013543088],"category_scores_gemma":[0.10993769,0.00053670927,0.0016911132,0.003337359,0.001978242,0.0028597768,0.0016487946,0.0017169652,0.0007504184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015731204,0.00026429334,0.04463809,0.0010332731,0.0013092044,0.0016145224,0.0006879221,0.5143769,0.0073165465,0.053744074,0.0076389145,0.3658032],"study_design_scores_gemma":[0.000038197024,0.0005723031,0.014218383,0.00013079568,0.00019006249,0.0026092515,0.000115400384,0.93810916,0.0036210895,0.03680884,0.0034605954,0.00012581162],"about_ca_topic_score_codex":0.0014258757,"about_ca_topic_score_gemma":0.00047377485,"teacher_disagreement_score":0.017930305,"about_ca_system_score_codex":0.0016122282,"about_ca_system_score_gemma":0.00091922254,"threshold_uncertainty_score":0.094825625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072715795,0.00009542135,0.9922754,0.000048488844,0.000006967968,0.000012554609,0.000013123708,0.00006263222,0.00021386286],"genre_scores_gemma":[0.60201484,0.0003747419,0.3955081,0.00013091565,0.000061652914,0.00016593428,0.00012860274,0.000095512485,0.0015196595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983253,0.00084497064,0.000090681206,0.00034546465,0.0002642788,0.00012925177],"domain_scores_gemma":[0.99726474,0.0017141106,0.00030232331,0.00032161744,0.0003036936,0.00009352374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00184013,0.00089603855,0.0014980756,0.00066188286,0.0005137459,0.00081158476,0.001268133,0.0008831826,0.0012653713],"category_scores_gemma":[0.007979754,0.00045653325,0.0003503748,0.0013563315,0.0013794834,0.0024081315,0.0015733645,0.0010620458,0.000389151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036225122,0.00006108033,0.00057336484,0.000094335766,0.000038378224,0.0000471229,0.00014150688,0.8954441,0.005659817,0.029956454,0.0007976477,0.066823944],"study_design_scores_gemma":[0.000014036342,0.000026049458,0.00010147482,0.0000038361586,0.000005778363,0.000013020574,0.000011155202,0.98693293,0.0010950259,0.011577245,0.00021242963,0.000006954864],"about_ca_topic_score_codex":0.0010177847,"about_ca_topic_score_gemma":0.0011336375,"teacher_disagreement_score":0.00184013,"about_ca_system_score_codex":0.00066387065,"about_ca_system_score_gemma":0.00063660514,"threshold_uncertainty_score":0.00973165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034030485,0.00030490037,0.99291223,0.000112423615,0.000053617714,0.000009787659,0.00001842362,0.00014683767,0.0030387223],"genre_scores_gemma":[0.4734821,0.0034144144,0.5091115,0.00059461157,0.00032346358,0.00015352032,0.0002315823,0.0004558965,0.01223284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873084,0.00031362966,0.000057084675,0.00014026399,0.00062512467,0.00013305916],"domain_scores_gemma":[0.9967656,0.0020933058,0.00016822078,0.00044736173,0.0004742693,0.000051222254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026818363,0.0012032298,0.00078157685,0.0010260248,0.00055922323,0.0015421603,0.0018900863,0.0013073232,0.0018946311],"category_scores_gemma":[0.011061035,0.00051857624,0.0009990304,0.0010311101,0.0013013919,0.0033291532,0.0009223418,0.0025090564,0.0015332819],"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.00011405759,0.0000657338,0.0012531587,0.00018425377,0.000049341907,0.00045915684,0.00032771938,0.6235732,0.009031717,0.31088015,0.0031639445,0.050897516],"study_design_scores_gemma":[0.0000029912283,0.000010701607,0.000085980675,0.000018460165,0.000006449634,0.00014057965,0.000016310938,0.98019767,0.00089958915,0.016740942,0.0018695537,0.000010737612],"about_ca_topic_score_codex":0.0029984415,"about_ca_topic_score_gemma":0.0018971647,"teacher_disagreement_score":0.0029984415,"about_ca_system_score_codex":0.0012647135,"about_ca_system_score_gemma":0.0009675845,"threshold_uncertainty_score":0.014183104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018417077,0.0005225858,0.97442186,0.0002390704,0.00006933804,0.00003490335,0.0000719424,0.00014348734,0.006079734],"genre_scores_gemma":[0.8795831,0.0012236462,0.10572377,0.00029461004,0.00031929943,0.00020570117,0.0001021405,0.00009181785,0.012455905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986539,0.0004067629,0.000048496047,0.00028768892,0.00040455043,0.00019861397],"domain_scores_gemma":[0.9986563,0.00058286404,0.00023986347,0.00020487087,0.00022478121,0.00009134343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015911737,0.00070317026,0.00095457205,0.0007507234,0.00053855637,0.0013457182,0.0031852575,0.0014566871,0.001673773],"category_scores_gemma":[0.003133565,0.00043376174,0.001146746,0.00078381476,0.0010586593,0.002655612,0.0010206739,0.0012564713,0.0006839236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009744565,0.0000593818,0.0005844475,0.00006042776,0.000047203048,0.0003403942,0.00018662527,0.7640637,0.005558673,0.21748,0.0014253121,0.010096384],"study_design_scores_gemma":[0.000008194948,0.000033745335,0.00009531339,0.0000051877087,0.000010976809,0.00009278405,0.000014026089,0.98431027,0.00029553488,0.014172687,0.0009474092,0.000013801565],"about_ca_topic_score_codex":0.0021292446,"about_ca_topic_score_gemma":0.0012853305,"teacher_disagreement_score":0.0031852575,"about_ca_system_score_codex":0.0010361198,"about_ca_system_score_gemma":0.00054278685,"threshold_uncertainty_score":0.008415043},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018815475,0.00036187324,0.9766392,0.000113834474,0.000021409396,0.0000138933865,0.000046410103,0.0002781265,0.003709763],"genre_scores_gemma":[0.87397504,0.0010373003,0.1213615,0.00011377278,0.00007274128,0.00009326893,0.00012004966,0.00014313823,0.0030832866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990658,0.00035017778,0.00004063875,0.00007589691,0.0003554773,0.000111957284],"domain_scores_gemma":[0.9978102,0.0014078806,0.00022494789,0.00025488622,0.00026425833,0.00003779992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016137257,0.00096127467,0.0011167885,0.00059417717,0.00033180395,0.00088825123,0.0011097869,0.00091916695,0.0014088216],"category_scores_gemma":[0.007009273,0.0005123016,0.0005723537,0.0006246438,0.0010000046,0.0016093104,0.0009466841,0.0011537513,0.0008535034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056296318,0.000009163324,0.0005351249,0.000056645185,0.000014908675,0.00033571216,0.000116779025,0.9444401,0.00334381,0.041016564,0.0005214778,0.009553332],"study_design_scores_gemma":[0.000002998892,0.000008088326,0.000074442156,0.000007420043,0.0000027313818,0.000050899376,0.000006203327,0.9931764,0.0005765197,0.0059140488,0.0001753305,0.000004880949],"about_ca_topic_score_codex":0.0018890334,"about_ca_topic_score_gemma":0.0010754659,"teacher_disagreement_score":0.0018890334,"about_ca_system_score_codex":0.0009572898,"about_ca_system_score_gemma":0.0006748565,"threshold_uncertainty_score":0.008534253},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2762856,0.005781771,0.68910635,0.0012576587,0.0001596759,0.00011368019,0.00034646952,0.0006381995,0.02631057],"genre_scores_gemma":[0.98714125,0.0010990626,0.009386621,0.000056634435,0.000056708748,0.000040395636,0.00007696342,0.000032214164,0.0021101467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749017,0.000895575,0.0000913651,0.00024926013,0.0008339151,0.00043975952],"domain_scores_gemma":[0.99422425,0.0037837683,0.00064966537,0.0003207644,0.00092288706,0.00009872153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023182924,0.0016145748,0.0012358463,0.001017549,0.00069316436,0.001727698,0.0009080293,0.0013218536,0.002368392],"category_scores_gemma":[0.007867679,0.0005195591,0.00051727763,0.0010784479,0.0013196453,0.0018232908,0.0015378196,0.0007901163,0.0006896757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053545646,0.000046693167,0.0015952266,0.00019915985,0.00009191542,0.00041531603,0.00016433142,0.9056155,0.014840142,0.05903323,0.00088214816,0.016580788],"study_design_scores_gemma":[0.0000142575045,0.00011680226,0.00028925602,0.000013367424,0.000026303487,0.00017552935,0.000029660376,0.9900372,0.0027261341,0.0061179437,0.00043160556,0.00002198378],"about_ca_topic_score_codex":0.0034650466,"about_ca_topic_score_gemma":0.0020834873,"teacher_disagreement_score":0.0034650466,"about_ca_system_score_codex":0.002003016,"about_ca_system_score_gemma":0.001332765,"threshold_uncertainty_score":0.014532924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034192145,0.0002950738,0.96195793,0.00024504995,0.00006221264,0.000026421087,0.000020134406,0.00014774126,0.0030532521],"genre_scores_gemma":[0.8445223,0.000348541,0.15260409,0.00017923808,0.00009238641,0.000089808935,0.000043172487,0.00003130904,0.002089208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983224,0.00074555026,0.00007463253,0.00014849374,0.00055818853,0.00015075524],"domain_scores_gemma":[0.9983683,0.0007002913,0.00030753837,0.00035003247,0.00020314642,0.000070722825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013100542,0.0007175824,0.0006495069,0.00045727866,0.00075927324,0.00067000405,0.00080677256,0.001008614,0.00095683796],"category_scores_gemma":[0.00351379,0.00024898694,0.0003985581,0.0006441158,0.0011273518,0.0016792334,0.0020326714,0.00091839925,0.00039327686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092770846,0.000121595025,0.0017061072,0.00026281524,0.000090877424,0.0005035194,0.0004616065,0.24727407,0.13599415,0.4896046,0.0018483816,0.12120464],"study_design_scores_gemma":[0.000033760993,0.0002590305,0.00024254748,0.00002797214,0.0000337983,0.00031006,0.000040774365,0.9119175,0.031321514,0.05209098,0.003676017,0.00004606816],"about_ca_topic_score_codex":0.00017565711,"about_ca_topic_score_gemma":0.00018058796,"teacher_disagreement_score":0.0013100542,"about_ca_system_score_codex":0.0006673876,"about_ca_system_score_gemma":0.00038577645,"threshold_uncertainty_score":0.006928265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026512982,0.00022749312,0.99666303,0.000051916824,0.000035224086,0.000009144833,0.00001827299,0.00012340557,0.00022020096],"genre_scores_gemma":[0.32862046,0.0015072862,0.6658444,0.00029125236,0.00036771517,0.00015705654,0.0003830235,0.0001294408,0.0026992722],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919444,0.00022509546,0.00003510286,0.00017085258,0.00030925282,0.00006528635],"domain_scores_gemma":[0.99828523,0.00071635225,0.00025138658,0.00019390557,0.0004908172,0.00006242266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013208261,0.0007368181,0.001073675,0.00096665433,0.0003138324,0.00090334564,0.001235552,0.0014011238,0.00083854573],"category_scores_gemma":[0.006549483,0.00045201735,0.0006232707,0.00094088016,0.00068168965,0.0019996813,0.0014699609,0.0013980024,0.0005335255],"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.000459403,0.00014200852,0.00589129,0.0005298089,0.00030137034,0.00051167625,0.00020156897,0.3994806,0.067174174,0.09236089,0.008185235,0.42476192],"study_design_scores_gemma":[0.000036475463,0.000045341658,0.00063691795,0.000019510431,0.00003320305,0.00036543826,0.0000161143,0.98174125,0.0052729715,0.009508095,0.0022877553,0.000036907182],"about_ca_topic_score_codex":0.0010260214,"about_ca_topic_score_gemma":0.0009383185,"teacher_disagreement_score":0.0014011238,"about_ca_system_score_codex":0.0005620734,"about_ca_system_score_gemma":0.0009955604,"threshold_uncertainty_score":0.006985247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04453147,0.001257801,0.9506287,0.00023954747,0.00004573885,0.00008003331,0.00006477686,0.00028754087,0.0028642684],"genre_scores_gemma":[0.82449657,0.0010086043,0.17231746,0.00009981927,0.00004710355,0.00013805163,0.000073072384,0.000018220615,0.0018011404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995472,0.00018015745,0.000023069853,0.00004941241,0.00014760546,0.00005245697],"domain_scores_gemma":[0.99907684,0.00047609312,0.00010389288,0.00016263589,0.00015373742,0.000026758344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009925555,0.00077557133,0.00051690947,0.00052361,0.00056477805,0.00049727934,0.0010372808,0.0006652343,0.0008815948],"category_scores_gemma":[0.001579724,0.00021334476,0.00036891905,0.0005232782,0.00081135356,0.00090424763,0.0007207924,0.00047946858,0.00028846067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046056358,0.00011065602,0.001092764,0.00032838964,0.00010603534,0.0006527607,0.00040669565,0.6682326,0.053976405,0.11228367,0.0026591127,0.15969032],"study_design_scores_gemma":[0.000043361113,0.00022066123,0.0001371118,0.000014086934,0.000036377918,0.00034744793,0.000027471728,0.96675974,0.013483909,0.015976425,0.0029242318,0.000029130826],"about_ca_topic_score_codex":0.001606905,"about_ca_topic_score_gemma":0.0030759794,"teacher_disagreement_score":0.001606905,"about_ca_system_score_codex":0.0005518805,"about_ca_system_score_gemma":0.00079555856,"threshold_uncertainty_score":0.0052492023},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22867478,0.015047591,0.51955825,0.056005068,0.006774423,0.0007492198,0.0033936524,0.0022532402,0.16754375],"genre_scores_gemma":[0.91708565,0.0037134723,0.032812703,0.002132366,0.0010262245,0.00013194952,0.0013067389,0.00011719627,0.041673757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953175,0.00012254869,0.000022667933,0.00010521416,0.000076924734,0.00014095062],"domain_scores_gemma":[0.9995474,0.00011692669,0.0000522442,0.0000501595,0.0001407641,0.000092577815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908686,0.00044879172,0.0004854366,0.0005110871,0.0006010832,0.0010719927,0.0006992359,0.0009948437,0.010788287],"category_scores_gemma":[0.001930632,0.00014594465,0.0003180978,0.0005433632,0.00037479223,0.0017389355,0.00051012007,0.00054408825,0.004081629],"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.0011261029,0.00032178915,0.021634428,0.00041123756,0.000109869085,0.0011009591,0.00032984925,0.030516809,0.007792755,0.099484816,0.12692107,0.7102504],"study_design_scores_gemma":[0.00039629114,0.0011034543,0.0088586295,0.00038244604,0.00029466097,0.004703514,0.0054840683,0.29480657,0.021544568,0.20453979,0.45767242,0.00021363751],"about_ca_topic_score_codex":0.0018861541,"about_ca_topic_score_gemma":0.0034993526,"teacher_disagreement_score":0.010788287,"about_ca_system_score_codex":0.00030353718,"about_ca_system_score_gemma":0.0007636914,"threshold_uncertainty_score":0.036090434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30703902,0.0011703887,0.6523424,0.00097253086,0.00029684033,0.00021390479,0.0003714149,0.004709356,0.032884136],"genre_scores_gemma":[0.84351814,0.0005777707,0.14359686,0.00029616154,0.0001359889,0.00010246662,0.00045907332,0.00013726136,0.011176349],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885416,0.00022572637,0.000062713756,0.0001215025,0.0005910693,0.00014483015],"domain_scores_gemma":[0.9966732,0.0015075227,0.00018986815,0.00048808468,0.0010645636,0.00007670305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086136966,0.0006770597,0.00054525404,0.0007770568,0.00048366,0.000975983,0.0006332914,0.00055662496,0.005056612],"category_scores_gemma":[0.0049886894,0.00025099478,0.00023406172,0.0006989018,0.00064891047,0.0013764664,0.00068207376,0.0007638992,0.0017171842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019132807,0.00016103488,0.0040769735,0.00037456088,0.00010609381,0.000583698,0.00025738383,0.15538801,0.50578946,0.041314844,0.0064701317,0.28356454],"study_design_scores_gemma":[0.00008714176,0.00035480605,0.0016678375,0.000040836057,0.00006767256,0.00092933123,0.000059017297,0.43923426,0.53758836,0.007486468,0.012424687,0.000059594986],"about_ca_topic_score_codex":0.0016119059,"about_ca_topic_score_gemma":0.002201156,"teacher_disagreement_score":0.005056612,"about_ca_system_score_codex":0.0009414092,"about_ca_system_score_gemma":0.0014279513,"threshold_uncertainty_score":0.016916096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18094943,0.001512434,0.7858436,0.001996771,0.00010465544,0.0003185654,0.0005332134,0.00038912514,0.02835212],"genre_scores_gemma":[0.85486907,0.0012099266,0.13809536,0.00010466823,0.000036049154,0.0002838908,0.00019627559,0.0000736058,0.0051311217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995732,0.00023055552,0.000009828301,0.00004912726,0.000048564863,0.00008871897],"domain_scores_gemma":[0.9987783,0.00095229386,0.00009143703,0.00002500708,0.000065733875,0.00008724667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180055,0.00072624214,0.00073106115,0.0006226475,0.00075848,0.0010192095,0.00069494825,0.0010231789,0.0049506677],"category_scores_gemma":[0.002685623,0.0005391342,0.00048705257,0.001104443,0.0013607006,0.0012113318,0.00085218454,0.0007253634,0.00028576632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026360141,0.000009401346,0.0000867146,0.000023905102,0.000004232773,0.00003489305,0.000020842686,0.98859274,0.0001257644,0.0063075265,0.00027371928,0.004493909],"study_design_scores_gemma":[0.000011724006,0.00002981672,0.000055747583,0.000006018282,0.0000043495893,0.000009968909,0.00004367623,0.990051,0.00017556526,0.009045423,0.00056202535,0.000004721651],"about_ca_topic_score_codex":0.020675078,"about_ca_topic_score_gemma":0.01712643,"teacher_disagreement_score":0.020675078,"about_ca_system_score_codex":0.0015921739,"about_ca_system_score_gemma":0.0020239344,"threshold_uncertainty_score":0.041109443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024747353,0.0003260022,0.9710133,0.00021806142,0.000025590096,0.00002558785,0.000060091585,0.0001022006,0.0034818414],"genre_scores_gemma":[0.7083837,0.00064218283,0.28754255,0.00011185986,0.000043251726,0.000091869166,0.00010545426,0.000031150554,0.003048051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997224,0.00009711269,0.000009791931,0.00003248038,0.000109095345,0.000029140892],"domain_scores_gemma":[0.9997203,0.00015593287,0.000041129584,0.000018255318,0.00005259736,0.00001184629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036683603,0.0005741097,0.0003615644,0.000217184,0.00022613857,0.00047078356,0.00021284127,0.00051161717,0.0018601489],"category_scores_gemma":[0.0011668286,0.00025008325,0.00020215237,0.00042168,0.0005001075,0.00055000524,0.00033864286,0.0004530328,0.00038803965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016873612,0.00004958643,0.00049519213,0.00010766575,0.000027947992,0.00008694236,0.00007987644,0.8704966,0.03162014,0.026032811,0.0015134896,0.069321],"study_design_scores_gemma":[0.000023435512,0.000046931742,0.00011556669,0.000009756153,0.0000057098496,0.000033913613,0.000016175385,0.99005216,0.0035236897,0.005461843,0.0007031358,0.000007599622],"about_ca_topic_score_codex":0.0014913013,"about_ca_topic_score_gemma":0.002325905,"teacher_disagreement_score":0.0018601489,"about_ca_system_score_codex":0.00037753696,"about_ca_system_score_gemma":0.0008154825,"threshold_uncertainty_score":0.0062227845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077289836,0.000460327,0.98319256,0.0006735661,0.00009818787,0.00007415413,0.00020142386,0.00011307111,0.007457643],"genre_scores_gemma":[0.6792238,0.0021076575,0.29488042,0.00054225425,0.00025455552,0.0009798816,0.0008214935,0.0002512349,0.020938693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.00040859927,0.000049444145,0.00026008498,0.00028170072,0.00021517699],"domain_scores_gemma":[0.9983028,0.0011349748,0.00015950503,0.000054766675,0.00025721933,0.00009078135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016725248,0.0018463993,0.0016380948,0.00092312566,0.0006875284,0.0022915397,0.0020698907,0.0024535449,0.006126087],"category_scores_gemma":[0.0042020944,0.0010592883,0.0012040014,0.0009952807,0.0014037223,0.0022464476,0.0013613396,0.002755507,0.0006273324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022232318,0.000021346057,0.00010859876,0.00005673146,0.000013798134,0.00004271103,0.000023196088,0.958454,0.00027426518,0.03763297,0.0007570455,0.0025930651],"study_design_scores_gemma":[0.000010854016,0.000011255155,0.000026231162,0.000006513382,0.0000042400566,0.0000061910705,0.000009616392,0.9873262,0.00007255383,0.011951324,0.0005713433,0.000003617117],"about_ca_topic_score_codex":0.00894885,"about_ca_topic_score_gemma":0.0072923596,"teacher_disagreement_score":0.00894885,"about_ca_system_score_codex":0.0027730113,"about_ca_system_score_gemma":0.0027440481,"threshold_uncertainty_score":0.020493746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51992774,0.0077353646,0.43463716,0.0014653014,0.00028955878,0.00007660881,0.00022862748,0.0006137327,0.03502594],"genre_scores_gemma":[0.99234176,0.0010120531,0.005939647,0.000067735215,0.00006447518,0.000019139807,0.00003105175,0.00003510299,0.0004891445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979748,0.00069938,0.000070501796,0.00020707266,0.0007721652,0.00027598933],"domain_scores_gemma":[0.9887149,0.00903073,0.0006608183,0.00063781603,0.00081517716,0.00014060123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028645163,0.0010688121,0.0007476406,0.00062015007,0.0005751265,0.0015179998,0.0009196614,0.0010307481,0.0007506129],"category_scores_gemma":[0.018067775,0.00032218976,0.00028102484,0.00070420967,0.0011244912,0.0019097514,0.00085597445,0.0007549436,0.00021530633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016073244,0.000060941205,0.0016463443,0.000088351386,0.00005661827,0.0001339828,0.000090874906,0.959534,0.0039566634,0.019358704,0.0003793065,0.014533477],"study_design_scores_gemma":[0.000013392571,0.00011646854,0.0009813856,0.000022854258,0.000026020252,0.00013200472,0.00004100985,0.9835633,0.0019754847,0.012711701,0.00039909632,0.000017286642],"about_ca_topic_score_codex":0.0024359655,"about_ca_topic_score_gemma":0.0017431853,"teacher_disagreement_score":0.0028645163,"about_ca_system_score_codex":0.0012702432,"about_ca_system_score_gemma":0.0009316275,"threshold_uncertainty_score":0.015149176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013488312,0.00023233001,0.985105,0.00008416908,0.000023050456,0.0000194956,0.0000149604875,0.00032900582,0.0007037025],"genre_scores_gemma":[0.5764496,0.0003470926,0.42150688,0.0001570631,0.000079725534,0.000088674846,0.00008655479,0.000033912223,0.0012506068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824786,0.0006541516,0.00007214739,0.0001449865,0.0007601706,0.00012079108],"domain_scores_gemma":[0.9980903,0.0010563172,0.00025859714,0.00021917908,0.00031649348,0.000059101843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014374679,0.000786482,0.00086608913,0.0006530691,0.00043216284,0.00069131085,0.00094237574,0.0007658986,0.0007635214],"category_scores_gemma":[0.004879162,0.000487929,0.0004992166,0.0008232163,0.0008690635,0.0010037983,0.0011832172,0.0008210384,0.00047846252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008850464,0.00016279472,0.0021144021,0.00030320007,0.00020861812,0.0003801105,0.0003041545,0.5419812,0.06999521,0.032162797,0.0017633751,0.3497391],"study_design_scores_gemma":[0.000029642224,0.000094405514,0.0001895528,0.000006590073,0.000017120694,0.000099955345,0.000009869219,0.98481095,0.0113411145,0.0027316283,0.0006503158,0.0000188205],"about_ca_topic_score_codex":0.0015772382,"about_ca_topic_score_gemma":0.0022677656,"teacher_disagreement_score":0.0015772382,"about_ca_system_score_codex":0.0005009018,"about_ca_system_score_gemma":0.0011736646,"threshold_uncertainty_score":0.007602155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065867126,0.0006844389,0.92383504,0.0004410136,0.000040461175,0.00003180608,0.00014101462,0.00021568254,0.008743453],"genre_scores_gemma":[0.9786195,0.0005381698,0.015836544,0.000047700734,0.000043495475,0.000048600235,0.000058968304,0.00003723109,0.004769817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996654,0.000083496874,0.000010779974,0.000051728526,0.00011236761,0.000076330405],"domain_scores_gemma":[0.99920124,0.0004857516,0.00012587289,0.000041596446,0.00012392875,0.000021630474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857001,0.00043370944,0.0004475897,0.0006236189,0.00038447513,0.00055546983,0.0010574779,0.0007133965,0.0018135036],"category_scores_gemma":[0.0024589498,0.0003267509,0.0004663537,0.00048954133,0.0006136128,0.0013400932,0.00051038776,0.00069437234,0.00025523335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029538236,0.000009631832,0.00028516672,0.000035217367,0.000008323208,0.0001005792,0.00006540857,0.9613623,0.0020145616,0.031463344,0.00038416107,0.0042417836],"study_design_scores_gemma":[0.0000011081289,0.000004937106,0.000051705036,0.0000024639419,0.0000016298153,0.000015974361,0.000005206245,0.99622464,0.00010995549,0.003418567,0.00016195336,0.0000017970849],"about_ca_topic_score_codex":0.004834656,"about_ca_topic_score_gemma":0.0023530785,"teacher_disagreement_score":0.004834656,"about_ca_system_score_codex":0.0012655032,"about_ca_system_score_gemma":0.0005092043,"threshold_uncertainty_score":0.009613037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15083644,0.0009975324,0.8372342,0.00025784248,0.00003614792,0.000045656227,0.000052149604,0.00027065296,0.01026935],"genre_scores_gemma":[0.95041126,0.0007788552,0.04688439,0.00009413777,0.000038765822,0.00003911953,0.000033989385,0.000014355315,0.0017052117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990459,0.00036601175,0.000058524107,0.00008662114,0.0003221031,0.000120803634],"domain_scores_gemma":[0.9982589,0.0010543315,0.00024666506,0.0001807394,0.00023588557,0.000023490264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012296243,0.00068045186,0.0006448034,0.0005009173,0.00042622065,0.0009773485,0.00039747125,0.00060518936,0.0005847923],"category_scores_gemma":[0.0030662958,0.00024546636,0.00037350922,0.0008858762,0.0006918369,0.0009519346,0.0006413638,0.0004118987,0.00035675106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004042067,0.00007541783,0.0040339227,0.00031372445,0.00012721973,0.0008946993,0.000561035,0.6653806,0.075699605,0.12550637,0.0010210895,0.1259821],"study_design_scores_gemma":[0.000018054598,0.0002426519,0.0013001437,0.000036115034,0.00009002959,0.00066860975,0.00008905551,0.928399,0.035146527,0.031817228,0.002151592,0.0000410615],"about_ca_topic_score_codex":0.00052096497,"about_ca_topic_score_gemma":0.0007480907,"teacher_disagreement_score":0.0012296243,"about_ca_system_score_codex":0.00067430775,"about_ca_system_score_gemma":0.00043332923,"threshold_uncertainty_score":0.006502986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55319756,0.0037438232,0.41249415,0.0011064418,0.00016574451,0.00007805673,0.0003982539,0.001182601,0.027633416],"genre_scores_gemma":[0.99350524,0.0005753932,0.0051543843,0.00004654422,0.000032703192,0.000022408622,0.00004062649,0.000034011162,0.00058859884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.0003168486,0.0000305448,0.00010162858,0.0002743255,0.0002741918],"domain_scores_gemma":[0.98857236,0.008910996,0.0008544767,0.0006194353,0.0008904535,0.00015224074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014932461,0.0009917482,0.0009280621,0.0006097895,0.0005628263,0.0013012884,0.00074865017,0.00089015206,0.001047185],"category_scores_gemma":[0.014171127,0.00032192876,0.00029621934,0.0008375396,0.0022078583,0.002326498,0.0012075516,0.00095643825,0.00032856484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017255786,0.000050683124,0.0015448064,0.00017671684,0.000033171924,0.00057354517,0.00031615765,0.94126034,0.01583918,0.029481461,0.00078640017,0.009765042],"study_design_scores_gemma":[0.0000051773886,0.0000652569,0.0005947539,0.00003182452,0.000014587037,0.0001268411,0.00008392163,0.980212,0.0084104305,0.010181151,0.0002481122,0.000025914982],"about_ca_topic_score_codex":0.0021121728,"about_ca_topic_score_gemma":0.0010557384,"teacher_disagreement_score":0.0021121728,"about_ca_system_score_codex":0.0010245059,"about_ca_system_score_gemma":0.0005430425,"threshold_uncertainty_score":0.007897139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01435152,0.0012948853,0.9619539,0.0011155523,0.000112136164,0.00005891318,0.00012258413,0.00008378723,0.020906804],"genre_scores_gemma":[0.77663136,0.0067834076,0.19384204,0.0010772964,0.0005919051,0.000630929,0.00047842093,0.00018160751,0.019783134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883026,0.0005895894,0.000040803752,0.000100866666,0.0003067414,0.00013174652],"domain_scores_gemma":[0.9952173,0.0037020908,0.00027930192,0.0003257411,0.0003723992,0.00010313014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020493378,0.00071093184,0.0006112258,0.0009290166,0.0005954851,0.0012278312,0.00096226484,0.0011131873,0.0031708584],"category_scores_gemma":[0.0100366175,0.00024773288,0.0006011122,0.0012481224,0.0019451873,0.002830244,0.0020012227,0.0020163187,0.0004315186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022126282,0.000009561498,0.00008296545,0.000052330393,0.0000076054025,0.000040726314,0.00006271394,0.071895316,0.00051405473,0.91716594,0.0014521991,0.00869453],"study_design_scores_gemma":[0.000014414971,0.000014222868,0.000048129386,0.00003210808,0.0000050169233,0.000034118297,0.000019404015,0.31023,0.00030121775,0.686768,0.0025230972,0.000010248735],"about_ca_topic_score_codex":0.0018839254,"about_ca_topic_score_gemma":0.001169327,"teacher_disagreement_score":0.0031708584,"about_ca_system_score_codex":0.0015433348,"about_ca_system_score_gemma":0.0010248505,"threshold_uncertainty_score":0.011197686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15344328,0.0029362845,0.8226588,0.0008716021,0.000053939693,0.0000507882,0.00047117058,0.00038425066,0.01912985],"genre_scores_gemma":[0.9847216,0.0018058753,0.010679631,0.00009518286,0.00008684867,0.00006225765,0.00014983838,0.00006290279,0.0023357768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.0003089945,0.000032212705,0.00006282317,0.00039862504,0.00021389709],"domain_scores_gemma":[0.995131,0.0036055828,0.00034681745,0.00019962201,0.0006481294,0.000068723144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292205,0.0008858311,0.0009463703,0.0011011679,0.00051606464,0.0009590316,0.0005847669,0.0005765779,0.0016715984],"category_scores_gemma":[0.007518878,0.00031788557,0.00039343323,0.001077769,0.0011542635,0.0011581326,0.00097117637,0.00075732113,0.00030625126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050060666,0.000016982862,0.0005840633,0.00008823285,0.000025819452,0.00023275321,0.0001598692,0.9419053,0.0026105735,0.045676403,0.00088884647,0.00776105],"study_design_scores_gemma":[0.0000024588558,0.00000982274,0.00024818094,0.000009770617,0.000006983591,0.00006487047,0.000030184696,0.99108785,0.0005034051,0.007790414,0.0002385208,0.000007483473],"about_ca_topic_score_codex":0.0071712574,"about_ca_topic_score_gemma":0.0032716137,"teacher_disagreement_score":0.0071712574,"about_ca_system_score_codex":0.0018764909,"about_ca_system_score_gemma":0.0009030444,"threshold_uncertainty_score":0.014258981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004529466,0.00024498533,0.9909553,0.0002890225,0.000058270023,0.000046097495,0.00003383879,0.000030643336,0.0038124616],"genre_scores_gemma":[0.833093,0.0015446077,0.15452696,0.000490587,0.00032012662,0.00043554968,0.000095616,0.00007332692,0.009420281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886656,0.00055013335,0.000031171083,0.000138021,0.0002850424,0.00012902595],"domain_scores_gemma":[0.9987494,0.000851115,0.00012608203,0.0000457532,0.00015320237,0.00007441081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014572365,0.0014161856,0.0012851824,0.0007120076,0.0006933117,0.0013746009,0.0017784577,0.0012187614,0.002048202],"category_scores_gemma":[0.0027102025,0.00051307544,0.0009338386,0.00088119716,0.0016920932,0.0015399372,0.0012322506,0.0014551654,0.00027178563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015224297,0.000024646237,0.00013735755,0.00004571035,0.00003011328,0.00006854846,0.000032668962,0.8990562,0.0006452709,0.09590816,0.0005624094,0.0034735904],"study_design_scores_gemma":[0.0000055207124,0.000013298898,0.000030053074,0.00000402641,0.000005814775,0.000013828257,0.000010318653,0.9794494,0.00007483131,0.019984437,0.0004033985,0.0000050973294],"about_ca_topic_score_codex":0.0050750896,"about_ca_topic_score_gemma":0.0044852984,"teacher_disagreement_score":0.0050750896,"about_ca_system_score_codex":0.0018333512,"about_ca_system_score_gemma":0.0020246876,"threshold_uncertainty_score":0.013301969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06278512,0.002567142,0.8577044,0.0010144847,0.00013199545,0.00021216199,0.00017192497,0.00016056791,0.07525226],"genre_scores_gemma":[0.9194583,0.0025044824,0.07238499,0.0003550763,0.00022241226,0.0003695676,0.0000942086,0.00006073852,0.004550242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961965,0.0014198417,0.00032106374,0.00070283504,0.00100932,0.0003504127],"domain_scores_gemma":[0.9834509,0.012786898,0.0014955514,0.0010144771,0.0009851727,0.00026696047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976536,0.000981021,0.0006067039,0.0012007499,0.0005517672,0.0029179011,0.0019296521,0.0020267584,0.003335277],"category_scores_gemma":[0.022147058,0.00038487758,0.0003760601,0.0008769137,0.0028192059,0.0035975473,0.0018933133,0.001827742,0.00058903696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008975819,0.00006691415,0.0006297887,0.00014323948,0.000025641091,0.00012251711,0.00034187277,0.047883715,0.0047996677,0.9051293,0.0006380376,0.040129624],"study_design_scores_gemma":[0.0000702827,0.00041588716,0.0014092049,0.00014600698,0.00006580021,0.0008828564,0.00028923393,0.39200148,0.005915715,0.59419703,0.004517581,0.00008892068],"about_ca_topic_score_codex":0.00047397582,"about_ca_topic_score_gemma":0.00031190043,"teacher_disagreement_score":0.003976536,"about_ca_system_score_codex":0.0011151683,"about_ca_system_score_gemma":0.0007828679,"threshold_uncertainty_score":0.021030188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54408544,0.0005466403,0.44348556,0.0002846542,0.000077157005,0.0000770091,0.00005712241,0.0007466936,0.010639793],"genre_scores_gemma":[0.96518886,0.00013319946,0.032703966,0.000057029665,0.000012871329,0.00003612254,0.00002073617,0.00002787657,0.0018191499],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985707,0.000026982121,0.000010639549,0.00003077314,0.000039859955,0.00003470644],"domain_scores_gemma":[0.99953747,0.00008205589,0.00009644051,0.00014989256,0.000088575885,0.000045672336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020413287,0.0002566893,0.00022833962,0.00037103542,0.00040893778,0.0005359823,0.00062399905,0.00033451384,0.0011043419],"category_scores_gemma":[0.00064717035,0.00018194143,0.00018719549,0.00026579582,0.00046722268,0.0013679282,0.00062388997,0.0003087711,0.0002149855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010510335,0.0001808799,0.0033608011,0.00035338858,0.00005788761,0.000690507,0.00057652604,0.09668615,0.45693195,0.20556177,0.0024964993,0.2320527],"study_design_scores_gemma":[0.000106983054,0.0008909684,0.0017761334,0.00007810837,0.000087127126,0.0010607634,0.00019559289,0.55488014,0.30989596,0.11220041,0.018765377,0.00006238047],"about_ca_topic_score_codex":0.00049501524,"about_ca_topic_score_gemma":0.00064102956,"teacher_disagreement_score":0.0011043419,"about_ca_system_score_codex":0.00036951248,"about_ca_system_score_gemma":0.00050782727,"threshold_uncertainty_score":0.003694415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00504805,0.00033131932,0.9927844,0.00011595239,0.000088513865,0.000024167579,0.000051160958,0.00014781908,0.0014086799],"genre_scores_gemma":[0.14272039,0.0009501782,0.8495063,0.0002814223,0.0002083752,0.00010575178,0.00027689786,0.00011423193,0.005836411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991155,0.00021029566,0.000057777783,0.00010986665,0.00043953361,0.000067069755],"domain_scores_gemma":[0.99933296,0.00024430093,0.00006717743,0.00012155159,0.00018966789,0.000044273962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201196,0.0007484655,0.0010311828,0.0005246893,0.0003982167,0.0008955051,0.0005805408,0.0008507716,0.0014652886],"category_scores_gemma":[0.0019161105,0.0003710321,0.00040213027,0.00064431474,0.0006297421,0.0011197195,0.0010421571,0.0010238361,0.0009309709],"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.00046428558,0.00014606184,0.00085238565,0.0004091892,0.00017267073,0.00032030148,0.00024327173,0.246139,0.12802398,0.29474974,0.007216598,0.32126257],"study_design_scores_gemma":[0.000038269165,0.00013815206,0.00016247208,0.000019833833,0.000032881842,0.00039150455,0.000012879048,0.94475156,0.020187955,0.024316045,0.009909686,0.000038767637],"about_ca_topic_score_codex":0.0006334604,"about_ca_topic_score_gemma":0.0017172929,"teacher_disagreement_score":0.0014652886,"about_ca_system_score_codex":0.0005373839,"about_ca_system_score_gemma":0.0014427623,"threshold_uncertainty_score":0.004901886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5581692,0.004944272,0.41206336,0.0006162618,0.00029916738,0.00012725774,0.00019542062,0.0005442907,0.023040814],"genre_scores_gemma":[0.99241793,0.000416104,0.006178129,0.00005228447,0.000042150485,0.00003327488,0.000032842396,0.000014196023,0.00081318786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972433,0.00092564535,0.000104437044,0.00030125596,0.0009848182,0.00044052745],"domain_scores_gemma":[0.99534816,0.0026444138,0.00045044316,0.00038786975,0.001056274,0.00011293946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280236,0.0013107967,0.0007959028,0.0008623842,0.00046682404,0.0015153165,0.0014707672,0.0010431474,0.00090780563],"category_scores_gemma":[0.008435267,0.00030100637,0.00041915794,0.00078407396,0.0010206039,0.0012509294,0.0010387404,0.0006452977,0.00021871743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005475112,0.00007659302,0.0021765982,0.00012162108,0.000113542155,0.00029827515,0.00009597577,0.9443251,0.009122021,0.0144659225,0.0006174466,0.028039513],"study_design_scores_gemma":[0.0000076154984,0.00010871471,0.0005741112,0.000006685533,0.000028722288,0.00008846277,0.000014368617,0.9964644,0.0009008401,0.0015622651,0.00023023423,0.000013456333],"about_ca_topic_score_codex":0.005327943,"about_ca_topic_score_gemma":0.0040404657,"teacher_disagreement_score":0.005327943,"about_ca_system_score_codex":0.0021548222,"about_ca_system_score_gemma":0.0011907462,"threshold_uncertainty_score":0.015634418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033450466,0.001420668,0.85601544,0.008957376,0.0014090209,0.00025521748,0.0006197431,0.00080028037,0.09707184],"genre_scores_gemma":[0.52190846,0.0021976253,0.44631955,0.0057002446,0.0012108001,0.00094388257,0.0007896534,0.00061227323,0.020317402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962878,0.0012322642,0.0001450403,0.00048174863,0.0011655143,0.0006876522],"domain_scores_gemma":[0.98533547,0.010516179,0.00095838413,0.0011467688,0.0015794145,0.0004638099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238829,0.0013435892,0.00150804,0.0009257182,0.0014829378,0.0023053193,0.0023827052,0.0014979801,0.010991374],"category_scores_gemma":[0.01666905,0.0006949294,0.0025964368,0.0011512839,0.0040967376,0.005025118,0.003930024,0.007426865,0.001255628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014859518,0.000283645,0.0003817745,0.000730983,0.00009783242,0.00031955654,0.00023561463,0.07476123,0.00556154,0.866373,0.01997496,0.031131284],"study_design_scores_gemma":[0.00016943275,0.0002129608,0.00034230566,0.0002103114,0.00008119105,0.000244174,0.000115618706,0.23382045,0.004728659,0.74008125,0.019927869,0.00006568308],"about_ca_topic_score_codex":0.0017109736,"about_ca_topic_score_gemma":0.0016051196,"teacher_disagreement_score":0.010991374,"about_ca_system_score_codex":0.0017279875,"about_ca_system_score_gemma":0.003870095,"threshold_uncertainty_score":0.036769807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5562944,0.0026162756,0.42339584,0.00049199915,0.0002960741,0.00007607173,0.000099293015,0.0010671462,0.015662946],"genre_scores_gemma":[0.93449736,0.00072405464,0.062633544,0.000107155756,0.00011034162,0.000015959089,0.000096669144,0.000041176914,0.0017738047],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976367,0.000059757043,0.000009995093,0.000028649767,0.000103822815,0.00003410092],"domain_scores_gemma":[0.9995572,0.00022613742,0.0000435884,0.000055606888,0.00009974068,0.000017645552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033391072,0.00031004098,0.00035709742,0.000306411,0.0001596065,0.00039256873,0.0003123623,0.00034886374,0.0012677291],"category_scores_gemma":[0.0016409148,0.00011617563,0.00019468632,0.00043804056,0.0003090886,0.00044825254,0.00020985327,0.00044658218,0.00025311438],"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.001731775,0.00016884085,0.0018499311,0.0005084354,0.000145454,0.0006541808,0.00033318452,0.04619743,0.55066997,0.018220775,0.0020823658,0.3774376],"study_design_scores_gemma":[0.00016926423,0.0023861215,0.0058751707,0.000057734644,0.00027162395,0.0019519508,0.0001192425,0.40645054,0.565667,0.0051928614,0.011783693,0.000074827985],"about_ca_topic_score_codex":0.0003104382,"about_ca_topic_score_gemma":0.0003242086,"teacher_disagreement_score":0.0012677291,"about_ca_system_score_codex":0.00016989946,"about_ca_system_score_gemma":0.0002233086,"threshold_uncertainty_score":0.0042409897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68241423,0.004379704,0.28007668,0.0017190551,0.000121917576,0.00006837391,0.0012339936,0.0010938136,0.02889225],"genre_scores_gemma":[0.99622524,0.00045181843,0.0024225512,0.00006799394,0.00004849299,0.000020140262,0.0001312764,0.00003121688,0.00060136063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959857,0.0015972306,0.00022906323,0.00033702466,0.0011128938,0.0007381668],"domain_scores_gemma":[0.95276046,0.039201718,0.0030758984,0.0020843039,0.0021883112,0.0006892958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006282137,0.0010027268,0.0019808665,0.0009262603,0.0007252289,0.0015514644,0.00095189194,0.0017460304,0.0021770773],"category_scores_gemma":[0.028302183,0.0007064177,0.0006153766,0.0011720591,0.0025746222,0.0018795093,0.0018585684,0.00097270514,0.000456342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024516697,0.00010770678,0.017580127,0.00050243625,0.00029687549,0.002731459,0.0005839345,0.8841978,0.009390296,0.05214951,0.0037503303,0.02625791],"study_design_scores_gemma":[0.000112218426,0.00033586402,0.0093522575,0.00010398659,0.00023558483,0.0023598836,0.00025018275,0.95498496,0.007419531,0.023928506,0.0008090537,0.000108025255],"about_ca_topic_score_codex":0.0021201568,"about_ca_topic_score_gemma":0.0010155075,"teacher_disagreement_score":0.006282137,"about_ca_system_score_codex":0.0015827722,"about_ca_system_score_gemma":0.0009018827,"threshold_uncertainty_score":0.03322351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028962245,0.00087480113,0.9616902,0.000595415,0.00021090108,0.00014855493,0.00005361689,0.0003308757,0.007133419],"genre_scores_gemma":[0.4818218,0.0008687329,0.5087702,0.00038563745,0.00014151803,0.0007061105,0.00008885886,0.00007131674,0.0071457773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968326,0.00014021738,0.000015372083,0.0000449546,0.000075689946,0.000040576822],"domain_scores_gemma":[0.99948466,0.00032948106,0.000053221716,0.000039796727,0.0000682285,0.000024481042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010972797,0.00075902615,0.0007840112,0.0007506101,0.0011672009,0.00091265986,0.0012165525,0.0016515887,0.0012080122],"category_scores_gemma":[0.0019251178,0.000476848,0.00073180563,0.000844189,0.0011334897,0.0008127649,0.000776081,0.00084674277,0.00025883847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008008252,0.000062103965,0.00043794786,0.00009800581,0.000096636475,0.00011953798,0.00014832812,0.902118,0.0028247067,0.025788246,0.0026303437,0.06559599],"study_design_scores_gemma":[0.00003726114,0.000060082228,0.00008563391,0.000013808372,0.000021658003,0.000071436836,0.000028864,0.9853867,0.001063597,0.010728057,0.0024900874,0.000012721792],"about_ca_topic_score_codex":0.0019964306,"about_ca_topic_score_gemma":0.0016233141,"teacher_disagreement_score":0.0019964306,"about_ca_system_score_codex":0.0008010879,"about_ca_system_score_gemma":0.0008985123,"threshold_uncertainty_score":0.0058122873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24208279,0.0009706631,0.74185205,0.000320607,0.00011231367,0.00014412931,0.00036139376,0.0005907549,0.013565243],"genre_scores_gemma":[0.8170709,0.00072682695,0.17683044,0.0001976641,0.00008283894,0.00016033268,0.00057619537,0.00008459347,0.004270225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999824,0.000026511598,0.000011543663,0.000032538,0.00007894796,0.000026535325],"domain_scores_gemma":[0.999366,0.00018341347,0.00009929031,0.00016368565,0.00013753999,0.000050148625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017170608,0.00030463102,0.00029701486,0.00047513907,0.0003309415,0.00052884803,0.00028076267,0.00034709505,0.00056069315],"category_scores_gemma":[0.0009985579,0.00012133332,0.00020896496,0.00033889996,0.0004754306,0.0004976585,0.0003352811,0.00059020054,0.0002676591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057311996,0.00022026229,0.0045383847,0.0004874714,0.00006648735,0.0009242928,0.00028965663,0.14963423,0.32441697,0.27903718,0.0039547575,0.23585719],"study_design_scores_gemma":[0.00011157425,0.00037245653,0.0019228919,0.00006149751,0.000047321337,0.0021853503,0.00007933537,0.77699685,0.109460734,0.071072765,0.037581943,0.00010726451],"about_ca_topic_score_codex":0.00030563172,"about_ca_topic_score_gemma":0.000428096,"teacher_disagreement_score":0.00056069315,"about_ca_system_score_codex":0.00027231008,"about_ca_system_score_gemma":0.0003816885,"threshold_uncertainty_score":0.0019757152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981523,0.0035900867,0.25463352,0.0005102941,0.00022427623,0.00017179726,0.00022857888,0.00039574842,0.042093337],"genre_scores_gemma":[0.98598063,0.00045905312,0.012411355,0.00003563806,0.000026154474,0.000030264384,0.00007622693,0.000025907022,0.00095461984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855155,0.000595237,0.000062480474,0.000111397305,0.000516825,0.00016245816],"domain_scores_gemma":[0.99588794,0.0024176417,0.00024503967,0.0004394775,0.000922731,0.00008726025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910274,0.0005998205,0.00059564604,0.001023082,0.00056232227,0.0009023348,0.0011346451,0.0006236168,0.0015613344],"category_scores_gemma":[0.0051842723,0.00012922294,0.00032906045,0.00073458266,0.00043106015,0.0012281529,0.00043774003,0.00026876995,0.00020933009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010907038,0.00016261694,0.002923905,0.00028596123,0.00013786703,0.00048171973,0.00013917086,0.74852866,0.027243294,0.07206528,0.0019479848,0.14499289],"study_design_scores_gemma":[0.00005997651,0.000651946,0.0014732063,0.000025678597,0.00012356185,0.00047440326,0.00015537004,0.9686919,0.00945309,0.016535327,0.0023113901,0.00004416271],"about_ca_topic_score_codex":0.0015141274,"about_ca_topic_score_gemma":0.0024764815,"teacher_disagreement_score":0.0018910274,"about_ca_system_score_codex":0.0011732683,"about_ca_system_score_gemma":0.00058730197,"threshold_uncertainty_score":0.010000825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01180607,0.0002714873,0.9794688,0.00014860283,0.00019361712,0.00015165156,0.00005481875,0.0058922055,0.0020127485],"genre_scores_gemma":[0.26936185,0.0002445273,0.7167896,0.00043620568,0.00019465432,0.00038053465,0.0003080588,0.0007957548,0.011488813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.00012184071,0.00006300995,0.00016599154,0.00038697312,0.0001881492],"domain_scores_gemma":[0.9987197,0.00034600723,0.0001171637,0.00035432845,0.00031311272,0.00014975308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977852,0.0009803342,0.00091300334,0.0014409017,0.0012533606,0.0013705068,0.002366938,0.0009245428,0.007315662],"category_scores_gemma":[0.0035455043,0.00042310962,0.0004869997,0.0007695855,0.0007919235,0.001672333,0.00244721,0.0013556773,0.002809537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016510953,0.0004370259,0.002111743,0.00014790763,0.00009089707,0.00030593615,0.0002805667,0.04539072,0.071443945,0.021878488,0.019284254,0.8369776],"study_design_scores_gemma":[0.00046237314,0.0006052758,0.0010980288,0.000045723067,0.00010778055,0.0006203443,0.00012698006,0.8393944,0.10797861,0.015638888,0.033787843,0.00013364194],"about_ca_topic_score_codex":0.0015564174,"about_ca_topic_score_gemma":0.0021355443,"teacher_disagreement_score":0.007315662,"about_ca_system_score_codex":0.0006194595,"about_ca_system_score_gemma":0.001453579,"threshold_uncertainty_score":0.02447331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035163683,0.0010808461,0.9868721,0.00029160766,0.00017943988,0.00003000698,0.00010536772,0.00026214408,0.0076622083],"genre_scores_gemma":[0.32304618,0.004602878,0.64644235,0.00086145784,0.0010137501,0.00030200847,0.00044069806,0.0007407084,0.022549983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873585,0.00020040474,0.00008289757,0.00018406841,0.0006946028,0.000102195205],"domain_scores_gemma":[0.9988049,0.00053094886,0.00011450424,0.00011811816,0.00040313834,0.000028354954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344361,0.0017872093,0.0010576441,0.00074385386,0.00032098667,0.0014489685,0.0011779648,0.0013082575,0.005388658],"category_scores_gemma":[0.0041637663,0.00049909623,0.00055230595,0.0006395183,0.0012504577,0.0021429923,0.00092187535,0.0017190254,0.0034911449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001881557,0.00012496454,0.0008182875,0.0007843351,0.00011031722,0.00066703866,0.00031764948,0.3803632,0.07621722,0.41801238,0.0122022545,0.110194154],"study_design_scores_gemma":[0.000040009534,0.0002719914,0.0013088436,0.00014522528,0.000079054655,0.0018519436,0.00006593394,0.7915561,0.02326848,0.15431179,0.02697605,0.00012452045],"about_ca_topic_score_codex":0.00041028202,"about_ca_topic_score_gemma":0.00065286196,"teacher_disagreement_score":0.005388658,"about_ca_system_score_codex":0.00095127634,"about_ca_system_score_gemma":0.00054737803,"threshold_uncertainty_score":0.018026829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016702263,0.0002316466,0.9957242,0.00007346057,0.00007477383,0.00006247373,0.00006999308,0.00013013333,0.0019630336],"genre_scores_gemma":[0.06591128,0.00067025487,0.9251852,0.00020056397,0.00012707255,0.00025628018,0.00027794632,0.00006281699,0.007308595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994642,0.00011928708,0.000034525532,0.00009325415,0.00024833815,0.0000404567],"domain_scores_gemma":[0.9995851,0.00011256333,0.000039042152,0.00011077847,0.00013770573,0.000014758818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048225312,0.00085600954,0.00048388622,0.0007213252,0.00042474893,0.0006519936,0.00058313564,0.00091078033,0.002599621],"category_scores_gemma":[0.001348337,0.00027180402,0.00069462875,0.00070439186,0.00061522407,0.00070893526,0.0006611468,0.0011359656,0.0021741695],"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.00016053063,0.00014165063,0.0005019734,0.00048726852,0.00012055763,0.00034752084,0.00036212793,0.0972213,0.13476136,0.36418146,0.008928,0.39278626],"study_design_scores_gemma":[0.00006194915,0.00019360984,0.0006159988,0.00006414412,0.00005764787,0.0018787091,0.000036874233,0.81215495,0.050874036,0.08796347,0.04597945,0.00011916927],"about_ca_topic_score_codex":0.0009514014,"about_ca_topic_score_gemma":0.002565319,"teacher_disagreement_score":0.002599621,"about_ca_system_score_codex":0.00047744543,"about_ca_system_score_gemma":0.00093619403,"threshold_uncertainty_score":0.008696616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027325323,0.00012699829,0.9956117,0.00015683212,0.000022984765,0.000032542248,0.00002673949,0.00015401976,0.0011357843],"genre_scores_gemma":[0.16411558,0.0004781364,0.8327655,0.000120582205,0.00008978632,0.00036009512,0.00024954518,0.000103956685,0.0017168303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.00028467827,0.000042158776,0.00014128136,0.00035046498,0.00011893657],"domain_scores_gemma":[0.99807656,0.0012573673,0.00016317415,0.00016775027,0.00026500886,0.00007022498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164281,0.0012933754,0.001138655,0.0007796732,0.00064018246,0.0011326056,0.0012394175,0.0011946737,0.0028944886],"category_scores_gemma":[0.0054976344,0.000674598,0.0006271701,0.0011992399,0.0010588992,0.0019611574,0.0021175575,0.0022276414,0.00069916225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010772971,0.00014266263,0.00031312276,0.00012381215,0.000027617165,0.000049277543,0.00010005953,0.83062154,0.0028918318,0.05271968,0.0031622755,0.10974044],"study_design_scores_gemma":[0.000014333847,0.000023423487,0.000026916696,0.000006310319,0.0000025451366,0.0000132744035,0.000014755239,0.98331094,0.00053314504,0.015519433,0.0005306302,0.0000042395222],"about_ca_topic_score_codex":0.0022016398,"about_ca_topic_score_gemma":0.0027915307,"teacher_disagreement_score":0.0028944886,"about_ca_system_score_codex":0.00087875006,"about_ca_system_score_gemma":0.0018035654,"threshold_uncertainty_score":0.009683013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052748226,0.00018606281,0.9361362,0.0006870122,0.00008686657,0.00006419584,0.00018628528,0.00022638845,0.00967878],"genre_scores_gemma":[0.93988764,0.00071269495,0.039009023,0.00023183195,0.00015715734,0.00017444209,0.0003000403,0.000115480085,0.019411637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00017825759,0.000021262966,0.00011112507,0.00018388346,0.0000895873],"domain_scores_gemma":[0.99849594,0.0006881983,0.00023081123,0.00019222441,0.00029317348,0.00009968592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579898,0.0006257554,0.00080325844,0.00084997097,0.0005169915,0.0011391867,0.0019282161,0.0013240031,0.0028753933],"category_scores_gemma":[0.004004129,0.00033277745,0.00081669725,0.0011200001,0.0014362357,0.0027076027,0.0009254286,0.0029436832,0.00077780616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050570456,0.000089256246,0.0009221478,0.00003964221,0.00002241798,0.00045701963,0.00021558783,0.29116225,0.0037538474,0.6935353,0.0017837202,0.007968189],"study_design_scores_gemma":[0.0000065052777,0.000013587986,0.00012570401,0.000002805104,0.0000051326197,0.000072724986,0.000014433195,0.9485064,0.00023636082,0.050333157,0.00067297084,0.00001017831],"about_ca_topic_score_codex":0.0032507495,"about_ca_topic_score_gemma":0.0021947913,"teacher_disagreement_score":0.0032507495,"about_ca_system_score_codex":0.0012058774,"about_ca_system_score_gemma":0.0008167132,"threshold_uncertainty_score":0.009619117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029653092,0.00005616528,0.9949969,0.00006157406,0.00002595349,0.000051077557,0.000056368222,0.00034507996,0.0014415616],"genre_scores_gemma":[0.047305632,0.00013309286,0.94942474,0.00008816555,0.000025318215,0.00020502896,0.00029767453,0.00013879662,0.0023814994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904245,0.00020365072,0.0000738768,0.00014312885,0.00046514376,0.000071703886],"domain_scores_gemma":[0.9983909,0.00068955147,0.00008637188,0.00033707067,0.00045011102,0.00004597814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080751,0.00097047526,0.00067628967,0.0010473487,0.000606087,0.0007452065,0.0010134773,0.0010597802,0.0035903428],"category_scores_gemma":[0.0040127547,0.00037435978,0.0006008281,0.0010639897,0.0007176607,0.0012186911,0.0017424942,0.0017403623,0.001499046],"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.00032422048,0.00016211062,0.0007319899,0.00027874514,0.00009039196,0.00029670933,0.0002921015,0.1984067,0.05004801,0.19898541,0.0072271,0.5431565],"study_design_scores_gemma":[0.00013168257,0.00012187871,0.0002843535,0.00005389398,0.000042047475,0.0003874997,0.000031450953,0.8526833,0.04971107,0.076869905,0.019591318,0.00009166259],"about_ca_topic_score_codex":0.0015141936,"about_ca_topic_score_gemma":0.0022909958,"teacher_disagreement_score":0.0035903428,"about_ca_system_score_codex":0.000582544,"about_ca_system_score_gemma":0.0018362402,"threshold_uncertainty_score":0.012010872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372941,0.0005299303,0.8554906,0.00026100155,0.000091579976,0.00006454231,0.00018314362,0.0012001401,0.008449603],"genre_scores_gemma":[0.75814605,0.00044853997,0.23692006,0.00013025913,0.00007375442,0.00013255997,0.0005202815,0.0001169706,0.0035115923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922276,0.00030690344,0.000028222774,0.000056435885,0.00030589072,0.00007979134],"domain_scores_gemma":[0.99793446,0.0010212329,0.0001260265,0.00036925648,0.0004941469,0.00005494596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079849135,0.00042454796,0.0005500899,0.00051856984,0.0004790535,0.0006529067,0.0006256796,0.0007080906,0.0011678032],"category_scores_gemma":[0.005326253,0.00022122267,0.00029192923,0.00045715465,0.00059948955,0.0006591612,0.00086682924,0.00079865,0.0010392957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008323335,0.00013978539,0.0030931933,0.0003299941,0.000074544,0.00080948084,0.00035966773,0.32670793,0.12705486,0.22278045,0.006439803,0.31137806],"study_design_scores_gemma":[0.00003147447,0.000097896045,0.00039009211,0.000026050659,0.000012372948,0.00016622277,0.000017977003,0.89389485,0.055029087,0.04718527,0.0031217,0.000027014541],"about_ca_topic_score_codex":0.0005423749,"about_ca_topic_score_gemma":0.0007303892,"teacher_disagreement_score":0.0011678032,"about_ca_system_score_codex":0.0003946023,"about_ca_system_score_gemma":0.0005484016,"threshold_uncertainty_score":0.00422287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241448,0.0016275118,0.9299087,0.00039492233,0.00012226494,0.00007746784,0.00010848873,0.0004773996,0.034868713],"genre_scores_gemma":[0.88526523,0.001679455,0.10365565,0.00018993828,0.00010378025,0.00021693412,0.00023424605,0.00026758426,0.008387211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931633,0.00019435276,0.000020560472,0.0000494239,0.00032958895,0.00008963529],"domain_scores_gemma":[0.9973736,0.0016391855,0.00009493488,0.00028459195,0.0005567318,0.000050966602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012086009,0.000582577,0.0006106476,0.0011404902,0.00050784735,0.0009512854,0.0012496606,0.000747157,0.0052627493],"category_scores_gemma":[0.0061144964,0.0002013675,0.00029482134,0.0007220432,0.0008333962,0.0017772517,0.0008083994,0.0008916708,0.000858699],"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.000072499104,0.000044834956,0.0005429262,0.00021383526,0.000021988259,0.0003792582,0.00013363971,0.5751623,0.008286646,0.37505907,0.0032247126,0.036858242],"study_design_scores_gemma":[0.0000044660487,0.000017109865,0.00011467587,0.000038575112,0.000004192697,0.00012872985,0.00003026063,0.95790446,0.002367547,0.036745857,0.0026305567,0.000013517991],"about_ca_topic_score_codex":0.0015066973,"about_ca_topic_score_gemma":0.0014679456,"teacher_disagreement_score":0.0052627493,"about_ca_system_score_codex":0.0013806433,"about_ca_system_score_gemma":0.0011497977,"threshold_uncertainty_score":0.017605722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009611995,0.00018107372,0.98904884,0.000051922936,0.000011616574,0.000020529213,0.000027450094,0.00025633597,0.00079023786],"genre_scores_gemma":[0.78843236,0.00060932495,0.2084597,0.000096540505,0.000066252236,0.00016535241,0.00014617706,0.00014195801,0.0018822788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.00023172176,0.00002875161,0.00005670852,0.00019869456,0.000047512556],"domain_scores_gemma":[0.99769837,0.0015819734,0.0002525957,0.00017056604,0.00025948085,0.0000370014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638215,0.00084942323,0.0010407631,0.0007895717,0.00032652635,0.0006635446,0.0007389713,0.00072560745,0.0014641638],"category_scores_gemma":[0.0073007974,0.0004575806,0.00060028804,0.00094709924,0.0006169666,0.0012634492,0.00063992164,0.00083283545,0.0004971327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109948065,0.000027533899,0.0003193044,0.00007399035,0.000034431654,0.00006038623,0.00005053317,0.9371161,0.008393079,0.023339296,0.00050684623,0.02996857],"study_design_scores_gemma":[0.0000020687091,0.000015463116,0.00006233681,0.000005393183,0.0000036695978,0.00002124466,0.0000022806944,0.9962697,0.0014689448,0.0020362565,0.00010637526,0.000006199854],"about_ca_topic_score_codex":0.0012993162,"about_ca_topic_score_gemma":0.0009803944,"teacher_disagreement_score":0.001638215,"about_ca_system_score_codex":0.0009390528,"about_ca_system_score_gemma":0.000911623,"threshold_uncertainty_score":0.008663833},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35629162,0.0015964796,0.6294366,0.0004921841,0.00010639935,0.000118362455,0.00026421985,0.0004650427,0.011229184],"genre_scores_gemma":[0.96932304,0.00028369334,0.029276852,0.00007930585,0.000050601273,0.00006734966,0.00009271359,0.000032047195,0.0007943176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954727,0.0016867758,0.00020094872,0.00038354425,0.0013484249,0.00090757007],"domain_scores_gemma":[0.9739459,0.018469732,0.0020655796,0.0022940305,0.0026964268,0.00052837544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005050877,0.0021552027,0.0014229395,0.0014345817,0.0008178432,0.0019575246,0.0010785984,0.0018561373,0.0011508436],"category_scores_gemma":[0.027580462,0.00035745744,0.00045482462,0.002007674,0.0030908878,0.0026238146,0.0029346712,0.001138269,0.00025654642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039004465,0.000047705074,0.002705526,0.00013014364,0.00011156188,0.00031078316,0.00015098367,0.8614672,0.010904638,0.10371251,0.0004979578,0.019570919],"study_design_scores_gemma":[0.000026572861,0.00018073044,0.00045613913,0.000027388489,0.000027523864,0.00031007876,0.00003517074,0.9464891,0.01048336,0.04147209,0.00042358495,0.000068182075],"about_ca_topic_score_codex":0.0011276659,"about_ca_topic_score_gemma":0.0010782917,"teacher_disagreement_score":0.005050877,"about_ca_system_score_codex":0.0016461038,"about_ca_system_score_gemma":0.0011603135,"threshold_uncertainty_score":0.02671194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08370195,0.0010359173,0.8944529,0.0005020254,0.0002515963,0.00010855358,0.00040493088,0.0015390181,0.018003078],"genre_scores_gemma":[0.7200037,0.0005663196,0.2592515,0.0002787317,0.00012202962,0.00008696786,0.0003956694,0.00007827126,0.019216752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916124,0.0001878311,0.000036622925,0.00011899667,0.00040528784,0.000090017194],"domain_scores_gemma":[0.99846894,0.0008104889,0.00012712405,0.00020838194,0.00035129645,0.000033826647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603061,0.00041886317,0.0004345495,0.0008444846,0.00035849476,0.00060497026,0.00051255024,0.0008234442,0.0039699897],"category_scores_gemma":[0.0046463246,0.0002413989,0.00018125384,0.00057092024,0.0003995152,0.0005210859,0.0005460573,0.0004640911,0.0017516639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011147307,0.00018150681,0.0020354346,0.00025838907,0.00010291601,0.00024258225,0.00021236613,0.10446737,0.16803315,0.021500673,0.0074074627,0.69444346],"study_design_scores_gemma":[0.000038104652,0.00014576627,0.0015157765,0.00007003046,0.000024510016,0.00022060213,0.000019763249,0.9257045,0.05617526,0.011297662,0.0047543575,0.00003367162],"about_ca_topic_score_codex":0.0016136918,"about_ca_topic_score_gemma":0.0033109116,"teacher_disagreement_score":0.0039699897,"about_ca_system_score_codex":0.0005087277,"about_ca_system_score_gemma":0.0006988685,"threshold_uncertainty_score":0.013280988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01098139,0.00041818534,0.98792994,0.00005469813,0.0000073522747,0.000009167802,0.000023432873,0.00012268069,0.00045310246],"genre_scores_gemma":[0.65568167,0.0025176622,0.33843392,0.000079884725,0.00009437493,0.00008609636,0.00030429463,0.00011282668,0.002689261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993305,0.00032302368,0.000028809161,0.000096960626,0.00016070345,0.000059976715],"domain_scores_gemma":[0.996527,0.002708297,0.00029830058,0.00016667545,0.00026941762,0.000030341815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576359,0.0008853201,0.0009136465,0.0005159019,0.00032669856,0.0008914775,0.0006271035,0.0007413236,0.0008147319],"category_scores_gemma":[0.01167232,0.0005035141,0.00038143535,0.0008488917,0.0010377399,0.0021192862,0.0007674409,0.0006803546,0.0005574402],"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.00028775574,0.00003261196,0.0017693534,0.00020961363,0.000063502055,0.00018425062,0.00013475397,0.84770054,0.009010232,0.029203884,0.0008479858,0.11055539],"study_design_scores_gemma":[0.00001605207,0.000027428341,0.0003654926,0.000015281159,0.000009564109,0.00008228679,0.000014009786,0.9836145,0.0026687607,0.012708211,0.0004559608,0.000022346152],"about_ca_topic_score_codex":0.0012314239,"about_ca_topic_score_gemma":0.0009641126,"teacher_disagreement_score":0.001576359,"about_ca_system_score_codex":0.00044758097,"about_ca_system_score_gemma":0.0006674382,"threshold_uncertainty_score":0.008336723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5102465,0.0017171169,0.47362575,0.0003189977,0.000021563283,0.000034456152,0.00019028252,0.00044130193,0.013404032],"genre_scores_gemma":[0.98551685,0.0005073414,0.01292382,0.000044759163,0.000013228865,0.000014672752,0.0000684555,0.000033625012,0.0008771764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989918,0.0004323382,0.00003781575,0.00009457811,0.0002816228,0.00016176497],"domain_scores_gemma":[0.99626476,0.002409378,0.00045649218,0.00027368017,0.0005347131,0.000060946968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013902746,0.0009292118,0.00060335244,0.0005360252,0.00032906642,0.00080597494,0.0004674644,0.00059752614,0.001736002],"category_scores_gemma":[0.0046621896,0.00026025664,0.00043704745,0.0008476105,0.0008796104,0.00079829356,0.00076458807,0.00046318027,0.00046467638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050320255,0.000034163433,0.00658282,0.00014321365,0.00014638451,0.00032446053,0.00026426069,0.89015037,0.03548692,0.029973138,0.0005883598,0.035802666],"study_design_scores_gemma":[0.000010432557,0.00017353952,0.002401495,0.000022905326,0.000051750438,0.00031468843,0.00006417626,0.97138387,0.019943336,0.005180523,0.00041965157,0.000033637098],"about_ca_topic_score_codex":0.0016587339,"about_ca_topic_score_gemma":0.001343646,"teacher_disagreement_score":0.001736002,"about_ca_system_score_codex":0.001059207,"about_ca_system_score_gemma":0.00058788835,"threshold_uncertainty_score":0.007685125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98448515,0.00037973144,0.0117961215,0.00017928299,0.000021399683,0.000009013517,0.000071770286,0.00011802029,0.0029395497],"genre_scores_gemma":[0.9988771,0.00006955033,0.0006933914,0.00001765559,0.000006520493,0.0000026183518,0.000022096592,0.000004422248,0.00030659523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935716,0.00018059312,0.000023842804,0.000064665575,0.0001952964,0.00017844727],"domain_scores_gemma":[0.9973132,0.0016954611,0.00033525116,0.0001659984,0.00040149383,0.00008860732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287489,0.0006429955,0.0004911873,0.00048035127,0.00065355137,0.00060898793,0.0003613223,0.00084490154,0.0011832854],"category_scores_gemma":[0.005081823,0.00011823795,0.00015608517,0.00065474684,0.0008590697,0.0010164028,0.000978358,0.00034264263,0.00015744483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029774755,0.00020891984,0.03438144,0.00037734685,0.00013616901,0.0017761523,0.00053737476,0.73321277,0.14076263,0.0123951975,0.0009863758,0.07224823],"study_design_scores_gemma":[0.00008818449,0.0017135874,0.018427884,0.00005755692,0.000068750094,0.0014322201,0.00044819733,0.89744395,0.0739342,0.005436214,0.0008441827,0.00010503473],"about_ca_topic_score_codex":0.0022029507,"about_ca_topic_score_gemma":0.002140582,"teacher_disagreement_score":0.0022029507,"about_ca_system_score_codex":0.00049984106,"about_ca_system_score_gemma":0.00050420495,"threshold_uncertainty_score":0.0043828487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41341838,0.0032749423,0.5561743,0.00080150476,0.00008662569,0.00007859134,0.00027604934,0.00026033708,0.025629135],"genre_scores_gemma":[0.99084574,0.0007635969,0.0071706213,0.00006690759,0.000043552922,0.000033371696,0.000029388442,0.000020309813,0.001026483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864036,0.0005623239,0.0000509983,0.00013097916,0.00035430942,0.00026110566],"domain_scores_gemma":[0.99283713,0.0056936513,0.000499652,0.0003247706,0.00047963412,0.00016521272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024925002,0.0011304801,0.00079694483,0.000922355,0.00073078397,0.0017335314,0.0006691489,0.000954623,0.0015894943],"category_scores_gemma":[0.009425363,0.0004799403,0.00044187505,0.0013206563,0.0014335554,0.0018531748,0.0013343246,0.00069919653,0.0003475737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047748451,0.00006937463,0.0020088148,0.0002440111,0.000095827694,0.0007452426,0.00039799788,0.7419724,0.026874358,0.1898584,0.0012905491,0.035965577],"study_design_scores_gemma":[0.000032078588,0.00020200759,0.00076341233,0.00004917218,0.000039864237,0.0009398244,0.00011788101,0.91914296,0.008625095,0.06941705,0.00061481,0.000055813995],"about_ca_topic_score_codex":0.0005566014,"about_ca_topic_score_gemma":0.00069555617,"teacher_disagreement_score":0.0024925002,"about_ca_system_score_codex":0.0015873702,"about_ca_system_score_gemma":0.0005307951,"threshold_uncertainty_score":0.013181746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4953985,0.0007231044,0.49813765,0.0003142351,0.00003393881,0.00008455345,0.00017987376,0.0005918879,0.0045363335],"genre_scores_gemma":[0.99111736,0.00033215698,0.0074699204,0.000048988768,0.000026205347,0.000057915644,0.00011036347,0.000049920887,0.0007871223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994618,0.00017150502,0.000018884533,0.00008887175,0.00015408061,0.000104752566],"domain_scores_gemma":[0.9977896,0.0013414853,0.0002813124,0.000104611914,0.0004284379,0.000054487013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006616848,0.0007258481,0.00035692385,0.0012058796,0.00041305693,0.0005592945,0.0008342901,0.0005907186,0.0005505964],"category_scores_gemma":[0.0045854393,0.00026648803,0.0002394144,0.0009608352,0.00066620973,0.0012421345,0.0004988684,0.00031523456,0.00019274322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011298168,0.000047400077,0.002696773,0.00006774122,0.000019707877,0.00014128679,0.00007946661,0.9687903,0.014120711,0.0048616366,0.00025828168,0.008803739],"study_design_scores_gemma":[0.000001707771,0.000020746344,0.00041534574,0.0000027196677,0.0000026234352,0.0000366865,0.000020178508,0.996198,0.0014401675,0.0017498019,0.00010719367,0.0000047400326],"about_ca_topic_score_codex":0.003022313,"about_ca_topic_score_gemma":0.0017143005,"teacher_disagreement_score":0.003022313,"about_ca_system_score_codex":0.0011941093,"about_ca_system_score_gemma":0.00037122547,"threshold_uncertainty_score":0.008663893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13238859,0.0007245586,0.86323255,0.00027235012,0.000021452744,0.000024264535,0.00003092898,0.00023254634,0.0030727983],"genre_scores_gemma":[0.9530513,0.00027089275,0.04590538,0.00006967586,0.000022269169,0.000024494428,0.000019393936,0.000012978149,0.0006236139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998744,0.0005500923,0.00005316676,0.00017083275,0.0002980035,0.00018380066],"domain_scores_gemma":[0.99810046,0.0013610218,0.00019410685,0.00012218558,0.00018326579,0.000039019502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135755,0.00071119,0.00060249795,0.00038907368,0.0003144011,0.00072787906,0.0005081233,0.001012329,0.00050970376],"category_scores_gemma":[0.0049464717,0.0003466736,0.00022206652,0.00040064813,0.00074875157,0.00085358194,0.00062187505,0.00042568267,0.00020676995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009986334,0.00007054951,0.001667209,0.00030111359,0.00011959688,0.00050032896,0.00030240428,0.67787445,0.11370639,0.080208585,0.0007291962,0.12352161],"study_design_scores_gemma":[0.000059353104,0.0001925092,0.00052562024,0.000034714187,0.000051630544,0.0003564309,0.000054379518,0.94849086,0.02803186,0.021378595,0.0007936387,0.000030299483],"about_ca_topic_score_codex":0.0009460065,"about_ca_topic_score_gemma":0.00075272704,"teacher_disagreement_score":0.00135755,"about_ca_system_score_codex":0.00050352514,"about_ca_system_score_gemma":0.0005437593,"threshold_uncertainty_score":0.0071794987},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029171742,0.00044663862,0.9659673,0.00014129406,0.000057279925,0.000034934532,0.00009151289,0.0004123675,0.0036769272],"genre_scores_gemma":[0.56910044,0.0007135722,0.42278007,0.00011337476,0.0000604757,0.00008120444,0.00037895597,0.000104484265,0.0066674757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991597,0.00027075844,0.00004520191,0.00006693278,0.00039039683,0.00006692524],"domain_scores_gemma":[0.99857354,0.00071434304,0.0001084455,0.00022279791,0.0003482642,0.00003255674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063498726,0.0004097752,0.000551683,0.00045196354,0.00026851252,0.0005151817,0.0005326188,0.000646609,0.0012845204],"category_scores_gemma":[0.0052836514,0.00023991687,0.0002572776,0.00059823727,0.00047276675,0.00087220594,0.0007846102,0.00048453652,0.00089909334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003196326,0.00004615903,0.0010082036,0.00020057303,0.000054873686,0.00018298156,0.00015713561,0.46587405,0.03559039,0.093034044,0.0025203973,0.40101156],"study_design_scores_gemma":[0.000014556804,0.00006295641,0.00021764511,0.000013588271,0.00000691161,0.00010633063,0.000007551567,0.9655348,0.0164001,0.015567113,0.0020559202,0.000012397207],"about_ca_topic_score_codex":0.0016750395,"about_ca_topic_score_gemma":0.002599621,"teacher_disagreement_score":0.0016750395,"about_ca_system_score_codex":0.00045100035,"about_ca_system_score_gemma":0.0013592857,"threshold_uncertainty_score":0.0042971373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47246325,0.0012620542,0.5195923,0.00022945715,0.000029374463,0.00006859121,0.000064873566,0.00018938277,0.0061006923],"genre_scores_gemma":[0.98566854,0.00027769024,0.013346901,0.00001765385,0.000011207406,0.000029384317,0.000015168537,0.0000056091108,0.00062786875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00033909973,0.000021873806,0.0000654092,0.00018881439,0.00007102532],"domain_scores_gemma":[0.99769175,0.0017014315,0.00018809472,0.00009343119,0.00029119846,0.000034134817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016444111,0.00081440626,0.00062885834,0.0004993546,0.00043746803,0.0007200996,0.0007336211,0.0007331155,0.0003670809],"category_scores_gemma":[0.0032629936,0.00031125822,0.00026486465,0.0007379917,0.00094569294,0.0007776068,0.00072370796,0.00026492955,0.00013291031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011661526,0.000031336982,0.00054137164,0.000056731496,0.000027593092,0.00019107845,0.000111671274,0.97354907,0.005406083,0.009365694,0.00017176631,0.010431048],"study_design_scores_gemma":[0.000007570402,0.000109735025,0.0001223536,0.0000037569428,0.000013974426,0.000052847332,0.000026305855,0.9950079,0.0014012447,0.00314652,0.000100860365,0.000006962067],"about_ca_topic_score_codex":0.0019048007,"about_ca_topic_score_gemma":0.0028764135,"teacher_disagreement_score":0.0019048007,"about_ca_system_score_codex":0.000864098,"about_ca_system_score_gemma":0.0004523299,"threshold_uncertainty_score":0.008696616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006122173,0.00077393063,0.99196386,0.00006128195,0.000037485635,0.000017216187,0.000065984306,0.00021744061,0.000740695],"genre_scores_gemma":[0.36111215,0.003660825,0.6306258,0.00014285996,0.0004002616,0.00016589976,0.000620256,0.00014980465,0.0031221542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990374,0.0004222284,0.00004771786,0.00010695354,0.00030421192,0.00008157256],"domain_scores_gemma":[0.9962063,0.0022790297,0.00048163158,0.00050577725,0.0004720377,0.000055142944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019066836,0.00092201197,0.0009997407,0.0011629298,0.0002394678,0.0009233641,0.0008534738,0.00068887556,0.0016591982],"category_scores_gemma":[0.012833206,0.0002638167,0.00047990386,0.0013919345,0.0005472002,0.001955291,0.00084586506,0.0010356688,0.00056653644],"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.0002776217,0.000043130476,0.002488981,0.0003938929,0.00019732508,0.0001374818,0.00011688065,0.50538456,0.016629294,0.15928979,0.0042395885,0.31080145],"study_design_scores_gemma":[0.000029376932,0.000064744214,0.0012344319,0.000049302504,0.00006084604,0.0002346915,0.000022659444,0.93439263,0.006210062,0.0525721,0.0050720787,0.000057066318],"about_ca_topic_score_codex":0.0007623487,"about_ca_topic_score_gemma":0.00087498565,"teacher_disagreement_score":0.0019066836,"about_ca_system_score_codex":0.0005465775,"about_ca_system_score_gemma":0.0007350893,"threshold_uncertainty_score":0.010083616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.936934,0.000886981,0.053552452,0.00020104193,0.00009304639,0.000024460685,0.00016366757,0.0004607222,0.0076837027],"genre_scores_gemma":[0.9880499,0.00019575366,0.0105827125,0.000039848623,0.000035384484,0.00001228639,0.0001146043,0.000018177097,0.0009512921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992576,0.00017396754,0.000031251584,0.000085291475,0.0002482373,0.00020367149],"domain_scores_gemma":[0.9971706,0.0015639771,0.00020716724,0.000264785,0.0006906371,0.000102843755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074668264,0.0005949813,0.00058252236,0.00045871525,0.00035212174,0.00062531955,0.00044109146,0.0009859317,0.0012936193],"category_scores_gemma":[0.004868951,0.0001451551,0.00023683454,0.0005437313,0.00059371773,0.0005245561,0.00045107538,0.00039478127,0.00034566142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009534447,0.00040920204,0.0107672075,0.00057489466,0.00039307997,0.002703228,0.0006317337,0.5457891,0.20082547,0.014764875,0.0023337307,0.21127306],"study_design_scores_gemma":[0.00018998228,0.0021435858,0.007906844,0.00005367657,0.00016772705,0.0015934122,0.0001033432,0.9054404,0.07757594,0.0021552893,0.002564301,0.00010549327],"about_ca_topic_score_codex":0.0029123984,"about_ca_topic_score_gemma":0.0017165419,"teacher_disagreement_score":0.0029123984,"about_ca_system_score_codex":0.00043353168,"about_ca_system_score_gemma":0.0006228425,"threshold_uncertainty_score":0.0057908893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018505031,0.0022128185,0.9626104,0.00029149203,0.00015493698,0.00007260393,0.0001721403,0.00030848267,0.01567203],"genre_scores_gemma":[0.7018287,0.007951384,0.2761732,0.00041041593,0.00044260695,0.00037851444,0.00033777684,0.00041622258,0.012061105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999087,0.0002652731,0.000090688794,0.00009128744,0.00036977706,0.0000960794],"domain_scores_gemma":[0.9963374,0.0024204797,0.0003667671,0.0003164195,0.0004985614,0.000060349932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002894439,0.0019199308,0.0009248291,0.0016829827,0.00034752119,0.0017102251,0.0010229509,0.0009534486,0.0051437067],"category_scores_gemma":[0.010451057,0.00039711807,0.0008145619,0.0011381935,0.0014857939,0.0022382832,0.0010200726,0.0011587285,0.0020134815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001433245,0.000052946132,0.0009123667,0.0008218438,0.00008185096,0.00072100124,0.00042521165,0.2533896,0.017914625,0.6665858,0.0032431663,0.055708308],"study_design_scores_gemma":[0.00002543143,0.00015255089,0.0012876338,0.00031183613,0.00009896333,0.001774672,0.00015284067,0.6856136,0.011834967,0.29192385,0.0067165657,0.00010715367],"about_ca_topic_score_codex":0.00033699424,"about_ca_topic_score_gemma":0.0005204116,"teacher_disagreement_score":0.0051437067,"about_ca_system_score_codex":0.0009295186,"about_ca_system_score_gemma":0.000548191,"threshold_uncertainty_score":0.017207384},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019177588,0.00014156336,0.98001444,0.000055633765,0.0000104162855,0.000010113011,0.000031135805,0.00016924765,0.00038983725],"genre_scores_gemma":[0.71866304,0.0007862395,0.27857962,0.000104352046,0.000055757806,0.000100182064,0.00036839073,0.00009502376,0.0012473551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990011,0.00043761294,0.000047620524,0.00017131367,0.00026612144,0.00007619839],"domain_scores_gemma":[0.9966918,0.002048268,0.0003430998,0.0002831822,0.0005514734,0.00008214386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020499777,0.0006303924,0.00082305586,0.0011800054,0.00030762664,0.0010243459,0.0011130208,0.0007332832,0.0007358575],"category_scores_gemma":[0.010017145,0.00032827837,0.0005851469,0.0011252944,0.0006518134,0.002130126,0.0009533686,0.0010318039,0.0003083475],"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.00015444773,0.000031361804,0.005653204,0.00010215266,0.00008541738,0.00034940257,0.00012109014,0.8433921,0.004981784,0.049133547,0.0012582878,0.09473719],"study_design_scores_gemma":[0.0000033850338,0.00001171438,0.00043150564,0.000007642141,0.000006642762,0.00013562682,0.000014894903,0.98231035,0.00095866586,0.015785228,0.00032004176,0.000014386222],"about_ca_topic_score_codex":0.00216973,"about_ca_topic_score_gemma":0.001437097,"teacher_disagreement_score":0.00216973,"about_ca_system_score_codex":0.00079945824,"about_ca_system_score_gemma":0.0007644151,"threshold_uncertainty_score":0.010841489},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382864,0.000282185,0.9847691,0.00014823493,0.000046248817,0.00018675534,0.00004706956,0.0002595003,0.00287804],"genre_scores_gemma":[0.16571197,0.0002751103,0.83159244,0.0001402201,0.00004527804,0.0005806834,0.00020390659,0.00007940249,0.0013710038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918574,0.0003608019,0.000034160737,0.00011279405,0.00016706038,0.00013931021],"domain_scores_gemma":[0.9984285,0.0011812248,0.00010255266,0.00008260716,0.00013131942,0.00007367961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015620139,0.0014662609,0.0014084204,0.001241934,0.00086387695,0.0011925634,0.0019675237,0.0021611422,0.0030525257],"category_scores_gemma":[0.003396078,0.0008102784,0.00091574725,0.0012611931,0.0011718951,0.001471783,0.0013827151,0.00138088,0.0005059193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010970326,0.00012956663,0.00030963434,0.0001152685,0.00004605939,0.00010209157,0.00010756356,0.91539973,0.0010426716,0.014847722,0.002099571,0.06569029],"study_design_scores_gemma":[0.000119967415,0.000096021075,0.000055311804,0.00001880081,0.000020216892,0.00004995809,0.000042698997,0.9857135,0.0004758511,0.011754184,0.0016395107,0.000014018758],"about_ca_topic_score_codex":0.0033809333,"about_ca_topic_score_gemma":0.0029028514,"teacher_disagreement_score":0.0033809333,"about_ca_system_score_codex":0.0010713531,"about_ca_system_score_gemma":0.0019326259,"threshold_uncertainty_score":0.010211766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03960446,0.0008294929,0.95688874,0.00008403067,0.00003175377,0.000019779814,0.00004798615,0.00037335567,0.0021203712],"genre_scores_gemma":[0.89365244,0.00079580623,0.10380171,0.0000684,0.000053633583,0.000053659314,0.00008259637,0.00006779642,0.0014239609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975237,0.00072022865,0.00010748035,0.00016896235,0.0012970758,0.00018244599],"domain_scores_gemma":[0.9935812,0.0041328734,0.00039518208,0.0008932291,0.0009494402,0.000048155474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028083592,0.0007437982,0.0009512917,0.0011215326,0.00036061753,0.00090679165,0.0012565091,0.0010117476,0.0011015156],"category_scores_gemma":[0.013870345,0.00039054875,0.00038749754,0.00084632175,0.0010183312,0.0021047846,0.0009565464,0.00077263726,0.00037324085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024015499,0.000030250101,0.001059564,0.00016774796,0.00006718655,0.00022011773,0.00017199789,0.8904068,0.01144328,0.041227143,0.0003459932,0.05461976],"study_design_scores_gemma":[0.000003629267,0.000023190778,0.00020520149,0.0000071912827,0.0000062294803,0.000106082756,0.000007666258,0.9928161,0.0024739567,0.0042088255,0.00013291604,0.000008980381],"about_ca_topic_score_codex":0.0013465015,"about_ca_topic_score_gemma":0.0008370421,"teacher_disagreement_score":0.0028083592,"about_ca_system_score_codex":0.0009467242,"about_ca_system_score_gemma":0.0006685099,"threshold_uncertainty_score":0.014852226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242082,0.00019309665,0.9217335,0.00012971701,0.00004813331,0.00006959612,0.000067436995,0.00047927577,0.004858421],"genre_scores_gemma":[0.5180641,0.0003505826,0.4777238,0.00009824828,0.000022992961,0.0001009284,0.0002113841,0.00006433774,0.0033635967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999824,0.000036579862,0.0000074105455,0.000025086414,0.00008008588,0.000026928454],"domain_scores_gemma":[0.99960643,0.0001516498,0.000037409733,0.00008354635,0.00009901714,0.00002198274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025955512,0.0003315507,0.00024558714,0.00042908412,0.00032048003,0.0002957182,0.0005598355,0.00035143024,0.0006927519],"category_scores_gemma":[0.0010879429,0.00013943065,0.0002639586,0.00035046515,0.0005000219,0.0006026398,0.0006603971,0.0006063152,0.00027044822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028583736,0.000111374466,0.0023334685,0.0003688546,0.000043361113,0.0007493548,0.00029777962,0.23343006,0.16673145,0.3093966,0.002454984,0.28379685],"study_design_scores_gemma":[0.00004360821,0.00011908577,0.00045534843,0.000024333458,0.00001958576,0.000404007,0.000024652598,0.83512896,0.11780634,0.036733285,0.009206172,0.000034641987],"about_ca_topic_score_codex":0.00080937054,"about_ca_topic_score_gemma":0.00093524274,"teacher_disagreement_score":0.00080937054,"about_ca_system_score_codex":0.00027857596,"about_ca_system_score_gemma":0.00060026115,"threshold_uncertainty_score":0.0023174882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860999,0.0034815283,0.81533504,0.00077031355,0.000080531965,0.000067408364,0.00033132746,0.00039130176,0.020932473],"genre_scores_gemma":[0.98066163,0.0015732845,0.013675745,0.000059238624,0.00006981827,0.000081766455,0.0001338922,0.000055553086,0.0036891375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.0005242767,0.00004588175,0.00012626864,0.00043932514,0.00022168807],"domain_scores_gemma":[0.9923598,0.0054533994,0.00085523946,0.00031470606,0.00091901276,0.00009774424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024394696,0.0013224083,0.0009824062,0.0011512921,0.00056680193,0.001250737,0.0011285922,0.0012042715,0.0022966834],"category_scores_gemma":[0.0072945897,0.0005302024,0.00051122205,0.0010411559,0.0014105969,0.0013971865,0.0012472585,0.0010490968,0.0004441449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014260584,0.00002515823,0.0010966276,0.00010413764,0.00004663728,0.0003354949,0.00018650394,0.9171502,0.0033678357,0.071195014,0.0005728786,0.0057769036],"study_design_scores_gemma":[0.0000064800256,0.000026837477,0.00022299384,0.000011722592,0.000012585683,0.00005765936,0.000021244023,0.99176276,0.00050906703,0.0071905865,0.00016497714,0.000013063123],"about_ca_topic_score_codex":0.0055931704,"about_ca_topic_score_gemma":0.0025505668,"teacher_disagreement_score":0.0055931704,"about_ca_system_score_codex":0.0016328278,"about_ca_system_score_gemma":0.0009739571,"threshold_uncertainty_score":0.012901306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011134909,0.00028287093,0.9860497,0.00011795537,0.00003819431,0.0001119559,0.000035773843,0.00014187933,0.0020868636],"genre_scores_gemma":[0.6497969,0.0010032383,0.3427683,0.00020034303,0.00006733511,0.0004772519,0.00012817197,0.000031766085,0.0055267103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.00040356762,0.000059436854,0.00013402224,0.0005119206,0.000055292403],"domain_scores_gemma":[0.998467,0.0007663074,0.00019669165,0.0002575958,0.000278869,0.000033389984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014393198,0.0007938634,0.00070968294,0.0005455277,0.00060248043,0.00061460986,0.0013255223,0.0008597543,0.00090380927],"category_scores_gemma":[0.0032610684,0.00024925295,0.00043603213,0.0006291248,0.00092736864,0.0011794964,0.0010373559,0.0008527592,0.00031368225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003867937,0.00016621519,0.00036119504,0.0004970306,0.00015533659,0.0008366984,0.0005652871,0.33981198,0.15165173,0.36327443,0.0032969008,0.13899645],"study_design_scores_gemma":[0.00010211879,0.00043726095,0.00014884022,0.00003637465,0.000098162775,0.0008721287,0.000040875166,0.88796264,0.042957503,0.05792528,0.009357896,0.000060866594],"about_ca_topic_score_codex":0.000535803,"about_ca_topic_score_gemma":0.0008353676,"teacher_disagreement_score":0.0014393198,"about_ca_system_score_codex":0.00059427205,"about_ca_system_score_gemma":0.0009232197,"threshold_uncertainty_score":0.0076119304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002626553,0.00023719686,0.9965,0.000034157016,0.000029552202,0.000009107543,0.000034066124,0.00017030007,0.00035891565],"genre_scores_gemma":[0.24378417,0.0012229098,0.750387,0.0001978447,0.0002686402,0.00015567473,0.0005096537,0.00016627941,0.0033078245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00023480404,0.00004785274,0.00012740958,0.00029053722,0.000056353183],"domain_scores_gemma":[0.99792284,0.0011329912,0.0002906344,0.00024054511,0.00036456189,0.000048396585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010294517,0.0009769134,0.001183401,0.0009163024,0.0003667895,0.0010147527,0.0009967863,0.0012591076,0.0013516922],"category_scores_gemma":[0.008747117,0.00052079494,0.0005153789,0.0011014815,0.0005550549,0.0018342057,0.0010712261,0.0012145228,0.0011506703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006139011,0.00013717385,0.0048518507,0.0005232353,0.00025783127,0.00038671482,0.00016653338,0.33947933,0.068335265,0.071131706,0.0060738777,0.50804263],"study_design_scores_gemma":[0.00002508494,0.00006306648,0.00073638133,0.00003151973,0.000039786686,0.00034618343,0.000014521581,0.9744707,0.011820869,0.009544485,0.0028598716,0.000047642636],"about_ca_topic_score_codex":0.0006649157,"about_ca_topic_score_gemma":0.0009930993,"teacher_disagreement_score":0.0013516922,"about_ca_system_score_codex":0.00047094875,"about_ca_system_score_gemma":0.00079251983,"threshold_uncertainty_score":0.0054442883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004564775,0.00027115273,0.98969966,0.00026212086,0.000018680938,0.000032125812,0.000022253153,0.00007768322,0.005051544],"genre_scores_gemma":[0.45043692,0.0011206174,0.53040063,0.0003242377,0.00012035678,0.000665153,0.00010765433,0.00021685532,0.01660758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994906,0.00026819832,0.000010736735,0.00004529949,0.00013374265,0.000051492945],"domain_scores_gemma":[0.99936444,0.00049758976,0.0000365104,0.000016800286,0.00007028797,0.000014405942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010592574,0.00075655646,0.0007955142,0.00038547078,0.00029403283,0.0011587644,0.0006224719,0.0007553444,0.002908261],"category_scores_gemma":[0.0026773685,0.00049499096,0.00036361295,0.00071243546,0.0008476974,0.0007569679,0.0007704048,0.0011676318,0.0004885645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027743363,0.000036476795,0.00008297414,0.00006821635,0.000012759529,0.00003365663,0.00005175679,0.92219496,0.00071788346,0.051854644,0.0013663011,0.023552742],"study_design_scores_gemma":[0.000007129185,0.00000917855,0.000010834278,0.0000048312604,0.0000017418432,0.000004524176,0.000005351983,0.98836577,0.00016653216,0.010937967,0.00048398587,0.0000021656078],"about_ca_topic_score_codex":0.0020047287,"about_ca_topic_score_gemma":0.0020252485,"teacher_disagreement_score":0.002908261,"about_ca_system_score_codex":0.0010621303,"about_ca_system_score_gemma":0.0010262522,"threshold_uncertainty_score":0.009729087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10595609,0.0012151938,0.8867495,0.00042664245,0.00006408945,0.000053570908,0.00008134802,0.00012594694,0.0053274827],"genre_scores_gemma":[0.96260875,0.00058573915,0.03429284,0.0000684983,0.00004432391,0.00005928186,0.000039259146,0.000051297327,0.0022500097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.0002596937,0.000015656546,0.000045689132,0.000097734315,0.00011477728],"domain_scores_gemma":[0.9995158,0.00028963343,0.00005323586,0.000029357665,0.000072060546,0.000039928975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084333593,0.00063071813,0.00068364694,0.00035626043,0.00033439972,0.0012940383,0.0007135948,0.00051103404,0.0011900868],"category_scores_gemma":[0.0016568336,0.00040339868,0.00019724124,0.0006907439,0.000648469,0.0008833446,0.0005931898,0.0005107611,0.00017850994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008086849,0.000040355295,0.0003431633,0.000047365273,0.000015630361,0.00008992568,0.000028919812,0.9668177,0.0022560684,0.013408424,0.0006774201,0.016194167],"study_design_scores_gemma":[0.000006598289,0.000010516108,0.000058494883,0.0000017080376,0.0000028870797,0.000009155525,0.000010812976,0.99703974,0.00038365944,0.0023401869,0.000134086,0.0000020604714],"about_ca_topic_score_codex":0.0034619656,"about_ca_topic_score_gemma":0.0030987111,"teacher_disagreement_score":0.0034619656,"about_ca_system_score_codex":0.0012959371,"about_ca_system_score_gemma":0.00084736955,"threshold_uncertainty_score":0.009402752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026464718,0.00017943968,0.99638075,0.00007133426,0.00008448119,0.000030758056,0.000016759075,0.00022654547,0.00036346086],"genre_scores_gemma":[0.041390676,0.00024531354,0.95552224,0.00009801033,0.00011932811,0.0000757347,0.00008783159,0.00005945557,0.002401439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.00006272431,0.000027709268,0.00008240098,0.00023906537,0.000039666338],"domain_scores_gemma":[0.99960345,0.00008052009,0.000059822614,0.00009676815,0.00013243992,0.000027075586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005406682,0.0007026102,0.00059969217,0.00067088765,0.00045738023,0.00067218114,0.00089669746,0.0012690387,0.0031088386],"category_scores_gemma":[0.001032593,0.000331033,0.000482403,0.0006070553,0.0005782174,0.0013774879,0.0007048549,0.001462018,0.0023151669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002563334,0.00014816923,0.00044252886,0.000321771,0.00007822154,0.00014666245,0.00010634811,0.023164831,0.33357972,0.04494197,0.0039603,0.5928532],"study_design_scores_gemma":[0.00026663448,0.0006006736,0.0011950823,0.000050244016,0.000080942045,0.0013638607,0.000030238882,0.71005404,0.2235308,0.022283144,0.04037108,0.00017331731],"about_ca_topic_score_codex":0.00037987492,"about_ca_topic_score_gemma":0.0007302215,"teacher_disagreement_score":0.0031088386,"about_ca_system_score_codex":0.00030244354,"about_ca_system_score_gemma":0.0007781776,"threshold_uncertainty_score":0.010400057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08030955,0.006345765,0.8543011,0.0018515505,0.00015671589,0.00013999655,0.0013253602,0.0005897083,0.054980233],"genre_scores_gemma":[0.9566681,0.005086041,0.028178072,0.00036307744,0.00034651306,0.00037903944,0.0007617717,0.00017027649,0.008047176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778444,0.0007214812,0.00005511076,0.0001339016,0.0007822543,0.00052283943],"domain_scores_gemma":[0.9853683,0.0110104075,0.0007711073,0.00064483716,0.0020361582,0.00016917694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028636123,0.0014493598,0.0011558563,0.0018274236,0.00063474826,0.002096211,0.0010369725,0.0007954524,0.0056810374],"category_scores_gemma":[0.014633144,0.00053800276,0.0006764064,0.0023404441,0.0020671654,0.0022695982,0.0017379441,0.0012819567,0.0011575994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950091,0.000042949687,0.0006924355,0.0002561799,0.00006678258,0.00026953322,0.0002570374,0.73999465,0.0037454707,0.23166655,0.0056872647,0.017161708],"study_design_scores_gemma":[0.000009592562,0.000020455622,0.00029864445,0.000058460733,0.000018513932,0.0001013694,0.000052670206,0.95424396,0.0010432665,0.04311201,0.0010164083,0.000024551124],"about_ca_topic_score_codex":0.008411033,"about_ca_topic_score_gemma":0.0049867416,"teacher_disagreement_score":0.008411033,"about_ca_system_score_codex":0.0031523514,"about_ca_system_score_gemma":0.0022361479,"threshold_uncertainty_score":0.02287203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49366382,0.0003727727,0.46449947,0.0013068343,0.00030672338,0.00017688407,0.0004445044,0.0007502679,0.038478713],"genre_scores_gemma":[0.97639227,0.00010038453,0.020017851,0.00013858629,0.000032606782,0.00012207718,0.00009042905,0.000070642476,0.0030350878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.00019078073,0.000019570945,0.000041394527,0.00013592704,0.00007988072],"domain_scores_gemma":[0.99847895,0.00089349545,0.000108336724,0.0001983072,0.00020506649,0.00011588688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065525377,0.00037490606,0.0006638963,0.00053394726,0.00044463715,0.00088467,0.0010588049,0.0013802573,0.004231451],"category_scores_gemma":[0.0037098639,0.00025270422,0.0004891108,0.0005500944,0.0008064847,0.0014565324,0.0009601758,0.00094821147,0.00043477907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006585419,0.000026878988,0.0002929823,0.00002557337,0.00001728128,0.000105311294,0.00006994855,0.9188781,0.0016864975,0.076517776,0.00043261505,0.0018811199],"study_design_scores_gemma":[0.0000075677535,0.0000051912407,0.000024339199,0.0000014046987,0.000001041192,0.000004443921,0.0000036205604,0.99441886,0.00015076803,0.0052675204,0.0001119696,0.0000032827193],"about_ca_topic_score_codex":0.003782224,"about_ca_topic_score_gemma":0.0017895458,"teacher_disagreement_score":0.004231451,"about_ca_system_score_codex":0.0006150069,"about_ca_system_score_gemma":0.00069647154,"threshold_uncertainty_score":0.014155626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86773056,0.001927798,0.10528077,0.00083865796,0.0002560012,0.00008426267,0.00035291127,0.0022480262,0.021281062],"genre_scores_gemma":[0.99609476,0.00018536183,0.0025091013,0.00003002146,0.000021376167,0.000020952162,0.000080072496,0.000027336728,0.0010309756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975781,0.0005629334,0.000126003,0.0003307908,0.00076065015,0.0006415513],"domain_scores_gemma":[0.9932365,0.0033906763,0.0005692238,0.0008895331,0.001748797,0.00016524954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025989693,0.0011404571,0.00075171137,0.0009466458,0.0012425416,0.0016230776,0.0010419814,0.001275571,0.0013071607],"category_scores_gemma":[0.009416165,0.00036309802,0.00032324012,0.0011805648,0.0017637905,0.0018124768,0.0010434064,0.0010238561,0.0004106287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015967751,0.00051487715,0.010669666,0.00028374593,0.00013276069,0.0006145953,0.0006454268,0.82359296,0.047593184,0.025584614,0.004071687,0.08469972],"study_design_scores_gemma":[0.00002761346,0.00036873113,0.0029563112,0.000025379151,0.000050284325,0.00021852725,0.00010188701,0.97115827,0.020387102,0.003968686,0.0006916882,0.00004550064],"about_ca_topic_score_codex":0.0080227675,"about_ca_topic_score_gemma":0.003342146,"teacher_disagreement_score":0.0080227675,"about_ca_system_score_codex":0.002116209,"about_ca_system_score_gemma":0.0012811122,"threshold_uncertainty_score":0.01595211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30336574,0.0030019756,0.6728986,0.000963108,0.00015410909,0.00007300803,0.00012500944,0.00020483341,0.019213641],"genre_scores_gemma":[0.942941,0.00082352053,0.054009058,0.00012782284,0.00006896072,0.00003855753,0.00002847713,0.000018695644,0.0019438283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988965,0.00044713277,0.000020744812,0.00011891658,0.00031739316,0.0001993652],"domain_scores_gemma":[0.9987116,0.0008069244,0.0001221612,0.00010255102,0.00020611373,0.000050674436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012720992,0.0007782302,0.00070243975,0.00048455017,0.00047860056,0.0012777135,0.0006097107,0.001283992,0.0005691305],"category_scores_gemma":[0.0035823258,0.0003848213,0.00024870603,0.0006437273,0.0013730949,0.0014324985,0.0008186443,0.00043668124,0.00019723672],"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.000411732,0.00006971703,0.0013791781,0.00013882961,0.000051997642,0.00020904971,0.0001039083,0.6943664,0.018420303,0.25831676,0.001236709,0.025295405],"study_design_scores_gemma":[0.000023342565,0.000051901217,0.00014339147,0.000011668672,0.000008087951,0.00008832855,0.000013883413,0.9500432,0.0038068595,0.045277134,0.0005120354,0.000020207492],"about_ca_topic_score_codex":0.0016651715,"about_ca_topic_score_gemma":0.0017198224,"teacher_disagreement_score":0.0016651715,"about_ca_system_score_codex":0.0011340291,"about_ca_system_score_gemma":0.0011332231,"threshold_uncertainty_score":0.008227944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01374557,0.002520617,0.97037977,0.00054773194,0.00012894363,0.00008974244,0.0004347028,0.00027665988,0.011876234],"genre_scores_gemma":[0.73488885,0.009915953,0.23553325,0.00069386396,0.00049146375,0.000510508,0.0012759654,0.00022531579,0.016464816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.0002822169,0.00006484096,0.00017179204,0.00051247486,0.0001382522],"domain_scores_gemma":[0.9932607,0.004908661,0.0005820988,0.00025082144,0.00092436094,0.000073359224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025042086,0.0015692888,0.0012197891,0.00102914,0.00057861017,0.0020329799,0.001253135,0.0015897275,0.005458894],"category_scores_gemma":[0.0124281915,0.0004493253,0.00050554716,0.0013702621,0.0016890889,0.0021146887,0.0011511698,0.0014840001,0.0016349405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013414689,0.00009627734,0.001192718,0.0007454417,0.000094799165,0.0007170135,0.0005534137,0.638403,0.010803008,0.27743313,0.0077138725,0.062113155],"study_design_scores_gemma":[0.000029478228,0.000110679066,0.00089560874,0.00015130099,0.00006374497,0.0009880464,0.00016382973,0.90479696,0.0033874142,0.08343144,0.0059110774,0.000070508264],"about_ca_topic_score_codex":0.0018085436,"about_ca_topic_score_gemma":0.002493023,"teacher_disagreement_score":0.005458894,"about_ca_system_score_codex":0.0015940373,"about_ca_system_score_gemma":0.0012379846,"threshold_uncertainty_score":0.01826179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84972167,0.0007613118,0.14189298,0.0003004213,0.00006354659,0.000031509935,0.00021685036,0.00026247877,0.0067492914],"genre_scores_gemma":[0.9957723,0.00014838674,0.0033791768,0.00003138869,0.000010408245,0.0000127721405,0.000050782968,0.000010132195,0.0005846004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00021776943,0.000040003975,0.00006757231,0.00037364714,0.00020280307],"domain_scores_gemma":[0.9907328,0.0066679236,0.00076043105,0.00040655068,0.0012896186,0.00014261407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849673,0.00086257694,0.0004376276,0.0004734958,0.0004358374,0.00079993956,0.00044171058,0.0008155397,0.0010483694],"category_scores_gemma":[0.008286864,0.00019093366,0.0002158002,0.0005342061,0.0009865288,0.0009974958,0.0010932831,0.00056411093,0.00020937622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080297654,0.00006896548,0.0026848768,0.0001457492,0.000048664147,0.00019882154,0.00013614866,0.9260146,0.034810584,0.016187001,0.000402189,0.018499326],"study_design_scores_gemma":[0.000026083344,0.00026370917,0.0013453343,0.000030846008,0.000023993334,0.0001213998,0.000048670747,0.96436685,0.029745428,0.003728244,0.0002568561,0.000042635173],"about_ca_topic_score_codex":0.0022598451,"about_ca_topic_score_gemma":0.0018426094,"teacher_disagreement_score":0.0022598451,"about_ca_system_score_codex":0.0007586443,"about_ca_system_score_gemma":0.0007473101,"threshold_uncertainty_score":0.009782076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11087227,0.0046943743,0.8692143,0.0009988364,0.00028680332,0.000105544066,0.0004844288,0.0003525239,0.012990894],"genre_scores_gemma":[0.922264,0.008328178,0.05943273,0.00028059285,0.0009756415,0.0002718098,0.00054942106,0.000242253,0.007655405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441165,0.0020280217,0.0002563309,0.00058936235,0.0021630717,0.0005515772],"domain_scores_gemma":[0.932719,0.05771866,0.0029052333,0.0024656674,0.003841427,0.00034998963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008184778,0.002166704,0.0014758657,0.002801356,0.00069127564,0.0023435971,0.0018326542,0.0016055836,0.002629102],"category_scores_gemma":[0.052414477,0.0009847742,0.00067018345,0.002835567,0.00355502,0.004610559,0.0020229388,0.002595101,0.0008346094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036726796,0.00004622439,0.0014396892,0.00028000667,0.00005189402,0.00032589288,0.00026964187,0.76664644,0.0021138077,0.19985743,0.0013174447,0.027284306],"study_design_scores_gemma":[0.000028583707,0.00006451078,0.00096879195,0.00009182472,0.000032996366,0.00023772931,0.00003799626,0.9180102,0.002401638,0.077245295,0.00083574443,0.00004470701],"about_ca_topic_score_codex":0.0030544621,"about_ca_topic_score_gemma":0.0015362654,"teacher_disagreement_score":0.008184778,"about_ca_system_score_codex":0.0019476264,"about_ca_system_score_gemma":0.001202776,"threshold_uncertainty_score":0.043285728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015525108,0.0039054425,0.9664042,0.0018770471,0.00050145295,0.00010083899,0.0007473709,0.00043925695,0.010499325],"genre_scores_gemma":[0.85152656,0.015889036,0.08957592,0.0012246028,0.0016984285,0.00092888606,0.0024762216,0.00032409854,0.036356263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991177,0.0002932517,0.000052382547,0.00012662544,0.00028406564,0.0001259493],"domain_scores_gemma":[0.9977089,0.0012611072,0.0002782008,0.00012329625,0.0005301599,0.00009821058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014816837,0.0012208981,0.00091964344,0.0013796457,0.0005222883,0.0015335572,0.0015007512,0.0018307902,0.0029763877],"category_scores_gemma":[0.0061205705,0.00046273894,0.0008293161,0.0015780696,0.00089634256,0.00222637,0.000764833,0.0016761371,0.0010490603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035931556,0.000031105337,0.00048324972,0.00008280175,0.000025231877,0.0000921946,0.00006760493,0.77868634,0.0009994843,0.20522285,0.0044084033,0.009864858],"study_design_scores_gemma":[0.000003987283,0.000012226466,0.00007801567,0.0000128582005,0.0000053030317,0.000032842046,0.0000111956515,0.95057654,0.000084746614,0.046726804,0.002447623,0.000007920702],"about_ca_topic_score_codex":0.005537071,"about_ca_topic_score_gemma":0.0027542033,"teacher_disagreement_score":0.005537071,"about_ca_system_score_codex":0.0018578795,"about_ca_system_score_gemma":0.0008997181,"threshold_uncertainty_score":0.013479888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015412852,0.00010526009,0.9966635,0.000053610813,0.000017624812,0.000017509668,0.000031188978,0.00019493373,0.0013750714],"genre_scores_gemma":[0.09066329,0.00043639302,0.904837,0.0001513182,0.000086512555,0.00015180459,0.0003023619,0.00017284526,0.0031985606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974573,0.00076581805,0.00013823117,0.00025799335,0.0012593915,0.00012129418],"domain_scores_gemma":[0.99598324,0.0020271544,0.00025995614,0.0008715519,0.0007544034,0.000103777435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018324257,0.0010415805,0.0010041978,0.0015302998,0.00083779613,0.0013149519,0.0015443565,0.0008308764,0.002740822],"category_scores_gemma":[0.008568447,0.000465412,0.00071277743,0.0017961166,0.001248261,0.0016127918,0.0019611407,0.001458084,0.0016943652],"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.00024568394,0.00007925584,0.00090687425,0.0001557872,0.000092878705,0.0002776034,0.00016818481,0.20723504,0.028303413,0.295474,0.007731905,0.4593294],"study_design_scores_gemma":[0.000025205896,0.00007649594,0.00033828497,0.000028513252,0.000021824912,0.0003196692,0.000022660688,0.9022225,0.018351117,0.07127574,0.007274694,0.000043231383],"about_ca_topic_score_codex":0.0027620974,"about_ca_topic_score_gemma":0.0060504805,"teacher_disagreement_score":0.0027620974,"about_ca_system_score_codex":0.0010859868,"about_ca_system_score_gemma":0.0025867452,"threshold_uncertainty_score":0.009690881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006397839,0.0002022408,0.98970944,0.00009291598,0.000030505998,0.000010051102,0.000020730917,0.0001078598,0.0034283432],"genre_scores_gemma":[0.40223092,0.0012477535,0.5832678,0.00025706977,0.00017575288,0.00011461659,0.00012524525,0.00006470065,0.012516193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998134,0.000059583377,0.0000074095838,0.000024589492,0.0000755472,0.000019539199],"domain_scores_gemma":[0.9997763,0.00014101954,0.000024334442,0.000015692107,0.000036330555,0.00000637047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104817,0.00033461786,0.0002828972,0.00014506227,0.00016144957,0.0003589203,0.00021939141,0.00055807363,0.002865049],"category_scores_gemma":[0.00096160034,0.0001399161,0.00020415467,0.00026984373,0.00036953768,0.0005572923,0.00021647655,0.0003560985,0.0008552957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012057015,0.00003997985,0.00043791786,0.00017426463,0.000029083685,0.00017858564,0.0000740968,0.68831676,0.05833167,0.13515487,0.0021411113,0.11500102],"study_design_scores_gemma":[0.000014087832,0.000050054612,0.0001681315,0.000015884772,0.000009161237,0.00008011468,0.000012797133,0.9712461,0.007972245,0.017873608,0.0025449595,0.000012844206],"about_ca_topic_score_codex":0.0006943425,"about_ca_topic_score_gemma":0.0011264392,"teacher_disagreement_score":0.002865049,"about_ca_system_score_codex":0.00034580808,"about_ca_system_score_gemma":0.0003004181,"threshold_uncertainty_score":0.009584546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6521357,0.0015270784,0.33489147,0.0001542349,0.000053635227,0.000032645996,0.0007279197,0.0006642389,0.00981301],"genre_scores_gemma":[0.9886541,0.00043418483,0.00954485,0.000023394809,0.000033159686,0.000019235878,0.0003028592,0.000062835104,0.0009254252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999471,0.000061423765,0.000027481963,0.000109424116,0.00023266466,0.00009794646],"domain_scores_gemma":[0.99595237,0.0023843136,0.0005329319,0.00033012606,0.00063045416,0.00016980569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274799,0.00039008327,0.00041343612,0.0010080544,0.00027100832,0.0009142578,0.00028230145,0.000440138,0.0014176044],"category_scores_gemma":[0.009022429,0.00022692629,0.00030964662,0.00079602073,0.00065250735,0.0009361695,0.0003729229,0.0005067081,0.00038395482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014606713,0.00009521087,0.029084446,0.00040281285,0.00020427193,0.0009978907,0.0005224932,0.6363496,0.13043882,0.07185861,0.001414908,0.12717025],"study_design_scores_gemma":[0.00003641256,0.00052038574,0.047379963,0.00008039866,0.00012510404,0.00324923,0.000098293094,0.85497636,0.050983045,0.039429553,0.0029572162,0.00016413843],"about_ca_topic_score_codex":0.0005878211,"about_ca_topic_score_gemma":0.00029863845,"teacher_disagreement_score":0.0014176044,"about_ca_system_score_codex":0.0006335995,"about_ca_system_score_gemma":0.0004048414,"threshold_uncertainty_score":0.005433917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94100964,0.0013675053,0.052741934,0.00036987738,0.000060534283,0.000025681766,0.000033792734,0.00011645432,0.004274465],"genre_scores_gemma":[0.9985856,0.00013235013,0.0010673256,0.00001910616,0.00001340759,0.000002964102,0.0000053686003,0.000006448111,0.00016753934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983259,0.00071582285,0.000045843233,0.00011161796,0.00047644833,0.0003244576],"domain_scores_gemma":[0.9887222,0.009827039,0.00048622573,0.00031351417,0.00043033814,0.0002207422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017237255,0.0006179673,0.00047437518,0.00057142513,0.00052677875,0.0009368856,0.0005095124,0.00057558494,0.00084602623],"category_scores_gemma":[0.010834841,0.00029658136,0.00032551622,0.00034732494,0.00082304724,0.001520882,0.0011228872,0.0006241466,0.000088958346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010296756,0.00020200068,0.0108455,0.00009413949,0.00011755468,0.00031376208,0.00018436732,0.93025625,0.01701651,0.0061108074,0.00032797566,0.03350146],"study_design_scores_gemma":[0.00001171489,0.00020905999,0.002756554,0.0000093874405,0.000057207097,0.000059363614,0.0000790478,0.99154985,0.0041240524,0.0010167548,0.000110656925,0.000016309448],"about_ca_topic_score_codex":0.008010917,"about_ca_topic_score_gemma":0.006357492,"teacher_disagreement_score":0.008010917,"about_ca_system_score_codex":0.0011761318,"about_ca_system_score_gemma":0.0005935908,"threshold_uncertainty_score":0.015928566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008277788,0.0006180072,0.9882781,0.00015223824,0.000066816036,0.000034180037,0.000028495157,0.00047227147,0.002072055],"genre_scores_gemma":[0.39234263,0.0013747617,0.5976576,0.00029538508,0.00016183387,0.00020936629,0.00020082609,0.00029917608,0.0074583543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975674,0.0006661551,0.00013827914,0.00020781948,0.0012949548,0.00012545392],"domain_scores_gemma":[0.99256355,0.0049118744,0.00035726916,0.0006308097,0.0014455098,0.0000910558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029119833,0.0007840512,0.001008149,0.0013954524,0.0004222989,0.0010333275,0.0010162619,0.0018414547,0.0029081479],"category_scores_gemma":[0.020482264,0.00031662913,0.0004865338,0.00085453084,0.0009299049,0.0022581962,0.0011105626,0.00090746453,0.00084978074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069389195,0.00018854323,0.0016877044,0.0005988412,0.00023121263,0.00009037788,0.00018212106,0.49592477,0.016949195,0.15219165,0.002558779,0.32870287],"study_design_scores_gemma":[0.000046003184,0.00016608051,0.00060907257,0.000032294152,0.000026344975,0.00013096818,0.000027802365,0.96961546,0.008758671,0.01620637,0.004339625,0.00004135017],"about_ca_topic_score_codex":0.001122059,"about_ca_topic_score_gemma":0.0014597991,"teacher_disagreement_score":0.0029119833,"about_ca_system_score_codex":0.0006713313,"about_ca_system_score_gemma":0.0010967818,"threshold_uncertainty_score":0.015400231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2065066,0.00059209944,0.7877108,0.00029513342,0.00010794734,0.000062779196,0.00011665747,0.0021090596,0.002498942],"genre_scores_gemma":[0.8937529,0.00018197983,0.104973,0.000049959057,0.000030159652,0.0000326724,0.000116707364,0.00008121693,0.0007813406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521,0.00096829695,0.0002787496,0.00075533683,0.002359684,0.0004278987],"domain_scores_gemma":[0.97402936,0.012784266,0.0027252934,0.0053673093,0.0046498124,0.000444012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036706093,0.0008165105,0.0011810451,0.0010806817,0.00054073497,0.0021943925,0.0017004164,0.0011034128,0.00077287765],"category_scores_gemma":[0.027634079,0.00041761683,0.0003041333,0.0013007877,0.00086142257,0.00321193,0.0016367947,0.0017017922,0.00050163455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087698223,0.0001299707,0.012922272,0.00019531856,0.000093178736,0.00029599576,0.00036209243,0.8056739,0.026126826,0.0150625575,0.0017302706,0.13653062],"study_design_scores_gemma":[0.000014547087,0.00005999956,0.0008985899,0.000008763128,0.000009661768,0.0001107862,0.000036788042,0.98330194,0.0122463545,0.0028553058,0.0004354456,0.000021748974],"about_ca_topic_score_codex":0.003885139,"about_ca_topic_score_gemma":0.0020193732,"teacher_disagreement_score":0.003885139,"about_ca_system_score_codex":0.0016313469,"about_ca_system_score_gemma":0.001983504,"threshold_uncertainty_score":0.01941222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013276143,0.00040932943,0.9854441,0.000101060985,0.0000077278155,0.000008995535,0.000026501446,0.00021180413,0.000514283],"genre_scores_gemma":[0.7554537,0.0014270304,0.24005026,0.000100790305,0.00013395939,0.00009619332,0.00027533565,0.00014001332,0.0023226684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924123,0.00042737334,0.00002700776,0.0000873719,0.0001610971,0.000055919714],"domain_scores_gemma":[0.99722856,0.0020500834,0.00025627034,0.00013931928,0.00027852785,0.00004718257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016884432,0.0007017978,0.0010219924,0.00071780366,0.0002176106,0.00096163474,0.00066915434,0.0007217141,0.00065679866],"category_scores_gemma":[0.009564819,0.00045965367,0.00035185547,0.000705537,0.00087512744,0.0015636411,0.0008647153,0.0006646303,0.00041553992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015032926,0.000021609512,0.0013429839,0.00013779578,0.000045671008,0.00016683072,0.000090842106,0.90225494,0.006598957,0.025749756,0.00092475984,0.06251555],"study_design_scores_gemma":[0.000008395872,0.00001716815,0.00023593391,0.0000063456405,0.0000050511057,0.000040621766,0.0000057781076,0.99052423,0.0012702125,0.0076840688,0.0001917107,0.00001047675],"about_ca_topic_score_codex":0.0005720347,"about_ca_topic_score_gemma":0.0005247394,"teacher_disagreement_score":0.0016884432,"about_ca_system_score_codex":0.00036192514,"about_ca_system_score_gemma":0.00047568965,"threshold_uncertainty_score":0.008929491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043015,0.0007062587,0.9437462,0.0002824958,0.00017607905,0.000110549634,0.00012471854,0.00030602812,0.0115327],"genre_scores_gemma":[0.361261,0.0010368734,0.62879694,0.00028138983,0.00010663114,0.00028930735,0.00039763626,0.00009796349,0.0077321758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963355,0.000095003474,0.000017905251,0.00004598061,0.00017717565,0.00003033356],"domain_scores_gemma":[0.99963653,0.00012547962,0.000030088295,0.00010386834,0.000078844525,0.000025245905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028555634,0.00038388892,0.00025159665,0.00061731535,0.00048132482,0.0005107662,0.00032829808,0.00047947202,0.001770427],"category_scores_gemma":[0.001225369,0.00023621261,0.0003720621,0.0005434955,0.0006145437,0.00042500778,0.000841772,0.0010483235,0.0006952629],"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.00008429294,0.000053035783,0.00035348034,0.00023910108,0.000033877317,0.00032639565,0.000343132,0.037497327,0.111768834,0.7080789,0.0024845665,0.13873714],"study_design_scores_gemma":[0.0000854771,0.00031334758,0.000734934,0.00018966683,0.00006212907,0.0015597693,0.000085930886,0.31397358,0.1693346,0.42712706,0.08638317,0.00015027866],"about_ca_topic_score_codex":0.00044607293,"about_ca_topic_score_gemma":0.00050541223,"teacher_disagreement_score":0.001770427,"about_ca_system_score_codex":0.0004608376,"about_ca_system_score_gemma":0.00065182,"threshold_uncertainty_score":0.005922675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05144148,0.0017535045,0.9296285,0.0004584487,0.00012291227,0.00012462291,0.0002751654,0.00058238185,0.015612861],"genre_scores_gemma":[0.38772964,0.0022684063,0.5877425,0.00037079267,0.00015061954,0.000397432,0.00066910137,0.0001997638,0.020471733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967873,0.0000689008,0.000017073604,0.000041692438,0.00015780244,0.000035920464],"domain_scores_gemma":[0.99915206,0.0002948105,0.00014613676,0.00014031513,0.00021419366,0.000052546464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036927828,0.00051222835,0.00030533032,0.00068279664,0.0006176617,0.0005198588,0.00040385962,0.00064147235,0.0020897633],"category_scores_gemma":[0.0020876583,0.0001842506,0.00037905955,0.0006139173,0.00053061725,0.0005356049,0.00044988113,0.0010307953,0.0011913424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030505258,0.00011943844,0.0012073108,0.00029575548,0.00003394678,0.00047390745,0.00028525817,0.08889736,0.11189343,0.45998645,0.007258283,0.32924396],"study_design_scores_gemma":[0.00012389239,0.00074622425,0.0015576317,0.0002173413,0.00006642463,0.0034629225,0.00008154535,0.52233404,0.113059,0.23781261,0.12036924,0.00016920746],"about_ca_topic_score_codex":0.00058945117,"about_ca_topic_score_gemma":0.0008161511,"teacher_disagreement_score":0.0020897633,"about_ca_system_score_codex":0.00040894133,"about_ca_system_score_gemma":0.00063460914,"threshold_uncertainty_score":0.006990969},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114966445,0.0013625509,0.87812436,0.00031865135,0.00024902367,0.0002041034,0.00013469791,0.0017530137,0.0028871952],"genre_scores_gemma":[0.77692217,0.00044783624,0.21924834,0.0001401052,0.0001306694,0.00009273423,0.00038886766,0.0000384809,0.002590858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973863,0.000027583412,0.000024258174,0.000051797237,0.00010892506,0.000048754126],"domain_scores_gemma":[0.99954706,0.00011938893,0.00007235347,0.000065850945,0.00012905993,0.00006635014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042853047,0.0004541239,0.00058193103,0.00078431866,0.0006595429,0.00048634113,0.0009828714,0.00044939082,0.0009243292],"category_scores_gemma":[0.0009583844,0.00021596711,0.00022093578,0.0006205974,0.0002973591,0.0008760814,0.0007517196,0.0006038745,0.0002584269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049247924,0.0002516463,0.0041353656,0.000099869336,0.00006504723,0.00012656783,0.0001388573,0.07491701,0.044024654,0.0049686395,0.0031296678,0.8676502],"study_design_scores_gemma":[0.00009134372,0.00023183857,0.001980489,0.000011252664,0.00004396836,0.00027448562,0.00005274312,0.9800332,0.012188407,0.0024791134,0.0025828436,0.00003029129],"about_ca_topic_score_codex":0.0041215974,"about_ca_topic_score_gemma":0.0041824863,"teacher_disagreement_score":0.0041215974,"about_ca_system_score_codex":0.0003934308,"about_ca_system_score_gemma":0.0010295798,"threshold_uncertainty_score":0.008195221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05250531,0.00019529715,0.94624,0.000047525416,0.000017950302,0.000010349501,0.000014599367,0.00016156414,0.0008074002],"genre_scores_gemma":[0.4299129,0.0002512641,0.5684609,0.000021641623,0.000025237661,0.000038882285,0.000051296232,0.00005157023,0.0011863755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.0002101988,0.00003513954,0.00009382723,0.0003177323,0.000052300667],"domain_scores_gemma":[0.9974437,0.0016209795,0.00026886605,0.0002508472,0.00033389867,0.00008175768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009092244,0.00042160923,0.00048508713,0.0010019906,0.00027110317,0.0006781772,0.0004743727,0.0005994141,0.000589165],"category_scores_gemma":[0.0067754732,0.0002710404,0.00033518425,0.00049607875,0.0006204655,0.0015006285,0.0009594036,0.0007965861,0.00030974817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072959973,0.00011736655,0.004125629,0.00022310913,0.00010476266,0.00018851685,0.00039802765,0.4206557,0.06878039,0.063006714,0.00073220144,0.440938],"study_design_scores_gemma":[0.000022543845,0.00016110462,0.00097644783,0.000025350884,0.000015994063,0.00023193113,0.000036200676,0.9441032,0.038462974,0.014979915,0.000934134,0.0000501803],"about_ca_topic_score_codex":0.0005473791,"about_ca_topic_score_gemma":0.0006800444,"teacher_disagreement_score":0.0010019906,"about_ca_system_score_codex":0.00035017842,"about_ca_system_score_gemma":0.0007602883,"threshold_uncertainty_score":0.0048084855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03179466,0.0004694843,0.9647919,0.00042059788,0.00005459741,0.000029067649,0.00006052535,0.00068980746,0.0016894329],"genre_scores_gemma":[0.6695341,0.0010457274,0.32506827,0.00037834403,0.00016925653,0.0001297162,0.0003020335,0.00018714649,0.0031854159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.0005704973,0.000060395545,0.00019800915,0.00035373596,0.00015669416],"domain_scores_gemma":[0.9900287,0.0074146176,0.00045078655,0.0008794573,0.0010628543,0.00016346862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831518,0.0010592641,0.0010950915,0.0014869169,0.0005635429,0.0011717567,0.001602452,0.0013473006,0.0012006521],"category_scores_gemma":[0.016882084,0.00065686094,0.00051444536,0.0015636106,0.0011623938,0.0031600492,0.0019754553,0.0013998275,0.00043451763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000210103,0.000044620938,0.0010626432,0.000118529344,0.00006771889,0.000093069524,0.00016262091,0.82949257,0.00275006,0.04208177,0.0022544232,0.1216618],"study_design_scores_gemma":[0.000011743819,0.00001549083,0.00006342554,0.000005474106,0.0000079626425,0.000011869554,0.000006343386,0.9783546,0.00078003376,0.020365894,0.00037159774,0.0000055796513],"about_ca_topic_score_codex":0.0068260785,"about_ca_topic_score_gemma":0.0048607998,"teacher_disagreement_score":0.0068260785,"about_ca_system_score_codex":0.0009453902,"about_ca_system_score_gemma":0.0011574682,"threshold_uncertainty_score":0.013572693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09621965,0.00038171237,0.89675534,0.00026100065,0.000054852997,0.000055395263,0.00018045878,0.00068160833,0.0054100137],"genre_scores_gemma":[0.94934833,0.0003484351,0.04719159,0.000086261665,0.00005445703,0.00011534845,0.00015198663,0.00012743118,0.0025761721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.00023424084,0.00004715778,0.00011241689,0.0005436097,0.00020651052],"domain_scores_gemma":[0.9976042,0.0012969058,0.0002459207,0.00028586455,0.00048987975,0.00007722941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010762126,0.0006592297,0.0008968193,0.00066101074,0.00061076577,0.001035394,0.0016596114,0.0014956782,0.0011220826],"category_scores_gemma":[0.0056553856,0.0005467784,0.00049505796,0.0005891285,0.0007669448,0.0020835893,0.00063116645,0.0013085434,0.00040126065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002240695,0.000023705785,0.00056278985,0.000013487377,0.00000781309,0.00005022249,0.000033484564,0.98487616,0.002574299,0.008022673,0.0002711486,0.0035417583],"study_design_scores_gemma":[0.0000013524696,0.000004170026,0.00005573232,0.0000010609846,0.0000014896973,0.000009549855,0.0000021703654,0.9982185,0.00029066284,0.001287985,0.00012533198,0.0000020912607],"about_ca_topic_score_codex":0.0072599277,"about_ca_topic_score_gemma":0.0028925445,"teacher_disagreement_score":0.0072599277,"about_ca_system_score_codex":0.0017748636,"about_ca_system_score_gemma":0.0012937771,"threshold_uncertainty_score":0.014435351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107418485,0.0006255706,0.98689866,0.0002412715,0.000039036368,0.000023566774,0.000046036545,0.00008781332,0.0012962105],"genre_scores_gemma":[0.56905687,0.0035664549,0.41813678,0.000401283,0.0006496995,0.00032145728,0.00047331012,0.0001509759,0.007243213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979527,0.00092469127,0.00011601407,0.00024221966,0.0005213531,0.00024301467],"domain_scores_gemma":[0.99072987,0.0077001895,0.0004079889,0.0005993949,0.00049844134,0.00006425613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028000653,0.0011372133,0.0015581991,0.00083396275,0.0005314398,0.0013501471,0.0010066984,0.0017261312,0.0010726225],"category_scores_gemma":[0.01607738,0.0005425401,0.0006010211,0.0019321247,0.0021323704,0.0024659073,0.0019369851,0.0013427665,0.0004113888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022209012,0.00004054239,0.0006306377,0.00012331505,0.00008748383,0.00017400444,0.00023967998,0.80094784,0.0021460766,0.122906424,0.0010695278,0.07141229],"study_design_scores_gemma":[0.000017592609,0.00003076166,0.00009437526,0.00001936738,0.000013176859,0.00006332274,0.000016830458,0.9517627,0.0014863244,0.045755118,0.0007212213,0.000019217596],"about_ca_topic_score_codex":0.004074787,"about_ca_topic_score_gemma":0.0025929974,"teacher_disagreement_score":0.004074787,"about_ca_system_score_codex":0.00091944024,"about_ca_system_score_gemma":0.0017774166,"threshold_uncertainty_score":0.014808297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050739557,0.00054639543,0.9438712,0.00039468936,0.000019417343,0.000042848907,0.000049484526,0.00013857067,0.0041977935],"genre_scores_gemma":[0.93833447,0.00052204035,0.059377994,0.00016012404,0.000040242798,0.00008994248,0.0000424384,0.00007687673,0.0013557915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986766,0.0007184465,0.000029231089,0.000115975396,0.00023300065,0.00022668648],"domain_scores_gemma":[0.9964007,0.0028602441,0.00028146597,0.00016855176,0.00017144573,0.000117517026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027825255,0.0009133749,0.00093220297,0.0005893801,0.00050972926,0.0011250194,0.00094135717,0.0010250092,0.0021066763],"category_scores_gemma":[0.010644343,0.00050596293,0.0005237587,0.0007239625,0.0012723755,0.0016463178,0.0013988647,0.000819884,0.00028138518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006871016,0.000025669233,0.00046437577,0.000033085602,0.000013576544,0.000049705235,0.000033631954,0.9766187,0.0015648124,0.015673438,0.00030703493,0.005147211],"study_design_scores_gemma":[0.000005563395,0.000014880583,0.00017724269,0.000004414405,0.000004207148,0.000020082553,0.000011158271,0.993309,0.00032420282,0.0060319207,0.000092713264,0.000004626574],"about_ca_topic_score_codex":0.0021843622,"about_ca_topic_score_gemma":0.002114865,"teacher_disagreement_score":0.0027825255,"about_ca_system_score_codex":0.0014995593,"about_ca_system_score_gemma":0.00094136305,"threshold_uncertainty_score":0.014715552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52106273,0.00062496576,0.4715706,0.00015112283,0.00005751999,0.00005613949,0.0002476733,0.0004162056,0.005813032],"genre_scores_gemma":[0.98958755,0.00016118214,0.009558428,0.000039935538,0.00003401947,0.000026973381,0.00009466602,0.000036112553,0.00046115796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.00012465265,0.00003387972,0.00008214323,0.00033300166,0.00012583139],"domain_scores_gemma":[0.9954758,0.002719514,0.0005261543,0.0003173611,0.000821591,0.00013957347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121566,0.00063730264,0.00037104555,0.0013309898,0.00043774652,0.0011079768,0.0007584257,0.00045397456,0.00097409217],"category_scores_gemma":[0.007421759,0.00020130989,0.00014853847,0.0006751646,0.000982166,0.0012832211,0.00050608284,0.00054304453,0.00015492726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002612614,0.00033281252,0.017518967,0.0003848617,0.000052905794,0.0007371421,0.0008763443,0.52426946,0.23863778,0.1408779,0.0013946306,0.07230455],"study_design_scores_gemma":[0.000014054407,0.00012420637,0.001480924,0.000021262342,0.000010771408,0.00018557133,0.000041011837,0.96764517,0.019092241,0.010735879,0.00062612357,0.000022801027],"about_ca_topic_score_codex":0.0011161545,"about_ca_topic_score_gemma":0.00036843718,"teacher_disagreement_score":0.0013309898,"about_ca_system_score_codex":0.00085328834,"about_ca_system_score_gemma":0.00026286163,"threshold_uncertainty_score":0.006429136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01844038,0.003293254,0.9652528,0.0008523627,0.00009780474,0.000054836917,0.00014185603,0.00023271053,0.011633962],"genre_scores_gemma":[0.7946136,0.004503778,0.19410521,0.0007033888,0.00062888867,0.00015768076,0.0003467116,0.000117865755,0.004822873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972548,0.0008074416,0.00010658651,0.0003866359,0.001113546,0.00033089746],"domain_scores_gemma":[0.9967443,0.0020737976,0.00026769718,0.00027225167,0.0005835443,0.00005841456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023444158,0.0011837374,0.0012012738,0.0010261515,0.00047045673,0.0015531989,0.0010612836,0.0015648289,0.0025239307],"category_scores_gemma":[0.009468793,0.0006571587,0.0005822659,0.0012689057,0.0016522863,0.0020750298,0.0016752094,0.0012457994,0.0008642104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002420992,0.000088187364,0.0015577475,0.0004535576,0.00013587555,0.0003330849,0.00017914257,0.4306083,0.026048072,0.46963573,0.003854613,0.066863544],"study_design_scores_gemma":[0.00001981504,0.00006626749,0.0003967474,0.000052188254,0.000024968323,0.0004058257,0.000028807104,0.92008054,0.00590827,0.070840254,0.0021402335,0.00003612831],"about_ca_topic_score_codex":0.001505879,"about_ca_topic_score_gemma":0.001374237,"teacher_disagreement_score":0.0025239307,"about_ca_system_score_codex":0.0019591732,"about_ca_system_score_gemma":0.0017951825,"threshold_uncertainty_score":0.014214873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03570526,0.0005096877,0.9546249,0.00036677203,0.00021141216,0.00014746707,0.00010024532,0.0007299805,0.007604275],"genre_scores_gemma":[0.6809337,0.00053536566,0.30727735,0.00037715826,0.00018402626,0.00021769082,0.00018931695,0.00014786319,0.010137554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990509,0.00022329506,0.00004753437,0.00007132624,0.00046055886,0.00014644509],"domain_scores_gemma":[0.99869066,0.00044688614,0.000094906805,0.00024288519,0.00045664792,0.00006802532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013552726,0.00041112571,0.0007341005,0.000866378,0.00057480205,0.001117254,0.0010522718,0.00086636766,0.004137454],"category_scores_gemma":[0.0042161644,0.00021738,0.00042777296,0.0010179145,0.0009416708,0.0022124387,0.0011254374,0.0011895808,0.0010222426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058221695,0.00017676652,0.0018847986,0.0003108201,0.000054635406,0.00021289421,0.00024519005,0.27523035,0.049585827,0.425381,0.009992427,0.23634306],"study_design_scores_gemma":[0.00006609838,0.00018828957,0.0004340664,0.000024319203,0.00002162384,0.0002762401,0.000038238246,0.942754,0.015022122,0.033912096,0.007209759,0.00005308784],"about_ca_topic_score_codex":0.0010691691,"about_ca_topic_score_gemma":0.0005485247,"teacher_disagreement_score":0.004137454,"about_ca_system_score_codex":0.0011770535,"about_ca_system_score_gemma":0.0014002203,"threshold_uncertainty_score":0.013841152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12859237,0.00033580165,0.8627524,0.0005026537,0.00028985622,0.00012697586,0.0001060297,0.00058754295,0.006706299],"genre_scores_gemma":[0.9360402,0.00015138902,0.061436202,0.00012968243,0.00008374844,0.000059525337,0.000057847985,0.000026497064,0.0020148007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997582,0.000053989294,0.000010372135,0.0000420664,0.00007767959,0.000057716057],"domain_scores_gemma":[0.99959713,0.00008455215,0.00005737159,0.00010438677,0.000104926134,0.000051689985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998936,0.0003602054,0.00033566568,0.00030420697,0.0006068349,0.00065794017,0.00079830264,0.00030367554,0.00089016143],"category_scores_gemma":[0.0010207512,0.00012625371,0.00020401593,0.00037394816,0.00041887353,0.0007386429,0.0005995919,0.0007061522,0.00017081756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076652766,0.00042030783,0.0014516609,0.00010038358,0.000060923936,0.00030855145,0.00020691197,0.21182291,0.12773696,0.22810623,0.007555775,0.4214629],"study_design_scores_gemma":[0.000029890833,0.00014149024,0.0002472913,0.000005791801,0.000010804876,0.00007422114,0.00001321069,0.97548103,0.007946244,0.011601081,0.0044309013,0.000018068948],"about_ca_topic_score_codex":0.0017801811,"about_ca_topic_score_gemma":0.0021363178,"teacher_disagreement_score":0.0017801811,"about_ca_system_score_codex":0.0009191328,"about_ca_system_score_gemma":0.0010752133,"threshold_uncertainty_score":0.006668806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.253538,0.00051668525,0.7400873,0.00027886027,0.000063278625,0.000090368565,0.000024643481,0.00039101875,0.005009801],"genre_scores_gemma":[0.8992728,0.00017116293,0.09897232,0.00005266714,0.000049638402,0.00009358351,0.00002233123,0.000028758186,0.0013368222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00017625421,0.00002112975,0.00006025008,0.00025456725,0.00005202691],"domain_scores_gemma":[0.99877435,0.00072325504,0.00015414122,0.00012481393,0.00019491633,0.00002845578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010842083,0.00029287286,0.00032812252,0.0003733645,0.00021675807,0.0007218833,0.0007765157,0.00036661193,0.000807818],"category_scores_gemma":[0.0028081308,0.0002170981,0.00023283996,0.00024181287,0.00071980763,0.00086909987,0.00027309995,0.0005120631,0.00010474035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042028623,0.00021680331,0.0011368948,0.000074814765,0.000048083384,0.000085203465,0.000070741924,0.8285104,0.031803586,0.061370093,0.00054245716,0.075720556],"study_design_scores_gemma":[0.000031825817,0.000054257867,0.000115393224,0.0000022702443,0.0000071158956,0.000016843927,0.0000044880717,0.99254405,0.0030634697,0.003987581,0.000167322,0.000005363487],"about_ca_topic_score_codex":0.0006408515,"about_ca_topic_score_gemma":0.0005112947,"teacher_disagreement_score":0.0010842083,"about_ca_system_score_codex":0.00052272953,"about_ca_system_score_gemma":0.00042745948,"threshold_uncertainty_score":0.005733907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03530944,0.0022763566,0.95378244,0.00054403546,0.00025123806,0.00008764409,0.00022103764,0.0010670557,0.0064608185],"genre_scores_gemma":[0.9244076,0.0012958472,0.071035095,0.0002009682,0.00018711905,0.00012649801,0.00032588642,0.000113615926,0.0023073324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951604,0.0010526339,0.00027881813,0.0007798255,0.0018866147,0.00084179564],"domain_scores_gemma":[0.99083394,0.00521221,0.00060198543,0.0009769708,0.0020378467,0.00033701153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036282782,0.0015722922,0.0019334558,0.001791472,0.001434814,0.004012625,0.0021674258,0.0016267534,0.0020800706],"category_scores_gemma":[0.025295664,0.00088984804,0.00056380697,0.0015001827,0.0017313535,0.002976804,0.0027450884,0.0027257486,0.00073408545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031920115,0.000058470338,0.0023196694,0.00019522166,0.000052742405,0.00025645745,0.0002851135,0.8999329,0.00864594,0.045941148,0.002684604,0.039308526],"study_design_scores_gemma":[0.0000061225733,0.000014838596,0.00023608722,0.000019830553,0.000008646457,0.000032988493,0.000015178101,0.99271446,0.0011814446,0.005415252,0.0003367658,0.000018417737],"about_ca_topic_score_codex":0.017130934,"about_ca_topic_score_gemma":0.00993217,"teacher_disagreement_score":0.017130934,"about_ca_system_score_codex":0.003986327,"about_ca_system_score_gemma":0.0049943943,"threshold_uncertainty_score":0.034062445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014964908,0.00006261995,0.982615,0.0000556224,0.000020327607,0.000013770714,0.00003223872,0.0002265384,0.0020089569],"genre_scores_gemma":[0.4003533,0.0005002823,0.59204376,0.000110250665,0.00007529665,0.00010748022,0.00027196217,0.00021839616,0.006319208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998642,0.000021584265,0.000004896415,0.000012100933,0.00007956792,0.000017595743],"domain_scores_gemma":[0.99958247,0.0002244798,0.000040182233,0.000045319382,0.000089408124,0.00001821194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003686253,0.0004315566,0.00023232085,0.0007638195,0.00023178472,0.0005305358,0.0003538214,0.00040798244,0.002530442],"category_scores_gemma":[0.002576886,0.00018238157,0.00024682799,0.0006187523,0.00042316387,0.00089955353,0.00038129246,0.0005797114,0.0007991684],"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.00020217318,0.00008356945,0.0011794098,0.00013854525,0.000043309887,0.00025951432,0.0001389308,0.36182803,0.10346243,0.30213007,0.0025593613,0.22797476],"study_design_scores_gemma":[0.000008900606,0.00002684899,0.00024595374,0.000010692703,0.0000056007134,0.00012226873,0.000010981981,0.96176,0.009225624,0.027373843,0.0011952053,0.000014135935],"about_ca_topic_score_codex":0.0012559484,"about_ca_topic_score_gemma":0.0013586883,"teacher_disagreement_score":0.002530442,"about_ca_system_score_codex":0.00038013054,"about_ca_system_score_gemma":0.00066585175,"threshold_uncertainty_score":0.00846523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06745365,0.00064002845,0.9258048,0.0002593224,0.000025573097,0.00003530959,0.00022649739,0.0002025799,0.005352276],"genre_scores_gemma":[0.9535889,0.00081404025,0.042520463,0.00013026607,0.00008315366,0.00012163643,0.00034079832,0.00006610294,0.0023347691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980768,0.0004958002,0.00010738744,0.00022424578,0.0008483934,0.0002472474],"domain_scores_gemma":[0.99291974,0.004397868,0.0010432182,0.00061105506,0.00087135145,0.0001566602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158423,0.0007584438,0.0009229911,0.0012431117,0.00036703315,0.0013531336,0.0008081059,0.00065531966,0.0017464535],"category_scores_gemma":[0.011509712,0.000500168,0.0004574524,0.0011159016,0.0013144378,0.002482528,0.0016424239,0.0008802635,0.0005866015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023519524,0.000050389164,0.0032661802,0.00019221136,0.00010135243,0.0005171789,0.00028473284,0.72969973,0.008254063,0.22637196,0.0015460247,0.029480884],"study_design_scores_gemma":[0.000010084673,0.00004303731,0.001118831,0.00002168043,0.00001750777,0.00024352274,0.000044944576,0.93612725,0.002577607,0.059085026,0.0006716521,0.000038917882],"about_ca_topic_score_codex":0.00062376447,"about_ca_topic_score_gemma":0.0006554155,"teacher_disagreement_score":0.002158423,"about_ca_system_score_codex":0.0010897492,"about_ca_system_score_gemma":0.0007891787,"threshold_uncertainty_score":0.011414945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050881053,0.00016379867,0.99384564,0.000067472036,0.000018515217,0.000010609432,0.00003291437,0.00020565951,0.00056726113],"genre_scores_gemma":[0.34935635,0.0007879459,0.64507854,0.00013912965,0.00012830262,0.000118995624,0.00036619548,0.0001815441,0.0038430064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993711,0.00020564688,0.000023902696,0.00010896251,0.00023044716,0.000059916496],"domain_scores_gemma":[0.99751735,0.0013718039,0.00026358085,0.00032924206,0.00047744668,0.000040523715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428624,0.0008851835,0.00082761294,0.00079614215,0.00032449063,0.0012884217,0.0010168677,0.0011961767,0.0019885008],"category_scores_gemma":[0.009117086,0.00050059374,0.000575447,0.00080593885,0.00087544275,0.0025298367,0.0011770334,0.001283718,0.0011871594],"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.00036607948,0.00007845972,0.0044019935,0.00047508688,0.00018429024,0.00044119667,0.0002063337,0.5837014,0.038460907,0.0704549,0.0043965015,0.2968328],"study_design_scores_gemma":[0.000020388996,0.000049234088,0.00067572325,0.000024073097,0.000026496777,0.0003276988,0.00003017589,0.9760519,0.0070053507,0.014371133,0.0013819674,0.000035891873],"about_ca_topic_score_codex":0.0010395359,"about_ca_topic_score_gemma":0.001109093,"teacher_disagreement_score":0.0019885008,"about_ca_system_score_codex":0.0006422039,"about_ca_system_score_gemma":0.0013277719,"threshold_uncertainty_score":0.0075553656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022272695,0.0011909901,0.9727674,0.00032224547,0.000109708366,0.000035693396,0.00004589036,0.00015992399,0.0030954143],"genre_scores_gemma":[0.7940242,0.0024336607,0.19604637,0.00025200317,0.00035173114,0.00018680302,0.00013691664,0.00009815638,0.0064700884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857295,0.0006441035,0.000039758528,0.00013024228,0.0005042407,0.00010868532],"domain_scores_gemma":[0.9964244,0.0025535063,0.0002372904,0.00018265903,0.0005332989,0.00006882166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736986,0.0007847157,0.0008823491,0.00088162086,0.00046095572,0.001104099,0.0010089008,0.0019497742,0.0006697055],"category_scores_gemma":[0.009826946,0.00048239893,0.00048453355,0.0012768023,0.0018516426,0.00192834,0.0010625989,0.001046968,0.0003158031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015685047,0.000024700348,0.0006865224,0.00016541152,0.000030645973,0.0003846582,0.00012985032,0.75112706,0.0034363985,0.21144013,0.0016417406,0.030776016],"study_design_scores_gemma":[0.000007922203,0.00001913616,0.000037012065,0.000009115088,0.000004236715,0.00004687597,0.0000045314123,0.9725062,0.0010795147,0.025959076,0.0003168185,0.000009535591],"about_ca_topic_score_codex":0.0023893781,"about_ca_topic_score_gemma":0.0011295123,"teacher_disagreement_score":0.0023893781,"about_ca_system_score_codex":0.00094164256,"about_ca_system_score_gemma":0.000933497,"threshold_uncertainty_score":0.008322597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38889,0.0016092748,0.5984864,0.00040648814,0.0000757848,0.000044888035,0.00015432684,0.00028888954,0.010043911],"genre_scores_gemma":[0.98323673,0.0006327949,0.014405704,0.000051598126,0.00003935244,0.000028635599,0.00005189066,0.00003712577,0.001516152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984232,0.00058788626,0.000051653562,0.00012035266,0.000608147,0.00020875491],"domain_scores_gemma":[0.98923314,0.008263593,0.0010126316,0.0005888607,0.00078845513,0.000113336966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183727,0.0010875376,0.0008720647,0.00066769106,0.00036346223,0.0009367936,0.00076391373,0.0008535022,0.0011969552],"category_scores_gemma":[0.014228063,0.00028982243,0.00036665803,0.0011189901,0.0016105797,0.0020853607,0.0013817147,0.0008264411,0.00024335927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011540231,0.000016809112,0.0013992754,0.00008764805,0.000038066533,0.0002447038,0.00016093187,0.89964014,0.004960191,0.08658931,0.00019438507,0.006553224],"study_design_scores_gemma":[0.00001083027,0.00006602823,0.0006965519,0.000018113053,0.000019809959,0.00022632716,0.000044124437,0.9641931,0.0071799527,0.027190892,0.00032303703,0.000031224165],"about_ca_topic_score_codex":0.00093852374,"about_ca_topic_score_gemma":0.0007082293,"teacher_disagreement_score":0.002183727,"about_ca_system_score_codex":0.00092286046,"about_ca_system_score_gemma":0.0007103413,"threshold_uncertainty_score":0.011548758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03224201,0.0006378756,0.9654746,0.00018484739,0.00001528392,0.000014753343,0.00001964719,0.00017644385,0.0012344709],"genre_scores_gemma":[0.8532665,0.00044448773,0.14515013,0.00008263833,0.000040189225,0.00004184322,0.00003545195,0.000029891284,0.0009089628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.0008158402,0.000102056496,0.00023218305,0.00056116784,0.00013009504],"domain_scores_gemma":[0.99632984,0.002640741,0.0003122929,0.00031570063,0.00034588578,0.000055627035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021985613,0.0005849083,0.00094095996,0.00063799764,0.00029425492,0.0012634161,0.0010284773,0.0011442254,0.00037424828],"category_scores_gemma":[0.009411123,0.00041855144,0.00033695443,0.0007037917,0.0013766808,0.0020424672,0.0013708684,0.00048650624,0.00021931675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027832566,0.00006733536,0.00095881487,0.0001638905,0.00006017292,0.00019195215,0.00038216772,0.739375,0.019191628,0.11524351,0.00074196793,0.12334529],"study_design_scores_gemma":[0.000018690573,0.00006209916,0.00009355176,0.000009175529,0.000008753013,0.00007424128,0.000016979118,0.9721363,0.0037732976,0.023329433,0.00046199522,0.00001555449],"about_ca_topic_score_codex":0.00065453566,"about_ca_topic_score_gemma":0.0005693679,"teacher_disagreement_score":0.0021985613,"about_ca_system_score_codex":0.0008972958,"about_ca_system_score_gemma":0.000777692,"threshold_uncertainty_score":0.011627257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35873207,0.003244079,0.5652398,0.0068898946,0.00075336976,0.0005721825,0.00035659914,0.0018110513,0.062400896],"genre_scores_gemma":[0.9712605,0.0006026671,0.024078388,0.00024239573,0.000112655056,0.00015416046,0.00009548163,0.00003336174,0.0034203918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981054,0.00042738047,0.00008671325,0.00013666283,0.0009328288,0.00031098042],"domain_scores_gemma":[0.9986149,0.00063863053,0.00017884662,0.00036849428,0.00014709332,0.000052023013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012710419,0.0004853612,0.00053756655,0.00091608765,0.0010450558,0.0012234639,0.0007080444,0.0010257878,0.002432819],"category_scores_gemma":[0.0030802533,0.0002698792,0.00068077655,0.0009718798,0.0014966433,0.0023323938,0.0022543566,0.0015707136,0.00038132226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011750142,0.00013815156,0.0024944537,0.000359325,0.00021277742,0.0029722305,0.00081172027,0.08047903,0.059009545,0.76579946,0.012000104,0.07454821],"study_design_scores_gemma":[0.000341137,0.00049725873,0.0012357703,0.00012346187,0.00015720108,0.0036493873,0.00020736281,0.49563557,0.060201284,0.41765535,0.020179966,0.00011629459],"about_ca_topic_score_codex":0.00036776622,"about_ca_topic_score_gemma":0.0001910287,"teacher_disagreement_score":0.002432819,"about_ca_system_score_codex":0.0011656799,"about_ca_system_score_gemma":0.00085617433,"threshold_uncertainty_score":0.008457601},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011978954,0.00059523695,0.9727817,0.0003138324,0.00007935471,0.00004481827,0.00011416152,0.0004228727,0.013669171],"genre_scores_gemma":[0.4689904,0.0015734329,0.51617587,0.0004927855,0.00024782153,0.00013938714,0.0003830608,0.00010105942,0.011896113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.00017146106,0.000031906293,0.00012892617,0.00020916767,0.00006708585],"domain_scores_gemma":[0.99930334,0.00030626773,0.0000422779,0.00014140885,0.0001501162,0.00005658898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335576,0.0005871133,0.00071225385,0.0006327659,0.00036570764,0.0010707679,0.0008662979,0.0012267277,0.0028275398],"category_scores_gemma":[0.0017562639,0.00025056535,0.0004287421,0.0012614441,0.0009902111,0.0009862027,0.0011104948,0.0007322758,0.0011888886],"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.00032957844,0.00009057298,0.0007328359,0.00021447918,0.000046056954,0.0005150417,0.00010110248,0.49302283,0.023165852,0.32829338,0.0061160387,0.14737222],"study_design_scores_gemma":[0.000027351707,0.000054004082,0.00005879175,0.000010651187,0.0000069151793,0.0002558226,0.000013248639,0.9546686,0.0048625306,0.03504337,0.0049825534,0.000016251503],"about_ca_topic_score_codex":0.0020589014,"about_ca_topic_score_gemma":0.0014649314,"teacher_disagreement_score":0.0028275398,"about_ca_system_score_codex":0.0007482012,"about_ca_system_score_gemma":0.0013964808,"threshold_uncertainty_score":0.009459019},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017106476,0.00025267212,0.99215347,0.00024795756,0.00014244301,0.00002619904,0.00004133765,0.0001394256,0.005285777],"genre_scores_gemma":[0.20769438,0.0023175534,0.7506712,0.00080341357,0.0006115984,0.00042758632,0.0002672026,0.0006296009,0.03657749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992187,0.00016552313,0.000041140283,0.00009899318,0.0004107679,0.000064904285],"domain_scores_gemma":[0.9987675,0.0004944342,0.000082971455,0.00013014076,0.0004740603,0.00005091833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011221984,0.0012705087,0.00085033925,0.0010768264,0.0004972815,0.0016699218,0.0010261978,0.0018786275,0.004689134],"category_scores_gemma":[0.005050477,0.00055328937,0.0010097648,0.000776067,0.0010083123,0.002248184,0.0013299482,0.002043457,0.0021172452],"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.000075537726,0.000058426274,0.00042164014,0.00026393856,0.00006573442,0.00046981566,0.00018158295,0.530142,0.011805245,0.39531857,0.0069822213,0.05421526],"study_design_scores_gemma":[0.000013106397,0.000018319586,0.00008516511,0.000044635522,0.000011968341,0.00015652539,0.000025384792,0.9302897,0.00202896,0.06213438,0.005169419,0.000022484684],"about_ca_topic_score_codex":0.00072851893,"about_ca_topic_score_gemma":0.0009410545,"teacher_disagreement_score":0.004689134,"about_ca_system_score_codex":0.0011262031,"about_ca_system_score_gemma":0.0014846178,"threshold_uncertainty_score":0.01568669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59745437,0.007569186,0.34929523,0.001061638,0.00014691731,0.00009577057,0.00048815072,0.0006672407,0.04322144],"genre_scores_gemma":[0.98474413,0.0011049595,0.011445339,0.000044972952,0.00003025279,0.000023821327,0.0000994291,0.000038039485,0.002468964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.0004204617,0.000033685774,0.00008045204,0.00047707433,0.00022220064],"domain_scores_gemma":[0.99585813,0.0025634929,0.00040176423,0.00027699178,0.0008415953,0.000058112033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017316393,0.0012283934,0.0009921938,0.00086534995,0.00060514844,0.0008590905,0.000703073,0.0010637987,0.0019526725],"category_scores_gemma":[0.00531219,0.00023969302,0.00041122606,0.0008695634,0.0009286224,0.0010368717,0.00063524727,0.0004980562,0.0005244986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037316693,0.000059660717,0.0020475218,0.0001802199,0.0000760739,0.0004437218,0.00019442257,0.9273787,0.017903605,0.039242823,0.0007872316,0.0113128405],"study_design_scores_gemma":[0.000009833251,0.00006505233,0.0006020895,0.00001563734,0.00001529389,0.00012356542,0.000029003391,0.99248815,0.0029483414,0.0034001225,0.0002839213,0.000019006528],"about_ca_topic_score_codex":0.0056662397,"about_ca_topic_score_gemma":0.0034594694,"teacher_disagreement_score":0.0056662397,"about_ca_system_score_codex":0.0017106923,"about_ca_system_score_gemma":0.0011726008,"threshold_uncertainty_score":0.012412012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06562915,0.0038007728,0.9141303,0.0010024792,0.00008439869,0.000041648706,0.00016241362,0.0002738568,0.014874981],"genre_scores_gemma":[0.9529071,0.0027939638,0.040673755,0.00016328246,0.00030548702,0.0001084375,0.00014384033,0.000116239986,0.0027879896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932253,0.00031222973,0.000018243914,0.00005995725,0.00022299863,0.00006408704],"domain_scores_gemma":[0.99729925,0.002049992,0.0002409369,0.00017794655,0.0001865757,0.000045338627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015491926,0.0009971746,0.0006929725,0.0008838868,0.00027201168,0.0009599677,0.00073692173,0.0010420077,0.00135509],"category_scores_gemma":[0.010436671,0.00031279112,0.000371189,0.00071545364,0.0013979431,0.001804889,0.0007755026,0.00090441486,0.0003518216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061806866,0.000022360151,0.0004911159,0.00016662218,0.000028257009,0.00014317695,0.00013425894,0.658938,0.004737349,0.31774047,0.0012887537,0.01624792],"study_design_scores_gemma":[0.000003910741,0.000020977403,0.00025753517,0.000021169813,0.000004925352,0.000073535884,0.000011372339,0.9383292,0.0006058562,0.06003513,0.0006264031,0.000010044662],"about_ca_topic_score_codex":0.0007690284,"about_ca_topic_score_gemma":0.0003454817,"teacher_disagreement_score":0.0015491926,"about_ca_system_score_codex":0.0008737797,"about_ca_system_score_gemma":0.0005137138,"threshold_uncertainty_score":0.008193076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49710152,0.002123498,0.4799201,0.00043574919,0.000052185085,0.00006888196,0.00017310977,0.00054577115,0.019579073],"genre_scores_gemma":[0.9868946,0.00042027357,0.011662092,0.000027286877,0.000022137452,0.000017808208,0.000036798996,0.00001631728,0.0009026823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990427,0.00031585485,0.000034584446,0.000080179525,0.00037015922,0.00015659095],"domain_scores_gemma":[0.9977591,0.0014323968,0.00025525555,0.0001444618,0.00036346522,0.00004529421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011464052,0.0007419547,0.0005975825,0.0006651297,0.0005029394,0.0007596311,0.0005812562,0.00077951717,0.0013391885],"category_scores_gemma":[0.0040497156,0.00021228637,0.00039802727,0.0008649729,0.00076966657,0.000593556,0.00058185897,0.000483942,0.00025007347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004555367,0.000047009315,0.0029632433,0.00017263794,0.00008935352,0.00032427165,0.0002270491,0.9042017,0.033174925,0.03436513,0.00036380012,0.023615323],"study_design_scores_gemma":[0.0000051652223,0.00008883982,0.0006910187,0.000009707994,0.000016904436,0.00010804006,0.00002119236,0.9918969,0.0054265745,0.00157944,0.00014431309,0.000011827664],"about_ca_topic_score_codex":0.004252563,"about_ca_topic_score_gemma":0.0027331808,"teacher_disagreement_score":0.004252563,"about_ca_system_score_codex":0.0012998631,"about_ca_system_score_gemma":0.0008963473,"threshold_uncertainty_score":0.009431183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009122904,0.00011234165,0.9869112,0.000092869304,0.000034637025,0.000030651434,0.00008433764,0.00040634384,0.0032046405],"genre_scores_gemma":[0.48456144,0.0007114657,0.5062662,0.00027395785,0.00012940366,0.00024168985,0.00061819167,0.0002650801,0.0069326847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978808,0.0005820406,0.00009608979,0.00021089021,0.0010875028,0.00014270458],"domain_scores_gemma":[0.99791306,0.0009910809,0.00016308909,0.0003562251,0.0005118588,0.00006458414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276216,0.0005485344,0.00076665106,0.00069540803,0.0006335585,0.00085134536,0.00062915386,0.00073891744,0.0010120195],"category_scores_gemma":[0.006525315,0.00032396545,0.0005337417,0.0008370417,0.00083648,0.0006061208,0.0010470434,0.0010415144,0.0007166035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016383722,0.000041978,0.00072831166,0.00018349211,0.000078680314,0.00024025816,0.0001928749,0.5577887,0.03150052,0.27041692,0.002667063,0.13599733],"study_design_scores_gemma":[0.000014655551,0.000025535664,0.00011677602,0.000019791874,0.0000074507816,0.00011183972,0.000006824544,0.94288504,0.012861888,0.04064655,0.0032846844,0.000019035637],"about_ca_topic_score_codex":0.0020011417,"about_ca_topic_score_gemma":0.0022628994,"teacher_disagreement_score":0.0020011417,"about_ca_system_score_codex":0.0008481959,"about_ca_system_score_gemma":0.0017733477,"threshold_uncertainty_score":0.0061540604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20062615,0.00247691,0.7929273,0.00022371564,0.0001290541,0.00010541006,0.00012363425,0.0012240557,0.0021637508],"genre_scores_gemma":[0.7688331,0.0011199332,0.22819868,0.00014464367,0.00011337415,0.00012804312,0.00035853704,0.00014360211,0.0009601746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966618,0.0015964754,0.0002788864,0.00026438522,0.0009805881,0.00021803807],"domain_scores_gemma":[0.97330713,0.020365903,0.0014555014,0.001229278,0.0034530675,0.00018911823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007962835,0.0011506913,0.0013164061,0.0022720767,0.00030445447,0.0011436832,0.0008157176,0.0014729426,0.00093987584],"category_scores_gemma":[0.039473407,0.0005213137,0.0007046622,0.0007967284,0.0007145321,0.0019679347,0.0007626775,0.00064733624,0.00047068304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006093471,0.0004329687,0.04128243,0.0008200744,0.0009764221,0.00026628855,0.0002789621,0.2581074,0.06908685,0.0161156,0.0012996044,0.60524005],"study_design_scores_gemma":[0.00031022326,0.0023884566,0.018719373,0.000131207,0.0005753349,0.0007675467,0.00014240455,0.8300874,0.1381716,0.0048905797,0.0035586476,0.0002572328],"about_ca_topic_score_codex":0.00047771633,"about_ca_topic_score_gemma":0.0005023544,"teacher_disagreement_score":0.007962835,"about_ca_system_score_codex":0.00066668994,"about_ca_system_score_gemma":0.0004105905,"threshold_uncertainty_score":0.042111993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118211955,0.00013886474,0.9840134,0.00012413623,0.00003288722,0.00010803509,0.00003084581,0.00007565088,0.003654984],"genre_scores_gemma":[0.8593976,0.00024011543,0.1372169,0.00017339621,0.000054485827,0.00033398048,0.000043283293,0.00004112697,0.0024991296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.00037512096,0.000033692268,0.00010944063,0.00022573576,0.000121214856],"domain_scores_gemma":[0.9994491,0.0003048137,0.000059718073,0.000023941362,0.00010362123,0.00005884709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172063,0.0010931013,0.0008933967,0.000543422,0.0003526206,0.00095488864,0.00097237434,0.00068198075,0.0018255466],"category_scores_gemma":[0.0023162994,0.00026282153,0.00037391073,0.00046392548,0.000621399,0.0008817368,0.000993176,0.00063397107,0.0003527751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004294321,0.00033962453,0.0008652141,0.00025550558,0.00017548687,0.0002883233,0.00036383228,0.62866247,0.044555906,0.1601411,0.005196696,0.15872633],"study_design_scores_gemma":[0.000030266361,0.0001789839,0.00019071024,0.00001224356,0.000018749277,0.00007122781,0.00002658362,0.97745025,0.0020516533,0.01890549,0.0010449078,0.000018916775],"about_ca_topic_score_codex":0.0011968663,"about_ca_topic_score_gemma":0.0011521275,"teacher_disagreement_score":0.0018255466,"about_ca_system_score_codex":0.0008650005,"about_ca_system_score_gemma":0.0009080116,"threshold_uncertainty_score":0.0062760115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05863582,0.00031671458,0.9372586,0.00021503096,0.000022461745,0.000030756455,0.00003751592,0.00018711491,0.0032959199],"genre_scores_gemma":[0.8046712,0.0002725401,0.19231057,0.000091283844,0.00004378694,0.00004854146,0.000040587664,0.000034896213,0.002486686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996263,0.00015999714,0.000017195525,0.000047512516,0.00008432737,0.000064639025],"domain_scores_gemma":[0.9998123,0.00008343973,0.000036177345,0.000017885925,0.000037140067,0.00001299169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002996569,0.00062033004,0.0005161443,0.00017705414,0.00028139562,0.00056625926,0.00035974948,0.00047984897,0.0017204317],"category_scores_gemma":[0.00081453356,0.00026310183,0.0002036985,0.00035094496,0.00045282496,0.0005949351,0.00043830916,0.00035526667,0.00046708377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075230637,0.0000805416,0.0012208058,0.00014987389,0.00008371703,0.00018615126,0.00020037199,0.6506536,0.09353405,0.03152103,0.0019305786,0.219687],"study_design_scores_gemma":[0.00008973415,0.000318559,0.00061601633,0.00001265,0.000035832592,0.00018865035,0.000051009756,0.965924,0.019280117,0.011876637,0.0015821446,0.000024708894],"about_ca_topic_score_codex":0.0005100469,"about_ca_topic_score_gemma":0.0012005211,"teacher_disagreement_score":0.0017204317,"about_ca_system_score_codex":0.00041290594,"about_ca_system_score_gemma":0.00043241875,"threshold_uncertainty_score":0.0057554245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5008028,0.0005896876,0.4868647,0.0005608821,0.00007694849,0.000096704185,0.000105131694,0.00034270718,0.01056047],"genre_scores_gemma":[0.9554875,0.00019476796,0.04110882,0.00005100055,0.00002692291,0.000030097042,0.00007309575,0.000016965563,0.003010841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00010080632,0.00002468933,0.00005320769,0.00022742501,0.000082812745],"domain_scores_gemma":[0.99952924,0.00016488078,0.00007402044,0.00013885135,0.000076971795,0.000016044234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048739908,0.0003522156,0.00035234386,0.0003671754,0.00028306662,0.0005838775,0.00038857345,0.00046322335,0.0013508932],"category_scores_gemma":[0.0014843944,0.00013787874,0.00038636493,0.0004383054,0.00050436886,0.0009831098,0.0004972405,0.0005785035,0.00020750961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012953677,0.00012463312,0.002858984,0.00014858434,0.00017404168,0.0013519465,0.00033214554,0.19757332,0.18102439,0.41928655,0.0030616587,0.1927684],"study_design_scores_gemma":[0.000089676316,0.0004410989,0.0018417233,0.00003096941,0.000049318194,0.0013583992,0.000042894095,0.81367356,0.11818027,0.05795792,0.006280731,0.00005355543],"about_ca_topic_score_codex":0.00029600508,"about_ca_topic_score_gemma":0.00031234592,"teacher_disagreement_score":0.0013508932,"about_ca_system_score_codex":0.00074834103,"about_ca_system_score_gemma":0.0005542593,"threshold_uncertainty_score":0.005429566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021818928,0.00051702285,0.97232777,0.00028037786,0.00007546282,0.000048669146,0.000042570715,0.0002836374,0.004605609],"genre_scores_gemma":[0.78344095,0.0009981643,0.21173663,0.00018122116,0.00011711346,0.00014072486,0.000054158263,0.000058032845,0.003272945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00022666038,0.000017797593,0.000046758894,0.00017600722,0.0000965038],"domain_scores_gemma":[0.9987882,0.000558241,0.00012027684,0.00027749827,0.000218531,0.00003736404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096815487,0.00047653585,0.0004951792,0.00044837734,0.00047764825,0.00091793295,0.0012207673,0.0007938119,0.0011872584],"category_scores_gemma":[0.0031433126,0.00017303556,0.00038488253,0.00054359453,0.0010972954,0.0013890609,0.00065080816,0.0009954172,0.00035293304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009633959,0.000028868133,0.00024569995,0.000088803325,0.000026742795,0.00030918382,0.00016894053,0.4603592,0.009203664,0.49026996,0.0013011676,0.037901543],"study_design_scores_gemma":[0.00002509862,0.00007248246,0.00008086457,0.000029014844,0.000015270776,0.00017853422,0.000020181355,0.88896686,0.0039017352,0.101988286,0.0046919724,0.000029637999],"about_ca_topic_score_codex":0.0022295902,"about_ca_topic_score_gemma":0.0013754495,"teacher_disagreement_score":0.0022295902,"about_ca_system_score_codex":0.00066906953,"about_ca_system_score_gemma":0.00067879603,"threshold_uncertainty_score":0.005120158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016619469,0.00011668815,0.99792504,0.000023279414,0.000009479295,0.0000075043913,0.000017139382,0.00009625106,0.00014257377],"genre_scores_gemma":[0.12028689,0.0007325484,0.8767663,0.000101289654,0.0001513547,0.00011172048,0.00034298704,0.000096679556,0.001410142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900705,0.00034515717,0.000069674104,0.00017342043,0.00033877057,0.00006588275],"domain_scores_gemma":[0.99737406,0.0017362712,0.00022862143,0.00019546226,0.00042136022,0.000044216515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022506188,0.0010663224,0.0013344993,0.0009051597,0.0002442922,0.0010261319,0.0009065217,0.0009357847,0.0010941863],"category_scores_gemma":[0.0100240605,0.0005832363,0.0006043887,0.00093343435,0.00069932087,0.00256402,0.00092348363,0.0011367205,0.0010000183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004133921,0.00013115365,0.002908839,0.00049745245,0.00022067613,0.00038666758,0.00017035218,0.5182815,0.056548383,0.04421616,0.002892141,0.37333333],"study_design_scores_gemma":[0.000036703463,0.000081480146,0.0005166015,0.000025382902,0.000032090484,0.00023066795,0.000014586826,0.97927654,0.009182051,0.008809328,0.0017679239,0.000026685972],"about_ca_topic_score_codex":0.00060664525,"about_ca_topic_score_gemma":0.00070375716,"teacher_disagreement_score":0.0022506188,"about_ca_system_score_codex":0.0003770228,"about_ca_system_score_gemma":0.0008134802,"threshold_uncertainty_score":0.011902511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5599485,0.0031084493,0.40093857,0.00027964052,0.00009892394,0.000052942294,0.0006415491,0.0004800941,0.03445132],"genre_scores_gemma":[0.9928966,0.00062189804,0.0038729243,0.000024720472,0.000027707963,0.000031794734,0.000110959285,0.000024344274,0.002389134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994331,0.00010684989,0.000019947867,0.00007493734,0.00020907249,0.00015614636],"domain_scores_gemma":[0.99716336,0.0018883848,0.00018332244,0.00018881047,0.0005056819,0.00007046677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556954,0.0003703785,0.00036808258,0.0009027442,0.00029243596,0.0010048853,0.00066576415,0.00039395923,0.002414337],"category_scores_gemma":[0.0052420557,0.00022902907,0.00015074726,0.0005352964,0.0009433343,0.0016268534,0.00043329454,0.0003264865,0.0003409994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001380849,0.000061008683,0.0011728025,0.00019811162,0.000028484834,0.00040186304,0.00016634328,0.7477936,0.022031495,0.19349946,0.0015030854,0.033005707],"study_design_scores_gemma":[0.000007742748,0.000031285002,0.001131487,0.000040084862,0.000018898487,0.0002572925,0.000039022358,0.93022346,0.010528866,0.056105826,0.0015800092,0.00003598139],"about_ca_topic_score_codex":0.001705306,"about_ca_topic_score_gemma":0.0012360658,"teacher_disagreement_score":0.002414337,"about_ca_system_score_codex":0.0013715324,"about_ca_system_score_gemma":0.0007976453,"threshold_uncertainty_score":0.009951234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6802303,0.00082136487,0.2926092,0.00064038334,0.0001458429,0.00008048482,0.00020867218,0.0006423682,0.024621302],"genre_scores_gemma":[0.97762376,0.00016858296,0.017635873,0.00012268077,0.000023063723,0.000059460537,0.00008626683,0.00006112225,0.0042191274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992374,0.0001593647,0.00003319883,0.00008573059,0.00035067913,0.00013361813],"domain_scores_gemma":[0.997489,0.0012542751,0.00029611352,0.00043112377,0.00037697464,0.0001526342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043954892,0.00028802315,0.0005226351,0.0011183785,0.0014077567,0.0011509708,0.0008897031,0.0012260887,0.0020068763],"category_scores_gemma":[0.005428843,0.0002986134,0.0003092389,0.00057718495,0.0016780349,0.0013286555,0.0018208374,0.0011429503,0.00036281414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036399264,0.00008829733,0.002016064,0.00018036083,0.000058153793,0.00076669845,0.00077853596,0.110437796,0.047818292,0.79792607,0.0029978477,0.036568034],"study_design_scores_gemma":[0.000043553388,0.00014357734,0.0009011542,0.000051229974,0.000020647341,0.0007601089,0.00015411801,0.60879195,0.03842008,0.3457222,0.0048990864,0.00009226101],"about_ca_topic_score_codex":0.0010691121,"about_ca_topic_score_gemma":0.0007092073,"teacher_disagreement_score":0.0020068763,"about_ca_system_score_codex":0.00070150825,"about_ca_system_score_gemma":0.00042819846,"threshold_uncertainty_score":0.0067136884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039842144,0.0028201605,0.9449045,0.00053680217,0.00021175461,0.00036491128,0.00031294738,0.001435641,0.009571118],"genre_scores_gemma":[0.24077977,0.0011442048,0.75227994,0.00046340184,0.000090402544,0.0006809783,0.00056245073,0.0002952729,0.003703635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.00073422893,0.000031198786,0.000080903905,0.00017625443,0.00011888373],"domain_scores_gemma":[0.9985006,0.0011107583,0.000105540734,0.00007865728,0.0001611826,0.000043284428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017518812,0.00093626097,0.0012623185,0.0015678245,0.0013505135,0.001405897,0.0015211152,0.0017648747,0.003943052],"category_scores_gemma":[0.0044828057,0.0006552475,0.00074650865,0.0024474338,0.0012894726,0.0013236721,0.00063001073,0.00091690937,0.0008467678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013194286,0.00012395676,0.00054570846,0.00015754427,0.00008073324,0.00006363355,0.00013145228,0.86877793,0.0008189644,0.0145133,0.0058040386,0.10885072],"study_design_scores_gemma":[0.000086648535,0.00011028208,0.00016507233,0.00004044793,0.000028138547,0.00005224915,0.000063098174,0.98420423,0.00067882816,0.010463367,0.0040873117,0.000020309812],"about_ca_topic_score_codex":0.008421159,"about_ca_topic_score_gemma":0.007850056,"teacher_disagreement_score":0.008421159,"about_ca_system_score_codex":0.0014011454,"about_ca_system_score_gemma":0.002265543,"threshold_uncertainty_score":0.016744256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.815355,0.0011327526,0.16315009,0.0006860187,0.000038531536,0.00003327123,0.00017931403,0.00023000827,0.019194996],"genre_scores_gemma":[0.9967334,0.00025165928,0.002496519,0.000044327648,0.000025962736,0.00001175774,0.000024322835,0.000014003815,0.0003979252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969952,0.0013815747,0.00008747656,0.00023847041,0.0008487694,0.00044860307],"domain_scores_gemma":[0.9810244,0.015488574,0.0013053978,0.0007650355,0.0012092534,0.0002074255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984039,0.00123123,0.0011507664,0.00036821578,0.00047768423,0.001345034,0.0005648798,0.0011079019,0.00112076],"category_scores_gemma":[0.01686954,0.00031466287,0.00034456843,0.00047828173,0.0014950928,0.0017291937,0.0013780581,0.0008722769,0.0002641066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006920856,0.000074835814,0.00351126,0.00015617441,0.00009455986,0.0006770031,0.00021084382,0.9253189,0.034125637,0.017702531,0.00027141208,0.017164733],"study_design_scores_gemma":[0.00007061511,0.00066225487,0.0024540601,0.000032572116,0.00008404855,0.000678016,0.00017824567,0.95795906,0.027912693,0.009547904,0.00037490155,0.000045643443],"about_ca_topic_score_codex":0.0006861816,"about_ca_topic_score_gemma":0.0005596651,"teacher_disagreement_score":0.002984039,"about_ca_system_score_codex":0.0006495186,"about_ca_system_score_gemma":0.00070469134,"threshold_uncertainty_score":0.015781283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031057678,0.0053695436,0.9320117,0.0010497747,0.00032138792,0.00007581262,0.0014558259,0.0005449173,0.028113391],"genre_scores_gemma":[0.72773707,0.010197924,0.23604098,0.0016145397,0.0015413995,0.000732661,0.0021503035,0.00051707134,0.019468023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976718,0.0004016535,0.0000923722,0.0004047927,0.0010045733,0.00042475044],"domain_scores_gemma":[0.9922315,0.0053286287,0.000409924,0.0007510458,0.0010736214,0.00020522428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029733204,0.0018053486,0.0023438293,0.0017428244,0.00077541615,0.0030489913,0.0017573243,0.0017810947,0.005930007],"category_scores_gemma":[0.009272322,0.00073400646,0.0011988218,0.0017377192,0.0016757294,0.0048371875,0.0027584734,0.0028879629,0.001597104],"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.00025923955,0.00011136771,0.0009186506,0.0004069162,0.00012551191,0.00045397555,0.00013340265,0.6942403,0.014848089,0.24691536,0.00840683,0.03318035],"study_design_scores_gemma":[0.000009547867,0.00006999416,0.000476793,0.00007649436,0.000027316944,0.00022704183,0.000018749897,0.900945,0.0052259658,0.0890152,0.0038561092,0.000051839193],"about_ca_topic_score_codex":0.0012831558,"about_ca_topic_score_gemma":0.0017932625,"teacher_disagreement_score":0.005930007,"about_ca_system_score_codex":0.0029473354,"about_ca_system_score_gemma":0.0021343913,"threshold_uncertainty_score":0.021384478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0840394,0.0011830886,0.9060224,0.0002683682,0.00002641976,0.000038037342,0.00014099054,0.00012208104,0.008159257],"genre_scores_gemma":[0.94791114,0.0014019373,0.04668688,0.00015945212,0.000084752406,0.000070420865,0.00020919426,0.000065775566,0.003410461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986835,0.00037583814,0.00007458146,0.00019139925,0.000532447,0.0001423672],"domain_scores_gemma":[0.99387485,0.004281117,0.0007259027,0.00051032635,0.00051389646,0.00009397297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017892503,0.0007006684,0.00095364754,0.000831819,0.00042778373,0.0011112129,0.0009925081,0.0006148437,0.0015250804],"category_scores_gemma":[0.00889663,0.00043360773,0.0003347557,0.00086422643,0.0015478551,0.003233777,0.001383099,0.0007232829,0.00027527884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031073668,0.000083885105,0.0037189198,0.00063355773,0.00018765028,0.00071319746,0.0005976432,0.37022543,0.026625209,0.5097176,0.0018414044,0.08534481],"study_design_scores_gemma":[0.0000150431015,0.00011701024,0.0026421791,0.000064989385,0.00005099733,0.00082759187,0.00011778117,0.7767768,0.013745855,0.20360237,0.001950766,0.00008870484],"about_ca_topic_score_codex":0.00027172733,"about_ca_topic_score_gemma":0.00052261323,"teacher_disagreement_score":0.0017892503,"about_ca_system_score_codex":0.00070562685,"about_ca_system_score_gemma":0.0005351943,"threshold_uncertainty_score":0.009462595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044002295,0.00041380685,0.990867,0.00011448418,0.00006114831,0.000021212838,0.000057853216,0.0002806111,0.0037835795],"genre_scores_gemma":[0.39933413,0.0039981455,0.581399,0.0003624456,0.00023925104,0.00026187566,0.00053246436,0.0004917097,0.013380942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.00029700043,0.00005454545,0.000105271734,0.000626618,0.00009970883],"domain_scores_gemma":[0.9972017,0.0014458778,0.00019167451,0.00043089848,0.0006704596,0.000059454716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015788255,0.00087352376,0.00087847,0.0009649806,0.00051119406,0.0015792382,0.0014492783,0.001172956,0.0025893273],"category_scores_gemma":[0.009981582,0.00051903987,0.00060806633,0.0012624742,0.00083851296,0.003592061,0.0010720008,0.00184158,0.0019769582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005000804,0.000044006905,0.0008304776,0.00012312898,0.000026227826,0.00017904691,0.00019500189,0.7724213,0.0030542698,0.15652531,0.0036732068,0.062878065],"study_design_scores_gemma":[0.0000035619355,0.000006825204,0.000100763114,0.000015299276,0.000003572318,0.000092479626,0.000024154659,0.9722055,0.0007480784,0.024253009,0.0025353488,0.000011429815],"about_ca_topic_score_codex":0.0029689656,"about_ca_topic_score_gemma":0.0029816974,"teacher_disagreement_score":0.0029689656,"about_ca_system_score_codex":0.0011071776,"about_ca_system_score_gemma":0.00083340745,"threshold_uncertainty_score":0.008662105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5083792,0.0032145677,0.47273535,0.0010457599,0.00017421777,0.000088389264,0.00031600572,0.0011973898,0.012849129],"genre_scores_gemma":[0.9893154,0.00026093682,0.009036367,0.00010209491,0.00003488261,0.000028918064,0.00007896586,0.000055634602,0.0010867777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534875,0.0011756466,0.0001799379,0.0006889333,0.0010716334,0.0015351634],"domain_scores_gemma":[0.983533,0.011661677,0.0012220406,0.0008306069,0.0020110074,0.00074169727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005346742,0.0016257162,0.0010992404,0.0010582892,0.0010718931,0.004029643,0.0013735703,0.0023325125,0.0019868757],"category_scores_gemma":[0.016730491,0.0005977318,0.0004257328,0.0008883511,0.0020498468,0.00254972,0.0016220895,0.0009824899,0.00048369917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017099305,0.00010389873,0.0017416406,0.0001084594,0.00010124425,0.00026821054,0.00010751391,0.9571191,0.013961583,0.017283393,0.0007054274,0.0067895018],"study_design_scores_gemma":[0.000023530829,0.00016183774,0.00025113727,0.000015837251,0.000034895907,0.00008626942,0.000037617436,0.9897125,0.0054602926,0.0039639175,0.00021998893,0.000032214648],"about_ca_topic_score_codex":0.0040044943,"about_ca_topic_score_gemma":0.0014749321,"teacher_disagreement_score":0.005346742,"about_ca_system_score_codex":0.0023834626,"about_ca_system_score_gemma":0.001617576,"threshold_uncertainty_score":0.028276622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005198763,0.00031346886,0.992475,0.00017364405,0.00004668381,0.000033942244,0.000052431984,0.00015210612,0.0015538996],"genre_scores_gemma":[0.54860955,0.0007590217,0.44462296,0.0004828797,0.0001710486,0.00021895689,0.00021203863,0.000090746755,0.0048328885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.00024324469,0.000041119045,0.00014079238,0.00028651473,0.00007008735],"domain_scores_gemma":[0.9990927,0.00042196235,0.00011725307,0.00011786723,0.00022527848,0.000025070072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955981,0.0005242002,0.00044112885,0.00027904913,0.00037139322,0.0011197847,0.0008741432,0.0006881235,0.003039063],"category_scores_gemma":[0.002740182,0.00023142768,0.00022759389,0.00046248894,0.000714969,0.0010985218,0.00091519643,0.00088436954,0.00069708115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003843089,0.00010288534,0.00085670844,0.0003572038,0.00007083854,0.00013002614,0.00015687474,0.3688388,0.04148344,0.23381612,0.006588779,0.34721413],"study_design_scores_gemma":[0.00004700644,0.00011149362,0.00016056458,0.00003055155,0.000015979718,0.00010360671,0.000020112295,0.95154256,0.017440392,0.023850583,0.0066467305,0.000030461653],"about_ca_topic_score_codex":0.0008972064,"about_ca_topic_score_gemma":0.0012200612,"teacher_disagreement_score":0.003039063,"about_ca_system_score_codex":0.0005409654,"about_ca_system_score_gemma":0.001098607,"threshold_uncertainty_score":0.010166705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033622615,0.00046525817,0.96085024,0.000091896625,0.00003311362,0.000014413775,0.000024375111,0.00012732908,0.0047706543],"genre_scores_gemma":[0.8997124,0.0006803146,0.096692026,0.00004525353,0.00007076828,0.000055999248,0.00003398444,0.000025525342,0.0026837618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996063,0.00017869462,0.0000119012375,0.000022621829,0.00013728799,0.000043150052],"domain_scores_gemma":[0.9995981,0.0002175495,0.00004977709,0.00005396341,0.00006435358,0.000016221213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005147075,0.00038144953,0.00027453317,0.00019774854,0.00026377596,0.0005366906,0.0002948216,0.00036597587,0.0007580525],"category_scores_gemma":[0.0015174766,0.00021493262,0.00018243026,0.00039332654,0.0006978542,0.00054696656,0.00044351412,0.00036517688,0.0002763918],"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.00013120689,0.000036863403,0.0005786933,0.00011028389,0.000030359784,0.00030475718,0.00019103345,0.6103038,0.03068751,0.26936945,0.0016932449,0.08656275],"study_design_scores_gemma":[0.0000055329265,0.000051771804,0.00018969315,0.000009648105,0.000004391807,0.00009285205,0.000017530778,0.968579,0.0035425744,0.026860636,0.0006336104,0.000012751577],"about_ca_topic_score_codex":0.00053890556,"about_ca_topic_score_gemma":0.001190524,"teacher_disagreement_score":0.0007580525,"about_ca_system_score_codex":0.00039151034,"about_ca_system_score_gemma":0.00038760356,"threshold_uncertainty_score":0.0028406382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8674582,0.00058448,0.13028061,0.00013401132,0.00002605416,0.00002146792,0.00004284513,0.00018244806,0.0012698458],"genre_scores_gemma":[0.9984451,0.000053125048,0.0013992632,0.000011015931,0.000006635197,0.0000058466017,0.0000061323185,0.000005990526,0.00006692862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866426,0.00042937323,0.000057533387,0.00016728623,0.00039802818,0.00028362306],"domain_scores_gemma":[0.9765385,0.019025264,0.0022792376,0.0007665723,0.0011153646,0.00027514977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024030372,0.0006547865,0.0006827595,0.0006578756,0.0005069937,0.0011577719,0.0009028212,0.00068585726,0.0003857937],"category_scores_gemma":[0.016523559,0.00032616887,0.00035728744,0.00051292655,0.0010781165,0.001284351,0.0010712015,0.0005632478,0.000067981906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007512929,0.00008724963,0.013300708,0.000077512814,0.00012183527,0.0008343194,0.0002354491,0.94467926,0.0200686,0.004020685,0.00022426875,0.015598835],"study_design_scores_gemma":[0.0000107252645,0.000237968,0.0033728161,0.00000712758,0.00004928176,0.00028758674,0.000114277966,0.99005616,0.0041666836,0.0016086685,0.00007457394,0.000014117629],"about_ca_topic_score_codex":0.0018646332,"about_ca_topic_score_gemma":0.0019831134,"teacher_disagreement_score":0.0024030372,"about_ca_system_score_codex":0.0011913952,"about_ca_system_score_gemma":0.00036815664,"threshold_uncertainty_score":0.012708604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004146445,0.00071653334,0.9849466,0.00019705946,0.00008793533,0.000032986223,0.000115152994,0.00043049708,0.00932674],"genre_scores_gemma":[0.4245572,0.006450496,0.5401798,0.00068518746,0.00043721043,0.0006375628,0.00094325293,0.0011650386,0.024944229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981001,0.0005177247,0.00007896464,0.00015897595,0.00096127315,0.00018298473],"domain_scores_gemma":[0.99302614,0.004209431,0.0003502686,0.0008517495,0.001448356,0.0001141123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032905529,0.0012958199,0.001363426,0.0015692941,0.00086147914,0.002838532,0.0019865031,0.0016288287,0.004848694],"category_scores_gemma":[0.019500412,0.0008080712,0.000977186,0.0017422314,0.0018544606,0.0048970706,0.0015690888,0.0028664214,0.0039703064],"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.000064047075,0.00005002249,0.00042540894,0.00022016528,0.000029298959,0.00019219243,0.0002590085,0.66205937,0.0019574475,0.29712087,0.005063167,0.032558996],"study_design_scores_gemma":[0.0000068777167,0.000008711263,0.00009276624,0.000044692162,0.0000060111465,0.00009659143,0.000045401852,0.91548246,0.00084694923,0.08011749,0.0032332856,0.000018724746],"about_ca_topic_score_codex":0.0029407793,"about_ca_topic_score_gemma":0.00286415,"teacher_disagreement_score":0.004848694,"about_ca_system_score_codex":0.0019491313,"about_ca_system_score_gemma":0.001584427,"threshold_uncertainty_score":0.017402291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011771754,0.00061855477,0.9851113,0.0001260713,0.00015369568,0.00005377278,0.00005940909,0.0005247589,0.0015806303],"genre_scores_gemma":[0.38203996,0.0005685775,0.6101998,0.0005358968,0.0002857646,0.00013726979,0.00020259048,0.000036400394,0.0059937746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.0002474809,0.00008088367,0.00021892226,0.000438857,0.000100335106],"domain_scores_gemma":[0.9989213,0.00024828728,0.00010712169,0.0003052451,0.0003456361,0.000072371644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007560347,0.0005110024,0.001162168,0.0005901083,0.00052037515,0.00070401136,0.0015046141,0.0010298574,0.0012589385],"category_scores_gemma":[0.0016418073,0.00035692862,0.00039099337,0.0005012421,0.00040599948,0.0015569659,0.0013967176,0.0009081907,0.00083395833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009562158,0.00023579382,0.0016277168,0.00041622086,0.00021049831,0.0005656186,0.0002605943,0.045861702,0.279923,0.045857742,0.006093844,0.61799115],"study_design_scores_gemma":[0.00012163257,0.0004343166,0.0008062937,0.000031725544,0.00012167817,0.0017505513,0.000021989605,0.8635668,0.10136769,0.011174552,0.020474955,0.00012780481],"about_ca_topic_score_codex":0.00028146245,"about_ca_topic_score_gemma":0.0005586242,"teacher_disagreement_score":0.0015046141,"about_ca_system_score_codex":0.00033336776,"about_ca_system_score_gemma":0.0006582776,"threshold_uncertainty_score":0.004211545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55121875,0.00076474267,0.44126922,0.0002799717,0.00003710128,0.000040637726,0.000059483966,0.00014923154,0.0061807553],"genre_scores_gemma":[0.99406415,0.00016861656,0.005273114,0.00002562319,0.000014076335,0.0000125600045,0.0000099718345,0.000006221295,0.0004256685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998602,0.00050770625,0.000047910973,0.00014295909,0.0003579795,0.00034157897],"domain_scores_gemma":[0.98609805,0.0109389415,0.0012382276,0.00073712366,0.00079660356,0.00019102209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023091831,0.00067791616,0.00082460704,0.00053698226,0.0006961859,0.0011243284,0.000762776,0.00079301617,0.00023697483],"category_scores_gemma":[0.0110296,0.00040068652,0.00022849144,0.00082932046,0.001235752,0.001645727,0.0014718524,0.0005043098,0.000087165376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000444137,0.000072358525,0.0055985893,0.00013481968,0.00011026667,0.0019156891,0.00083238696,0.91307133,0.014303684,0.030853987,0.00051104015,0.03215164],"study_design_scores_gemma":[0.000017861415,0.00013034127,0.0010691924,0.000010822209,0.00004022687,0.0005289864,0.00023530962,0.9794939,0.00412845,0.013763982,0.00055720715,0.00002370176],"about_ca_topic_score_codex":0.0024004984,"about_ca_topic_score_gemma":0.0035262024,"teacher_disagreement_score":0.0024004984,"about_ca_system_score_codex":0.0006943141,"about_ca_system_score_gemma":0.00095784815,"threshold_uncertainty_score":0.012212276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007854449,0.00021592855,0.99143034,0.000034084314,0.000013889354,0.0000056815256,0.000017503286,0.00008639601,0.00034185717],"genre_scores_gemma":[0.5326368,0.0009177575,0.46379218,0.00008120749,0.00011014587,0.000072386865,0.00023938739,0.000095522504,0.0020545074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996593,0.00011243072,0.000013536864,0.000058329733,0.00013148143,0.000024900051],"domain_scores_gemma":[0.9994836,0.00030628295,0.00005492555,0.00005696139,0.0000851884,0.000012988212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052238663,0.00041208864,0.0003550864,0.00032881333,0.00019342385,0.00048025537,0.00035671348,0.0003577953,0.00045769644],"category_scores_gemma":[0.003977214,0.0002467414,0.00018671561,0.00041771797,0.00026362133,0.0008041008,0.00040976293,0.00043171976,0.00028354605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028832123,0.0000444982,0.0018136506,0.00012457663,0.00005575271,0.0001386536,0.00007305988,0.47594506,0.04012916,0.0638864,0.0013603865,0.4161405],"study_design_scores_gemma":[0.0000064774,0.000020896046,0.00029306396,0.0000074537143,0.0000058568066,0.00006577645,0.000004368644,0.9824827,0.008732815,0.0072710197,0.0010995263,0.00001016308],"about_ca_topic_score_codex":0.0006506692,"about_ca_topic_score_gemma":0.00068910077,"teacher_disagreement_score":0.0006506692,"about_ca_system_score_codex":0.00037971837,"about_ca_system_score_gemma":0.0005453881,"threshold_uncertainty_score":0.0027626753},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17828473,0.004526223,0.80166405,0.00038762367,0.00008703523,0.000055958008,0.00035952093,0.0006636162,0.013971211],"genre_scores_gemma":[0.9095188,0.0022420613,0.08421755,0.00013997138,0.000070964146,0.000050958588,0.0002078435,0.00016781289,0.003384027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980685,0.00048200483,0.000091626855,0.00011575234,0.0010209571,0.00022118166],"domain_scores_gemma":[0.99405515,0.003401417,0.0003974506,0.00061802764,0.0014594281,0.000068481066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023174842,0.0010309858,0.0010047058,0.0014109671,0.0005549396,0.0009078178,0.00061277533,0.0007461047,0.0017708248],"category_scores_gemma":[0.009927631,0.000446625,0.00052868144,0.001003361,0.0012058221,0.0017448424,0.0009693034,0.00091884035,0.000612116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021488991,0.000019356272,0.0014457803,0.00017314957,0.000050921564,0.00017926475,0.00020964092,0.92400366,0.011337188,0.034841597,0.0007501074,0.026774425],"study_design_scores_gemma":[0.000008388925,0.000052384556,0.0011822133,0.000022859269,0.000020784184,0.00022379078,0.00004001087,0.9794886,0.0061501428,0.0119375065,0.00084263866,0.00003074353],"about_ca_topic_score_codex":0.0030489608,"about_ca_topic_score_gemma":0.00267799,"teacher_disagreement_score":0.0030489608,"about_ca_system_score_codex":0.0017357781,"about_ca_system_score_gemma":0.0007898497,"threshold_uncertainty_score":0.012593985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010781706,0.00010674079,0.99798703,0.00008857995,0.000046101024,0.000024342815,0.000014355894,0.00008538635,0.0005692182],"genre_scores_gemma":[0.13801809,0.000529838,0.8567439,0.00017043875,0.0002354966,0.00032731122,0.00012599358,0.00006702895,0.0037818942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994413,0.00013738412,0.000019769855,0.000095704985,0.0002838654,0.000021886803],"domain_scores_gemma":[0.9994671,0.0002300865,0.000043618606,0.000112437825,0.000118439624,0.00002834903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006119824,0.00048476402,0.0004745873,0.00048296733,0.00056597276,0.00039647068,0.0008791421,0.00067317963,0.0016960963],"category_scores_gemma":[0.001909316,0.00020945606,0.00035610102,0.0005475918,0.0006654948,0.00086228194,0.0012777189,0.001007308,0.00039368682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022248487,0.00013481398,0.0005599989,0.00035488198,0.000072372444,0.00019603744,0.0002201501,0.2359758,0.0890163,0.10512666,0.009397713,0.55872273],"study_design_scores_gemma":[0.000053827906,0.00014918752,0.00017190269,0.000020670968,0.000015258978,0.00021878844,0.00002911873,0.957851,0.008920083,0.02065652,0.011886198,0.00002736965],"about_ca_topic_score_codex":0.00062625326,"about_ca_topic_score_gemma":0.0011968013,"teacher_disagreement_score":0.0016960963,"about_ca_system_score_codex":0.00038562258,"about_ca_system_score_gemma":0.0006766346,"threshold_uncertainty_score":0.005674064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011047442,0.001136263,0.9829352,0.00024806493,0.00032073588,0.00019539981,0.00010350455,0.0012941988,0.0027191753],"genre_scores_gemma":[0.41840535,0.0016672959,0.5699899,0.0005558976,0.0003464373,0.00049087976,0.00052053685,0.00014620683,0.007877379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.00012055752,0.000055593155,0.000102029364,0.00034767733,0.00006369928],"domain_scores_gemma":[0.9990539,0.0002571545,0.000107703956,0.00023569776,0.00027475564,0.000070849936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976394,0.0005822351,0.0008127728,0.0012634221,0.0010057014,0.00087259494,0.0021389776,0.0008194295,0.0009553314],"category_scores_gemma":[0.0017789637,0.00027123193,0.00053860515,0.0009421567,0.00062010955,0.0019658343,0.0017027905,0.0008848188,0.00040621433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051148573,0.00026838173,0.0008780713,0.0005294448,0.00017253443,0.0006488582,0.00064890436,0.061580338,0.1211317,0.09241116,0.013188334,0.70803076],"study_design_scores_gemma":[0.00020664353,0.0007727476,0.00061064056,0.000070455324,0.00020560954,0.001601317,0.0001319193,0.86311585,0.033780813,0.03599594,0.06330915,0.0001990606],"about_ca_topic_score_codex":0.0010641514,"about_ca_topic_score_gemma":0.0019967023,"teacher_disagreement_score":0.0021389776,"about_ca_system_score_codex":0.0005876732,"about_ca_system_score_gemma":0.0010741906,"threshold_uncertainty_score":0.0058048964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095405385,0.00015199959,0.901735,0.000112446396,0.000019231697,0.000019835461,0.000022017584,0.00027406178,0.0022600372],"genre_scores_gemma":[0.8215707,0.00022515765,0.17626655,0.000109639455,0.000039165774,0.000056099274,0.00004445536,0.000077212244,0.0016110011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993974,0.0002950779,0.000024708897,0.000066588174,0.00013264077,0.0000836925],"domain_scores_gemma":[0.9988896,0.00060642563,0.00011787756,0.00019060948,0.00016012049,0.00003530463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008286545,0.00067699514,0.00076874375,0.00036420376,0.00021724057,0.00050205743,0.0004966841,0.00042710712,0.00084795634],"category_scores_gemma":[0.0026585134,0.0003321451,0.00021540775,0.0005450353,0.000764134,0.0008586437,0.0010209685,0.00039943922,0.00035592268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023168747,0.00006739179,0.0006262728,0.000031675216,0.000034393124,0.000050349987,0.000088068315,0.8838925,0.042362165,0.011713709,0.00055429083,0.06034747],"study_design_scores_gemma":[0.000008869628,0.00004444294,0.00017882616,0.00000245829,0.0000043151454,0.000016767191,0.000009091507,0.9887793,0.007308033,0.0034637689,0.0001786586,0.0000054146867],"about_ca_topic_score_codex":0.0004130896,"about_ca_topic_score_gemma":0.0006726643,"teacher_disagreement_score":0.00084795634,"about_ca_system_score_codex":0.00031797407,"about_ca_system_score_gemma":0.00039521352,"threshold_uncertainty_score":0.004382372},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015875487,0.00016023636,0.98217976,0.00018567085,0.00001870476,0.000042272717,0.000018940302,0.00012581078,0.0013930176],"genre_scores_gemma":[0.81851745,0.00031623308,0.17942545,0.00017034021,0.000053537035,0.00021272837,0.00005465943,0.000027302192,0.0012222594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.00058620574,0.00004020901,0.00013262365,0.00030330507,0.00010179407],"domain_scores_gemma":[0.99704665,0.002239557,0.00021399217,0.00023562904,0.00017990138,0.00008423032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022836928,0.00055021973,0.0010974042,0.00054585957,0.00073257636,0.0009995393,0.0013655559,0.0012381378,0.0010071635],"category_scores_gemma":[0.005310195,0.00058886857,0.0006929193,0.00067027035,0.0015108263,0.0011211353,0.0009685792,0.0010903011,0.00017164828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085984255,0.000043644905,0.00041991292,0.0000352429,0.000029609595,0.000070634684,0.000052809883,0.93408155,0.0017448525,0.05328414,0.00023082538,0.009920793],"study_design_scores_gemma":[0.000008167908,0.00000773384,0.000024911487,0.0000024411104,0.0000025833647,0.000010477874,0.0000017258932,0.9961718,0.00018611948,0.0035033855,0.00007631796,0.0000043264167],"about_ca_topic_score_codex":0.0067581385,"about_ca_topic_score_gemma":0.0075364695,"teacher_disagreement_score":0.0067581385,"about_ca_system_score_codex":0.0013017402,"about_ca_system_score_gemma":0.0020323803,"threshold_uncertainty_score":0.013437629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22153887,0.0064869956,0.73147476,0.0008430498,0.00018563164,0.000067786736,0.0004104968,0.0008996249,0.038092773],"genre_scores_gemma":[0.9489542,0.0022423172,0.040861327,0.00010458274,0.00011778723,0.000058690057,0.0002546527,0.00012774713,0.0072787846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991621,0.00021729768,0.000022684997,0.00004152894,0.0004335735,0.0001229697],"domain_scores_gemma":[0.99716955,0.0019585206,0.00016930616,0.00018563354,0.00046536536,0.00005165743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015985774,0.0011421454,0.001103084,0.0010935519,0.0005093186,0.0009411461,0.0007679339,0.0012498111,0.0037844994],"category_scores_gemma":[0.0058141495,0.0004185662,0.0006180077,0.0010654294,0.0009713854,0.0012395668,0.0008714205,0.00070106017,0.0007185308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017179445,0.000023310926,0.0006453326,0.00019851245,0.000047096015,0.00016933422,0.00009592471,0.9522227,0.0030531099,0.025659882,0.0009116011,0.016801286],"study_design_scores_gemma":[0.0000065452405,0.000026498745,0.00040499182,0.0000151722315,0.000011994408,0.00009004922,0.000025174215,0.99180263,0.00070773624,0.00665546,0.00024360682,0.000010186388],"about_ca_topic_score_codex":0.0046959734,"about_ca_topic_score_gemma":0.004293729,"teacher_disagreement_score":0.0046959734,"about_ca_system_score_codex":0.0017673639,"about_ca_system_score_gemma":0.0010821167,"threshold_uncertainty_score":0.012823224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2691733,0.0027730828,0.7018326,0.0005098833,0.0001220872,0.00007623654,0.00019490438,0.00065264717,0.024665236],"genre_scores_gemma":[0.976923,0.00061587343,0.021416796,0.00008221448,0.000038159338,0.00003118142,0.00004638982,0.00003117642,0.0008152537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978756,0.00095238414,0.00010157224,0.00021163456,0.0005763347,0.00028251772],"domain_scores_gemma":[0.9954827,0.0029821899,0.00044790006,0.0004707565,0.00051754183,0.00009900518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004731631,0.0011467994,0.0009686287,0.0007290919,0.00043985696,0.0013227282,0.00065748004,0.00089854957,0.001081692],"category_scores_gemma":[0.0076848543,0.000377682,0.00050808676,0.0007894179,0.0018686587,0.0011444014,0.001327318,0.0006268525,0.0004917333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012436695,0.000057889192,0.0037195068,0.0003100786,0.00018677703,0.0006091017,0.0002543486,0.82575864,0.03927987,0.09015174,0.0010782053,0.037350148],"study_design_scores_gemma":[0.000043750708,0.00034014467,0.0017608674,0.00006911684,0.000113591035,0.000820417,0.00008843965,0.94555455,0.02519246,0.025021281,0.00093442196,0.000060946146],"about_ca_topic_score_codex":0.00076266116,"about_ca_topic_score_gemma":0.00066947355,"teacher_disagreement_score":0.004731631,"about_ca_system_score_codex":0.0009930137,"about_ca_system_score_gemma":0.0008374777,"threshold_uncertainty_score":0.02502352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8740211,0.0015598778,0.11375423,0.00017638155,0.00007882563,0.00012241222,0.00045556147,0.00041187057,0.009419787],"genre_scores_gemma":[0.95706284,0.0004066271,0.041226592,0.000027928101,0.000022876877,0.00008132066,0.00042002928,0.00005145025,0.0007001496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981059,0.0006555998,0.00013533892,0.00011002893,0.00085663865,0.00013645037],"domain_scores_gemma":[0.9886348,0.0069075567,0.00081635744,0.00091140065,0.00245436,0.0002755618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022966343,0.0005716425,0.00057555694,0.003522362,0.00041661065,0.0008381503,0.00040993738,0.0003956276,0.00062283716],"category_scores_gemma":[0.01372221,0.00013803806,0.0002772123,0.0032801882,0.0005258532,0.0013192985,0.00063970825,0.00028548445,0.00017751157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027884443,0.000349583,0.032420594,0.00050710584,0.00045010462,0.00033521006,0.0003926708,0.48844728,0.14422444,0.036789954,0.001563605,0.29173103],"study_design_scores_gemma":[0.00010139058,0.002343486,0.027570907,0.000080858284,0.00015453082,0.0010089764,0.00040204581,0.7975228,0.14610635,0.018707337,0.0058573326,0.000143971],"about_ca_topic_score_codex":0.0010439487,"about_ca_topic_score_gemma":0.0014511987,"teacher_disagreement_score":0.003522362,"about_ca_system_score_codex":0.00087707833,"about_ca_system_score_gemma":0.00055437186,"threshold_uncertainty_score":0.0121459365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016450442,0.00017328472,0.97966504,0.00012370571,0.000046785153,0.00005456911,0.00012206273,0.00027194183,0.003092257],"genre_scores_gemma":[0.7676737,0.0010203675,0.21758412,0.00018292252,0.000120734905,0.00046876018,0.0006070675,0.00020597644,0.01213635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992706,0.00024447867,0.00003895089,0.00008778121,0.0002867968,0.00007129596],"domain_scores_gemma":[0.9988399,0.00057286135,0.00010631416,0.00017895909,0.00026058094,0.000041435735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093462144,0.000668783,0.0007735677,0.0005387705,0.0002760513,0.00073102774,0.0017077066,0.001011522,0.001957153],"category_scores_gemma":[0.003444827,0.00040556776,0.00081500784,0.0006498936,0.0004908761,0.0015128973,0.00071350456,0.0014299211,0.0007718362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043806565,0.000015738886,0.000285282,0.000023994975,0.000014454678,0.00006398807,0.00004722785,0.95092064,0.0022093102,0.039520495,0.00040172797,0.0064533153],"study_design_scores_gemma":[0.000004099246,0.00001112616,0.00002505937,0.0000019848233,0.000002849697,0.000013106956,0.0000016962819,0.9963098,0.00035307911,0.0027957188,0.00047721696,0.0000041373264],"about_ca_topic_score_codex":0.0023996022,"about_ca_topic_score_gemma":0.0016532865,"teacher_disagreement_score":0.0023996022,"about_ca_system_score_codex":0.0007660643,"about_ca_system_score_gemma":0.0008478101,"threshold_uncertainty_score":0.006547332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10268975,0.003063156,0.88819283,0.00036142484,0.00017146439,0.00005285166,0.000042247226,0.00024438056,0.0051819584],"genre_scores_gemma":[0.9790547,0.00062360225,0.018979812,0.00005477154,0.00015010944,0.00003097087,0.00003334644,0.000038466238,0.0010343022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775237,0.0004577654,0.0001226539,0.00018763207,0.001149252,0.00033040272],"domain_scores_gemma":[0.99481034,0.003276521,0.0006640127,0.0003167832,0.00064610277,0.00028623614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026996213,0.0008715882,0.00067399844,0.0014085806,0.0006999219,0.00206936,0.0013290416,0.0010112822,0.0008736223],"category_scores_gemma":[0.011604192,0.00030039175,0.0003750283,0.0010791097,0.0014941549,0.0026055735,0.0010251021,0.0014138335,0.00011664184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041721854,0.00009988504,0.003254215,0.00014231933,0.00005488464,0.00032410148,0.00026404753,0.5172272,0.02555125,0.40024954,0.0004987362,0.05191659],"study_design_scores_gemma":[0.000005733881,0.000034139593,0.00041407265,0.000010671432,0.000009369329,0.000065437,0.000015942082,0.9627851,0.0031277477,0.03307615,0.0004392039,0.000016398519],"about_ca_topic_score_codex":0.0017653728,"about_ca_topic_score_gemma":0.0007649966,"teacher_disagreement_score":0.0026996213,"about_ca_system_score_codex":0.0019026181,"about_ca_system_score_gemma":0.0009959717,"threshold_uncertainty_score":0.01427716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026393315,0.0005573504,0.97104275,0.00016712444,0.000049806833,0.00004661433,0.0000465834,0.00021977376,0.0014767906],"genre_scores_gemma":[0.8717052,0.0004232012,0.12569839,0.0001467777,0.000055994013,0.00008648108,0.00008420941,0.00003135057,0.0017684075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984281,0.0006824338,0.00007929104,0.00013166787,0.0005191353,0.0001594198],"domain_scores_gemma":[0.996775,0.0016317037,0.0003859096,0.00043038707,0.0006933616,0.000083608575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022180818,0.00068071455,0.00060258096,0.00042892827,0.0004895871,0.0010789905,0.0008699914,0.00070553296,0.0013053468],"category_scores_gemma":[0.0049054567,0.0003172123,0.00035524857,0.00060230907,0.0013252514,0.001160235,0.001142696,0.0008721286,0.00036691315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004075196,0.000047608875,0.00074411265,0.00014777946,0.00005614524,0.00020766996,0.00014832348,0.783898,0.01320608,0.08555977,0.0019960115,0.11358088],"study_design_scores_gemma":[0.000019612407,0.000073913885,0.000066804874,0.000008401192,0.000007467644,0.00006404222,0.000012670562,0.9884013,0.0033231655,0.0075636557,0.00044320876,0.00001578922],"about_ca_topic_score_codex":0.002122455,"about_ca_topic_score_gemma":0.0027476077,"teacher_disagreement_score":0.0022180818,"about_ca_system_score_codex":0.0008478618,"about_ca_system_score_gemma":0.0016007426,"threshold_uncertainty_score":0.011730492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084950276,0.00027944372,0.90666234,0.0002404959,0.00007206495,0.00010519331,0.0001794847,0.00093261857,0.0065780287],"genre_scores_gemma":[0.42839634,0.00036377925,0.5664622,0.00012003239,0.000025901429,0.0001259786,0.00041911763,0.00011884187,0.0039677327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997528,0.00005813043,0.000014407115,0.000035651254,0.00010142305,0.00003750467],"domain_scores_gemma":[0.99936646,0.0001900971,0.0000622286,0.00022821985,0.00011605949,0.000036993486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031242572,0.0003935152,0.00039930615,0.0004919366,0.00035305502,0.00031277502,0.0005450947,0.0004967464,0.00084756094],"category_scores_gemma":[0.0014939316,0.00016084644,0.00028795094,0.00065516564,0.00057090825,0.0007288373,0.0010343657,0.00088980864,0.00034827623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047059116,0.0001576273,0.002240945,0.00032442049,0.00004797869,0.0006048691,0.00035730645,0.26707637,0.1495878,0.17571397,0.0052796626,0.39813843],"study_design_scores_gemma":[0.00007715913,0.00018516609,0.0006507043,0.00002565265,0.000027380016,0.0006006876,0.000038328963,0.8522188,0.08892177,0.040193737,0.0170085,0.000052041847],"about_ca_topic_score_codex":0.0006397579,"about_ca_topic_score_gemma":0.00078573177,"teacher_disagreement_score":0.00084756094,"about_ca_system_score_codex":0.0002473727,"about_ca_system_score_gemma":0.00048481996,"threshold_uncertainty_score":0.0028353333},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048109693,0.00027116848,0.9935714,0.00011586362,0.000023443616,0.000022151416,0.000029567222,0.00015441979,0.0010010464],"genre_scores_gemma":[0.32049152,0.0010152996,0.6747336,0.0002519438,0.0002524164,0.00021534118,0.00024973022,0.00026318108,0.0025269252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994716,0.001712366,0.00029072395,0.0006537917,0.0024384314,0.0001886577],"domain_scores_gemma":[0.9904268,0.0037922983,0.0012539242,0.0015281409,0.002818893,0.00018000107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004673566,0.0015179457,0.001379687,0.0020919892,0.0006299032,0.0025191694,0.0018551913,0.0018543873,0.001061451],"category_scores_gemma":[0.01763449,0.00068594527,0.0005640306,0.0010224592,0.0020598941,0.005171861,0.0026485098,0.002279621,0.0012579359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023151725,0.00018681478,0.0027209672,0.00065317913,0.00015380835,0.0003114053,0.00038401826,0.33072498,0.15013088,0.32178864,0.0027295703,0.18998414],"study_design_scores_gemma":[0.0000107680835,0.00019336477,0.00051856326,0.00006872274,0.000020775567,0.00023505023,0.000057486566,0.8978331,0.041557018,0.05450289,0.0049156076,0.00008662681],"about_ca_topic_score_codex":0.0006150784,"about_ca_topic_score_gemma":0.0004245773,"teacher_disagreement_score":0.004673566,"about_ca_system_score_codex":0.0013031842,"about_ca_system_score_gemma":0.0011224321,"threshold_uncertainty_score":0.024716496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026008753,0.00025415333,0.9707521,0.00008843796,0.0000675611,0.00012630312,0.000040641848,0.00019006272,0.0024720544],"genre_scores_gemma":[0.23179674,0.00049146835,0.7649574,0.000084235704,0.00006114367,0.00028100642,0.00011046302,0.000047551843,0.0021700095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995129,0.00021724052,0.00003910193,0.00005351649,0.00014519073,0.00003201314],"domain_scores_gemma":[0.99901307,0.00038526344,0.00020442404,0.00014403054,0.00021074507,0.0000423963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243932,0.0005402989,0.0003152574,0.00042578494,0.00032478495,0.0004298093,0.00031251926,0.00035820913,0.0011994547],"category_scores_gemma":[0.0014540885,0.00024945196,0.0002931584,0.00040012464,0.0003572963,0.0004893316,0.00031944623,0.000449935,0.0007417151],"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.00059649936,0.0001531525,0.0018399099,0.0005998377,0.0001627392,0.00061079545,0.00029672516,0.1412433,0.2501464,0.098646216,0.0023818482,0.5033226],"study_design_scores_gemma":[0.00027963184,0.0013912307,0.0012788306,0.00013456914,0.00012764733,0.0020817874,0.00009694297,0.6858781,0.22261584,0.05177355,0.034207538,0.00013436806],"about_ca_topic_score_codex":0.00038582354,"about_ca_topic_score_gemma":0.00096985354,"teacher_disagreement_score":0.0011994547,"about_ca_system_score_codex":0.0002190505,"about_ca_system_score_gemma":0.0007012696,"threshold_uncertainty_score":0.0040125847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019684024,0.00027933175,0.97595596,0.0002530148,0.00013318735,0.00013159573,0.000043496435,0.00036409273,0.0031553206],"genre_scores_gemma":[0.6269519,0.00037024514,0.36793593,0.00019676515,0.000154485,0.00031735047,0.00021439673,0.00005326943,0.0038056497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948776,0.00014167943,0.00002919736,0.00008119053,0.00019500124,0.000065074746],"domain_scores_gemma":[0.99937576,0.00023448815,0.00007128469,0.000096729775,0.0001754489,0.00004630857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073451444,0.00040643665,0.00053958734,0.0006521182,0.0011165651,0.00056873605,0.0011340864,0.0006372086,0.0012581635],"category_scores_gemma":[0.0021549875,0.00013561244,0.0003407828,0.00062685553,0.000427213,0.0011454304,0.00088543154,0.0007582974,0.0003307702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049171323,0.00022629133,0.0020683547,0.0001805565,0.00009830777,0.00023916381,0.000587223,0.28325757,0.019816259,0.14518195,0.010518677,0.53733385],"study_design_scores_gemma":[0.000063135085,0.000096428645,0.00021187078,0.000009973238,0.000023825487,0.000091265814,0.00006968724,0.95849127,0.0039652325,0.026366107,0.0105962325,0.000014897285],"about_ca_topic_score_codex":0.0021798748,"about_ca_topic_score_gemma":0.0024574634,"teacher_disagreement_score":0.0021798748,"about_ca_system_score_codex":0.00089675095,"about_ca_system_score_gemma":0.00083595724,"threshold_uncertainty_score":0.006506443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062474728,0.0017886878,0.92123,0.00058170786,0.00007464873,0.000048127535,0.00018557356,0.00032193292,0.013294554],"genre_scores_gemma":[0.9341331,0.0022446446,0.05785586,0.0002371793,0.00027875614,0.00024373323,0.0003761891,0.00016387601,0.004466634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.0007012848,0.0000775351,0.00015073377,0.0010575161,0.0002980444],"domain_scores_gemma":[0.98711085,0.008796075,0.0009527211,0.0009636022,0.0019494112,0.00022741954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025780727,0.001190872,0.0009518815,0.0015068464,0.00057097134,0.0013020824,0.0012330561,0.0011895399,0.0026750267],"category_scores_gemma":[0.026137467,0.00048090424,0.00073077774,0.00157171,0.0022262428,0.0023982113,0.0020872562,0.0017700882,0.0005845655],"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.00006643234,0.000025358067,0.0010245068,0.00015119331,0.00004971411,0.00031113593,0.00019330232,0.6430045,0.002982702,0.3350129,0.0013094421,0.015868835],"study_design_scores_gemma":[0.0000067327483,0.000020187357,0.00033597017,0.00003380201,0.000010032243,0.0001564482,0.000030572828,0.90113443,0.0007490438,0.0969434,0.00056123204,0.000018201043],"about_ca_topic_score_codex":0.0026010678,"about_ca_topic_score_gemma":0.0019771042,"teacher_disagreement_score":0.0026750267,"about_ca_system_score_codex":0.0022874908,"about_ca_system_score_gemma":0.0015683583,"threshold_uncertainty_score":0.016596973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1353474,0.0013954032,0.84319085,0.0005178432,0.00019421805,0.00010344632,0.00043127371,0.00078335364,0.018036105],"genre_scores_gemma":[0.8507413,0.00067713024,0.13991722,0.000120045836,0.000113314025,0.000096265634,0.00031278146,0.000041210937,0.007980736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.00016182112,0.00003232212,0.00007570132,0.00033828823,0.00010282034],"domain_scores_gemma":[0.9991499,0.00025962008,0.00013152928,0.00015301204,0.00026635508,0.000039579238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039526363,0.00058667787,0.00046349366,0.00038836923,0.0003490033,0.00071087835,0.00044698743,0.0006022752,0.0011128448],"category_scores_gemma":[0.0012998106,0.0002509364,0.00031906058,0.0007645885,0.0006377447,0.0006137295,0.00059925223,0.0004835252,0.0005868493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038645623,0.000037229962,0.0008625772,0.00017284595,0.000049371523,0.00097146054,0.00017511021,0.72735876,0.058959305,0.15931042,0.002483089,0.049233444],"study_design_scores_gemma":[0.000028536004,0.000108412816,0.00036956358,0.00002515689,0.00002283799,0.0003455009,0.00001425952,0.95242393,0.021951206,0.020333614,0.0043384465,0.000038545157],"about_ca_topic_score_codex":0.002990316,"about_ca_topic_score_gemma":0.004275118,"teacher_disagreement_score":0.002990316,"about_ca_system_score_codex":0.00091824954,"about_ca_system_score_gemma":0.0012000696,"threshold_uncertainty_score":0.0066624284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10499102,0.0033163368,0.8338584,0.00075821375,0.00010092485,0.000056269706,0.00013094557,0.00032764487,0.05646026],"genre_scores_gemma":[0.96404994,0.0013212785,0.032423846,0.00017728003,0.00013603775,0.00005080379,0.000029762115,0.000031568565,0.0017794259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915814,0.00026551422,0.000031309504,0.00010031871,0.00031567,0.00012907913],"domain_scores_gemma":[0.9975533,0.0017013779,0.00021065096,0.00022861519,0.00023092609,0.00007525461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014059164,0.00078008045,0.0005865364,0.00060369156,0.0005797507,0.0015246695,0.00068491214,0.0007868123,0.0018699764],"category_scores_gemma":[0.005874326,0.00025996548,0.00027910926,0.00071238185,0.0011282057,0.0019439083,0.0015287182,0.0011468164,0.00046381826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000180772,0.000064193504,0.0015320071,0.0003066978,0.000047214253,0.0006812252,0.00026471322,0.18934461,0.03907743,0.6813315,0.0015788785,0.08559081],"study_design_scores_gemma":[0.000018420325,0.0001635569,0.0006967595,0.000078020414,0.00002909255,0.0015324843,0.0000798269,0.65393615,0.012569314,0.3274042,0.0034416327,0.0000504568],"about_ca_topic_score_codex":0.0002282541,"about_ca_topic_score_gemma":0.0002686398,"teacher_disagreement_score":0.0018699764,"about_ca_system_score_codex":0.0007632265,"about_ca_system_score_gemma":0.00041880083,"threshold_uncertainty_score":0.007435262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017270332,0.005305276,0.957996,0.0009519582,0.00032184017,0.00008862328,0.00034917868,0.00033536306,0.017381268],"genre_scores_gemma":[0.65294164,0.008865577,0.32274356,0.0017056853,0.0010750105,0.000672445,0.0007988461,0.0003152952,0.010881939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904951,0.0035789697,0.00052521826,0.0010507482,0.0030899954,0.0012600683],"domain_scores_gemma":[0.9542417,0.03216664,0.0035396959,0.0037253206,0.0055119502,0.0008147012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013306491,0.0031720116,0.0016573524,0.0029588172,0.0016886105,0.0025013385,0.0030398562,0.0018341804,0.007652842],"category_scores_gemma":[0.06622481,0.0010981163,0.0011766797,0.0020566941,0.004002711,0.006285573,0.0046755187,0.004035716,0.0021628828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005140321,0.000063949905,0.002554044,0.0006361072,0.0001332293,0.0003810048,0.0004614566,0.1567236,0.008853716,0.7398087,0.00555366,0.08431656],"study_design_scores_gemma":[0.000058247475,0.00038066108,0.0019043232,0.0003839008,0.00009108731,0.00073049153,0.00010369959,0.40614203,0.015371858,0.5616209,0.012973105,0.00023970724],"about_ca_topic_score_codex":0.0012990774,"about_ca_topic_score_gemma":0.0018267218,"teacher_disagreement_score":0.013306491,"about_ca_system_score_codex":0.003996406,"about_ca_system_score_gemma":0.0021335972,"threshold_uncertainty_score":0.070372224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045226462,0.00030980687,0.94821215,0.000115170624,0.000041414198,0.00008138255,0.000067819834,0.00020711089,0.0057387324],"genre_scores_gemma":[0.5047185,0.000753061,0.4908448,0.00011421908,0.000065058164,0.00021226713,0.00025202066,0.00010167065,0.0029384901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.00015943739,0.000022205726,0.000057677196,0.0002232799,0.00006544995],"domain_scores_gemma":[0.999363,0.00023560257,0.00007862482,0.0001828441,0.00010137035,0.000038542905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729816,0.00040382554,0.0003595066,0.0006883948,0.00055377214,0.0006175705,0.0005928077,0.0004601815,0.00086476514],"category_scores_gemma":[0.0019809362,0.0002791609,0.0004982385,0.00044033566,0.0009222395,0.00064369175,0.0011333681,0.0008709954,0.00044682084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010286753,0.000043679647,0.0007507018,0.00016455799,0.000016042999,0.00043645132,0.0002912903,0.06959845,0.03285781,0.84340364,0.00085835793,0.05147619],"study_design_scores_gemma":[0.000082256665,0.00030405392,0.00049221184,0.00010340613,0.000033246015,0.0008384608,0.00008101591,0.5149485,0.07756577,0.38150015,0.023962565,0.00008836684],"about_ca_topic_score_codex":0.00032144084,"about_ca_topic_score_gemma":0.00025961874,"teacher_disagreement_score":0.0008729816,"about_ca_system_score_codex":0.0003744317,"about_ca_system_score_gemma":0.00063419377,"threshold_uncertainty_score":0.0046168566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08007998,0.0016596834,0.912293,0.00047135822,0.00010028706,0.00004171431,0.000027721811,0.000058660888,0.0052676387],"genre_scores_gemma":[0.96936965,0.000801285,0.027913049,0.00008001246,0.00009628812,0.0000458339,0.000010196249,0.000016073567,0.0016676706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993211,0.00030021786,0.00001864592,0.00006765517,0.00015015209,0.00014225974],"domain_scores_gemma":[0.99859136,0.0010340427,0.00016530849,0.000047233036,0.00011315218,0.0000487852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013503728,0.00054340856,0.0006548436,0.00031396735,0.0003743548,0.0011134461,0.000867213,0.00063389464,0.0010612134],"category_scores_gemma":[0.004185021,0.00024049355,0.00028318027,0.00057985925,0.0009236465,0.0009339009,0.000668166,0.00047147676,0.00012184487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012137498,0.000072562136,0.00046991734,0.0001240583,0.00004091894,0.00022745288,0.000086418295,0.9275417,0.003222735,0.04779428,0.00092561904,0.019372892],"study_design_scores_gemma":[0.000012104056,0.000025700718,0.00009114763,0.0000030992985,0.000006709307,0.000029460678,0.000016897946,0.993393,0.00028105476,0.0059522884,0.00018424606,0.000004380952],"about_ca_topic_score_codex":0.0029517077,"about_ca_topic_score_gemma":0.0023365016,"teacher_disagreement_score":0.0029517077,"about_ca_system_score_codex":0.0007671582,"about_ca_system_score_gemma":0.0009538075,"threshold_uncertainty_score":0.0071415305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008482111,0.0002064751,0.98914075,0.00006256126,0.00003765484,0.000029532126,0.000006798085,0.00022567321,0.0018083988],"genre_scores_gemma":[0.76365894,0.00038744602,0.23238185,0.00015008659,0.00017663215,0.00016333873,0.000035966885,0.00008253262,0.0029631723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.00014770306,0.000032850003,0.00016713883,0.00019687253,0.00005682059],"domain_scores_gemma":[0.99940574,0.0002823474,0.000089582885,0.000072257535,0.00012044054,0.000029582547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066837325,0.0006256251,0.00052701455,0.0004980889,0.0004936612,0.00069050526,0.0010327947,0.0004143987,0.0007202578],"category_scores_gemma":[0.0019386034,0.00021050498,0.00025023663,0.000485388,0.00077904825,0.0010481536,0.0007457656,0.00070627464,0.00022186314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023615386,0.00019185466,0.0007210083,0.00022345554,0.00006071982,0.00019956824,0.00035554095,0.4029668,0.06457421,0.11013159,0.0042291014,0.41611],"study_design_scores_gemma":[0.000029827283,0.00013132743,0.00016627485,0.0000069095518,0.000011504126,0.0000898813,0.000013041838,0.9801691,0.0064287763,0.010758682,0.002179958,0.000014579251],"about_ca_topic_score_codex":0.00046924615,"about_ca_topic_score_gemma":0.0005604521,"teacher_disagreement_score":0.0010327947,"about_ca_system_score_codex":0.0003396416,"about_ca_system_score_gemma":0.00045213048,"threshold_uncertainty_score":0.0035347342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86640126,0.0038817,0.109439574,0.000732378,0.00007610796,0.00003195721,0.000428827,0.00042082724,0.018587386],"genre_scores_gemma":[0.99791473,0.0002867586,0.0012640774,0.000016497945,0.000021556114,0.000006618089,0.000050299892,0.000009159959,0.00043023494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991917,0.00028974228,0.000029508143,0.00006591517,0.0002561145,0.00016699162],"domain_scores_gemma":[0.9934756,0.005077751,0.00045972833,0.00025298976,0.00057744107,0.00015648086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019247623,0.0006399918,0.00080650154,0.00065160537,0.00053374626,0.0007674167,0.000491133,0.00088240625,0.001125066],"category_scores_gemma":[0.0075520035,0.0003605847,0.00030979427,0.0008470583,0.0011028685,0.00081962196,0.0008426098,0.000497073,0.00023609394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004590407,0.000030600186,0.005357218,0.00015753364,0.000054876695,0.00070603896,0.00017237882,0.96536547,0.0033599325,0.011143723,0.0009132602,0.012279888],"study_design_scores_gemma":[0.000013730164,0.000094446215,0.003560641,0.000023254182,0.000037255068,0.0003669683,0.00008769394,0.9892266,0.0014034738,0.004927603,0.00023967252,0.000018617135],"about_ca_topic_score_codex":0.0040737903,"about_ca_topic_score_gemma":0.003203898,"teacher_disagreement_score":0.0040737903,"about_ca_system_score_codex":0.0015328258,"about_ca_system_score_gemma":0.0006068537,"threshold_uncertainty_score":0.011121452},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440658,0.00032840384,0.050235894,0.00010558413,0.00001594129,0.000015760015,0.00005277769,0.00041164446,0.004768197],"genre_scores_gemma":[0.99537414,0.00006744916,0.0041530062,0.000017158733,0.000004642055,0.000008297643,0.00002767224,0.000024950481,0.0003227587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995522,0.000106432,0.000012068822,0.000032648375,0.00021993762,0.00007667062],"domain_scores_gemma":[0.99647176,0.0020621307,0.0003707291,0.00025811084,0.0007179708,0.00011932199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252037,0.00048016422,0.0003238555,0.00042881872,0.000294637,0.0004531425,0.00038451873,0.00046806567,0.00071239274],"category_scores_gemma":[0.0036085376,0.00013808504,0.00018460494,0.000320378,0.00058363774,0.0004109124,0.0003199229,0.0003389271,0.00032316032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016736301,0.0001350741,0.0070462967,0.00025901524,0.00010805484,0.00039401863,0.0004516701,0.543618,0.38803896,0.024920048,0.0007960823,0.032559056],"study_design_scores_gemma":[0.000038762144,0.00031914882,0.001172583,0.000024834093,0.000026925525,0.00012952223,0.000027571641,0.8678672,0.12710713,0.0027737904,0.00047284598,0.000039585208],"about_ca_topic_score_codex":0.0014266825,"about_ca_topic_score_gemma":0.0010125089,"teacher_disagreement_score":0.0014266825,"about_ca_system_score_codex":0.00046895078,"about_ca_system_score_gemma":0.0003901727,"threshold_uncertainty_score":0.0034025311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92515635,0.0003363861,0.06909783,0.00007592208,0.000013133474,0.000012704209,0.0000758633,0.00019434547,0.0050374735],"genre_scores_gemma":[0.99298865,0.00011289891,0.0060164244,0.000010212506,0.0000058913433,0.000008871967,0.00005315358,0.000017571689,0.0007863123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918705,0.00014906167,0.000041015854,0.00007852983,0.0004116502,0.00013276013],"domain_scores_gemma":[0.9958125,0.0023081382,0.00064584264,0.00045459604,0.0007021729,0.000076647266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146089,0.00049825676,0.00036748932,0.0006435341,0.0003115952,0.0007402449,0.000530959,0.00066005386,0.0006373686],"category_scores_gemma":[0.004477463,0.00014383106,0.00020842411,0.0004935001,0.0008186709,0.00077523885,0.0006317297,0.00035737193,0.0002005103],"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.0014976407,0.00013470779,0.008680373,0.0001708421,0.00009810711,0.00036759744,0.00035810776,0.64300114,0.203016,0.083582856,0.0005264461,0.058566183],"study_design_scores_gemma":[0.000010127529,0.00015691204,0.000947424,0.000010914666,0.000012804044,0.00009702879,0.00001609848,0.9110068,0.08434634,0.003118544,0.00025283956,0.000024195371],"about_ca_topic_score_codex":0.0011574388,"about_ca_topic_score_gemma":0.0010746814,"teacher_disagreement_score":0.0011574388,"about_ca_system_score_codex":0.00070147216,"about_ca_system_score_gemma":0.00051320967,"threshold_uncertainty_score":0.005089581},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13926284,0.0033509,0.8247712,0.0023730085,0.00015278811,0.000048846407,0.00046691092,0.00087608816,0.028697344],"genre_scores_gemma":[0.983083,0.0014509325,0.012523642,0.00027490765,0.0003013166,0.00006787519,0.0001555965,0.000098981945,0.002043871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962877,0.0011284642,0.00015394819,0.0003717999,0.0014278478,0.00063032313],"domain_scores_gemma":[0.98069465,0.015322168,0.0013827352,0.0012481242,0.0010783067,0.00027389842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977769,0.0012610729,0.0015749638,0.0009918478,0.000974905,0.0022434015,0.0012668576,0.0017588974,0.0017267287],"category_scores_gemma":[0.023806676,0.00077157846,0.0005357351,0.0017934948,0.0035054819,0.0033975597,0.0024171718,0.0021783859,0.00058820663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037147076,0.00009758762,0.002530418,0.00035989902,0.000066831046,0.001097663,0.00079558167,0.6756257,0.007977698,0.27249417,0.0050647063,0.03351829],"study_design_scores_gemma":[0.000050270348,0.000097923665,0.0012023086,0.00007600853,0.0000534193,0.00069369405,0.00015571683,0.7724955,0.003951242,0.21931978,0.0018428718,0.00006129402],"about_ca_topic_score_codex":0.0014848639,"about_ca_topic_score_gemma":0.0008172305,"teacher_disagreement_score":0.003977769,"about_ca_system_score_codex":0.0020571249,"about_ca_system_score_gemma":0.0010528227,"threshold_uncertainty_score":0.021036744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017983042,0.0006034986,0.9594835,0.0004736707,0.00006174576,0.000031947646,0.00012793629,0.00016493387,0.021069631],"genre_scores_gemma":[0.8714581,0.0018575515,0.08039462,0.0004204774,0.00017260366,0.00032825448,0.00043913952,0.00023985477,0.044689476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997009,0.000096107455,0.000006187864,0.00006300314,0.00007557515,0.00005828778],"domain_scores_gemma":[0.9996859,0.0001603614,0.000035886856,0.000022610171,0.00006667025,0.000028724357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005819078,0.00090240064,0.00075806846,0.00043539645,0.00034123485,0.0009841021,0.0011636968,0.0009799537,0.0071296874],"category_scores_gemma":[0.001119991,0.00032100262,0.00058585004,0.0005321966,0.00082259916,0.0023926867,0.001062153,0.0013525075,0.00070606195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019603154,0.000011893963,0.00013298249,0.000033855424,0.000011088941,0.0000906944,0.000042693722,0.847416,0.0007263656,0.1433363,0.0019840654,0.0061944607],"study_design_scores_gemma":[0.000005302794,0.000012982192,0.000038061455,0.000004585808,0.000003963217,0.000022083304,0.000013366817,0.9736442,0.000098531076,0.024232468,0.001920576,0.000003848432],"about_ca_topic_score_codex":0.0031152882,"about_ca_topic_score_gemma":0.0028552888,"teacher_disagreement_score":0.0071296874,"about_ca_system_score_codex":0.00093301816,"about_ca_system_score_gemma":0.0006077517,"threshold_uncertainty_score":0.023851216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34569007,0.0026987682,0.6334246,0.0010738875,0.000099024306,0.00006306511,0.0003134768,0.0007602094,0.015876891],"genre_scores_gemma":[0.9789974,0.0011115567,0.01739492,0.0001258762,0.000078879784,0.000050756054,0.000134892,0.00006129225,0.0020444626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964244,0.0012276295,0.00013315177,0.00021392675,0.0015069415,0.00049388263],"domain_scores_gemma":[0.9729971,0.022098146,0.0020228287,0.0011893172,0.0014748747,0.00021766793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411751,0.0010853631,0.001206507,0.0011443824,0.0004949633,0.0015004377,0.0009979388,0.0013182949,0.0017675002],"category_scores_gemma":[0.024883261,0.00049594755,0.00052215834,0.0010525169,0.002593275,0.0017633958,0.0014375034,0.0009071027,0.0003419619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007117675,0.00005428235,0.003641201,0.0002214871,0.000111110676,0.000575474,0.00035046402,0.85561514,0.0069291033,0.0943803,0.0009976391,0.03641205],"study_design_scores_gemma":[0.00004061446,0.00014484274,0.0025151419,0.000059400045,0.000084566636,0.00062334863,0.000091941736,0.943276,0.007889013,0.044551555,0.0006600912,0.00006352574],"about_ca_topic_score_codex":0.001386841,"about_ca_topic_score_gemma":0.0011485601,"teacher_disagreement_score":0.005411751,"about_ca_system_score_codex":0.001572648,"about_ca_system_score_gemma":0.0011375909,"threshold_uncertainty_score":0.028620362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043534935,0.0002578876,0.99405587,0.00006692819,0.000061774845,0.000052159576,0.0000078915855,0.0005304715,0.00061338407],"genre_scores_gemma":[0.19532587,0.0005186557,0.8007685,0.00014357101,0.00022429934,0.00019193576,0.00007429283,0.00017164169,0.0025813237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992823,0.00016565323,0.000055118748,0.00012108519,0.00031388574,0.0000619654],"domain_scores_gemma":[0.99856204,0.0006611232,0.00013963241,0.00016756816,0.0004083341,0.00006136714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258143,0.0006791147,0.00067552924,0.0008055722,0.0006243132,0.0008972184,0.0016111733,0.00079717115,0.0010547768],"category_scores_gemma":[0.005233792,0.00034226425,0.00030091114,0.0005164662,0.00047974332,0.0018576655,0.00073712255,0.0015913782,0.000589434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042098216,0.00020112198,0.0011609909,0.0001477575,0.000082573984,0.00016058837,0.00035996563,0.14001182,0.04965958,0.039404377,0.004371187,0.7640191],"study_design_scores_gemma":[0.0000787746,0.00012739445,0.00022916902,0.000020032245,0.000035064728,0.0002293715,0.00002146778,0.97047395,0.013308025,0.009044914,0.006391785,0.000040108625],"about_ca_topic_score_codex":0.001091043,"about_ca_topic_score_gemma":0.0008322456,"teacher_disagreement_score":0.0019258143,"about_ca_system_score_codex":0.000618806,"about_ca_system_score_gemma":0.0005629725,"threshold_uncertainty_score":0.010184765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21731651,0.0036830425,0.7487346,0.001039959,0.00019795689,0.0000677544,0.00020851703,0.00019558272,0.028556062],"genre_scores_gemma":[0.9748497,0.002569566,0.017244186,0.00017906746,0.0002042442,0.00007677411,0.000069787115,0.000035471203,0.004771186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831957,0.0007075274,0.000025324653,0.0001445792,0.00035036838,0.0004525315],"domain_scores_gemma":[0.997038,0.001964524,0.0003796788,0.00013911397,0.000378926,0.000099850695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573393,0.0015406192,0.0014142656,0.0009512854,0.0007921676,0.0012038981,0.00082399475,0.0012583236,0.0010374577],"category_scores_gemma":[0.0037176087,0.0004842761,0.0005558618,0.0014587117,0.0029543345,0.0017154205,0.0014754001,0.0011452324,0.0003808311],"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.00013691418,0.000031668675,0.0006326998,0.00010515511,0.00002944535,0.0006029564,0.00014507212,0.8933009,0.0032373997,0.097226255,0.0006755829,0.003875944],"study_design_scores_gemma":[0.000019089632,0.000045385306,0.00020263418,0.000016557166,0.000016318078,0.00012676933,0.000047367572,0.9789766,0.0006859702,0.019326396,0.0005139559,0.000022980423],"about_ca_topic_score_codex":0.005408644,"about_ca_topic_score_gemma":0.002950602,"teacher_disagreement_score":0.005408644,"about_ca_system_score_codex":0.0014546522,"about_ca_system_score_gemma":0.00093719363,"threshold_uncertainty_score":0.010754347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96636724,0.00079949363,0.02402175,0.00016882198,0.0000621181,0.00003331462,0.00007497419,0.0006571145,0.007815214],"genre_scores_gemma":[0.99327976,0.00013297633,0.0052576195,0.000032376363,0.00002376285,0.000012275094,0.00006446287,0.000015019322,0.001181675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00017458915,0.000016626202,0.000061884566,0.0001853923,0.00009029364],"domain_scores_gemma":[0.99855465,0.0007179698,0.00007770655,0.00008451506,0.0005038582,0.000061190025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702678,0.00019267744,0.00026702593,0.0006478569,0.0003045108,0.00063741935,0.00025702064,0.00037459985,0.0013467163],"category_scores_gemma":[0.0021736356,0.00006887405,0.00007917164,0.000497054,0.00021240723,0.000417312,0.00022516094,0.00013653848,0.0002592116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010189091,0.0006778639,0.03467025,0.00057048665,0.00027385016,0.00049315975,0.00067079574,0.14202036,0.26226568,0.0120231705,0.0041773436,0.53196794],"study_design_scores_gemma":[0.0003235332,0.0037371072,0.020731268,0.000045150802,0.00029388472,0.00074205705,0.0003006968,0.7922114,0.17103423,0.0024292613,0.008067818,0.00008360886],"about_ca_topic_score_codex":0.0019427355,"about_ca_topic_score_gemma":0.0019692734,"teacher_disagreement_score":0.0019427355,"about_ca_system_score_codex":0.00062953687,"about_ca_system_score_gemma":0.00039062582,"threshold_uncertainty_score":0.0045676827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007331178,0.00038519426,0.9881832,0.0003471867,0.00026851433,0.00009487235,0.00003145332,0.0007228367,0.002635475],"genre_scores_gemma":[0.55043054,0.00076477695,0.4398505,0.00056951295,0.00071208616,0.00034641149,0.00013589638,0.0001576935,0.0070326333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984332,0.00022463307,0.00008596104,0.00022297658,0.00089081825,0.0001424926],"domain_scores_gemma":[0.99925,0.00025207674,0.00007851239,0.00010717074,0.00023892132,0.00007330131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145927,0.0005812675,0.00074688264,0.00069862674,0.00067320914,0.0017280082,0.002697006,0.0010887437,0.0015183375],"category_scores_gemma":[0.002156013,0.0003331136,0.0005233884,0.0005838953,0.0009464686,0.0018970303,0.0012102246,0.002500632,0.00032698273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021121303,0.00036215282,0.0005442985,0.0002582459,0.000112244816,0.00027598863,0.00022500478,0.42138407,0.06855293,0.22997935,0.0061775735,0.27191696],"study_design_scores_gemma":[0.000026722375,0.000032674747,0.000057971833,0.000007473431,0.000013462995,0.000049440358,0.0000060621624,0.9826177,0.004797576,0.008523379,0.0038458502,0.000021694721],"about_ca_topic_score_codex":0.0018156059,"about_ca_topic_score_gemma":0.0013550977,"teacher_disagreement_score":0.002697006,"about_ca_system_score_codex":0.0013623948,"about_ca_system_score_gemma":0.0015084629,"threshold_uncertainty_score":0.0098849535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033738747,0.0037156274,0.93774635,0.0006840819,0.000118296484,0.00008165762,0.0004154853,0.0007537816,0.02274591],"genre_scores_gemma":[0.8121341,0.0069006863,0.16362248,0.00059859274,0.00027578484,0.0003025359,0.0007927767,0.00041808642,0.014954947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721897,0.0008705071,0.00008658444,0.00020962421,0.0012681624,0.0003461393],"domain_scores_gemma":[0.98969156,0.0068919077,0.0007522109,0.00067074876,0.0019163258,0.000077160934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030524384,0.0017492615,0.0014491444,0.0013603994,0.00065987144,0.0016762471,0.00095823436,0.0011123085,0.0050435835],"category_scores_gemma":[0.0149117345,0.0005309246,0.00057283754,0.0017750603,0.0014876674,0.0026461517,0.0013675224,0.0013074415,0.0020780365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016170637,0.00006315252,0.0010748574,0.00035771757,0.00007741978,0.00020613501,0.00023528586,0.8629623,0.008526839,0.085986085,0.0042082393,0.036140256],"study_design_scores_gemma":[0.000009618884,0.000043808515,0.00045820363,0.000060262395,0.000025231046,0.0001905403,0.000050587925,0.9740094,0.0024798359,0.021179326,0.001468385,0.000024852929],"about_ca_topic_score_codex":0.0033715055,"about_ca_topic_score_gemma":0.0043873014,"teacher_disagreement_score":0.0050435835,"about_ca_system_score_codex":0.0024128396,"about_ca_system_score_gemma":0.0015714347,"threshold_uncertainty_score":0.01750648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65013087,0.0016606983,0.31889644,0.0012674922,0.00005925054,0.000038640384,0.0004982449,0.00066577,0.026782515],"genre_scores_gemma":[0.99619126,0.00025638955,0.0026372573,0.000058390222,0.000019175284,0.000016160704,0.00008037222,0.000020962225,0.00072014175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.00051112485,0.00004687231,0.00013262192,0.00040433113,0.0002841159],"domain_scores_gemma":[0.98596245,0.011416461,0.0009825479,0.0006378494,0.00074722926,0.00025345292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804728,0.00044437507,0.0008240608,0.000612714,0.0005378046,0.00091425644,0.0006494636,0.0009602183,0.0017656023],"category_scores_gemma":[0.015123809,0.0002702562,0.00031447125,0.00078646594,0.0026853203,0.0013715992,0.0010543328,0.0008832041,0.00033367428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049947936,0.000059573114,0.009407386,0.00015531413,0.00005018943,0.0007330579,0.00050737936,0.8728677,0.0057450975,0.09788826,0.0017517572,0.010334796],"study_design_scores_gemma":[0.00004787748,0.000113369286,0.0054152817,0.00005904912,0.00003776211,0.0007682316,0.00022099595,0.94512635,0.0049874303,0.042341083,0.0008302295,0.00005238112],"about_ca_topic_score_codex":0.0019025799,"about_ca_topic_score_gemma":0.0009042275,"teacher_disagreement_score":0.002804728,"about_ca_system_score_codex":0.0010577041,"about_ca_system_score_gemma":0.0007900948,"threshold_uncertainty_score":0.0148329735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35375094,0.0035417795,0.62984884,0.00020554622,0.00009022029,0.000042493266,0.0003882799,0.0007716741,0.01136026],"genre_scores_gemma":[0.97912574,0.0010997109,0.017932268,0.00002814049,0.00003518964,0.00002158341,0.00013774083,0.000059315422,0.0015603176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988637,0.00023561559,0.000044191762,0.00010461851,0.000592646,0.00015927078],"domain_scores_gemma":[0.9966304,0.0020674174,0.00029499424,0.00040709245,0.0005529054,0.000047199122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420061,0.0011118572,0.0011814906,0.0010197569,0.00046691063,0.0008279825,0.0005759894,0.0008455004,0.0017918079],"category_scores_gemma":[0.0045974692,0.0003725409,0.0005538775,0.0007687064,0.0009099516,0.0010222236,0.000831609,0.0008088779,0.0006121125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006450101,0.00004150021,0.0028284932,0.00037539564,0.00012226637,0.00073322264,0.0002586136,0.8306209,0.10867174,0.030437768,0.0005959023,0.024669273],"study_design_scores_gemma":[0.000009096536,0.0001364463,0.0032469055,0.000021824662,0.00004174084,0.00043835296,0.000037378122,0.96641046,0.02489242,0.004261289,0.0004566547,0.00004741057],"about_ca_topic_score_codex":0.001283182,"about_ca_topic_score_gemma":0.0010698655,"teacher_disagreement_score":0.0017918079,"about_ca_system_score_codex":0.0008122165,"about_ca_system_score_gemma":0.00038402822,"threshold_uncertainty_score":0.0060396194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014083679,0.0013499516,0.993919,0.00013789802,0.00009959513,0.00002623105,0.00015950279,0.00059881865,0.002300579],"genre_scores_gemma":[0.18373331,0.005251367,0.79994386,0.00047109262,0.00062388653,0.0006177487,0.0010198319,0.0008359072,0.0075030923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959222,0.0010751938,0.00026780923,0.0004878702,0.0020160885,0.00023084927],"domain_scores_gemma":[0.9813525,0.013193392,0.0009850311,0.001820721,0.0024681278,0.0001802104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038630571,0.0018640014,0.0012172603,0.0027255723,0.00064721046,0.0028166536,0.0016502527,0.0015629467,0.0073257214],"category_scores_gemma":[0.04658754,0.0010050151,0.0009615215,0.002090602,0.001395513,0.002303529,0.002496863,0.0033237291,0.0048035826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003379594,0.00013346269,0.0008787377,0.0009802667,0.00013473257,0.00017969268,0.00032610248,0.4325394,0.02314596,0.18610713,0.009937798,0.3452987],"study_design_scores_gemma":[0.000031481053,0.000090981805,0.00071344257,0.00031739994,0.00004606373,0.0003503497,0.00006701664,0.89995456,0.014138187,0.07152778,0.012677716,0.000084903084],"about_ca_topic_score_codex":0.0021994484,"about_ca_topic_score_gemma":0.003171416,"teacher_disagreement_score":0.0073257214,"about_ca_system_score_codex":0.0014945428,"about_ca_system_score_gemma":0.0018120308,"threshold_uncertainty_score":0.024506927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008231333,0.0004955892,0.98772776,0.00013114685,0.000056216955,0.000032376967,0.000106258136,0.00035799385,0.0028613696],"genre_scores_gemma":[0.6148041,0.0045499294,0.35689095,0.000826517,0.00038762888,0.00048636875,0.0011776945,0.0007009737,0.020175908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975611,0.00081455556,0.00010878113,0.0003325482,0.0008418859,0.00034101534],"domain_scores_gemma":[0.99398345,0.0033336766,0.0005288381,0.0008388966,0.0011520131,0.00016313758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029533852,0.0017490634,0.0013434957,0.001987171,0.00076178956,0.0018902429,0.0032375262,0.0016020797,0.003906059],"category_scores_gemma":[0.013774725,0.0007803906,0.0016092453,0.002867681,0.001577281,0.00538315,0.0015655712,0.0032792185,0.0024212017],"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.00022054084,0.00007783383,0.0024815272,0.00013725254,0.00009160341,0.0003673487,0.00028608696,0.78877825,0.0019565278,0.15948164,0.0033403155,0.04278096],"study_design_scores_gemma":[0.0000065221425,0.000013401891,0.00020790967,0.0000148841245,0.000013269562,0.00012330088,0.00003047429,0.97165626,0.00043266377,0.026166808,0.00131653,0.0000179667],"about_ca_topic_score_codex":0.006813547,"about_ca_topic_score_gemma":0.005893222,"teacher_disagreement_score":0.006813547,"about_ca_system_score_codex":0.0014553769,"about_ca_system_score_gemma":0.0007373769,"threshold_uncertainty_score":0.015619159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028412601,0.00079458795,0.9638289,0.0005239337,0.00005540163,0.000027364476,0.00009927298,0.00011265677,0.006145264],"genre_scores_gemma":[0.739614,0.0019095206,0.25047567,0.00022389018,0.00021014774,0.00020865598,0.00023145766,0.00010891014,0.007017759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00059110875,0.000051094008,0.0001468819,0.00040647626,0.00009076495],"domain_scores_gemma":[0.9948319,0.00391385,0.00037784214,0.00038533812,0.0004252595,0.000065783715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016539705,0.000642748,0.00066468545,0.00066046853,0.00047663494,0.0015294345,0.00069005927,0.0011693337,0.0012095977],"category_scores_gemma":[0.0074543008,0.00026313946,0.00034459456,0.0011647774,0.0019562412,0.0020943775,0.0012640782,0.0019319629,0.00038942357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014700386,0.000038726343,0.00045782063,0.00016691978,0.000024450595,0.00019733961,0.00015348603,0.46472993,0.0037975716,0.48873156,0.0012705494,0.04028478],"study_design_scores_gemma":[0.0000064059145,0.000023651455,0.000058131245,0.000011020053,0.000004414392,0.000055463082,0.000013815415,0.90992916,0.002187203,0.086958535,0.0007404263,0.000011750647],"about_ca_topic_score_codex":0.0009227234,"about_ca_topic_score_gemma":0.00072117953,"teacher_disagreement_score":0.0016539705,"about_ca_system_score_codex":0.0008915433,"about_ca_system_score_gemma":0.0011398391,"threshold_uncertainty_score":0.008747101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008656324,0.0005556937,0.9865001,0.0001324691,0.00003507873,0.00004264765,0.000044670152,0.0002677802,0.0037652738],"genre_scores_gemma":[0.85641116,0.0017760391,0.13443485,0.00017762568,0.00012316568,0.00027883056,0.00016343541,0.0001921427,0.0064427084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986369,0.00041275757,0.000045628138,0.00010622386,0.0006717513,0.00012676188],"domain_scores_gemma":[0.9985965,0.00091018487,0.00008678578,0.000081474456,0.00031057288,0.00001445383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016356526,0.0012970243,0.0008304312,0.00058853393,0.00041344258,0.0012832223,0.0014919008,0.0014134194,0.0014277596],"category_scores_gemma":[0.007860625,0.00058871147,0.0005299306,0.00067817234,0.0007567786,0.001491185,0.0006186769,0.0013560698,0.00075966225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023740235,0.000012772232,0.00009786382,0.00003747504,0.0000100531115,0.000043070904,0.000025356761,0.977466,0.0024388954,0.012683152,0.0002632579,0.00689839],"study_design_scores_gemma":[0.0000016716383,0.00000917566,0.000018690305,0.000003852415,0.0000023894336,0.000011844283,0.0000019421045,0.99746454,0.00035903906,0.00197197,0.00015153874,0.000003235096],"about_ca_topic_score_codex":0.004378296,"about_ca_topic_score_gemma":0.002386796,"teacher_disagreement_score":0.004378296,"about_ca_system_score_codex":0.001385928,"about_ca_system_score_gemma":0.0012821265,"threshold_uncertainty_score":0.010055661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020877648,0.0005362283,0.9767122,0.00011572292,0.00005884687,0.00002298351,0.000062824045,0.00013612662,0.0014773123],"genre_scores_gemma":[0.66089463,0.0015195776,0.332162,0.00011861786,0.0001971165,0.00012927326,0.0003585196,0.00008166376,0.004538598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930644,0.0003418346,0.00003128633,0.00009437378,0.00017254711,0.00005354505],"domain_scores_gemma":[0.99723995,0.0018704978,0.00018234192,0.00021318134,0.00045694623,0.000037078727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014981413,0.0009452393,0.0006884778,0.0008114599,0.00035628065,0.00090411544,0.0005134913,0.000525976,0.0009767602],"category_scores_gemma":[0.009409335,0.00033259444,0.00040549473,0.00046227383,0.00054153654,0.0009711966,0.0007916466,0.00052325474,0.00047710197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003605475,0.00006202051,0.005198159,0.0004565221,0.000110208435,0.0002701874,0.00017882267,0.7089102,0.05771209,0.056321748,0.0011849541,0.16923442],"study_design_scores_gemma":[0.000005819268,0.000036576486,0.0006754437,0.000015719505,0.000009390009,0.000075351934,0.0000108926215,0.987604,0.005601684,0.0054039843,0.000549433,0.000011615368],"about_ca_topic_score_codex":0.001065188,"about_ca_topic_score_gemma":0.0017702542,"teacher_disagreement_score":0.0014981413,"about_ca_system_score_codex":0.0005734379,"about_ca_system_score_gemma":0.0007041365,"threshold_uncertainty_score":0.007923067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040858136,0.00028885537,0.9933848,0.00009811682,0.00006675161,0.000020656451,0.00004462325,0.0003263059,0.0016840134],"genre_scores_gemma":[0.60873544,0.0036427034,0.3690534,0.0011669062,0.00053461816,0.00040657257,0.0008155943,0.00068464247,0.014960135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970041,0.0009708578,0.00013002018,0.0004819741,0.001122947,0.0002901487],"domain_scores_gemma":[0.993457,0.0032778261,0.0006454964,0.00094619015,0.0015045716,0.00016895692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035930818,0.001430045,0.0011303734,0.0015855415,0.0006343905,0.0016885936,0.002444268,0.0014470608,0.0031066476],"category_scores_gemma":[0.016189842,0.00059737125,0.0013771384,0.002393215,0.0014114019,0.0044292654,0.0016040488,0.0024914595,0.002182278],"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.00031030027,0.00007377647,0.005109787,0.00027691058,0.00015386313,0.00086399773,0.00032478804,0.6119588,0.0056752963,0.26763603,0.008157987,0.09945844],"study_design_scores_gemma":[0.000011101536,0.000038854778,0.00043548064,0.000023330695,0.000020829204,0.0005067423,0.0000393315,0.9612462,0.001147818,0.0339478,0.0025478466,0.000034639226],"about_ca_topic_score_codex":0.0031421413,"about_ca_topic_score_gemma":0.001863894,"teacher_disagreement_score":0.0035930818,"about_ca_system_score_codex":0.0013607622,"about_ca_system_score_gemma":0.0009819205,"threshold_uncertainty_score":0.019002259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055465445,0.0008613671,0.93991756,0.00029743504,0.000047399684,0.00003761816,0.00008590213,0.00019955842,0.0030876526],"genre_scores_gemma":[0.80315983,0.0014279353,0.19118215,0.00018632448,0.000098297496,0.00011019743,0.00018020805,0.00005123894,0.0036037625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994893,0.00017052189,0.000039905302,0.0000652313,0.00019259227,0.000042429943],"domain_scores_gemma":[0.99824655,0.00078154926,0.00033971932,0.00023092376,0.00035051585,0.000050685725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007722655,0.0004743191,0.0006453684,0.0003553136,0.00031597508,0.00045038018,0.0005903668,0.000627148,0.00070769293],"category_scores_gemma":[0.004461449,0.00025565812,0.00029216424,0.0005341552,0.00073805114,0.0009441494,0.00071533635,0.00051478756,0.0003201078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002279923,0.000018162342,0.00075404,0.00024933825,0.00004645362,0.00039377576,0.00017726568,0.78131855,0.024831224,0.11672836,0.0012780145,0.073976755],"study_design_scores_gemma":[0.000027265094,0.00008173208,0.00024127228,0.0000365318,0.000025589552,0.00021639184,0.000016837921,0.95537376,0.012971278,0.02856036,0.0024207444,0.000028255281],"about_ca_topic_score_codex":0.0009330631,"about_ca_topic_score_gemma":0.0011105399,"teacher_disagreement_score":0.0009330631,"about_ca_system_score_codex":0.00063274027,"about_ca_system_score_gemma":0.0009946674,"threshold_uncertainty_score":0.0045908093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792402,0.00045384,0.018012535,0.0001159282,0.00001779903,0.000008537641,0.000099837474,0.00012739509,0.0019239993],"genre_scores_gemma":[0.9984133,0.000117314004,0.0010912485,0.0000135283235,0.000006067749,0.000002793576,0.000029079094,0.000007437922,0.00031925767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00016295207,0.000029842908,0.0000628011,0.00023152384,0.00015726402],"domain_scores_gemma":[0.9973441,0.0016838463,0.00039077466,0.00013537925,0.00036949883,0.00007639844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089309545,0.00079606095,0.00057215296,0.00050198036,0.000517092,0.0005961898,0.00025493326,0.0007752506,0.00089000707],"category_scores_gemma":[0.0039949827,0.00015457076,0.00019379104,0.0005702953,0.0007690298,0.000919456,0.00063936354,0.00033234627,0.00016503838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006762841,0.00009277378,0.012505718,0.00016358524,0.00009364687,0.0004806499,0.00017892559,0.9070753,0.059984077,0.005485267,0.00029671984,0.01296699],"study_design_scores_gemma":[0.000035957997,0.00032370933,0.010111877,0.000026670772,0.000048264967,0.0003679375,0.00011774341,0.96145505,0.025534563,0.0016679068,0.00025682795,0.000053429132],"about_ca_topic_score_codex":0.0030821122,"about_ca_topic_score_gemma":0.0029016011,"teacher_disagreement_score":0.0030821122,"about_ca_system_score_codex":0.0005721233,"about_ca_system_score_gemma":0.00048574858,"threshold_uncertainty_score":0.0061283708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06641395,0.00030575471,0.922119,0.00039876564,0.000048147383,0.000039546758,0.00010178861,0.00033281374,0.010240305],"genre_scores_gemma":[0.87705976,0.00030957276,0.11384891,0.00012481399,0.000061376246,0.00007456595,0.00013982476,0.000100787714,0.008280474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943465,0.00015876113,0.00002150318,0.00008063266,0.00025369108,0.000050829556],"domain_scores_gemma":[0.99869305,0.00064185564,0.00009777162,0.00012732539,0.00039632944,0.000043748572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081709656,0.00048174037,0.000570484,0.0004584239,0.00035369056,0.00075926055,0.0007136773,0.00073961244,0.001988944],"category_scores_gemma":[0.003308461,0.00030259264,0.00041388822,0.0003933897,0.0006624148,0.000641738,0.0007712098,0.0007278843,0.0006525963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023906525,0.00002782229,0.00097464374,0.00009339529,0.000051817926,0.00021743652,0.00022458743,0.8025888,0.037276015,0.12589584,0.0013651191,0.031045455],"study_design_scores_gemma":[0.000003451098,0.000009432128,0.000048480553,0.0000021903402,0.0000032383261,0.000028462384,0.0000031422755,0.99395436,0.0026440118,0.0030639968,0.00023530338,0.0000040093078],"about_ca_topic_score_codex":0.002255764,"about_ca_topic_score_gemma":0.00120798,"teacher_disagreement_score":0.002255764,"about_ca_system_score_codex":0.0011985896,"about_ca_system_score_gemma":0.0009977482,"threshold_uncertainty_score":0.008696437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010885218,0.00012356472,0.9875644,0.00007158672,0.000017325341,0.000015386951,0.000010102717,0.00010364024,0.0012087366],"genre_scores_gemma":[0.5369817,0.00033092685,0.45929,0.00009134112,0.000041677198,0.00016200339,0.00006945242,0.000049452836,0.002983463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998161,0.0000633692,0.0000077908635,0.00002361933,0.00007272581,0.00001644634],"domain_scores_gemma":[0.99976486,0.00011709832,0.00001797584,0.000011695975,0.00007818282,0.000010166341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035729597,0.00035935035,0.00036656842,0.00022874953,0.00022951873,0.00035617535,0.00037252987,0.00034011388,0.00081523234],"category_scores_gemma":[0.00092235854,0.0002254993,0.00018602505,0.0003133624,0.00035550265,0.00047313646,0.00032373756,0.00042103874,0.00022503432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012380886,0.00003701038,0.00068800943,0.000050754148,0.000033294877,0.000061119164,0.00007889639,0.786476,0.01607167,0.030178351,0.0012628264,0.1649383],"study_design_scores_gemma":[0.000009134326,0.00001999873,0.000081899525,0.0000024872509,0.0000026208995,0.000014549206,0.000004296142,0.9954202,0.0016916323,0.0023546023,0.00039301012,0.0000055673986],"about_ca_topic_score_codex":0.0016226108,"about_ca_topic_score_gemma":0.0014505258,"teacher_disagreement_score":0.0016226108,"about_ca_system_score_codex":0.00031033493,"about_ca_system_score_gemma":0.0005450701,"threshold_uncertainty_score":0.0032263398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05360094,0.00029352691,0.93466246,0.00034892786,0.00009380538,0.00010209334,0.00004621807,0.00037852128,0.010473423],"genre_scores_gemma":[0.75557727,0.0007377466,0.23680285,0.0003528631,0.00013573864,0.00016286805,0.00010370823,0.00010687728,0.006020075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997372,0.000043148742,0.000018010245,0.000056682482,0.00010047531,0.00004451444],"domain_scores_gemma":[0.99945754,0.0001138369,0.00007146383,0.00023369314,0.00008623686,0.000037173304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044051325,0.00030422033,0.00024465605,0.00041049582,0.0005517112,0.0006672989,0.0007066655,0.00052509486,0.0013128615],"category_scores_gemma":[0.0006842382,0.00015915636,0.0003098111,0.00035193164,0.00078264,0.0020491516,0.00087902596,0.0009018243,0.00030875343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002597944,0.00017443752,0.0007759587,0.00027322944,0.00003829743,0.00037403408,0.00036027405,0.07131329,0.20408991,0.45391372,0.004249767,0.2641773],"study_design_scores_gemma":[0.0000623287,0.0013607077,0.00075637316,0.00007233683,0.00006341979,0.0017436927,0.00020845479,0.541403,0.14834872,0.24754243,0.05834791,0.00009063904],"about_ca_topic_score_codex":0.00041362888,"about_ca_topic_score_gemma":0.0004695976,"teacher_disagreement_score":0.0013128615,"about_ca_system_score_codex":0.00043409097,"about_ca_system_score_gemma":0.00072950893,"threshold_uncertainty_score":0.0043919086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761489,0.00051851413,0.39955643,0.00047153115,0.00014144747,0.000072785304,0.00006365464,0.00062588125,0.02240096],"genre_scores_gemma":[0.8789838,0.00022497731,0.11688992,0.00015685141,0.00004050949,0.000037165268,0.000027182681,0.000012683518,0.003626901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999833,0.00004443574,0.000007046146,0.00003110507,0.000057715533,0.000026691858],"domain_scores_gemma":[0.9998667,0.00003881859,0.00001575908,0.000030769712,0.000032012194,0.000015893043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024416344,0.00015574427,0.00014872882,0.0002304588,0.00034300066,0.0006073212,0.00028783237,0.00039626344,0.0004351458],"category_scores_gemma":[0.00029849727,0.0001409726,0.00013465055,0.00017171295,0.00043491257,0.0007449101,0.00049625395,0.00027353282,0.0001049467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003187602,0.00016923981,0.0026228356,0.0001753365,0.00003157745,0.0014643539,0.00051944226,0.056214884,0.36458346,0.46865764,0.002377103,0.102865346],"study_design_scores_gemma":[0.00007600589,0.0004336238,0.0021154117,0.000029295337,0.00004824971,0.0016056901,0.00016059235,0.81851906,0.06562526,0.09736818,0.013958549,0.00006010428],"about_ca_topic_score_codex":0.0004926811,"about_ca_topic_score_gemma":0.0008279896,"teacher_disagreement_score":0.0006073212,"about_ca_system_score_codex":0.00033698362,"about_ca_system_score_gemma":0.0003210788,"threshold_uncertainty_score":0.0024450421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075455355,0.000373227,0.9907549,0.000076603996,0.000023541757,0.0000106028365,0.000009169937,0.00017954524,0.0010267713],"genre_scores_gemma":[0.47163975,0.000673039,0.5233844,0.00012750598,0.00012680628,0.00006711253,0.000094566356,0.0000454256,0.0038413703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952006,0.00013102568,0.000016155278,0.00004434725,0.00024140827,0.00004692775],"domain_scores_gemma":[0.9991602,0.00053398235,0.00005304576,0.000071297596,0.0001638387,0.000017663016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004505004,0.00043204153,0.000375544,0.00040680243,0.0002777488,0.00039174454,0.00036320242,0.00064329954,0.0008177669],"category_scores_gemma":[0.0028041063,0.00028386494,0.000270114,0.00044865272,0.0004182577,0.00060408784,0.0005423992,0.0006333581,0.00034269423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029174358,0.00006411907,0.0013251166,0.00015173735,0.000091616166,0.00019628688,0.000192432,0.38542792,0.043798387,0.022425804,0.0018704854,0.54416436],"study_design_scores_gemma":[0.000019428946,0.00006286538,0.0005163741,0.000009729934,0.000012759337,0.00019038092,0.000015565824,0.97899204,0.013583067,0.004098955,0.002476305,0.000022621913],"about_ca_topic_score_codex":0.0019430454,"about_ca_topic_score_gemma":0.002761642,"teacher_disagreement_score":0.0019430454,"about_ca_system_score_codex":0.0002573669,"about_ca_system_score_gemma":0.0006025795,"threshold_uncertainty_score":0.0038635135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020217236,0.00044486273,0.9766815,0.000079764584,0.00003439825,0.000046939862,0.000017467497,0.00040400206,0.0020738193],"genre_scores_gemma":[0.29880515,0.000730041,0.697472,0.00015176935,0.000078004894,0.00013118831,0.000119971875,0.0001378314,0.0023740267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983241,0.0007155547,0.00009342143,0.00012793427,0.0006383648,0.00010062479],"domain_scores_gemma":[0.9952443,0.0027210356,0.0003822816,0.0009553965,0.00062020496,0.00007668752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017033191,0.00060703827,0.0007131589,0.00064434356,0.00045256063,0.00079381006,0.00073094934,0.0010104848,0.00074173737],"category_scores_gemma":[0.00807187,0.00027286884,0.00038072473,0.00054233713,0.0008472597,0.0012382529,0.0009853898,0.0014508428,0.0006722657],"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.00086001935,0.00013640372,0.0012607302,0.00038530817,0.00006948673,0.0006973926,0.0006232431,0.29358768,0.1360367,0.161937,0.0022921285,0.4021139],"study_design_scores_gemma":[0.00007271857,0.00034487303,0.00024114714,0.000068506204,0.000032173746,0.00076483586,0.00002762911,0.8489486,0.105391115,0.03664808,0.0074118953,0.00004848006],"about_ca_topic_score_codex":0.0002683234,"about_ca_topic_score_gemma":0.0003249525,"teacher_disagreement_score":0.0017033191,"about_ca_system_score_codex":0.00036815787,"about_ca_system_score_gemma":0.0007430458,"threshold_uncertainty_score":0.00900811},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010261037,0.0012052598,0.008265787,0.004019192,0.008586792,0.00033070068,0.006195088,0.0060311025,0.96434],"genre_scores_gemma":[0.002838005,0.0018243575,0.002522741,0.0007509559,0.0004224635,0.00008260212,0.0028621836,0.0019913947,0.9867051],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970144,0.000027897195,0.000023971055,0.00006604617,0.00013078775,0.000049954968],"domain_scores_gemma":[0.99871194,0.00011641721,0.000035756424,0.00016208172,0.0006698613,0.00030398817],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000643797,0.00091303204,0.0009428216,0.0012800436,0.0009781375,0.006402656,0.0011908294,0.0016199888,0.7997265],"category_scores_gemma":[0.0019602047,0.00050672406,0.00076888327,0.0022050845,0.00074332557,0.0043585813,0.0015445468,0.0018592161,0.8489174],"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.00004408143,0.00003672027,0.00020697498,0.00018628468,0.0000058395426,0.00004477224,0.00006075236,0.00009405096,0.0013022558,0.0019169963,0.9030401,0.09306116],"study_design_scores_gemma":[0.000008622213,0.000015541133,0.00035283878,0.0000830102,0.000006257503,0.000050742874,0.000108421635,0.00017417839,0.0005299685,0.0007231159,0.99793965,0.000007649463],"about_ca_topic_score_codex":0.005596359,"about_ca_topic_score_gemma":0.0068116887,"teacher_disagreement_score":0.20027351,"about_ca_system_score_codex":0.0012739701,"about_ca_system_score_gemma":0.0016047332,"threshold_uncertainty_score":0.2856658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36981544,0.0004980548,0.6144168,0.00041281778,0.000023661298,0.000048535112,0.00010142826,0.00021899982,0.014464245],"genre_scores_gemma":[0.9900462,0.00013175528,0.009026464,0.000023627399,0.0000153087,0.000021224067,0.000026486148,0.000023348905,0.00068555697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995497,0.00012957268,0.000011842913,0.000042054657,0.00015909119,0.00010773408],"domain_scores_gemma":[0.99860877,0.0008829258,0.00019524379,0.00004579582,0.0002014755,0.00006583828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084846147,0.0004020628,0.00048778972,0.0005209062,0.0002774357,0.0007964217,0.0007144269,0.00039628003,0.0012187585],"category_scores_gemma":[0.0031012665,0.0003141042,0.0002208271,0.0005468133,0.0005777736,0.00063815544,0.000451313,0.00040457866,0.00010079528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011840691,0.000033919554,0.0015114759,0.000053004766,0.000020351723,0.00014585705,0.00008747739,0.94215703,0.01893612,0.027616818,0.00045538464,0.0088641755],"study_design_scores_gemma":[0.0000020144407,0.000008240395,0.00024607856,0.0000021580033,0.000002320151,0.000011949636,0.000011447465,0.9971418,0.0008341598,0.0016520406,0.00008484498,0.0000029548496],"about_ca_topic_score_codex":0.002965763,"about_ca_topic_score_gemma":0.0018114202,"teacher_disagreement_score":0.002965763,"about_ca_system_score_codex":0.0011592727,"about_ca_system_score_gemma":0.0008720484,"threshold_uncertainty_score":0.008411109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115866855,0.0008132893,0.87763673,0.00033789742,0.000087236935,0.000074859476,0.000107843094,0.00017881602,0.004896427],"genre_scores_gemma":[0.87898076,0.00035210882,0.11954968,0.00006613358,0.0000385621,0.00005418652,0.00007817256,0.000025779385,0.0008546079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985404,0.00048738765,0.00007060906,0.000101766665,0.0007191104,0.000080822545],"domain_scores_gemma":[0.99765766,0.0011913991,0.00039069666,0.0002912302,0.0003754714,0.000093514645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526558,0.0009050295,0.0005785465,0.00056016375,0.00032123068,0.0011952474,0.00077469193,0.0006986906,0.00079210155],"category_scores_gemma":[0.0067332857,0.00017812567,0.00023262318,0.0006876499,0.0009055509,0.0013689459,0.0007562404,0.00064603146,0.00022499012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034163258,0.000115850664,0.0021247454,0.00021449734,0.000068347785,0.00033208315,0.0001148954,0.7002283,0.031193184,0.21431622,0.0008031398,0.050147105],"study_design_scores_gemma":[0.000007220095,0.00010136899,0.00016918557,0.000010802869,0.000008760953,0.00007873347,0.000010471657,0.9753612,0.010071335,0.01381751,0.00034616175,0.000017246859],"about_ca_topic_score_codex":0.00047694484,"about_ca_topic_score_gemma":0.00064509845,"teacher_disagreement_score":0.001526558,"about_ca_system_score_codex":0.0010019332,"about_ca_system_score_gemma":0.00054247497,"threshold_uncertainty_score":0.00807333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33150473,0.0050101276,0.61288214,0.0011722363,0.00008793123,0.00012676728,0.0004822985,0.00093219953,0.047801543],"genre_scores_gemma":[0.985607,0.0011187283,0.010935417,0.00006132766,0.00007475796,0.000043472435,0.00013620728,0.00004842357,0.001974623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673516,0.0011763022,0.00010470507,0.00026174908,0.0012158268,0.0005062504],"domain_scores_gemma":[0.9903654,0.0068898518,0.0007816318,0.0004497978,0.0013953454,0.000117842304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025757034,0.0017106639,0.0012822114,0.0011266501,0.0007016791,0.0015468842,0.0008724973,0.0014070309,0.0017554866],"category_scores_gemma":[0.0100960275,0.00044630453,0.00051734515,0.0015582808,0.0013233948,0.0013051933,0.001216888,0.00069760915,0.0006729208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049342366,0.000050394243,0.0027743797,0.00018219318,0.00012572689,0.0004143363,0.00023542116,0.92125386,0.014527452,0.03406304,0.0008597001,0.025019966],"study_design_scores_gemma":[0.000021467053,0.0002224853,0.00118281,0.00002245396,0.000067871595,0.00032340997,0.00004797063,0.9853511,0.0052326103,0.0068719015,0.00062210736,0.00003375316],"about_ca_topic_score_codex":0.003658494,"about_ca_topic_score_gemma":0.0024780475,"teacher_disagreement_score":0.003658494,"about_ca_system_score_codex":0.00218404,"about_ca_system_score_gemma":0.001139211,"threshold_uncertainty_score":0.015846372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053616893,0.0004908181,0.9391743,0.00012647916,0.000082140265,0.000052562245,0.000051607676,0.00066872896,0.0057364623],"genre_scores_gemma":[0.34941125,0.0005022175,0.6446772,0.00012189461,0.00014981745,0.00008901296,0.00015238441,0.000045264795,0.004850946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997422,0.000057802386,0.000013345512,0.000027510112,0.00013569895,0.000023431328],"domain_scores_gemma":[0.9997452,0.000102818034,0.000029539922,0.000062140134,0.000050403596,0.000009895758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019569336,0.00041636708,0.00039078636,0.00024276068,0.00019587461,0.00038133137,0.0003230836,0.00031152033,0.0017957054],"category_scores_gemma":[0.00086612714,0.00013600131,0.0002573956,0.00042404703,0.00024013016,0.0005754264,0.00035923114,0.00038723866,0.00072053756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033097345,0.00007740519,0.0006583904,0.00021546704,0.00004650847,0.0002860388,0.00012642759,0.024458257,0.32447705,0.022775726,0.0021427004,0.624405],"study_design_scores_gemma":[0.00014407725,0.0011642555,0.00225583,0.000053558895,0.00009627968,0.003004955,0.00006500347,0.63121897,0.30907512,0.011447907,0.04141738,0.00005664845],"about_ca_topic_score_codex":0.00021865238,"about_ca_topic_score_gemma":0.00043638723,"teacher_disagreement_score":0.0017957054,"about_ca_system_score_codex":0.0001278256,"about_ca_system_score_gemma":0.00027775703,"threshold_uncertainty_score":0.006007254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013699379,0.00011273773,0.99527353,0.00013856402,0.000022621032,0.000028266237,0.00010022006,0.00012770122,0.0028263207],"genre_scores_gemma":[0.1372588,0.00059135054,0.85637563,0.00024351424,0.000059798786,0.00031488194,0.00034574524,0.00013294943,0.004677266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954045,0.0001435349,0.000017582464,0.00006604151,0.00019959096,0.000032826883],"domain_scores_gemma":[0.9997409,0.0001270345,0.000027742793,0.00003805387,0.000049832033,0.000016456195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045148702,0.00073903607,0.00054605806,0.0006446271,0.00046210663,0.00091454794,0.0014537466,0.00079936115,0.00350596],"category_scores_gemma":[0.00073937816,0.00041826762,0.00081366155,0.001421845,0.00044621498,0.0011119907,0.0008508741,0.00093876023,0.0005798474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044362205,0.00004304972,0.00023725153,0.00011422352,0.00006159347,0.00013908632,0.00005042804,0.82419294,0.0035974963,0.083486386,0.00534843,0.08268471],"study_design_scores_gemma":[0.0000091094125,0.000014083795,0.00004473013,0.0000073260294,0.000008174406,0.0000418434,0.000006919595,0.98057395,0.00062858424,0.013045739,0.0056101023,0.000009550852],"about_ca_topic_score_codex":0.008220222,"about_ca_topic_score_gemma":0.013540752,"teacher_disagreement_score":0.008220222,"about_ca_system_score_codex":0.0011499384,"about_ca_system_score_gemma":0.0015832771,"threshold_uncertainty_score":0.016344786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045370765,0.00039531852,0.94983387,0.00018268044,0.000048488935,0.000037384216,0.00009144275,0.0007358182,0.003304234],"genre_scores_gemma":[0.5265852,0.00046005478,0.464838,0.00017552753,0.00009569213,0.00010975635,0.00027476522,0.00007948295,0.0073815295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983033,0.0005775099,0.00008271568,0.00012221414,0.0007130153,0.00020133762],"domain_scores_gemma":[0.9984321,0.0006172704,0.00018901032,0.00028916632,0.00041157694,0.00006086598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011016589,0.0007227537,0.00084722054,0.0006399799,0.00038215893,0.00088210485,0.0009899918,0.0009810088,0.0011567753],"category_scores_gemma":[0.004436323,0.00034469558,0.00037208712,0.0009793548,0.00051777315,0.0009253933,0.0015836239,0.0008017477,0.00081408146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009903912,0.00012576254,0.0017889101,0.000201207,0.00012385234,0.00036221909,0.0004911869,0.37574306,0.11657928,0.061288957,0.003609172,0.43869606],"study_design_scores_gemma":[0.00004786327,0.00018731454,0.00056871894,0.00001966747,0.000027817907,0.00027430293,0.000021022503,0.9466523,0.03916841,0.010745823,0.0022382748,0.00004851529],"about_ca_topic_score_codex":0.0013817409,"about_ca_topic_score_gemma":0.0031678411,"teacher_disagreement_score":0.0013817409,"about_ca_system_score_codex":0.00049583195,"about_ca_system_score_gemma":0.0014470051,"threshold_uncertainty_score":0.005826175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104329444,0.0011831187,0.890075,0.00015487145,0.000034500383,0.000027693377,0.0000458305,0.00012399894,0.004025462],"genre_scores_gemma":[0.8409283,0.0010880941,0.15619716,0.00006280566,0.0000663503,0.00004985015,0.00005286019,0.00004313245,0.001511458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952304,0.00019225357,0.000017709752,0.000039119972,0.00017379169,0.000054029748],"domain_scores_gemma":[0.9987577,0.0008007865,0.00012708467,0.00006996384,0.00021802183,0.00002654963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067916454,0.00036196134,0.0003065691,0.00040574008,0.00019746195,0.00054189,0.00026352133,0.00044758565,0.0005434627],"category_scores_gemma":[0.0031843735,0.00018789522,0.000111775385,0.0004974548,0.00040371352,0.00070337026,0.0003617888,0.00045011044,0.00018067166],"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.00030542156,0.000040564035,0.0014342958,0.00013697923,0.00005348517,0.00024924762,0.00015341386,0.7554073,0.037973065,0.11095859,0.0005829006,0.09270484],"study_design_scores_gemma":[0.000016693806,0.00010337912,0.00022521515,0.00002089962,0.000015583682,0.00015108034,0.000015584457,0.9685221,0.013151275,0.016339982,0.0014245905,0.000013659227],"about_ca_topic_score_codex":0.00074144866,"about_ca_topic_score_gemma":0.00088598387,"teacher_disagreement_score":0.00074144866,"about_ca_system_score_codex":0.00036330632,"about_ca_system_score_gemma":0.0004255595,"threshold_uncertainty_score":0.0035918355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018488655,0.004890583,0.96195054,0.00034358833,0.00020313708,0.00007692506,0.00020010812,0.00039909128,0.013447384],"genre_scores_gemma":[0.77946025,0.012791999,0.19526866,0.0006213251,0.0004941043,0.00024739906,0.0004943301,0.00029748314,0.01032446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853504,0.0004233253,0.00009316533,0.00015758404,0.00058806315,0.00020279975],"domain_scores_gemma":[0.9958389,0.0024122659,0.00034808923,0.0003105374,0.0010555288,0.000034812372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442125,0.0014958961,0.0010320368,0.0009346072,0.0005014278,0.0022055064,0.00081279245,0.0009619728,0.0038138055],"category_scores_gemma":[0.009536041,0.0003883966,0.0005698644,0.0009994579,0.0011469508,0.002088631,0.00083432,0.0013518757,0.001728876],"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.00021226665,0.000112381786,0.001077314,0.0010550311,0.00010577486,0.0008435392,0.00054365455,0.67886776,0.022461278,0.1717892,0.005633936,0.1172978],"study_design_scores_gemma":[0.000016104963,0.00016485255,0.00056806393,0.00017095733,0.00005243674,0.0007952579,0.0001795668,0.95180243,0.00705342,0.033682,0.0054603047,0.00005463447],"about_ca_topic_score_codex":0.0010708781,"about_ca_topic_score_gemma":0.0012625903,"teacher_disagreement_score":0.0038138055,"about_ca_system_score_codex":0.00097262685,"about_ca_system_score_gemma":0.0010181109,"threshold_uncertainty_score":0.012915313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037830668,0.0012699034,0.9853858,0.00018109225,0.00011423828,0.000047520072,0.00012660096,0.0004740639,0.008617672],"genre_scores_gemma":[0.3851681,0.011192352,0.5730091,0.0006997338,0.00068877405,0.00070382067,0.0010297036,0.0010238782,0.026484583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972294,0.0006907898,0.00013250457,0.00023529583,0.0014659893,0.00024597583],"domain_scores_gemma":[0.9940696,0.0033511247,0.00032601552,0.0007375987,0.0014280968,0.000087671615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029060661,0.0015910205,0.0016342658,0.0016868976,0.00081707514,0.003311494,0.002052868,0.001734554,0.0053013167],"category_scores_gemma":[0.017726108,0.00084180885,0.0009570637,0.0016840661,0.0016148484,0.005359327,0.0018045505,0.002849548,0.0055887084],"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.00008027562,0.00007082833,0.00045668735,0.0003353298,0.000034401157,0.0002589553,0.00030197803,0.6136596,0.0045373603,0.30536377,0.0070613897,0.0678394],"study_design_scores_gemma":[0.000009261277,0.000017428389,0.000104695464,0.00006322926,0.000009321026,0.00016586893,0.000048883787,0.9201884,0.0018456584,0.072313815,0.005205469,0.000027936088],"about_ca_topic_score_codex":0.0020663117,"about_ca_topic_score_gemma":0.0021356805,"teacher_disagreement_score":0.0053013167,"about_ca_system_score_codex":0.0016265652,"about_ca_system_score_gemma":0.0014426132,"threshold_uncertainty_score":0.017734706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2208426,0.001689009,0.7720701,0.00068660325,0.000094451745,0.000043990047,0.00011259099,0.00026731702,0.004193275],"genre_scores_gemma":[0.8856502,0.00095912826,0.11072585,0.00014235899,0.0001623606,0.000060717815,0.00019393805,0.000049701503,0.0020556808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749184,0.00095063477,0.0001160543,0.00045597384,0.0007016166,0.00028398173],"domain_scores_gemma":[0.99464864,0.004349265,0.0004343526,0.00014640714,0.00031943727,0.000101922196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020305736,0.0011507329,0.0016845696,0.0006375797,0.00046432787,0.0015512021,0.00085409364,0.0019825283,0.00065019034],"category_scores_gemma":[0.009348199,0.0008260226,0.00046846695,0.0007861003,0.0021305264,0.0018981021,0.0016448096,0.00082455797,0.00031544713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003977735,0.00020292273,0.0026736506,0.00077183935,0.00032788725,0.0008037571,0.00036072743,0.71141344,0.110563025,0.06358232,0.0012526911,0.10406997],"study_design_scores_gemma":[0.00010505254,0.00026346106,0.0006548949,0.000031284253,0.000056831796,0.0002573553,0.00004379688,0.9508936,0.025476823,0.02160735,0.00056762435,0.00004191445],"about_ca_topic_score_codex":0.00085438055,"about_ca_topic_score_gemma":0.00048928545,"teacher_disagreement_score":0.0020305736,"about_ca_system_score_codex":0.0010488839,"about_ca_system_score_gemma":0.0009679971,"threshold_uncertainty_score":0.01073879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19456588,0.00032553228,0.7968092,0.00012265317,0.000055714205,0.000062333485,0.00006187059,0.0006631377,0.0073336954],"genre_scores_gemma":[0.70198303,0.00015274278,0.2949028,0.000083654166,0.000020209105,0.00004447944,0.00010520659,0.000067751476,0.0026401684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942327,0.0002217575,0.000031416468,0.000075407464,0.00018612834,0.00006209419],"domain_scores_gemma":[0.9979551,0.0011829542,0.00017953821,0.00035160992,0.00026862012,0.00006222214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698096,0.00037021452,0.0003872204,0.00038941248,0.00025431323,0.000673323,0.00080675865,0.0004716568,0.0009567003],"category_scores_gemma":[0.0031506678,0.00016460854,0.00026131785,0.00057237776,0.0007324025,0.0008062464,0.0006059671,0.00055284135,0.00028477955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075522054,0.00014493779,0.005017909,0.00022807284,0.0001969655,0.0002903358,0.00043681974,0.4820171,0.07032702,0.13785931,0.0016468277,0.3010795],"study_design_scores_gemma":[0.000027841674,0.00008086807,0.00041457813,0.000007944841,0.000014343999,0.00012400982,0.000024389263,0.9476599,0.034975495,0.015791038,0.0008640043,0.00001560871],"about_ca_topic_score_codex":0.0010549286,"about_ca_topic_score_gemma":0.0014276305,"teacher_disagreement_score":0.0010549286,"about_ca_system_score_codex":0.00051377283,"about_ca_system_score_gemma":0.0005105481,"threshold_uncertainty_score":0.003727734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92831594,0.0005870511,0.066673726,0.000063129104,0.000034229408,0.00002127074,0.000046379126,0.00023304296,0.0040253],"genre_scores_gemma":[0.99625164,0.00011111211,0.0031789131,0.000010168297,0.000012361659,0.0000040826753,0.00002688026,0.000011107233,0.0003938055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985442,0.0005922684,0.000046961948,0.0001257232,0.0004907147,0.0002001587],"domain_scores_gemma":[0.9962148,0.0026410166,0.00027905815,0.00021415361,0.0005578851,0.00009298395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606916,0.0006661952,0.0006524477,0.0005792254,0.0003121286,0.0007422546,0.00038717795,0.0006665956,0.0010015945],"category_scores_gemma":[0.0036359124,0.00016816396,0.00029940874,0.00037719015,0.00038449693,0.000671593,0.0005343986,0.0004594537,0.00021946423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030366785,0.0002432468,0.008584866,0.00026549277,0.00023164331,0.0005239175,0.00021510043,0.81550246,0.112301685,0.004670367,0.00032472936,0.05409984],"study_design_scores_gemma":[0.000022611604,0.00089849945,0.0019584508,0.0000070088777,0.00005896776,0.00027314303,0.00003416335,0.9700655,0.026153183,0.0003102877,0.00019407143,0.00002424518],"about_ca_topic_score_codex":0.0010800029,"about_ca_topic_score_gemma":0.00062741706,"teacher_disagreement_score":0.0015606916,"about_ca_system_score_codex":0.0004933545,"about_ca_system_score_gemma":0.0002872438,"threshold_uncertainty_score":0.008253813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5075121,0.0010250685,0.48206115,0.00022806665,0.00003309935,0.000064191874,0.00009793396,0.00027115035,0.008707238],"genre_scores_gemma":[0.97661465,0.00025398046,0.021664608,0.000040621646,0.000021016047,0.000037533315,0.000050816583,0.000031591637,0.0012852006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848145,0.0005002982,0.000051063325,0.00014399919,0.0006097278,0.00021339809],"domain_scores_gemma":[0.9959351,0.0029642398,0.00030998184,0.00021583067,0.00052461843,0.000050230377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019925078,0.00068316795,0.00075856055,0.00069426646,0.00038918343,0.0009823191,0.00074655534,0.000960518,0.0017688822],"category_scores_gemma":[0.0047707423,0.0003040475,0.0005437811,0.00044707864,0.0009856147,0.00081871956,0.00061668997,0.0005209697,0.00044137702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002575641,0.00021372036,0.006699999,0.0003774713,0.00029265787,0.00052743766,0.00044419445,0.5488286,0.2791563,0.090627775,0.00064112287,0.069615066],"study_design_scores_gemma":[0.000058079684,0.00037301844,0.001850202,0.000047298177,0.000091500886,0.00036783697,0.00004753232,0.88415146,0.10410373,0.008012709,0.0008359038,0.000060721817],"about_ca_topic_score_codex":0.0005833772,"about_ca_topic_score_gemma":0.00040561688,"teacher_disagreement_score":0.0019925078,"about_ca_system_score_codex":0.0011106466,"about_ca_system_score_gemma":0.00059198984,"threshold_uncertainty_score":0.010537505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036655099,0.0028711753,0.9921766,0.000089768175,0.000133376,0.000013023425,0.0000188955,0.00009533062,0.0009363636],"genre_scores_gemma":[0.29346752,0.019061578,0.6766104,0.00030383896,0.001981547,0.00014690282,0.00028942927,0.00012995904,0.008008798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994887,0.00015658274,0.000026039024,0.00006840561,0.00023131388,0.00002893571],"domain_scores_gemma":[0.99916697,0.0005470885,0.000052806867,0.00006221926,0.00015968512,0.000011303707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821563,0.00055928965,0.0004817746,0.00056146324,0.00026632348,0.0005896554,0.00042259326,0.000790224,0.0011670997],"category_scores_gemma":[0.0039510773,0.00027562262,0.0002875759,0.0010639471,0.00044777105,0.0009442928,0.00050122064,0.00085950765,0.0005595427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002125427,0.00003607421,0.00069108343,0.00035366806,0.000060577702,0.00023696927,0.00012437325,0.31880614,0.023095723,0.056975503,0.0039981953,0.5954091],"study_design_scores_gemma":[0.000019529574,0.000087413115,0.0004642053,0.000050560637,0.00002231607,0.00023268608,0.000015129529,0.9672569,0.008094448,0.01421126,0.009513504,0.000032163716],"about_ca_topic_score_codex":0.0011898488,"about_ca_topic_score_gemma":0.0009328098,"teacher_disagreement_score":0.0011898488,"about_ca_system_score_codex":0.00033418107,"about_ca_system_score_gemma":0.00032747907,"threshold_uncertainty_score":0.003904283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52873325,0.0135858245,0.32143354,0.0033666387,0.00043236537,0.000049394017,0.0013153737,0.00061234,0.13047121],"genre_scores_gemma":[0.991193,0.002096337,0.0035876653,0.00009777428,0.00016533316,0.00003403328,0.00014925229,0.00005003747,0.0026265185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987728,0.00032158353,0.000020082072,0.00009352333,0.00030206205,0.0004898735],"domain_scores_gemma":[0.9947271,0.0036673178,0.00030826678,0.00039810594,0.00077060936,0.00012858502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007953444,0.00062820513,0.000694505,0.0009900508,0.0007980475,0.0015079668,0.00072522584,0.0006603949,0.0056837886],"category_scores_gemma":[0.006284682,0.00031240785,0.00030696948,0.0010685404,0.0016553474,0.0023225958,0.0013543268,0.00089398253,0.0007812313],"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.00029620653,0.00007754182,0.0017560471,0.0003682172,0.00010401853,0.00064657297,0.00023249118,0.6796482,0.020706145,0.24870172,0.0059509166,0.04151191],"study_design_scores_gemma":[0.000013697413,0.00006475431,0.001182329,0.00016896644,0.00004661815,0.00032680426,0.00020150251,0.9126,0.013474733,0.06640244,0.0054346304,0.00008355548],"about_ca_topic_score_codex":0.0028882048,"about_ca_topic_score_gemma":0.0013362615,"teacher_disagreement_score":0.0056837886,"about_ca_system_score_codex":0.0013229103,"about_ca_system_score_gemma":0.00086701347,"threshold_uncertainty_score":0.01901412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9027553,0.0013718501,0.08673647,0.00020716856,0.000027994121,0.00002523086,0.00026127766,0.0005141093,0.00810067],"genre_scores_gemma":[0.9928427,0.0003941186,0.0056862,0.000018379827,0.000011873496,0.000009387729,0.00010603462,0.000034498546,0.00089694734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00017033861,0.000028712315,0.00009049481,0.00029118403,0.000116310825],"domain_scores_gemma":[0.99686486,0.0019729773,0.00035673231,0.00016187516,0.0005818507,0.00006165554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312239,0.00064710586,0.0005234912,0.00060050545,0.00029976747,0.00047364543,0.0003288074,0.0007006246,0.0012970658],"category_scores_gemma":[0.003464673,0.00018764545,0.0002725615,0.0006559679,0.00055100827,0.00060782186,0.0003169085,0.00047881002,0.0004269418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012627221,0.0001260403,0.01588452,0.00036524225,0.00014640031,0.0012809751,0.000473161,0.7189908,0.21636885,0.008037483,0.0006923172,0.036371484],"study_design_scores_gemma":[0.000012102674,0.00027504057,0.013201394,0.00003075742,0.000042542422,0.00062949193,0.0000935071,0.9448132,0.039316006,0.0010667992,0.00048204185,0.00003706107],"about_ca_topic_score_codex":0.0020796172,"about_ca_topic_score_gemma":0.0019521269,"teacher_disagreement_score":0.0020796172,"about_ca_system_score_codex":0.0008497167,"about_ca_system_score_gemma":0.00026179315,"threshold_uncertainty_score":0.0061652064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050792914,0.0024974565,0.9314012,0.00043967098,0.00012282855,0.00004791114,0.0002610094,0.00071021955,0.013726739],"genre_scores_gemma":[0.9060064,0.0029058286,0.08111583,0.00030435823,0.0001729817,0.00010948403,0.00033423607,0.00020656988,0.008844238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00020898892,0.000042157353,0.00014274071,0.00043502435,0.00012223929],"domain_scores_gemma":[0.99789065,0.0010037298,0.00024429403,0.00026600718,0.0005608393,0.00003435382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011863139,0.0011152964,0.0007851248,0.00075543334,0.0003908238,0.0010460354,0.0007651038,0.00092990266,0.0030230542],"category_scores_gemma":[0.0039585796,0.00030753014,0.0005113883,0.00068842596,0.0011697692,0.0016159635,0.0008427398,0.0007670635,0.001163624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016394333,0.00007851743,0.0015465202,0.00051629514,0.000070232905,0.000653299,0.00034800073,0.81923354,0.029757233,0.10434094,0.0031942124,0.04009731],"study_design_scores_gemma":[0.0000075062007,0.000053154123,0.0008246584,0.000048053775,0.00002201141,0.00041594554,0.000051720923,0.97021896,0.0049560377,0.022054465,0.0013105645,0.00003691973],"about_ca_topic_score_codex":0.0015331244,"about_ca_topic_score_gemma":0.0017193691,"teacher_disagreement_score":0.0030230542,"about_ca_system_score_codex":0.0012395291,"about_ca_system_score_gemma":0.0007044906,"threshold_uncertainty_score":0.01011312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033702992,0.00015053307,0.96500266,0.000053668078,0.000031872944,0.000019355308,0.00003519672,0.00036625075,0.000637485],"genre_scores_gemma":[0.8712212,0.00019222025,0.12663345,0.000053318825,0.000045437173,0.000066911045,0.00013185956,0.00004339062,0.0016123017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997999,0.000046405785,0.000006191221,0.00004240206,0.000072181814,0.000032888936],"domain_scores_gemma":[0.99949396,0.00019088274,0.000055976976,0.000067096305,0.00016310632,0.000028928855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047902885,0.0003700298,0.00046188006,0.00024913155,0.00029159823,0.00031218602,0.00062697736,0.00029629166,0.0008423682],"category_scores_gemma":[0.0013952425,0.00021912028,0.00016931046,0.00047296102,0.0003004032,0.00062112726,0.0005505085,0.00079722505,0.00030508472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023606722,0.00007241524,0.0018781705,0.000027463902,0.0000383503,0.000043698165,0.000043183834,0.84835947,0.015190494,0.0032587422,0.0011572011,0.12969479],"study_design_scores_gemma":[0.000003364838,0.000021296953,0.0002605311,0.0000013568957,0.0000035921069,0.0000074313366,0.0000025988559,0.99729353,0.0019105185,0.00030432543,0.00018683315,0.0000046697614],"about_ca_topic_score_codex":0.002885133,"about_ca_topic_score_gemma":0.00467614,"teacher_disagreement_score":0.002885133,"about_ca_system_score_codex":0.00033643955,"about_ca_system_score_gemma":0.00083248114,"threshold_uncertainty_score":0.0057367682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59080195,0.002545964,0.3973567,0.00043478055,0.00003414984,0.000036903446,0.00009561187,0.00026995418,0.00842405],"genre_scores_gemma":[0.9952062,0.0004101779,0.0038079591,0.000026305202,0.000021096406,0.000016283859,0.000017372688,0.000011630226,0.00048300682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988555,0.0004964,0.00003351024,0.000094143004,0.00035806646,0.00016249118],"domain_scores_gemma":[0.9934429,0.0048561506,0.00060698146,0.0003076857,0.00070782244,0.000078534584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016489563,0.0008996397,0.0008425624,0.00070178503,0.00048601255,0.00092672993,0.0005067927,0.00084968517,0.00057707826],"category_scores_gemma":[0.009592476,0.00027009854,0.00030897075,0.0008335487,0.0011822787,0.0010569139,0.00086227007,0.00050221867,0.00020523806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008389246,0.00001585435,0.00131038,0.000048761864,0.00003300705,0.00015546357,0.00011984206,0.97241,0.0055964245,0.014158887,0.00014533965,0.0059221215],"study_design_scores_gemma":[0.000004706716,0.00006855534,0.0005282658,0.000009604466,0.0000148427835,0.000093615614,0.000033473876,0.9935867,0.0016942386,0.003833965,0.0001207697,0.000011399649],"about_ca_topic_score_codex":0.0022811682,"about_ca_topic_score_gemma":0.0012329973,"teacher_disagreement_score":0.0022811682,"about_ca_system_score_codex":0.0013918126,"about_ca_system_score_gemma":0.00057259324,"threshold_uncertainty_score":0.010098338},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025909029,0.000107127074,0.9720149,0.00008395312,0.000013463947,0.000020408334,0.000049288297,0.00038844082,0.0014134742],"genre_scores_gemma":[0.63327587,0.0002292334,0.3638748,0.00006757109,0.000045041765,0.00007672479,0.0002372964,0.00015753944,0.002035849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982743,0.00061195577,0.00014260532,0.00028225218,0.0005629506,0.00012589485],"domain_scores_gemma":[0.9964212,0.0017455933,0.0005014773,0.00077249546,0.00046104105,0.00009826865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017696426,0.0007637299,0.0008593447,0.0007314818,0.00030193906,0.0009006878,0.0005903181,0.00078275823,0.00068261963],"category_scores_gemma":[0.0075628073,0.00034609964,0.0004221659,0.0007996339,0.00086327054,0.0010453375,0.0015102273,0.00083182345,0.0004296213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027308596,0.000031717234,0.00072270643,0.00007144045,0.00005634174,0.00011252395,0.00008387308,0.87116796,0.030230485,0.03780514,0.00044204353,0.059002742],"study_design_scores_gemma":[0.0000117729705,0.000034685614,0.00009892571,0.000005938351,0.0000066732996,0.000046905872,0.0000046612654,0.9772828,0.013073809,0.008768112,0.0006524939,0.000013126836],"about_ca_topic_score_codex":0.00073189003,"about_ca_topic_score_gemma":0.00059039943,"teacher_disagreement_score":0.0017696426,"about_ca_system_score_codex":0.00055913423,"about_ca_system_score_gemma":0.0007095102,"threshold_uncertainty_score":0.009358883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42544922,0.0015073711,0.56016004,0.00087967457,0.00017419692,0.00020354158,0.0012146435,0.00084066833,0.009570699],"genre_scores_gemma":[0.98478854,0.00064929994,0.0112489695,0.000077456905,0.000054653778,0.000085860374,0.0004337261,0.00006232663,0.002599095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893934,0.00022621629,0.0000706655,0.0002445734,0.00032927463,0.0001900142],"domain_scores_gemma":[0.9895684,0.0071979235,0.0010580812,0.00046515875,0.0015104886,0.00019999495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018964732,0.00048500395,0.00064034504,0.0013134168,0.0005852347,0.0012104373,0.0012204847,0.0008973727,0.001858948],"category_scores_gemma":[0.010546334,0.00042762817,0.00035231852,0.0013614383,0.0010352697,0.0015975808,0.0007223179,0.00095049135,0.0004127932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031553852,0.000054603817,0.012440894,0.00012810409,0.000056797562,0.0006000864,0.00021246816,0.91716874,0.004968599,0.051722,0.0017824206,0.010549713],"study_design_scores_gemma":[0.000016671953,0.0000744116,0.0030955512,0.000024501605,0.000022527785,0.0004160673,0.0001460542,0.98214716,0.002614665,0.010335128,0.0010569326,0.00005043331],"about_ca_topic_score_codex":0.0027561476,"about_ca_topic_score_gemma":0.0017117595,"teacher_disagreement_score":0.0027561476,"about_ca_system_score_codex":0.0012685322,"about_ca_system_score_gemma":0.00052105635,"threshold_uncertainty_score":0.010029614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052300883,0.0001513205,0.9926844,0.00008450495,0.000024474632,0.00001950235,0.00006715089,0.00021417107,0.0015244648],"genre_scores_gemma":[0.24690032,0.0005999685,0.74690837,0.0001766628,0.000091605674,0.00008852464,0.0005152443,0.0001145723,0.004604762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.0001719821,0.00003578883,0.00005910121,0.00023773537,0.00005188645],"domain_scores_gemma":[0.9994041,0.00023511866,0.00004394168,0.00012639613,0.0001554834,0.000034929373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783133,0.00084717333,0.0008486895,0.00035206974,0.00029460105,0.00080703164,0.0005466859,0.00078101543,0.0023038974],"category_scores_gemma":[0.0016869314,0.00027084688,0.0004539789,0.00066059316,0.0005375686,0.0007006981,0.0011485136,0.00071894284,0.0014614251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017030015,0.00003798272,0.0004532731,0.0001990532,0.00006806573,0.0004382812,0.0001884702,0.58058375,0.036278185,0.157658,0.006446975,0.21747765],"study_design_scores_gemma":[0.00002003635,0.00004855592,0.000060732367,0.000012251257,0.000008901673,0.00018691941,0.0000133697495,0.96605986,0.008506309,0.020744184,0.004323353,0.00001552753],"about_ca_topic_score_codex":0.0012939193,"about_ca_topic_score_gemma":0.002220858,"teacher_disagreement_score":0.0023038974,"about_ca_system_score_codex":0.00053812715,"about_ca_system_score_gemma":0.0011561816,"threshold_uncertainty_score":0.007707298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028112147,0.00007932663,0.9963074,0.000058464848,0.00001650115,0.000021143751,0.000026035921,0.00020962441,0.00047040705],"genre_scores_gemma":[0.04622869,0.00012138363,0.951972,0.00005504632,0.000022278724,0.00008986875,0.00011943238,0.00002232611,0.0013690385],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991959,0.00020556687,0.000040717252,0.000098391094,0.00039720724,0.000062226405],"domain_scores_gemma":[0.9995078,0.00014263656,0.00006474376,0.000077142766,0.00018741375,0.000020358777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079549564,0.00062535447,0.00070583733,0.00049031916,0.0003048332,0.0005959072,0.00065551826,0.00057847623,0.0022745694],"category_scores_gemma":[0.001526364,0.00037468254,0.00037482366,0.00060009357,0.00040694338,0.00067546935,0.0007948141,0.0006250353,0.0016773543],"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.00039899963,0.00009934008,0.0009058333,0.0002904177,0.0000757399,0.00023034042,0.00033240984,0.23079467,0.08744655,0.06723147,0.007073062,0.60512125],"study_design_scores_gemma":[0.00006918478,0.00012922191,0.00034322112,0.000024861907,0.000011799267,0.0002904336,0.000029607987,0.9671641,0.016970566,0.008826475,0.0061074025,0.000033115066],"about_ca_topic_score_codex":0.0011662791,"about_ca_topic_score_gemma":0.0018626774,"teacher_disagreement_score":0.0022745694,"about_ca_system_score_codex":0.0004820732,"about_ca_system_score_gemma":0.0010953863,"threshold_uncertainty_score":0.0076091886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013993838,0.00050180213,0.97816044,0.00034264478,0.00014146382,0.000042578562,0.00005366617,0.00015328042,0.006610294],"genre_scores_gemma":[0.5648161,0.0012069909,0.42920882,0.0003210953,0.00032607748,0.00021289664,0.00020098641,0.00011145251,0.0035955945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.00022485403,0.00004783156,0.000052552186,0.00027849994,0.000048518403],"domain_scores_gemma":[0.99882835,0.00051442534,0.00013254944,0.00021055686,0.00025833567,0.000055800738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006824977,0.00044188558,0.00047832346,0.0006207672,0.00034631652,0.0007770786,0.0005717681,0.00072572567,0.0021092833],"category_scores_gemma":[0.0034358841,0.00017151119,0.00030446466,0.00091147877,0.00083714584,0.0015776505,0.00086227286,0.0012252225,0.000704358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011352,0.000033104894,0.00017397362,0.000104281346,0.000012383508,0.00020580589,0.000115146795,0.04771368,0.015662458,0.8809286,0.0014215865,0.05351555],"study_design_scores_gemma":[0.00007348837,0.00027030415,0.00029950976,0.000066225846,0.000017319593,0.00086516055,0.00005134197,0.5439088,0.017783027,0.41177717,0.024823364,0.000064337706],"about_ca_topic_score_codex":0.00018077868,"about_ca_topic_score_gemma":0.00018370169,"teacher_disagreement_score":0.0021092833,"about_ca_system_score_codex":0.0005615456,"about_ca_system_score_gemma":0.0003059282,"threshold_uncertainty_score":0.007056296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025857702,0.001100759,0.96725947,0.00023919859,0.00012498513,0.00004181155,0.000047773337,0.0004460894,0.004882237],"genre_scores_gemma":[0.53026426,0.0023671656,0.4576077,0.0004907541,0.00036995218,0.00012559105,0.0001707898,0.00016403968,0.008439784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911135,0.0002620517,0.00003627351,0.00007380457,0.00045090175,0.00006555294],"domain_scores_gemma":[0.99901605,0.0005544467,0.00007492308,0.0001467961,0.00017111574,0.000036631227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074488955,0.0008840574,0.0005950777,0.0004818722,0.00043218836,0.00062117906,0.00055586523,0.0005335288,0.0013420742],"category_scores_gemma":[0.0029884058,0.0002998881,0.00023191783,0.0007207951,0.0006872559,0.0006247245,0.0008281001,0.0007118162,0.00068799936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065635616,0.00011472619,0.0010200401,0.0005111734,0.00008488155,0.00080892764,0.0005403915,0.37038216,0.13465743,0.051273722,0.0042648045,0.4356854],"study_design_scores_gemma":[0.00002441973,0.00019934101,0.0006151975,0.00004734615,0.000024170151,0.00048720182,0.000052014057,0.91712844,0.06806813,0.008770249,0.004526114,0.00005723511],"about_ca_topic_score_codex":0.0010202972,"about_ca_topic_score_gemma":0.0016435103,"teacher_disagreement_score":0.0013420742,"about_ca_system_score_codex":0.00051900424,"about_ca_system_score_gemma":0.00054451183,"threshold_uncertainty_score":0.00448972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1836855,0.00080028345,0.8070573,0.0003903807,0.00007772214,0.00009946028,0.00019984212,0.00027931624,0.007410208],"genre_scores_gemma":[0.92262703,0.00020874965,0.074019015,0.00005263762,0.000028949076,0.00009148098,0.000084237334,0.00005296705,0.0028349014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990932,0.00024409256,0.00007408389,0.00021125076,0.0001651676,0.00021226736],"domain_scores_gemma":[0.9988397,0.0004664525,0.0001296911,0.00027652533,0.0002123684,0.00007529892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626899,0.00039107556,0.0007022681,0.00043149042,0.00075388286,0.0014511171,0.0014586181,0.0006665604,0.0031942376],"category_scores_gemma":[0.0031141173,0.00025440418,0.00038133972,0.0008556316,0.00078178575,0.0022061225,0.0021428852,0.00042072157,0.00041226935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005971603,0.00006431562,0.0021604286,0.0002538614,0.00007138377,0.0005180632,0.000405755,0.746995,0.034427457,0.14631574,0.0031258902,0.06506501],"study_design_scores_gemma":[0.000023438935,0.00005954149,0.0005879522,0.00002023289,0.000019519859,0.0001933777,0.00016064815,0.94196975,0.007611001,0.04551651,0.0038126349,0.000025393878],"about_ca_topic_score_codex":0.0013922633,"about_ca_topic_score_gemma":0.0016549866,"teacher_disagreement_score":0.0031942376,"about_ca_system_score_codex":0.0013369049,"about_ca_system_score_gemma":0.0008758477,"threshold_uncertainty_score":0.0106858015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95119286,0.00096485915,0.04331426,0.00037771135,0.00014072123,0.000060714334,0.00009029963,0.00078365405,0.0030748788],"genre_scores_gemma":[0.99716336,0.00012424545,0.0023824465,0.00003870234,0.00002920534,0.00000859326,0.000035281722,0.000033132572,0.00018491571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657476,0.0010674198,0.0002110529,0.00042840233,0.0012410185,0.00047731315],"domain_scores_gemma":[0.9754041,0.01822845,0.0015302489,0.0025687786,0.001932419,0.00033604147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026774155,0.0010090407,0.00054723903,0.0006530091,0.00075013883,0.0011445534,0.000986919,0.0007017533,0.0011253168],"category_scores_gemma":[0.019531632,0.00027466958,0.00036388726,0.0005784401,0.0008128707,0.003024365,0.0009617071,0.0010917926,0.00020497211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050330264,0.0024994279,0.023558207,0.0008536433,0.00041369663,0.00062664546,0.0005205076,0.5511602,0.18442099,0.0034967877,0.0015624278,0.22585444],"study_design_scores_gemma":[0.00007620698,0.003293693,0.01598799,0.000052120522,0.00021155164,0.0003025602,0.00021767002,0.8088608,0.16815725,0.001762897,0.0009983439,0.00007887276],"about_ca_topic_score_codex":0.0015705305,"about_ca_topic_score_gemma":0.0012730047,"teacher_disagreement_score":0.0026774155,"about_ca_system_score_codex":0.00063772645,"about_ca_system_score_gemma":0.0005068601,"threshold_uncertainty_score":0.014159679},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030735098,0.00034728934,0.96603286,0.000037279697,0.00006325037,0.000050473736,0.00005056021,0.0014619253,0.0012213613],"genre_scores_gemma":[0.46745148,0.0002482588,0.5295368,0.000084080915,0.00005276684,0.00007162247,0.00017241527,0.0000628937,0.0023196442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999514,0.00007633703,0.000030368426,0.00011500472,0.00020720185,0.00005713096],"domain_scores_gemma":[0.99971586,0.000044711924,0.000047425234,0.000057780304,0.00011771533,0.000016483427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038237026,0.0007636022,0.0006613107,0.00096963695,0.00026536814,0.00042001408,0.0009891842,0.00050939823,0.00073436496],"category_scores_gemma":[0.0009681678,0.00031871948,0.00046936402,0.00067944423,0.00015543212,0.0006394857,0.00068912376,0.0002763175,0.0006174316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032588976,0.000088488705,0.0050805877,0.00022956908,0.00010282486,0.00021506438,0.00012937705,0.021993931,0.089789465,0.0015842186,0.0012463927,0.8792143],"study_design_scores_gemma":[0.000107059524,0.0010142077,0.01268896,0.000060326925,0.00022304546,0.0027751522,0.0001628799,0.8545957,0.11009758,0.0021204017,0.016028311,0.00012636899],"about_ca_topic_score_codex":0.001930192,"about_ca_topic_score_gemma":0.002930721,"teacher_disagreement_score":0.001930192,"about_ca_system_score_codex":0.00020217897,"about_ca_system_score_gemma":0.00030671086,"threshold_uncertainty_score":0.0038378835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06235604,0.0003029076,0.9306916,0.00019889089,0.00006591948,0.000083344254,0.0002003157,0.000666989,0.0054339557],"genre_scores_gemma":[0.3128874,0.0002586897,0.6810781,0.0001586701,0.000037463415,0.000078530466,0.00045558548,0.00007403805,0.0049715615],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.000072727715,0.000022851817,0.00005263063,0.00019486793,0.000032942255],"domain_scores_gemma":[0.99961984,0.00009515868,0.000037797403,0.000112704205,0.000111226305,0.000023341732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025845846,0.00036619397,0.00038284005,0.00031815784,0.00027868143,0.00050346635,0.00076819153,0.0004053985,0.001413754],"category_scores_gemma":[0.0009846658,0.00025014978,0.0003426998,0.0004190311,0.00029874494,0.0006044872,0.00065223477,0.0008408529,0.00066809176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005972454,0.00009455356,0.0011123054,0.00031863814,0.00011052019,0.0005507721,0.00026417337,0.29980204,0.35570583,0.0860748,0.0037102117,0.25165895],"study_design_scores_gemma":[0.00006629209,0.0002444092,0.00040857244,0.00003051849,0.000050298928,0.000723304,0.00003353732,0.8783851,0.09932337,0.009185638,0.0115008205,0.00004813529],"about_ca_topic_score_codex":0.0014883328,"about_ca_topic_score_gemma":0.003290281,"teacher_disagreement_score":0.0014883328,"about_ca_system_score_codex":0.0003999088,"about_ca_system_score_gemma":0.0011682115,"threshold_uncertainty_score":0.0047295094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25513667,0.0007509936,0.7395337,0.00042163386,0.000057565994,0.000055818982,0.000090079324,0.0004126469,0.0035408149],"genre_scores_gemma":[0.9880434,0.00043606487,0.01071207,0.000047655507,0.000030035864,0.000053577514,0.000052529158,0.000046462686,0.00057825266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987205,0.0004631762,0.000044811495,0.00016309702,0.0004854091,0.00012311291],"domain_scores_gemma":[0.9957639,0.0027793862,0.000391838,0.0003108616,0.0006726449,0.00008131745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015574797,0.0009400213,0.0007893558,0.0011495979,0.0008090209,0.0009518707,0.0013200658,0.0010824238,0.00035868978],"category_scores_gemma":[0.008989132,0.0005041247,0.00030499892,0.0012413687,0.0010976023,0.0026738935,0.00082907715,0.0004957117,0.0001748395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038977178,0.00002455734,0.0012927894,0.000036621397,0.000011990214,0.00009920629,0.00010123669,0.97769654,0.0051864786,0.008175423,0.00018140988,0.007154818],"study_design_scores_gemma":[0.0000012125312,0.000012618078,0.00019374806,0.0000031905047,0.0000029992464,0.000033166307,0.000022993705,0.9955243,0.00087483437,0.0031997424,0.0001247272,0.000006536921],"about_ca_topic_score_codex":0.0021813563,"about_ca_topic_score_gemma":0.0015269448,"teacher_disagreement_score":0.0021813563,"about_ca_system_score_codex":0.0015486873,"about_ca_system_score_gemma":0.0005685634,"threshold_uncertainty_score":0.011236608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019653983,0.0056683687,0.94173604,0.00060508086,0.00016748741,0.000039385264,0.00019596936,0.00043875736,0.031494908],"genre_scores_gemma":[0.72661656,0.0077687646,0.24468063,0.00067212735,0.00034047302,0.00028050906,0.00042235077,0.0004840355,0.01873453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779665,0.00060367986,0.00009975433,0.00018210788,0.0010090708,0.00030873538],"domain_scores_gemma":[0.9908426,0.0063357786,0.00050361804,0.0008862017,0.0013507449,0.000081024904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030559842,0.0013954565,0.0008218799,0.0015118949,0.0005092545,0.0020488864,0.0012751118,0.0013992545,0.0035421231],"category_scores_gemma":[0.013812814,0.0004241117,0.00057746394,0.0014875974,0.0016866993,0.0025750312,0.0016159395,0.0019311483,0.0014102625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001511377,0.00006904631,0.0006223052,0.0006008203,0.000055093,0.0003744447,0.00034490693,0.6585475,0.011421095,0.26606163,0.0042013195,0.057550713],"study_design_scores_gemma":[0.000007069632,0.000043635086,0.00040761236,0.00016792378,0.000027133512,0.0002332983,0.000050314375,0.9161083,0.005585235,0.0726067,0.004729931,0.000032854605],"about_ca_topic_score_codex":0.0014390141,"about_ca_topic_score_gemma":0.0016258631,"teacher_disagreement_score":0.0035421231,"about_ca_system_score_codex":0.002983636,"about_ca_system_score_gemma":0.000798854,"threshold_uncertainty_score":0.02164787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019682797,0.00036553777,0.97718984,0.00020146466,0.000040141436,0.000026958887,0.00002065563,0.00005131945,0.0024214122],"genre_scores_gemma":[0.9503391,0.00053230464,0.045968805,0.00009099244,0.00009961907,0.00007298874,0.00003053754,0.00003245692,0.0028332768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914336,0.00023005958,0.00004671368,0.00023553349,0.00017835603,0.00016607606],"domain_scores_gemma":[0.99864155,0.0009603259,0.00015831669,0.00007439257,0.00010155892,0.00006388598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014534184,0.0011128963,0.00104986,0.00036643652,0.00055837113,0.001327916,0.0011488425,0.0010615309,0.0012485125],"category_scores_gemma":[0.002840317,0.00053158135,0.00068983476,0.0008207788,0.001208616,0.0018785346,0.0011137828,0.0012474314,0.0001609643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003077321,0.00010758399,0.0004744511,0.0002473789,0.000083643106,0.00047772672,0.00025046134,0.8220058,0.021876624,0.09102527,0.0010140991,0.062129173],"study_design_scores_gemma":[0.000014751068,0.000057420508,0.00008178669,0.0000050454087,0.00001324626,0.0000605477,0.000023509974,0.9815669,0.0013937664,0.016402898,0.00037018195,0.0000099300305],"about_ca_topic_score_codex":0.001395525,"about_ca_topic_score_gemma":0.0011984508,"teacher_disagreement_score":0.0014534184,"about_ca_system_score_codex":0.0009446816,"about_ca_system_score_gemma":0.00076709536,"threshold_uncertainty_score":0.007686496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027925035,0.00056302437,0.96701896,0.00020689747,0.000042245192,0.000039724535,0.000026005024,0.00007263996,0.0041054287],"genre_scores_gemma":[0.9511725,0.00044124812,0.045994725,0.000057612673,0.00004455768,0.00005799154,0.000021117163,0.000017019265,0.0021932581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996032,0.00014916415,0.000012247852,0.000067786335,0.00009428467,0.00007335863],"domain_scores_gemma":[0.99949,0.00030850348,0.00006485012,0.000041061092,0.0000768394,0.000018719991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801705,0.00070640625,0.00080936245,0.00023530785,0.00034786924,0.00087259535,0.0006982936,0.00074491865,0.00123853],"category_scores_gemma":[0.0019114037,0.00033172235,0.0004099782,0.00051995745,0.0007133241,0.00062697113,0.0006853986,0.0006903668,0.00021815259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000912288,0.000037569454,0.0002434915,0.00009463406,0.000031598298,0.00015137083,0.00006729421,0.95947593,0.005723175,0.013631791,0.0006762905,0.019775681],"study_design_scores_gemma":[0.0000084327385,0.000021101974,0.000045963872,0.00000313396,0.0000050300578,0.000032135205,0.000009453393,0.997825,0.00044787355,0.0013665097,0.0002327567,0.000002597827],"about_ca_topic_score_codex":0.0023329398,"about_ca_topic_score_gemma":0.0021355555,"teacher_disagreement_score":0.0023329398,"about_ca_system_score_codex":0.0005783739,"about_ca_system_score_gemma":0.0006169992,"threshold_uncertainty_score":0.004638672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32628086,0.0027190505,0.65729064,0.0006272122,0.000090198606,0.00015265244,0.0002010881,0.000460825,0.012177513],"genre_scores_gemma":[0.98934454,0.000760595,0.00895391,0.000046304853,0.000048641698,0.000040485374,0.000038500846,0.000027565795,0.0007394888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997661,0.0006886197,0.00007903806,0.00022519693,0.00077680004,0.0005692247],"domain_scores_gemma":[0.992246,0.0049251416,0.001042065,0.00063450786,0.00095689675,0.00019537612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027402407,0.0015135615,0.0013934525,0.0010419561,0.0009104212,0.0019334749,0.00097349647,0.0009226926,0.0015131788],"category_scores_gemma":[0.0129108075,0.00039864247,0.00049361156,0.0016998864,0.0015456959,0.0016812491,0.0016427869,0.0010629356,0.00034736618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035916647,0.00009111132,0.002104959,0.00012625787,0.00007439544,0.00028173806,0.00021868685,0.9175887,0.0078883935,0.046338513,0.0007649795,0.024163058],"study_design_scores_gemma":[0.000010839881,0.00007445784,0.00032486787,0.000011244143,0.000020536765,0.0001074785,0.000044078515,0.98945796,0.0018610032,0.007840613,0.00023401297,0.000012914879],"about_ca_topic_score_codex":0.00602329,"about_ca_topic_score_gemma":0.0042089056,"teacher_disagreement_score":0.00602329,"about_ca_system_score_codex":0.0020423701,"about_ca_system_score_gemma":0.0022080452,"threshold_uncertainty_score":0.01481849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07355768,0.0033795075,0.9158048,0.00058803445,0.00010999889,0.00009079069,0.00009326533,0.00038813514,0.0059878523],"genre_scores_gemma":[0.8927773,0.001918773,0.10018007,0.00016816697,0.00009980262,0.00013071674,0.00009167282,0.000064257736,0.004569267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.00032431853,0.000027693211,0.00010400323,0.00016196106,0.00008875622],"domain_scores_gemma":[0.9976331,0.0016756146,0.00018007158,0.00016235255,0.00029260604,0.000056347177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009987555,0.0005015865,0.00074012,0.00055684603,0.00071724737,0.0010273688,0.0011775387,0.001185019,0.0012580922],"category_scores_gemma":[0.0053351806,0.00035464356,0.00033700437,0.0010008443,0.00087861693,0.001473642,0.0007995714,0.0007603166,0.00021156398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020633821,0.000042651336,0.0009285419,0.00022875723,0.000054278302,0.00035283715,0.00018096513,0.8344948,0.008149049,0.09758307,0.0032680854,0.054510526],"study_design_scores_gemma":[0.000012405603,0.000032252803,0.00011184684,0.000009294841,0.000011716816,0.00008289341,0.000023110062,0.98350835,0.001004326,0.014006226,0.0011881421,0.000009495211],"about_ca_topic_score_codex":0.0038760386,"about_ca_topic_score_gemma":0.00209707,"teacher_disagreement_score":0.0038760386,"about_ca_system_score_codex":0.0017853872,"about_ca_system_score_gemma":0.00061503734,"threshold_uncertainty_score":0.012953937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22408813,0.00142293,0.7429686,0.0012690754,0.0002669494,0.00009092809,0.0006513869,0.0002350744,0.029006984],"genre_scores_gemma":[0.9774302,0.00075264147,0.015880432,0.00012391346,0.000072433955,0.000056453166,0.0001252006,0.000014798942,0.0055439305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867344,0.00040024015,0.00003289665,0.00016601077,0.0002899897,0.0004374573],"domain_scores_gemma":[0.99696773,0.0017462327,0.00032030695,0.00028946679,0.0005073921,0.000168974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014587367,0.0008819733,0.0011029416,0.0006365818,0.00070689485,0.001249479,0.0011268889,0.0016104362,0.0023688087],"category_scores_gemma":[0.003970001,0.00039317677,0.00047938403,0.0012402117,0.0020763227,0.0022472003,0.0015932787,0.0014091234,0.00045593962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006133167,0.00006084089,0.00080152403,0.00018240165,0.000057208606,0.0018742299,0.00017815101,0.40231907,0.005201502,0.5763301,0.0031749965,0.009206593],"study_design_scores_gemma":[0.00007635468,0.00010711547,0.00021410073,0.000020155692,0.000027182292,0.00033335533,0.00009733211,0.92112845,0.0011734617,0.07523952,0.0015304147,0.0000525454],"about_ca_topic_score_codex":0.0053160666,"about_ca_topic_score_gemma":0.0037108106,"teacher_disagreement_score":0.0053160666,"about_ca_system_score_codex":0.0014297304,"about_ca_system_score_gemma":0.0014096858,"threshold_uncertainty_score":0.010570288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053315643,0.0005794695,0.9387757,0.00071110204,0.00027361736,0.00014189289,0.00012113464,0.0007800277,0.00530146],"genre_scores_gemma":[0.7011445,0.00093967427,0.28919983,0.00028691426,0.00023493516,0.0002636509,0.00019229273,0.00018942637,0.0075487136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979563,0.00031201763,0.0001036202,0.00028655923,0.0011540806,0.00018739677],"domain_scores_gemma":[0.9976714,0.00080402754,0.00038124112,0.0006424992,0.00039476127,0.000106056614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009673467,0.00056125456,0.0006758313,0.000854991,0.0009329395,0.0012616364,0.0009031313,0.0010532321,0.0011913906],"category_scores_gemma":[0.0032787262,0.00031767835,0.00044145656,0.0009596495,0.00193096,0.0027566615,0.0016037212,0.0015136313,0.000605121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004910168,0.00013552592,0.00089700735,0.00034903645,0.000063475694,0.0009896022,0.0003387623,0.06516193,0.08641053,0.74943745,0.0031186317,0.09260699],"study_design_scores_gemma":[0.00032814953,0.0007471588,0.00058777025,0.00016310587,0.00014111518,0.0036109244,0.00010337044,0.5232189,0.2262555,0.19062878,0.0539485,0.0002667298],"about_ca_topic_score_codex":0.0004570063,"about_ca_topic_score_gemma":0.00030376212,"teacher_disagreement_score":0.0012616364,"about_ca_system_score_codex":0.0007410926,"about_ca_system_score_gemma":0.0017169775,"threshold_uncertainty_score":0.005377054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08695958,0.0015788302,0.8589406,0.0028842797,0.00034135336,0.0010547605,0.0016440746,0.00858087,0.038015768],"genre_scores_gemma":[0.46315035,0.00053124555,0.523913,0.00046695492,0.0001496905,0.00056235556,0.0027649957,0.00060587435,0.007855544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984706,0.0003089068,0.0000842633,0.000409962,0.00025045162,0.0004757856],"domain_scores_gemma":[0.99755436,0.0014988928,0.00023432857,0.00034207114,0.0001921483,0.00017816834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010400455,0.0019348392,0.0017645118,0.0010434919,0.0014050773,0.0025289766,0.0032250157,0.0020573402,0.013454237],"category_scores_gemma":[0.0046280175,0.00055989926,0.0010610254,0.0016656598,0.00091083156,0.0024454924,0.0018842985,0.0021306654,0.0034455636],"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.0017575623,0.0011757114,0.0018809033,0.001525493,0.00019216772,0.00037520198,0.0005642067,0.4265328,0.016073987,0.06464458,0.058352984,0.4269244],"study_design_scores_gemma":[0.0006010776,0.00023153007,0.0005196432,0.000052738025,0.0000611549,0.00026785926,0.000329247,0.92092365,0.0027063482,0.06753576,0.006741152,0.000029776334],"about_ca_topic_score_codex":0.0056998185,"about_ca_topic_score_gemma":0.008545438,"teacher_disagreement_score":0.013454237,"about_ca_system_score_codex":0.002983345,"about_ca_system_score_gemma":0.0044754194,"threshold_uncertainty_score":0.045008898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03711449,0.004907976,0.9174582,0.00051409105,0.00013795549,0.000071066315,0.00038012528,0.00054843747,0.038867693],"genre_scores_gemma":[0.9282161,0.007339603,0.051525183,0.00033591283,0.00035753078,0.00023851122,0.00042118243,0.00029727083,0.011268751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.0004387889,0.00007164918,0.00017244651,0.0009504144,0.00037593415],"domain_scores_gemma":[0.99416345,0.003405451,0.00047584865,0.00039573546,0.0014477666,0.0001117836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021098475,0.002022882,0.0012896212,0.0017499286,0.0007912778,0.002350011,0.0014803543,0.00095030613,0.0055325693],"category_scores_gemma":[0.0071474067,0.0006212803,0.001024079,0.0017649654,0.0013931175,0.0023284822,0.0014392327,0.0012976255,0.0019796488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020488264,0.000072705225,0.00063174474,0.0004732926,0.0000995601,0.0004461219,0.00032834208,0.7680244,0.020030593,0.18089162,0.00380378,0.024993002],"study_design_scores_gemma":[0.0000064707824,0.000054211916,0.0002704894,0.000051851963,0.000028243841,0.0002545573,0.000066192406,0.972473,0.0035157073,0.021879874,0.0013633079,0.00003605126],"about_ca_topic_score_codex":0.0030988937,"about_ca_topic_score_gemma":0.0020964046,"teacher_disagreement_score":0.0055325693,"about_ca_system_score_codex":0.002216857,"about_ca_system_score_gemma":0.001517093,"threshold_uncertainty_score":0.018508255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03315064,0.005697355,0.8953229,0.0008444564,0.00078804296,0.00017857348,0.0006198334,0.0007479721,0.06265026],"genre_scores_gemma":[0.6524518,0.0066690324,0.3083664,0.0008639633,0.0004248547,0.00032445733,0.0012722003,0.0002310082,0.029396351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939597,0.00008832633,0.00003657742,0.000082526814,0.00029558217,0.00010100843],"domain_scores_gemma":[0.99948776,0.00015549078,0.000061152365,0.00010161009,0.00017329684,0.000020727774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035400005,0.00050087745,0.0003137663,0.0006220227,0.00043564843,0.0009278401,0.0005124953,0.000684099,0.0051077893],"category_scores_gemma":[0.0020203884,0.00018496101,0.00037395352,0.0011255972,0.0005548029,0.00077631924,0.00071052066,0.00082023523,0.0014871733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015185661,0.00003562143,0.00038507336,0.00046474548,0.00003130151,0.00032268363,0.00013184074,0.04104053,0.033023704,0.7630358,0.0076317717,0.1537451],"study_design_scores_gemma":[0.00004631591,0.00013953155,0.00090975885,0.0002523214,0.000082833605,0.0010265663,0.000046092635,0.51405895,0.08395131,0.26189017,0.13749713,0.00009905814],"about_ca_topic_score_codex":0.0026488262,"about_ca_topic_score_gemma":0.0027058509,"teacher_disagreement_score":0.0051077893,"about_ca_system_score_codex":0.0016290047,"about_ca_system_score_gemma":0.001384196,"threshold_uncertainty_score":0.01708728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032183833,0.0017761983,0.96299314,0.00023610065,0.00012600876,0.000102436665,0.000069535905,0.0005851354,0.0019275341],"genre_scores_gemma":[0.8452938,0.002265302,0.14951897,0.00015823673,0.00014331711,0.00020410401,0.00011791654,0.00008573025,0.0022126262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875975,0.00045602754,0.00008797663,0.00021206221,0.0003573942,0.00012673576],"domain_scores_gemma":[0.9958191,0.0030607765,0.000284528,0.00041761648,0.00033562927,0.000082354985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015038828,0.001214025,0.0011459128,0.00051685504,0.0006606338,0.0007005215,0.0013161403,0.00060079485,0.001047902],"category_scores_gemma":[0.007299166,0.000497718,0.00039246786,0.00067007873,0.0009499635,0.0017464028,0.0009995998,0.000832064,0.0003302714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010067228,0.0002690544,0.0015763097,0.00062247034,0.00012042007,0.0007795251,0.0003622704,0.7191339,0.06513704,0.034912586,0.004300361,0.17177925],"study_design_scores_gemma":[0.000030491263,0.00043508533,0.00079801294,0.000042731484,0.00005726962,0.00032395823,0.000055054014,0.95540774,0.02678831,0.014350753,0.0016763456,0.000034255743],"about_ca_topic_score_codex":0.0009521827,"about_ca_topic_score_gemma":0.0026354087,"teacher_disagreement_score":0.0015038828,"about_ca_system_score_codex":0.0005596397,"about_ca_system_score_gemma":0.0012141162,"threshold_uncertainty_score":0.007953405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010136601,0.00011416531,0.9885182,0.000059868882,0.000010114732,0.000037178896,0.000012460237,0.00006814516,0.0010432058],"genre_scores_gemma":[0.74240017,0.00027390313,0.2561146,0.000079131685,0.000022182461,0.00027009548,0.000039781447,0.000043606167,0.00075647054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993088,0.00021971512,0.000032940123,0.00015090262,0.000211104,0.000076456214],"domain_scores_gemma":[0.99919444,0.0004233371,0.00013480397,0.000057630506,0.00016213574,0.000027589833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032529,0.0009609249,0.0007135087,0.000650512,0.00047321833,0.00089695724,0.0010182958,0.0008036704,0.000644561],"category_scores_gemma":[0.003509722,0.00058348285,0.00039868616,0.0006411475,0.00074256305,0.0008662835,0.00091066316,0.0006417646,0.00017942667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064769585,0.000050352533,0.0003182554,0.000079833524,0.000035365385,0.00003516092,0.00008462213,0.9360433,0.012039441,0.014738988,0.0005112794,0.035998482],"study_design_scores_gemma":[0.00000743795,0.000033395005,0.00008746967,0.000006009865,0.000006903328,0.000018804443,0.00001618247,0.99406767,0.0013795227,0.004082794,0.00028631778,0.000007533971],"about_ca_topic_score_codex":0.0019202012,"about_ca_topic_score_gemma":0.0023248042,"teacher_disagreement_score":0.0019202012,"about_ca_system_score_codex":0.0009473085,"about_ca_system_score_gemma":0.0015898728,"threshold_uncertainty_score":0.00687325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044145603,0.000039385606,0.9943387,0.000032433727,0.000010503544,0.000026262305,0.0000065714958,0.00018467348,0.00094701094],"genre_scores_gemma":[0.35444695,0.00017224925,0.64140403,0.000109464374,0.000049794868,0.00024834045,0.00007442892,0.00009658853,0.0033981935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998679,0.00041073287,0.00005687891,0.000120762255,0.0006180973,0.000114428025],"domain_scores_gemma":[0.9984945,0.0007453392,0.00016268516,0.00032355226,0.00023515683,0.00003865003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012836558,0.00093148113,0.00083637284,0.00064642815,0.0006216893,0.001128589,0.0012621381,0.0009520217,0.002612174],"category_scores_gemma":[0.0042498787,0.00033449664,0.00049937126,0.0008811577,0.00091487344,0.0013114567,0.00156742,0.0011775711,0.0012446584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040253866,0.0001330658,0.00080549053,0.00021803494,0.00009436877,0.00017331152,0.000394857,0.4827062,0.055342335,0.19885992,0.002080012,0.2587898],"study_design_scores_gemma":[0.0000145366175,0.000077799305,0.00004724215,0.000009292582,0.0000102042,0.000068773836,0.000011229429,0.9721605,0.014893308,0.0112017,0.0014903374,0.000015035639],"about_ca_topic_score_codex":0.0009133362,"about_ca_topic_score_gemma":0.0009311457,"teacher_disagreement_score":0.002612174,"about_ca_system_score_codex":0.00071329996,"about_ca_system_score_gemma":0.00083101646,"threshold_uncertainty_score":0.008738577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20954894,0.0018973774,0.7860835,0.00020586498,0.00006616948,0.00007799385,0.000045404686,0.00017602286,0.0018986878],"genre_scores_gemma":[0.97345996,0.00042006586,0.025483362,0.000030037463,0.000022539582,0.000039763352,0.0000142237,0.000011018101,0.0005190723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.0003036517,0.00002693328,0.000093483824,0.00008485426,0.00010387671],"domain_scores_gemma":[0.9977717,0.0017124643,0.0002137493,0.00009196829,0.00013876313,0.00007128752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228934,0.0007958823,0.0009329088,0.0005252478,0.0004970443,0.00080485595,0.0013271593,0.0007188986,0.0006355201],"category_scores_gemma":[0.0046027596,0.00034513455,0.00034195636,0.0005395732,0.0007132316,0.0016506872,0.00082527916,0.00046604997,0.00013078688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003057018,0.000071673494,0.0010564076,0.00014750777,0.000066881374,0.0004049806,0.00031936026,0.9332667,0.012597711,0.02281859,0.000482083,0.02846234],"study_design_scores_gemma":[0.000018319522,0.00009895047,0.00013860827,0.000006661183,0.000022487991,0.000073343384,0.00004571112,0.9944147,0.002051881,0.002844167,0.00027413364,0.000011001241],"about_ca_topic_score_codex":0.0011301801,"about_ca_topic_score_gemma":0.001083438,"teacher_disagreement_score":0.0013271593,"about_ca_system_score_codex":0.0005433596,"about_ca_system_score_gemma":0.0004742585,"threshold_uncertainty_score":0.0064992905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01866528,0.0002439775,0.97938836,0.00012779246,0.000015356323,0.000025670983,0.00002384325,0.00009517193,0.001414583],"genre_scores_gemma":[0.7417829,0.00048308534,0.25454953,0.00006891648,0.00004151511,0.00012109461,0.000050609848,0.00004617599,0.0028561396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993494,0.00029352232,0.000027602377,0.00008756146,0.00014308875,0.000098790806],"domain_scores_gemma":[0.99943775,0.000389341,0.00006833131,0.000044923163,0.000041215244,0.000018361749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092820305,0.00076148944,0.0010472399,0.00034239888,0.0004402259,0.0007047897,0.00070151925,0.0007050484,0.0010705716],"category_scores_gemma":[0.0025016682,0.00040274143,0.00022717415,0.0006778286,0.0006247765,0.0010578976,0.00082042644,0.0005845482,0.00027203787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015520219,0.00007167683,0.00027855334,0.00007945942,0.00002763686,0.00009959927,0.00009133538,0.88572174,0.0055998843,0.027558353,0.0013226167,0.07899398],"study_design_scores_gemma":[0.000015436546,0.000025745287,0.000043418935,0.0000022637655,0.000005860679,0.000024611252,0.000010645768,0.9896417,0.0015427431,0.008250664,0.0004324568,0.000004510936],"about_ca_topic_score_codex":0.0013633306,"about_ca_topic_score_gemma":0.0022992184,"teacher_disagreement_score":0.0013633306,"about_ca_system_score_codex":0.0007264446,"about_ca_system_score_gemma":0.00075070735,"threshold_uncertainty_score":0.005270779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037018545,0.001978544,0.92820424,0.0008955477,0.00059359893,0.000047032092,0.000069627684,0.00018888072,0.031003878],"genre_scores_gemma":[0.72938895,0.0026834598,0.253571,0.0009390835,0.00045404554,0.00011100361,0.00011749806,0.00007445944,0.01266055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972194,0.00006779349,0.000017525384,0.000048054444,0.00011036506,0.000034287066],"domain_scores_gemma":[0.9997352,0.000073893905,0.000041936655,0.00005053675,0.00007756003,0.000020852556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000311206,0.00042709085,0.00032520323,0.00041887973,0.00037785523,0.0008701386,0.00039394965,0.0006327827,0.0030414187],"category_scores_gemma":[0.0007101109,0.00015384174,0.00027948045,0.00052229105,0.0007454899,0.0014152654,0.0006135628,0.0008475177,0.00094005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018020795,0.00005163861,0.00039786843,0.00016540864,0.000019297044,0.00022898299,0.00020200528,0.012970599,0.11001267,0.77033544,0.0028407134,0.10259506],"study_design_scores_gemma":[0.00009704343,0.00050554395,0.000558666,0.00016717687,0.00005424308,0.0015035727,0.00014052994,0.48373985,0.14435232,0.26951393,0.09922571,0.00014146745],"about_ca_topic_score_codex":0.00011306197,"about_ca_topic_score_gemma":0.000101745034,"teacher_disagreement_score":0.0030414187,"about_ca_system_score_codex":0.00043395633,"about_ca_system_score_gemma":0.00019605324,"threshold_uncertainty_score":0.0101745725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03194093,0.00053026306,0.95496124,0.0007607564,0.00009461839,0.00005592397,0.0002512309,0.00021160021,0.011193299],"genre_scores_gemma":[0.93584454,0.0013866853,0.050459463,0.000371712,0.0001624661,0.00015249357,0.00020618924,0.000093380724,0.011323016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.0001373716,0.000021571339,0.00008069223,0.000097827186,0.00011689626],"domain_scores_gemma":[0.9995516,0.0001943001,0.000079197205,0.00003243175,0.00010433583,0.00003799021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078058837,0.00059725135,0.0006381022,0.00047716132,0.0006054704,0.0013796471,0.0014176854,0.0010877848,0.0017584992],"category_scores_gemma":[0.0011435742,0.0004383129,0.00066713075,0.00073023536,0.0007829406,0.0016018304,0.0008256347,0.0008237911,0.00045798538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018889743,0.000026101503,0.0006696922,0.000026615546,0.000016077112,0.000112882066,0.00006715178,0.91384804,0.0018149137,0.07879297,0.0008161794,0.0037904012],"study_design_scores_gemma":[0.0000014122168,0.0000071658937,0.0000960796,0.0000021526466,0.000002897791,0.000011847643,0.000012234645,0.9933848,0.00006857724,0.0061143828,0.00029418338,0.0000044049043],"about_ca_topic_score_codex":0.012339906,"about_ca_topic_score_gemma":0.0062673152,"teacher_disagreement_score":0.012339906,"about_ca_system_score_codex":0.0018013787,"about_ca_system_score_gemma":0.0011776009,"threshold_uncertainty_score":0.024536192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981758,0.00012223501,0.91839963,0.00024022548,0.000050091385,0.00012213271,0.0002879038,0.00073882757,0.010221264],"genre_scores_gemma":[0.53473634,0.00028239054,0.45767054,0.00016526262,0.000041286865,0.00024298728,0.0008400356,0.00021984262,0.0058013247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.0001854741,0.000039574163,0.00018433495,0.00025762492,0.0001634161],"domain_scores_gemma":[0.99856204,0.00033431637,0.00018994171,0.00046462443,0.0003308784,0.00011813201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166132,0.00068088813,0.0005404372,0.0009687311,0.00066666637,0.0010275254,0.0009407341,0.00076204626,0.0032786045],"category_scores_gemma":[0.0024054192,0.00027447744,0.0006085003,0.0010226079,0.00086347,0.0016114785,0.0023377447,0.0012081158,0.00069812225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024899328,0.00012686673,0.0013847287,0.00027785607,0.000050542123,0.00044633116,0.00031001726,0.27137914,0.041750725,0.52247715,0.008336803,0.15321095],"study_design_scores_gemma":[0.000041133022,0.00011754967,0.0002737511,0.000027692255,0.000019837018,0.00036774285,0.000092658105,0.80445516,0.021461936,0.16658959,0.0065036383,0.000049291462],"about_ca_topic_score_codex":0.0019687694,"about_ca_topic_score_gemma":0.0026727302,"teacher_disagreement_score":0.0032786045,"about_ca_system_score_codex":0.0010712021,"about_ca_system_score_gemma":0.001114339,"threshold_uncertainty_score":0.0109680295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31274396,0.0022719572,0.6512574,0.00062375504,0.00021357203,0.00013170885,0.00008976086,0.00056669395,0.03210123],"genre_scores_gemma":[0.94376194,0.0006630717,0.05333643,0.00006232128,0.000019136745,0.000042425763,0.00002517688,0.000018550269,0.0020709147],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998858,0.000023625098,0.000004911767,0.000020648607,0.00004714354,0.000017796072],"domain_scores_gemma":[0.9998217,0.00009524001,0.000029641946,0.000028549473,0.00001752762,0.000007376747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019233144,0.00024926674,0.00024139039,0.0001523565,0.00021935735,0.00046531865,0.0004034433,0.000506768,0.0014912175],"category_scores_gemma":[0.00056144904,0.0001300286,0.00017971809,0.00015270499,0.00034113467,0.00082107284,0.000663685,0.00046952354,0.00033397978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015274012,0.000103864215,0.00047614108,0.00045756163,0.00003522342,0.0003281392,0.00020238465,0.123722434,0.52507186,0.29809892,0.0014147058,0.049936026],"study_design_scores_gemma":[0.00005204654,0.00024396199,0.00023392953,0.000029050014,0.000021515605,0.0002390406,0.00003818297,0.6950545,0.2657586,0.019175699,0.019114338,0.000039101764],"about_ca_topic_score_codex":0.00020867687,"about_ca_topic_score_gemma":0.00020108408,"teacher_disagreement_score":0.0014912175,"about_ca_system_score_codex":0.0003125589,"about_ca_system_score_gemma":0.00018519291,"threshold_uncertainty_score":0.0049886107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048020866,0.0005043664,0.9334627,0.0005806283,0.000111727226,0.00007792969,0.00023168858,0.00010969461,0.016900454],"genre_scores_gemma":[0.93615836,0.0011183289,0.05765024,0.0002223981,0.00008159035,0.0001517694,0.00013203357,0.000018911951,0.004466376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.00045142154,0.000047702993,0.00016397475,0.00042370806,0.0002327131],"domain_scores_gemma":[0.9973086,0.0014657206,0.00032558272,0.00036241245,0.00041852088,0.00011908623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015345812,0.0005945941,0.0007489706,0.0005667447,0.0004991821,0.001015926,0.0009645613,0.0011518165,0.0015612318],"category_scores_gemma":[0.0040420643,0.00034715032,0.00036759218,0.0008399652,0.0021294085,0.0021863335,0.002089986,0.0014141849,0.0004299632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026658896,0.000033097338,0.0003662319,0.00014128625,0.000024806546,0.0009002235,0.00023289076,0.122623965,0.006503163,0.8553075,0.002350687,0.011249582],"study_design_scores_gemma":[0.00009604874,0.0001752523,0.00020431762,0.000052382908,0.000021004349,0.00077300426,0.0001098031,0.7556532,0.004238953,0.2337651,0.004835859,0.0000750465],"about_ca_topic_score_codex":0.0016644686,"about_ca_topic_score_gemma":0.0010944299,"teacher_disagreement_score":0.0016644686,"about_ca_system_score_codex":0.0008170242,"about_ca_system_score_gemma":0.0011389067,"threshold_uncertainty_score":0.008115709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12323754,0.00043639474,0.8711669,0.00014244296,0.000074407464,0.000059766757,0.000031032618,0.0007061604,0.004145353],"genre_scores_gemma":[0.61592805,0.00032349874,0.3787684,0.00014448882,0.00011486917,0.000052849668,0.00010013699,0.000055458706,0.0045122416],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000034361612,0.000010089711,0.000030507164,0.00011182612,0.000030868097],"domain_scores_gemma":[0.9997004,0.00008628217,0.00005795297,0.00007033434,0.00006915534,0.000015994456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002593523,0.00034352983,0.0003105359,0.00026824643,0.00023258413,0.0004972166,0.0005625327,0.00046782658,0.0011083606],"category_scores_gemma":[0.0004963183,0.00019439045,0.00021493221,0.000286478,0.00030176784,0.00054771284,0.00045439196,0.0005332065,0.00070190214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038207084,0.000096602176,0.0007704291,0.000083634906,0.00004007703,0.00017961877,0.00006783498,0.010617037,0.8570307,0.0073584053,0.000561389,0.12281215],"study_design_scores_gemma":[0.000041455023,0.00055812486,0.0013411684,0.000021146396,0.000041142463,0.0009169712,0.00004076117,0.3441165,0.6417926,0.0016961008,0.009394818,0.000039139082],"about_ca_topic_score_codex":0.00023157975,"about_ca_topic_score_gemma":0.0005334503,"teacher_disagreement_score":0.0011083606,"about_ca_system_score_codex":0.00017428026,"about_ca_system_score_gemma":0.00032195024,"threshold_uncertainty_score":0.0037077665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017075116,0.0003232904,0.9779398,0.00023215644,0.0000723281,0.000042700285,0.00007868253,0.00028603428,0.003949922],"genre_scores_gemma":[0.60718167,0.000977001,0.38473716,0.00033983518,0.00015293321,0.00026727686,0.00031404526,0.00008139815,0.00594876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.00019329163,0.000021675865,0.00006522333,0.00024041726,0.00007415468],"domain_scores_gemma":[0.99916875,0.00031109183,0.00012322163,0.00016256385,0.00020704693,0.000027379698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041067135,0.0006218437,0.000472701,0.00052629295,0.00031573686,0.00068686105,0.0006756413,0.00068259204,0.0009897258],"category_scores_gemma":[0.0023062,0.00021633973,0.0002453061,0.000853599,0.00064408913,0.0009919921,0.0009062928,0.0009610984,0.0005196923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005030914,0.00009633596,0.0005745067,0.00024825463,0.000063513464,0.00043169595,0.00019606997,0.5059478,0.045039576,0.22891031,0.004880768,0.21310806],"study_design_scores_gemma":[0.000023236998,0.00006897164,0.00009250796,0.000025271365,0.00001711096,0.00016146325,0.000015136056,0.9700209,0.0076753255,0.018091178,0.0037873157,0.000021565029],"about_ca_topic_score_codex":0.002269732,"about_ca_topic_score_gemma":0.0031271263,"teacher_disagreement_score":0.002269732,"about_ca_system_score_codex":0.00060370855,"about_ca_system_score_gemma":0.0006937208,"threshold_uncertainty_score":0.004513085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74021274,0.0005485868,0.23892996,0.00047005323,0.00007468125,0.000024384446,0.00009368074,0.0008907223,0.018755188],"genre_scores_gemma":[0.9920006,0.00005247344,0.006937508,0.00002242698,0.000009824664,0.0000052017012,0.000014897989,0.000009587205,0.0009476211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991155,0.000019750205,0.0000030093343,0.000014224778,0.00001903119,0.00003237293],"domain_scores_gemma":[0.9998282,0.00006832451,0.00002662639,0.000043136377,0.000020387144,0.0000133694375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014702506,0.00034979358,0.00019608147,0.00024288641,0.00029404377,0.00046382888,0.0003727006,0.0002878546,0.0016033944],"category_scores_gemma":[0.00036806174,0.00008244148,0.0000958149,0.00019655036,0.0002869126,0.0009353787,0.00032595842,0.00028871957,0.00016119468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089909777,0.00011265459,0.0014712601,0.0000918326,0.000044425473,0.0004442249,0.00016377452,0.4711934,0.22486705,0.11957219,0.003022687,0.17811738],"study_design_scores_gemma":[0.000038367867,0.00037902917,0.0010686249,0.000012356872,0.000023707991,0.00019604623,0.00006378464,0.8870245,0.057988852,0.046826463,0.00635507,0.000023154003],"about_ca_topic_score_codex":0.00070306665,"about_ca_topic_score_gemma":0.0013342617,"teacher_disagreement_score":0.0016033944,"about_ca_system_score_codex":0.000465621,"about_ca_system_score_gemma":0.00018328617,"threshold_uncertainty_score":0.0053638816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008368622,0.0018858387,0.97223604,0.00039074142,0.00009467713,0.000056821857,0.0001654908,0.00019672808,0.016605118],"genre_scores_gemma":[0.8649057,0.008819151,0.10940644,0.00059794245,0.0005968998,0.00031737713,0.00020019054,0.00013308972,0.015023329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937314,0.00013460698,0.000025305339,0.000068802,0.0002804752,0.000117740194],"domain_scores_gemma":[0.99931335,0.00028224,0.00009807588,0.00007358038,0.00021001839,0.000022822263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907189,0.0015031842,0.0010528648,0.0010053492,0.00064955646,0.001489426,0.0011996517,0.0011353381,0.0029850677],"category_scores_gemma":[0.0022881613,0.0005335995,0.0007588432,0.0011944819,0.0010522512,0.0017143127,0.0011616223,0.0014529292,0.0009704289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037073165,0.000045445697,0.0004233765,0.00030866222,0.000054980905,0.0007058678,0.00028216757,0.628097,0.011986633,0.33997598,0.0026025763,0.015480197],"study_design_scores_gemma":[0.0000051478823,0.000035173856,0.00018583206,0.000039030827,0.000018635836,0.00025704078,0.000056383487,0.9512489,0.00088626816,0.044691034,0.0025553408,0.000021145905],"about_ca_topic_score_codex":0.002744903,"about_ca_topic_score_gemma":0.002249403,"teacher_disagreement_score":0.0029850677,"about_ca_system_score_codex":0.0015007479,"about_ca_system_score_gemma":0.0011539035,"threshold_uncertainty_score":0.010888696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080837704,0.0011635551,0.9107631,0.00020714253,0.000095017545,0.00005950443,0.000046411842,0.00014167567,0.0066859513],"genre_scores_gemma":[0.95195735,0.0005267844,0.0459075,0.00006701101,0.00003022215,0.000055825785,0.0000321761,0.000008126412,0.0014151086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995803,0.00019214985,0.000012107101,0.00004994534,0.00010153347,0.000063915315],"domain_scores_gemma":[0.9996598,0.00014330403,0.00005195859,0.000048423248,0.000063636835,0.000032847245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036837714,0.00039484538,0.0003852127,0.00030257102,0.00039108042,0.00066612725,0.000696763,0.00040758477,0.0007151987],"category_scores_gemma":[0.00090359576,0.00021287921,0.0002365721,0.00040375974,0.00078545406,0.00076088664,0.0009307714,0.0003224168,0.00012671504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014395053,0.00003329064,0.0009946625,0.000064705244,0.00003384202,0.0002660757,0.00012323807,0.8457285,0.011835995,0.08833118,0.0014723154,0.050972197],"study_design_scores_gemma":[0.000012818253,0.000080295744,0.00025249764,0.000008024173,0.000011889434,0.0001226547,0.000047526042,0.9787023,0.0027290871,0.015534922,0.0024872303,0.000010773236],"about_ca_topic_score_codex":0.0021217251,"about_ca_topic_score_gemma":0.0025275466,"teacher_disagreement_score":0.0021217251,"about_ca_system_score_codex":0.00062988285,"about_ca_system_score_gemma":0.00046274826,"threshold_uncertainty_score":0.004570186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005329538,0.00023411779,0.99284244,0.000075328884,0.0000971438,0.000023981229,0.000023166125,0.00023113968,0.0011431174],"genre_scores_gemma":[0.31707832,0.001028615,0.6707455,0.0004198897,0.00033357617,0.00012004632,0.00019146499,0.00008307051,0.009999469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994235,0.00011298067,0.00004837165,0.00009724767,0.00025289063,0.00006502205],"domain_scores_gemma":[0.99952376,0.00011609248,0.00003834974,0.00008184977,0.00021276691,0.000027179958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556785,0.0006326203,0.00075955334,0.0004957398,0.00051490724,0.00068372424,0.0007669517,0.00097235956,0.0016222394],"category_scores_gemma":[0.0012927208,0.00033648897,0.0006302999,0.0004555877,0.00043254675,0.0012077315,0.0007556108,0.000949327,0.0009955643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061922695,0.00015103718,0.0019682061,0.00046001113,0.0003511147,0.0009812433,0.0003014017,0.29183593,0.23688196,0.08475972,0.006493634,0.3751966],"study_design_scores_gemma":[0.000036604168,0.00022129543,0.0003881079,0.00003317721,0.0001033435,0.00080145337,0.000023930628,0.93820614,0.04938373,0.0042507243,0.0064869085,0.00006453147],"about_ca_topic_score_codex":0.0008028693,"about_ca_topic_score_gemma":0.0015320939,"teacher_disagreement_score":0.0016222394,"about_ca_system_score_codex":0.00030008002,"about_ca_system_score_gemma":0.0010185004,"threshold_uncertainty_score":0.0054268837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16073906,0.0049208836,0.8069538,0.0039557456,0.00041206137,0.00036565083,0.0014546119,0.0005137992,0.020684483],"genre_scores_gemma":[0.9215947,0.0029456464,0.066794164,0.000691577,0.00045329586,0.0004754837,0.0007531098,0.00017028082,0.0061217356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666166,0.001455328,0.0001576721,0.0006747712,0.00042591087,0.0006247178],"domain_scores_gemma":[0.98200744,0.0150235575,0.00094842294,0.00046038616,0.00084833696,0.0007117586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039023685,0.0027491616,0.00326191,0.0013567067,0.0013969877,0.0031949102,0.0025872926,0.0025697912,0.0050561805],"category_scores_gemma":[0.019610647,0.0014133691,0.00091161515,0.0017316722,0.002826466,0.0047100484,0.0029639911,0.002380143,0.00078547874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014358524,0.00036124597,0.0016661413,0.00084032473,0.00024308354,0.00030483343,0.0004213613,0.84127223,0.002688385,0.09504009,0.009804993,0.045921497],"study_design_scores_gemma":[0.0001714834,0.00023913039,0.0004893034,0.00009653893,0.000060921884,0.00008756845,0.00015421509,0.8968135,0.0007435854,0.10001323,0.0010783962,0.000052115167],"about_ca_topic_score_codex":0.0040204423,"about_ca_topic_score_gemma":0.0032437625,"teacher_disagreement_score":0.0050561805,"about_ca_system_score_codex":0.0019674168,"about_ca_system_score_gemma":0.0030754267,"threshold_uncertainty_score":0.020637989},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2341533,0.0026442495,0.7548185,0.00033948093,0.00008285173,0.000035604025,0.000051027702,0.00016880166,0.0077062394],"genre_scores_gemma":[0.9932017,0.00052043214,0.005460007,0.00003509212,0.000042113512,0.000018465937,0.0000066165485,0.0000060440593,0.00070953026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988024,0.00053792796,0.000034900324,0.00014311794,0.0002846886,0.00019689361],"domain_scores_gemma":[0.997442,0.0018787063,0.00032106106,0.00009829017,0.00019626893,0.00006369543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150573,0.000816295,0.0008803252,0.00044065082,0.0005919179,0.0010022918,0.001016982,0.0007272984,0.00039997496],"category_scores_gemma":[0.0037230914,0.0004027424,0.00045828475,0.0008059603,0.0011952553,0.0010942692,0.0007234349,0.00044003795,0.00013152463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021071442,0.000051210052,0.00180559,0.00011956031,0.00008641618,0.00070761086,0.00026982726,0.94610864,0.00823199,0.023707652,0.000427449,0.018273426],"study_design_scores_gemma":[0.000010078281,0.00008701799,0.00034379182,0.0000062450013,0.000029992389,0.00018533075,0.0000446636,0.99370766,0.00078167446,0.004588337,0.00020516789,0.000009999068],"about_ca_topic_score_codex":0.002257032,"about_ca_topic_score_gemma":0.0020960565,"teacher_disagreement_score":0.002257032,"about_ca_system_score_codex":0.000785816,"about_ca_system_score_gemma":0.0005359943,"threshold_uncertainty_score":0.005897045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23615132,0.0008551922,0.75246626,0.0003676908,0.00014089768,0.00012583015,0.000105494175,0.0011580414,0.008629297],"genre_scores_gemma":[0.8740977,0.00027509042,0.12131492,0.0001708225,0.00005070224,0.00006852409,0.00009400854,0.00006122352,0.0038669396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.00017658662,0.000028912928,0.00006325363,0.0002609582,0.00013008901],"domain_scores_gemma":[0.998264,0.00040474127,0.00030328034,0.00054088363,0.0004200864,0.00006702569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004339046,0.0006318228,0.000489595,0.0008246023,0.0005269455,0.000630735,0.001012587,0.0007833656,0.0014576467],"category_scores_gemma":[0.0029319727,0.00014715297,0.00026422198,0.00088707055,0.0005751426,0.001181785,0.0010576169,0.00062413974,0.00038272253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015113547,0.00026005498,0.002572954,0.0002697617,0.00011241099,0.00093745586,0.0006069491,0.10161717,0.15594034,0.073275685,0.0048175827,0.6580782],"study_design_scores_gemma":[0.000099381046,0.00056881324,0.0015711429,0.00009216911,0.00005854469,0.0017326362,0.0001087572,0.7959976,0.15957285,0.023236005,0.016853392,0.00010871158],"about_ca_topic_score_codex":0.001959314,"about_ca_topic_score_gemma":0.002067183,"teacher_disagreement_score":0.001959314,"about_ca_system_score_codex":0.0006919051,"about_ca_system_score_gemma":0.0006664314,"threshold_uncertainty_score":0.0050201416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09196469,0.0007347234,0.9030624,0.000074109026,0.00001742938,0.000021199186,0.000011633146,0.00020720999,0.00390659],"genre_scores_gemma":[0.7725246,0.00081218197,0.22466153,0.000045762787,0.000031837655,0.00003566192,0.000026361591,0.000044314438,0.0018177211],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999742,0.00008809726,0.000009155123,0.000025348836,0.00011066122,0.000024697507],"domain_scores_gemma":[0.99943095,0.00034994353,0.00009567918,0.000062051324,0.000049392955,0.000011870689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035336096,0.00046134257,0.0003044844,0.00032979503,0.0001983863,0.0004526027,0.0003351673,0.00038083128,0.00084691704],"category_scores_gemma":[0.0011998581,0.00018805671,0.00017895168,0.0005521549,0.0004783782,0.000568806,0.00038363156,0.00037716553,0.00036784617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004065361,0.00014217361,0.0021079988,0.0003875726,0.000061358456,0.00027964782,0.00033286115,0.20560093,0.4771767,0.057059485,0.00055638456,0.25588828],"study_design_scores_gemma":[0.000017313272,0.00036510872,0.000864975,0.00003687557,0.000026618369,0.00042423388,0.000043710836,0.7626746,0.22348459,0.008755229,0.003278582,0.000028109987],"about_ca_topic_score_codex":0.00016218788,"about_ca_topic_score_gemma":0.00041558192,"teacher_disagreement_score":0.00084691704,"about_ca_system_score_codex":0.00021712108,"about_ca_system_score_gemma":0.0002874756,"threshold_uncertainty_score":0.0028332472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115703,0.0004667336,0.8813752,0.00010809177,0.000021791524,0.000042492506,0.00003488132,0.00032101118,0.0019267632],"genre_scores_gemma":[0.8871598,0.00022582951,0.1117311,0.000031676,0.000015860514,0.000032767046,0.000045382087,0.000022373886,0.0007352515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958736,0.0001870253,0.00001617962,0.00006817034,0.00009186919,0.00004932202],"domain_scores_gemma":[0.99949145,0.00026519128,0.00009590267,0.00007141666,0.00004873724,0.000027306387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045885213,0.0005548973,0.00048924,0.00032463638,0.00028335364,0.0003257708,0.0005956841,0.0004946419,0.0003351689],"category_scores_gemma":[0.0015754183,0.00024935874,0.00024195194,0.00046234392,0.0003718564,0.00047454977,0.0005877435,0.00025148585,0.00012867087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100006975,0.000030316576,0.0006205286,0.000032130378,0.000013734728,0.00011476676,0.00004817227,0.9325705,0.010260877,0.002869786,0.00050203217,0.052837122],"study_design_scores_gemma":[0.0000078092435,0.00007646314,0.000272809,0.0000027399326,0.0000064644655,0.00010082139,0.00002067205,0.9939719,0.0036561922,0.0015567681,0.00032173615,0.000005565483],"about_ca_topic_score_codex":0.0015687317,"about_ca_topic_score_gemma":0.0018500659,"teacher_disagreement_score":0.0015687317,"about_ca_system_score_codex":0.00042693067,"about_ca_system_score_gemma":0.00039011062,"threshold_uncertainty_score":0.0031192303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08260022,0.0015871155,0.9027005,0.00038984214,0.00011167269,0.0000847774,0.000042923286,0.00018865959,0.012294369],"genre_scores_gemma":[0.9009209,0.0007658743,0.09532821,0.00013819158,0.000067375215,0.000060287715,0.000042778902,0.000036119523,0.0026402813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995864,0.0001642491,0.000014974594,0.00003585893,0.00012952357,0.00006898095],"domain_scores_gemma":[0.9993563,0.000439201,0.000052072068,0.000051700947,0.000075391195,0.000025269439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044134882,0.0002924312,0.00044915846,0.00033416678,0.000612898,0.00048897095,0.00040877215,0.000464897,0.001615552],"category_scores_gemma":[0.0016756624,0.00014481791,0.00029441994,0.00040717542,0.0006585976,0.00084100035,0.0008890015,0.00054705155,0.00041036317],"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.0012156332,0.00008641378,0.0028211104,0.00030204502,0.000080922386,0.00086240977,0.0008591823,0.5873776,0.061964605,0.13682404,0.004684027,0.20292203],"study_design_scores_gemma":[0.000026807511,0.0001574003,0.00036628297,0.00002242769,0.000019138815,0.00023810157,0.00010254674,0.9806474,0.009207138,0.0061052553,0.003079762,0.000027783411],"about_ca_topic_score_codex":0.0024723173,"about_ca_topic_score_gemma":0.0027200268,"teacher_disagreement_score":0.0024723173,"about_ca_system_score_codex":0.0004002223,"about_ca_system_score_gemma":0.00057300215,"threshold_uncertainty_score":0.0054045916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007958101,0.0006087596,0.9870206,0.00012225722,0.000084207226,0.000051122504,0.000062531195,0.00024091505,0.0038515525],"genre_scores_gemma":[0.41430813,0.0015002491,0.57459503,0.00046780152,0.00014260529,0.00022020268,0.00024303072,0.0001062731,0.008416678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806875,0.0006555817,0.00008603823,0.00031866296,0.00064673764,0.00022428313],"domain_scores_gemma":[0.99654454,0.0016429643,0.00038167,0.0005627773,0.00079501886,0.00007298874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249754,0.0011331728,0.0006970788,0.0011227807,0.0006584768,0.0017137097,0.0006330684,0.0012504566,0.0022290822],"category_scores_gemma":[0.008292849,0.00034712718,0.00036598337,0.0014843125,0.0013909917,0.0018581871,0.0017640246,0.0012077373,0.0015909388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018567871,0.00011014793,0.001783682,0.00054667454,0.00009124942,0.00046175157,0.0003926148,0.21112621,0.087226644,0.36025634,0.0052919714,0.33085585],"study_design_scores_gemma":[0.00009586252,0.0003287802,0.00036921713,0.00011785636,0.000047609785,0.0010350853,0.00007663613,0.7763378,0.078387275,0.12631702,0.016767794,0.00011905507],"about_ca_topic_score_codex":0.001135535,"about_ca_topic_score_gemma":0.00073965825,"teacher_disagreement_score":0.0022290822,"about_ca_system_score_codex":0.00061671174,"about_ca_system_score_gemma":0.0011445001,"threshold_uncertainty_score":0.0074570775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3569077,0.00747659,0.5884194,0.0027939866,0.000223118,0.00018847598,0.0016835906,0.0011118508,0.041195273],"genre_scores_gemma":[0.9254715,0.0026115598,0.06730787,0.00029011018,0.000251466,0.000218461,0.0009045393,0.0002478372,0.0026966755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982994,0.00030423608,0.00012203651,0.0003241187,0.0006542949,0.0002960033],"domain_scores_gemma":[0.9577822,0.03657954,0.00137745,0.0023068397,0.0012940969,0.0006599026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018505746,0.001123338,0.0010883859,0.001591223,0.0010328133,0.0020943098,0.0015892545,0.0012832523,0.0022595893],"category_scores_gemma":[0.021113886,0.0006019945,0.00083842914,0.0011418719,0.0022489533,0.003132637,0.002269418,0.0025326142,0.00038197133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094619615,0.0003480305,0.014534376,0.0014426921,0.00024260694,0.0014040677,0.00075280695,0.46709678,0.082767315,0.32320973,0.008383648,0.09887175],"study_design_scores_gemma":[0.000043676762,0.00015705089,0.0036035655,0.00016987453,0.000078496734,0.00088924915,0.00016610787,0.72365093,0.029033998,0.23895635,0.0031683852,0.00008229016],"about_ca_topic_score_codex":0.0006876594,"about_ca_topic_score_gemma":0.0010890124,"teacher_disagreement_score":0.0022595893,"about_ca_system_score_codex":0.0013052716,"about_ca_system_score_gemma":0.0008880384,"threshold_uncertainty_score":0.009786904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01400504,0.0032585524,0.95201904,0.0006478545,0.00026672898,0.00012502767,0.00066763,0.0007157888,0.028294278],"genre_scores_gemma":[0.5389808,0.01010358,0.42006487,0.00085757335,0.00040539214,0.0005628146,0.0014714032,0.0008083801,0.026745202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988525,0.00033439067,0.00006381337,0.000102335885,0.0005518399,0.000095141324],"domain_scores_gemma":[0.9962775,0.0017058394,0.00042527355,0.0002878862,0.0012694162,0.000034037083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020681235,0.001280859,0.00091487996,0.0012710552,0.0006568315,0.0016981539,0.00096445665,0.0012686653,0.011948966],"category_scores_gemma":[0.008057203,0.00035179406,0.0006284482,0.0011589874,0.0008801512,0.0019850498,0.00084279454,0.0012939778,0.0041627497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001530097,0.000140889,0.00088565325,0.0011174628,0.00005937503,0.00050676457,0.00052569265,0.70039606,0.019192802,0.17655951,0.013626892,0.086835876],"study_design_scores_gemma":[0.000016607455,0.00008895823,0.0005850931,0.00017940775,0.00002481745,0.00045911697,0.00010029188,0.9362616,0.006379402,0.048290282,0.00755964,0.000054893873],"about_ca_topic_score_codex":0.0011779588,"about_ca_topic_score_gemma":0.0016645096,"teacher_disagreement_score":0.011948966,"about_ca_system_score_codex":0.0012082354,"about_ca_system_score_gemma":0.00097140623,"threshold_uncertainty_score":0.03997332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3651822,0.0022780052,0.61674905,0.00082114467,0.000084696774,0.00011085082,0.00017169926,0.0002199427,0.014382402],"genre_scores_gemma":[0.9896437,0.000621483,0.008531272,0.00007730539,0.00003673258,0.000053441767,0.000035310255,0.000014501876,0.0009863155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985581,0.00077064324,0.00003484583,0.00010217107,0.00031448764,0.00021973313],"domain_scores_gemma":[0.99253875,0.005769026,0.00062459323,0.00030870503,0.0005917876,0.00016702997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022190593,0.0012590578,0.00085952523,0.00065834506,0.00036909844,0.0010371484,0.00082345953,0.000729192,0.00095520116],"category_scores_gemma":[0.008236608,0.0002668376,0.0003438401,0.0012410164,0.0019306254,0.0010028821,0.0013083128,0.0006382932,0.00016335984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011225024,0.000017206436,0.00066323,0.00011759283,0.000048663704,0.00043730685,0.0002205383,0.8879448,0.004031181,0.09864161,0.0007957413,0.006969923],"study_design_scores_gemma":[0.000015507565,0.000055325916,0.00025212116,0.000015290192,0.000014144543,0.00011778215,0.000033282766,0.96414244,0.00059046794,0.034434088,0.00031483572,0.000014667768],"about_ca_topic_score_codex":0.0025885443,"about_ca_topic_score_gemma":0.0016015245,"teacher_disagreement_score":0.0025885443,"about_ca_system_score_codex":0.0014022907,"about_ca_system_score_gemma":0.00074847473,"threshold_uncertainty_score":0.011735678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21033606,0.005740138,0.73051274,0.0012351548,0.00017894106,0.0000840248,0.00046536457,0.00044762425,0.05099984],"genre_scores_gemma":[0.98518723,0.0028202243,0.009299612,0.00012999435,0.00014718046,0.000035476172,0.00010195786,0.000056252808,0.0022221678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.00050031976,0.00004337356,0.000132045,0.000377681,0.00028319252],"domain_scores_gemma":[0.9949292,0.003500888,0.0005232199,0.0003876926,0.0005923045,0.00006681051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019889078,0.001637097,0.0009698134,0.0010783857,0.0008174248,0.0015242731,0.0005271547,0.00076451927,0.0027471543],"category_scores_gemma":[0.00726372,0.00036203413,0.0005638658,0.0014135069,0.0021386172,0.0019890307,0.0013483237,0.001023531,0.00068758475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018529172,0.000024440144,0.0008773729,0.00018387694,0.00004961059,0.0002571331,0.00015901632,0.87358594,0.006503787,0.107698545,0.00096892787,0.00950614],"study_design_scores_gemma":[0.0000057061256,0.000056985264,0.00029213555,0.000027255137,0.000018238423,0.00013723885,0.00005760318,0.9824159,0.0028264353,0.013622643,0.0005174506,0.0000224182],"about_ca_topic_score_codex":0.0028061222,"about_ca_topic_score_gemma":0.0016612255,"teacher_disagreement_score":0.0028061222,"about_ca_system_score_codex":0.0014808733,"about_ca_system_score_gemma":0.0010860711,"threshold_uncertainty_score":0.010744572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1273107,0.00040434007,0.85771143,0.00028446584,0.00019261969,0.00014667952,0.000095987125,0.001092231,0.01276158],"genre_scores_gemma":[0.5446912,0.000581103,0.44330287,0.00019959078,0.000066364584,0.00011359734,0.00024668913,0.0001541749,0.010644403],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996308,0.00006793408,0.00003083997,0.000042602565,0.00016378493,0.000064010106],"domain_scores_gemma":[0.99839693,0.00048699963,0.0001519884,0.00032526796,0.00057007774,0.000068666785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058549916,0.0007517425,0.00044674697,0.00062995485,0.00070396374,0.000921758,0.00070487737,0.0005702668,0.0024264858],"category_scores_gemma":[0.0030299618,0.00031438313,0.00030835127,0.0003904918,0.0007904713,0.0014291559,0.0010105695,0.0008838835,0.0012432951],"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.0012116239,0.00021227523,0.003123742,0.0004143945,0.000080092235,0.0007590755,0.000610709,0.09945518,0.41151202,0.10507818,0.002712205,0.37483057],"study_design_scores_gemma":[0.000086378575,0.0003633859,0.0005637256,0.00006197496,0.000053166437,0.0009163364,0.00012507424,0.40240836,0.56404805,0.019614382,0.011686086,0.00007304183],"about_ca_topic_score_codex":0.0014800429,"about_ca_topic_score_gemma":0.0031568334,"teacher_disagreement_score":0.0024264858,"about_ca_system_score_codex":0.0004849025,"about_ca_system_score_gemma":0.0016755658,"threshold_uncertainty_score":0.008117378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19171989,0.0026073921,0.79964495,0.00071747776,0.000200732,0.00010292279,0.00016243377,0.00024317128,0.0046010897],"genre_scores_gemma":[0.94403434,0.0007325766,0.052993473,0.00008909919,0.000120605015,0.0000650892,0.00008499618,0.000046759113,0.0018329645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788755,0.0010610545,0.00008446931,0.0002813864,0.00033375496,0.0003517159],"domain_scores_gemma":[0.9964361,0.0024971743,0.0003952841,0.00018619087,0.00020877003,0.000276444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028347783,0.0008893564,0.0015556981,0.0006446882,0.0010147116,0.001607397,0.001343749,0.0011455547,0.0008720235],"category_scores_gemma":[0.00726077,0.0005606143,0.00042005553,0.0018186286,0.0008062995,0.0016809801,0.0011881624,0.0009206311,0.00017483134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016675211,0.000044507295,0.0006346371,0.00005852115,0.00002293877,0.000115829454,0.000039229035,0.97227174,0.0010059733,0.009232053,0.00064364553,0.01576418],"study_design_scores_gemma":[0.000016689288,0.000029352439,0.0001400321,0.0000030130334,0.0000051587176,0.000025747386,0.000021683169,0.9931698,0.00036320664,0.005766396,0.0004543531,0.0000045388706],"about_ca_topic_score_codex":0.0061612786,"about_ca_topic_score_gemma":0.0040859813,"teacher_disagreement_score":0.0061612786,"about_ca_system_score_codex":0.0015072377,"about_ca_system_score_gemma":0.0012806271,"threshold_uncertainty_score":0.014991939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082806975,0.001338829,0.91212463,0.00033906344,0.00008924561,0.00004513324,0.000026500045,0.00020353693,0.0030260512],"genre_scores_gemma":[0.9510033,0.00043851466,0.047764566,0.000056476496,0.000039711216,0.00003302738,0.000024848508,0.00001907674,0.00062041584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.0001896146,0.000014910034,0.000036262616,0.00008803378,0.000087202294],"domain_scores_gemma":[0.99962604,0.00015175101,0.000048447848,0.0000487851,0.00007426017,0.000050636256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074895914,0.00041042358,0.00053866213,0.00033233993,0.00048059926,0.0006481116,0.00084458606,0.00042964748,0.000323217],"category_scores_gemma":[0.001154687,0.00013858234,0.00031521352,0.00045595696,0.0003926402,0.00082585064,0.00067696103,0.0004886846,0.000041247666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020404559,0.00013001246,0.0017046795,0.00014600823,0.00010389189,0.00059228204,0.00012514259,0.74485725,0.040711895,0.10942294,0.0043048244,0.09769701],"study_design_scores_gemma":[0.0000040729515,0.000018456158,0.00008294526,0.0000019157562,0.0000092102955,0.000040452174,0.000012817118,0.99483657,0.0013230828,0.0032333515,0.0004330153,0.000004073627],"about_ca_topic_score_codex":0.0039134813,"about_ca_topic_score_gemma":0.0052279932,"teacher_disagreement_score":0.0039134813,"about_ca_system_score_codex":0.0011365641,"about_ca_system_score_gemma":0.0010683271,"threshold_uncertainty_score":0.008246422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10091687,0.002391597,0.890219,0.00045845148,0.000082921986,0.000040600687,0.000053071177,0.00013193117,0.005705559],"genre_scores_gemma":[0.9689205,0.0014295018,0.027047323,0.00006179613,0.0000588368,0.000057369303,0.000028372955,0.00001302877,0.0023831904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995097,0.00028041963,0.0000106955085,0.000050667215,0.00009976096,0.000048774586],"domain_scores_gemma":[0.9991788,0.0006161961,0.000087237386,0.000045544486,0.000054141205,0.000017974457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272203,0.0006051868,0.0004858838,0.0003618275,0.000274196,0.0006061988,0.00048248903,0.000613597,0.0008771064],"category_scores_gemma":[0.0016542863,0.00022400485,0.00029609315,0.00044614737,0.00050310796,0.00077385636,0.00052519946,0.00029737497,0.00024278868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013148984,0.000045325723,0.0012469211,0.00011718058,0.00007115147,0.0004752807,0.00013445536,0.8973092,0.014831758,0.059461266,0.0009499809,0.025226016],"study_design_scores_gemma":[0.000015146555,0.00008417758,0.00030223827,0.000007690144,0.00001664482,0.0001875393,0.000034752837,0.9865594,0.0018211827,0.009629532,0.0013303773,0.000011338297],"about_ca_topic_score_codex":0.0005991585,"about_ca_topic_score_gemma":0.0005396308,"teacher_disagreement_score":0.0008771064,"about_ca_system_score_codex":0.00043281756,"about_ca_system_score_gemma":0.00023235737,"threshold_uncertainty_score":0.0033171177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039152384,0.0003769088,0.9570278,0.00036371744,0.00003990786,0.000022692497,0.000015515398,0.00019342077,0.002807672],"genre_scores_gemma":[0.9604143,0.00019168435,0.03720227,0.00014663656,0.000037461512,0.00004249344,0.000020128839,0.00002168987,0.001923314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979776,0.00006009891,0.000008669289,0.000040963107,0.0000452798,0.000047196118],"domain_scores_gemma":[0.99931777,0.00039308047,0.00009562392,0.000034300672,0.000116617106,0.000042541244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062747236,0.00070134114,0.0008331847,0.00029896066,0.00028393074,0.00054709276,0.0009281982,0.0009881661,0.000848508],"category_scores_gemma":[0.0017713197,0.0003413769,0.00030783817,0.00023914676,0.0008507598,0.0008613413,0.00079692353,0.0011821858,0.00011051039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000333202,0.000029006464,0.0003954431,0.0000279461,0.000023316728,0.000044335193,0.000033488788,0.9758951,0.0014562052,0.0062073497,0.00027366937,0.015580709],"study_design_scores_gemma":[0.0000021435774,0.000008801147,0.000019934212,0.0000014088147,0.0000021332908,0.0000031450093,0.0000015508998,0.9987413,0.00009706115,0.001067985,0.000053137213,0.0000013402808],"about_ca_topic_score_codex":0.004025429,"about_ca_topic_score_gemma":0.00273145,"teacher_disagreement_score":0.004025429,"about_ca_system_score_codex":0.00063251954,"about_ca_system_score_gemma":0.0007931155,"threshold_uncertainty_score":0.00800401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012822982,0.00006233821,0.9977174,0.000056065102,0.000017265982,0.000024650384,0.000018400728,0.00016993847,0.00065155106],"genre_scores_gemma":[0.053000674,0.00016974578,0.9441545,0.00011056931,0.000044286073,0.00022409415,0.0001832114,0.00007690443,0.002035958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.0002210691,0.000041635696,0.000099920944,0.0002406606,0.000047941678],"domain_scores_gemma":[0.99906427,0.00046585334,0.00007316017,0.00012939186,0.00023261723,0.0000348039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011338087,0.0011086932,0.00092594884,0.00063072145,0.00056335813,0.000998702,0.00093562296,0.001155745,0.0025311185],"category_scores_gemma":[0.003392897,0.0004581028,0.0006697378,0.0009981546,0.0009806416,0.0010071314,0.0015421169,0.002326879,0.0011621536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016146615,0.00011311847,0.0004525207,0.00023220743,0.00006922619,0.00017424296,0.00018409097,0.51235384,0.011902529,0.06334094,0.0059920447,0.4050238],"study_design_scores_gemma":[0.000019743162,0.00005047467,0.000046392608,0.000014455954,0.000005817103,0.00006695798,0.000009808037,0.98488367,0.0032482191,0.009659881,0.0019820097,0.000012501295],"about_ca_topic_score_codex":0.0015402487,"about_ca_topic_score_gemma":0.0019949025,"teacher_disagreement_score":0.0025311185,"about_ca_system_score_codex":0.0005970345,"about_ca_system_score_gemma":0.0019731196,"threshold_uncertainty_score":0.008467436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023208873,0.00056148315,0.97407985,0.00012047669,0.000061575556,0.00003925438,0.00001675483,0.0001717798,0.0017400929],"genre_scores_gemma":[0.75594544,0.0003924975,0.24165492,0.00020707026,0.00007192453,0.00007243681,0.00003087573,0.00001677265,0.001608131],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.00015545265,0.00002967112,0.0001024664,0.0002732479,0.00004874542],"domain_scores_gemma":[0.9995365,0.00022742192,0.00006625119,0.000075069715,0.00007431984,0.000020416992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005096406,0.00048479455,0.00055061583,0.00025317713,0.00029567705,0.0005601341,0.000886752,0.000534997,0.0007239611],"category_scores_gemma":[0.0010661697,0.00022034423,0.00023360981,0.00037881316,0.0006484412,0.0011570068,0.0007999883,0.00051675993,0.00026972103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183263,0.00021645584,0.0011966835,0.00026109457,0.00008133126,0.00028450845,0.00030154173,0.16653302,0.39975905,0.049739186,0.0013280497,0.3797807],"study_design_scores_gemma":[0.00003397453,0.00035137424,0.00036080522,0.000021802649,0.000027872158,0.00032386972,0.000036907993,0.9350856,0.053150825,0.008515886,0.0020380344,0.000053094016],"about_ca_topic_score_codex":0.00045191916,"about_ca_topic_score_gemma":0.0008235261,"teacher_disagreement_score":0.000886752,"about_ca_system_score_codex":0.0002293221,"about_ca_system_score_gemma":0.00032972524,"threshold_uncertainty_score":0.0026952624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008304581,0.00028116844,0.98770523,0.00036915197,0.000056249835,0.000050795006,0.000016166212,0.000020854104,0.003195838],"genre_scores_gemma":[0.8709666,0.0009298167,0.121630825,0.00025052144,0.00010669217,0.00038310097,0.000035535697,0.000026661395,0.005670147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890006,0.0006322713,0.000041705356,0.00014559503,0.00018872975,0.00009162287],"domain_scores_gemma":[0.9990601,0.0006331637,0.000081362,0.00004075565,0.000113381626,0.000071323775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423578,0.0009428032,0.001184202,0.00055797317,0.00076305046,0.0014119113,0.0015811017,0.0016336786,0.0013285012],"category_scores_gemma":[0.0029232816,0.00039537347,0.00083219726,0.0007637751,0.0017236465,0.0020834,0.0019904787,0.0012282424,0.00018048845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049897062,0.00004246595,0.00034649318,0.00010143233,0.000056056924,0.00019793477,0.00019010494,0.76488894,0.0018035038,0.21900027,0.00064693,0.01267596],"study_design_scores_gemma":[0.000013371066,0.00003832861,0.00003975739,0.0000074183035,0.00000987997,0.000029415549,0.000028895087,0.9665772,0.000120506,0.03257679,0.0005496521,0.000008865035],"about_ca_topic_score_codex":0.00350928,"about_ca_topic_score_gemma":0.002255131,"teacher_disagreement_score":0.00350928,"about_ca_system_score_codex":0.0011526967,"about_ca_system_score_gemma":0.0013230167,"threshold_uncertainty_score":0.008363426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06238633,0.017131038,0.8670016,0.0027377808,0.0004559803,0.00016814924,0.0011044615,0.00090442935,0.048110235],"genre_scores_gemma":[0.71210504,0.012217445,0.25501332,0.0014665289,0.00076886726,0.00077563396,0.0021851726,0.000555835,0.014912245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956866,0.0007561982,0.00022553472,0.0006163452,0.0019890468,0.00072625285],"domain_scores_gemma":[0.98701537,0.009392015,0.00055252,0.0013711748,0.0013333649,0.000335625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022461775,0.0024376903,0.0018967206,0.0029066894,0.0015549021,0.0031126458,0.0023725596,0.0020923284,0.00585415],"category_scores_gemma":[0.021338983,0.0009751264,0.0009833182,0.002959896,0.0018466463,0.0058868504,0.0036852486,0.0054984037,0.0029184837],"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.0008557559,0.00034281932,0.0020411657,0.0014997728,0.00016554089,0.0005194373,0.00056461926,0.41940126,0.03683091,0.37094718,0.012073488,0.15475799],"study_design_scores_gemma":[0.000057054636,0.00014548669,0.0007324462,0.00025389376,0.000050764127,0.0003416126,0.000096993244,0.7259612,0.01676141,0.24320102,0.012294807,0.00010336839],"about_ca_topic_score_codex":0.0018718588,"about_ca_topic_score_gemma":0.0025492883,"teacher_disagreement_score":0.00585415,"about_ca_system_score_codex":0.003060149,"about_ca_system_score_gemma":0.0018529958,"threshold_uncertainty_score":0.022203028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063178004,0.0012627366,0.975901,0.00034343093,0.00013513438,0.00005482374,0.00024498,0.00056083483,0.015179302],"genre_scores_gemma":[0.5977347,0.0063330606,0.3713514,0.00086407404,0.00053464307,0.00050605525,0.0007689808,0.0007039965,0.021203147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834406,0.00037197088,0.000082984465,0.00015499444,0.00077059964,0.0002754374],"domain_scores_gemma":[0.9946079,0.0032146298,0.00032200036,0.0009470687,0.00081499515,0.00009324728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399664,0.0015629736,0.0016490095,0.002051331,0.0007209727,0.0020355503,0.0022061781,0.0015014246,0.005599449],"category_scores_gemma":[0.018202368,0.0006868152,0.0012472009,0.0017941043,0.0017046964,0.0040448066,0.001707904,0.0034897034,0.002956407],"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.00006403644,0.000043080723,0.00051352975,0.00020884543,0.000027438226,0.00033893288,0.00020398304,0.7340513,0.0034982823,0.22976479,0.004142189,0.027143609],"study_design_scores_gemma":[0.0000066100774,0.000009644205,0.0001316461,0.000049019935,0.000008644523,0.00013168377,0.000028961977,0.94749737,0.0014862297,0.047970597,0.0026571418,0.000022520317],"about_ca_topic_score_codex":0.003876923,"about_ca_topic_score_gemma":0.0031677387,"teacher_disagreement_score":0.005599449,"about_ca_system_score_codex":0.0018220849,"about_ca_system_score_gemma":0.0010801197,"threshold_uncertainty_score":0.018732011},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009906654,0.0001923636,0.9872556,0.00009778616,0.000042347765,0.0000538554,0.00011861693,0.00088612916,0.0014466931],"genre_scores_gemma":[0.09101362,0.0001396126,0.9060731,0.00007234881,0.000022082213,0.00012712211,0.00048190972,0.00018816533,0.0018820015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990909,0.0001447968,0.0000637128,0.00015233443,0.00044996635,0.00009829645],"domain_scores_gemma":[0.9979202,0.0009700532,0.00015651855,0.00022348437,0.00067159475,0.00005818024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096904,0.0006107995,0.00078328757,0.0015415942,0.0007843886,0.0010061935,0.0013004215,0.0009623001,0.0036154534],"category_scores_gemma":[0.005128291,0.00031936765,0.0005316946,0.0017614723,0.00064042653,0.0015180164,0.0010957631,0.0008805462,0.0013406913],"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.00026803082,0.00010533602,0.0016500466,0.00030931088,0.00007695656,0.00022089265,0.0003529282,0.2824638,0.027206894,0.07696303,0.010540596,0.5998422],"study_design_scores_gemma":[0.000068613044,0.00009167362,0.0002668815,0.000027397244,0.000019249932,0.00021670347,0.000069369155,0.9410313,0.011812229,0.03978625,0.006577433,0.00003297425],"about_ca_topic_score_codex":0.0042934134,"about_ca_topic_score_gemma":0.0059485226,"teacher_disagreement_score":0.0042934134,"about_ca_system_score_codex":0.00093237485,"about_ca_system_score_gemma":0.0024985727,"threshold_uncertainty_score":0.012094855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087161794,0.0024146745,0.9052665,0.0004551635,0.00018968042,0.00007719566,0.00003996758,0.00059051305,0.0038044648],"genre_scores_gemma":[0.98107404,0.00042184294,0.017176438,0.00008393306,0.000090186164,0.000037560643,0.00002422125,0.000010692049,0.0010811009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943286,0.00011522043,0.0000228812,0.000079581776,0.0002364722,0.00011293336],"domain_scores_gemma":[0.9992668,0.00037108953,0.00011505635,0.0000603442,0.00014506959,0.000041616953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317168,0.00049458176,0.0005107453,0.00040518542,0.0006686444,0.0008681402,0.0009928175,0.00042370943,0.0008950931],"category_scores_gemma":[0.0018656205,0.00014902849,0.00021334374,0.00040228595,0.0005800467,0.0006439335,0.0006866424,0.0007545674,0.000102221646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035777153,0.00022182603,0.0021650991,0.00023568937,0.00008705542,0.00039609688,0.00037816304,0.5612751,0.041979928,0.059306055,0.003626706,0.32997054],"study_design_scores_gemma":[0.000010802421,0.00004850103,0.0004667211,0.0000077808845,0.000014410818,0.00004999783,0.000024157527,0.989375,0.0015123314,0.0074422914,0.001036381,0.000011562325],"about_ca_topic_score_codex":0.0067112683,"about_ca_topic_score_gemma":0.008220964,"teacher_disagreement_score":0.0067112683,"about_ca_system_score_codex":0.0011377621,"about_ca_system_score_gemma":0.0009670886,"threshold_uncertainty_score":0.013344407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01558987,0.002410114,0.94772214,0.0020513006,0.00026178375,0.00016886627,0.0009893975,0.00035709512,0.030449532],"genre_scores_gemma":[0.40442073,0.005128937,0.5466111,0.0010703751,0.00068108493,0.0009252019,0.0024149506,0.0010667412,0.037680853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665594,0.0013550712,0.00016008118,0.0005719556,0.0006462245,0.0006107533],"domain_scores_gemma":[0.98916537,0.008191021,0.00060927944,0.0005518031,0.0010947979,0.00038780822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00562187,0.0031129152,0.0028123027,0.002044303,0.001089881,0.0041204975,0.0034474798,0.0034528326,0.015034012],"category_scores_gemma":[0.027375285,0.001233872,0.0020732158,0.0036341508,0.0021084202,0.0042895847,0.0032610046,0.003965765,0.003054648],"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.000321744,0.00021477908,0.0006288877,0.00066789275,0.00015292599,0.0002530237,0.00023060183,0.6586732,0.0008698777,0.2573522,0.026223093,0.054411776],"study_design_scores_gemma":[0.00005899077,0.00005840974,0.00021192964,0.00009358209,0.000034501543,0.00012170282,0.000104120874,0.8217755,0.00038854493,0.1736357,0.0034833776,0.000033601573],"about_ca_topic_score_codex":0.004720665,"about_ca_topic_score_gemma":0.0057237274,"teacher_disagreement_score":0.015034012,"about_ca_system_score_codex":0.0033578007,"about_ca_system_score_gemma":0.0042104307,"threshold_uncertainty_score":0.050293803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3025054,0.0006657771,0.69282645,0.0002030272,0.000046643156,0.000026780108,0.000050783667,0.00045963682,0.0032154906],"genre_scores_gemma":[0.9850095,0.000105416875,0.014545435,0.000023711527,0.000007775922,0.000007878754,0.000019456118,0.000011348134,0.00026949964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998259,0.000047999158,0.0000059701947,0.000024371184,0.000050748007,0.000045003315],"domain_scores_gemma":[0.9995995,0.000180593,0.000046466805,0.000052388423,0.00009224904,0.000028823566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031486424,0.00029679068,0.0005014175,0.00021035149,0.00031602356,0.0004509017,0.0007191175,0.000308646,0.00032617289],"category_scores_gemma":[0.00084454217,0.0001412658,0.00016751052,0.0004505,0.0003022259,0.0006259961,0.0003835877,0.00033045598,0.00006672486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027885666,0.00013917878,0.0027642718,0.000091500006,0.000033112126,0.00031504282,0.00011173329,0.8456746,0.055374578,0.01912999,0.0018189541,0.07426823],"study_design_scores_gemma":[0.0000030720348,0.00002046072,0.00018542747,0.0000016186635,0.0000036719684,0.000026973017,0.000014967299,0.99523664,0.0026936696,0.0016172341,0.00019308513,0.0000030712702],"about_ca_topic_score_codex":0.0026028783,"about_ca_topic_score_gemma":0.0038574245,"teacher_disagreement_score":0.0026028783,"about_ca_system_score_codex":0.00064481294,"about_ca_system_score_gemma":0.00062605605,"threshold_uncertainty_score":0.0051754713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005895718,0.00035194933,0.9919742,0.00013175352,0.000045458342,0.000041113803,0.00002193872,0.00009181121,0.0014459754],"genre_scores_gemma":[0.6154091,0.0011813288,0.3769065,0.00019727973,0.00018427185,0.00028734212,0.00013033266,0.000048131373,0.0056556263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994147,0.00020627142,0.0000286212,0.0001128976,0.00018954271,0.000047973655],"domain_scores_gemma":[0.9995271,0.0002203646,0.00005652613,0.000056299956,0.000108153705,0.00003161034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430109,0.0007649809,0.0007531629,0.0006367778,0.00069188,0.0005536943,0.0011646143,0.00065833284,0.0011645516],"category_scores_gemma":[0.0013850051,0.0002538866,0.00069362856,0.0009643725,0.0004436748,0.0010284538,0.0010243957,0.0005342591,0.00039292307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001927782,0.00014971104,0.0011507948,0.00032338646,0.00014872797,0.00037257155,0.00038103198,0.56814533,0.026830826,0.043773483,0.007824915,0.3507065],"study_design_scores_gemma":[0.000016093483,0.000060238977,0.00015892077,0.000006755759,0.000026548043,0.00016489977,0.000045204128,0.9883477,0.0023492714,0.0064644814,0.0023417377,0.000018187899],"about_ca_topic_score_codex":0.0014874054,"about_ca_topic_score_gemma":0.002135213,"teacher_disagreement_score":0.0014874054,"about_ca_system_score_codex":0.00054205424,"about_ca_system_score_gemma":0.0008001941,"threshold_uncertainty_score":0.003932953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011808349,0.00030465695,0.98597336,0.0001863281,0.000042466112,0.000051028735,0.000013506937,0.00010233216,0.0015179677],"genre_scores_gemma":[0.7150064,0.00032954084,0.28206864,0.00012586168,0.000059845243,0.00015448112,0.000045495006,0.0000563124,0.0021534595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.00027682318,0.000029880655,0.00014075299,0.00013087767,0.0001466332],"domain_scores_gemma":[0.99927694,0.00042135204,0.00006302125,0.000055861958,0.00012378965,0.000059021408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102103,0.0008198942,0.0011180403,0.00037514357,0.0005744893,0.0009661544,0.001463643,0.0008704052,0.001469585],"category_scores_gemma":[0.0023915332,0.00031283614,0.00041114967,0.0008762814,0.00066012435,0.0011866721,0.00096245465,0.00097577524,0.00023383464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000171093,0.00010413451,0.00040419443,0.00008138112,0.000036021025,0.000094797826,0.000080267644,0.918977,0.0026722413,0.027119704,0.0017755949,0.048483487],"study_design_scores_gemma":[0.000016992903,0.000014603717,0.00002040129,0.0000016865592,0.0000028532447,0.000014938619,0.000008342663,0.99660313,0.00021762204,0.002894872,0.00020216452,0.0000024604014],"about_ca_topic_score_codex":0.0027005917,"about_ca_topic_score_gemma":0.0022880014,"teacher_disagreement_score":0.0027005917,"about_ca_system_score_codex":0.0013051336,"about_ca_system_score_gemma":0.0014827593,"threshold_uncertainty_score":0.0094694495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005044875,0.000105995714,0.9934661,0.00006222081,0.00001434418,0.000010524043,0.000011087178,0.000047425106,0.0012374086],"genre_scores_gemma":[0.7749893,0.0007322571,0.22006957,0.00014813295,0.000063420695,0.00013778714,0.00005527379,0.00003816768,0.0037661511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927884,0.00024736652,0.000035861984,0.0001249364,0.0002536363,0.00005935857],"domain_scores_gemma":[0.9995925,0.0001973721,0.000057358633,0.00006070372,0.00007636357,0.00001579423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078923436,0.0011280316,0.00076823146,0.00029090123,0.0003369072,0.00064815395,0.0006982247,0.0006695122,0.0012848598],"category_scores_gemma":[0.0011138922,0.00028784582,0.0005068975,0.0005665629,0.0007069457,0.0012045056,0.0009208258,0.00078051735,0.0004892948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017555967,0.00006912588,0.0004672866,0.00017020079,0.00007932376,0.00021553469,0.00012237504,0.7424965,0.051107552,0.12738346,0.0014808363,0.07623227],"study_design_scores_gemma":[0.00001677618,0.00008548402,0.00007631677,0.00001008567,0.00001634238,0.00007923422,0.00001590154,0.9802924,0.0077776695,0.010476638,0.0011406002,0.000012640473],"about_ca_topic_score_codex":0.00038594825,"about_ca_topic_score_gemma":0.00056351256,"teacher_disagreement_score":0.0012848598,"about_ca_system_score_codex":0.00052849454,"about_ca_system_score_gemma":0.00059153046,"threshold_uncertainty_score":0.0042983294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166516,0.0012078382,0.81749314,0.00057258806,0.000103186576,0.00004348746,0.000117468226,0.00018875307,0.008608364],"genre_scores_gemma":[0.97799873,0.00026056368,0.01974568,0.00010174047,0.00004403781,0.000026817075,0.000045506924,0.00002293589,0.0017540922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992687,0.0002916265,0.00001306006,0.000085373395,0.00017610646,0.00016509817],"domain_scores_gemma":[0.99863976,0.0009147673,0.0001402623,0.00005842605,0.00014747468,0.00009926471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273273,0.00092096184,0.00074149604,0.00028044777,0.00035005328,0.0012046782,0.0007140709,0.00087531505,0.0010881781],"category_scores_gemma":[0.0030663512,0.00041790135,0.00032701826,0.0005446962,0.0009369548,0.0009465087,0.0011354879,0.00070231094,0.00019239179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012792838,0.000027211508,0.00046287433,0.000057571888,0.00002942855,0.00013307725,0.000038965194,0.96673787,0.003493502,0.021285255,0.00057274447,0.0070335455],"study_design_scores_gemma":[0.000009318832,0.00003724505,0.000118361815,0.0000032903029,0.0000047605195,0.000024408459,0.0000121019075,0.9941672,0.00037396548,0.005103132,0.00014064273,0.000005428446],"about_ca_topic_score_codex":0.0018671715,"about_ca_topic_score_gemma":0.0013290333,"teacher_disagreement_score":0.0018671715,"about_ca_system_score_codex":0.0008941239,"about_ca_system_score_gemma":0.0005257038,"threshold_uncertainty_score":0.0064908266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08702292,0.0037235168,0.8415683,0.0027853376,0.0014918091,0.00015066336,0.00016860706,0.0011433166,0.06194556],"genre_scores_gemma":[0.97188073,0.0008135694,0.020665387,0.00026578616,0.00020540402,0.000038766393,0.000042066877,0.00004776467,0.0060404944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919194,0.00020503353,0.000036712456,0.00013376222,0.00028583035,0.00014673572],"domain_scores_gemma":[0.99932086,0.00019066267,0.00008743496,0.00018153488,0.00017921044,0.000040364037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000648985,0.00037655892,0.00051571947,0.00047461872,0.0007353454,0.002115785,0.001072029,0.0008950002,0.0034469722],"category_scores_gemma":[0.002373964,0.00020773844,0.00042053915,0.0009632858,0.0007371841,0.0024180214,0.0007340435,0.00092811335,0.0006929444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025886306,0.00013472163,0.0018605605,0.0001694857,0.00005362547,0.00074887794,0.0002294196,0.18766452,0.021478567,0.5679807,0.009253775,0.21016684],"study_design_scores_gemma":[0.000029583696,0.000121380166,0.00065058103,0.000032303207,0.000028210985,0.0005104275,0.00012134452,0.8298102,0.0077234106,0.1339179,0.0269965,0.000058098605],"about_ca_topic_score_codex":0.0013111457,"about_ca_topic_score_gemma":0.0007911684,"teacher_disagreement_score":0.0034469722,"about_ca_system_score_codex":0.0007212696,"about_ca_system_score_gemma":0.0007626587,"threshold_uncertainty_score":0.011531234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10475368,0.0003576516,0.88734823,0.00028222086,0.000058142115,0.00005386166,0.00011346346,0.0005822091,0.006450508],"genre_scores_gemma":[0.78155595,0.00028431162,0.21417725,0.00017606132,0.00006755641,0.00011280794,0.0001751984,0.000089817135,0.0033610547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985226,0.00045013992,0.00007021517,0.00018231354,0.0006324758,0.00014233706],"domain_scores_gemma":[0.9943705,0.0029669716,0.00072901545,0.000943668,0.0008709709,0.00011880167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014821535,0.00041912554,0.00040953993,0.00062643446,0.00038589415,0.00055343076,0.00069298834,0.0005915493,0.0010251787],"category_scores_gemma":[0.008261074,0.00024982064,0.00030749233,0.0005677133,0.0011729901,0.0011124802,0.0009127651,0.0010820925,0.000397948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039067477,0.000059499616,0.0016572631,0.00021981492,0.000033920358,0.0003526643,0.00029332453,0.22540042,0.073254876,0.6023028,0.0021363313,0.09389846],"study_design_scores_gemma":[0.000045262317,0.00027504753,0.00067339535,0.00007774373,0.00002286368,0.00082198647,0.000060301976,0.76574516,0.07628388,0.14797138,0.007949256,0.000073749914],"about_ca_topic_score_codex":0.00037267676,"about_ca_topic_score_gemma":0.0004672031,"teacher_disagreement_score":0.0014821535,"about_ca_system_score_codex":0.00071557675,"about_ca_system_score_gemma":0.0009644827,"threshold_uncertainty_score":0.007838488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016988631,0.0016069442,0.9600657,0.00056959275,0.00008154196,0.00007094712,0.0003540269,0.00024752755,0.020015145],"genre_scores_gemma":[0.8499978,0.005478543,0.13019946,0.00035709888,0.0001975486,0.00039403886,0.0005409057,0.00028599068,0.0125485435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881625,0.00037573362,0.000053802083,0.00011562692,0.0004663991,0.00017215108],"domain_scores_gemma":[0.99358374,0.0044761817,0.00049138017,0.00033963026,0.001046347,0.00006271899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026099451,0.001362995,0.00095183897,0.00096347247,0.00050157116,0.0021690165,0.0009853209,0.0010233447,0.0050513614],"category_scores_gemma":[0.008413049,0.0004158153,0.0005965929,0.0012272642,0.0017937773,0.0021151719,0.0012723815,0.0017798836,0.0013625368],"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.00008214643,0.000057068493,0.00039130112,0.00042883004,0.00003259946,0.0002612087,0.00028564525,0.7354899,0.006717704,0.23479918,0.0023708132,0.019083673],"study_design_scores_gemma":[0.000006965688,0.000028324532,0.0001136803,0.00006517822,0.000011155453,0.00013770937,0.000057894566,0.9673739,0.002254044,0.02879293,0.0011393444,0.000018878609],"about_ca_topic_score_codex":0.0014413972,"about_ca_topic_score_gemma":0.0012302364,"teacher_disagreement_score":0.0050513614,"about_ca_system_score_codex":0.0018410033,"about_ca_system_score_gemma":0.0014686399,"threshold_uncertainty_score":0.016898513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016270833,0.00028723778,0.98106796,0.00011671664,0.000026221489,0.000024141953,0.000012881112,0.00008208408,0.0021119632],"genre_scores_gemma":[0.8447892,0.00031154093,0.1505311,0.0000926356,0.00007241433,0.00012140033,0.0000469745,0.000046543075,0.0039881784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992976,0.00030549263,0.000018072544,0.00012293256,0.00016858714,0.00008722438],"domain_scores_gemma":[0.9993406,0.00034320992,0.00012700299,0.000051865965,0.000105819076,0.000031517367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008322027,0.0012882634,0.00092977064,0.00035430817,0.00035664154,0.00068072946,0.0006855573,0.0011898357,0.0012959767],"category_scores_gemma":[0.001848163,0.00056726055,0.00036172656,0.00056293147,0.0005970132,0.0008134348,0.001075946,0.0005609888,0.00043926723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044121647,0.000023950211,0.0001792089,0.000043946657,0.000017956827,0.000063875756,0.000030011059,0.9729782,0.004383398,0.0047305385,0.00033736663,0.01716755],"study_design_scores_gemma":[0.000011695556,0.00007342728,0.00010458629,0.000003733051,0.000007078225,0.00003215663,0.0000149092375,0.9964156,0.0009853414,0.0018708287,0.0004749995,0.00000564166],"about_ca_topic_score_codex":0.0009995998,"about_ca_topic_score_gemma":0.00097337965,"teacher_disagreement_score":0.0012959767,"about_ca_system_score_codex":0.0005458031,"about_ca_system_score_gemma":0.000604321,"threshold_uncertainty_score":0.0044011474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29475218,0.0018410143,0.67961264,0.00043016928,0.00005241141,0.0000687598,0.00015914267,0.00039709176,0.02268663],"genre_scores_gemma":[0.95757324,0.000584974,0.03954289,0.00006790818,0.000021947793,0.000034204197,0.00009990094,0.00006743848,0.0020074407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871397,0.00041553192,0.00003629846,0.0001360378,0.00050261174,0.00019554574],"domain_scores_gemma":[0.9978346,0.0010590097,0.00029795148,0.0001980838,0.0005666649,0.000043615524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996703,0.00095164357,0.00053297327,0.00053056993,0.0003336342,0.00081775006,0.00052352785,0.00047027136,0.0011307229],"category_scores_gemma":[0.0036932603,0.0002292976,0.000352612,0.00061785546,0.0007707488,0.00092938764,0.0007898927,0.00058028137,0.00029445504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022088685,0.00003757385,0.0022915597,0.00012710717,0.00006499061,0.00015170968,0.000103037164,0.9069677,0.035443336,0.035685524,0.0005015062,0.018405063],"study_design_scores_gemma":[0.000004557271,0.000050827355,0.00029958686,0.000008423252,0.000012642617,0.000056592344,0.000012910008,0.9875814,0.009687328,0.0019236021,0.00034983756,0.000012240085],"about_ca_topic_score_codex":0.0024250294,"about_ca_topic_score_gemma":0.0027107862,"teacher_disagreement_score":0.0024250294,"about_ca_system_score_codex":0.00110044,"about_ca_system_score_gemma":0.0011412416,"threshold_uncertainty_score":0.007984281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5689597,0.0013532817,0.40573475,0.0007391226,0.0000858327,0.00007075632,0.00010833448,0.000242776,0.022705488],"genre_scores_gemma":[0.99723047,0.00011897622,0.002043444,0.0000211292,0.000015682179,0.000012768004,0.000014669334,0.000009502828,0.00053326273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851125,0.00048621863,0.000030061017,0.00015887074,0.0004436665,0.00036984164],"domain_scores_gemma":[0.995207,0.0031526377,0.00037598942,0.00024555522,0.000829807,0.00018909982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020176338,0.00090409524,0.0008865395,0.0007830309,0.00063972163,0.0014026146,0.00084839965,0.00073963817,0.0010664419],"category_scores_gemma":[0.008141438,0.0002866026,0.0005078173,0.00061418617,0.0011578773,0.00093756826,0.0009552849,0.000578897,0.0002454893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034470254,0.00008975473,0.0045096255,0.000085376254,0.00007259498,0.0003459279,0.00022416322,0.9311822,0.008591452,0.036457215,0.00065786403,0.017439088],"study_design_scores_gemma":[0.000003949012,0.00006500307,0.0005359632,0.0000041858234,0.000013460365,0.00007934685,0.000031967986,0.99538076,0.0008663998,0.0028878963,0.0001239063,0.000007189158],"about_ca_topic_score_codex":0.0043882327,"about_ca_topic_score_gemma":0.0023606587,"teacher_disagreement_score":0.0043882327,"about_ca_system_score_codex":0.0018721279,"about_ca_system_score_gemma":0.0012603705,"threshold_uncertainty_score":0.013583243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65213,0.001640852,0.32522476,0.0005958497,0.00010368802,0.00008360395,0.00026806537,0.00030791055,0.019645218],"genre_scores_gemma":[0.99366415,0.00022384747,0.0054903314,0.000032525277,0.000009352746,0.000018977109,0.000033111846,0.0000072170074,0.0005206235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838376,0.00067675783,0.000064206,0.0001425217,0.00042440425,0.0003083931],"domain_scores_gemma":[0.9847882,0.011338175,0.0010915537,0.0008872551,0.001720536,0.0001742592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027516913,0.0010719238,0.0008432094,0.00053949194,0.00051075715,0.00080553885,0.0010222314,0.00075419113,0.00056665234],"category_scores_gemma":[0.010949864,0.00027404548,0.00027333465,0.0009784083,0.0014339822,0.0014060155,0.0011873291,0.00050466537,0.00010487308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036251583,0.000032824224,0.0013403809,0.0001343622,0.000051823874,0.00064485124,0.0001687676,0.9685763,0.0061029512,0.014000015,0.00046691246,0.0081183165],"study_design_scores_gemma":[0.000015788455,0.00009011219,0.00032563737,0.000014724967,0.000026360396,0.00020658759,0.000040448016,0.9916135,0.0034904073,0.0039811176,0.00017760099,0.000017788381],"about_ca_topic_score_codex":0.005677405,"about_ca_topic_score_gemma":0.006395768,"teacher_disagreement_score":0.005677405,"about_ca_system_score_codex":0.001380345,"about_ca_system_score_gemma":0.0015852368,"threshold_uncertainty_score":0.014552534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075251055,0.000268585,0.9886535,0.0001420979,0.000034829594,0.000031067906,0.00007709426,0.00026345992,0.0030042978],"genre_scores_gemma":[0.4567395,0.0009806079,0.53489655,0.0002632949,0.00011116582,0.00021833942,0.00055063836,0.00011345777,0.0061264513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.0002999044,0.00004106526,0.000100237485,0.00046024038,0.000095975854],"domain_scores_gemma":[0.9983443,0.0008557531,0.00011367551,0.00021063712,0.00042872265,0.00004695192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006233093,0.0006463052,0.0006345517,0.00063713535,0.00036146046,0.00072791206,0.00065542484,0.00070265844,0.0023455122],"category_scores_gemma":[0.004252117,0.00020615596,0.00045317732,0.0011891191,0.00073067396,0.00089390547,0.0009972265,0.00079072826,0.0011487768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002565211,0.000052273386,0.00087035744,0.00020509605,0.000064894426,0.00018814497,0.00012851167,0.5975722,0.017654022,0.1897832,0.0054200254,0.1878048],"study_design_scores_gemma":[0.000013685568,0.000031727566,0.00007155703,0.000007200881,0.0000047331796,0.00006161975,0.000006346331,0.97996324,0.0032897375,0.015044462,0.0014966156,0.0000090288195],"about_ca_topic_score_codex":0.003056554,"about_ca_topic_score_gemma":0.003281844,"teacher_disagreement_score":0.003056554,"about_ca_system_score_codex":0.0007004814,"about_ca_system_score_gemma":0.0015988012,"threshold_uncertainty_score":0.007846475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025772175,0.00014137744,0.9727394,0.00010958903,0.000026593209,0.000051272367,0.0000128463,0.00017172692,0.0009750783],"genre_scores_gemma":[0.71615237,0.00021079801,0.28154972,0.00009422715,0.000029604653,0.00023300746,0.00007336479,0.00003394449,0.0016228356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997259,0.00006451428,0.000019760531,0.000063824235,0.000077717465,0.000048253663],"domain_scores_gemma":[0.9996724,0.00015096225,0.000058486912,0.000019848676,0.000067773835,0.000030451898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790992,0.0005902509,0.0006519666,0.00062404847,0.0005170442,0.00049937103,0.0010563326,0.00064435246,0.000755469],"category_scores_gemma":[0.0011189012,0.00031227712,0.00037984777,0.00061410543,0.0005119706,0.0008738301,0.0010746788,0.00047785137,0.00012380484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009366033,0.00004237038,0.00092581834,0.000052971205,0.000027292243,0.00006553416,0.00012109455,0.9011301,0.0057005356,0.0067486656,0.0010629207,0.084029056],"study_design_scores_gemma":[0.000007930082,0.000025932228,0.000072110735,0.000002118939,0.0000036754436,0.000010572238,0.00001556681,0.9984546,0.00047335238,0.00075358775,0.00017737049,0.0000032180528],"about_ca_topic_score_codex":0.003790903,"about_ca_topic_score_gemma":0.0045643933,"teacher_disagreement_score":0.003790903,"about_ca_system_score_codex":0.0006663199,"about_ca_system_score_gemma":0.000987242,"threshold_uncertainty_score":0.0075377226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16270553,0.0011275852,0.8284529,0.00073686324,0.000115457326,0.00011037659,0.00040015232,0.00056232046,0.005788874],"genre_scores_gemma":[0.97849244,0.00083851983,0.015798505,0.00009395684,0.000052894742,0.00009350329,0.00026139972,0.00008793057,0.004280856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921334,0.00017357338,0.00003919806,0.00019111983,0.00020963322,0.00017317226],"domain_scores_gemma":[0.9937091,0.0040245503,0.0007920921,0.00029642825,0.0010533114,0.00012450393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017226426,0.0006378137,0.0008376777,0.0010767243,0.0006034871,0.0013388176,0.0016966148,0.0011131141,0.002632201],"category_scores_gemma":[0.008908794,0.00054490694,0.00043401797,0.0011679772,0.0015120115,0.002369848,0.00106364,0.0011514018,0.00055744505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016723888,0.000030992484,0.0031480412,0.00012476828,0.000026200632,0.0003923839,0.00018015497,0.9072267,0.0034216861,0.07427057,0.0013104079,0.00970082],"study_design_scores_gemma":[0.0000066943862,0.00004125446,0.00085713033,0.000018285515,0.000013137958,0.00022394408,0.00010244131,0.9855633,0.001037252,0.011526253,0.00057955453,0.00003066394],"about_ca_topic_score_codex":0.003596453,"about_ca_topic_score_gemma":0.0022914077,"teacher_disagreement_score":0.003596453,"about_ca_system_score_codex":0.0017128746,"about_ca_system_score_gemma":0.00061424216,"threshold_uncertainty_score":0.012427807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019459583,0.0001819266,0.97950566,0.00010392432,0.000008992319,0.000006517621,0.00003235017,0.000075605836,0.00062547205],"genre_scores_gemma":[0.85597205,0.0008025732,0.14050354,0.00012589617,0.00006479776,0.000041374493,0.0001754487,0.000043646487,0.002270802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.00013178325,0.000028956776,0.000078669524,0.00016511738,0.000038932358],"domain_scores_gemma":[0.998635,0.0009439307,0.00014436348,0.000073109775,0.00017972084,0.000023774937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985118,0.00054694153,0.0007862681,0.0003212166,0.00015137513,0.00076471275,0.000600735,0.0008089303,0.000407522],"category_scores_gemma":[0.006035338,0.00038735868,0.00030502566,0.00037371492,0.00061658653,0.0011747791,0.00075589493,0.00069555914,0.00017485267],"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.0001614099,0.000027738373,0.0021659634,0.00016176187,0.000088950655,0.00022272888,0.00013068381,0.88721764,0.013032401,0.04261938,0.00058040884,0.05359095],"study_design_scores_gemma":[0.0000044269314,0.000016781945,0.00034321912,0.000010099956,0.000011853854,0.000051005478,0.000009994061,0.9907239,0.0021596637,0.0064347875,0.00022664075,0.000007634295],"about_ca_topic_score_codex":0.0017455551,"about_ca_topic_score_gemma":0.0016663516,"teacher_disagreement_score":0.0017455551,"about_ca_system_score_codex":0.0003596799,"about_ca_system_score_gemma":0.0007497697,"threshold_uncertainty_score":0.0052806735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052594785,0.00014128564,0.99358165,0.00008652711,0.000020989144,0.0000091478505,0.000017848828,0.0002209745,0.0006620769],"genre_scores_gemma":[0.73130274,0.0005730223,0.2623173,0.00028351543,0.00008396612,0.00010036039,0.00016864491,0.00009816737,0.005072278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997441,0.00005924021,0.000012779574,0.00005468936,0.00007976569,0.00004944317],"domain_scores_gemma":[0.99944943,0.00030297055,0.000058863054,0.00006949323,0.000098160446,0.0000210362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068353396,0.0006338466,0.000587176,0.00029144564,0.0002655623,0.0004851907,0.0010712062,0.00085189583,0.0014467845],"category_scores_gemma":[0.0018987987,0.0003280143,0.0004406829,0.00045161854,0.00073787145,0.0014044591,0.0010453454,0.0017091996,0.00037838222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000692545,0.000077253375,0.000386215,0.000065074906,0.000042490803,0.00004701249,0.00004118004,0.8820949,0.009679996,0.017938053,0.0011720484,0.08838648],"study_design_scores_gemma":[0.0000015516672,0.000006106861,0.000023375724,0.0000016018632,0.0000017565984,0.000005453114,0.0000012396409,0.9969778,0.0010750629,0.0017628507,0.00014078045,0.000002394354],"about_ca_topic_score_codex":0.0030957195,"about_ca_topic_score_gemma":0.0036644116,"teacher_disagreement_score":0.0030957195,"about_ca_system_score_codex":0.00072126545,"about_ca_system_score_gemma":0.0009072103,"threshold_uncertainty_score":0.0061553717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0455981,0.00038817455,0.94864017,0.00024690892,0.00006372865,0.00005924543,0.000051155475,0.000101594516,0.004850938],"genre_scores_gemma":[0.9530264,0.00015679812,0.044419497,0.000056030705,0.00003434479,0.00008515817,0.000025955878,0.000014710275,0.0021811724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992587,0.0002818725,0.000023446994,0.00013190364,0.00013981233,0.00016425694],"domain_scores_gemma":[0.99921036,0.00047019796,0.000111760106,0.00006213178,0.000086625885,0.00005899198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097510323,0.00073041563,0.0007623418,0.0003821347,0.00065648986,0.0011782623,0.0010654234,0.0007320505,0.0017513485],"category_scores_gemma":[0.0020434123,0.0003109459,0.00030650743,0.000742262,0.00066657114,0.0008776309,0.0009909217,0.0005922872,0.00019786945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001584757,0.00009988609,0.00031048636,0.000082086204,0.00003250716,0.0001471724,0.00007059139,0.93303555,0.0044940943,0.02462759,0.0011522971,0.0357892],"study_design_scores_gemma":[0.000017227561,0.00003748161,0.0000798326,0.0000027915198,0.000005466276,0.000033302833,0.000021620324,0.99061805,0.0005729605,0.008131615,0.00047484718,0.0000048779402],"about_ca_topic_score_codex":0.0018868123,"about_ca_topic_score_gemma":0.0021003995,"teacher_disagreement_score":0.0018868123,"about_ca_system_score_codex":0.00096391555,"about_ca_system_score_gemma":0.00092194777,"threshold_uncertainty_score":0.006993711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16567267,0.002507709,0.8159097,0.0011194597,0.00011377944,0.000058381756,0.000102057566,0.00012205039,0.014394218],"genre_scores_gemma":[0.9832736,0.0006501765,0.0147051,0.000091406924,0.00004367704,0.000030204383,0.000018645827,0.000012661792,0.0011745432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990458,0.00033291898,0.000042590545,0.00012794595,0.00027349853,0.00017724514],"domain_scores_gemma":[0.9975667,0.0016235398,0.00027274253,0.0002524593,0.00024157313,0.000043016364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013960047,0.0006903948,0.0006461488,0.00041471544,0.00058717467,0.0015522239,0.00057146495,0.0010199036,0.001603757],"category_scores_gemma":[0.0037197396,0.00029839424,0.00037957882,0.00045766195,0.0014216298,0.0022181303,0.0015932742,0.00092519086,0.000340852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033518818,0.00014435477,0.002590541,0.00043331113,0.00010257383,0.00091308745,0.00039649187,0.52957636,0.06263269,0.3686357,0.0018016269,0.032438036],"study_design_scores_gemma":[0.000010555933,0.000081935555,0.00032106703,0.000022314347,0.000013909627,0.00028903212,0.00007305201,0.9625814,0.003521624,0.03229177,0.0007735564,0.000019799378],"about_ca_topic_score_codex":0.0004311997,"about_ca_topic_score_gemma":0.00034690154,"teacher_disagreement_score":0.001603757,"about_ca_system_score_codex":0.0009046795,"about_ca_system_score_gemma":0.0005847039,"threshold_uncertainty_score":0.0073828697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017614506,0.00026625738,0.98040545,0.000113024464,0.000040925224,0.00002838029,0.000010321931,0.00014980292,0.0013713313],"genre_scores_gemma":[0.94874436,0.00016451794,0.049758155,0.0000913918,0.000036675217,0.00007189745,0.000016940176,0.000021222648,0.0010948754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950135,0.00013128975,0.00002782543,0.00013694928,0.00012798587,0.000074567186],"domain_scores_gemma":[0.99920636,0.00040540393,0.00016539107,0.00005879881,0.00011778658,0.000046237667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010539953,0.0007391671,0.0009289073,0.00024151239,0.00032846432,0.0005858076,0.0013171867,0.0007022099,0.00085233356],"category_scores_gemma":[0.0020870098,0.00026727837,0.0003688858,0.00032482922,0.00081206905,0.0009303577,0.0007260173,0.0010851849,0.00014369725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239877,0.0001416935,0.00067809096,0.00009252233,0.000058846286,0.00013865427,0.00011405432,0.9055318,0.010573299,0.019361204,0.0008006042,0.062385157],"study_design_scores_gemma":[0.0000091846105,0.00003078879,0.0000426602,0.000002392939,0.0000047446892,0.000015720518,0.000002988793,0.9974486,0.00047703602,0.0018226192,0.00013862047,0.0000046444156],"about_ca_topic_score_codex":0.0015968705,"about_ca_topic_score_gemma":0.0011531069,"teacher_disagreement_score":0.0015968705,"about_ca_system_score_codex":0.0005630924,"about_ca_system_score_gemma":0.0006595681,"threshold_uncertainty_score":0.005574107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86543804,0.0021500755,0.12476321,0.00041486937,0.00005297727,0.000036943064,0.00022933338,0.00027470425,0.0066396953],"genre_scores_gemma":[0.99852365,0.00015688484,0.0010518635,0.000011951164,0.000006654534,0.000005468825,0.00003061077,0.0000035845665,0.00020934352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.00026919617,0.000049231156,0.00007180093,0.0001316173,0.00013428889],"domain_scores_gemma":[0.9972887,0.0017661235,0.00033573082,0.00017318389,0.0003722017,0.0000640103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948453,0.00058939756,0.0005934374,0.000354592,0.00046596775,0.00060823245,0.00041841957,0.0005775589,0.0006514924],"category_scores_gemma":[0.0025524173,0.00015351774,0.0002086872,0.0005245811,0.0005670938,0.00058690464,0.00060332654,0.00030186627,0.00019377697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045726786,0.000054666758,0.004758669,0.00015228007,0.00007359275,0.00054992817,0.00020296391,0.9583097,0.0147261,0.0053475453,0.00062869955,0.0147385625],"study_design_scores_gemma":[0.000014895047,0.00020852087,0.0016765817,0.000011374559,0.00003506526,0.0002548541,0.00009079256,0.9929309,0.003151024,0.0013619293,0.00024391255,0.00002013344],"about_ca_topic_score_codex":0.002956331,"about_ca_topic_score_gemma":0.0019173349,"teacher_disagreement_score":0.002956331,"about_ca_system_score_codex":0.0007315703,"about_ca_system_score_gemma":0.00045316928,"threshold_uncertainty_score":0.0058782697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.505406,0.0010012484,0.48437697,0.002750339,0.000086643515,0.0002352263,0.00021665495,0.0008237859,0.005103161],"genre_scores_gemma":[0.98087204,0.000084534826,0.018487522,0.00008276927,0.00002015483,0.000015846856,0.00005539527,0.000012783632,0.00036896157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908007,0.0049724933,0.00033128227,0.0011594677,0.0016661867,0.0010698289],"domain_scores_gemma":[0.95240426,0.03354323,0.005754516,0.0037609353,0.003316144,0.001220859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011559403,0.0007354564,0.0015493156,0.0022826272,0.0019155463,0.0022705584,0.0019252535,0.0022654622,0.00059973134],"category_scores_gemma":[0.041043185,0.0005150084,0.00051175256,0.0014165207,0.0026665132,0.005826425,0.002982588,0.0015811372,0.00027302318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019669197,0.00070707453,0.11726219,0.00026975918,0.00023124184,0.0011358347,0.0012774785,0.6466777,0.015079017,0.055817235,0.005389941,0.15418555],"study_design_scores_gemma":[0.000014027465,0.00007060893,0.002257498,0.000011005182,0.000010255708,0.00020705219,0.00017429574,0.9858537,0.0017086499,0.009360188,0.00031994333,0.000012823927],"about_ca_topic_score_codex":0.0061374577,"about_ca_topic_score_gemma":0.004947486,"teacher_disagreement_score":0.011559403,"about_ca_system_score_codex":0.0023592005,"about_ca_system_score_gemma":0.0023965426,"threshold_uncertainty_score":0.06113267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009076292,0.00006543077,0.9898956,0.00003786839,0.000016675644,0.000010607025,0.000009960616,0.00023765204,0.0006499416],"genre_scores_gemma":[0.6480441,0.0003674277,0.34775537,0.00012260533,0.00006137512,0.000077020195,0.000113882,0.000052362513,0.003405915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999298,0.00019455189,0.000020820551,0.00013086681,0.00029839098,0.00005729483],"domain_scores_gemma":[0.99953043,0.00018453506,0.00006110215,0.000066063396,0.00014066401,0.00001710993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006294997,0.0005430329,0.00054082955,0.0005551171,0.00023745817,0.00049483386,0.0009250728,0.00065522187,0.00077053806],"category_scores_gemma":[0.0016304199,0.0002460824,0.0005057477,0.0008746397,0.00045206954,0.0013083153,0.00094196695,0.00057408895,0.00044655794],"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.00035199343,0.00011973952,0.002582387,0.000162824,0.0000964085,0.00027766507,0.00020887941,0.5375238,0.0671683,0.012701488,0.0013383711,0.37746817],"study_design_scores_gemma":[0.000012294922,0.000074191514,0.00040601622,0.000004276468,0.000014783611,0.00009196962,0.000013342742,0.9918829,0.0054357797,0.001106044,0.0009461141,0.000012275321],"about_ca_topic_score_codex":0.0016706358,"about_ca_topic_score_gemma":0.00232523,"teacher_disagreement_score":0.0016706358,"about_ca_system_score_codex":0.0004290379,"about_ca_system_score_gemma":0.000499687,"threshold_uncertainty_score":0.0033291578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03385376,0.0005003729,0.95644784,0.0006529523,0.000119087235,0.00021378866,0.00009308755,0.00010982199,0.00800925],"genre_scores_gemma":[0.8968362,0.00044144786,0.09685844,0.00015771337,0.00009581064,0.00047773425,0.00007330394,0.000026319121,0.0050328984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566,0.0025681602,0.00017153655,0.00035487078,0.00088417804,0.00036124725],"domain_scores_gemma":[0.9957295,0.002445589,0.00057257,0.0004169629,0.00047696108,0.000358421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005397405,0.0008229084,0.0012447408,0.0007405974,0.0012366257,0.0017261755,0.0024662896,0.0017316467,0.0026397791],"category_scores_gemma":[0.008584958,0.00048171976,0.00075474364,0.0011710135,0.0018505993,0.0027815148,0.0019943547,0.0019536205,0.00036575124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032882876,0.00023890336,0.0006152327,0.00021739227,0.0000637232,0.00033321325,0.0003107456,0.26322672,0.004850516,0.6889689,0.0028874069,0.03795848],"study_design_scores_gemma":[0.000099343226,0.00015590624,0.00017414772,0.000030307423,0.000017358223,0.00016812577,0.000048852606,0.836278,0.0007499339,0.15822232,0.0040175365,0.000038185924],"about_ca_topic_score_codex":0.00088248606,"about_ca_topic_score_gemma":0.00068740716,"teacher_disagreement_score":0.005397405,"about_ca_system_score_codex":0.0015772472,"about_ca_system_score_gemma":0.0026627344,"threshold_uncertainty_score":0.028544545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027759777,0.0006232803,0.96579814,0.00024219335,0.000075278134,0.00003406832,0.000029185034,0.000086581735,0.005351517],"genre_scores_gemma":[0.9809511,0.00043759812,0.01669537,0.00007433955,0.00004613132,0.000046322435,0.000013694609,0.000014111009,0.001721322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952817,0.00013791525,0.000026336602,0.00009956112,0.00013421083,0.000073882555],"domain_scores_gemma":[0.99927527,0.00046784058,0.00009026949,0.000045593868,0.00009593461,0.000025076664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008620035,0.0006752348,0.00069993624,0.00025878617,0.0004902112,0.0011297883,0.00077395147,0.00072337425,0.0011485509],"category_scores_gemma":[0.0020526708,0.00026584195,0.00035065814,0.0005792809,0.0010323573,0.0009556431,0.0008043552,0.000680772,0.0001620024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019448281,0.00009997311,0.0006512398,0.00025121256,0.00006452048,0.00036617625,0.00029112058,0.8251462,0.019227698,0.08963544,0.0012735983,0.0627982],"study_design_scores_gemma":[0.0000072614057,0.00005695557,0.000088238405,0.000008168773,0.000014247777,0.000040578616,0.000028626853,0.98859394,0.0011751099,0.009494018,0.00048473885,0.000008147891],"about_ca_topic_score_codex":0.0013474188,"about_ca_topic_score_gemma":0.0017343592,"teacher_disagreement_score":0.0013474188,"about_ca_system_score_codex":0.00077858224,"about_ca_system_score_gemma":0.00055995426,"threshold_uncertainty_score":0.00564909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2917125,0.0014307332,0.69413596,0.00039313958,0.00012992007,0.00031475953,0.0007323715,0.00087160134,0.010278983],"genre_scores_gemma":[0.95703655,0.00024479366,0.041448563,0.000060532584,0.000039730126,0.00009675016,0.0003158387,0.000052737167,0.0007045289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865603,0.00031793443,0.00015381371,0.0001563762,0.0005896249,0.00012620389],"domain_scores_gemma":[0.9938928,0.002490632,0.0009268097,0.0006260519,0.0017882494,0.0002756117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388917,0.0007524743,0.00063170714,0.0011261308,0.00041272122,0.0012734181,0.00070724287,0.00066435424,0.0009087472],"category_scores_gemma":[0.0115992855,0.00014473825,0.00028034137,0.001318418,0.0005270098,0.0016650201,0.00057816226,0.00068689015,0.00024252842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006351332,0.00047768693,0.055004325,0.000547518,0.00020239303,0.00047855443,0.0004788758,0.6471166,0.06611112,0.053014502,0.0040375204,0.17189582],"study_design_scores_gemma":[0.0000125847155,0.00068772334,0.012685518,0.000059795468,0.000055690874,0.0005569239,0.00011065803,0.95882076,0.01389342,0.009006084,0.004057239,0.000053568732],"about_ca_topic_score_codex":0.0020585437,"about_ca_topic_score_gemma":0.002680017,"teacher_disagreement_score":0.0020585437,"about_ca_system_score_codex":0.0011859846,"about_ca_system_score_gemma":0.00069366756,"threshold_uncertainty_score":0.010782838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03348449,0.0002284084,0.96456313,0.00018391186,0.000036426303,0.00004347037,0.000012756557,0.00013605358,0.0013113559],"genre_scores_gemma":[0.9622783,0.000114759445,0.036405854,0.00011716492,0.000032645767,0.00006291628,0.000017263657,0.00001759091,0.0009533915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.00031237723,0.000035251396,0.00017148345,0.00020558634,0.00018975009],"domain_scores_gemma":[0.994915,0.0036968954,0.00039171343,0.00022014958,0.00057524914,0.00020095072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024960213,0.0006188281,0.0011772626,0.00034601867,0.00067888113,0.000696517,0.0014834886,0.0008548631,0.0011350288],"category_scores_gemma":[0.00570555,0.0003046891,0.0003376263,0.00052171235,0.001379532,0.001057959,0.0012697884,0.0009842569,0.00013880042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001551951,0.00010987446,0.00067122496,0.000050107312,0.00002693884,0.0000719097,0.000079018566,0.95521986,0.002148196,0.011761343,0.0006767546,0.029029649],"study_design_scores_gemma":[0.0000065337513,0.000021588241,0.00003732259,0.0000013187058,0.0000023140722,0.000006646245,0.0000046910286,0.99720085,0.0001978642,0.0024588003,0.000059464703,0.000002606701],"about_ca_topic_score_codex":0.0029661353,"about_ca_topic_score_gemma":0.0018864959,"teacher_disagreement_score":0.0029661353,"about_ca_system_score_codex":0.0009972664,"about_ca_system_score_gemma":0.0013049049,"threshold_uncertainty_score":0.013200343},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009556747,0.0014319011,0.9839409,0.0002369996,0.0003128544,0.00021059006,0.000059120757,0.0004275193,0.0038233951],"genre_scores_gemma":[0.539279,0.0028077199,0.4429548,0.00064215035,0.00030489996,0.00064165815,0.00043793774,0.00008352491,0.0128482375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887484,0.0002207448,0.00008579688,0.0001473456,0.00052941346,0.00014179904],"domain_scores_gemma":[0.99913836,0.00024163988,0.000087148874,0.00014053243,0.00034324438,0.00004901474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074874866,0.00046953993,0.00067690224,0.0007220674,0.00094032055,0.0009017904,0.0013823498,0.0008479911,0.0013309835],"category_scores_gemma":[0.0018299303,0.00033152002,0.0002921578,0.0011434876,0.00045565283,0.002207977,0.001767214,0.0011840041,0.0006258332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007660294,0.0002848477,0.0009238858,0.0007345908,0.00013793276,0.0019491377,0.00066578895,0.065918654,0.18354958,0.25284186,0.018232444,0.47399527],"study_design_scores_gemma":[0.00022426942,0.0010783356,0.00053518394,0.000107906955,0.000143904,0.004965931,0.00022444573,0.75190246,0.07195442,0.04480527,0.1238512,0.00020667368],"about_ca_topic_score_codex":0.0005212404,"about_ca_topic_score_gemma":0.000605694,"teacher_disagreement_score":0.0013823498,"about_ca_system_score_codex":0.00058227975,"about_ca_system_score_gemma":0.0013118659,"threshold_uncertainty_score":0.0044525266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1816228,0.0036957127,0.7847737,0.0009763675,0.00008441178,0.00007077192,0.00016477829,0.0001523392,0.028459132],"genre_scores_gemma":[0.98355836,0.0011396561,0.013442204,0.00011337053,0.00006728836,0.000046130634,0.00004580614,0.000026807766,0.0015603368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987556,0.0005018041,0.00003218693,0.0000720853,0.0004728076,0.00016560711],"domain_scores_gemma":[0.9931605,0.005094766,0.0005203342,0.0002790034,0.00085418567,0.000091144284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021662258,0.0006932014,0.0007935279,0.00082968414,0.00052179245,0.0010085232,0.0006850923,0.0010126011,0.0010272454],"category_scores_gemma":[0.009025591,0.0002908724,0.00037024097,0.0010293905,0.0016553759,0.0013196397,0.0010610451,0.000868986,0.00020432721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056781613,0.00003411408,0.0011940188,0.00015269665,0.000034803612,0.0004210135,0.00027803844,0.8686118,0.004218879,0.11534285,0.0008997456,0.008755257],"study_design_scores_gemma":[0.0000033214535,0.000020736194,0.00025936848,0.000016226708,0.0000065076197,0.00015424233,0.000039605227,0.9867736,0.0006872155,0.011715074,0.00031502603,0.000009115771],"about_ca_topic_score_codex":0.0024089427,"about_ca_topic_score_gemma":0.0018560968,"teacher_disagreement_score":0.0024089427,"about_ca_system_score_codex":0.0017865024,"about_ca_system_score_gemma":0.0008369121,"threshold_uncertainty_score":0.012962043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09043101,0.00037266788,0.9032173,0.000113786875,0.000031035328,0.000031997693,0.000018935132,0.00010187075,0.0056814044],"genre_scores_gemma":[0.9734042,0.00008923627,0.02577509,0.000020418742,0.000008274517,0.000028684177,0.000005592655,0.0000048970273,0.0006635726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976045,0.00007728069,0.000007434984,0.000030487765,0.00007204053,0.00005246476],"domain_scores_gemma":[0.99971396,0.00017347033,0.000035420067,0.000022570477,0.00004016729,0.0000143630405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044158596,0.00046020036,0.00038191598,0.00023083354,0.0003526858,0.00068117667,0.0005745561,0.0003880317,0.00051616086],"category_scores_gemma":[0.00092913257,0.0001791569,0.00024308472,0.00044308434,0.0005468983,0.0004610032,0.0006467816,0.00036105135,0.00011426906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017520331,0.00009851616,0.00062138075,0.000092067065,0.00003414141,0.00023332443,0.00019719728,0.90957516,0.022690065,0.020824147,0.0005977801,0.044860937],"study_design_scores_gemma":[0.000009437653,0.000037485708,0.00008427137,0.000002851122,0.000004331852,0.000034779518,0.000020093434,0.99606293,0.0012524514,0.0022628023,0.00022313566,0.000005499566],"about_ca_topic_score_codex":0.001796751,"about_ca_topic_score_gemma":0.0026974715,"teacher_disagreement_score":0.001796751,"about_ca_system_score_codex":0.0005089976,"about_ca_system_score_gemma":0.0005698851,"threshold_uncertainty_score":0.0036930442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035202805,0.0005294297,0.9593471,0.00026852463,0.00011655065,0.00004733006,0.000030043018,0.0011783413,0.003279765],"genre_scores_gemma":[0.7830416,0.00047837268,0.21335077,0.0003414302,0.000124258,0.00004832107,0.000065640925,0.000098166885,0.0024514217],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989336,0.00030616872,0.000082019855,0.00021458842,0.0003747896,0.00008880208],"domain_scores_gemma":[0.9984779,0.00044163532,0.00018733118,0.00056500436,0.00027013454,0.000057916226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097266666,0.00051153236,0.00032683564,0.00030050517,0.0002897012,0.0008030185,0.0007394207,0.00071937835,0.0011515236],"category_scores_gemma":[0.0019519466,0.00028526352,0.00030232445,0.00028987412,0.00082729285,0.00154463,0.00075356284,0.00089728675,0.0006059766],"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.0007934095,0.00013187523,0.0069109774,0.00075606647,0.000082165265,0.0008264816,0.000771921,0.031005658,0.57862294,0.078145474,0.002327763,0.29962534],"study_design_scores_gemma":[0.000074314295,0.0012821166,0.00289153,0.00012494191,0.00009988729,0.0037215683,0.00023022704,0.34164372,0.56178313,0.024235953,0.063797414,0.00011512076],"about_ca_topic_score_codex":0.0003877385,"about_ca_topic_score_gemma":0.00043563452,"teacher_disagreement_score":0.0011515236,"about_ca_system_score_codex":0.00041118334,"about_ca_system_score_gemma":0.00024958493,"threshold_uncertainty_score":0.0051440597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008170707,0.00010583547,0.9975594,0.000069623726,0.000017277644,0.000029934568,0.00001920226,0.00012500245,0.0012566625],"genre_scores_gemma":[0.13827561,0.00037182166,0.85689825,0.00019307494,0.000104986546,0.00049269525,0.00024763265,0.0001966642,0.0032192434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.000341475,0.000045713605,0.00015765622,0.0002888087,0.000117694006],"domain_scores_gemma":[0.9982405,0.0011859004,0.00015266353,0.00017106364,0.00020805035,0.000041825264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015557684,0.0017086415,0.0011576148,0.0007992976,0.00055915106,0.0010572337,0.0012811371,0.0013223655,0.006710436],"category_scores_gemma":[0.0044700494,0.00061719917,0.0010693388,0.0008836465,0.0007358519,0.0014131671,0.0016293064,0.002461721,0.001964711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015544819,0.00011908559,0.00023856343,0.00022846484,0.000058539306,0.00007680368,0.00009159915,0.7257418,0.0043394947,0.083186984,0.005458103,0.18030506],"study_design_scores_gemma":[0.000020693142,0.00003198519,0.000032145,0.000011292707,0.000004318079,0.000023041013,0.0000121505045,0.97877866,0.0007519815,0.01924836,0.0010779751,0.000007420983],"about_ca_topic_score_codex":0.0011797076,"about_ca_topic_score_gemma":0.0016177878,"teacher_disagreement_score":0.006710436,"about_ca_system_score_codex":0.00096865767,"about_ca_system_score_gemma":0.0012615415,"threshold_uncertainty_score":0.022448659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.397071,0.0011839827,0.589708,0.00038546455,0.000062934596,0.000099813784,0.00010863178,0.00010102909,0.011279223],"genre_scores_gemma":[0.9783036,0.0005515701,0.019580685,0.000042561693,0.000040284456,0.00003351568,0.000024659308,0.000008365426,0.0014147853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999423,0.0002484537,0.000017353093,0.000056600344,0.00017366016,0.000080866135],"domain_scores_gemma":[0.99902296,0.00061169756,0.00014526882,0.000064674714,0.00012951565,0.00002582878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061158364,0.00057341985,0.0005725103,0.00025637893,0.00039280177,0.0007071064,0.0004687499,0.0006128431,0.00050350063],"category_scores_gemma":[0.0018281355,0.00017241301,0.00021620572,0.00052442314,0.00092683197,0.0008627291,0.00061634916,0.0003236987,0.00017025687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018418537,0.000070366725,0.0017843831,0.00015429778,0.00004806206,0.0006606621,0.00015481676,0.89079744,0.027114775,0.06536317,0.00040236014,0.013265564],"study_design_scores_gemma":[0.000025256533,0.00010395014,0.0005622563,0.000006841193,0.000015029992,0.00012454687,0.000027203421,0.984908,0.00394123,0.010015577,0.00025547002,0.000014589354],"about_ca_topic_score_codex":0.0011091506,"about_ca_topic_score_gemma":0.001186163,"teacher_disagreement_score":0.0011091506,"about_ca_system_score_codex":0.0005060416,"about_ca_system_score_gemma":0.00039442859,"threshold_uncertainty_score":0.0036716461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09134316,0.002756211,0.89395833,0.0003828465,0.00018255746,0.00004292237,0.000037122343,0.00016279946,0.011134157],"genre_scores_gemma":[0.87132984,0.0013611775,0.12521075,0.00010228004,0.00012167422,0.000028641205,0.000040152914,0.000018933968,0.0017865808],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998658,0.00002421831,0.0000058752134,0.00001377656,0.000076188306,0.000014259413],"domain_scores_gemma":[0.99981576,0.00006267854,0.00003781285,0.000023924462,0.00005282171,0.000007052586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023538839,0.00028854178,0.0002781089,0.00020655656,0.00030161167,0.00043220056,0.00026105664,0.00037742863,0.00062391435],"category_scores_gemma":[0.0004782943,0.00008678328,0.00018340802,0.00032795395,0.00029173587,0.00074333657,0.00024771044,0.00038364984,0.00021863631],"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.00036109626,0.00012523621,0.0027360616,0.00041047396,0.00006951863,0.0006961015,0.00025672183,0.11246322,0.47947308,0.13864242,0.0022673532,0.26249868],"study_design_scores_gemma":[0.00001512823,0.00020233147,0.0008259589,0.000039206952,0.000027864216,0.0006598562,0.000044810648,0.93107784,0.045439865,0.0108889,0.010755536,0.000022679107],"about_ca_topic_score_codex":0.00025712606,"about_ca_topic_score_gemma":0.00042700573,"teacher_disagreement_score":0.00062391435,"about_ca_system_score_codex":0.00035955338,"about_ca_system_score_gemma":0.00020181728,"threshold_uncertainty_score":0.0026087165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824723,0.0010175993,0.16053891,0.0002827178,0.000049048467,0.000033683747,0.00033352737,0.00029413914,0.012727296],"genre_scores_gemma":[0.99692637,0.00039096302,0.0020050441,0.000022265313,0.0000139119265,0.000008007972,0.00004995326,0.0000145396125,0.0005688527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983247,0.00058211404,0.00005512788,0.00018167018,0.00045200868,0.00040445873],"domain_scores_gemma":[0.99282223,0.004546934,0.00086481427,0.0006726463,0.00093466096,0.00015875406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022945146,0.0012206214,0.0010241454,0.0006290091,0.0005547617,0.0014570416,0.0006461044,0.00083518936,0.0010465937],"category_scores_gemma":[0.006911836,0.00040652617,0.00042897798,0.0011145194,0.0023723622,0.0017706831,0.0013677386,0.0007469705,0.0003041748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004562793,0.000039723196,0.0023591162,0.000105583196,0.00008768403,0.0004887519,0.00013091096,0.94416916,0.012492913,0.0331204,0.00047539137,0.0060741007],"study_design_scores_gemma":[0.000019324165,0.00017680158,0.0009961725,0.000030399151,0.000046430196,0.00035797115,0.00008625072,0.9779009,0.012800621,0.00731692,0.00021539057,0.000052834996],"about_ca_topic_score_codex":0.0022672887,"about_ca_topic_score_gemma":0.0015082016,"teacher_disagreement_score":0.0022945146,"about_ca_system_score_codex":0.0011590343,"about_ca_system_score_gemma":0.001479039,"threshold_uncertainty_score":0.012134671},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1980741,0.00043354626,0.7924939,0.00028460572,0.00007705302,0.00015969746,0.00016668264,0.0004216252,0.007888853],"genre_scores_gemma":[0.63345695,0.0003169895,0.3624099,0.00012848945,0.000017018036,0.00017596543,0.00019519251,0.00005454358,0.0032450035],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999824,0.000032554264,0.000009957269,0.000025999163,0.000084231746,0.000023202556],"domain_scores_gemma":[0.99958724,0.00012739917,0.000072285344,0.00009465741,0.00008822359,0.00003023921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024589946,0.0003029093,0.0002823424,0.00038431425,0.00036815787,0.0002836807,0.00056570634,0.0003640984,0.00083213614],"category_scores_gemma":[0.00067211385,0.00019595923,0.0002882935,0.00032871333,0.0005186536,0.0003553788,0.00061127706,0.0006033611,0.00023153955],"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.00020988872,0.00014709058,0.002549201,0.0006227747,0.00008516125,0.00076082116,0.0004103058,0.2172691,0.432517,0.22974093,0.0019368975,0.1137508],"study_design_scores_gemma":[0.00009546359,0.00026338644,0.0008697038,0.000047727266,0.000048535807,0.00071729464,0.000042798318,0.75993747,0.19767962,0.028609693,0.011619387,0.00006889283],"about_ca_topic_score_codex":0.00077853247,"about_ca_topic_score_gemma":0.0013125595,"teacher_disagreement_score":0.00083213614,"about_ca_system_score_codex":0.00043946702,"about_ca_system_score_gemma":0.001085681,"threshold_uncertainty_score":0.0031885505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059275664,0.0014874277,0.91849554,0.00084563886,0.00007757732,0.00010413127,0.0001969027,0.00032604323,0.01919107],"genre_scores_gemma":[0.9417573,0.0017757083,0.050396107,0.00018320221,0.00015875709,0.00021649004,0.00013352276,0.00016446684,0.0052144206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973143,0.0011155778,0.000080954575,0.00022283464,0.00084449496,0.00042183674],"domain_scores_gemma":[0.9899592,0.0071926536,0.00091862393,0.0005308856,0.0011304932,0.00026823196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040493235,0.0015891311,0.0011946788,0.001130387,0.00059708575,0.0017775656,0.0015243544,0.0010569199,0.003339401],"category_scores_gemma":[0.017238852,0.0006938626,0.00065175287,0.0012669421,0.0021962498,0.0020704356,0.0017690059,0.001331738,0.00078044855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014875323,0.000062595645,0.00091423397,0.00023110893,0.00005890083,0.00030207206,0.00017819328,0.8346721,0.0069891494,0.1405305,0.0017379523,0.014174545],"study_design_scores_gemma":[0.0000071702893,0.000032352655,0.0001895247,0.000016862294,0.00001023794,0.000078960824,0.000029398967,0.9849513,0.0010470646,0.013281309,0.0003415488,0.000014260979],"about_ca_topic_score_codex":0.0016636557,"about_ca_topic_score_gemma":0.001232446,"teacher_disagreement_score":0.0040493235,"about_ca_system_score_codex":0.0021244092,"about_ca_system_score_gemma":0.0018764114,"threshold_uncertainty_score":0.021415114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40547752,0.0038783618,0.56858814,0.0010607342,0.000062132334,0.00008233913,0.00033984176,0.00027425133,0.020236714],"genre_scores_gemma":[0.993989,0.0006159951,0.004097425,0.00005546554,0.00004692334,0.000041828396,0.00006484233,0.000018057224,0.0010704849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988003,0.00055299874,0.000025356378,0.00010672767,0.00030984066,0.00020485546],"domain_scores_gemma":[0.99189055,0.0064242445,0.0006120626,0.0002984121,0.0006231198,0.00015162792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016404251,0.00069302734,0.00067977386,0.0013461008,0.0005450119,0.00090713945,0.0008981541,0.0007957489,0.0011648084],"category_scores_gemma":[0.010584616,0.00045972728,0.0004837121,0.000917448,0.0013736391,0.0013224435,0.0013589116,0.0005395416,0.00022486958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019001492,0.000032619304,0.0047896313,0.00009873171,0.000076784105,0.00036313882,0.00020068427,0.93294483,0.0042655882,0.044701606,0.0011348382,0.011201493],"study_design_scores_gemma":[0.0000059476356,0.00003713318,0.0011554179,0.000011473117,0.000014503242,0.00012162598,0.000056456942,0.9906104,0.00064903416,0.0068945214,0.00043491763,0.000008520636],"about_ca_topic_score_codex":0.004070532,"about_ca_topic_score_gemma":0.0018576044,"teacher_disagreement_score":0.004070532,"about_ca_system_score_codex":0.0017107804,"about_ca_system_score_gemma":0.00041744308,"threshold_uncertainty_score":0.012412667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08319852,0.0006460065,0.9125279,0.00014845486,0.00013106831,0.000083169834,0.000036455065,0.0002704563,0.0029579874],"genre_scores_gemma":[0.93968856,0.00020250652,0.05855498,0.000058831174,0.000043670658,0.000049108854,0.000032270753,0.00002546728,0.0013445462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995809,0.00006383372,0.000019580613,0.00007360879,0.0001310855,0.00013105515],"domain_scores_gemma":[0.99965894,0.00012230263,0.00004618504,0.0000670275,0.00006487699,0.000040707422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030314387,0.0006607075,0.0007061643,0.00028131114,0.00082757784,0.0005323084,0.0008845498,0.00039498977,0.0010431146],"category_scores_gemma":[0.0007621105,0.00022916014,0.0003255528,0.00063324004,0.00045514124,0.00083920284,0.0008338486,0.00047773088,0.00017186119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000560731,0.00016124675,0.0010686084,0.00019581654,0.00006495527,0.00040868734,0.00017402903,0.79311055,0.037318744,0.019545069,0.003095908,0.14429565],"study_design_scores_gemma":[0.000012031202,0.00007382744,0.00016288394,0.0000038365456,0.0000089491805,0.00007540103,0.000027927557,0.9917767,0.0025890695,0.0043597007,0.0009019388,0.000007725771],"about_ca_topic_score_codex":0.0026512698,"about_ca_topic_score_gemma":0.0045228377,"teacher_disagreement_score":0.0026512698,"about_ca_system_score_codex":0.0004992085,"about_ca_system_score_gemma":0.0010748708,"threshold_uncertainty_score":0.005271673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0903382,0.0016216283,0.73652136,0.0057584336,0.0007002515,0.00025760249,0.0012375112,0.0012039432,0.16236106],"genre_scores_gemma":[0.6966097,0.0016317012,0.25222602,0.0019749415,0.0005470361,0.0007022369,0.0010312718,0.0006544993,0.044622634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831426,0.00058531377,0.00008260583,0.00043006949,0.0002513855,0.00033642596],"domain_scores_gemma":[0.9965475,0.0014104552,0.00034253867,0.0009335079,0.0005116348,0.00025435595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226078,0.00090155675,0.0007253088,0.0010302828,0.0021168867,0.003256575,0.002046568,0.002015139,0.0121457735],"category_scores_gemma":[0.007709785,0.0003884808,0.00078153436,0.0014752974,0.002230438,0.007832242,0.002972967,0.0025843214,0.0022111803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049205508,0.000010591705,0.00013272837,0.000051878476,0.0000072510743,0.0001488767,0.00008771847,0.003330261,0.00048817403,0.98180294,0.005415405,0.008474985],"study_design_scores_gemma":[0.000029524861,0.000034848425,0.0001728489,0.000057516078,0.00002564284,0.00044918398,0.00017110059,0.07608362,0.0012999435,0.8834021,0.038238104,0.00003556725],"about_ca_topic_score_codex":0.0024359028,"about_ca_topic_score_gemma":0.0031821053,"teacher_disagreement_score":0.0121457735,"about_ca_system_score_codex":0.002689938,"about_ca_system_score_gemma":0.00082775374,"threshold_uncertainty_score":0.04063171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19528238,0.00057928736,0.79645914,0.0002488805,0.00018981035,0.00015908525,0.00012830223,0.0023813683,0.0045716995],"genre_scores_gemma":[0.96562386,0.00009507709,0.03348351,0.000029497303,0.000010160956,0.00003318803,0.00008544498,0.000013462646,0.00062590436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994535,0.000112281785,0.000036977126,0.00009034183,0.00022131314,0.00008563521],"domain_scores_gemma":[0.99866974,0.00048466053,0.00021652323,0.00025612576,0.00031087123,0.00006212588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049892213,0.00038647657,0.0003955467,0.00083402265,0.0003588849,0.0004972905,0.0007689789,0.00037557658,0.0006843386],"category_scores_gemma":[0.002727001,0.00015001252,0.00025893818,0.00038364233,0.00035309946,0.0009802366,0.00065056665,0.00039928482,0.00015921677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010892333,0.000202911,0.0143981,0.0003242348,0.00013077664,0.0009203888,0.00035595422,0.43166837,0.10991276,0.014486866,0.0040874463,0.42242303],"study_design_scores_gemma":[0.0000146343755,0.00016338138,0.0016636492,0.000011863083,0.000022386033,0.00030915585,0.00004291997,0.96794933,0.026609544,0.0015451146,0.0016517183,0.000016259819],"about_ca_topic_score_codex":0.0018931861,"about_ca_topic_score_gemma":0.0023372353,"teacher_disagreement_score":0.0018931861,"about_ca_system_score_codex":0.0006106962,"about_ca_system_score_gemma":0.00048755304,"threshold_uncertainty_score":0.00443089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01025327,0.0001874201,0.9886996,0.00007697334,0.000017234583,0.000008301965,0.000016960656,0.0002424545,0.0004977158],"genre_scores_gemma":[0.51604253,0.00043451277,0.47815388,0.00016201391,0.00006318754,0.000056511017,0.00014257088,0.000060578983,0.004884233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971884,0.00009383511,0.000017528473,0.000052908697,0.00009554513,0.000021287857],"domain_scores_gemma":[0.99966586,0.00015567458,0.000048203714,0.000042247848,0.00007886188,0.000009218943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004800709,0.000379585,0.00041483025,0.0003095516,0.0001918792,0.0003504112,0.00043851728,0.0003978856,0.00093779434],"category_scores_gemma":[0.001337952,0.00017481817,0.0003099789,0.00037097142,0.00034265014,0.0005417823,0.0004828997,0.00072039576,0.00030590285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028667308,0.00009154028,0.00206201,0.00020728019,0.00010876963,0.0001624257,0.000120502555,0.31749874,0.07386904,0.026281536,0.001731208,0.57758033],"study_design_scores_gemma":[0.000005395637,0.00003187504,0.00027371207,0.0000066538832,0.00000658677,0.00006468688,0.0000057339275,0.9859201,0.010813245,0.0019996453,0.0008643573,0.000008126722],"about_ca_topic_score_codex":0.00075465225,"about_ca_topic_score_gemma":0.0013337238,"teacher_disagreement_score":0.00093779434,"about_ca_system_score_codex":0.00025568932,"about_ca_system_score_gemma":0.00040496435,"threshold_uncertainty_score":0.0031372309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23378198,0.001299888,0.75679207,0.00039352808,0.00011029587,0.00007217971,0.00005417742,0.0003375755,0.007158291],"genre_scores_gemma":[0.9868607,0.00015532337,0.01229488,0.000027145576,0.000010659943,0.000012373134,0.000013479222,0.000014553527,0.00061084476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.00007680956,0.000014077,0.00005177402,0.00008485778,0.00011879571],"domain_scores_gemma":[0.9996513,0.00015816212,0.00003535292,0.000047911482,0.0000785619,0.000028679513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032500332,0.0005805054,0.0005133981,0.00025441046,0.00044469396,0.0005654721,0.0008274012,0.00035781186,0.0005847792],"category_scores_gemma":[0.0010458326,0.00019092036,0.00023707065,0.00039783708,0.00041628012,0.0007210449,0.00049727864,0.0003271876,0.00010418889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016606048,0.000040715557,0.0010452872,0.00007496526,0.000031720927,0.00019052094,0.00006057374,0.9330345,0.017229652,0.009686347,0.00082613906,0.037613504],"study_design_scores_gemma":[0.000002682741,0.00003130751,0.00019722748,0.000003636571,0.0000072792236,0.000048135105,0.000019763276,0.9955193,0.0023113184,0.0014335297,0.00042188502,0.0000040079913],"about_ca_topic_score_codex":0.004395747,"about_ca_topic_score_gemma":0.0061270013,"teacher_disagreement_score":0.004395747,"about_ca_system_score_codex":0.00093545084,"about_ca_system_score_gemma":0.00066461356,"threshold_uncertainty_score":0.008740306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22644733,0.000611542,0.7582431,0.00034165234,0.00007462853,0.00007887164,0.00013165215,0.00036446907,0.013706792],"genre_scores_gemma":[0.85077626,0.00039435987,0.14489143,0.00018096052,0.000026462274,0.00009119629,0.00007933222,0.000049758684,0.0035102633],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965286,0.000057990906,0.000020818652,0.00006250353,0.00016770417,0.00003816915],"domain_scores_gemma":[0.9993217,0.00020971832,0.00017328754,0.00009988441,0.00015468484,0.00004078499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022183478,0.0005174897,0.00034283803,0.00033936716,0.00038300015,0.00046926294,0.00068241864,0.00047367436,0.00070097495],"category_scores_gemma":[0.0011264457,0.00018656078,0.00023078028,0.00046837807,0.0006116929,0.0005117201,0.00057371694,0.0004927184,0.00029524043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002791498,0.00013446291,0.001957733,0.0004894569,0.00012315887,0.0005496024,0.00028940666,0.32545686,0.45114246,0.15573627,0.001075843,0.06276558],"study_design_scores_gemma":[0.000052941097,0.00027711416,0.00052583794,0.00003590985,0.000073638104,0.00044169027,0.00004055428,0.82766414,0.14733401,0.018438978,0.005068558,0.00004662524],"about_ca_topic_score_codex":0.00072997034,"about_ca_topic_score_gemma":0.0016984693,"teacher_disagreement_score":0.00072997034,"about_ca_system_score_codex":0.00058705936,"about_ca_system_score_gemma":0.00076827605,"threshold_uncertainty_score":0.004259467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4533157,0.0013220749,0.5317404,0.00036017134,0.00006137044,0.000033282315,0.000114249044,0.00022159524,0.0128311],"genre_scores_gemma":[0.993371,0.00048709207,0.005120967,0.000022509168,0.00002119863,0.000011551817,0.000015902393,0.000006774558,0.00094292406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.00022883994,0.00002361623,0.000104398736,0.00018340135,0.00013795543],"domain_scores_gemma":[0.99797076,0.0012302467,0.00031863383,0.0001820733,0.00024567606,0.00005269478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432548,0.0005980503,0.00070373935,0.00047870254,0.00049738056,0.0009003278,0.0005399691,0.0007715818,0.0008283767],"category_scores_gemma":[0.002180242,0.00024179996,0.00035084022,0.0005584469,0.0014935462,0.0019569965,0.0008349506,0.0005915854,0.0002495997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044459052,0.000063191525,0.0015892539,0.00024153732,0.000085846594,0.0015414922,0.00043801163,0.80371714,0.052892305,0.11947869,0.00072457944,0.018783392],"study_design_scores_gemma":[0.000012400587,0.00014862827,0.00039229245,0.000011078193,0.000027354488,0.00039491153,0.000103925246,0.9819292,0.0060654623,0.01035902,0.0005357432,0.00002002706],"about_ca_topic_score_codex":0.0010003785,"about_ca_topic_score_gemma":0.0005750763,"teacher_disagreement_score":0.0010003785,"about_ca_system_score_codex":0.00075986714,"about_ca_system_score_gemma":0.0003773092,"threshold_uncertainty_score":0.005513251},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054074924,0.00071284134,0.9403959,0.00036141856,0.000081360566,0.00005548615,0.000043308453,0.00013870606,0.004136059],"genre_scores_gemma":[0.9543411,0.0002921286,0.042675193,0.000067636836,0.00005194722,0.0000662604,0.000023831166,0.000045184806,0.0024366276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983265,0.0008385231,0.00005217819,0.0002587827,0.00028451902,0.0002395646],"domain_scores_gemma":[0.9965593,0.0025322756,0.00026202304,0.0002064123,0.00032147364,0.00011842426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033459556,0.001248921,0.0016057732,0.00045351937,0.00071690226,0.0017466014,0.0017827972,0.0013119096,0.0016202898],"category_scores_gemma":[0.0065020607,0.0005821868,0.00042845772,0.0007068763,0.0013518127,0.0016591335,0.0015866968,0.0011192049,0.00037893475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018794536,0.000042343338,0.00042402677,0.00006221586,0.000028700597,0.00019754238,0.000088729415,0.9449722,0.0032347287,0.036368255,0.0005993378,0.013793983],"study_design_scores_gemma":[0.000009752079,0.000023348843,0.00003803023,0.0000026957482,0.0000043118457,0.000025937554,0.000011027309,0.99376786,0.00046723412,0.005471571,0.00017317044,0.0000049876053],"about_ca_topic_score_codex":0.0014063322,"about_ca_topic_score_gemma":0.0011462382,"teacher_disagreement_score":0.0033459556,"about_ca_system_score_codex":0.0014490625,"about_ca_system_score_gemma":0.00088400935,"threshold_uncertainty_score":0.017695308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059187137,0.00029217236,0.9370597,0.0002772899,0.000059400205,0.0000388905,0.00004883128,0.00014618311,0.0028903408],"genre_scores_gemma":[0.95322716,0.00024053006,0.043587,0.00009547099,0.000047127713,0.000082101695,0.00006378459,0.00006954683,0.0025871876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991366,0.00033091792,0.000018716299,0.00012007831,0.00015332815,0.0002404363],"domain_scores_gemma":[0.99833125,0.0012089446,0.00017212967,0.000041629133,0.00013467531,0.00011141437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014741177,0.0009908264,0.0012363454,0.0003001221,0.0003776878,0.0010792465,0.0009118015,0.0008178966,0.001919473],"category_scores_gemma":[0.0036768212,0.00055101904,0.00048644896,0.0005176105,0.0011641729,0.0010272866,0.0011060386,0.0012689898,0.00018940688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073369105,0.000031242143,0.00013101278,0.000025916066,0.000011476781,0.000035929355,0.000024737112,0.9891139,0.00083369296,0.0054300753,0.00028964295,0.0039989697],"study_design_scores_gemma":[0.000007389511,0.00002815345,0.000036359652,0.0000012704993,0.0000035371506,0.000006411785,0.000008867092,0.99800295,0.00023030335,0.00159597,0.0000759134,0.0000028840816],"about_ca_topic_score_codex":0.004310435,"about_ca_topic_score_gemma":0.002594769,"teacher_disagreement_score":0.004310435,"about_ca_system_score_codex":0.0009470472,"about_ca_system_score_gemma":0.0016617886,"threshold_uncertainty_score":0.008570671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086251624,0.00046382064,0.90984666,0.00012034624,0.000020202706,0.000023806853,0.000098725795,0.00021713183,0.0029576842],"genre_scores_gemma":[0.9495879,0.0007032118,0.048054293,0.000059267808,0.000038390783,0.00005630705,0.00015336482,0.000059614627,0.0012875912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.00038236834,0.00004211581,0.0001436227,0.00035892686,0.00015837206],"domain_scores_gemma":[0.9970816,0.0021391204,0.0002960067,0.00019389871,0.00022914933,0.000060198116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020248939,0.0010585912,0.000656988,0.0009539606,0.00024577242,0.0009344768,0.0008637058,0.0006473921,0.00083937275],"category_scores_gemma":[0.008502716,0.00031825824,0.0005384327,0.00092429796,0.0013256896,0.0016945766,0.0010583563,0.00074802083,0.00019084428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008788817,0.000015027205,0.0014233913,0.000049367318,0.000037555674,0.00009886264,0.000057086607,0.9552381,0.0021306588,0.029607313,0.00019645234,0.011058183],"study_design_scores_gemma":[0.000002387104,0.000016555772,0.00029045052,0.000006780339,0.000008035819,0.000038727325,0.000010754693,0.9924717,0.0011866497,0.0058515547,0.00010773618,0.000008670102],"about_ca_topic_score_codex":0.0017176757,"about_ca_topic_score_gemma":0.0014213035,"teacher_disagreement_score":0.0020248939,"about_ca_system_score_codex":0.0013636682,"about_ca_system_score_gemma":0.00070462923,"threshold_uncertainty_score":0.010708749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020318592,0.000614212,0.97036284,0.00021918716,0.000098313525,0.000051050174,0.000054092114,0.00013534375,0.008146339],"genre_scores_gemma":[0.6538758,0.0012493625,0.33547813,0.00048691398,0.0001662735,0.00028326325,0.00022644724,0.00009748296,0.00813635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993698,0.00016155586,0.000039059065,0.00008696721,0.00027161304,0.00007103413],"domain_scores_gemma":[0.99897444,0.00028750504,0.00017247595,0.00017082345,0.0003434857,0.00005140592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004980882,0.0003482646,0.00031993724,0.00051017525,0.00035937346,0.00079064013,0.0007825117,0.00059641607,0.001480427],"category_scores_gemma":[0.0023577306,0.00013929112,0.0001576108,0.000696168,0.0006965326,0.0007924711,0.0008345474,0.00071675266,0.00056740816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015584665,0.000044919034,0.00057413237,0.00027266852,0.000026069214,0.00016983885,0.0002477883,0.056339864,0.061090585,0.73126674,0.0020429732,0.1477686],"study_design_scores_gemma":[0.00007190486,0.00038850313,0.0006456612,0.00013817765,0.00003091702,0.0009067354,0.000080035796,0.6320422,0.07421071,0.25864655,0.032767933,0.000070606424],"about_ca_topic_score_codex":0.00040421396,"about_ca_topic_score_gemma":0.00051083195,"teacher_disagreement_score":0.001480427,"about_ca_system_score_codex":0.00056620856,"about_ca_system_score_gemma":0.00080650277,"threshold_uncertainty_score":0.00495255},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008543401,0.003878573,0.0055181026,0.77826595,0.19659734,0.0000971626,0.00092114735,0.00039752256,0.013469838],"genre_scores_gemma":[0.0132387895,0.0037596996,0.0039526382,0.85135514,0.08496971,0.00014560751,0.00029658925,0.00028176408,0.042000163],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99358433,0.0016005278,0.00072852866,0.000804222,0.0027824426,0.0004998295],"domain_scores_gemma":[0.98159057,0.0087822825,0.0009178474,0.0006187118,0.007632327,0.00045832686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005384512,0.0015201609,0.0011472311,0.0008668949,0.002558054,0.001998032,0.004272133,0.01717485,0.016098991],"category_scores_gemma":[0.029506652,0.0007226308,0.0015648343,0.0011865416,0.002481578,0.0031488875,0.0014260162,0.014077083,0.0125170825],"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.00004521865,0.0000123998625,0.00009357555,0.00008984393,0.000008402298,0.00019126588,0.00011777155,0.00021218136,0.00030610024,0.005251544,0.99050176,0.0031700418],"study_design_scores_gemma":[0.00003052906,0.00004129514,0.0009776116,0.00016380074,0.00002418523,0.0002674929,0.0002200626,0.0013726495,0.0015928942,0.0073683,0.98784083,0.00010035241],"about_ca_topic_score_codex":0.019120408,"about_ca_topic_score_gemma":0.015494073,"teacher_disagreement_score":0.019120408,"about_ca_system_score_codex":0.003962447,"about_ca_system_score_gemma":0.003419105,"threshold_uncertainty_score":0.05385655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017797701,0.00055190345,0.9782033,0.00016083484,0.000051040504,0.000023339559,0.00004239881,0.00012481376,0.003044568],"genre_scores_gemma":[0.83764243,0.0013336346,0.15345883,0.00019553705,0.000089301524,0.000084931315,0.000107049054,0.00003426114,0.0070539545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978834,0.000052303356,0.000010342144,0.000039590894,0.00007685501,0.000032486056],"domain_scores_gemma":[0.99977905,0.00012319957,0.000024383618,0.000017885908,0.00004926453,0.000006211768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029891846,0.00046121617,0.00036568567,0.00019384647,0.0002725293,0.00065591664,0.00030115765,0.0006289344,0.0020219542],"category_scores_gemma":[0.0009166686,0.0002613273,0.00025769148,0.0002735646,0.0004410246,0.0007945479,0.0003895593,0.00064348534,0.00037860326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017679135,0.00006259515,0.00074785925,0.00021829362,0.000060233,0.00017698856,0.00015379114,0.78389525,0.048812985,0.07557647,0.0017076698,0.08841105],"study_design_scores_gemma":[0.000010671498,0.000038752856,0.00019683834,0.000019193993,0.000009647821,0.00007450159,0.000020183634,0.9860394,0.008251215,0.004069985,0.0012587517,0.000010955374],"about_ca_topic_score_codex":0.0016522745,"about_ca_topic_score_gemma":0.0033367549,"teacher_disagreement_score":0.0020219542,"about_ca_system_score_codex":0.00045328442,"about_ca_system_score_gemma":0.0005605288,"threshold_uncertainty_score":0.0067641735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024599768,0.00017634562,0.9968321,0.000028671544,0.000029280234,0.000011737549,0.000007577926,0.00017209639,0.00028220483],"genre_scores_gemma":[0.20467155,0.0005202547,0.7894181,0.00018430468,0.00009785435,0.00009350052,0.00008136228,0.000094058145,0.0048389523],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992292,0.00019740463,0.000045381457,0.00011806334,0.00035684835,0.0000530559],"domain_scores_gemma":[0.9993382,0.0002446753,0.00009143535,0.000116411924,0.00018371787,0.000025476545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073467684,0.00054584915,0.0006238385,0.0006129862,0.00047334077,0.00072614144,0.00085044006,0.0007598921,0.0015937171],"category_scores_gemma":[0.0017189139,0.00033907982,0.0005391306,0.00063191913,0.000493749,0.0014053214,0.0011294327,0.0010301566,0.001053763],"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.0006344673,0.00017021695,0.0006252936,0.00041122932,0.00014502859,0.00024694533,0.000323203,0.11356083,0.22648373,0.050862487,0.0037462215,0.6027903],"study_design_scores_gemma":[0.00003530041,0.00014631027,0.00029455087,0.000017064822,0.00002826409,0.00040256933,0.000028133527,0.9363126,0.050163016,0.0068888483,0.0056211357,0.000062213476],"about_ca_topic_score_codex":0.00043765368,"about_ca_topic_score_gemma":0.00055116374,"teacher_disagreement_score":0.0015937171,"about_ca_system_score_codex":0.00038511338,"about_ca_system_score_gemma":0.0008923477,"threshold_uncertainty_score":0.0053315163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04773262,0.00042986122,0.9475071,0.00036424186,0.0000322933,0.000046323177,0.000022111515,0.00014333501,0.0037221168],"genre_scores_gemma":[0.9428071,0.00024335108,0.054190014,0.00020009365,0.0000468769,0.00011758928,0.000036195583,0.000021601027,0.0023371542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997466,0.000108882516,0.000010439994,0.000044403605,0.00004329631,0.000046392914],"domain_scores_gemma":[0.9986083,0.001024041,0.00012177696,0.000033030494,0.0001544088,0.000058438138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516123,0.0006401797,0.0008446412,0.00033146975,0.00024766367,0.00050758384,0.0006540004,0.0010057852,0.0014620424],"category_scores_gemma":[0.002400768,0.00030842863,0.00032789705,0.0002541925,0.000818571,0.000498192,0.00069802674,0.0008263568,0.00018581693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004321345,0.000026893891,0.0004150725,0.000024432045,0.00001854586,0.000032543627,0.000031407166,0.98292667,0.00071882404,0.002934699,0.00024088257,0.012586733],"study_design_scores_gemma":[0.00000605749,0.000019795976,0.000035922603,0.000002494905,0.0000023713962,0.000003480279,0.000004619344,0.9989987,0.00008656708,0.0007638764,0.00007466706,0.0000014802827],"about_ca_topic_score_codex":0.00443406,"about_ca_topic_score_gemma":0.0031707487,"teacher_disagreement_score":0.00443406,"about_ca_system_score_codex":0.0005067434,"about_ca_system_score_gemma":0.0006303978,"threshold_uncertainty_score":0.008816481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0349101,0.00026350995,0.9624773,0.00017557264,0.00003072702,0.000019714415,0.000020361646,0.00007559009,0.0020270264],"genre_scores_gemma":[0.9607034,0.00031362538,0.03775881,0.00006623288,0.0000413444,0.000040719875,0.000019634288,0.000016268723,0.0010401389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958795,0.00016150669,0.000013790555,0.000059355698,0.00012738733,0.000050008115],"domain_scores_gemma":[0.99938977,0.0003618264,0.00011225417,0.000041376185,0.00007842878,0.00001634804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077665475,0.00060460565,0.00044321403,0.00015608649,0.00021470015,0.00056515017,0.000334054,0.0003219392,0.00043282247],"category_scores_gemma":[0.0019559853,0.0002538718,0.0002342917,0.0003029838,0.00082883023,0.00052185537,0.00054800423,0.0005203305,0.000096740514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038775932,0.000016639859,0.0001753544,0.0000313733,0.000015930449,0.00004037519,0.000019422489,0.9709682,0.004472049,0.014205062,0.00022671,0.009790086],"study_design_scores_gemma":[0.0000052232317,0.00003558419,0.000062126775,0.0000022108204,0.0000023949963,0.000008163955,0.0000031320012,0.99632496,0.0006782776,0.0027572694,0.00011811558,0.0000025062222],"about_ca_topic_score_codex":0.0010027459,"about_ca_topic_score_gemma":0.00083355233,"teacher_disagreement_score":0.0010027459,"about_ca_system_score_codex":0.00036409876,"about_ca_system_score_gemma":0.00064260775,"threshold_uncertainty_score":0.004107356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5404075,0.0014819636,0.4474396,0.00042247967,0.00007185172,0.000058574016,0.00009921694,0.0007077504,0.0093110865],"genre_scores_gemma":[0.9532534,0.00018023682,0.045015614,0.00008260772,0.000016464322,0.000026303866,0.00003904994,0.00002092614,0.0013653602],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986582,0.00028542874,0.00007946801,0.00028084766,0.0004022443,0.00029376018],"domain_scores_gemma":[0.9987754,0.00043577095,0.00028213704,0.00020354777,0.00024194496,0.000061121595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012380789,0.0006909065,0.0010623478,0.00027562893,0.00049550715,0.00085349166,0.00084736873,0.001333358,0.0010796578],"category_scores_gemma":[0.002024862,0.0002914451,0.00037546363,0.00043404402,0.0011250017,0.0017023091,0.0014608962,0.0005261001,0.00036555465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013736842,0.00011392929,0.0070655625,0.0004214594,0.00024472308,0.00060966227,0.0005668675,0.20890625,0.6280504,0.10576177,0.0010647508,0.045820817],"study_design_scores_gemma":[0.000080821206,0.0008002582,0.00147392,0.00004752684,0.00010835162,0.00050742354,0.00011340304,0.76753724,0.21947648,0.0077278567,0.0019619018,0.00016481141],"about_ca_topic_score_codex":0.0010036788,"about_ca_topic_score_gemma":0.001005768,"teacher_disagreement_score":0.001333358,"about_ca_system_score_codex":0.0008696127,"about_ca_system_score_gemma":0.0008903493,"threshold_uncertainty_score":0.0065476894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019976886,0.0004600629,0.9747121,0.00019728893,0.00007046055,0.000039552648,0.000012697318,0.00016841831,0.0043626265],"genre_scores_gemma":[0.77513343,0.00094170927,0.21921347,0.00032628136,0.00013088142,0.00016073899,0.00004568304,0.000079809295,0.0039679385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996755,0.00009994322,0.000011090451,0.000035691057,0.00015762326,0.00002010237],"domain_scores_gemma":[0.999374,0.0002975577,0.000077713004,0.00013723486,0.00008820603,0.000025426605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048520137,0.00028657005,0.00028125348,0.0003045921,0.00031445984,0.00039849448,0.0007178506,0.00043878952,0.0016095678],"category_scores_gemma":[0.0012913247,0.00016149343,0.00025374963,0.00034482343,0.00067675975,0.0007840758,0.0006063819,0.00063966954,0.00040935865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012076725,0.00010152576,0.00048659914,0.00031510883,0.00005792497,0.0002807355,0.0002624994,0.116994776,0.11011708,0.6748006,0.0020349768,0.09442739],"study_design_scores_gemma":[0.000026521682,0.00019385043,0.00022606102,0.000026404858,0.000027603603,0.0003617647,0.000032732918,0.88755953,0.020345004,0.08317393,0.007993044,0.000033534412],"about_ca_topic_score_codex":0.00018443797,"about_ca_topic_score_gemma":0.0003164713,"teacher_disagreement_score":0.0016095678,"about_ca_system_score_codex":0.00031584344,"about_ca_system_score_gemma":0.00032264835,"threshold_uncertainty_score":0.005384505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035284124,0.0004586473,0.9611507,0.00026037157,0.00018370095,0.000115797324,0.00009074771,0.00017501507,0.0022809491],"genre_scores_gemma":[0.90024924,0.000449599,0.09710006,0.0000888244,0.00015480618,0.00017404447,0.000116801915,0.000057187197,0.0016093967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982626,0.0007521233,0.00006933965,0.00027773628,0.0003415863,0.00029668675],"domain_scores_gemma":[0.99602485,0.0022249466,0.00053104974,0.00033627535,0.0004897717,0.000393085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031597205,0.0008336739,0.0012635641,0.00048519654,0.0010708536,0.0009638687,0.0011051944,0.0005762722,0.0013205073],"category_scores_gemma":[0.006600788,0.00044997144,0.00052225444,0.00097650755,0.0009925696,0.0010037085,0.0009973805,0.0014342428,0.00025605134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002519172,0.00009711979,0.00043575614,0.00015031107,0.00003220631,0.00015191112,0.00012287726,0.9262783,0.005788245,0.042658743,0.0018413785,0.022191139],"study_design_scores_gemma":[0.000010177027,0.00004646011,0.00006378787,0.000003169959,0.0000034929692,0.00001981699,0.000014275329,0.9932811,0.00055770646,0.0055580665,0.0004359405,0.0000059702716],"about_ca_topic_score_codex":0.0027267572,"about_ca_topic_score_gemma":0.0031278103,"teacher_disagreement_score":0.0031597205,"about_ca_system_score_codex":0.0011913651,"about_ca_system_score_gemma":0.0033502276,"threshold_uncertainty_score":0.0167104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010052096,0.0002782687,0.98765963,0.00013849974,0.000060109734,0.000014600941,0.000035351888,0.00029167178,0.0014698767],"genre_scores_gemma":[0.8420349,0.00052198605,0.15225977,0.00024325542,0.00008357393,0.00008159319,0.00016651265,0.0000645789,0.0045438427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.000052044616,0.00000843027,0.000057949994,0.00005236529,0.00003342355],"domain_scores_gemma":[0.99959475,0.00020041151,0.000047285368,0.000039824576,0.00009783573,0.00001987843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040687047,0.00055265403,0.00052711077,0.0003353826,0.0003245429,0.00047648817,0.0008490822,0.0007264616,0.0011447372],"category_scores_gemma":[0.0013898106,0.00025087228,0.00032055276,0.00059784425,0.0005473408,0.0010052483,0.00058786536,0.0008600234,0.00023516967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004443541,0.000021774898,0.0003421022,0.00004936418,0.000024775325,0.000042685544,0.000025431424,0.9331992,0.0024943114,0.010393352,0.0009334247,0.05242915],"study_design_scores_gemma":[0.0000014958533,0.0000061854284,0.000035508256,0.0000014942735,0.0000023740095,0.00000590636,0.0000015198907,0.9978561,0.00028642226,0.0016885969,0.000111934714,0.000002373652],"about_ca_topic_score_codex":0.0073111793,"about_ca_topic_score_gemma":0.007312692,"teacher_disagreement_score":0.0073111793,"about_ca_system_score_codex":0.00077288947,"about_ca_system_score_gemma":0.00072261016,"threshold_uncertainty_score":0.014537215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0770536,0.00096624787,0.8963643,0.00037740028,0.000086788656,0.00006450157,0.00011730012,0.00044787317,0.024521925],"genre_scores_gemma":[0.93870085,0.0004067816,0.058124755,0.00017577925,0.00005982915,0.000052502193,0.000039394996,0.00003173747,0.0024083331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993773,0.00023981747,0.000016797909,0.000077353834,0.00022369203,0.000065070104],"domain_scores_gemma":[0.9993166,0.00029708384,0.000071143564,0.00010516964,0.00017767028,0.000032462118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082628237,0.0007054846,0.00039162737,0.0002995732,0.00046178477,0.000941203,0.0004709521,0.0006401598,0.0015747502],"category_scores_gemma":[0.0017325594,0.00022405418,0.0004015086,0.0005559325,0.0006023728,0.00049956574,0.00077738933,0.000569931,0.00041803502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018025223,0.000112966794,0.0016235029,0.00013464871,0.0000803437,0.00048874575,0.00010029152,0.851514,0.03429679,0.051992975,0.0024042549,0.05707123],"study_design_scores_gemma":[0.000007438168,0.0001003404,0.00038841026,0.000008952655,0.00001501305,0.00017608811,0.000018612302,0.9922138,0.0022899548,0.0035271673,0.0012428116,0.000011436498],"about_ca_topic_score_codex":0.0019514554,"about_ca_topic_score_gemma":0.0038790726,"teacher_disagreement_score":0.0019514554,"about_ca_system_score_codex":0.00040634506,"about_ca_system_score_gemma":0.0011714977,"threshold_uncertainty_score":0.005268097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0539849,0.00065706036,0.9409547,0.00016397568,0.000033339267,0.00003929176,0.00002505134,0.00012848733,0.0040133456],"genre_scores_gemma":[0.92622757,0.0002913399,0.070750825,0.00007258916,0.00004971435,0.00007121232,0.000024702493,0.000029480601,0.0024825847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994326,0.00025287265,0.000011651294,0.000071577044,0.00014809809,0.00008315095],"domain_scores_gemma":[0.9995012,0.00032031286,0.000071352,0.000027286766,0.00005975999,0.000019999019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006831501,0.0007142376,0.000567393,0.00034104427,0.00044660372,0.0007868183,0.0007224087,0.0005847109,0.000848027],"category_scores_gemma":[0.0013510366,0.0003278383,0.00025182657,0.00058396795,0.00060862507,0.0005932952,0.00065150944,0.00042527262,0.0002367693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006949745,0.00006386884,0.00058511837,0.00005320673,0.00003001717,0.00008411518,0.00007449229,0.9431512,0.005797735,0.0078090746,0.00054265227,0.041738987],"study_design_scores_gemma":[0.000008751077,0.000034291665,0.0000935986,0.0000026623636,0.0000046789705,0.00001921199,0.0000143363,0.9967114,0.0005925478,0.0021772084,0.00033758394,0.000003799618],"about_ca_topic_score_codex":0.0025360666,"about_ca_topic_score_gemma":0.004597631,"teacher_disagreement_score":0.0025360666,"about_ca_system_score_codex":0.00063657935,"about_ca_system_score_gemma":0.0006415616,"threshold_uncertainty_score":0.0050426126},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024847635,0.00008710366,0.99669814,0.000032336604,0.00003736794,0.000015980462,0.000007370945,0.00008572348,0.00055132405],"genre_scores_gemma":[0.3867467,0.0002943295,0.6085709,0.00009925369,0.00012743089,0.00024566904,0.00009479203,0.00006562646,0.0037552414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996712,0.00007270133,0.000016321,0.000095780524,0.00011015673,0.00003384694],"domain_scores_gemma":[0.9996,0.00017654596,0.000062807885,0.000041767235,0.00009731689,0.000021500871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242402,0.000638063,0.00064261415,0.0004231064,0.00043939851,0.00057248544,0.0010168517,0.0007783222,0.0016598097],"category_scores_gemma":[0.0014875698,0.0002353664,0.00034927306,0.00063071155,0.0004367986,0.0008394763,0.0009435775,0.0008786747,0.00047528086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016621118,0.00005667457,0.00048319885,0.00012611633,0.00004734796,0.00009109044,0.00015621065,0.6584331,0.011673637,0.035399307,0.0024644048,0.29090273],"study_design_scores_gemma":[0.000031500385,0.000056989044,0.00005852523,0.0000063229254,0.0000058315163,0.000034208217,0.000011192833,0.9930948,0.0012474499,0.0038303423,0.0016171322,0.0000057484813],"about_ca_topic_score_codex":0.001611072,"about_ca_topic_score_gemma":0.0018222505,"teacher_disagreement_score":0.0016598097,"about_ca_system_score_codex":0.0004290211,"about_ca_system_score_gemma":0.0008953123,"threshold_uncertainty_score":0.00555259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080362335,0.00013758232,0.9907946,0.00004266754,0.000010288449,0.000008188839,0.000018477274,0.00054987497,0.00040209937],"genre_scores_gemma":[0.49932382,0.00038501213,0.49688762,0.000080286634,0.000030812884,0.000051003026,0.00019378439,0.00013421204,0.0029135074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949634,0.00013322657,0.000023406945,0.00011869627,0.00018444835,0.000043935634],"domain_scores_gemma":[0.99966013,0.00015161443,0.0000520802,0.000050786944,0.00007464535,0.000010846937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576888,0.000644593,0.0009127354,0.00054122123,0.00019459464,0.00068511744,0.0009028788,0.00065558724,0.000794677],"category_scores_gemma":[0.0013936037,0.00048403104,0.0005599052,0.00069677026,0.0005613677,0.0008899112,0.0010448581,0.0005681736,0.00058904424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022500282,0.000049159873,0.00101034,0.00016998363,0.000096057986,0.00015363582,0.00014743891,0.72936845,0.05109876,0.01238192,0.0013161763,0.20398304],"study_design_scores_gemma":[0.000005547499,0.000017676144,0.00016888899,0.0000029258897,0.000007394285,0.000037114358,0.0000057077173,0.99312395,0.005021232,0.0010611165,0.0005378936,0.000010563981],"about_ca_topic_score_codex":0.00271029,"about_ca_topic_score_gemma":0.002967601,"teacher_disagreement_score":0.00271029,"about_ca_system_score_codex":0.0005085119,"about_ca_system_score_gemma":0.0006586155,"threshold_uncertainty_score":0.0053890347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039015237,0.00021741011,0.95837843,0.000147718,0.000033196244,0.000028073298,0.000016265174,0.00024643194,0.0019171751],"genre_scores_gemma":[0.78704417,0.0002202962,0.21030167,0.000092344955,0.000038869835,0.00006728735,0.00003353769,0.000024482935,0.002177378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996227,0.00014745297,0.000011288335,0.000044777993,0.000140363,0.00003338457],"domain_scores_gemma":[0.9986872,0.0008637267,0.00013167378,0.00012950064,0.0001609479,0.000026894244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008185975,0.00043120174,0.0003940702,0.00030517986,0.00027618607,0.00047051575,0.0005482325,0.00082744064,0.00078496657],"category_scores_gemma":[0.0035569207,0.00015185468,0.00022132839,0.0002786235,0.0005909751,0.0006507167,0.00050502457,0.0004878176,0.00029932198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035535474,0.00009132791,0.0018910241,0.0002490039,0.00006708004,0.00042063894,0.00030152252,0.66705835,0.091969825,0.067352094,0.0013142197,0.16892959],"study_design_scores_gemma":[0.0000029975092,0.000035017958,0.00005529189,0.0000038896596,0.0000020083755,0.000051438372,0.0000044880085,0.9952077,0.0029998359,0.0014027522,0.00023076197,0.000003658977],"about_ca_topic_score_codex":0.00075322465,"about_ca_topic_score_gemma":0.00094313035,"teacher_disagreement_score":0.00082744064,"about_ca_system_score_codex":0.0003380476,"about_ca_system_score_gemma":0.0005180686,"threshold_uncertainty_score":0.0043292046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035405684,0.0023519734,0.952355,0.0012216864,0.00011461264,0.00006907107,0.00008725208,0.00007508764,0.008319537],"genre_scores_gemma":[0.8807787,0.0029564109,0.10924145,0.00032888268,0.00018412193,0.0001586522,0.000062157545,0.000102654376,0.0061870683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990631,0.0004440472,0.000029135952,0.00015904618,0.0001596778,0.00014500377],"domain_scores_gemma":[0.99729,0.0020373447,0.00024537693,0.000107039305,0.00020229981,0.00011794823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221716,0.0009362583,0.0012886659,0.0006839774,0.00041410487,0.0016102216,0.0012337276,0.001200874,0.0022384077],"category_scores_gemma":[0.008064874,0.0005160233,0.0004955768,0.0010374537,0.0012531953,0.0029801938,0.0011552244,0.0010706909,0.000217899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012313246,0.00006752773,0.00048749393,0.00013716808,0.00004497189,0.000099820754,0.00008349392,0.90435654,0.0025185226,0.07344354,0.001274618,0.017363163],"study_design_scores_gemma":[0.000008688552,0.000043619577,0.00015068724,0.000014647713,0.000012046582,0.000037664624,0.0000452383,0.97155917,0.0006457234,0.026743386,0.0007296101,0.000009400929],"about_ca_topic_score_codex":0.0015904156,"about_ca_topic_score_gemma":0.0011375957,"teacher_disagreement_score":0.0022384077,"about_ca_system_score_codex":0.0014195868,"about_ca_system_score_gemma":0.0011262225,"threshold_uncertainty_score":0.010299861},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007163968,0.00016083119,0.997493,0.00025171685,0.000026818188,0.000036630743,0.000013313977,0.000051521547,0.0012497131],"genre_scores_gemma":[0.17842555,0.0009589934,0.8116615,0.0007729107,0.0003682311,0.0012510512,0.00016762083,0.00041568832,0.005978606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992815,0.0046194494,0.000244498,0.00064571574,0.0013211791,0.00035412615],"domain_scores_gemma":[0.9682617,0.026245054,0.0017074427,0.0012182693,0.0021435563,0.00042392046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020550426,0.0028620565,0.0020152943,0.0016954698,0.0011411047,0.0026466148,0.0034979577,0.0033839585,0.004227288],"category_scores_gemma":[0.04827611,0.0017055195,0.0019597746,0.0012160792,0.003575138,0.004054958,0.0034970453,0.006789414,0.0009236465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006273506,0.000094000614,0.00043450648,0.00022113028,0.00007814902,0.00019966331,0.0001322366,0.79568124,0.0008976105,0.18103765,0.0018861801,0.019274872],"study_design_scores_gemma":[0.0000061986257,0.000014266748,0.000021756912,0.000026234835,0.0000054842776,0.000017334429,0.0000060861125,0.98079246,0.00016296828,0.018393176,0.00054804276,0.0000060183975],"about_ca_topic_score_codex":0.0022579106,"about_ca_topic_score_gemma":0.0021165009,"teacher_disagreement_score":0.020550426,"about_ca_system_score_codex":0.0019293764,"about_ca_system_score_gemma":0.003270311,"threshold_uncertainty_score":0.108682334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07386202,0.0011620311,0.9145437,0.00017927302,0.00009445033,0.000028723594,0.000037852205,0.00026291583,0.009829059],"genre_scores_gemma":[0.9348798,0.0007773865,0.06204038,0.0001734405,0.0000987489,0.000041247502,0.00003490436,0.000020375928,0.0019337294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00018683185,0.000016229098,0.000063183936,0.00015244148,0.000074262796],"domain_scores_gemma":[0.99914527,0.00044717165,0.00009278287,0.00013976994,0.00013999178,0.000035031968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053483556,0.00073413795,0.00053079834,0.0003992184,0.00029423504,0.0006581559,0.0007474785,0.00051722734,0.0007091123],"category_scores_gemma":[0.0012389389,0.00021073573,0.00039603512,0.0007920842,0.00054489553,0.0007712759,0.0012274472,0.00046509004,0.00038573783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053975993,0.00020072052,0.0023932226,0.00035154537,0.00025714346,0.0009006026,0.00039521875,0.44579858,0.18960108,0.105515994,0.003217147,0.25082895],"study_design_scores_gemma":[0.000027613076,0.00034366242,0.00041740414,0.000017428241,0.000049252212,0.0005803774,0.000044098393,0.9689227,0.0133358035,0.012879288,0.0033471882,0.000035096462],"about_ca_topic_score_codex":0.00024713884,"about_ca_topic_score_gemma":0.00049406465,"teacher_disagreement_score":0.0007474785,"about_ca_system_score_codex":0.00022293716,"about_ca_system_score_gemma":0.00023561023,"threshold_uncertainty_score":0.0028284788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18117596,0.0017503903,0.799393,0.00042474773,0.00010571254,0.00014174449,0.0003137564,0.000665467,0.016029231],"genre_scores_gemma":[0.82867825,0.00073659746,0.16283977,0.00019427163,0.00005500322,0.00024775692,0.00036211693,0.0000854024,0.0068007647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938166,0.00011812269,0.000031634023,0.0001011593,0.00025459644,0.000112786045],"domain_scores_gemma":[0.9981172,0.0005584757,0.00034755707,0.00039161427,0.00048670673,0.00009853603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046159222,0.00053321564,0.0004960362,0.0007754036,0.00045185798,0.0005154121,0.000720406,0.0007314814,0.0012061989],"category_scores_gemma":[0.0028436317,0.00016865437,0.000293036,0.001036069,0.00078326557,0.000809391,0.0010477249,0.0007787161,0.00065927464],"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.0007140547,0.00011760275,0.0017227328,0.00047945898,0.000056205146,0.00043813582,0.00041480956,0.36442482,0.07622337,0.3489503,0.0062622195,0.20019628],"study_design_scores_gemma":[0.00012200099,0.0004160114,0.0007737306,0.000118185846,0.000038302718,0.0010483526,0.00014373419,0.80179787,0.05240266,0.12613422,0.016917035,0.00008785256],"about_ca_topic_score_codex":0.0012994442,"about_ca_topic_score_gemma":0.0014725695,"teacher_disagreement_score":0.0012994442,"about_ca_system_score_codex":0.00053210196,"about_ca_system_score_gemma":0.001108256,"threshold_uncertainty_score":0.0040351152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018331544,0.00012369905,0.9728846,0.0005978983,0.00006085659,0.00005748389,0.000029371125,0.00027944523,0.0076351212],"genre_scores_gemma":[0.9086251,0.00012089487,0.08826888,0.00020934507,0.000040805226,0.00013542178,0.000046207082,0.00006325036,0.0024900432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898523,0.00024737924,0.000048703358,0.00024887852,0.00032259166,0.00014712191],"domain_scores_gemma":[0.99682367,0.0014602897,0.00036739418,0.00039838313,0.000727828,0.00022240517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697918,0.00047678323,0.0006350266,0.0003810577,0.0007003329,0.001144849,0.0014318847,0.0008442341,0.0032206834],"category_scores_gemma":[0.008089964,0.00027005683,0.00061665237,0.0002861859,0.0013906996,0.0015172939,0.0018397833,0.0016729519,0.00034870947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001313333,0.000095925825,0.0017126136,0.00010686266,0.00004326702,0.00016233794,0.0001467053,0.79148376,0.0033161326,0.15290368,0.002065322,0.047832094],"study_design_scores_gemma":[0.000009442257,0.000019959349,0.000079757265,0.0000035290873,0.0000035120113,0.000010648072,0.0000068294958,0.98972565,0.00027646343,0.009553728,0.00030724087,0.0000031413686],"about_ca_topic_score_codex":0.0056714406,"about_ca_topic_score_gemma":0.002788071,"teacher_disagreement_score":0.0056714406,"about_ca_system_score_codex":0.0013079952,"about_ca_system_score_gemma":0.0019475076,"threshold_uncertainty_score":0.0142681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113333486,0.0029113416,0.8527302,0.000968816,0.00008837206,0.000054713804,0.00025000467,0.00040388378,0.029259192],"genre_scores_gemma":[0.9600859,0.001593435,0.035732187,0.00016125214,0.00004121676,0.00007715293,0.000086714266,0.00006138445,0.0021607021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00013607401,0.00001574207,0.00005314439,0.00025502985,0.00009403333],"domain_scores_gemma":[0.9971861,0.00204374,0.0002587285,0.00020038825,0.00028204455,0.000029007477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010048005,0.00041413703,0.00032409118,0.0004134002,0.00028759975,0.0008106746,0.0004588256,0.00064666505,0.0017418093],"category_scores_gemma":[0.006826981,0.0001680926,0.00016912169,0.00045220373,0.0012415621,0.0010268482,0.0004300544,0.00091129605,0.00036846317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009510532,0.00004421493,0.00090101984,0.000194013,0.0000134378815,0.00028368467,0.00029698954,0.59606516,0.024722239,0.3447762,0.0016074968,0.031000437],"study_design_scores_gemma":[0.0000039204574,0.000017367707,0.00029161523,0.0000527725,0.0000035056487,0.00016664263,0.0000406423,0.96673656,0.0048415777,0.026767496,0.0010625788,0.000015364923],"about_ca_topic_score_codex":0.0019485765,"about_ca_topic_score_gemma":0.0015495067,"teacher_disagreement_score":0.0019485765,"about_ca_system_score_codex":0.0012385518,"about_ca_system_score_gemma":0.0013177678,"threshold_uncertainty_score":0.0089864135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043383036,0.00037799988,0.9350161,0.00019823114,0.00006347508,0.00004161599,0.00027099843,0.00056032836,0.020088255],"genre_scores_gemma":[0.92861134,0.00095613644,0.04472691,0.00012589511,0.00007299367,0.0001348589,0.00029275176,0.00014105017,0.024938032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998522,0.00002714539,0.0000040632103,0.000027188345,0.00006391239,0.000025473026],"domain_scores_gemma":[0.99987674,0.000049335074,0.000016614384,0.000013823497,0.000037060618,0.000006482695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015214978,0.00046463514,0.0003907577,0.0002997629,0.00023964321,0.0006001359,0.00072655955,0.00089120993,0.00196331],"category_scores_gemma":[0.00046381538,0.00024445297,0.00034357913,0.00029392997,0.00031001348,0.00085221336,0.00034256227,0.0005440867,0.0010892956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046984173,0.000019541569,0.00031434535,0.000049444105,0.000015262185,0.00013822672,0.00007316898,0.95655143,0.010565276,0.022023266,0.0005780522,0.009625011],"study_design_scores_gemma":[0.0000025244112,0.0000130251965,0.000073210336,0.0000038038092,0.0000038601197,0.000026989092,0.000005749028,0.9968303,0.0007426961,0.0015132488,0.0007802187,0.000004397142],"about_ca_topic_score_codex":0.003225471,"about_ca_topic_score_gemma":0.0019510643,"teacher_disagreement_score":0.003225471,"about_ca_system_score_codex":0.00054590486,"about_ca_system_score_gemma":0.00048580064,"threshold_uncertainty_score":0.006567955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11987982,0.0011539944,0.87300897,0.00027262422,0.00007921471,0.00005241938,0.00005434947,0.00029532664,0.005203264],"genre_scores_gemma":[0.96753985,0.00037118583,0.029892696,0.0000610835,0.000044897468,0.00003962966,0.00002446622,0.000025379823,0.0020009056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00028423438,0.000028410306,0.00009423695,0.00037531788,0.00020046505],"domain_scores_gemma":[0.9967,0.001817279,0.00045083516,0.0004263214,0.00052768027,0.00007789863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083490607,0.0005051729,0.00060308166,0.00071453786,0.0005236664,0.00075100677,0.0008830291,0.00090285344,0.00089717266],"category_scores_gemma":[0.0049883295,0.00020850681,0.0003416722,0.0007859157,0.0013302439,0.001551689,0.0007931953,0.0009083607,0.00021930694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053454645,0.00007581755,0.0014738721,0.00022522842,0.00007999106,0.00050755445,0.00065798196,0.68012357,0.035216726,0.22686021,0.0017156721,0.05252881],"study_design_scores_gemma":[0.00001739072,0.00006979725,0.00015282123,0.000013244073,0.000012165992,0.00012629312,0.00003506518,0.9770921,0.0044705695,0.017125815,0.0008643285,0.000020485842],"about_ca_topic_score_codex":0.0037895022,"about_ca_topic_score_gemma":0.002082296,"teacher_disagreement_score":0.0037895022,"about_ca_system_score_codex":0.001214804,"about_ca_system_score_gemma":0.0007445052,"threshold_uncertainty_score":0.008814037},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025153127,0.0008561561,0.9644893,0.0003761698,0.000045101948,0.000031766976,0.00006957589,0.0001610011,0.008817831],"genre_scores_gemma":[0.94617045,0.0023431354,0.047352865,0.00016825633,0.00013576937,0.00007430344,0.00004948119,0.000057052304,0.0036487405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870396,0.0004980644,0.000048768186,0.00014128751,0.00041048194,0.00019741041],"domain_scores_gemma":[0.9974898,0.0014436339,0.00039042646,0.00031445007,0.0002896181,0.00007204573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017574263,0.0016347389,0.0011017376,0.0011768343,0.00050333986,0.002197483,0.0010678346,0.0010631761,0.0016081432],"category_scores_gemma":[0.0054778457,0.0005257559,0.00085281,0.00120665,0.002672631,0.0025983874,0.0017753205,0.0017575669,0.00041847245],"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.00007870483,0.000038091595,0.0005430848,0.00014369012,0.000045713226,0.0003471438,0.00016024854,0.6284426,0.008288723,0.34849954,0.0006300249,0.012782405],"study_design_scores_gemma":[0.0000056409094,0.00004145947,0.0001389833,0.00003096884,0.000015782709,0.00016833685,0.00003167154,0.94819,0.0017399013,0.049021818,0.0005985584,0.000016889862],"about_ca_topic_score_codex":0.00095970574,"about_ca_topic_score_gemma":0.00070643215,"teacher_disagreement_score":0.002197483,"about_ca_system_score_codex":0.001741259,"about_ca_system_score_gemma":0.0011590935,"threshold_uncertainty_score":0.0126338005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010983558,0.00012805626,0.98672473,0.00011333682,0.000023966522,0.000036594527,0.000017090426,0.00022740495,0.0017451665],"genre_scores_gemma":[0.47052586,0.00028620876,0.5245621,0.0001985479,0.00009915742,0.00014634407,0.00007616852,0.00003620422,0.004069382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.00023127715,0.000024789248,0.00011254867,0.00042250636,0.00008196011],"domain_scores_gemma":[0.99816626,0.0010487647,0.00016081671,0.0002864263,0.0002822935,0.000055494456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005912176,0.0007291624,0.0005287346,0.00046840683,0.00052830565,0.0007745945,0.0007340987,0.00070263166,0.0011193051],"category_scores_gemma":[0.0032335909,0.00027160355,0.00032442223,0.0005270738,0.0007359238,0.00072527386,0.0010661295,0.0011719586,0.0005433855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033886632,0.00023874397,0.001972749,0.0003182626,0.00009585128,0.00036078118,0.00028480514,0.24489193,0.2144403,0.16779725,0.00457986,0.36468068],"study_design_scores_gemma":[0.00000942708,0.00006903524,0.0001667801,0.000010899361,0.000007869607,0.0001429752,0.000012104207,0.97473675,0.012704132,0.0102788815,0.0018461756,0.000014866182],"about_ca_topic_score_codex":0.0008918743,"about_ca_topic_score_gemma":0.0018965924,"teacher_disagreement_score":0.0011193051,"about_ca_system_score_codex":0.00055301737,"about_ca_system_score_gemma":0.0012754027,"threshold_uncertainty_score":0.004012406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17377752,0.00083600206,0.81108713,0.0002939335,0.00006693488,0.000066402965,0.00011393698,0.0003567199,0.013401467],"genre_scores_gemma":[0.8068709,0.0012613038,0.18865421,0.00016096506,0.00005462862,0.00009016698,0.000160927,0.000056294284,0.002690612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990872,0.00025808538,0.000027357444,0.00008169247,0.00043381914,0.00011183078],"domain_scores_gemma":[0.9982369,0.00081064756,0.00024621634,0.00032654722,0.00033961367,0.000040038314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006576737,0.0005700054,0.00028836055,0.00046703967,0.00032576395,0.00047112966,0.00047027585,0.0005486264,0.00054039387],"category_scores_gemma":[0.0033567331,0.00022498067,0.00021015623,0.00076961966,0.001190601,0.000629007,0.00085343193,0.00078919594,0.00021713082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023301289,0.000050514784,0.0019291922,0.00018647112,0.000053430114,0.00039894515,0.00021592877,0.45786452,0.088290155,0.3283642,0.0016986559,0.12071507],"study_design_scores_gemma":[0.000022033353,0.00013149773,0.00069738453,0.00007511926,0.000028057277,0.0003858952,0.000019834812,0.8802977,0.06473377,0.04843684,0.005126779,0.000045027624],"about_ca_topic_score_codex":0.0018426821,"about_ca_topic_score_gemma":0.0020271605,"teacher_disagreement_score":0.0018426821,"about_ca_system_score_codex":0.0006492829,"about_ca_system_score_gemma":0.0010732245,"threshold_uncertainty_score":0.0047109127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502015,0.0004367168,0.62613326,0.00027475788,0.00009253109,0.000060556995,0.000069946116,0.0012145787,0.021516148],"genre_scores_gemma":[0.9477306,0.00009219041,0.04949616,0.00006411478,0.00001620275,0.000020707908,0.00004175093,0.00001898708,0.0025192641],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988425,0.000018664186,0.0000040860814,0.000018462828,0.0000541956,0.00002029879],"domain_scores_gemma":[0.9998087,0.00004014498,0.000052482304,0.00003406852,0.000051145737,0.000013493206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007875981,0.00022110394,0.00020883908,0.00020146658,0.00013809057,0.00035912244,0.00040850375,0.00026810553,0.0008242308],"category_scores_gemma":[0.00029735826,0.00009196547,0.00015441814,0.00019395574,0.00025875928,0.00028607025,0.0002954578,0.00022441168,0.00033565608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021341574,0.00012631256,0.0015116516,0.00014071805,0.000055255277,0.0003637359,0.00013572698,0.12574835,0.69640505,0.030853752,0.0019892326,0.14245673],"study_design_scores_gemma":[0.000020553462,0.0003303275,0.00057019194,0.0000068476875,0.00001709996,0.00022861258,0.000021070811,0.8696791,0.120024264,0.0025834972,0.0064948183,0.000023629673],"about_ca_topic_score_codex":0.0003296074,"about_ca_topic_score_gemma":0.0006296959,"teacher_disagreement_score":0.0008242308,"about_ca_system_score_codex":0.00026267875,"about_ca_system_score_gemma":0.00019971219,"threshold_uncertainty_score":0.0027573705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0203978,0.0002445981,0.97554576,0.00013131721,0.000036996822,0.000041970896,0.000023552613,0.00016280822,0.0034151988],"genre_scores_gemma":[0.7157147,0.00044303152,0.27928185,0.00016637561,0.00010057085,0.00013323753,0.00007655055,0.00004885313,0.004034783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00021178057,0.000024330122,0.000071416696,0.0003212864,0.00005083722],"domain_scores_gemma":[0.9987509,0.0006115975,0.00014684786,0.00023725272,0.00021516737,0.00003826951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456954,0.00054837257,0.00031989635,0.0003466523,0.0002944076,0.0006437485,0.0009616686,0.0005163225,0.0017057956],"category_scores_gemma":[0.0018301264,0.00020339382,0.00032556494,0.00041714177,0.0006375754,0.00077698124,0.00080597383,0.0007975165,0.00058949075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027972742,0.00016285761,0.00074342854,0.0003699321,0.00007847847,0.00039344587,0.00025360752,0.25988024,0.1610769,0.44259483,0.0016054267,0.13256104],"study_design_scores_gemma":[0.000014621075,0.0000874895,0.000084384774,0.00001308504,0.00001272282,0.00013553095,0.000009124017,0.9674146,0.013680449,0.016706401,0.0018234901,0.000018003278],"about_ca_topic_score_codex":0.0005530693,"about_ca_topic_score_gemma":0.0008789724,"teacher_disagreement_score":0.0017057956,"about_ca_system_score_codex":0.00040891985,"about_ca_system_score_gemma":0.0005658781,"threshold_uncertainty_score":0.0057064295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020442314,0.00041688513,0.9773744,0.00014542266,0.00002667959,0.000012332782,0.00002935301,0.00010234923,0.0014503602],"genre_scores_gemma":[0.9164655,0.00056982855,0.08121257,0.00007029049,0.000054279513,0.000058183236,0.0001022939,0.000079277015,0.0013876923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988889,0.00042278934,0.000047531244,0.00013960633,0.0004080006,0.000093197275],"domain_scores_gemma":[0.9948372,0.003928431,0.0004026749,0.00027569447,0.00048924115,0.00006680217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020842152,0.00056817016,0.0006908064,0.00082554267,0.00031319304,0.00085399527,0.00091777724,0.00073407573,0.00095524674],"category_scores_gemma":[0.010652199,0.00024857398,0.0004283899,0.00069071224,0.0011775369,0.0015464224,0.001348982,0.0008012818,0.00018434708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010437514,0.000010968741,0.0010145444,0.000075274016,0.000026983911,0.00006117354,0.00006709961,0.9499879,0.0022000053,0.026261253,0.00034123403,0.019849082],"study_design_scores_gemma":[0.000002112099,0.000019287976,0.00022893085,0.000009721068,0.0000032546104,0.000028752434,0.000007098073,0.9945703,0.0009920268,0.003975516,0.00015453024,0.0000083699015],"about_ca_topic_score_codex":0.0015668283,"about_ca_topic_score_gemma":0.00074039237,"teacher_disagreement_score":0.0020842152,"about_ca_system_score_codex":0.0008625297,"about_ca_system_score_gemma":0.00062790606,"threshold_uncertainty_score":0.011022508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021400202,0.00016288488,0.97746474,0.00011595597,0.000014316785,0.000008275803,0.000023775232,0.00029895955,0.00051084015],"genre_scores_gemma":[0.81111246,0.00034787582,0.18574113,0.00015393145,0.000037686354,0.00003390024,0.00013503675,0.000052959633,0.002385033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979955,0.000045336572,0.000013785373,0.00004627028,0.000061770326,0.000033276672],"domain_scores_gemma":[0.999482,0.00030939493,0.000053072054,0.000045031786,0.000090633934,0.000019886691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076432334,0.00056397467,0.00046957302,0.0002340778,0.0001623963,0.00039276862,0.00069904694,0.0005447725,0.0006279923],"category_scores_gemma":[0.0024944036,0.00032557704,0.0003038247,0.00028469053,0.00042561145,0.00079031126,0.0009866571,0.00095319154,0.00018169265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027467587,0.000049970695,0.0014282957,0.000105860934,0.00006844432,0.00015017361,0.00011708534,0.8062407,0.022654993,0.011408781,0.00089789316,0.15660314],"study_design_scores_gemma":[0.0000022419993,0.00000903455,0.000072100134,0.0000022200081,0.0000028138486,0.000010934695,0.0000023108923,0.997124,0.0015798885,0.0011103164,0.0000818292,0.0000022647569],"about_ca_topic_score_codex":0.004140864,"about_ca_topic_score_gemma":0.004564597,"teacher_disagreement_score":0.004140864,"about_ca_system_score_codex":0.00042715867,"about_ca_system_score_gemma":0.0007877748,"threshold_uncertainty_score":0.008233488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019318927,0.00019781163,0.97831285,0.00010659481,0.000023679728,0.000010618414,0.000020966416,0.00013304506,0.0018754373],"genre_scores_gemma":[0.7547238,0.00034877105,0.24186885,0.00029713058,0.00006313317,0.00004657519,0.00006614407,0.000026138952,0.0025594833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946636,0.00016903794,0.00002074327,0.00007704091,0.0002233319,0.000043619908],"domain_scores_gemma":[0.9993801,0.00038307626,0.000058785263,0.00006355735,0.000098340104,0.00001621757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045644012,0.00050782214,0.0004917699,0.00018730386,0.00020348652,0.00056297355,0.00036519812,0.0004991638,0.0015666971],"category_scores_gemma":[0.0013759251,0.00020145006,0.00020758143,0.00020873577,0.0004223957,0.00095515116,0.00076711073,0.00051425764,0.00041600803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033608387,0.00007898182,0.0016396854,0.0002252863,0.00010308877,0.00021787583,0.00012163216,0.5916945,0.11025289,0.13005322,0.0017017087,0.16357504],"study_design_scores_gemma":[0.000016571254,0.000083759514,0.00023018704,0.0000112205225,0.000009132614,0.00011731749,0.000013470369,0.9746558,0.013640069,0.009894918,0.0013138091,0.0000137217885],"about_ca_topic_score_codex":0.0002240149,"about_ca_topic_score_gemma":0.00048125617,"teacher_disagreement_score":0.0015666971,"about_ca_system_score_codex":0.00028075758,"about_ca_system_score_gemma":0.00022077237,"threshold_uncertainty_score":0.0052411556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41837403,0.0036900078,0.5565469,0.0006750765,0.00008027216,0.000047477024,0.00038406492,0.00039762357,0.01980453],"genre_scores_gemma":[0.99440646,0.0005346358,0.00425916,0.000028995255,0.00002660881,0.000013858246,0.000043955144,0.00001367064,0.0006727017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904853,0.00046446463,0.000031748157,0.00008399378,0.00024669635,0.00012451512],"domain_scores_gemma":[0.99650156,0.0024133741,0.0003358173,0.00020150049,0.00048105718,0.00006657733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013922727,0.0006693288,0.0008632693,0.00057698146,0.0005060804,0.0009042614,0.0007907798,0.0006175964,0.001036415],"category_scores_gemma":[0.0043029822,0.0002619542,0.00030376154,0.0008090914,0.0011379978,0.0009802096,0.00090695365,0.00048231683,0.00020680072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011033427,0.000016218375,0.0013765498,0.000107147695,0.00003613003,0.00043898262,0.00013264657,0.95799965,0.0040291087,0.027975103,0.0006889894,0.0070891357],"study_design_scores_gemma":[0.0000030059684,0.000024215899,0.00035596848,0.000006688434,0.000008491894,0.0001264616,0.000035350145,0.9949999,0.00039128034,0.0038687084,0.00017316848,0.000006806089],"about_ca_topic_score_codex":0.0030697405,"about_ca_topic_score_gemma":0.0022813885,"teacher_disagreement_score":0.0030697405,"about_ca_system_score_codex":0.001575281,"about_ca_system_score_gemma":0.00053846964,"threshold_uncertainty_score":0.011429489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008145761,0.00016859136,0.9879166,0.000051382118,0.0000854491,0.00003893992,0.000038676077,0.0002257407,0.0033290044],"genre_scores_gemma":[0.21272184,0.00036843936,0.78134686,0.000119966375,0.00011403122,0.00013855824,0.00022369897,0.000063295425,0.0049032364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.00009592889,0.000022121269,0.000050933162,0.0002023233,0.00002894505],"domain_scores_gemma":[0.999647,0.00007148066,0.000041887433,0.000060030394,0.00016277263,0.000016787255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035356818,0.0006531728,0.00031171378,0.0003649688,0.00029626003,0.000493197,0.00036136332,0.0003542286,0.002945545],"category_scores_gemma":[0.00093935477,0.00015614858,0.00030294454,0.00044417585,0.00031111375,0.00032843833,0.0002909584,0.0005187634,0.0013787105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024518755,0.00016313257,0.0005679477,0.00029583357,0.00006119391,0.0002249197,0.00012373905,0.04847046,0.2935065,0.080740415,0.0047812806,0.57081944],"study_design_scores_gemma":[0.000049938786,0.00063598575,0.00066593365,0.00004213404,0.00003237552,0.0009364563,0.000047656824,0.76126075,0.1768175,0.017789092,0.041672535,0.000049575396],"about_ca_topic_score_codex":0.00029578924,"about_ca_topic_score_gemma":0.00061192876,"teacher_disagreement_score":0.002945545,"about_ca_system_score_codex":0.00025453395,"about_ca_system_score_gemma":0.0005172325,"threshold_uncertainty_score":0.00985384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10965775,0.003055082,0.8729204,0.000611997,0.00007526442,0.00006901285,0.00005987598,0.00014865054,0.0134020075],"genre_scores_gemma":[0.96329147,0.0014547713,0.031132529,0.00011871012,0.00008176984,0.00006582132,0.000025614121,0.000054223547,0.003774977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900657,0.0002756562,0.000041405667,0.0002047874,0.00031112885,0.00016043196],"domain_scores_gemma":[0.99770725,0.0018011212,0.00020235665,0.000097248754,0.00016601174,0.000026068676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342158,0.0008394047,0.00095359667,0.0003663635,0.00044115304,0.0016385511,0.0011115151,0.0013200432,0.0020601174],"category_scores_gemma":[0.0042148335,0.00050404924,0.0004391979,0.0007389583,0.0010552347,0.0025567561,0.0009997746,0.0009595882,0.0005532678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003443984,0.00018133305,0.001013137,0.00058133143,0.0000880901,0.0005770232,0.00043157337,0.6945506,0.10187904,0.13678728,0.00087863184,0.06268754],"study_design_scores_gemma":[0.000019606838,0.00021820515,0.00026105923,0.00003286143,0.000027258104,0.00027935786,0.00008029394,0.95805544,0.014589511,0.025236448,0.0011728044,0.00002706448],"about_ca_topic_score_codex":0.00045155702,"about_ca_topic_score_gemma":0.00049634976,"teacher_disagreement_score":0.0020601174,"about_ca_system_score_codex":0.00086581433,"about_ca_system_score_gemma":0.0003033714,"threshold_uncertainty_score":0.0070981383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11733428,0.021926157,0.7609287,0.0073806117,0.0008282017,0.00024005743,0.0011120365,0.0018968107,0.08835321],"genre_scores_gemma":[0.9272252,0.0074291127,0.055363573,0.0008094125,0.0006315348,0.0004185948,0.0007837609,0.0009191038,0.0064198277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953205,0.0010403403,0.00018714796,0.00039879707,0.0016208538,0.0014323423],"domain_scores_gemma":[0.9618494,0.030425387,0.0017408229,0.002222755,0.0030111915,0.00075048365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062415,0.0026594123,0.0017473001,0.0032285799,0.0016224032,0.004584077,0.0026657016,0.0022514788,0.008073688],"category_scores_gemma":[0.038087748,0.00075186463,0.00072475703,0.0031433394,0.002036023,0.006492451,0.0034339563,0.0040881922,0.0016368359],"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.00094279373,0.00027586374,0.0015005592,0.0014736971,0.00011039571,0.00036612185,0.0005090096,0.6495409,0.033378627,0.20268019,0.01529776,0.09392408],"study_design_scores_gemma":[0.000025183712,0.00012358156,0.00074638403,0.0003201469,0.000050703842,0.00024474357,0.00026406464,0.891763,0.010108953,0.09190992,0.0043786485,0.00006479532],"about_ca_topic_score_codex":0.0023330883,"about_ca_topic_score_gemma":0.0019162775,"teacher_disagreement_score":0.008073688,"about_ca_system_score_codex":0.0030549136,"about_ca_system_score_gemma":0.001103744,"threshold_uncertainty_score":0.02700919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11549692,0.001194616,0.87902576,0.00030108064,0.000078363475,0.00004282223,0.00013994388,0.00013642246,0.0035841367],"genre_scores_gemma":[0.945367,0.0003835162,0.052881844,0.00006800123,0.000025180188,0.000033118973,0.00006428828,0.00002767991,0.00114942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997186,0.00008473656,0.000010449344,0.00006260901,0.000044518623,0.000078989484],"domain_scores_gemma":[0.9995714,0.00026565697,0.00004341221,0.000026173659,0.000055348002,0.0000380851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054359686,0.0009201852,0.0008757001,0.00025079577,0.00038281342,0.00082855235,0.00066553266,0.0006367469,0.0009700282],"category_scores_gemma":[0.0010788775,0.0003088435,0.00035332606,0.00051941525,0.00054051523,0.0007981232,0.0006794727,0.00049742655,0.00009446604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081299535,0.000013746158,0.00025433977,0.000043314372,0.000017122158,0.00007808649,0.000022710361,0.98525226,0.0018606341,0.00415239,0.00033988454,0.00788428],"study_design_scores_gemma":[0.0000033257388,0.000016676084,0.00006139461,0.0000027383717,0.000004293012,0.00001600739,0.000011847486,0.99730897,0.00042182585,0.0020230191,0.00012745535,0.000002445991],"about_ca_topic_score_codex":0.005087072,"about_ca_topic_score_gemma":0.0036490941,"teacher_disagreement_score":0.005087072,"about_ca_system_score_codex":0.0009364202,"about_ca_system_score_gemma":0.000811608,"threshold_uncertainty_score":0.010114908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04435338,0.00035543984,0.94657016,0.00021261681,0.00005977342,0.00004587487,0.00012822342,0.0010433905,0.0072312052],"genre_scores_gemma":[0.787938,0.00055089063,0.20606838,0.00016308166,0.00005536787,0.0000622896,0.00032169317,0.00010996638,0.004730421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00009451786,0.000018662948,0.000054405977,0.0002553409,0.000073612275],"domain_scores_gemma":[0.9991627,0.00031466933,0.00009429427,0.00014277687,0.00025513172,0.00003044967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032370703,0.0004533955,0.00030883646,0.0004637356,0.0003669625,0.00070519187,0.0005014302,0.0002894902,0.001051371],"category_scores_gemma":[0.001942868,0.000147248,0.00022643243,0.00066846085,0.00049320265,0.00048762374,0.0005931663,0.000553507,0.0005747497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056232477,0.000083381725,0.002236506,0.00035630498,0.000058810223,0.0005241113,0.0003127316,0.4154234,0.18161985,0.06808249,0.004247469,0.32649258],"study_design_scores_gemma":[0.000020486148,0.000071728595,0.00024652414,0.000017768789,0.000013475255,0.00020739665,0.00001996098,0.9042501,0.08476752,0.0077151954,0.0026531166,0.000016700003],"about_ca_topic_score_codex":0.0021334533,"about_ca_topic_score_gemma":0.0038007963,"teacher_disagreement_score":0.0021334533,"about_ca_system_score_codex":0.0005061284,"about_ca_system_score_gemma":0.0017527489,"threshold_uncertainty_score":0.004242003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004522644,0.00005311606,0.99461466,0.00004517947,0.000014921785,0.000010462903,0.000012112332,0.00011236663,0.00061455823],"genre_scores_gemma":[0.56583345,0.0003992334,0.42565772,0.00032454316,0.00008085625,0.00022174374,0.00023797178,0.00010627117,0.007138156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959844,0.00009414567,0.000017646078,0.000096376614,0.0001457192,0.000047622423],"domain_scores_gemma":[0.999171,0.00043271194,0.00008186741,0.00009172581,0.00017395396,0.000048834703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314102,0.0007875819,0.0007602144,0.0002796521,0.00034859247,0.00067053235,0.0010554217,0.0008093929,0.0012203441],"category_scores_gemma":[0.0023169166,0.00052520673,0.0005189988,0.00039665762,0.000813593,0.0012872706,0.0010162542,0.001234615,0.00045041667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013426601,0.000051500523,0.0008127767,0.000119533965,0.000061059895,0.000099913625,0.00014485713,0.83016056,0.014090201,0.019585146,0.001254848,0.13348533],"study_design_scores_gemma":[0.0000041879534,0.000015924912,0.000047539517,0.00000244812,0.000003838779,0.00001688979,0.0000046588657,0.99607927,0.0011948413,0.0023876345,0.00023679323,0.0000059885465],"about_ca_topic_score_codex":0.0019383146,"about_ca_topic_score_gemma":0.002219754,"teacher_disagreement_score":0.0019383146,"about_ca_system_score_codex":0.000501052,"about_ca_system_score_gemma":0.00069505064,"threshold_uncertainty_score":0.004396975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054807544,0.00011663226,0.9438022,0.00017067521,0.00002660537,0.000016747774,0.000026656217,0.0001708584,0.0008621386],"genre_scores_gemma":[0.7677259,0.00020733755,0.22936583,0.00006940899,0.0000359786,0.000052143423,0.00007765117,0.000036725076,0.0024291126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983406,0.000055110748,0.000011034706,0.000027445813,0.00005947084,0.000012743675],"domain_scores_gemma":[0.9994522,0.00029796295,0.00009499476,0.00007657307,0.000058633956,0.000019685313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027776946,0.0002986165,0.00028315515,0.00028873634,0.00019561537,0.00030004542,0.0002668842,0.00043893902,0.0006757839],"category_scores_gemma":[0.0018976775,0.0001475924,0.00025383456,0.00022397922,0.0005006431,0.0008591114,0.0006910303,0.0005212926,0.00017121756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003156347,0.000073586816,0.0013600296,0.00016328396,0.00006115019,0.0003230073,0.00031997767,0.5200611,0.18766753,0.10834401,0.0007724099,0.18053836],"study_design_scores_gemma":[0.000006206921,0.00003098014,0.00011004666,0.000005059433,0.000003362277,0.00006316073,0.0000071080976,0.980142,0.011697415,0.00749088,0.0004350809,0.00000877081],"about_ca_topic_score_codex":0.00049199944,"about_ca_topic_score_gemma":0.0005778967,"teacher_disagreement_score":0.0006757839,"about_ca_system_score_codex":0.00026356478,"about_ca_system_score_gemma":0.00037286637,"threshold_uncertainty_score":0.0022607446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.680857,0.00081156543,0.30987534,0.00015879568,0.000055505512,0.000026652622,0.000026991387,0.0002877569,0.007900376],"genre_scores_gemma":[0.9876973,0.00009627472,0.011613659,0.000016241807,0.000006231309,0.0000069367593,0.00000753951,0.0000056592967,0.0005501128],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999864,0.00003325489,0.000003766414,0.00001743638,0.0000586655,0.000022808481],"domain_scores_gemma":[0.9997954,0.00007995989,0.000055569715,0.000031766802,0.000026761993,0.000010498842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015849847,0.00030058943,0.00026938564,0.00014023854,0.00018012828,0.00038081675,0.00028320157,0.00035338302,0.00046300128],"category_scores_gemma":[0.000311015,0.00009453236,0.0002169003,0.00015115013,0.00034691658,0.00031552743,0.00034788402,0.00021964237,0.000156726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039205462,0.00012585768,0.005402875,0.00025192284,0.00011235146,0.001124836,0.00028323877,0.3261707,0.5733648,0.025279481,0.0007468852,0.06674492],"study_design_scores_gemma":[0.00000929192,0.0003437683,0.0014113452,0.0000073963265,0.000023363227,0.0003085324,0.00006044065,0.95466316,0.03989907,0.0015717233,0.001683475,0.000018412027],"about_ca_topic_score_codex":0.00020693208,"about_ca_topic_score_gemma":0.00028974508,"teacher_disagreement_score":0.00046300128,"about_ca_system_score_codex":0.00023969919,"about_ca_system_score_gemma":0.00012640996,"threshold_uncertainty_score":0.0017391443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08595837,0.00061849656,0.90705717,0.00019196134,0.000021783488,0.000024694851,0.000030618445,0.00008281634,0.006014073],"genre_scores_gemma":[0.9733916,0.00027049094,0.024663134,0.000038162932,0.000015797614,0.00003106882,0.000014530243,0.000015185941,0.0015599533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966335,0.00011182987,0.000007461004,0.000042318392,0.00011084918,0.00006415483],"domain_scores_gemma":[0.9997259,0.00017791809,0.000033964425,0.00001682522,0.000035747904,0.000009627118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043608012,0.00044842798,0.0005438293,0.00020857202,0.00025897622,0.000610393,0.00038817376,0.00046688278,0.0005228756],"category_scores_gemma":[0.0010388705,0.00016502233,0.00019370107,0.0006421394,0.00049620145,0.0005836071,0.00049497915,0.00033534213,0.00008946042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058394817,0.000029513434,0.00023785274,0.00003724573,0.000012430769,0.0000626895,0.000065866836,0.9541958,0.007681317,0.013586814,0.00034362855,0.023688508],"study_design_scores_gemma":[0.0000028778054,0.000024669847,0.0000618641,0.0000020471368,0.0000027605834,0.000016921722,0.000015284062,0.99536395,0.0012331178,0.0029803189,0.00029296466,0.000003140484],"about_ca_topic_score_codex":0.0021699572,"about_ca_topic_score_gemma":0.001455812,"teacher_disagreement_score":0.0021699572,"about_ca_system_score_codex":0.0005576507,"about_ca_system_score_gemma":0.0005404897,"threshold_uncertainty_score":0.004314661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3517153,0.0016775845,0.6278135,0.0005176804,0.000069576294,0.00005227678,0.00042601425,0.00054483634,0.017183261],"genre_scores_gemma":[0.9934669,0.00040654498,0.0053477157,0.000029637029,0.00002203832,0.000026358788,0.00006905289,0.000026233825,0.00060550653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834263,0.00056027074,0.00008416336,0.00017845783,0.0005534989,0.00028098046],"domain_scores_gemma":[0.9932146,0.004693378,0.000802924,0.00068588153,0.0005141029,0.00008918455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001834109,0.0010073003,0.00077404885,0.00075790443,0.0005375202,0.0011864896,0.0007889712,0.00075351074,0.0016220725],"category_scores_gemma":[0.008926279,0.00035689934,0.0004481039,0.0010716496,0.0016786803,0.0019877618,0.0012832071,0.00082755147,0.00034743358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032917294,0.00004818307,0.0024519197,0.00021097991,0.0000606311,0.0006102216,0.0002574649,0.8764575,0.018902047,0.084520474,0.0006078444,0.015543633],"study_design_scores_gemma":[0.000011076257,0.00006596904,0.0006499143,0.000023108249,0.000022509144,0.0002906203,0.00006831239,0.9768693,0.0079532135,0.013721388,0.00029417197,0.000030417656],"about_ca_topic_score_codex":0.0006787048,"about_ca_topic_score_gemma":0.0005094869,"teacher_disagreement_score":0.001834109,"about_ca_system_score_codex":0.0010287082,"about_ca_system_score_gemma":0.0007097898,"threshold_uncertainty_score":0.0096998215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0382522,0.0005283346,0.94944245,0.00036710518,0.00004520678,0.000027523702,0.000075499316,0.00006171673,0.011200001],"genre_scores_gemma":[0.85833716,0.0012667525,0.13667792,0.00020996384,0.00010985806,0.00007876948,0.00011519737,0.00004725229,0.0031570012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997763,0.000061175386,0.00001413647,0.000027385322,0.000094430136,0.000026585427],"domain_scores_gemma":[0.9994294,0.00025434917,0.00007669308,0.00008672482,0.00012493425,0.00002784307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044888197,0.00047594818,0.00019887135,0.000474912,0.00018861338,0.00065236556,0.00037630287,0.0004827158,0.0009508649],"category_scores_gemma":[0.0016168824,0.00013477451,0.00019025743,0.00047097474,0.0009588334,0.00072473247,0.00049042597,0.0006696845,0.00017193593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070598864,0.000024200319,0.00037920385,0.00008426482,0.000012274235,0.00013896989,0.00009688246,0.32112265,0.025788404,0.6281686,0.0005567226,0.023557313],"study_design_scores_gemma":[0.00000705541,0.00007916359,0.00012554864,0.000019852636,0.0000064500405,0.00010721942,0.000017285056,0.8944639,0.008528593,0.09348031,0.0031510312,0.000013637726],"about_ca_topic_score_codex":0.0009902918,"about_ca_topic_score_gemma":0.00067550445,"teacher_disagreement_score":0.0009902918,"about_ca_system_score_codex":0.00092940533,"about_ca_system_score_gemma":0.00059295405,"threshold_uncertainty_score":0.006743312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017570207,0.00025645984,0.9808482,0.00014071747,0.000038654267,0.000051261406,0.000016790993,0.0001846052,0.0008931042],"genre_scores_gemma":[0.9380898,0.0001831525,0.05999907,0.00014445977,0.00006392226,0.00008957684,0.000036908466,0.000011895619,0.0013811634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988624,0.00035646555,0.00006504606,0.00029667115,0.00025947086,0.00016002802],"domain_scores_gemma":[0.99864227,0.0005641335,0.00020678535,0.00014493536,0.00034805742,0.00009383253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688849,0.00062947447,0.00092848256,0.00031418953,0.0006987822,0.0007013956,0.0017702753,0.0006694089,0.0011067152],"category_scores_gemma":[0.0021101355,0.00022446559,0.0003705072,0.0005962694,0.0009135629,0.0011527813,0.001077108,0.00079158845,0.00024734298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065126276,0.0003517099,0.0019904263,0.0002336641,0.0001465115,0.00048693462,0.00043159028,0.6382201,0.027793257,0.03513271,0.0036204222,0.29094142],"study_design_scores_gemma":[0.000046127854,0.00012066317,0.00012712149,0.0000035059354,0.000015120392,0.00011031885,0.000016504619,0.99363375,0.0016369161,0.0036759553,0.000601779,0.000012289943],"about_ca_topic_score_codex":0.002260019,"about_ca_topic_score_gemma":0.002138076,"teacher_disagreement_score":0.002260019,"about_ca_system_score_codex":0.0006228743,"about_ca_system_score_gemma":0.00095485547,"threshold_uncertainty_score":0.0061817765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45316213,0.0030135012,0.5078148,0.0012677275,0.0000904037,0.000113290036,0.0008496875,0.00053924246,0.03314914],"genre_scores_gemma":[0.9924947,0.00058067887,0.005003068,0.000050953775,0.000033164604,0.00003286944,0.000087028966,0.000023724828,0.0016937763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878484,0.00044201533,0.000045734014,0.00009332088,0.00036040615,0.00027366268],"domain_scores_gemma":[0.9944523,0.0038312883,0.00061357545,0.00026823027,0.0007197936,0.000114695555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020127562,0.001228054,0.0011853363,0.00097030227,0.0007781208,0.0012785858,0.0008275621,0.0010548497,0.002261564],"category_scores_gemma":[0.0053441077,0.00047765076,0.0006468281,0.0012548795,0.0015313138,0.0011897762,0.0015467235,0.0008473946,0.0004495228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002462981,0.000029598825,0.0014424637,0.00012445693,0.000054230142,0.00047289164,0.00018748488,0.9558868,0.0049745515,0.030491004,0.0007890067,0.005301138],"study_design_scores_gemma":[0.000008695883,0.00003370101,0.00027899223,0.000010294305,0.000017595843,0.00008799298,0.000044325385,0.9947871,0.0009855579,0.003590028,0.00014047111,0.000015353604],"about_ca_topic_score_codex":0.006253411,"about_ca_topic_score_gemma":0.0036656098,"teacher_disagreement_score":0.006253411,"about_ca_system_score_codex":0.0019583874,"about_ca_system_score_gemma":0.0011501614,"threshold_uncertainty_score":0.014209151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14660846,0.0013737814,0.8366024,0.00027169578,0.0001602617,0.000061710656,0.00007268616,0.00028590258,0.014563126],"genre_scores_gemma":[0.9666451,0.0003224028,0.03114001,0.00007552393,0.00003891062,0.000049837072,0.000029475943,0.000005843101,0.0016928718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993044,0.00025122458,0.00002633161,0.000103480415,0.00016057899,0.0001539406],"domain_scores_gemma":[0.9992756,0.00034301466,0.00007712234,0.00012891738,0.00012654452,0.00004889224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047876115,0.00077719975,0.00067743246,0.0005111434,0.00079402904,0.00090026134,0.00077573134,0.0006487076,0.00069069944],"category_scores_gemma":[0.0011770239,0.00029118345,0.00045900958,0.0010437146,0.0007011567,0.00075590756,0.0018789825,0.0004487273,0.00024645551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088232214,0.00025582922,0.00709399,0.0006000646,0.00028635492,0.002787037,0.0007635432,0.5257071,0.09760632,0.108483754,0.004771852,0.25076178],"study_design_scores_gemma":[0.000024998675,0.00023656615,0.00041688804,0.000013784806,0.00004460165,0.000550502,0.00009835377,0.9832866,0.006536185,0.0056195203,0.0031396823,0.000032288026],"about_ca_topic_score_codex":0.0015714399,"about_ca_topic_score_gemma":0.0033225273,"teacher_disagreement_score":0.0015714399,"about_ca_system_score_codex":0.00040523137,"about_ca_system_score_gemma":0.0006090718,"threshold_uncertainty_score":0.003124535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513173,0.00048383023,0.93869686,0.00026928744,0.00013455522,0.000030219408,0.0001124667,0.0006644135,0.008291087],"genre_scores_gemma":[0.87302077,0.0004248176,0.117189236,0.00019745702,0.000038770137,0.00006180155,0.00019279245,0.000058678164,0.008815644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992406,0.000009288862,0.00000371939,0.000019086156,0.000027300235,0.000016505488],"domain_scores_gemma":[0.9998989,0.00003666356,0.000012974664,0.000011797702,0.00003159388,0.000008079542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018100289,0.00040951514,0.00027940585,0.00015372354,0.00014211521,0.0002608832,0.00066916965,0.000410633,0.0015644372],"category_scores_gemma":[0.00048248144,0.00017587768,0.0003206411,0.00020441976,0.0002814045,0.00061094656,0.00046460636,0.0006529587,0.00022713364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075786294,0.000038063903,0.00089949503,0.000079074875,0.000030752388,0.00014598345,0.000047335616,0.90558875,0.023095658,0.017849099,0.0014334725,0.05071652],"study_design_scores_gemma":[9.23095e-7,0.000005291143,0.000028304075,0.0000015429122,0.0000018497684,0.000007006545,0.0000011541724,0.9982058,0.00094811164,0.0005713858,0.00022710701,0.0000015792964],"about_ca_topic_score_codex":0.004928255,"about_ca_topic_score_gemma":0.005757615,"teacher_disagreement_score":0.004928255,"about_ca_system_score_codex":0.00064736593,"about_ca_system_score_gemma":0.00054604583,"threshold_uncertainty_score":0.009799123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3626172,0.0035658055,0.5927136,0.0007047416,0.0001387995,0.00010824891,0.0010535737,0.0018206968,0.03727732],"genre_scores_gemma":[0.98112524,0.0011920892,0.0145197045,0.000082926716,0.000031044125,0.000039911654,0.0002093438,0.00008256466,0.0027171893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989203,0.00028871762,0.000042154225,0.00015105728,0.00037037904,0.00022742743],"domain_scores_gemma":[0.9980452,0.00091307383,0.00029652935,0.00021907304,0.00048742036,0.00003869592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091797265,0.0011771702,0.00079408614,0.0008470018,0.0005401297,0.001026974,0.0008297489,0.0011679361,0.0019970369],"category_scores_gemma":[0.0030368937,0.00021930464,0.0006388802,0.0008584363,0.0009575388,0.00086285564,0.000824719,0.0007248313,0.0007961463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017733758,0.000052141924,0.0020921726,0.00027510308,0.00007226966,0.00058090605,0.00022847185,0.9460396,0.017744504,0.018115928,0.0009292104,0.013692241],"study_design_scores_gemma":[0.0000040271066,0.000051820563,0.00077333534,0.000031096148,0.000021033324,0.0002932298,0.000053587428,0.989892,0.0057019913,0.002596177,0.00055996404,0.000021826607],"about_ca_topic_score_codex":0.004475292,"about_ca_topic_score_gemma":0.003139596,"teacher_disagreement_score":0.004475292,"about_ca_system_score_codex":0.0015602331,"about_ca_system_score_gemma":0.00090012455,"threshold_uncertainty_score":0.011320293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009316612,0.0002523362,0.9888947,0.00010655609,0.000023834651,0.000008376051,0.000012587488,0.0000897846,0.0012951808],"genre_scores_gemma":[0.6912996,0.0008388974,0.30491182,0.00022931796,0.00007637785,0.000055010067,0.00005327896,0.000040948064,0.0024946828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951077,0.00019712873,0.0000176056,0.00006473092,0.00016526705,0.000044525925],"domain_scores_gemma":[0.9997025,0.00014621855,0.000046295005,0.000041456882,0.000049271333,0.000014299869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492972,0.00071390317,0.00041620593,0.00023512056,0.0002000022,0.00039065228,0.00036684197,0.0005768294,0.0009912631],"category_scores_gemma":[0.0010119457,0.00021070117,0.00032312455,0.0003370521,0.0006022798,0.0008227442,0.00074246473,0.00062568026,0.00035609456],"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.00022106366,0.000038344937,0.0007020138,0.00014331224,0.00007154397,0.00013404903,0.00012785853,0.73041666,0.0872736,0.04972374,0.0012397845,0.12990803],"study_design_scores_gemma":[0.000010378657,0.000074008814,0.000109209075,0.000009139665,0.000007013876,0.00005123044,0.000011166862,0.98938274,0.0054760887,0.0039321566,0.00092756655,0.000009424179],"about_ca_topic_score_codex":0.00060988247,"about_ca_topic_score_gemma":0.000636133,"teacher_disagreement_score":0.0009912631,"about_ca_system_score_codex":0.00027006198,"about_ca_system_score_gemma":0.00033600858,"threshold_uncertainty_score":0.0033161044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35289103,0.00048742516,0.6418946,0.00012114357,0.000022400332,0.00002741318,0.00017957416,0.00056890474,0.003807559],"genre_scores_gemma":[0.9782965,0.00015633085,0.019979963,0.000024181256,0.000005056307,0.000020003803,0.00007932328,0.000050385952,0.0013882896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.00010819017,0.00001947476,0.000050510265,0.00021131922,0.00008766179],"domain_scores_gemma":[0.9983448,0.00091129716,0.00022109503,0.00013711498,0.0003331969,0.00005245366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181081,0.0005501605,0.00041785356,0.00053232466,0.00025393986,0.0005435624,0.0005069603,0.0004233951,0.0010175223],"category_scores_gemma":[0.003551331,0.0002492677,0.00026935895,0.00039537178,0.0007535208,0.0007399413,0.00052686414,0.00049016,0.00020721264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345393,0.000010715885,0.00095779455,0.00004702277,0.000022620934,0.00008677753,0.00004849397,0.97108513,0.012383069,0.010542927,0.0001598935,0.0045720916],"study_design_scores_gemma":[0.00000103794,0.000011695092,0.00010925333,0.0000029350767,0.0000032295418,0.000015345753,0.0000053956273,0.99614054,0.0025682617,0.0010874424,0.000051623567,0.0000032588287],"about_ca_topic_score_codex":0.0043475265,"about_ca_topic_score_gemma":0.002377721,"teacher_disagreement_score":0.0043475265,"about_ca_system_score_codex":0.0010649089,"about_ca_system_score_gemma":0.00093675574,"threshold_uncertainty_score":0.008644462},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037895937,0.00028060033,0.9586078,0.00014849173,0.000026111225,0.000016058302,0.000030113511,0.000097042175,0.0028977867],"genre_scores_gemma":[0.95001525,0.00029516933,0.048171498,0.00007847665,0.000029892239,0.000037639722,0.000029621513,0.000013137373,0.0013292189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994363,0.00018544155,0.00001749892,0.0000708336,0.00019059016,0.00009923784],"domain_scores_gemma":[0.9994727,0.00030195416,0.00009212209,0.000037567428,0.00007245905,0.000023278879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605117,0.0007459128,0.00051175425,0.00025012283,0.00027792205,0.00051628484,0.00048403934,0.00052119745,0.0007155382],"category_scores_gemma":[0.0013021922,0.00020739528,0.00024954116,0.000453956,0.000754199,0.00065223535,0.0007648516,0.0005274045,0.00017469002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011998742,0.00002115534,0.0003796878,0.00008023718,0.000029172159,0.00018351416,0.000067766465,0.9227524,0.018511346,0.028447665,0.00061318546,0.02879397],"study_design_scores_gemma":[0.00000686842,0.000036327427,0.00007862785,0.000004299841,0.0000056822187,0.000029003353,0.000013258381,0.994412,0.0017170471,0.0034312427,0.0002599037,0.000005819471],"about_ca_topic_score_codex":0.0018818957,"about_ca_topic_score_gemma":0.0016900357,"teacher_disagreement_score":0.0018818957,"about_ca_system_score_codex":0.00056049245,"about_ca_system_score_gemma":0.00056787237,"threshold_uncertainty_score":0.004066646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007516526,0.00008959233,0.99177915,0.000039873645,0.000013227767,0.0000074797354,0.000010765878,0.00014936077,0.00039394016],"genre_scores_gemma":[0.26269004,0.00034983797,0.73393494,0.00009773313,0.00007383055,0.000047432146,0.00014634115,0.00013403736,0.0025256732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945873,0.00012483822,0.000019296758,0.00013519952,0.00021360755,0.00004831987],"domain_scores_gemma":[0.9995415,0.00021366336,0.00007912808,0.00006947206,0.00008316581,0.000013060822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075015303,0.0007175458,0.0006484808,0.00030988496,0.00022898409,0.0004179424,0.0006377447,0.00062057434,0.0007039047],"category_scores_gemma":[0.0025732021,0.00024077484,0.00042638258,0.0005007111,0.00038862048,0.00078333536,0.0006312624,0.00066321297,0.0004725548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024205558,0.00007284279,0.0015793433,0.00018578535,0.00012839498,0.00014562592,0.00012814946,0.44547495,0.11109637,0.021019578,0.0013059239,0.418621],"study_design_scores_gemma":[0.000009095269,0.000041437535,0.00030594433,0.000006502377,0.000014074325,0.00007859159,0.000010148916,0.98107314,0.015172899,0.001859612,0.0014162159,0.000012300149],"about_ca_topic_score_codex":0.0012033266,"about_ca_topic_score_gemma":0.0013437485,"teacher_disagreement_score":0.0012033266,"about_ca_system_score_codex":0.00023391671,"about_ca_system_score_gemma":0.000504098,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24399942,0.00057788345,0.74776596,0.00074673886,0.00019801344,0.0002532947,0.00008289423,0.00068351685,0.005692336],"genre_scores_gemma":[0.9663235,0.00011633462,0.031669967,0.000053621025,0.000020150886,0.000057942994,0.000045552122,0.000010521173,0.001702386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915504,0.00023245916,0.00007671226,0.00016827446,0.00021070648,0.00015680314],"domain_scores_gemma":[0.99908555,0.00018195208,0.000101225036,0.00026653634,0.000250176,0.00011449753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082573696,0.00030386727,0.0006181131,0.0004167729,0.0014564903,0.0007047447,0.0012520411,0.0007571994,0.0013026784],"category_scores_gemma":[0.001872904,0.00017102715,0.00028766858,0.0006050345,0.00075846585,0.0017257772,0.0014865106,0.0007014638,0.00028385303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012629412,0.00031216696,0.0038157161,0.00026948072,0.000106086874,0.0012781457,0.0012140733,0.39023504,0.09496827,0.11095034,0.00683995,0.38874772],"study_design_scores_gemma":[0.000059345643,0.00022467044,0.00029206465,0.000016178106,0.00001776748,0.00030291066,0.00010913305,0.96671605,0.010837902,0.017718654,0.0036646444,0.00004075776],"about_ca_topic_score_codex":0.0018252877,"about_ca_topic_score_gemma":0.0019201409,"teacher_disagreement_score":0.0018252877,"about_ca_system_score_codex":0.00070706254,"about_ca_system_score_gemma":0.0010606297,"threshold_uncertainty_score":0.005130112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3798592,0.0010249881,0.57658726,0.00024092355,0.0001667392,0.000054157033,0.00012173276,0.0015846413,0.040360365],"genre_scores_gemma":[0.93117684,0.0003019865,0.06370762,0.00008483701,0.000033206114,0.000023579089,0.00009136757,0.00004103287,0.004539535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978465,0.00003199498,0.000008734053,0.000039090373,0.00009178879,0.00004385984],"domain_scores_gemma":[0.99973863,0.00006180416,0.00006268531,0.000073485586,0.000043555585,0.000019843974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013898291,0.00036801523,0.00030464728,0.0002381556,0.00015255187,0.0004631829,0.00056175765,0.00029441685,0.0011210317],"category_scores_gemma":[0.0002642434,0.00016411376,0.00039665724,0.00031469465,0.00033113244,0.000566517,0.0005020895,0.00032970452,0.0005264005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004699309,0.00013789682,0.00394653,0.00040814406,0.00010539945,0.0010359389,0.00032605376,0.22914013,0.49730858,0.07317406,0.003427427,0.19051988],"study_design_scores_gemma":[0.00004170936,0.0010128872,0.0023423166,0.000025894376,0.00007476026,0.0018935094,0.00020430575,0.803638,0.15265998,0.012499303,0.02553764,0.00006974167],"about_ca_topic_score_codex":0.00030181272,"about_ca_topic_score_gemma":0.00036973943,"teacher_disagreement_score":0.0011210317,"about_ca_system_score_codex":0.00024117438,"about_ca_system_score_gemma":0.00024364043,"threshold_uncertainty_score":0.0037502646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016103903,0.00044645203,0.98140955,0.00010041981,0.000037781243,0.00002414064,0.000019570241,0.00019019384,0.0016680411],"genre_scores_gemma":[0.8115267,0.0010118965,0.18346052,0.00016134515,0.00018502794,0.00007606157,0.000053814274,0.000049110542,0.0034755478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935025,0.0002401948,0.00002253805,0.00007629092,0.00022534667,0.00008530889],"domain_scores_gemma":[0.9990983,0.00048608062,0.00010560512,0.00008891155,0.00018534294,0.000035775684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079798664,0.00095790974,0.0007668531,0.00056046445,0.00045234972,0.0007950042,0.0008482275,0.0007896718,0.00073402986],"category_scores_gemma":[0.0022056252,0.0004007178,0.0005722032,0.0004889773,0.00073880376,0.0008434955,0.0010034736,0.00084185257,0.0003522337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004695907,0.00014806417,0.0019518328,0.00032009947,0.00020670476,0.0005246137,0.00029630784,0.7518764,0.070531815,0.041644935,0.0011259814,0.13090365],"study_design_scores_gemma":[0.000006885018,0.00010574631,0.00020404508,0.000009952375,0.000027857823,0.00015469287,0.00002237726,0.9886975,0.0075042737,0.0025454995,0.0007055663,0.000015588375],"about_ca_topic_score_codex":0.0010013898,"about_ca_topic_score_gemma":0.0013129853,"teacher_disagreement_score":0.0010013898,"about_ca_system_score_codex":0.0003873284,"about_ca_system_score_gemma":0.00080429245,"threshold_uncertainty_score":0.0042201877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1874187,0.0016915288,0.7858123,0.0004266212,0.00006257546,0.00006563321,0.0003304716,0.00020983028,0.023982283],"genre_scores_gemma":[0.9740467,0.0006325093,0.023490692,0.00009798042,0.000060358223,0.00006388093,0.00015558525,0.000025890302,0.0014263444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907047,0.00038226173,0.000028653558,0.000119933946,0.00021995346,0.00017864516],"domain_scores_gemma":[0.99746764,0.0016298364,0.00033001212,0.00017165174,0.00030883026,0.00009209823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008509965,0.0009807266,0.00074997614,0.00087047153,0.0003924789,0.0011945314,0.0009295173,0.00067887525,0.0012962463],"category_scores_gemma":[0.0040856125,0.00036104288,0.00049273507,0.001126817,0.00087595836,0.0012241546,0.0012542295,0.0007225237,0.00023932947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023037323,0.000043524986,0.0026389195,0.00015781146,0.00005763578,0.00043667926,0.00016775985,0.90462047,0.009053703,0.05604384,0.0012903003,0.025258968],"study_design_scores_gemma":[0.000003082151,0.000033671386,0.0004101935,0.000005904152,0.0000073787623,0.00009818975,0.00004333064,0.99300694,0.0007577978,0.00528155,0.0003448514,0.000007080849],"about_ca_topic_score_codex":0.0019789708,"about_ca_topic_score_gemma":0.0017071547,"teacher_disagreement_score":0.0019789708,"about_ca_system_score_codex":0.00084349146,"about_ca_system_score_gemma":0.0005904158,"threshold_uncertainty_score":0.006120026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44025266,0.0018395759,0.5429758,0.00050974294,0.00006582304,0.00006980767,0.000058373742,0.0007609194,0.013467253],"genre_scores_gemma":[0.96103156,0.00025973594,0.038070895,0.00008092178,0.00004447166,0.000021670925,0.00002223406,0.000019754194,0.0004487745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972198,0.0013339418,0.000086182576,0.00029645258,0.0006997696,0.00036391092],"domain_scores_gemma":[0.9956043,0.002713517,0.0005710219,0.0004702755,0.0005493586,0.00009160431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230999,0.0009636534,0.0009625582,0.000508244,0.0003738327,0.0010959123,0.000581362,0.0008654638,0.0006088426],"category_scores_gemma":[0.0076353922,0.00028117947,0.0003565161,0.00083742867,0.0010153465,0.0012795196,0.0015399212,0.0007632043,0.00030272309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012088933,0.0003861998,0.010310405,0.00037938758,0.00028894976,0.00067394855,0.00070264033,0.5912787,0.1314947,0.044602297,0.0012822392,0.21739161],"study_design_scores_gemma":[0.00003416418,0.0006705804,0.0015428358,0.000023156732,0.000060502705,0.0005695964,0.00006439104,0.9581547,0.031196259,0.0064503765,0.0011892825,0.000044269284],"about_ca_topic_score_codex":0.0003344099,"about_ca_topic_score_gemma":0.0003387898,"teacher_disagreement_score":0.0018230999,"about_ca_system_score_codex":0.00057349034,"about_ca_system_score_gemma":0.0004330121,"threshold_uncertainty_score":0.009641588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009606516,0.00022648103,0.9882202,0.00030198492,0.000051073563,0.000038824346,0.00003464981,0.00033762638,0.0011826543],"genre_scores_gemma":[0.71587026,0.00046638458,0.2794093,0.00034337785,0.00038994467,0.0002472542,0.00027931947,0.000094403884,0.002899823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.00020796871,0.000030686533,0.00012719349,0.00027047202,0.00006254455],"domain_scores_gemma":[0.9981414,0.0011105011,0.0001880722,0.0002436729,0.00025195346,0.0000643586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077293586,0.00051075645,0.0009211005,0.0004367174,0.00046468785,0.0005212044,0.001273625,0.00080002565,0.0014378054],"category_scores_gemma":[0.004280311,0.00024767808,0.00028010705,0.001021364,0.0007774816,0.0015487935,0.0010799324,0.0014437918,0.00030195835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023450915,0.00018307833,0.0006442968,0.00013285562,0.000033382366,0.00011165991,0.000113518945,0.7614111,0.0076781907,0.02625434,0.004891104,0.19831201],"study_design_scores_gemma":[0.000008139983,0.000019504583,0.000040853134,0.000001990638,0.0000016604464,0.0000140382845,0.000005979537,0.994136,0.0007855686,0.004555109,0.00042828073,0.0000030416375],"about_ca_topic_score_codex":0.001873538,"about_ca_topic_score_gemma":0.002103136,"teacher_disagreement_score":0.001873538,"about_ca_system_score_codex":0.0005768682,"about_ca_system_score_gemma":0.0012639939,"threshold_uncertainty_score":0.0048099756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22417521,0.0012942933,0.76227945,0.00037718163,0.00009568622,0.00010341876,0.0001754322,0.0008224958,0.010676805],"genre_scores_gemma":[0.8395486,0.0008644412,0.15556161,0.00008754801,0.000073084804,0.00008229364,0.00026320937,0.00008660863,0.0034327332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987618,0.00033504562,0.000057008914,0.00014966386,0.0005418509,0.00015462308],"domain_scores_gemma":[0.99435586,0.003488986,0.0004967063,0.0005252617,0.0010284982,0.00010462081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886997,0.0010020636,0.0006446151,0.0006406292,0.00050854124,0.001293846,0.00055377954,0.00088224316,0.0016532423],"category_scores_gemma":[0.0057398337,0.00021995588,0.00030218673,0.000919838,0.00086193247,0.0012512846,0.00095249113,0.00062767696,0.00056744844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001578968,0.00010032948,0.003805083,0.0003973493,0.000094857605,0.00034488115,0.00019800515,0.6051131,0.0936796,0.05596499,0.001503953,0.23721886],"study_design_scores_gemma":[0.000019385041,0.00036488814,0.00036402527,0.000028688388,0.000019379127,0.0003144012,0.00004001682,0.95012283,0.03690812,0.010860131,0.00093547086,0.000022587155],"about_ca_topic_score_codex":0.002326653,"about_ca_topic_score_gemma":0.004186943,"teacher_disagreement_score":0.002326653,"about_ca_system_score_codex":0.0010335437,"about_ca_system_score_gemma":0.0018099757,"threshold_uncertainty_score":0.00749892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017911114,0.00018962286,0.979267,0.00017350943,0.00005337216,0.00005711729,0.000010666962,0.0005196823,0.001817869],"genre_scores_gemma":[0.8669487,0.00012976961,0.12933959,0.00025255917,0.00004609131,0.00021623843,0.00004756461,0.00005558734,0.0029638442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00017374654,0.000035244997,0.00013551644,0.00016837813,0.00010461038],"domain_scores_gemma":[0.9988129,0.0005146539,0.0001714396,0.00007458621,0.00033053887,0.00009593037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013949735,0.0008084102,0.0012117946,0.0004260344,0.0005610053,0.00073486444,0.0018735995,0.0012864113,0.0012557679],"category_scores_gemma":[0.0028818976,0.00031252136,0.0004312283,0.0003227108,0.0007879227,0.0007434683,0.0011489666,0.0011054019,0.00033404923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012561475,0.00008400761,0.0007081798,0.00004504204,0.00005693039,0.00008037802,0.00008060017,0.92130506,0.0023819492,0.004677822,0.0008794691,0.06957487],"study_design_scores_gemma":[0.00001983693,0.000031694097,0.00003328171,0.0000025596569,0.0000040665473,0.000013544059,0.0000028458605,0.99890554,0.00023347497,0.00055702194,0.00019329228,0.0000027916099],"about_ca_topic_score_codex":0.003912894,"about_ca_topic_score_gemma":0.0018875074,"teacher_disagreement_score":0.003912894,"about_ca_system_score_codex":0.0006016125,"about_ca_system_score_gemma":0.0014072373,"threshold_uncertainty_score":0.007780254},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05242221,0.00029279938,0.9436114,0.00046378732,0.000047791073,0.000022102615,0.000036744943,0.00014148567,0.0029616593],"genre_scores_gemma":[0.9588311,0.00021127712,0.039957996,0.000096581396,0.000044119028,0.000039081144,0.000052049654,0.000021710524,0.0007461609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990754,0.00036004646,0.0000255047,0.0001089579,0.00029158563,0.00013854814],"domain_scores_gemma":[0.9975852,0.0014184208,0.00038518469,0.00026451616,0.00026175953,0.00008489987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013384115,0.00062510686,0.00053776876,0.00042784202,0.000565809,0.00092443795,0.0010840694,0.00081589684,0.0007045839],"category_scores_gemma":[0.0061559663,0.00021081208,0.00026320218,0.00067468546,0.0011554587,0.002350984,0.0014799619,0.00097435666,0.00016113228],"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.00010197261,0.000025094063,0.0008944144,0.00006898983,0.000025920626,0.00023390297,0.00011880675,0.9281279,0.005230247,0.03816408,0.0007626686,0.026245978],"study_design_scores_gemma":[0.0000047309727,0.000029242523,0.000105944106,0.0000036766298,0.000005061575,0.000051285628,0.00003560864,0.9906234,0.0012605638,0.007597727,0.00027623327,0.000006466837],"about_ca_topic_score_codex":0.0010457459,"about_ca_topic_score_gemma":0.0008785567,"teacher_disagreement_score":0.0013384115,"about_ca_system_score_codex":0.0006837448,"about_ca_system_score_gemma":0.0005049177,"threshold_uncertainty_score":0.0070782304},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11286115,0.0005779625,0.8806459,0.00026833254,0.000027168293,0.000029513945,0.000047777976,0.00009876807,0.005443501],"genre_scores_gemma":[0.9804598,0.00036948206,0.017654082,0.000034459736,0.000018318016,0.000034481367,0.000013252612,0.000008809615,0.0014073624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993918,0.00027328086,0.000027759037,0.00009318268,0.00014273255,0.00007120118],"domain_scores_gemma":[0.9989336,0.0006517633,0.00015893097,0.00007819376,0.00014536126,0.000032093045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029982,0.00071793434,0.0006976437,0.00024477925,0.00033198018,0.0010384248,0.00060097553,0.00072830264,0.000761225],"category_scores_gemma":[0.0017298516,0.00029040716,0.00037736836,0.000482289,0.0011249476,0.0011590166,0.00079513417,0.00045332414,0.00022992287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021726258,0.00004368678,0.0007573856,0.00015025848,0.000057029618,0.00034599964,0.00019239406,0.9164452,0.025023105,0.03899041,0.00040023253,0.017377008],"study_design_scores_gemma":[0.000007990672,0.00006078731,0.00010188428,0.000004950542,0.000010567321,0.00005508902,0.000020782518,0.9935876,0.002281497,0.0037056692,0.00015449287,0.0000086793525],"about_ca_topic_score_codex":0.00082453474,"about_ca_topic_score_gemma":0.00063003384,"teacher_disagreement_score":0.0010384248,"about_ca_system_score_codex":0.00059248036,"about_ca_system_score_gemma":0.0004827685,"threshold_uncertainty_score":0.0054471493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023291115,0.0011119467,0.96999466,0.0004216573,0.000040498522,0.000022735905,0.0001402917,0.00017867456,0.0047984016],"genre_scores_gemma":[0.94688827,0.0018683024,0.04775703,0.0002622763,0.00020666716,0.00012380951,0.0002911485,0.0001337919,0.0024687534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970348,0.0011319974,0.00012124534,0.00026515624,0.0010758069,0.0003710978],"domain_scores_gemma":[0.9876314,0.009313473,0.0010485718,0.0006872808,0.0011500444,0.00016925865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032055625,0.0012515766,0.0011125342,0.0006543541,0.0004935551,0.0011711111,0.0008183955,0.0008617144,0.0024790238],"category_scores_gemma":[0.016648177,0.0005621861,0.0005091383,0.001225728,0.001396131,0.001856391,0.0014948708,0.0014334981,0.0005337699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009301023,0.00002445202,0.0010703354,0.00013784024,0.00003818272,0.00020026299,0.00011826847,0.9340652,0.00564868,0.040046223,0.001392315,0.017165314],"study_design_scores_gemma":[0.0000066717876,0.000030446103,0.000499088,0.000019231733,0.000013245752,0.00010651349,0.000026245958,0.9868341,0.0012614097,0.010787402,0.00040164718,0.000013999138],"about_ca_topic_score_codex":0.0023691843,"about_ca_topic_score_gemma":0.0016646356,"teacher_disagreement_score":0.0032055625,"about_ca_system_score_codex":0.0015249838,"about_ca_system_score_gemma":0.0011905658,"threshold_uncertainty_score":0.016952872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07772585,0.0002497211,0.9118871,0.00011081043,0.000031758897,0.000022166567,0.000024371739,0.0008017262,0.0091464445],"genre_scores_gemma":[0.92331624,0.00012278196,0.07343541,0.000038894694,0.000016636377,0.000019467676,0.000028475077,0.000027474804,0.0029945783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996531,0.000083547864,0.000008635732,0.000053784035,0.00014625036,0.000054796576],"domain_scores_gemma":[0.99976844,0.00005985075,0.00005543647,0.000040478277,0.00006379147,0.000012066403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021513991,0.00036114908,0.00041068761,0.00018253726,0.00022595364,0.00056608254,0.00063241133,0.000405463,0.000999425],"category_scores_gemma":[0.00042258363,0.00015062485,0.00026187178,0.00022654083,0.00030239052,0.00053338415,0.0005267888,0.0004476912,0.00042248674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024576497,0.000092024806,0.0017934181,0.00013122817,0.000049331888,0.0002273981,0.00021588441,0.6716532,0.13969065,0.015812248,0.0017839756,0.1683049],"study_design_scores_gemma":[0.0000073869496,0.00012729764,0.00023190111,0.000004923816,0.000009974165,0.00006706874,0.000028786984,0.9810065,0.0154680675,0.0009122949,0.002124671,0.000011226797],"about_ca_topic_score_codex":0.0011275825,"about_ca_topic_score_gemma":0.0015772082,"teacher_disagreement_score":0.0011275825,"about_ca_system_score_codex":0.00032535888,"about_ca_system_score_gemma":0.00045533737,"threshold_uncertainty_score":0.0033434033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0663687,0.0004465157,0.92788535,0.00036050173,0.00005038304,0.00003723369,0.000039082213,0.00041840994,0.004393907],"genre_scores_gemma":[0.97186565,0.00009040313,0.026068166,0.0000997647,0.000019528947,0.000045723813,0.000033959484,0.000027156786,0.0017496548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975294,0.00007974214,0.000009228656,0.000045367637,0.000054429893,0.00005836736],"domain_scores_gemma":[0.9993143,0.00043843867,0.00007929372,0.000028193159,0.00010699442,0.00003273709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842855,0.00078836054,0.0008041959,0.00018378456,0.00019552604,0.00056779094,0.00067494303,0.0007494868,0.0011799212],"category_scores_gemma":[0.0018508964,0.00032452156,0.00024302259,0.00019457626,0.00074198865,0.0005234081,0.0006912648,0.0009101984,0.00018544382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039241182,0.000019854988,0.00025243216,0.000021474298,0.000011750123,0.00002965862,0.000014819788,0.9856329,0.0008337805,0.0017365749,0.0002696597,0.0111378785],"study_design_scores_gemma":[0.0000032114322,0.000008875018,0.00001868736,0.0000010580529,0.0000012526236,0.000002178001,0.0000014270065,0.9994287,0.00012348252,0.00036141797,0.000048775142,9.30042e-7],"about_ca_topic_score_codex":0.0038044688,"about_ca_topic_score_gemma":0.003063855,"teacher_disagreement_score":0.0038044688,"about_ca_system_score_codex":0.00066009536,"about_ca_system_score_gemma":0.00082910556,"threshold_uncertainty_score":0.007564664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086273,0.00019680138,0.90756387,0.00012447528,0.000025369656,0.000021210062,0.00001906047,0.00021313809,0.0055631213],"genre_scores_gemma":[0.89462537,0.00011739916,0.10333063,0.000050637267,0.000016006737,0.000042139094,0.00004031884,0.000032941567,0.0017445935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999845,0.00004205393,0.0000036225606,0.00001949533,0.000060290047,0.000029509616],"domain_scores_gemma":[0.9998172,0.00007889225,0.000032071475,0.000019924384,0.00004164377,0.000010353051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017077423,0.00036759113,0.00033714928,0.00020638548,0.00015784767,0.00035081364,0.00027868117,0.000259377,0.0008839049],"category_scores_gemma":[0.00057025213,0.00014596053,0.00025036812,0.00026951797,0.00034764365,0.00034370835,0.00041017638,0.00034325843,0.00015339864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007803108,0.000032834323,0.0005206169,0.00003958898,0.000025276058,0.000049547383,0.000035857945,0.9115368,0.018981516,0.015325092,0.0007152461,0.052659575],"study_design_scores_gemma":[0.0000022992683,0.000015225095,0.000033389402,5.548999e-7,0.0000012787789,0.0000057883694,0.0000023522723,0.998384,0.00066604797,0.0007077846,0.00017992618,0.0000015276953],"about_ca_topic_score_codex":0.0010934762,"about_ca_topic_score_gemma":0.0011475743,"teacher_disagreement_score":0.0010934762,"about_ca_system_score_codex":0.00032440215,"about_ca_system_score_gemma":0.00041796194,"threshold_uncertainty_score":0.0029569864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079016745,0.0012675459,0.9109792,0.00056604046,0.00009991255,0.0000596617,0.00014980395,0.00018064238,0.007680514],"genre_scores_gemma":[0.9726394,0.00078566076,0.024499806,0.000061115854,0.00008230376,0.000053424978,0.00003601076,0.000033019875,0.0018092985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976173,0.0011779575,0.00009161112,0.00034084954,0.0004045792,0.000367707],"domain_scores_gemma":[0.9962627,0.0023310767,0.00047946864,0.00030827316,0.00046683176,0.00015163269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021537512,0.0019044763,0.0018956484,0.0006441198,0.0009858514,0.0024718035,0.0010289409,0.0013641845,0.0013439582],"category_scores_gemma":[0.006340796,0.0007728935,0.00085066014,0.0011086093,0.002425843,0.0023731354,0.0021767677,0.0014399539,0.0006675371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003310721,0.000041615956,0.0005090923,0.00025431404,0.00007703542,0.0010383159,0.00029590123,0.902035,0.014168038,0.069332026,0.0009677287,0.010949893],"study_design_scores_gemma":[0.000020561045,0.000060165443,0.000079041725,0.000016136732,0.000016966722,0.00019875845,0.00006268871,0.98393524,0.0025479055,0.012673002,0.00036936664,0.000020133708],"about_ca_topic_score_codex":0.0016205489,"about_ca_topic_score_gemma":0.0012670386,"teacher_disagreement_score":0.0024718035,"about_ca_system_score_codex":0.0013539741,"about_ca_system_score_gemma":0.0012665452,"threshold_uncertainty_score":0.011390269},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64092964,0.00065268896,0.345796,0.00020773227,0.00004751868,0.000040289175,0.00006946225,0.00039707034,0.011859635],"genre_scores_gemma":[0.9925768,0.000080047226,0.006572655,0.00001837154,0.000008358838,0.000012051544,0.00001547139,0.0000067444626,0.0007093899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988992,0.00038471326,0.000028841663,0.00013492384,0.00033755632,0.00021467806],"domain_scores_gemma":[0.99649125,0.002061311,0.00045432794,0.0003232328,0.00060002925,0.000069839356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010776992,0.0009480358,0.00068978703,0.000517921,0.0004008972,0.00086482946,0.00090117235,0.00076318794,0.0011151391],"category_scores_gemma":[0.0037402324,0.00022530697,0.00031849652,0.0005331272,0.0011596831,0.00083694886,0.00096035464,0.00051231554,0.00023032636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019866232,0.00002980172,0.0012771657,0.000046785175,0.0000338622,0.0002397251,0.000077769546,0.9728151,0.009124308,0.006705564,0.00017083483,0.009280448],"study_design_scores_gemma":[0.000002602747,0.00008131289,0.0002511485,0.0000026995742,0.000010113893,0.00007262466,0.000018236462,0.99587613,0.0028301927,0.0007407176,0.00010695036,0.000007269032],"about_ca_topic_score_codex":0.0018644346,"about_ca_topic_score_gemma":0.0017401933,"teacher_disagreement_score":0.0018644346,"about_ca_system_score_codex":0.0011524854,"about_ca_system_score_gemma":0.00060182787,"threshold_uncertainty_score":0.008361936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25524607,0.005675971,0.66212714,0.0014669533,0.00021403623,0.00010135553,0.0007043854,0.00057474466,0.073889285],"genre_scores_gemma":[0.978243,0.0024758326,0.015209019,0.00014812217,0.00017881212,0.00016414918,0.00020966907,0.000096453434,0.003274874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986051,0.00041014393,0.000037651407,0.0001495545,0.00039528334,0.00040229654],"domain_scores_gemma":[0.9917714,0.0061527467,0.0005212949,0.00052497577,0.0008351754,0.00019443769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295876,0.0014087444,0.0008924217,0.0014907519,0.00080477656,0.0019761955,0.0012435325,0.0009081595,0.0047241054],"category_scores_gemma":[0.007168763,0.0005247361,0.0005356159,0.001166834,0.0025829512,0.0027052746,0.0020259598,0.0018163907,0.0009257019],"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.00026469617,0.000093203125,0.00048895343,0.00039239423,0.00006379871,0.0003730302,0.00030265498,0.7286057,0.023454601,0.22613919,0.0034079107,0.016413858],"study_design_scores_gemma":[0.00000887334,0.000044545573,0.00025510998,0.000071843606,0.000016748922,0.0000796689,0.000054939548,0.95437914,0.006539277,0.03757298,0.00093186635,0.000045021006],"about_ca_topic_score_codex":0.0028372423,"about_ca_topic_score_gemma":0.0015811627,"teacher_disagreement_score":0.0047241054,"about_ca_system_score_codex":0.0023105983,"about_ca_system_score_gemma":0.0011507302,"threshold_uncertainty_score":0.0167647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030605635,0.00027869843,0.96672577,0.00014681235,0.000044866796,0.000014566144,0.000055137756,0.00052127393,0.0016073495],"genre_scores_gemma":[0.86303884,0.00036683146,0.13192786,0.00018624062,0.000053584532,0.000040135368,0.00019781225,0.000051291197,0.0041374257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998648,0.000026829963,0.000005231252,0.000030893407,0.000042035754,0.000030113826],"domain_scores_gemma":[0.99977106,0.00010954354,0.000026942464,0.000024924882,0.000052595464,0.000014934628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030034964,0.0005468946,0.00035752595,0.00022019888,0.00018405938,0.0003032326,0.0006688104,0.0005200008,0.0010262615],"category_scores_gemma":[0.00091228896,0.00024625304,0.00031709496,0.000316325,0.0003393288,0.00082297233,0.0005437176,0.0011616173,0.00027626273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018492952,0.00009293867,0.0014670029,0.000070581664,0.000047646532,0.00014880081,0.00007717402,0.7957796,0.018156216,0.0068814605,0.0018736986,0.17522003],"study_design_scores_gemma":[0.0000014778452,0.000008994519,0.00006431604,0.0000016399212,0.0000023038453,0.0000095713285,0.0000024670517,0.9977361,0.0013692369,0.00065994036,0.00014137679,0.0000025001088],"about_ca_topic_score_codex":0.0032512285,"about_ca_topic_score_gemma":0.0050415904,"teacher_disagreement_score":0.0032512285,"about_ca_system_score_codex":0.00039705465,"about_ca_system_score_gemma":0.000504758,"threshold_uncertainty_score":0.0064646006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020435872,0.00009814767,0.9768993,0.00012912299,0.00002824815,0.000014843569,0.000046447796,0.00018463742,0.002163355],"genre_scores_gemma":[0.8361049,0.00018121005,0.15950455,0.00019905617,0.00007522901,0.000096508586,0.0001814153,0.000031374388,0.003625736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981564,0.00004907361,0.000007201809,0.000042843276,0.00004996463,0.00003541077],"domain_scores_gemma":[0.99969983,0.00012170051,0.000038840586,0.00004615276,0.00007030727,0.00002324124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034247737,0.0004885384,0.0004382273,0.00012507605,0.0002355377,0.00032440462,0.0006319941,0.0005002052,0.00078324956],"category_scores_gemma":[0.0009395781,0.00022649959,0.00022552791,0.00027993487,0.0004915881,0.0006047376,0.0006153677,0.00060186145,0.00027928388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010662899,0.00006863678,0.0006651379,0.000054049677,0.00004166157,0.00006122675,0.000048607682,0.86736083,0.016160378,0.020711469,0.0020792985,0.092642054],"study_design_scores_gemma":[0.0000071864606,0.000020503994,0.00007172134,0.0000016308009,0.0000029042462,0.000009649197,0.0000036541812,0.9943053,0.0012747049,0.003993324,0.00030591516,0.0000035036173],"about_ca_topic_score_codex":0.0015454383,"about_ca_topic_score_gemma":0.0038827257,"teacher_disagreement_score":0.0015454383,"about_ca_system_score_codex":0.00035663202,"about_ca_system_score_gemma":0.00068431057,"threshold_uncertainty_score":0.0030728579},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.5676011,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.5690595,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056551263,0.0002766418,0.93880874,0.00028370414,0.00003814758,0.00007073778,0.000031042287,0.00017305464,0.00376671],"genre_scores_gemma":[0.76469046,0.00037081886,0.23057856,0.00012945596,0.000039481838,0.00021264805,0.00005766567,0.0000925616,0.0038283428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00038025464,0.00002913908,0.00009082162,0.00023162935,0.0001328832],"domain_scores_gemma":[0.99739754,0.0017970043,0.00017820219,0.00026867518,0.00026459782,0.00009395756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011947852,0.00051115145,0.00057527394,0.00029004636,0.00040713372,0.0006172101,0.00068342226,0.00048676785,0.001355019],"category_scores_gemma":[0.006096481,0.0002855803,0.00017729303,0.0005999371,0.0012908231,0.0010378764,0.0010046809,0.00073524064,0.00027670397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025151207,0.00004823573,0.00028470418,0.00011930319,0.000013528813,0.000080846155,0.00010624159,0.86063015,0.008411009,0.09321477,0.0010510217,0.035788592],"study_design_scores_gemma":[0.000019267853,0.0000345848,0.000041425363,0.000008332012,0.0000032273629,0.000012026163,0.000010423114,0.9765951,0.0019546377,0.02074474,0.00057164003,0.000004669825],"about_ca_topic_score_codex":0.0019899397,"about_ca_topic_score_gemma":0.0026687612,"teacher_disagreement_score":0.0019899397,"about_ca_system_score_codex":0.0010073786,"about_ca_system_score_gemma":0.0019109988,"threshold_uncertainty_score":0.007309079},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.25273666,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2025058,0.0005895636,0.7786997,0.00054763723,0.0001808553,0.00016114561,0.00010682417,0.00032760313,0.01688084],"genre_scores_gemma":[0.98654836,0.00007152616,0.012279384,0.000047898913,0.000029094805,0.000036853784,0.000018383442,0.000006403531,0.0009621603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995061,0.000175695,0.000012723249,0.00006653004,0.0000958813,0.000142958],"domain_scores_gemma":[0.9986645,0.00065306114,0.00018498351,0.00018737906,0.00019140709,0.00011860156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081934355,0.0004056598,0.00039639964,0.00035552794,0.0005731603,0.00049982656,0.0008359772,0.00031733298,0.0010173847],"category_scores_gemma":[0.0019255447,0.00013777729,0.00021073974,0.0005980842,0.00069523347,0.00059485855,0.0012552167,0.00031975366,0.00013973571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069014524,0.00019849007,0.0040801233,0.00017662863,0.00010414115,0.00091819494,0.00062978495,0.7700993,0.024968775,0.06467205,0.0060484293,0.1274139],"study_design_scores_gemma":[0.00003464411,0.00020410698,0.0006466128,0.000009611902,0.000023422248,0.00021950442,0.00012349716,0.9847829,0.0025781766,0.00911199,0.0022500008,0.000015619285],"about_ca_topic_score_codex":0.00291693,"about_ca_topic_score_gemma":0.0058490373,"teacher_disagreement_score":0.00291693,"about_ca_system_score_codex":0.00047786685,"about_ca_system_score_gemma":0.0012381832,"threshold_uncertainty_score":0.0057998896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075473026,0.000466296,0.9871022,0.00017205172,0.00009511826,0.00003219646,0.00004506371,0.00011823712,0.004421478],"genre_scores_gemma":[0.73927695,0.00088298664,0.24981244,0.0003408979,0.0002175609,0.00018484484,0.00012233098,0.000039098286,0.009122793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886334,0.00041646537,0.000029267296,0.00019649592,0.00032222178,0.0001722155],"domain_scores_gemma":[0.99913245,0.00035143504,0.0001314826,0.00012461966,0.00019903117,0.000060936098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093103613,0.001329786,0.0009273739,0.0004532769,0.0005614568,0.0011667713,0.0013866336,0.00089100195,0.0015104582],"category_scores_gemma":[0.00177198,0.00037221448,0.00048531863,0.00077053654,0.000876238,0.0013032202,0.001796834,0.0012016337,0.00052328716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029117576,0.00015130005,0.0009960855,0.00039925217,0.00014771443,0.0007150708,0.00018997176,0.6545919,0.034799542,0.15666991,0.0050897514,0.14595829],"study_design_scores_gemma":[0.000009176543,0.00010124572,0.000118247735,0.000011421829,0.000015410582,0.00016227433,0.000024418376,0.9852909,0.0024221523,0.009464682,0.0023644902,0.000015651653],"about_ca_topic_score_codex":0.0011337758,"about_ca_topic_score_gemma":0.0025266225,"teacher_disagreement_score":0.0015104582,"about_ca_system_score_codex":0.00046392196,"about_ca_system_score_gemma":0.0012547552,"threshold_uncertainty_score":0.0050530434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003758716,0.0022374305,0.003453128,0.012504882,0.026253963,0.0007776288,0.0154075995,0.005629247,0.93336034],"genre_scores_gemma":[0.00085000036,0.0011585862,0.00096657214,0.0028374502,0.0023814286,0.00034937498,0.0061996686,0.0011023503,0.98415446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822336,0.00025125503,0.000113637245,0.00021498236,0.00093672535,0.00026003938],"domain_scores_gemma":[0.9809341,0.002641765,0.00055587944,0.001632338,0.009596785,0.0046391482],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025389038,0.0011536947,0.0020135725,0.005543034,0.0029103872,0.006544456,0.0027114192,0.0029515028,0.9335262],"category_scores_gemma":[0.024190715,0.00065712485,0.00092764525,0.003273001,0.00065675855,0.002812118,0.0033063816,0.0025073779,0.9322542],"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.000018254448,0.000021867309,0.00004310923,0.000102074046,0.000001137111,0.000015215916,0.0000070058554,0.000024935413,0.00008392955,0.0006836253,0.9679148,0.031083984],"study_design_scores_gemma":[0.000015720498,0.000019829502,0.00014386832,0.00016208796,0.0000029153027,0.000040663446,0.000029774934,0.000088788765,0.00016392622,0.0011295958,0.99819535,0.000007533418],"about_ca_topic_score_codex":0.0020852338,"about_ca_topic_score_gemma":0.0040280353,"teacher_disagreement_score":0.06647378,"about_ca_system_score_codex":0.0014519057,"about_ca_system_score_gemma":0.005447208,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035569437,0.00048766806,0.9589966,0.0002361412,0.000035578014,0.00003734861,0.00012377996,0.0002249269,0.0042884536],"genre_scores_gemma":[0.9602598,0.0011509216,0.033555467,0.00014210216,0.000074248346,0.000092114875,0.00016136566,0.00012366872,0.0044402056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927396,0.00027338523,0.000025762247,0.000105081344,0.0002106771,0.00011112803],"domain_scores_gemma":[0.9980513,0.0010488488,0.0003351737,0.000185496,0.0003267201,0.00005254321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013337376,0.0010659385,0.0009491886,0.0006182309,0.00031344246,0.0010231243,0.0011552089,0.00085844693,0.0015464431],"category_scores_gemma":[0.0048957025,0.00048146976,0.0006676001,0.0008595835,0.00092939334,0.0015380454,0.0008359748,0.0012245825,0.0004915799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025983703,0.000022552997,0.00080281176,0.000049100432,0.000046197783,0.00020876112,0.000080439924,0.9530132,0.0024358726,0.03697743,0.0006686191,0.00566898],"study_design_scores_gemma":[8.0648385e-7,0.000008305825,0.00012733886,0.0000032969763,0.000003703378,0.000032966982,0.000007244047,0.9972615,0.00019426098,0.0022144325,0.00014160511,0.0000045786037],"about_ca_topic_score_codex":0.0032151928,"about_ca_topic_score_gemma":0.0016739729,"teacher_disagreement_score":0.0032151928,"about_ca_system_score_codex":0.00084616325,"about_ca_system_score_gemma":0.0006382768,"threshold_uncertainty_score":0.0070536137},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20480852,0.003177698,0.7689962,0.00083705306,0.0002343918,0.00022107446,0.0002011386,0.0014199922,0.020103939],"genre_scores_gemma":[0.9007087,0.00074928056,0.09423277,0.00016544524,0.00011784886,0.0000727373,0.0001377869,0.000030303612,0.0037850935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996923,0.0001007479,0.000021178332,0.00003909329,0.00010492772,0.00004178348],"domain_scores_gemma":[0.9995517,0.000080736754,0.00012118496,0.00008781569,0.00012578478,0.000032711003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037435372,0.00045170356,0.00035195964,0.0005717749,0.00035700193,0.00039345105,0.0004621617,0.00045200813,0.0010241946],"category_scores_gemma":[0.0009003394,0.00012959882,0.00023843462,0.0007040654,0.00060540484,0.0008105932,0.0006214997,0.0006222267,0.0006237455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012539105,0.0001981796,0.003798622,0.00056491984,0.0001336376,0.0005343317,0.0004040755,0.061666917,0.38642478,0.05893395,0.004749013,0.48133776],"study_design_scores_gemma":[0.00023039634,0.001444362,0.0030831278,0.000097912925,0.0001257883,0.0029511636,0.0001275909,0.6393473,0.27683836,0.014559671,0.06103227,0.00016208584],"about_ca_topic_score_codex":0.00038926327,"about_ca_topic_score_gemma":0.0006422348,"teacher_disagreement_score":0.0010241946,"about_ca_system_score_codex":0.00040835424,"about_ca_system_score_gemma":0.00037324015,"threshold_uncertainty_score":0.0034262538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060194172,0.00018751586,0.93525094,0.00009019283,0.000029272556,0.00003102425,0.000020037509,0.00011230868,0.0040845964],"genre_scores_gemma":[0.8968962,0.00017444998,0.10151249,0.000033849774,0.000014614222,0.00005089494,0.000022066522,0.00001660981,0.0012787796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978596,0.0000807124,0.000005843303,0.000039486084,0.000051308918,0.00003662982],"domain_scores_gemma":[0.9998568,0.000050464925,0.000039211038,0.00001664333,0.000024036226,0.000012805073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021100031,0.000609458,0.0003701298,0.00017391387,0.00023084939,0.00045987676,0.00053917064,0.00043146533,0.0007734251],"category_scores_gemma":[0.00051087403,0.00019770047,0.00023731831,0.00025918346,0.00043586275,0.00050586,0.00047674534,0.00034938645,0.00020043728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063368774,0.00003380003,0.00048860605,0.000041572926,0.000012835151,0.00010873534,0.00004252419,0.947144,0.017784094,0.005886412,0.0004930285,0.02790103],"study_design_scores_gemma":[0.0000049593773,0.000051279658,0.00007691435,0.0000017016739,0.0000035742528,0.000022580281,0.000015325983,0.9969599,0.0018012926,0.0006830451,0.00037638127,0.0000030527453],"about_ca_topic_score_codex":0.0011821064,"about_ca_topic_score_gemma":0.0014469085,"teacher_disagreement_score":0.0011821064,"about_ca_system_score_codex":0.00037671957,"about_ca_system_score_gemma":0.0003513128,"threshold_uncertainty_score":0.0027332902},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.5676011,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59064907,0.000786068,0.37357622,0.0004989526,0.000068650035,0.00003264979,0.000082045335,0.0002921764,0.03401414],"genre_scores_gemma":[0.9928282,0.00016229117,0.0041642357,0.00005090182,0.000010867658,0.000008527714,0.000020073345,0.0000110393985,0.0027438116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979097,0.00005295623,0.0000049986725,0.000029551364,0.00008985121,0.00003163959],"domain_scores_gemma":[0.99978787,0.000080035126,0.000063985186,0.00003160249,0.00002956263,0.0000069817024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001777541,0.00041160572,0.00022567289,0.00016113106,0.00015225427,0.00034503257,0.00039399412,0.0003841291,0.0009841918],"category_scores_gemma":[0.0004869943,0.00012848525,0.0001877165,0.00020410931,0.000510978,0.00066709035,0.00038356392,0.00024401354,0.0002648929],"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.0004307322,0.00013857511,0.0069873645,0.00029695433,0.00008647544,0.0017876909,0.00035984375,0.44420034,0.3722005,0.11189876,0.0016064901,0.060006287],"study_design_scores_gemma":[0.000012596135,0.00017605533,0.0018270152,0.000011262947,0.000017602151,0.0006333397,0.000053682936,0.9548979,0.03228384,0.008740617,0.0013272071,0.000018851943],"about_ca_topic_score_codex":0.00029847477,"about_ca_topic_score_gemma":0.00026906302,"teacher_disagreement_score":0.0009841918,"about_ca_system_score_codex":0.00039068077,"about_ca_system_score_gemma":0.0001523276,"threshold_uncertainty_score":0.0032924414},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30369672,0.00059107033,0.68775034,0.00017601419,0.000060780974,0.00003488015,0.000061760744,0.0003561292,0.007272294],"genre_scores_gemma":[0.9720181,0.0000966505,0.026760427,0.000038358703,0.000019837362,0.000018101338,0.000025491703,0.0000052100836,0.0010178078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.00010334137,0.0000127593685,0.00005062132,0.00013083348,0.00006242469],"domain_scores_gemma":[0.9994543,0.00022375515,0.0000916431,0.00007849332,0.00012348287,0.000028362892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003414143,0.00047766964,0.00041299002,0.0002553704,0.00026552126,0.0005025141,0.00054193725,0.0003345145,0.0007819247],"category_scores_gemma":[0.00085050653,0.00016615551,0.00026000617,0.00032386786,0.00037915478,0.00057804293,0.00062631536,0.00030442837,0.00023503181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008574136,0.00013292761,0.003792829,0.00015617207,0.0001491413,0.0004749155,0.00031300212,0.6840571,0.11733092,0.03321402,0.0012587429,0.15826286],"study_design_scores_gemma":[0.000029181234,0.00018208311,0.00041401116,0.000006971642,0.000022137187,0.00015635007,0.000022863147,0.98558944,0.00971468,0.002905069,0.0009420379,0.000015218059],"about_ca_topic_score_codex":0.00053079304,"about_ca_topic_score_gemma":0.0010802189,"teacher_disagreement_score":0.0007819247,"about_ca_system_score_codex":0.00032857235,"about_ca_system_score_gemma":0.000377657,"threshold_uncertainty_score":0.0026158094},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015864277,0.0005981166,0.98115873,0.00021680689,0.00013049947,0.00006929207,0.00003804508,0.0004373034,0.0014868549],"genre_scores_gemma":[0.8304718,0.00057601643,0.1660188,0.00022352983,0.00012994013,0.00012735484,0.000077961595,0.000076902965,0.0022977353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989672,0.00030366794,0.000080566824,0.00024031715,0.00029295153,0.00011525958],"domain_scores_gemma":[0.99846315,0.0005311178,0.00018239711,0.0002975245,0.00042096895,0.00010486719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489067,0.00084233645,0.00082794466,0.0006697655,0.00055743573,0.0009422406,0.0016903026,0.0006548701,0.0016766279],"category_scores_gemma":[0.0053587244,0.0002610041,0.0003176269,0.0009769213,0.0008272806,0.0018746287,0.0011692161,0.0012565114,0.00045789476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069750875,0.00024276564,0.0009588797,0.00020045238,0.000074959,0.00029751417,0.0003945693,0.5326219,0.07052672,0.06374564,0.006013351,0.32422575],"study_design_scores_gemma":[0.000029637931,0.00008075078,0.00010397183,0.000009039627,0.000014009584,0.00011265636,0.000024696508,0.98784745,0.005565041,0.0048767533,0.0013065912,0.000029318018],"about_ca_topic_score_codex":0.0019791883,"about_ca_topic_score_gemma":0.0020107373,"teacher_disagreement_score":0.0019791883,"about_ca_system_score_codex":0.0007468758,"about_ca_system_score_gemma":0.00077278155,"threshold_uncertainty_score":0.0066049695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03464708,0.0002287356,0.9608091,0.00011423606,0.000024334,0.00006637024,0.00013779591,0.00091395783,0.0030584484],"genre_scores_gemma":[0.32807654,0.00031130796,0.66718763,0.00007409975,0.000030441523,0.00015932627,0.00046257392,0.00014348482,0.0035546534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934393,0.00017674548,0.000036973994,0.00006631503,0.0003085096,0.000067523084],"domain_scores_gemma":[0.9991887,0.00035023558,0.0000581646,0.0001102493,0.00026522373,0.0000274338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049730093,0.0008654337,0.000502318,0.00052150927,0.0004265603,0.0007281826,0.0006216857,0.00042615057,0.0020627258],"category_scores_gemma":[0.002186913,0.00032625656,0.00051119726,0.0006854002,0.00033519254,0.0006845728,0.0005923872,0.0006753725,0.0008270646],"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.0003540948,0.00007068488,0.0012447666,0.0001858245,0.00007994643,0.00032101822,0.00017616949,0.6705632,0.06688542,0.036989838,0.0035418884,0.21958712],"study_design_scores_gemma":[0.000012992403,0.000050590057,0.00017726453,0.0000072495836,0.000015318503,0.00011409978,0.000011795179,0.9785186,0.017227994,0.0025540034,0.0012999728,0.000010186345],"about_ca_topic_score_codex":0.0046288483,"about_ca_topic_score_gemma":0.009053061,"teacher_disagreement_score":0.0046288483,"about_ca_system_score_codex":0.0008301119,"about_ca_system_score_gemma":0.0021463383,"threshold_uncertainty_score":0.009203792},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02318416,0.00030222448,0.9723302,0.00031051037,0.00003700586,0.000019219857,0.000016568678,0.00019059569,0.0036094915],"genre_scores_gemma":[0.9506749,0.00016655133,0.046511665,0.00012792968,0.000027251186,0.000035746445,0.000023731398,0.000025888132,0.0024064402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998085,0.00006038866,0.0000065653094,0.00003977919,0.000047951657,0.000036912872],"domain_scores_gemma":[0.9995995,0.0002229894,0.00005433286,0.000031739328,0.00006878504,0.000022665168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448852,0.0005467281,0.00054650276,0.00012932032,0.00017400064,0.000537175,0.0005454804,0.0005462213,0.0014725513],"category_scores_gemma":[0.0012941727,0.00020105632,0.0002062763,0.00019715306,0.00060139754,0.0006665965,0.00057300297,0.0008066926,0.0002610111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006371098,0.000034864057,0.00047810085,0.000057240693,0.000023203016,0.00005519497,0.00003882096,0.93439806,0.0030413033,0.009903543,0.0008743505,0.051031664],"study_design_scores_gemma":[0.000004677351,0.000015473986,0.000031259504,0.0000022987065,0.0000024868032,0.000007903194,0.0000041602216,0.9981516,0.0003559044,0.0012410721,0.00018131382,0.0000017880863],"about_ca_topic_score_codex":0.001680305,"about_ca_topic_score_gemma":0.0021584558,"teacher_disagreement_score":0.001680305,"about_ca_system_score_codex":0.000543385,"about_ca_system_score_gemma":0.0005584568,"threshold_uncertainty_score":0.0049262047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009240146,0.00025852496,0.9890482,0.00007752147,0.000028256874,0.0000106679845,0.000021375103,0.00007049988,0.0012448153],"genre_scores_gemma":[0.88031816,0.0006617104,0.11637494,0.00012122695,0.000072486364,0.00005727109,0.000080320526,0.000024581886,0.0022892354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.00012356862,0.000023407187,0.00007287858,0.00016481166,0.00007252892],"domain_scores_gemma":[0.99964297,0.00016663152,0.00008013969,0.000044091143,0.00005067557,0.000015478585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280272,0.0010204887,0.0006004219,0.00025419638,0.00036236443,0.00058282836,0.0005082774,0.00055217935,0.0007665323],"category_scores_gemma":[0.001164468,0.00023531972,0.00035431102,0.00049741304,0.00050585275,0.0008309508,0.0007581638,0.0006399628,0.00026443164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019347317,0.000024101317,0.0005774643,0.000113754686,0.000045989418,0.00016863624,0.00008531321,0.85997605,0.029968543,0.033543058,0.0009974424,0.0743061],"study_design_scores_gemma":[0.000008518493,0.000068279056,0.00010536117,0.000008176606,0.0000092703285,0.000048167018,0.000015996868,0.99112284,0.0044427933,0.0034704988,0.00069086737,0.00000924977],"about_ca_topic_score_codex":0.0012697998,"about_ca_topic_score_gemma":0.0013453324,"teacher_disagreement_score":0.0012697998,"about_ca_system_score_codex":0.00041458893,"about_ca_system_score_gemma":0.00051162764,"threshold_uncertainty_score":0.0030081272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15575525,0.0008777459,0.83079594,0.00020190753,0.000054415283,0.000050658986,0.00009963466,0.00035010162,0.01181432],"genre_scores_gemma":[0.810101,0.00062346325,0.18744244,0.00011958215,0.00002753376,0.00006106226,0.00008581948,0.000018178616,0.0015208874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.000092065005,0.000008987432,0.000025560115,0.00007174756,0.000025871526],"domain_scores_gemma":[0.9996006,0.00015227498,0.000057054458,0.000059848124,0.00011039103,0.000019925728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002577033,0.00041251903,0.00031389642,0.00016844319,0.00011725563,0.0005027355,0.00029134535,0.0005388845,0.0010378194],"category_scores_gemma":[0.0005947089,0.0001481605,0.00030568914,0.000264585,0.00017470669,0.00036969763,0.00027543507,0.00024026186,0.00037655892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039417256,0.00011134678,0.0026990252,0.00020698327,0.00016970813,0.00020880291,0.00011225498,0.74506176,0.12811202,0.013807682,0.0010281731,0.10808803],"study_design_scores_gemma":[0.000022658078,0.0004970871,0.001005813,0.000012478753,0.000031951095,0.00025719436,0.00003958262,0.95778143,0.03648766,0.0014144577,0.0024266476,0.000023064638],"about_ca_topic_score_codex":0.00040377802,"about_ca_topic_score_gemma":0.0006987193,"teacher_disagreement_score":0.0010378194,"about_ca_system_score_codex":0.00022605837,"about_ca_system_score_gemma":0.00022235954,"threshold_uncertainty_score":0.0034717917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0181035,0.0003320262,0.9770076,0.00036728123,0.00008934677,0.00006009475,0.000037513488,0.0004981219,0.0035045603],"genre_scores_gemma":[0.8658429,0.00031958538,0.12893839,0.00043795936,0.000087937784,0.000101714795,0.00010590089,0.00009989472,0.004065654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992607,0.00027647518,0.000026988255,0.000101174366,0.00024504296,0.0000895102],"domain_scores_gemma":[0.9987142,0.0007447962,0.000128842,0.00023542155,0.00013008107,0.00004658576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013222699,0.0010401391,0.0007415737,0.00033303708,0.00029988438,0.00053625624,0.0009476592,0.00086067145,0.0017707421],"category_scores_gemma":[0.0037393884,0.00024423792,0.00052424415,0.00029782098,0.00079608255,0.0011210114,0.001198774,0.0025784061,0.00046201327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002270379,0.00009512541,0.0013160531,0.000091429756,0.000102014186,0.00014526599,0.00006248218,0.8141741,0.01854966,0.03700849,0.003530772,0.12469755],"study_design_scores_gemma":[0.0000035633743,0.00003724758,0.00009131843,0.0000048562883,0.000005426755,0.000044331966,0.000002649856,0.9931392,0.0031230159,0.0029204807,0.00062414195,0.000003766194],"about_ca_topic_score_codex":0.0005600933,"about_ca_topic_score_gemma":0.0007996247,"teacher_disagreement_score":0.0017707421,"about_ca_system_score_codex":0.0006007027,"about_ca_system_score_gemma":0.00040661843,"threshold_uncertainty_score":0.006992936},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019479844,0.0049822503,0.024355022,0.008238078,0.008348754,0.0002497537,0.00675427,0.003260733,0.9418631],"genre_scores_gemma":[0.00911877,0.005616923,0.002854245,0.001296441,0.0015035407,0.00017632596,0.0066172923,0.00049755914,0.9723188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994123,0.00008866476,0.000032618103,0.00010712969,0.00028740347,0.00007185847],"domain_scores_gemma":[0.99780077,0.00040135047,0.000121180754,0.0005639504,0.00092294184,0.00018981971],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00074842834,0.001543972,0.0012638483,0.0027555698,0.0011504731,0.0036370526,0.00083955796,0.002482025,0.36810747],"category_scores_gemma":[0.0036372084,0.0006013635,0.00036708545,0.0031635133,0.00061794196,0.0024662497,0.0016856776,0.002490509,0.3699826],"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.00005168268,0.000044816526,0.00015604154,0.0001452913,0.000011288766,0.00007167934,0.000022779199,0.0009457996,0.0011751951,0.010035555,0.7659959,0.22134405],"study_design_scores_gemma":[0.000014906331,0.000030876563,0.00041778322,0.00011990357,0.00001668572,0.00008626617,0.000023047625,0.0024715909,0.000849053,0.006255401,0.9896987,0.000015893938],"about_ca_topic_score_codex":0.003729893,"about_ca_topic_score_gemma":0.0033348491,"teacher_disagreement_score":0.63189256,"about_ca_system_score_codex":0.0011234991,"about_ca_system_score_gemma":0.002213832,"threshold_uncertainty_score":0.901318},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021005846,0.010510378,0.042408824,0.012571899,0.015199809,0.00026810303,0.004134137,0.0039163325,0.90888995],"genre_scores_gemma":[0.020643618,0.012569235,0.011727708,0.003747659,0.003238393,0.00029966168,0.008925719,0.00055999524,0.938288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986596,0.00016630844,0.00008554198,0.0003515774,0.0005866358,0.00015026006],"domain_scores_gemma":[0.9974486,0.00023020596,0.000094099574,0.00057090144,0.0014304061,0.0002257693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009541297,0.0011962029,0.0007604868,0.0015819413,0.0011000443,0.0041359137,0.0011116755,0.002458067,0.25378728],"category_scores_gemma":[0.0031955815,0.00036708335,0.0004784505,0.0018838394,0.00066567026,0.0022748737,0.002178896,0.0029093411,0.28134808],"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.00006283095,0.000044447974,0.0005072186,0.00017160251,0.000020017445,0.00015391066,0.00006766772,0.0005288415,0.001722184,0.01832898,0.6891825,0.28920975],"study_design_scores_gemma":[0.000007962797,0.000020760504,0.00026213806,0.000070914124,0.0000064366236,0.00016013929,0.00003126735,0.0006592168,0.00035924563,0.00404794,0.9943627,0.000011294946],"about_ca_topic_score_codex":0.0028305773,"about_ca_topic_score_gemma":0.0019685014,"teacher_disagreement_score":0.7462127,"about_ca_system_score_codex":0.0009841757,"about_ca_system_score_gemma":0.0022370662,"threshold_uncertainty_score":0.849003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039842203,0.002820163,0.9449045,0.00053680217,0.00021175442,0.00036491148,0.00031294767,0.0014356422,0.009571122],"genre_scores_gemma":[0.24077958,0.0011442051,0.7522801,0.00046340152,0.00009040239,0.0006809781,0.00056245085,0.00029527268,0.0037036305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.00073422893,0.000031198848,0.000080903905,0.00017625443,0.00011888396],"domain_scores_gemma":[0.9985006,0.0011107587,0.000105540836,0.0000786572,0.0001611823,0.000043284428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017518846,0.00093626144,0.0012623192,0.0015678268,0.0013505149,0.0014058977,0.0015211145,0.0017648747,0.003943054],"category_scores_gemma":[0.004482804,0.00065524806,0.00074650865,0.0024474347,0.0012894738,0.0013236728,0.0006300113,0.0009169102,0.0008467678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013194299,0.00012395676,0.000545709,0.00015754427,0.00008073332,0.00006363355,0.00013145241,0.86877793,0.0008189652,0.014513315,0.005804036,0.10885075],"study_design_scores_gemma":[0.000086648615,0.00011028219,0.00016507233,0.00004044793,0.000028138602,0.00005224915,0.00006309823,0.98420423,0.0006788288,0.010463373,0.0040873135,0.000020309812],"about_ca_topic_score_codex":0.008421164,"about_ca_topic_score_gemma":0.007850068,"teacher_disagreement_score":0.008421164,"about_ca_system_score_codex":0.0014011466,"about_ca_system_score_gemma":0.002265545,"threshold_uncertainty_score":0.016744256},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025449536,0.0006408828,0.0011086719,0.0062620635,0.009011861,0.0004484346,0.0070951744,0.0034350194,0.9717434],"genre_scores_gemma":[0.0006486518,0.0004237218,0.00030284893,0.0018957587,0.00083549635,0.00016087115,0.002177526,0.0004857897,0.99306935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999323,0.00006585559,0.000028432933,0.0000833861,0.00035031507,0.0001489562],"domain_scores_gemma":[0.99524313,0.0006157984,0.00012669062,0.00038234043,0.0025697413,0.0010622086],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087517494,0.001230258,0.0017820174,0.0037353437,0.003671218,0.005381754,0.0022279816,0.0030769987,0.9219202],"category_scores_gemma":[0.008805373,0.00071281346,0.00097173214,0.0025487232,0.0006057471,0.0019784104,0.0021879121,0.002395739,0.9227085],"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.000012152247,0.000019031597,0.000034546138,0.000045913388,0.0000010921722,0.000012769243,0.000004432093,0.000023219538,0.00008719123,0.00036348516,0.9825386,0.016857613],"study_design_scores_gemma":[0.000020898346,0.000028166245,0.00044261658,0.000117486125,0.0000045963648,0.000039864488,0.00003599427,0.000126154,0.00022289336,0.0009520643,0.99799675,0.000012480579],"about_ca_topic_score_codex":0.0067975097,"about_ca_topic_score_gemma":0.018241942,"teacher_disagreement_score":0.07807982,"about_ca_system_score_codex":0.001339637,"about_ca_system_score_gemma":0.0049506887,"threshold_uncertainty_score":0.11137128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002626553,0.00023719686,0.9965,0.000034157016,0.000029552202,0.000009107543,0.000034066124,0.00017030007,0.00035891565],"genre_scores_gemma":[0.24378417,0.0012229098,0.750387,0.0001978447,0.0002686402,0.00015567473,0.0005096537,0.00016627941,0.0033078245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00023480404,0.00004785274,0.00012740958,0.00029053722,0.000056353183],"domain_scores_gemma":[0.99792284,0.0011329912,0.0002906344,0.00024054511,0.00036456189,0.000048396585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010294517,0.0009769134,0.001183401,0.0009163024,0.0003667895,0.0010147527,0.0009967863,0.0012591076,0.0013516922],"category_scores_gemma":[0.008747117,0.00052079494,0.0005153789,0.0011014815,0.0005550549,0.0018342057,0.0010712261,0.0012145228,0.0011506703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006139011,0.00013717385,0.0048518507,0.0005232353,0.00025783127,0.00038671482,0.00016653338,0.33947933,0.068335265,0.071131706,0.0060738777,0.50804263],"study_design_scores_gemma":[0.00002508494,0.00006306648,0.00073638133,0.00003151973,0.000039786686,0.00034618343,0.000014521581,0.9744707,0.011820869,0.009544485,0.0028598716,0.000047642636],"about_ca_topic_score_codex":0.0006649157,"about_ca_topic_score_gemma":0.0009930993,"teacher_disagreement_score":0.0013516922,"about_ca_system_score_codex":0.00047094875,"about_ca_system_score_gemma":0.00079251983,"threshold_uncertainty_score":0.0054442883},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021005846,0.010510378,0.042408824,0.012571899,0.015199809,0.00026810303,0.004134137,0.0039163325,0.90888995],"genre_scores_gemma":[0.020643618,0.012569235,0.011727708,0.003747659,0.003238393,0.00029966168,0.008925719,0.00055999524,0.938288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986596,0.00016630844,0.00008554198,0.0003515774,0.0005866358,0.00015026006],"domain_scores_gemma":[0.9974486,0.00023020596,0.000094099574,0.00057090144,0.0014304061,0.0002257693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009541297,0.0011962029,0.0007604868,0.0015819413,0.0011000443,0.0041359137,0.0011116755,0.002458067,0.25378728],"category_scores_gemma":[0.0031955815,0.00036708335,0.0004784505,0.0018838394,0.00066567026,0.0022748737,0.002178896,0.0029093411,0.28134808],"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.00006283095,0.000044447974,0.0005072186,0.00017160251,0.000020017445,0.00015391066,0.00006766772,0.0005288415,0.001722184,0.01832898,0.6891825,0.28920975],"study_design_scores_gemma":[0.000007962797,0.000020760504,0.00026213806,0.000070914124,0.0000064366236,0.00016013929,0.00003126735,0.0006592168,0.00035924563,0.00404794,0.9943627,0.000011294946],"about_ca_topic_score_codex":0.0028305773,"about_ca_topic_score_gemma":0.0019685014,"teacher_disagreement_score":0.7462127,"about_ca_system_score_codex":0.0009841757,"about_ca_system_score_gemma":0.0022370662,"threshold_uncertainty_score":0.849003},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035163683,0.0010808461,0.9868721,0.00029160766,0.00017943988,0.00003000698,0.00010536772,0.00026214408,0.0076622083],"genre_scores_gemma":[0.32304618,0.004602878,0.64644235,0.00086145784,0.0010137501,0.00030200847,0.00044069806,0.0007407084,0.022549983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.00020040474,0.00008289757,0.00018406841,0.0006946028,0.000102195205],"domain_scores_gemma":[0.9988049,0.00053094886,0.00011450424,0.00011811816,0.00040313834,0.000028354954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344361,0.0017872093,0.0010576441,0.00074385386,0.00032098667,0.0014489685,0.0011779648,0.0013082575,0.005388658],"category_scores_gemma":[0.0041637663,0.00049909623,0.00055230595,0.0006395183,0.0012504577,0.0021429923,0.00092187535,0.0017190254,0.0034911449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001881557,0.00012496454,0.0008182875,0.0007843351,0.00011031722,0.00066703866,0.00031764948,0.3803632,0.07621722,0.41801238,0.0122022545,0.110194154],"study_design_scores_gemma":[0.000040009534,0.0002719914,0.0013088436,0.00014522528,0.000079054655,0.0018519436,0.00006593394,0.7915561,0.02326848,0.15431179,0.02697605,0.00012452045],"about_ca_topic_score_codex":0.00041028202,"about_ca_topic_score_gemma":0.00065286196,"teacher_disagreement_score":0.005388658,"about_ca_system_score_codex":0.00095127634,"about_ca_system_score_gemma":0.00054737803,"threshold_uncertainty_score":0.018026829},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.23525538,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002286167,0.0035501039,0.025612587,0.00373077,0.0070607904,0.00013511186,0.0012185811,0.0025574828,0.95384836],"genre_scores_gemma":[0.0056117396,0.0022496572,0.0019435311,0.0005185652,0.00053213735,0.000058089146,0.0011724185,0.00017974262,0.98773414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995208,0.000063312014,0.000021758113,0.000102143735,0.00022731471,0.000064630345],"domain_scores_gemma":[0.99836093,0.00015466395,0.000048214763,0.00035566106,0.0009268798,0.00015368499],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006177483,0.001336576,0.00061665877,0.0016328015,0.0011248495,0.002730041,0.0006499586,0.001974978,0.31583074],"category_scores_gemma":[0.001650183,0.00038306494,0.00034253142,0.0015250297,0.0005643473,0.001264549,0.0015910228,0.0019350705,0.4021558],"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.00007022582,0.00007430189,0.00038858535,0.00011333651,0.000013390005,0.000110886685,0.00005078903,0.00069846475,0.0033649614,0.007819059,0.5887509,0.39854506],"study_design_scores_gemma":[0.0000065482636,0.000026144462,0.0004919401,0.00006157173,0.0000096433405,0.00010742439,0.000034684446,0.0010622812,0.000947266,0.0017732567,0.99547005,0.000009299507],"about_ca_topic_score_codex":0.0035930665,"about_ca_topic_score_gemma":0.0049746404,"teacher_disagreement_score":0.6841693,"about_ca_system_score_codex":0.00076155004,"about_ca_system_score_gemma":0.0016109655,"threshold_uncertainty_score":0.97588444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035137748,0.00077518873,0.99044776,0.00017131606,0.00008447366,0.00010727947,0.00006272105,0.00018258463,0.00465498],"genre_scores_gemma":[0.18964653,0.003036548,0.79387605,0.00035101883,0.00024943386,0.00037258226,0.0002630893,0.00009193327,0.012112813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947244,0.00015476556,0.00002439628,0.000050096885,0.00025650085,0.000041814907],"domain_scores_gemma":[0.9995877,0.0001424302,0.0000386614,0.00009273317,0.00012511335,0.000013394513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005882308,0.0005338539,0.00047401356,0.00064826454,0.00038201522,0.0008101488,0.0008285314,0.00093548425,0.0016542643],"category_scores_gemma":[0.0015212985,0.00025674928,0.0003179638,0.001060566,0.00075710966,0.0009391417,0.000665795,0.0010224724,0.0011301942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028641924,0.000101173726,0.00048589567,0.00033755516,0.00008076626,0.0003862403,0.00027151927,0.10039375,0.084427975,0.54965997,0.004975172,0.25859353],"study_design_scores_gemma":[0.00008085962,0.0002690526,0.00042159637,0.00011541544,0.000052774212,0.00078120327,0.000040022118,0.73905706,0.040159594,0.18257646,0.036368266,0.00007770909],"about_ca_topic_score_codex":0.0015585152,"about_ca_topic_score_gemma":0.0023394255,"teacher_disagreement_score":0.0016542643,"about_ca_system_score_codex":0.0005004945,"about_ca_system_score_gemma":0.0008785747,"threshold_uncertainty_score":0.005534053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013237515,0.00038686738,0.98545086,0.000100589175,0.0000076252218,0.000009128556,0.000031615044,0.0002415894,0.00053419144],"genre_scores_gemma":[0.71029097,0.0014157655,0.2846604,0.00010067674,0.00014026521,0.000119346296,0.00033518166,0.00017190278,0.0027654876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00047111724,0.000027544831,0.00009154297,0.00016968188,0.000051111696],"domain_scores_gemma":[0.99701107,0.0022212104,0.00029255135,0.00014688635,0.00027703334,0.000051302537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018552922,0.0007622198,0.0010591011,0.00067921146,0.00023706163,0.0009826196,0.000719864,0.0007438879,0.0007495393],"category_scores_gemma":[0.010721069,0.00049144047,0.00037991226,0.0007116426,0.00092088204,0.0015440285,0.0009217212,0.0006872182,0.0005527304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016882886,0.000026082364,0.0014795215,0.0001736669,0.000049582555,0.00020750784,0.0001139535,0.8953447,0.0073836874,0.026486894,0.0011554216,0.06741015],"study_design_scores_gemma":[0.000010873955,0.000021318068,0.0002947694,0.000008714426,0.000005935252,0.000055938606,0.000007671342,0.98748684,0.0014889254,0.010377007,0.00022854954,0.000013459569],"about_ca_topic_score_codex":0.0005321859,"about_ca_topic_score_gemma":0.0005365336,"teacher_disagreement_score":0.0018552922,"about_ca_system_score_codex":0.0003621779,"about_ca_system_score_gemma":0.0005375389,"threshold_uncertainty_score":0.009811878},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019479844,0.0049822503,0.024355022,0.008238078,0.008348754,0.0002497537,0.00675427,0.003260733,0.9418631],"genre_scores_gemma":[0.00911877,0.005616923,0.002854245,0.001296441,0.0015035407,0.00017632596,0.0066172923,0.00049755914,0.9723188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994123,0.00008866476,0.000032618103,0.00010712969,0.00028740347,0.00007185847],"domain_scores_gemma":[0.99780077,0.00040135047,0.000121180754,0.0005639504,0.00092294184,0.00018981971],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00074842834,0.001543972,0.0012638483,0.0027555698,0.0011504731,0.0036370526,0.00083955796,0.002482025,0.36810747],"category_scores_gemma":[0.0036372084,0.0006013635,0.00036708545,0.0031635133,0.00061794196,0.0024662497,0.0016856776,0.002490509,0.3699826],"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.00005168268,0.000044816526,0.00015604154,0.0001452913,0.000011288766,0.00007167934,0.000022779199,0.0009457996,0.0011751951,0.010035555,0.7659959,0.22134405],"study_design_scores_gemma":[0.000014906331,0.000030876563,0.00041778322,0.00011990357,0.00001668572,0.00008626617,0.000023047625,0.0024715909,0.000849053,0.006255401,0.9896987,0.000015893938],"about_ca_topic_score_codex":0.003729893,"about_ca_topic_score_gemma":0.0033348491,"teacher_disagreement_score":0.63189256,"about_ca_system_score_codex":0.0011234991,"about_ca_system_score_gemma":0.002213832,"threshold_uncertainty_score":0.901318},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003758716,0.0022374305,0.003453128,0.012504882,0.026253963,0.0007776288,0.0154075995,0.005629247,0.93336034],"genre_scores_gemma":[0.00085000036,0.0011585862,0.00096657214,0.0028374502,0.0023814286,0.00034937498,0.0061996686,0.0011023503,0.98415446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822336,0.00025125503,0.000113637245,0.00021498236,0.00093672535,0.00026003938],"domain_scores_gemma":[0.9809341,0.002641765,0.00055587944,0.001632338,0.009596785,0.0046391482],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025389038,0.0011536947,0.0020135725,0.005543034,0.0029103872,0.006544456,0.0027114192,0.0029515028,0.9335262],"category_scores_gemma":[0.024190715,0.00065712485,0.00092764525,0.003273001,0.00065675855,0.002812118,0.0033063816,0.0025073779,0.9322542],"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.000018254448,0.000021867309,0.00004310923,0.000102074046,0.000001137111,0.000015215916,0.0000070058554,0.000024935413,0.00008392955,0.0006836253,0.9679148,0.031083984],"study_design_scores_gemma":[0.000015720498,0.000019829502,0.00014386832,0.00016208796,0.0000029153027,0.000040663446,0.000029774934,0.000088788765,0.00016392622,0.0011295958,0.99819535,0.000007533418],"about_ca_topic_score_codex":0.0020852338,"about_ca_topic_score_gemma":0.0040280353,"teacher_disagreement_score":0.06647378,"about_ca_system_score_codex":0.0014519057,"about_ca_system_score_gemma":0.005447208,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019110595,0.005004587,0.025241766,0.00820614,0.008262401,0.00025484,0.007108449,0.0033604142,0.94065034],"genre_scores_gemma":[0.009150957,0.0057130917,0.0029802376,0.0012972065,0.0014967367,0.00018109746,0.0069317487,0.0005103197,0.9717386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994091,0.000088687484,0.00003331339,0.00010741928,0.00028977188,0.00007169929],"domain_scores_gemma":[0.99777883,0.00040472165,0.00012354409,0.0005752732,0.0009280588,0.0001896131],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007571371,0.0015392217,0.0012732962,0.0027855437,0.0011386784,0.003663,0.00084534613,0.0024750717,0.3669444],"category_scores_gemma":[0.0037124804,0.0006073661,0.00036493922,0.0031857162,0.000615703,0.002511123,0.0016874871,0.0024906027,0.37026298],"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.000050241088,0.00004394049,0.00015158321,0.000145016,0.000011109504,0.00007002665,0.000022456416,0.00094062724,0.0011341576,0.010192229,0.7691849,0.21805377],"study_design_scores_gemma":[0.00001489144,0.000030043375,0.00040922535,0.00012149791,0.000016407146,0.00008544982,0.00002291671,0.0025293631,0.00084848056,0.0064459,0.9894599,0.000016033115],"about_ca_topic_score_codex":0.0037351858,"about_ca_topic_score_gemma":0.0033435824,"teacher_disagreement_score":0.63305557,"about_ca_system_score_codex":0.001126941,"about_ca_system_score_gemma":0.0022306002,"threshold_uncertainty_score":0.902977},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.5676011,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.23525538,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021005846,0.010510378,0.042408824,0.012571899,0.015199809,0.00026810303,0.004134137,0.0039163325,0.90888995],"genre_scores_gemma":[0.020643618,0.012569235,0.011727708,0.003747659,0.003238393,0.00029966168,0.008925719,0.00055999524,0.938288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986596,0.00016630844,0.00008554198,0.0003515774,0.0005866358,0.00015026006],"domain_scores_gemma":[0.9974486,0.00023020596,0.000094099574,0.00057090144,0.0014304061,0.0002257693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009541297,0.0011962029,0.0007604868,0.0015819413,0.0011000443,0.0041359137,0.0011116755,0.002458067,0.25378728],"category_scores_gemma":[0.0031955815,0.00036708335,0.0004784505,0.0018838394,0.00066567026,0.0022748737,0.002178896,0.0029093411,0.28134808],"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.00006283095,0.000044447974,0.0005072186,0.00017160251,0.000020017445,0.00015391066,0.00006766772,0.0005288415,0.001722184,0.01832898,0.6891825,0.28920975],"study_design_scores_gemma":[0.000007962797,0.000020760504,0.00026213806,0.000070914124,0.0000064366236,0.00016013929,0.00003126735,0.0006592168,0.00035924563,0.00404794,0.9943627,0.000011294946],"about_ca_topic_score_codex":0.0028305773,"about_ca_topic_score_gemma":0.0019685014,"teacher_disagreement_score":0.7462127,"about_ca_system_score_codex":0.0009841757,"about_ca_system_score_gemma":0.0022370662,"threshold_uncertainty_score":0.849003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52873325,0.0135858245,0.32143354,0.0033666387,0.00043236537,0.000049394017,0.0013153737,0.00061234,0.13047121],"genre_scores_gemma":[0.991193,0.002096337,0.0035876653,0.00009777428,0.00016533316,0.00003403328,0.00014925229,0.00005003747,0.0026265185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987728,0.00032158353,0.000020082072,0.00009352333,0.00030206205,0.0004898735],"domain_scores_gemma":[0.9947271,0.0036673178,0.00030826678,0.00039810594,0.00077060936,0.00012858502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007953444,0.00062820513,0.000694505,0.0009900508,0.0007980475,0.0015079668,0.00072522584,0.0006603949,0.0056837886],"category_scores_gemma":[0.006284682,0.00031240785,0.00030696948,0.0010685404,0.0016553474,0.0023225958,0.0013543268,0.00089398253,0.0007812313],"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.00029620653,0.00007754182,0.0017560471,0.0003682172,0.00010401853,0.00064657297,0.00023249118,0.6796482,0.020706145,0.24870172,0.0059509166,0.04151191],"study_design_scores_gemma":[0.000013697413,0.00006475431,0.001182329,0.00016896644,0.00004661815,0.00032680426,0.00020150251,0.9126,0.013474733,0.06640244,0.0054346304,0.00008355548],"about_ca_topic_score_codex":0.0028882048,"about_ca_topic_score_gemma":0.0013362615,"teacher_disagreement_score":0.0056837886,"about_ca_system_score_codex":0.0013229103,"about_ca_system_score_gemma":0.00086701347,"threshold_uncertainty_score":0.01901412},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002286167,0.0035501039,0.025612587,0.00373077,0.0070607904,0.00013511186,0.0012185811,0.0025574828,0.95384836],"genre_scores_gemma":[0.0056117396,0.0022496572,0.0019435311,0.0005185652,0.00053213735,0.000058089146,0.0011724185,0.00017974262,0.98773414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995208,0.000063312014,0.000021758113,0.000102143735,0.00022731471,0.000064630345],"domain_scores_gemma":[0.99836093,0.00015466395,0.000048214763,0.00035566106,0.0009268798,0.00015368499],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006177483,0.001336576,0.00061665877,0.0016328015,0.0011248495,0.002730041,0.0006499586,0.001974978,0.31583074],"category_scores_gemma":[0.001650183,0.00038306494,0.00034253142,0.0015250297,0.0005643473,0.001264549,0.0015910228,0.0019350705,0.4021558],"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.00007022582,0.00007430189,0.00038858535,0.00011333651,0.000013390005,0.000110886685,0.00005078903,0.00069846475,0.0033649614,0.007819059,0.5887509,0.39854506],"study_design_scores_gemma":[0.0000065482636,0.000026144462,0.0004919401,0.00006157173,0.0000096433405,0.00010742439,0.000034684446,0.0010622812,0.000947266,0.0017732567,0.99547005,0.000009299507],"about_ca_topic_score_codex":0.0035930665,"about_ca_topic_score_gemma":0.0049746404,"teacher_disagreement_score":0.6841693,"about_ca_system_score_codex":0.00076155004,"about_ca_system_score_gemma":0.0016109655,"threshold_uncertainty_score":0.97588444},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.5676011,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86640126,0.0038817,0.109439574,0.000732378,0.00007610796,0.00003195721,0.000428827,0.00042082724,0.018587386],"genre_scores_gemma":[0.99791473,0.0002867586,0.0012640774,0.000016497945,0.000021556114,0.000006618089,0.000050299892,0.000009159959,0.00043023494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991917,0.00028974228,0.000029508143,0.00006591517,0.0002561145,0.00016699162],"domain_scores_gemma":[0.9934756,0.005077751,0.00045972833,0.00025298976,0.00057744107,0.00015648086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019247623,0.0006399918,0.00080650154,0.00065160537,0.00053374626,0.0007674167,0.000491133,0.00088240625,0.001125066],"category_scores_gemma":[0.0075520035,0.0003605847,0.00030979427,0.0008470583,0.0011028685,0.00081962196,0.0008426098,0.000497073,0.00023609394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004590407,0.000030600186,0.005357218,0.00015753364,0.000054876695,0.00070603896,0.00017237882,0.96536547,0.0033599325,0.011143723,0.0009132602,0.012279888],"study_design_scores_gemma":[0.000013730164,0.000094446215,0.003560641,0.000023254182,0.000037255068,0.0003669683,0.00008769394,0.9892266,0.0014034738,0.004927603,0.00023967252,0.000018617135],"about_ca_topic_score_codex":0.0040737903,"about_ca_topic_score_gemma":0.003203898,"teacher_disagreement_score":0.0040737903,"about_ca_system_score_codex":0.0015328258,"about_ca_system_score_gemma":0.0006068537,"threshold_uncertainty_score":0.011121452},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.43239892,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011561168,0.0064669927,0.006796973,0.03437451,0.13542195,0.00043473433,0.0042787977,0.003221196,0.8078487],"genre_scores_gemma":[0.0057672593,0.0063991644,0.0016281774,0.010897694,0.02293309,0.000185636,0.005182965,0.0007371359,0.946269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979341,0.00018767879,0.00012517958,0.00023291603,0.0012853973,0.0002347379],"domain_scores_gemma":[0.99468577,0.0006868568,0.0002176741,0.0005325999,0.0029592963,0.0009177978],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015055852,0.0012871576,0.0011009449,0.0019195115,0.0017302288,0.0068698856,0.0014137082,0.0043104556,0.5690595],"category_scores_gemma":[0.008804682,0.00058327266,0.00056537456,0.0015336331,0.00054903707,0.0025151502,0.0014019335,0.0047841887,0.51668966],"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.00004153338,0.000038915332,0.00007825008,0.00010193147,0.0000056217364,0.00007645674,0.000008634801,0.000070108814,0.0003347755,0.0014696118,0.9533818,0.04439223],"study_design_scores_gemma":[0.00001882531,0.000029924984,0.00018123118,0.00008369338,0.0000044934222,0.00009599476,0.000014760296,0.00024445791,0.00032638758,0.001084069,0.99790597,0.000010272137],"about_ca_topic_score_codex":0.0008559349,"about_ca_topic_score_gemma":0.001793063,"teacher_disagreement_score":0.4309405,"about_ca_system_score_codex":0.0015446175,"about_ca_system_score_gemma":0.0025800464,"threshold_uncertainty_score":0.61468434},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004312769,0.01618218,0.0028924742,0.047314517,0.7513377,0.0006070714,0.0009989672,0.0010711176,0.1791646],"genre_scores_gemma":[0.0024261537,0.018796975,0.0014818496,0.01548682,0.33434507,0.000400211,0.0017071851,0.000617571,0.6247382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772686,0.00022766014,0.00017441149,0.00034028527,0.0011594705,0.0003712626],"domain_scores_gemma":[0.9881279,0.0014989419,0.00064417184,0.0005575885,0.006018907,0.003152447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036809512,0.0022322447,0.002262697,0.0028342947,0.0027771138,0.009293797,0.0028667701,0.011297386,0.2851488],"category_scores_gemma":[0.008129164,0.00081971136,0.0018733641,0.0026302338,0.0007438567,0.006327219,0.0024478994,0.0053350916,0.25895175],"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.000019804127,0.000026223574,0.000053825806,0.000098247154,0.000004395328,0.000043473807,0.000004823844,0.000026571886,0.0001238971,0.00081652857,0.9705062,0.028276015],"study_design_scores_gemma":[0.000013149398,0.000042282743,0.00024027243,0.0001203848,0.000009317386,0.00007951253,0.000021477526,0.00017339081,0.00008462426,0.00077966397,0.9984232,0.000012696793],"about_ca_topic_score_codex":0.001209312,"about_ca_topic_score_gemma":0.0026613544,"teacher_disagreement_score":0.2851488,"about_ca_system_score_codex":0.0017928274,"about_ca_system_score_gemma":0.0027238282,"threshold_uncertainty_score":0.95391774},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019193398,0.0007427421,0.96041805,0.0014732012,0.0001110542,0.00011925927,0.00028950765,0.00019543145,0.017457414],"genre_scores_gemma":[0.73889804,0.002442655,0.21559641,0.00065180124,0.00034365794,0.0008289612,0.0008948116,0.00032415998,0.040019505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987452,0.0004567983,0.000051662926,0.00025090686,0.00028155008,0.00021379773],"domain_scores_gemma":[0.9980677,0.001370953,0.00014638553,0.0000857529,0.0001903081,0.00013887037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035277,0.0014725366,0.0012744763,0.00074658584,0.00079457933,0.0018020192,0.0021370242,0.002097015,0.007600638],"category_scores_gemma":[0.004124979,0.0007271306,0.0011437786,0.0010910092,0.0016145839,0.0034186437,0.0022062024,0.0036293194,0.0007069532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051216848,0.000044610657,0.0001924909,0.000096714655,0.000015230165,0.00016862816,0.00011061003,0.8675783,0.0008176129,0.11887312,0.003141778,0.008909704],"study_design_scores_gemma":[0.000012184388,0.000018413464,0.0000386961,0.000010788327,0.000004957202,0.000022346961,0.000023526327,0.9642963,0.00010592105,0.03411711,0.0013436653,0.000006165397],"about_ca_topic_score_codex":0.007894695,"about_ca_topic_score_gemma":0.007123213,"teacher_disagreement_score":0.007894695,"about_ca_system_score_codex":0.002491374,"about_ca_system_score_gemma":0.0016023978,"threshold_uncertainty_score":0.025426686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7392932,0.0038507697,0.22903557,0.0016122941,0.00011168455,0.00005615819,0.0013675932,0.0009297035,0.02374301],"genre_scores_gemma":[0.9968636,0.0003416969,0.002027743,0.000054492695,0.00004020305,0.000014242939,0.00013591466,0.000021332973,0.0005008927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968761,0.0012223341,0.00018914764,0.0003028558,0.0008544343,0.0005549913],"domain_scores_gemma":[0.96423495,0.02970888,0.0025695977,0.0013782295,0.0015806438,0.00052772963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049763657,0.0008585025,0.0018469513,0.0008128235,0.00062593847,0.001347368,0.000916532,0.0016124847,0.00225097],"category_scores_gemma":[0.022722464,0.00060829794,0.0005160676,0.0009878357,0.0023488319,0.0016869843,0.0014939258,0.0007975712,0.00044131183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026149824,0.000100689955,0.020381752,0.0004990346,0.00029770352,0.0033856009,0.0006309513,0.887838,0.009783266,0.048172988,0.0033039502,0.022991112],"study_design_scores_gemma":[0.00011866167,0.0002902943,0.011477624,0.00009695991,0.00020951431,0.0028127907,0.00025941138,0.95651174,0.0065510143,0.020769315,0.00078986824,0.00011280805],"about_ca_topic_score_codex":0.0022122513,"about_ca_topic_score_gemma":0.0011811845,"teacher_disagreement_score":0.0049763657,"about_ca_system_score_codex":0.0014359253,"about_ca_system_score_gemma":0.00085944956,"threshold_uncertainty_score":0.026317835},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020104977,0.010821021,0.041624617,0.013194153,0.01462708,0.00027946022,0.00392014,0.0037199869,0.90980303],"genre_scores_gemma":[0.022670938,0.013789282,0.0129660005,0.0040005203,0.0036260018,0.0003366945,0.009310753,0.0005570712,0.9327428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985965,0.00017656227,0.00009224432,0.0003588541,0.0006182048,0.00015770034],"domain_scores_gemma":[0.99728954,0.00022857763,0.00009680266,0.0005718822,0.0015780132,0.00023522878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010017582,0.0011882014,0.0007443598,0.0016667641,0.0011414862,0.0040950314,0.0011357378,0.0024854324,0.23525538],"category_scores_gemma":[0.0033210577,0.00035913734,0.00048087857,0.0018992625,0.00068275013,0.0022466884,0.0021897221,0.0029109407,0.26229218],"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.00006176823,0.00004197751,0.0004968083,0.00017065169,0.000019669435,0.00015285498,0.00006656013,0.0005276869,0.0016109996,0.01976889,0.693919,0.28316307],"study_design_scores_gemma":[0.000007615482,0.000020097523,0.00024391135,0.00006926722,0.000006229284,0.00016329724,0.000030011894,0.0006300594,0.00033691604,0.004148401,0.994333,0.000011231771],"about_ca_topic_score_codex":0.002880777,"about_ca_topic_score_gemma":0.0019134851,"teacher_disagreement_score":0.76474464,"about_ca_system_score_codex":0.0010603822,"about_ca_system_score_gemma":0.0024062777,"threshold_uncertainty_score":0.78700763},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18154871,0.0006952388,0.8114431,0.00023866653,0.000051229217,0.00007513772,0.00009936717,0.0002674593,0.0055811317],"genre_scores_gemma":[0.9775663,0.0004648503,0.02066794,0.000036719328,0.000019140225,0.00004038541,0.00006931069,0.000024654073,0.0011106565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896,0.00046786183,0.00003587414,0.0000970938,0.0003266641,0.000112534464],"domain_scores_gemma":[0.9937815,0.0044052247,0.0006068034,0.00035086143,0.0007894255,0.000066206165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025216904,0.0008600898,0.0005933478,0.0008108017,0.00022062825,0.0010301198,0.00061639765,0.0010788405,0.000839724],"category_scores_gemma":[0.009623308,0.00026432757,0.00047024625,0.0010557375,0.0009779144,0.00075063435,0.0005297031,0.00077206903,0.0002765231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019882053,0.00004763222,0.0021355783,0.00010625404,0.00004471306,0.00037351163,0.00012392383,0.9503512,0.0059956065,0.027752515,0.0002447982,0.012625516],"study_design_scores_gemma":[0.0000031507354,0.000048500962,0.00051202415,0.000007426537,0.000006173555,0.00006761155,0.000019953275,0.99607074,0.0016093634,0.0015231124,0.00012175153,0.000010105176],"about_ca_topic_score_codex":0.0011190951,"about_ca_topic_score_gemma":0.00054884295,"teacher_disagreement_score":0.0025216904,"about_ca_system_score_codex":0.0007743436,"about_ca_system_score_gemma":0.0005649216,"threshold_uncertainty_score":0.013336122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08536261,0.00030242163,0.9124844,0.00015392204,0.000020274747,0.0000326999,0.000025767566,0.00007665019,0.0015411203],"genre_scores_gemma":[0.8932621,0.000253951,0.10514735,0.000028077273,0.00001760659,0.00006340165,0.000036215544,0.000013090621,0.00117827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997638,0.00009639587,0.000011040963,0.000041995125,0.000049630184,0.00003715711],"domain_scores_gemma":[0.999724,0.00015207782,0.00004966902,0.00002091769,0.000034395147,0.000018903147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032886694,0.00041634226,0.0004802787,0.00021286664,0.000319378,0.0004310421,0.00037116263,0.00038994907,0.00045218458],"category_scores_gemma":[0.0010059322,0.00019674555,0.00019521646,0.00032133298,0.00037111613,0.00056726567,0.00042482343,0.00031901253,0.00010257864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047447425,0.000021344482,0.00059993676,0.000034339562,0.000013132108,0.00010767676,0.000054136508,0.94923615,0.0062173745,0.0052377065,0.00031374762,0.038117003],"study_design_scores_gemma":[0.000004493551,0.000025657882,0.00010024834,0.0000018446053,0.00000325046,0.0000257154,0.0000134358925,0.99760914,0.00086419884,0.0011489337,0.00020102577,0.0000020776633],"about_ca_topic_score_codex":0.0025717425,"about_ca_topic_score_gemma":0.0020985284,"teacher_disagreement_score":0.0025717425,"about_ca_system_score_codex":0.0003853293,"about_ca_system_score_gemma":0.00063109456,"threshold_uncertainty_score":0.0051136017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3563234,0.0010742329,0.6363664,0.0004890447,0.00006618734,0.000079013145,0.000072892915,0.00013295178,0.0053958828],"genre_scores_gemma":[0.98625284,0.00021939582,0.012421817,0.000036285288,0.000025089803,0.000028629634,0.00001493755,0.0000072654566,0.0009937987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899,0.00044967514,0.000020432331,0.00012145762,0.00020927476,0.00020919535],"domain_scores_gemma":[0.9971234,0.002035386,0.00030907046,0.00009615907,0.00034616425,0.00008984792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560174,0.0012515223,0.0011465822,0.00041241423,0.0006195947,0.00097470573,0.0007694748,0.0009566038,0.0008896823],"category_scores_gemma":[0.0029971304,0.00042846138,0.0006107722,0.0006543847,0.0013313784,0.00087773585,0.00078356045,0.00071789266,0.00016887386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030985376,0.0000687106,0.0011325923,0.00012099623,0.00008336404,0.00036198238,0.00017100852,0.96809745,0.008830823,0.012806348,0.00033979357,0.007677022],"study_design_scores_gemma":[0.000010452632,0.00006340637,0.00009591404,0.0000024287006,0.000014291455,0.000035471072,0.000027809323,0.9981981,0.000578578,0.00090718997,0.000060091,0.0000062373324],"about_ca_topic_score_codex":0.0052642873,"about_ca_topic_score_gemma":0.0043686787,"teacher_disagreement_score":0.0052642873,"about_ca_system_score_codex":0.0013090395,"about_ca_system_score_gemma":0.0010312574,"threshold_uncertainty_score":0.010467291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007136113,0.00013777798,0.991638,0.000040993476,0.000010110413,0.000010722687,0.000021212403,0.00017905573,0.0008260146],"genre_scores_gemma":[0.34303612,0.00067852146,0.65113074,0.00010621759,0.000047781148,0.00011792656,0.00020579157,0.00021315063,0.004463802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955004,0.00018619065,0.000016015127,0.000045215555,0.00015147777,0.00005116031],"domain_scores_gemma":[0.99925405,0.00045500748,0.00007223472,0.0000904374,0.000112261514,0.00001614054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009824014,0.0006837659,0.00046467368,0.00047926753,0.0001700724,0.000708632,0.00079204876,0.0005789751,0.0020377948],"category_scores_gemma":[0.0039159153,0.00026078225,0.00051675475,0.00044671056,0.00063624425,0.0009065851,0.0005365192,0.0008004351,0.0008766247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015370725,0.000027378044,0.0006233104,0.00014673326,0.00003747764,0.00013779137,0.00020665552,0.7534434,0.017030273,0.14206396,0.0010684768,0.085060775],"study_design_scores_gemma":[0.0000025164884,0.000011685322,0.00005408579,0.0000072168395,0.0000030827516,0.000029186336,0.0000047979934,0.9905377,0.0019481864,0.00690136,0.00049463246,0.000005534018],"about_ca_topic_score_codex":0.0020992474,"about_ca_topic_score_gemma":0.0025178457,"teacher_disagreement_score":0.0020992474,"about_ca_system_score_codex":0.0007472065,"about_ca_system_score_gemma":0.000727835,"threshold_uncertainty_score":0.0068171024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037952673,0.0005320018,0.9589033,0.00015290763,0.00011013471,0.000043997516,0.000063417465,0.0005095922,0.0017318478],"genre_scores_gemma":[0.77203315,0.00066301366,0.21967836,0.00038736698,0.00012939678,0.00009807425,0.00048311602,0.00008189894,0.006445529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969137,0.000045037785,0.000016885786,0.000111245405,0.00008920851,0.000046146033],"domain_scores_gemma":[0.99967945,0.00009204577,0.000043270033,0.000054086362,0.00010120865,0.00002999295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044580852,0.0006898232,0.00093726773,0.0005124061,0.00029748358,0.00056078745,0.0012132562,0.0007869742,0.001148727],"category_scores_gemma":[0.0012932466,0.00025188804,0.00056395214,0.00043633312,0.0005158318,0.0015483798,0.00081261556,0.00097614614,0.00037829098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031990334,0.00022072498,0.0020413578,0.00015751367,0.00011517332,0.00018131355,0.00012948408,0.24366221,0.0326037,0.0076653333,0.0034465694,0.70945686],"study_design_scores_gemma":[0.000004435617,0.000046303798,0.00028360213,0.000004470069,0.000012036703,0.0000708445,0.000013107915,0.9929668,0.004698433,0.0014596666,0.00043130052,0.000008995305],"about_ca_topic_score_codex":0.00305875,"about_ca_topic_score_gemma":0.0037476204,"teacher_disagreement_score":0.00305875,"about_ca_system_score_codex":0.0003839455,"about_ca_system_score_gemma":0.00047318696,"threshold_uncertainty_score":0.0060819387},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2538637,0.015184414,0.60930336,0.004956303,0.00048474388,0.00008786727,0.001975121,0.00026462434,0.11387988],"genre_scores_gemma":[0.9769051,0.0064934776,0.010434655,0.00037246253,0.0004931194,0.000118212716,0.00036795824,0.000045376302,0.0047696508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899286,0.00029044008,0.0000344638,0.00013978899,0.00023947156,0.0003030312],"domain_scores_gemma":[0.99384403,0.0048033055,0.00032735305,0.0003621687,0.00052075775,0.00014252131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400268,0.0010350775,0.0010243494,0.0014210768,0.000562348,0.0022271315,0.0012938079,0.0010785362,0.0050997604],"category_scores_gemma":[0.010403262,0.00042800503,0.000529203,0.0017048424,0.0032455516,0.003102154,0.0022285762,0.0017790401,0.00066509127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016987041,0.000031806583,0.00045478804,0.00023948122,0.000041628853,0.0002298417,0.00023707499,0.19098899,0.003947367,0.7876277,0.003352508,0.012678939],"study_design_scores_gemma":[0.000029269479,0.000046894605,0.000585494,0.0001907357,0.00002472702,0.0001803838,0.00008125094,0.4765379,0.0021478292,0.517526,0.0025825386,0.000067038],"about_ca_topic_score_codex":0.0030920277,"about_ca_topic_score_gemma":0.0011047439,"teacher_disagreement_score":0.0050997604,"about_ca_system_score_codex":0.001673514,"about_ca_system_score_gemma":0.0010255787,"threshold_uncertainty_score":0.017060459},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17132832,0.0017801583,0.8163894,0.0001802076,0.00008906471,0.000042208554,0.00008091897,0.00027580714,0.0098340195],"genre_scores_gemma":[0.9709112,0.00027579794,0.027184844,0.00004521507,0.000029205963,0.000021351569,0.000031636147,0.0000073230603,0.001493467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996885,0.00012159809,0.000010556772,0.000040872827,0.00010043641,0.000037938138],"domain_scores_gemma":[0.9995888,0.00024626733,0.000049931765,0.000045162535,0.000058372912,0.000011459656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038745528,0.00026548633,0.00028859873,0.0002459989,0.0002985021,0.00036790507,0.0004699928,0.00031701726,0.0008117561],"category_scores_gemma":[0.0007192481,0.000117749536,0.00020670118,0.00044171355,0.00034615738,0.0005290073,0.00048544197,0.00022748216,0.00013496858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024081525,0.000063705105,0.0024007908,0.0002547461,0.00012837442,0.0007822733,0.0002085864,0.7451933,0.04797803,0.08852955,0.0016368645,0.11258305],"study_design_scores_gemma":[0.000010243664,0.00008618519,0.00028365146,0.0000072420157,0.0000169566,0.00015555318,0.000022500424,0.9889064,0.0035048989,0.005621822,0.001373735,0.000010818083],"about_ca_topic_score_codex":0.0008853965,"about_ca_topic_score_gemma":0.0015737526,"teacher_disagreement_score":0.0008853965,"about_ca_system_score_codex":0.00028707925,"about_ca_system_score_gemma":0.00017941331,"threshold_uncertainty_score":0.0027155876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90706146,0.0004901923,0.08464352,0.0002928873,0.00007947798,0.000018346302,0.00009855752,0.00032662472,0.006989005],"genre_scores_gemma":[0.9978144,0.00016903155,0.0013387038,0.000021769558,0.000011897693,0.0000044149947,0.000023688142,0.0000104408355,0.00060555106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996031,0.000089460205,0.000015040208,0.00004908826,0.0001250567,0.00011839431],"domain_scores_gemma":[0.9988348,0.0006191433,0.00025584703,0.000059625734,0.00018568305,0.00004489495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034684432,0.00066591526,0.0004940096,0.0003028521,0.0004196315,0.0007054157,0.0002978329,0.0006058782,0.0012742693],"category_scores_gemma":[0.0014617166,0.00019321704,0.00026562813,0.00038638705,0.00057274115,0.0005353918,0.00047517076,0.00043378922,0.00027534552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009856876,0.00013277627,0.020427646,0.0002750359,0.00018771423,0.004221847,0.00042936142,0.84029114,0.09003133,0.0076413914,0.0015997542,0.033776347],"study_design_scores_gemma":[0.00001027395,0.0001659226,0.0044321683,0.000018974697,0.0000783148,0.0005694098,0.00014244152,0.9764382,0.016925365,0.0007721576,0.00041859745,0.000028119188],"about_ca_topic_score_codex":0.0020293612,"about_ca_topic_score_gemma":0.0026966892,"teacher_disagreement_score":0.0020293612,"about_ca_system_score_codex":0.0003604878,"about_ca_system_score_gemma":0.0004288087,"threshold_uncertainty_score":0.004262805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54781824,0.010706518,0.40521285,0.0011656994,0.00026598456,0.00011729786,0.00058252655,0.00058759365,0.03354327],"genre_scores_gemma":[0.9887567,0.00195051,0.0071747866,0.00006347188,0.000060693255,0.000031449283,0.00011315713,0.000032373468,0.0018167848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984546,0.00058277743,0.000051873776,0.00015606804,0.00042686955,0.0003278133],"domain_scores_gemma":[0.98917574,0.008249374,0.0009722665,0.00030660199,0.0011745882,0.00012147473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019552985,0.0016085268,0.00088682165,0.0011777573,0.0007664768,0.0011287142,0.0009177676,0.0010026008,0.0014899472],"category_scores_gemma":[0.008980254,0.0003190186,0.0005216562,0.0011908665,0.0019437863,0.0011865733,0.0015527183,0.0009549637,0.0003454162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015143139,0.000028799523,0.0010890154,0.00010520883,0.00003422426,0.0002417166,0.0001334061,0.97742385,0.0023059335,0.012988375,0.00044445595,0.005053676],"study_design_scores_gemma":[0.0000067048372,0.00007843037,0.0003892263,0.000027152468,0.00001749259,0.000099541394,0.000070180264,0.99605227,0.00089887984,0.0021641168,0.00017531947,0.00002061919],"about_ca_topic_score_codex":0.010952369,"about_ca_topic_score_gemma":0.005454236,"teacher_disagreement_score":0.010952369,"about_ca_system_score_codex":0.001857287,"about_ca_system_score_gemma":0.0009299674,"threshold_uncertainty_score":0.021777272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07592135,0.0014811663,0.91692775,0.00031943235,0.00007836318,0.000034906087,0.000043092412,0.0002843844,0.0049095894],"genre_scores_gemma":[0.91881555,0.0006386498,0.07723957,0.00015119925,0.00006139437,0.00003277262,0.000035639674,0.000028494589,0.0029965115],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997725,0.000035994035,0.000010846336,0.00004300377,0.00009899015,0.00003867622],"domain_scores_gemma":[0.999572,0.00016579719,0.00007990719,0.000065803426,0.000080546895,0.00003585287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030985658,0.0004632006,0.00045255327,0.00024249767,0.00035143126,0.00061581546,0.00074325333,0.0005181632,0.0010634521],"category_scores_gemma":[0.00092501024,0.00014597026,0.00020586858,0.00023302207,0.000493382,0.0010218137,0.000785633,0.0007797475,0.00024345882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057390623,0.00012226829,0.0015060182,0.0005541465,0.00007356804,0.00039432416,0.00040342245,0.285086,0.42258465,0.11056815,0.0013894979,0.17674407],"study_design_scores_gemma":[0.000023606992,0.00029255505,0.0003120282,0.000031233587,0.000028219509,0.00029676847,0.00004413464,0.92410946,0.060285434,0.010918934,0.003618274,0.00003937158],"about_ca_topic_score_codex":0.0005106613,"about_ca_topic_score_gemma":0.00067325856,"teacher_disagreement_score":0.0010634521,"about_ca_system_score_codex":0.0005682887,"about_ca_system_score_gemma":0.00048005488,"threshold_uncertainty_score":0.004123211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033233542,0.00038194048,0.9634644,0.00015936125,0.000031843352,0.000015063298,0.000029825444,0.0004704552,0.0022135407],"genre_scores_gemma":[0.8746593,0.0003981908,0.119772956,0.00015533279,0.000032040643,0.00003941822,0.00007650143,0.000050802988,0.004815466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989116,0.000028305558,0.0000041123335,0.00002124372,0.00003362577,0.000021450987],"domain_scores_gemma":[0.9998914,0.000046320976,0.000011711431,0.000015196213,0.000029006618,0.000006396164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026882094,0.00049545965,0.00030867162,0.00015994532,0.00024280745,0.00032887008,0.0006343286,0.00039358385,0.0011159792],"category_scores_gemma":[0.00051330193,0.0001666644,0.00020320441,0.00018387432,0.0003107829,0.00074000336,0.0004923806,0.00074728345,0.00020730394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011428046,0.00007565964,0.00057659886,0.000064474625,0.000039764494,0.00010275481,0.00008066441,0.72596776,0.026235536,0.012493073,0.0015085927,0.23274092],"study_design_scores_gemma":[0.0000019866923,0.000028281234,0.000060536346,0.000002192756,0.0000048434085,0.000015911182,0.000003403353,0.9950023,0.0029650822,0.0013877599,0.0005252123,0.0000025539186],"about_ca_topic_score_codex":0.0016869089,"about_ca_topic_score_gemma":0.0031701636,"teacher_disagreement_score":0.0016869089,"about_ca_system_score_codex":0.0004411863,"about_ca_system_score_gemma":0.00036796296,"threshold_uncertainty_score":0.003733337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01091465,0.00021853668,0.9839594,0.00012269111,0.00006679487,0.000057063473,0.000042789834,0.0006898102,0.003928294],"genre_scores_gemma":[0.45736247,0.00037702266,0.53079486,0.0003008108,0.00019223368,0.00017852926,0.00012146733,0.000048135713,0.010624341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988281,0.00045296695,0.00004698059,0.00017947244,0.00040649684,0.00008594749],"domain_scores_gemma":[0.999368,0.00020178988,0.00007939825,0.00015089169,0.00017268877,0.000027255095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007313315,0.00066217687,0.0006836154,0.00034715893,0.0003552528,0.00080335524,0.001138533,0.00090082514,0.0023560477],"category_scores_gemma":[0.0014599208,0.00028218844,0.00045872244,0.0005780678,0.00043066588,0.0007739957,0.00087243743,0.00090876414,0.0019741377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089659845,0.00037431822,0.0024306849,0.0004917164,0.00030546187,0.0008317882,0.00048636275,0.27870858,0.26910925,0.10106218,0.006265513,0.33903754],"study_design_scores_gemma":[0.000049343,0.00040643525,0.00026071697,0.000024711708,0.000046053872,0.0007290928,0.000020511436,0.9504024,0.03714566,0.0035642495,0.007306642,0.0000442118],"about_ca_topic_score_codex":0.0005342644,"about_ca_topic_score_gemma":0.00093623553,"teacher_disagreement_score":0.0023560477,"about_ca_system_score_codex":0.0003783586,"about_ca_system_score_gemma":0.00064626924,"threshold_uncertainty_score":0.007881761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054581616,0.00027578397,0.9432685,0.0002217426,0.00003843722,0.000024028248,0.00004099143,0.00048677527,0.0010621327],"genre_scores_gemma":[0.9257371,0.00016378771,0.07227783,0.000119697506,0.00006090668,0.00004507333,0.000102902384,0.000045478995,0.0014473789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999663,0.00010774876,0.00001863308,0.00006145144,0.00010761824,0.000041637188],"domain_scores_gemma":[0.99858594,0.00085830496,0.00014658424,0.00014632264,0.00022583583,0.000037150094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087344466,0.0005169464,0.00066178513,0.000272724,0.00028560098,0.00039788315,0.0006837591,0.00054383837,0.0006164535],"category_scores_gemma":[0.003146054,0.00030755973,0.0002565501,0.00036680332,0.00054938154,0.00092495646,0.0007102766,0.0010691121,0.00015220244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010050413,0.00008188269,0.0005410936,0.000047875757,0.000029080571,0.00004589971,0.00005340341,0.8768845,0.003182702,0.0029603727,0.0009274685,0.11514526],"study_design_scores_gemma":[0.0000012642103,0.0000055615496,0.00004227719,7.8276673e-7,8.521132e-7,0.000002750432,0.0000011748131,0.99908626,0.00034107763,0.00048069455,0.000036045454,0.0000012312864],"about_ca_topic_score_codex":0.0020487888,"about_ca_topic_score_gemma":0.0022461175,"teacher_disagreement_score":0.0020487888,"about_ca_system_score_codex":0.0004345994,"about_ca_system_score_gemma":0.00065936067,"threshold_uncertainty_score":0.0046193004},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002113228,0.010592196,0.04277969,0.012644724,0.015226085,0.00027016393,0.0041642,0.0039345887,0.9082752],"genre_scores_gemma":[0.020781672,0.012651462,0.011801123,0.0037619716,0.003252466,0.00030140736,0.008992054,0.0005617276,0.9378961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986594,0.0001662399,0.000085699714,0.00035218167,0.0005863667,0.00015015832],"domain_scores_gemma":[0.99743855,0.00023082708,0.00009449538,0.0005727558,0.0014372341,0.00022609065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095469254,0.0011995392,0.0007620681,0.0015858322,0.0011017623,0.0041403216,0.0011111283,0.002458621,0.25273666],"category_scores_gemma":[0.003194555,0.00036840816,0.00047894786,0.0018870141,0.0006648242,0.0022724224,0.0021797265,0.002918954,0.27986908],"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.00006300158,0.000044568635,0.0005107352,0.00017186387,0.000020155594,0.0001545394,0.000067665445,0.00053255213,0.001726683,0.018286185,0.68875855,0.28966346],"study_design_scores_gemma":[0.000008054394,0.000020930456,0.00026520484,0.0000714558,0.000006513832,0.00016109772,0.000031401312,0.00066620234,0.00036159842,0.004072346,0.99432385,0.000011406386],"about_ca_topic_score_codex":0.0028430573,"about_ca_topic_score_gemma":0.0019765922,"teacher_disagreement_score":0.7472633,"about_ca_system_score_codex":0.000984829,"about_ca_system_score_gemma":0.0022433707,"threshold_uncertainty_score":0.84548837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030367443,0.00016418027,0.9670292,0.00013979585,0.000034425608,0.000014359463,0.000056608926,0.0007030521,0.0014909588],"genre_scores_gemma":[0.77564913,0.00023394756,0.21882309,0.00023169015,0.00003419715,0.000043361375,0.00017911244,0.00015729775,0.004648166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976414,0.000046813057,0.0000122567435,0.000045069763,0.00009582003,0.000035885012],"domain_scores_gemma":[0.9995104,0.00019933273,0.000058747526,0.00011338244,0.000095928,0.00002225424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044825661,0.0006373856,0.00031315754,0.00021102447,0.00019293059,0.00048882276,0.0006699009,0.0004393566,0.0016888726],"category_scores_gemma":[0.0016883742,0.0002397056,0.00023388548,0.00022571336,0.0004999831,0.0009876296,0.0009213963,0.0011135123,0.00037163388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027377775,0.00007733982,0.00092375587,0.00013351582,0.00004972368,0.00021846125,0.00013408184,0.6816682,0.06849721,0.013554092,0.0019705703,0.2324992],"study_design_scores_gemma":[0.0000070131937,0.000027682436,0.000111564266,0.0000095082005,0.0000068254435,0.000051607385,0.000012906067,0.97241306,0.022690427,0.003801286,0.0008596032,0.000008427767],"about_ca_topic_score_codex":0.0017138949,"about_ca_topic_score_gemma":0.004063573,"teacher_disagreement_score":0.0017138949,"about_ca_system_score_codex":0.00042328672,"about_ca_system_score_gemma":0.00068465987,"threshold_uncertainty_score":0.005649805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010720407,0.0018063991,0.982983,0.0006917474,0.00008603058,0.00003338051,0.00023333899,0.0003164009,0.0031293128],"genre_scores_gemma":[0.69081855,0.005884589,0.2929686,0.0006475812,0.000506201,0.00057820225,0.0018967693,0.00041267433,0.006286945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969614,0.0010935968,0.00019214072,0.00039884305,0.0009884309,0.00036549458],"domain_scores_gemma":[0.96275604,0.030270737,0.0016879981,0.0016193951,0.003134877,0.0005308769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008138369,0.0020204354,0.0018066226,0.0017442312,0.00088948064,0.0029174543,0.0020852974,0.0026272885,0.003011072],"category_scores_gemma":[0.048447043,0.00083260454,0.0012663394,0.0015531271,0.0029909967,0.0037911693,0.005261089,0.0026850381,0.001404924],"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.00037941063,0.000027558113,0.002454316,0.00042107532,0.00009798436,0.00019693516,0.00034600182,0.9092476,0.0027754304,0.04714593,0.0017842575,0.035123486],"study_design_scores_gemma":[0.000007770365,0.000033488155,0.0008245498,0.00009084786,0.000018941082,0.000083940446,0.000070378286,0.98082733,0.002147807,0.014976224,0.0008749052,0.000043846983],"about_ca_topic_score_codex":0.004789695,"about_ca_topic_score_gemma":0.002981988,"teacher_disagreement_score":0.008138369,"about_ca_system_score_codex":0.002134562,"about_ca_system_score_gemma":0.0021684451,"threshold_uncertainty_score":0.043040335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111760676,0.0003768336,0.8823078,0.0003002386,0.00005275775,0.000036826033,0.000035111105,0.00026142562,0.0048682904],"genre_scores_gemma":[0.84369,0.00025123224,0.1533708,0.000109525616,0.000035540437,0.000042917076,0.000036464957,0.000022075452,0.002441513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993166,0.00030526778,0.000020744908,0.000074089,0.00017826348,0.000105155596],"domain_scores_gemma":[0.9997094,0.0001116874,0.000051148945,0.00004026026,0.00006112009,0.000026328671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171098,0.00060512417,0.0006131682,0.00018532327,0.0002608193,0.0006027093,0.00045400596,0.00040510215,0.00075992936],"category_scores_gemma":[0.00072064984,0.000271324,0.00031847373,0.0003565144,0.00044976154,0.00054299075,0.00082091405,0.0005867237,0.00032104392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005337338,0.000192965,0.0024831619,0.0002132643,0.0000875918,0.0005843428,0.00020006107,0.6544876,0.15471658,0.042082716,0.0020885367,0.1423293],"study_design_scores_gemma":[0.000019001518,0.00012715362,0.00014801511,0.0000052249243,0.0000120578325,0.00010694468,0.000017497576,0.9881208,0.008742066,0.0020883281,0.0006041271,0.000008797972],"about_ca_topic_score_codex":0.00076835806,"about_ca_topic_score_gemma":0.0016407861,"teacher_disagreement_score":0.00076835806,"about_ca_system_score_codex":0.00033887103,"about_ca_system_score_gemma":0.00068158476,"threshold_uncertainty_score":0.0032636523},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658388,0.00652283,0.006860914,0.03482069,0.13716494,0.00044038997,0.004336833,0.003256947,0.80543065],"genre_scores_gemma":[0.005829581,0.0064646797,0.001644239,0.011006936,0.023362638,0.00018754738,0.0052538533,0.0007498065,0.94550073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979151,0.00018930524,0.00012644925,0.00023486959,0.0012972457,0.00023705687],"domain_scores_gemma":[0.994615,0.00069318025,0.00022107168,0.00054042577,0.0030033395,0.0009269473],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015144518,0.0012940771,0.0011115575,0.0019374957,0.0017408859,0.006913846,0.0014176901,0.0043260497,0.5677959],"category_scores_gemma":[0.008842999,0.00058854115,0.00056718296,0.0015466352,0.00055034325,0.0025351597,0.0014095838,0.0048222467,0.5158698],"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.00004186071,0.00003912728,0.00007834854,0.00010240682,0.000005664156,0.00007664417,0.000008644816,0.00007032138,0.00033483125,0.0014553432,0.95360047,0.044186335],"study_design_scores_gemma":[0.000019089206,0.000030130364,0.00018286104,0.00008457446,0.000004561151,0.00009637792,0.000014884124,0.00024716053,0.00032990286,0.0010893318,0.9978908,0.000010378562],"about_ca_topic_score_codex":0.000855431,"about_ca_topic_score_gemma":0.0017946254,"teacher_disagreement_score":0.5677959,"about_ca_system_score_codex":0.0015482184,"about_ca_system_score_gemma":0.002583583,"threshold_uncertainty_score":0.6164867},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658388,0.00652283,0.006860914,0.03482069,0.13716494,0.00044038997,0.004336833,0.003256947,0.80543065],"genre_scores_gemma":[0.005829581,0.0064646797,0.001644239,0.011006936,0.023362638,0.00018754738,0.0052538533,0.0007498065,0.94550073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979151,0.00018930524,0.00012644925,0.00023486959,0.0012972457,0.00023705687],"domain_scores_gemma":[0.994615,0.00069318025,0.00022107168,0.00054042577,0.0030033395,0.0009269473],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015144518,0.0012940771,0.0011115575,0.0019374957,0.0017408859,0.006913846,0.0014176901,0.0043260497,0.5677959],"category_scores_gemma":[0.008842999,0.00058854115,0.00056718296,0.0015466352,0.00055034325,0.0025351597,0.0014095838,0.0048222467,0.5158698],"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.00004186071,0.00003912728,0.00007834854,0.00010240682,0.000005664156,0.00007664417,0.000008644816,0.00007032138,0.00033483125,0.0014553432,0.95360047,0.044186335],"study_design_scores_gemma":[0.000019089206,0.000030130364,0.00018286104,0.00008457446,0.000004561151,0.00009637792,0.000014884124,0.00024716053,0.00032990286,0.0010893318,0.9978908,0.000010378562],"about_ca_topic_score_codex":0.000855431,"about_ca_topic_score_gemma":0.0017946254,"teacher_disagreement_score":0.43220413,"about_ca_system_score_codex":0.0015482184,"about_ca_system_score_gemma":0.002583583,"threshold_uncertainty_score":0.6164867},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658388,0.00652283,0.006860914,0.03482069,0.13716494,0.00044038997,0.004336833,0.003256947,0.80543065],"genre_scores_gemma":[0.005829581,0.0064646797,0.001644239,0.011006936,0.023362638,0.00018754738,0.0052538533,0.0007498065,0.94550073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979151,0.00018930524,0.00012644925,0.00023486959,0.0012972457,0.00023705687],"domain_scores_gemma":[0.994615,0.00069318025,0.00022107168,0.00054042577,0.0030033395,0.0009269473],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015144518,0.0012940771,0.0011115575,0.0019374957,0.0017408859,0.006913846,0.0014176901,0.0043260497,0.5677959],"category_scores_gemma":[0.008842999,0.00058854115,0.00056718296,0.0015466352,0.00055034325,0.0025351597,0.0014095838,0.0048222467,0.5158698],"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.00004186071,0.00003912728,0.00007834854,0.00010240682,0.000005664156,0.00007664417,0.000008644816,0.00007032138,0.00033483125,0.0014553432,0.95360047,0.044186335],"study_design_scores_gemma":[0.000019089206,0.000030130364,0.00018286104,0.00008457446,0.000004561151,0.00009637792,0.000014884124,0.00024716053,0.00032990286,0.0010893318,0.9978908,0.000010378562],"about_ca_topic_score_codex":0.000855431,"about_ca_topic_score_gemma":0.0017946254,"teacher_disagreement_score":0.43220413,"about_ca_system_score_codex":0.0015482184,"about_ca_system_score_gemma":0.002583583,"threshold_uncertainty_score":0.6164867},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658388,0.00652283,0.006860914,0.03482069,0.13716494,0.00044038997,0.004336833,0.003256947,0.80543065],"genre_scores_gemma":[0.005829581,0.0064646797,0.001644239,0.011006936,0.023362638,0.00018754738,0.0052538533,0.0007498065,0.94550073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979151,0.00018930524,0.00012644925,0.00023486959,0.0012972457,0.00023705687],"domain_scores_gemma":[0.994615,0.00069318025,0.00022107168,0.00054042577,0.0030033395,0.0009269473],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015144518,0.0012940771,0.0011115575,0.0019374957,0.0017408859,0.006913846,0.0014176901,0.0043260497,0.5677959],"category_scores_gemma":[0.008842999,0.00058854115,0.00056718296,0.0015466352,0.00055034325,0.0025351597,0.0014095838,0.0048222467,0.5158698],"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.00004186071,0.00003912728,0.00007834854,0.00010240682,0.000005664156,0.00007664417,0.000008644816,0.00007032138,0.00033483125,0.0014553432,0.95360047,0.044186335],"study_design_scores_gemma":[0.000019089206,0.000030130364,0.00018286104,0.00008457446,0.000004561151,0.00009637792,0.000014884124,0.00024716053,0.00032990286,0.0010893318,0.9978908,0.000010378562],"about_ca_topic_score_codex":0.000855431,"about_ca_topic_score_gemma":0.0017946254,"teacher_disagreement_score":0.43220413,"about_ca_system_score_codex":0.0015482184,"about_ca_system_score_gemma":0.002583583,"threshold_uncertainty_score":0.6164867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025070705,0.00023842079,0.9681979,0.00014040143,0.000047554095,0.000019672361,0.00003263838,0.00014378333,0.006108968],"genre_scores_gemma":[0.74080366,0.0007992388,0.25480926,0.0001945003,0.00010932048,0.00012616884,0.0000872195,0.000061843166,0.0030087314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972624,0.00010967336,0.00000935097,0.00003683564,0.00008115532,0.000036806006],"domain_scores_gemma":[0.99953127,0.00017121443,0.00012560707,0.000041009407,0.000099991616,0.000030951654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002372375,0.0007307258,0.00034082035,0.0001900529,0.00018314151,0.0005200878,0.00043970963,0.00039422876,0.0011836179],"category_scores_gemma":[0.00087373395,0.0003189712,0.00020846029,0.00035011134,0.00038314582,0.00051888777,0.00054516754,0.00045080716,0.0005585335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028468587,0.00010207051,0.0010774181,0.00032017878,0.000063937536,0.00031935284,0.00024389089,0.53248835,0.24967526,0.08346733,0.0027438551,0.12921372],"study_design_scores_gemma":[0.000024117768,0.0004374164,0.0004364397,0.000024232997,0.000020661702,0.00023552554,0.000088192966,0.95859474,0.025050234,0.011192057,0.0038672443,0.000029113395],"about_ca_topic_score_codex":0.00015669821,"about_ca_topic_score_gemma":0.00041224225,"teacher_disagreement_score":0.0011836179,"about_ca_system_score_codex":0.0002442808,"about_ca_system_score_gemma":0.00027919683,"threshold_uncertainty_score":0.0039596558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051227458,0.00024889765,0.94290805,0.00014483638,0.000060428738,0.00006374827,0.00008143581,0.00052379,0.0047413604],"genre_scores_gemma":[0.72447443,0.00038378086,0.27006254,0.00018283204,0.000061908795,0.00014198675,0.00019269741,0.000135855,0.0043639527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.00016230764,0.000032377648,0.00009422096,0.0001471216,0.000064399486],"domain_scores_gemma":[0.9991357,0.00024801912,0.00014007844,0.00021278777,0.00022378196,0.000039634837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565785,0.0008156547,0.0003608268,0.0004446916,0.00038321211,0.0005930535,0.00093349925,0.0005383147,0.0016458844],"category_scores_gemma":[0.0018095855,0.00021616656,0.00029168357,0.00043596522,0.00074399525,0.0010479854,0.0007431209,0.00063530053,0.00094484416],"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.0008547665,0.0001235792,0.0017593602,0.00028234412,0.00008702756,0.0005052084,0.00038767487,0.2071947,0.2566032,0.24896573,0.0020665713,0.2811698],"study_design_scores_gemma":[0.000053531996,0.0005538163,0.0003570957,0.000052910906,0.000049932823,0.00056771206,0.000053289237,0.7229589,0.21221374,0.049540628,0.013530989,0.00006749728],"about_ca_topic_score_codex":0.0005273045,"about_ca_topic_score_gemma":0.00073543406,"teacher_disagreement_score":0.0016458844,"about_ca_system_score_codex":0.0005085449,"about_ca_system_score_gemma":0.00059207,"threshold_uncertainty_score":0.0055060387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18943356,0.0029235475,0.7860032,0.0005763379,0.00012270165,0.000057791472,0.0002741495,0.00020837627,0.02040037],"genre_scores_gemma":[0.98537666,0.0016577103,0.010836356,0.000085623724,0.000107833825,0.00006063068,0.00010528483,0.000055112487,0.0017147479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985801,0.0006264309,0.00005519133,0.00012259057,0.00039062495,0.0002251133],"domain_scores_gemma":[0.98806167,0.009383536,0.0010097873,0.0004979264,0.00085586327,0.00019128513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002396536,0.0012770601,0.0011916085,0.0013445268,0.00051396235,0.0011180264,0.0009134223,0.0007987208,0.0018850367],"category_scores_gemma":[0.012033621,0.00046429975,0.00053457136,0.0011360764,0.0028125728,0.002859975,0.0015951215,0.0009442042,0.00028954184],"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.00020831612,0.000048032245,0.0011125148,0.000324927,0.00009262962,0.00046097304,0.00018735502,0.74670744,0.006736825,0.23467995,0.0009098436,0.008531237],"study_design_scores_gemma":[0.000009948107,0.000066363384,0.00055988075,0.000059761263,0.000024432147,0.0001717431,0.000045689074,0.94552416,0.0028618036,0.05014989,0.00047461508,0.000051662762],"about_ca_topic_score_codex":0.00092008256,"about_ca_topic_score_gemma":0.0006201551,"teacher_disagreement_score":0.002396536,"about_ca_system_score_codex":0.001095701,"about_ca_system_score_gemma":0.0007997421,"threshold_uncertainty_score":0.012674272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07707026,0.0007137274,0.9172999,0.00073529157,0.00004973764,0.00004470425,0.000059400107,0.00016671918,0.0038601346],"genre_scores_gemma":[0.975229,0.00024009177,0.022367707,0.00012252916,0.000026754136,0.000041584015,0.0000389335,0.00002471139,0.001908649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00013315551,0.000012364021,0.00006551648,0.000058752397,0.00007490606],"domain_scores_gemma":[0.998723,0.0008616186,0.0001355266,0.00003895064,0.00015807476,0.00008284829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508062,0.0006982753,0.0009929867,0.00031713245,0.0002790808,0.0005967253,0.0009953779,0.0010330791,0.0011067985],"category_scores_gemma":[0.0026567916,0.00033735827,0.00031566672,0.00034749683,0.00088492286,0.0011702819,0.0009506493,0.0010142728,0.00009304882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034797686,0.00002322274,0.00030111716,0.000022423494,0.00001433473,0.00004260575,0.000018622093,0.98671955,0.0004393689,0.0049857227,0.000333725,0.007064501],"study_design_scores_gemma":[0.00000227823,0.000008824908,0.000023591761,0.0000013349489,0.0000018086729,0.0000036519618,0.0000029063626,0.99843484,0.00005459712,0.0014222577,0.00004278982,0.0000011558827],"about_ca_topic_score_codex":0.0050200396,"about_ca_topic_score_gemma":0.0038676346,"teacher_disagreement_score":0.0050200396,"about_ca_system_score_codex":0.0011519009,"about_ca_system_score_gemma":0.0010212823,"threshold_uncertainty_score":0.009981692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996958,0.00003551655,0.002305075,0.000021577509,0.000004124617,0.0000040666623,0.00008579172,0.000048647933,0.00053723453],"genre_scores_gemma":[0.9997228,0.000019490011,0.000120975434,0.000004996601,0.0000022784207,0.0000027533579,0.000041278065,0.0000033082354,0.00008222521],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974257,0.000045193956,0.0000066323737,0.000039256578,0.00006935218,0.00009689198],"domain_scores_gemma":[0.9981883,0.0009560452,0.00035446294,0.000092203096,0.0003036422,0.00010525788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019199285,0.00026155665,0.00022256932,0.00044449177,0.00031294324,0.00023966425,0.00016553719,0.00033633644,0.0007391329],"category_scores_gemma":[0.00087495905,0.0001411811,0.000087230896,0.0005067328,0.00046991353,0.0002893655,0.00030776742,0.00030124668,0.000148685],"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.0028749346,0.00027089746,0.24222623,0.00032896502,0.00016830595,0.005462625,0.0013913517,0.2957179,0.41372088,0.0012979073,0.001506927,0.035032988],"study_design_scores_gemma":[0.00007902181,0.0014825346,0.50806874,0.000039074144,0.00018174651,0.0037771368,0.0017715826,0.34098938,0.14147963,0.00068068097,0.0013058216,0.00014474744],"about_ca_topic_score_codex":0.0030931188,"about_ca_topic_score_gemma":0.0035275226,"teacher_disagreement_score":0.0030931188,"about_ca_system_score_codex":0.00026676105,"about_ca_system_score_gemma":0.00020306226,"threshold_uncertainty_score":0.0061502457},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08758651,0.0006562325,0.9031804,0.0002584445,0.00010875374,0.00009276403,0.00009654621,0.0005824531,0.007437756],"genre_scores_gemma":[0.7549077,0.0005197593,0.24099424,0.00016005507,0.000081375474,0.000062833235,0.00014357016,0.000024286988,0.003106195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995572,0.00008291583,0.0000249449,0.00006971946,0.0002057709,0.00005947989],"domain_scores_gemma":[0.9995271,0.00012608386,0.00011494778,0.00007222387,0.00013709316,0.00002243348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043683342,0.00063874776,0.00045636378,0.000527495,0.00039442178,0.00069536,0.00053004123,0.0004937772,0.0012715062],"category_scores_gemma":[0.0011261565,0.00015294382,0.00023745545,0.0005526746,0.00040912477,0.000793838,0.00043575725,0.0005431923,0.0002882105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015137434,0.00021505184,0.0049537504,0.00025232867,0.00007569865,0.0006378281,0.00043819682,0.11464948,0.31468928,0.09107386,0.0029209738,0.46857983],"study_design_scores_gemma":[0.000071722374,0.0004440733,0.001184723,0.00003416891,0.000036614743,0.00076694746,0.000052898587,0.8199598,0.16145405,0.007506928,0.0084286705,0.000059370064],"about_ca_topic_score_codex":0.0011331867,"about_ca_topic_score_gemma":0.0018053306,"teacher_disagreement_score":0.0012715062,"about_ca_system_score_codex":0.0005630264,"about_ca_system_score_gemma":0.00081714836,"threshold_uncertainty_score":0.004253626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54929584,0.0019899677,0.43169248,0.0006734957,0.000052737014,0.00007388241,0.00039990802,0.0004889159,0.015332827],"genre_scores_gemma":[0.9962529,0.0003036454,0.002693272,0.000027349204,0.000022065164,0.00001990105,0.000056525507,0.000014969243,0.00060926017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999193,0.00027265752,0.000028874947,0.00007496466,0.00025666787,0.00017385762],"domain_scores_gemma":[0.9948295,0.0038111273,0.0005731118,0.00017011579,0.00052480574,0.00009130059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012035462,0.0005585087,0.00055242603,0.0008000367,0.00047528357,0.00059640326,0.00060182274,0.000702317,0.0011258144],"category_scores_gemma":[0.0062664957,0.0002345778,0.00038094327,0.00076377904,0.0010311017,0.0008400388,0.0006656716,0.00057182234,0.00016177949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007291084,0.000019055278,0.0030139207,0.000072299306,0.000024667854,0.00038300897,0.00013962449,0.9749928,0.002848072,0.012940338,0.00046301878,0.0050302483],"study_design_scores_gemma":[0.0000024410756,0.000026961668,0.0009941102,0.000010090147,0.000009980586,0.000120721976,0.000050731298,0.99609286,0.00052257965,0.0020140507,0.0001477012,0.00000775855],"about_ca_topic_score_codex":0.006256286,"about_ca_topic_score_gemma":0.0031917759,"teacher_disagreement_score":0.006256286,"about_ca_system_score_codex":0.001542274,"about_ca_system_score_gemma":0.0005553068,"threshold_uncertainty_score":0.012439728},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.5674915,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04346981,0.00047478397,0.95242953,0.00016810455,0.00007809532,0.00009519208,0.00009367248,0.00049528084,0.0026955341],"genre_scores_gemma":[0.8123028,0.00036914888,0.18442117,0.00014169444,0.000057874826,0.00011511967,0.00011828587,0.000072466304,0.0024013834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.00014318133,0.00003185288,0.000089779955,0.0002405339,0.00010792114],"domain_scores_gemma":[0.99807215,0.00060088723,0.00021881127,0.00035694265,0.00063258916,0.00011855472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688079,0.0007229084,0.00077565,0.0005413636,0.0006274993,0.00070741883,0.0016449741,0.0005760918,0.0009937132],"category_scores_gemma":[0.0031121888,0.00022515406,0.0002847076,0.00080792303,0.00068362645,0.0015746091,0.00093679235,0.00062030734,0.0002284546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005420159,0.00018049192,0.0024564383,0.0003255388,0.000086023945,0.0006681562,0.0004445855,0.54672235,0.112927936,0.11519032,0.0091368295,0.21131928],"study_design_scores_gemma":[0.000017766002,0.00008080957,0.00013126824,0.000010383177,0.000018658215,0.00018042001,0.00003181849,0.985061,0.0072596087,0.005150527,0.002032941,0.000024678126],"about_ca_topic_score_codex":0.0051637026,"about_ca_topic_score_gemma":0.0067012287,"teacher_disagreement_score":0.0051637026,"about_ca_system_score_codex":0.0014591077,"about_ca_system_score_gemma":0.001755942,"threshold_uncertainty_score":0.010586619},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005770594,0.00012813968,0.99143994,0.0000750276,0.000021548476,0.000019233323,0.000009961021,0.0001898677,0.0023457902],"genre_scores_gemma":[0.57527345,0.00029292263,0.41819444,0.00025682905,0.0000639638,0.00015915254,0.00009972571,0.00011741296,0.0055421507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00013083572,0.000021443655,0.00007053831,0.00018239887,0.000061631494],"domain_scores_gemma":[0.9997031,0.00009073554,0.000051321447,0.00003550677,0.00009616965,0.000023043942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517922,0.001040652,0.00063833245,0.00040111167,0.00030921708,0.00071285793,0.0008194646,0.0006206503,0.0015772764],"category_scores_gemma":[0.0010022111,0.00031500205,0.0004440535,0.00051115727,0.0007269699,0.00089548336,0.00092991337,0.0008400072,0.0006533076],"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.00020976231,0.00009403472,0.0009384403,0.00015816696,0.00008647514,0.00021090404,0.00022079212,0.68876195,0.032463845,0.05569286,0.0038143403,0.21734835],"study_design_scores_gemma":[0.000014541905,0.00008062669,0.000095360374,0.0000063691336,0.000008409575,0.000059969607,0.000013785316,0.99099463,0.003728704,0.0038622923,0.0011226628,0.00001265043],"about_ca_topic_score_codex":0.0012683856,"about_ca_topic_score_gemma":0.0011505756,"teacher_disagreement_score":0.0015772764,"about_ca_system_score_codex":0.00042445547,"about_ca_system_score_gemma":0.0007644872,"threshold_uncertainty_score":0.005276561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009368369,0.00021265073,0.98815525,0.00040868498,0.00006627374,0.00003615112,0.00005316248,0.00033219074,0.0013672956],"genre_scores_gemma":[0.25975978,0.00055201486,0.7314639,0.00054005504,0.00047422614,0.00022585054,0.0003840283,0.00014441207,0.0064557944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737215,0.00075473316,0.00012823142,0.00042400497,0.0010332364,0.00028764564],"domain_scores_gemma":[0.9945943,0.003579057,0.00040106036,0.00054263056,0.0007632639,0.0001196501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002913803,0.0015581753,0.0017537769,0.0012242746,0.0008987598,0.0020064788,0.0017550379,0.0019496926,0.004142115],"category_scores_gemma":[0.011350327,0.0005808804,0.0007850096,0.0012277178,0.00089456025,0.003270109,0.0015519328,0.0024700512,0.0016127228],"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.00066246826,0.0002600314,0.002365867,0.00023910218,0.00008497572,0.00026554635,0.0003114649,0.3449173,0.019313216,0.08696806,0.0060185343,0.5385935],"study_design_scores_gemma":[0.000010610924,0.00002486639,0.000169535,0.000008234201,0.000004927503,0.000040091905,0.0000121571575,0.9863499,0.001999688,0.010362549,0.0010078821,0.000009546276],"about_ca_topic_score_codex":0.0028546508,"about_ca_topic_score_gemma":0.0033021742,"teacher_disagreement_score":0.004142115,"about_ca_system_score_codex":0.0016402777,"about_ca_system_score_gemma":0.0020800608,"threshold_uncertainty_score":0.015409827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08725429,0.00066523574,0.9062605,0.00021358005,0.000060857128,0.000019794817,0.00007025996,0.00013742462,0.0053181117],"genre_scores_gemma":[0.9366784,0.00030264037,0.059144147,0.00006289532,0.000039854673,0.000033480952,0.00005385758,0.000025414574,0.0036593636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996593,0.000112818554,0.000008847535,0.00008287971,0.000064791995,0.00007135927],"domain_scores_gemma":[0.9995789,0.00022784948,0.00006866289,0.000032234577,0.00006304595,0.000029294295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037543377,0.00085093663,0.00077534595,0.00022621728,0.0002258886,0.000667953,0.0007325631,0.0006685128,0.0010841829],"category_scores_gemma":[0.00083699106,0.00028221132,0.00043462968,0.00046073698,0.0004904834,0.000692161,0.00066597713,0.0005901342,0.00020805463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012239121,0.00003139545,0.0005789895,0.00006995155,0.000039099556,0.00022807148,0.000052905634,0.9640096,0.005720035,0.00904136,0.00070814975,0.019398041],"study_design_scores_gemma":[0.0000053918825,0.00004689012,0.00010625745,0.0000022345057,0.000007790255,0.000048139114,0.000015623162,0.9972927,0.00091207,0.0012352942,0.00032344155,0.0000042075085],"about_ca_topic_score_codex":0.0017583501,"about_ca_topic_score_gemma":0.0015515073,"teacher_disagreement_score":0.0017583501,"about_ca_system_score_codex":0.00048078824,"about_ca_system_score_gemma":0.0005001461,"threshold_uncertainty_score":0.0036269426},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079447655,0.00017427292,0.98993,0.00005728001,0.00001751574,0.000022373362,0.0000148549725,0.0002179617,0.001621004],"genre_scores_gemma":[0.4879768,0.0003645106,0.5066872,0.00020839562,0.000083482824,0.00014023743,0.00008356408,0.000055622695,0.00440018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913615,0.00020713083,0.000041422416,0.000112484035,0.0004273773,0.000075455355],"domain_scores_gemma":[0.9991875,0.00024275355,0.00012254261,0.00010562322,0.00030266886,0.000038799102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585842,0.00054689776,0.0005738493,0.00037496645,0.00039150025,0.0006640083,0.0008893688,0.000770512,0.00081663847],"category_scores_gemma":[0.0016837143,0.00029944186,0.00042470236,0.00035922963,0.0005259098,0.00073693995,0.000981349,0.0008234657,0.0006798539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036858724,0.00016449543,0.0020931826,0.0002932995,0.00018711961,0.0005079826,0.000615423,0.38188756,0.24762258,0.0872743,0.0038193816,0.27516612],"study_design_scores_gemma":[0.000021426264,0.00018965364,0.00028341435,0.000018098386,0.000032398693,0.00036310937,0.000018888477,0.96385616,0.025683776,0.0045376387,0.0049535227,0.000041867654],"about_ca_topic_score_codex":0.0006819252,"about_ca_topic_score_gemma":0.0011058026,"teacher_disagreement_score":0.0008893688,"about_ca_system_score_codex":0.0005391016,"about_ca_system_score_gemma":0.0012091496,"threshold_uncertainty_score":0.0039114356},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011658354,0.006537453,0.006867114,0.0348542,0.13746043,0.00043991272,0.0043279747,0.0032543738,0.8050928],"genre_scores_gemma":[0.0058280574,0.006499024,0.0016488413,0.011016272,0.02338884,0.00018796943,0.005265932,0.00075007003,0.945415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979139,0.00018934149,0.00012657532,0.000235412,0.0012973369,0.00023732893],"domain_scores_gemma":[0.9946253,0.00069294556,0.00022059988,0.00053924054,0.00299711,0.00092483405],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001514601,0.0012930268,0.0011124272,0.0019343531,0.0017397362,0.006903521,0.0014207318,0.0043255175,0.5676011],"category_scores_gemma":[0.008854081,0.00058750046,0.00056710804,0.0015465706,0.0005511858,0.0025384028,0.0014098596,0.0048210295,0.5156505],"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.000041788382,0.0000389612,0.00007830108,0.000102547805,0.0000056596186,0.000076663375,0.000008653689,0.000070156304,0.00033487054,0.0014594428,0.95351195,0.04427104],"study_design_scores_gemma":[0.00001900094,0.000030002831,0.00018142386,0.00008420892,0.000004533873,0.00009597427,0.0000148087465,0.00024582093,0.00032802654,0.0010835639,0.9979024,0.000010339177],"about_ca_topic_score_codex":0.00085604505,"about_ca_topic_score_gemma":0.0017938807,"teacher_disagreement_score":0.9930965,"about_ca_system_score_codex":0.001548921,"about_ca_system_score_gemma":0.002585707,"threshold_uncertainty_score":0.61676455},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.5674915,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09733114,0.006246924,0.8034475,0.002022505,0.00020743393,0.00008538748,0.0006852188,0.0005006524,0.089473285],"genre_scores_gemma":[0.97243214,0.0020603756,0.020394426,0.0003374876,0.00021467457,0.00014572561,0.00017140995,0.000092308015,0.004151447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985342,0.00044789872,0.000046432157,0.0001621764,0.0005043416,0.00030497933],"domain_scores_gemma":[0.9931953,0.004739663,0.00045283732,0.00038071608,0.0010703326,0.00016110987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016690094,0.000847592,0.00065854145,0.0009283884,0.00067767844,0.0019425055,0.0010242874,0.00067794166,0.003569812],"category_scores_gemma":[0.008025121,0.0003479991,0.0005255047,0.00080139603,0.002276882,0.0023302464,0.0015404813,0.0015232016,0.00058588467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014453907,0.000035645626,0.0003073827,0.00022248962,0.000036431233,0.00036306147,0.0003126853,0.23930602,0.0106013315,0.7331181,0.0037512286,0.01180111],"study_design_scores_gemma":[0.000022608663,0.000048848775,0.00029565775,0.00012095159,0.000019973968,0.00029234675,0.00008692098,0.7427689,0.00491135,0.24714667,0.004239173,0.00004653117],"about_ca_topic_score_codex":0.002842665,"about_ca_topic_score_gemma":0.0010622775,"teacher_disagreement_score":0.003569812,"about_ca_system_score_codex":0.0023203106,"about_ca_system_score_gemma":0.0015162533,"threshold_uncertainty_score":0.016835093},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.5674915,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020150768,0.00097006257,0.97548985,0.00026009462,0.00011587629,0.00002702564,0.000029206223,0.00020240217,0.0027547008],"genre_scores_gemma":[0.86495465,0.0008360867,0.13182251,0.00037096397,0.00009393273,0.0000445593,0.000044520515,0.000009237326,0.0018235479],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994848,0.00017211505,0.000031775955,0.00011038961,0.00014984164,0.000051003033],"domain_scores_gemma":[0.9993974,0.00033386104,0.00006845352,0.00007083057,0.00010964116,0.00001981024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051812193,0.00043740342,0.0004494994,0.0003202937,0.00037030946,0.0005303083,0.0007069484,0.00054250105,0.00086990604],"category_scores_gemma":[0.001175481,0.00020156341,0.00029371344,0.0004276608,0.00046206763,0.0008703127,0.00081985357,0.00049457804,0.00021084506],"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.00079633755,0.00023200398,0.002984992,0.00057837355,0.00017925518,0.00095729256,0.00031538127,0.32299384,0.16994262,0.06052018,0.0054820315,0.4350177],"study_design_scores_gemma":[0.000020648864,0.00016210302,0.00030817155,0.000018262539,0.000027777103,0.00040445675,0.00005082113,0.9734047,0.016102877,0.0070605953,0.0024121292,0.000027473106],"about_ca_topic_score_codex":0.0005652622,"about_ca_topic_score_gemma":0.0010025469,"teacher_disagreement_score":0.00086990604,"about_ca_system_score_codex":0.00034022104,"about_ca_system_score_gemma":0.00028777117,"threshold_uncertainty_score":0.0029100776},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31541094,0.0021293724,0.6737858,0.0004559475,0.00014672423,0.00013533069,0.00026995348,0.0004484955,0.0072173825],"genre_scores_gemma":[0.9807592,0.00022169319,0.017931873,0.00004583689,0.000051678227,0.000059774473,0.000040603496,0.0000076064684,0.000881629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858594,0.0006492715,0.000069892914,0.00013589457,0.0003180461,0.00024101803],"domain_scores_gemma":[0.996777,0.0016053644,0.0005201398,0.00058688456,0.00040262,0.000108142776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013682754,0.00059322367,0.0007895398,0.0005589299,0.0010079982,0.00078871596,0.00097367406,0.00045963458,0.0010650733],"category_scores_gemma":[0.0032129746,0.00027885978,0.00043036547,0.0008579595,0.0011402701,0.0010667788,0.0013403575,0.00047242214,0.000256256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011368945,0.00021590777,0.0046182447,0.0007975423,0.0002522474,0.0020675962,0.0014251076,0.49126613,0.083591506,0.17912978,0.0042228145,0.23127627],"study_design_scores_gemma":[0.000048519127,0.00029577332,0.00090244185,0.000029730794,0.000043275955,0.00085183483,0.0001475717,0.97129977,0.0063862517,0.017635621,0.0022936317,0.00006552772],"about_ca_topic_score_codex":0.001854554,"about_ca_topic_score_gemma":0.003092534,"teacher_disagreement_score":0.001854554,"about_ca_system_score_codex":0.0005266362,"about_ca_system_score_gemma":0.0011270468,"threshold_uncertainty_score":0.0072361827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42694035,0.005599561,0.50922054,0.0012781569,0.00016172594,0.00008495279,0.0009501426,0.00063806266,0.05512647],"genre_scores_gemma":[0.9943058,0.00087712525,0.0029018905,0.000052466075,0.000041833868,0.00003214306,0.000113025155,0.00002790348,0.0016477773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992962,0.00019012578,0.000021692234,0.00007202266,0.00020854267,0.0002113237],"domain_scores_gemma":[0.9964463,0.0022544663,0.00045627548,0.00019765792,0.00056055037,0.00008480618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182509,0.00073661166,0.00070046674,0.00095024373,0.00053305505,0.0010037328,0.0006616259,0.00069752306,0.0016716962],"category_scores_gemma":[0.0044831443,0.00024088872,0.00047384077,0.0010624441,0.0014733395,0.0009766282,0.0009981932,0.0006443061,0.00030826783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003588566,0.00001013373,0.00063673366,0.000063385305,0.000019223511,0.00023051488,0.000081640996,0.97510797,0.0023585034,0.018389804,0.0004943526,0.0025719423],"study_design_scores_gemma":[0.0000015808389,0.000014438059,0.00054400536,0.000014935065,0.000008483393,0.000086908134,0.000050547904,0.9937052,0.000863789,0.0044519524,0.0002447221,0.000013357837],"about_ca_topic_score_codex":0.008038163,"about_ca_topic_score_gemma":0.0026847967,"teacher_disagreement_score":0.008038163,"about_ca_system_score_codex":0.0015293945,"about_ca_system_score_gemma":0.001038831,"threshold_uncertainty_score":0.015982747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049800617,0.00012933048,0.9936771,0.00005296472,0.000015798756,0.0000084529975,0.000012554755,0.00006719092,0.0010564922],"genre_scores_gemma":[0.6513506,0.00055005547,0.34519073,0.00020240623,0.00009244411,0.000111062924,0.000079337224,0.0000484104,0.002374834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994648,0.00016560922,0.000023277096,0.00008841121,0.00018390104,0.00007414509],"domain_scores_gemma":[0.99952364,0.00025800933,0.000084107654,0.00003762402,0.00007655468,0.000020090538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006655513,0.00090662704,0.0006770371,0.00032138816,0.0002768098,0.00050097296,0.00067583355,0.00063693384,0.00082534243],"category_scores_gemma":[0.0013539831,0.00027016216,0.000491968,0.0006005853,0.0006422829,0.0009368512,0.00074623514,0.0007736359,0.00029102055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019407397,0.00005512561,0.00040245228,0.0001590719,0.000071445684,0.00015693225,0.00011974991,0.8048514,0.034231637,0.034970164,0.0011928232,0.123595126],"study_design_scores_gemma":[0.000013198858,0.00008138537,0.00006987884,0.000006978185,0.00001087798,0.000057528152,0.000015821572,0.98907197,0.0035675142,0.006263942,0.00083026243,0.000010667224],"about_ca_topic_score_codex":0.0009665227,"about_ca_topic_score_gemma":0.0011349282,"teacher_disagreement_score":0.0009665227,"about_ca_system_score_codex":0.00037869404,"about_ca_system_score_gemma":0.0006475223,"threshold_uncertainty_score":0.0035197735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043550273,0.00057141104,0.986312,0.00012574017,0.00014459954,0.000048106325,0.000026212538,0.00009244191,0.008324459],"genre_scores_gemma":[0.42884123,0.0015158422,0.55882674,0.0004256524,0.00032704565,0.000302169,0.00007044183,0.000078844096,0.0096120825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934083,0.00017462017,0.000034888846,0.00016405988,0.00023557465,0.000050035007],"domain_scores_gemma":[0.9996283,0.00008172713,0.0000615624,0.00006789375,0.00013937712,0.000021016664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004952099,0.00073565834,0.0005272796,0.00048720793,0.0004942938,0.00089719443,0.000967168,0.0007046228,0.0018423989],"category_scores_gemma":[0.0009838294,0.00030223053,0.00051172276,0.00044822568,0.0005769735,0.0006776746,0.00064168725,0.0007972179,0.0007490541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025174354,0.00019533488,0.00075395324,0.0005736362,0.00017925006,0.00041175622,0.00029098094,0.16955036,0.20577165,0.38134748,0.0049105245,0.23576328],"study_design_scores_gemma":[0.000042386473,0.00046519504,0.00048242867,0.000060045953,0.00007953916,0.0010393856,0.000041422678,0.8872788,0.029920883,0.03609672,0.044419054,0.00007419446],"about_ca_topic_score_codex":0.00034624583,"about_ca_topic_score_gemma":0.00045853952,"teacher_disagreement_score":0.0018423989,"about_ca_system_score_codex":0.00046722204,"about_ca_system_score_gemma":0.00049926917,"threshold_uncertainty_score":0.006163478},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10891356,0.00027147372,0.88054657,0.00024546435,0.00006792328,0.000040462568,0.00003304216,0.00036871675,0.009512691],"genre_scores_gemma":[0.8744205,0.00010493224,0.12261269,0.00008743786,0.00002145096,0.000031650143,0.00003458962,0.000021346352,0.0026654077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981076,0.0000593241,0.0000053191297,0.00003089722,0.000056246052,0.000037390455],"domain_scores_gemma":[0.99984586,0.00006380377,0.000016391072,0.000025792948,0.000033259494,0.000014810105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020285907,0.0004287858,0.00034991064,0.00015511217,0.00029830012,0.00045954966,0.00050345843,0.00031490476,0.0014910124],"category_scores_gemma":[0.00038451396,0.00011583249,0.00024622204,0.000375765,0.0003928291,0.0006617425,0.00062541524,0.00040758416,0.00029312234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000625151,0.00009606957,0.0015136079,0.00012951675,0.00005990316,0.0003035536,0.00020226014,0.72987056,0.074354015,0.03578527,0.0033510607,0.15370902],"study_design_scores_gemma":[0.000009338114,0.00006379399,0.000102739294,0.0000023077355,0.0000054627817,0.000040595198,0.000021386739,0.9936644,0.0039551966,0.0013836275,0.0007452446,0.0000059642994],"about_ca_topic_score_codex":0.0010868686,"about_ca_topic_score_gemma":0.0021555228,"teacher_disagreement_score":0.0014910124,"about_ca_system_score_codex":0.0002671385,"about_ca_system_score_gemma":0.0003412801,"threshold_uncertainty_score":0.004987955},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.5674915,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095831916,0.0040400303,0.8460744,0.0014056031,0.00014962103,0.000101201,0.0009414399,0.0005710947,0.050884686],"genre_scores_gemma":[0.9768499,0.0020904,0.012389742,0.00029828722,0.00015491874,0.00017625115,0.00033138934,0.00013229562,0.007576753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998569,0.00039951896,0.000042358384,0.00014453413,0.00038882717,0.0004557618],"domain_scores_gemma":[0.9924745,0.0051681097,0.00045308558,0.00037506668,0.0013534856,0.00017563772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018040687,0.0014289716,0.0011064042,0.0015797226,0.00082030334,0.0019273097,0.0012251858,0.0010258885,0.0057958597],"category_scores_gemma":[0.0070594423,0.00048325627,0.00079477776,0.0017921098,0.002192003,0.0020354968,0.0020768652,0.0015224954,0.0010917452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009167986,0.0000392813,0.0008309363,0.00025787103,0.00005811066,0.0004498142,0.0003389295,0.82236665,0.0054910327,0.15916838,0.003039679,0.007867638],"study_design_scores_gemma":[0.00000366033,0.000016207638,0.00026285514,0.00003341876,0.000018344444,0.000111542024,0.00007591476,0.9751462,0.00081416767,0.02284938,0.00064233015,0.000025990093],"about_ca_topic_score_codex":0.007293454,"about_ca_topic_score_gemma":0.0040184627,"teacher_disagreement_score":0.007293454,"about_ca_system_score_codex":0.0029186264,"about_ca_system_score_gemma":0.0016505586,"threshold_uncertainty_score":0.021176219},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.99310476,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08842798,0.0007700423,0.90300816,0.00027274177,0.0002171743,0.00027039793,0.00010600393,0.0008123616,0.0061150305],"genre_scores_gemma":[0.932102,0.00027269806,0.06526738,0.00013556985,0.000057401638,0.00013566801,0.00011473897,0.000026244194,0.0018882679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.00014473432,0.000031250413,0.000087056156,0.000135237,0.00010892922],"domain_scores_gemma":[0.999295,0.00017448216,0.0001259092,0.00014717442,0.0001736538,0.000083728635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000689193,0.0006669562,0.000491716,0.0005656864,0.0009562219,0.00051207846,0.0013995556,0.00033946763,0.00080960465],"category_scores_gemma":[0.0012796487,0.00018392237,0.00024476057,0.00054061465,0.0005483841,0.00072150433,0.0012316206,0.0005992277,0.00015124009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012856273,0.0003303962,0.0042076656,0.0004834804,0.00019380823,0.0011252228,0.0011890369,0.28520438,0.1333526,0.059123654,0.013021626,0.5004825],"study_design_scores_gemma":[0.00007694928,0.0007079108,0.0010232378,0.000031223048,0.00006585261,0.00065005606,0.00027405482,0.9509712,0.022488317,0.0094978735,0.014147762,0.000065567234],"about_ca_topic_score_codex":0.0035852632,"about_ca_topic_score_gemma":0.004525986,"teacher_disagreement_score":0.0035852632,"about_ca_system_score_codex":0.000568119,"about_ca_system_score_gemma":0.0011765334,"threshold_uncertainty_score":0.007128775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13898401,0.00024954558,0.8571835,0.00020351511,0.000037773858,0.000042803185,0.000026279897,0.00037569384,0.0028969198],"genre_scores_gemma":[0.9241979,0.00008993489,0.07419785,0.0000902052,0.000021944166,0.00005581809,0.000027808579,0.000016385497,0.0013022951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876773,0.00041665352,0.000030139998,0.00029355244,0.000323497,0.00016848426],"domain_scores_gemma":[0.9981261,0.0007965969,0.00026788196,0.0003515635,0.00033049055,0.00012731004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011847103,0.0006846188,0.0009662787,0.0005196936,0.00053029414,0.00067721197,0.0011236244,0.0012676802,0.0004619395],"category_scores_gemma":[0.0031149017,0.00037188624,0.0003420925,0.00065444334,0.0010424352,0.0014868631,0.002267963,0.0005860486,0.0003743166],"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.00043423247,0.00019417782,0.00570861,0.00015563764,0.000078036894,0.001015876,0.0008298062,0.78877014,0.08387004,0.014015665,0.0011928219,0.10373505],"study_design_scores_gemma":[0.000016101943,0.00017830478,0.00056149793,0.000005394509,0.000011661234,0.00018888658,0.000113817034,0.9890616,0.0070986934,0.002127715,0.00061923964,0.000017071034],"about_ca_topic_score_codex":0.0028188734,"about_ca_topic_score_gemma":0.0028693352,"teacher_disagreement_score":0.0028188734,"about_ca_system_score_codex":0.00055030547,"about_ca_system_score_gemma":0.0006693288,"threshold_uncertainty_score":0.0062654614},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17039554,0.00038112112,0.82471204,0.0006547141,0.00007487149,0.00003693549,0.00007675988,0.00043324134,0.0032347706],"genre_scores_gemma":[0.9814859,0.00006201479,0.016513262,0.00008277441,0.000014572964,0.00002460174,0.000041462124,0.000017235296,0.0017581311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00012429048,0.000011344413,0.00007523674,0.000045551566,0.00008267665],"domain_scores_gemma":[0.9987047,0.0008310133,0.00015688961,0.00006725362,0.00015193217,0.00008822854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010892012,0.0005554818,0.00094060006,0.0001795992,0.00031398353,0.00052593014,0.0010675184,0.00082901557,0.0013200539],"category_scores_gemma":[0.0030210428,0.0004395946,0.00030203033,0.00024268082,0.0008767123,0.00095499004,0.00086870464,0.0012199983,0.00015340594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061533334,0.000021758207,0.000479061,0.000012218269,0.00001450698,0.000051911673,0.000023298713,0.98899835,0.0004710428,0.003093341,0.00028764352,0.0064853528],"study_design_scores_gemma":[0.0000022473687,0.000004896249,0.000024958574,5.5484657e-7,0.000001034149,0.0000020276386,0.0000014841116,0.9991947,0.000044848162,0.0007003408,0.000022123819,7.199694e-7],"about_ca_topic_score_codex":0.011848591,"about_ca_topic_score_gemma":0.010915273,"teacher_disagreement_score":0.011848591,"about_ca_system_score_codex":0.0009629683,"about_ca_system_score_gemma":0.00096336793,"threshold_uncertainty_score":0.023559272},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.43250853,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011697008,0.0065392083,0.0068897987,0.034793567,0.13768038,0.0004410093,0.0043314705,0.003265773,0.8048891],"genre_scores_gemma":[0.0058489484,0.00650581,0.0016528746,0.011049203,0.023451995,0.0001882751,0.005268739,0.0007527098,0.94528145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791783,0.00018831363,0.00012614379,0.00023452622,0.0012962425,0.00023705029],"domain_scores_gemma":[0.9946431,0.0006884666,0.00022000105,0.00053713535,0.002987162,0.0009241541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015114516,0.0012924476,0.0011134667,0.0019288264,0.0017363954,0.0068952353,0.0014220313,0.004325532,0.5674915],"category_scores_gemma":[0.008806895,0.0005885022,0.00056839304,0.0015446418,0.00055017695,0.0025307115,0.0014092985,0.004825055,0.5157651],"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.0000419273,0.00003907711,0.00007832908,0.00010236792,0.0000056750328,0.00007686572,0.000008612843,0.00007042303,0.0003363003,0.0014545164,0.9535001,0.04428582],"study_design_scores_gemma":[0.000019223422,0.000030295196,0.00018329608,0.000084854684,0.000004583029,0.00009697588,0.000014884162,0.00024973857,0.0003325987,0.0010940742,0.997879,0.000010445545],"about_ca_topic_score_codex":0.0008545756,"about_ca_topic_score_gemma":0.0017869456,"teacher_disagreement_score":0.5674915,"about_ca_system_score_codex":0.0015466462,"about_ca_system_score_gemma":0.002579753,"threshold_uncertainty_score":0.61692095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019408716,0.000103350234,0.9791372,0.00020912792,0.000030927487,0.000046777655,0.000020922316,0.00036534676,0.0006776921],"genre_scores_gemma":[0.7346433,0.0000913905,0.26183102,0.00034301015,0.00005003929,0.0001805173,0.000100434874,0.000113826296,0.0026465498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824595,0.0007063453,0.000087149456,0.00039939545,0.0003207877,0.00024038537],"domain_scores_gemma":[0.9963117,0.0018402066,0.00034068504,0.00061689125,0.0006690664,0.00022152928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046062632,0.0010643846,0.0016497052,0.00058353535,0.001008016,0.0015668581,0.0020466694,0.0018172874,0.001184421],"category_scores_gemma":[0.011446055,0.0004990729,0.0005033723,0.00077014015,0.0017428288,0.00271516,0.002297069,0.002050412,0.00036881652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033567759,0.00019538621,0.0015814387,0.00005723859,0.00005362611,0.00011072047,0.00014791585,0.86243856,0.0026744388,0.024997411,0.0023859686,0.10502151],"study_design_scores_gemma":[0.000013573934,0.000034771976,0.000051224608,0.0000034634777,0.000003171686,0.000016904394,0.000009140831,0.99252945,0.00070027326,0.0064530503,0.00018019666,0.0000048307074],"about_ca_topic_score_codex":0.0033013395,"about_ca_topic_score_gemma":0.0035107979,"teacher_disagreement_score":0.0046062632,"about_ca_system_score_codex":0.0012382388,"about_ca_system_score_gemma":0.0022545306,"threshold_uncertainty_score":0.024360538},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011710443,0.006554505,0.0068943854,0.035042115,0.13807142,0.00044126928,0.0043455935,0.0032750827,0.8042046],"genre_scores_gemma":[0.005840423,0.0065042167,0.0016508828,0.011094877,0.023597464,0.00018855857,0.005275512,0.0007519414,0.94509625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790984,0.00018962043,0.00012696227,0.00023553587,0.0013001978,0.00023784436],"domain_scores_gemma":[0.9946136,0.00069291197,0.0002214839,0.00054093084,0.003003153,0.0009278533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001515735,0.001290442,0.0011113394,0.0019332938,0.0017391895,0.0068841167,0.0014235474,0.0043352917,0.5679505],"category_scores_gemma":[0.00885468,0.00058901566,0.00056853256,0.0015408971,0.0005511884,0.002535461,0.0014104048,0.0048337593,0.5155456],"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.000041925512,0.000039042665,0.00007825653,0.0001026726,0.0000056753215,0.00007663525,0.000008602699,0.00007022367,0.00033647494,0.0014534283,0.95356494,0.044222105],"study_design_scores_gemma":[0.000019173176,0.000030126412,0.00018221754,0.000084303836,0.0000045532774,0.000096266616,0.000014785464,0.0002466238,0.00032993226,0.001086692,0.99789494,0.0000103856055],"about_ca_topic_score_codex":0.00085524196,"about_ca_topic_score_gemma":0.0017900723,"teacher_disagreement_score":0.5679505,"about_ca_system_score_codex":0.0015464703,"about_ca_system_score_gemma":0.0025870847,"threshold_uncertainty_score":0.6162662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4728112,0.0017229562,0.5142709,0.00082215946,0.000119784854,0.000062739346,0.0004250508,0.0004069286,0.009358327],"genre_scores_gemma":[0.9922971,0.00031989,0.0056680175,0.000048430287,0.000019426998,0.000017157236,0.00008758292,0.00003247836,0.0015100125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981913,0.0005631127,0.000065790926,0.00022403894,0.00059677835,0.00035895983],"domain_scores_gemma":[0.98670006,0.010345651,0.0012867305,0.00062340597,0.00091053447,0.00013372232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027862722,0.0007208099,0.0008957611,0.0007264037,0.00051977776,0.0011614099,0.00094073766,0.00087569753,0.001547906],"category_scores_gemma":[0.013103469,0.0003828576,0.00040754591,0.0007597364,0.0019004667,0.0019418779,0.0012704259,0.00084982195,0.0002182121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022444702,0.000028703967,0.0028162464,0.000071827526,0.000035113335,0.00023580062,0.000098690834,0.9579504,0.0024209807,0.029395308,0.0004436268,0.0062788753],"study_design_scores_gemma":[0.000012606615,0.000035839894,0.0010049734,0.000013617566,0.000013928883,0.00010385482,0.000034513498,0.9896506,0.0024078751,0.0065300143,0.0001715426,0.000020611877],"about_ca_topic_score_codex":0.0037023898,"about_ca_topic_score_gemma":0.0023494274,"teacher_disagreement_score":0.0037023898,"about_ca_system_score_codex":0.0013427072,"about_ca_system_score_gemma":0.0011025156,"threshold_uncertainty_score":0.014735401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3033021,0.0055568567,0.6543705,0.0008900799,0.00018549008,0.00012242164,0.00040383526,0.00044764773,0.034721132],"genre_scores_gemma":[0.9875786,0.0007729309,0.009555708,0.00007012749,0.000053515392,0.000039860883,0.000094933195,0.000029450412,0.001804725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986314,0.00048070535,0.000054886415,0.0001369212,0.0004671055,0.00022887952],"domain_scores_gemma":[0.9941052,0.003831765,0.00074608094,0.00027743052,0.0009438019,0.0000956867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016079894,0.0012668383,0.00086088094,0.00073393574,0.0007243348,0.0011666091,0.0007327219,0.0011398619,0.0021849463],"category_scores_gemma":[0.005967868,0.0003625854,0.00057289517,0.00082308805,0.001000169,0.000759334,0.0011408731,0.0007307672,0.00041424937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011074321,0.000017000895,0.0015045922,0.00010532159,0.00004067749,0.00022692821,0.00007548884,0.98200685,0.0033829364,0.0077984706,0.00035802065,0.0043729194],"study_design_scores_gemma":[0.000005064753,0.00006069783,0.00048865034,0.00001471922,0.0000149029565,0.0000852025,0.000029723522,0.9972951,0.0009993452,0.00080583716,0.00018983356,0.000011017167],"about_ca_topic_score_codex":0.0072244145,"about_ca_topic_score_gemma":0.0043096207,"teacher_disagreement_score":0.0072244145,"about_ca_system_score_codex":0.0014615385,"about_ca_system_score_gemma":0.0011098656,"threshold_uncertainty_score":0.014364719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028521058,0.00012828907,0.9958793,0.00010077566,0.00003852741,0.000012552591,0.000015725944,0.00015070719,0.00082201965],"genre_scores_gemma":[0.21445073,0.0005059377,0.7778641,0.00034925502,0.00009694753,0.00017120932,0.00016500299,0.000124733,0.006272108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974126,0.00007596205,0.000012227951,0.000045770128,0.000100236546,0.000024544093],"domain_scores_gemma":[0.9994796,0.00025125113,0.00005055878,0.00003489752,0.00015557895,0.00002810603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541331,0.00076077465,0.0007208803,0.00054408045,0.00038704273,0.0006363116,0.0009922666,0.0008285128,0.0019047962],"category_scores_gemma":[0.0017922566,0.00047181884,0.00045824668,0.00060761307,0.0006625831,0.0011367704,0.0009010887,0.0012933391,0.00044137493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091158465,0.000055015844,0.000884234,0.00019674835,0.000079577796,0.00009032632,0.000099466844,0.78179276,0.007398832,0.062062465,0.0029804446,0.14426911],"study_design_scores_gemma":[0.000003200715,0.0000074103273,0.000031390577,0.0000026094417,0.0000018113434,0.0000078683115,0.000001613013,0.9969981,0.00036822408,0.0022445112,0.00033004934,0.000003237048],"about_ca_topic_score_codex":0.004181934,"about_ca_topic_score_gemma":0.005622187,"teacher_disagreement_score":0.004181934,"about_ca_system_score_codex":0.0006311003,"about_ca_system_score_gemma":0.0012613678,"threshold_uncertainty_score":0.008315146},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011710443,0.006554505,0.0068943854,0.035042115,0.13807142,0.00044126928,0.0043455935,0.0032750827,0.8042046],"genre_scores_gemma":[0.005840423,0.0065042167,0.0016508828,0.011094877,0.023597464,0.00018855857,0.005275512,0.0007519414,0.94509625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790984,0.00018962043,0.00012696227,0.00023553587,0.0013001978,0.00023784436],"domain_scores_gemma":[0.9946136,0.00069291197,0.0002214839,0.00054093084,0.003003153,0.0009278533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001515735,0.001290442,0.0011113394,0.0019332938,0.0017391895,0.0068841167,0.0014235474,0.0043352917,0.5679505],"category_scores_gemma":[0.00885468,0.00058901566,0.00056853256,0.0015408971,0.0005511884,0.002535461,0.0014104048,0.0048337593,0.5155456],"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.000041925512,0.000039042665,0.00007825653,0.0001026726,0.0000056753215,0.00007663525,0.000008602699,0.00007022367,0.00033647494,0.0014534283,0.95356494,0.044222105],"study_design_scores_gemma":[0.000019173176,0.000030126412,0.00018221754,0.000084303836,0.0000045532774,0.000096266616,0.000014785464,0.0002466238,0.00032993226,0.001086692,0.99789494,0.0000103856055],"about_ca_topic_score_codex":0.00085524196,"about_ca_topic_score_gemma":0.0017900723,"teacher_disagreement_score":0.5679505,"about_ca_system_score_codex":0.0015464703,"about_ca_system_score_gemma":0.0025870847,"threshold_uncertainty_score":0.6162662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107099086,0.00032158714,0.8820679,0.00021875443,0.00011088241,0.000077168035,0.00016097608,0.00068817404,0.009255507],"genre_scores_gemma":[0.66400355,0.00056721905,0.32640186,0.00020760471,0.000107584,0.000117403535,0.0005180966,0.00013991124,0.00793681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.00010608195,0.000029001189,0.00007056419,0.00019297055,0.00009057338],"domain_scores_gemma":[0.9991358,0.00019629626,0.00009932179,0.00023886462,0.00028718042,0.000042626893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982654,0.00056556886,0.0004080855,0.0005083801,0.0004241301,0.00047034307,0.00050176674,0.0004219229,0.001486081],"category_scores_gemma":[0.0016055072,0.00014640644,0.0002738334,0.0006882957,0.0005478014,0.0009780518,0.00093128445,0.0006351879,0.0008555917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008529696,0.000079471734,0.0020461835,0.00026255843,0.000073599294,0.0007684055,0.00042588508,0.2568058,0.17332953,0.23149152,0.0044773514,0.32938665],"study_design_scores_gemma":[0.00005340715,0.00032574162,0.0004559349,0.000036489353,0.00003986279,0.0005855339,0.00010529585,0.79081064,0.1275604,0.06702184,0.012954271,0.000050538652],"about_ca_topic_score_codex":0.0009742879,"about_ca_topic_score_gemma":0.0010730363,"teacher_disagreement_score":0.001486081,"about_ca_system_score_codex":0.00036069078,"about_ca_system_score_gemma":0.00087690115,"threshold_uncertainty_score":0.004971504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04084288,0.0003738148,0.9543103,0.00022140477,0.00006435042,0.000038081336,0.000040391697,0.00015899535,0.003949795],"genre_scores_gemma":[0.75175774,0.000456398,0.24286824,0.00022174396,0.00006905578,0.00008615779,0.00008556618,0.0000231639,0.004432011],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.00013037887,0.000020866091,0.00007676664,0.00014268635,0.00005390129],"domain_scores_gemma":[0.999627,0.00009703251,0.00008869997,0.00009257388,0.00006790882,0.000026803202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036012675,0.00050449726,0.00040391064,0.0003528449,0.00039519827,0.00044588884,0.0006281039,0.00055651594,0.001258441],"category_scores_gemma":[0.00077549857,0.00020159264,0.00034155138,0.0007754915,0.0005380205,0.0012725403,0.0009672104,0.000646243,0.00037629963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007569073,0.00016631797,0.0011610899,0.00032906313,0.000113439884,0.00066820125,0.00047908185,0.094877444,0.41984177,0.15602748,0.002986385,0.32259282],"study_design_scores_gemma":[0.00011373581,0.00071051944,0.0005176697,0.000029954523,0.000074956435,0.0010508435,0.00009908215,0.7836737,0.17656472,0.02255134,0.014510239,0.000103295264],"about_ca_topic_score_codex":0.00019122516,"about_ca_topic_score_gemma":0.00023701528,"teacher_disagreement_score":0.001258441,"about_ca_system_score_codex":0.0003290344,"about_ca_system_score_gemma":0.0002573701,"threshold_uncertainty_score":0.004209876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057640664,0.00316585,0.9209342,0.0038868398,0.0002212014,0.000049939645,0.00006558291,0.0002639002,0.013771886],"genre_scores_gemma":[0.86970985,0.0017389915,0.12257704,0.00046727096,0.00013850103,0.00004205733,0.000093104274,0.000032964464,0.0052001923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998884,0.00003673983,0.0000019781744,0.000016124317,0.000021678032,0.00003497311],"domain_scores_gemma":[0.9998559,0.000050378418,0.0000144443575,0.000017364202,0.000035900564,0.000026094687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036588026,0.00027240408,0.0002510132,0.00013806438,0.00026958837,0.0006217589,0.00054292707,0.00054206117,0.0013296049],"category_scores_gemma":[0.0007099329,0.000114322356,0.00014495151,0.00031415094,0.0003516437,0.0010090542,0.00075278373,0.00051858416,0.00020567376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020445665,0.000097155025,0.0028764622,0.00016392463,0.00007486281,0.00028447132,0.00021284423,0.46935698,0.009268572,0.09650128,0.011332281,0.40962675],"study_design_scores_gemma":[0.00002767037,0.00013320529,0.0007326665,0.00003960775,0.000035460944,0.00023755609,0.000303507,0.94078064,0.0031453893,0.032590162,0.02195735,0.000016800126],"about_ca_topic_score_codex":0.002246498,"about_ca_topic_score_gemma":0.005669051,"teacher_disagreement_score":0.002246498,"about_ca_system_score_codex":0.00036823546,"about_ca_system_score_gemma":0.00072097505,"threshold_uncertainty_score":0.0044668317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011444752,0.00074744434,0.9873449,0.00027692615,0.000058240952,0.000032150154,0.000057264344,0.00009143681,0.010247051],"genre_scores_gemma":[0.42485988,0.010954203,0.54200655,0.001953424,0.00093401247,0.00056669896,0.00038880866,0.0003983755,0.017937956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852824,0.00045577664,0.00006290147,0.00016987348,0.0006003442,0.00018295449],"domain_scores_gemma":[0.99742836,0.0014699668,0.00027964415,0.00019236238,0.000563325,0.00006622314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024833006,0.0016419229,0.0007871099,0.001198766,0.0007256537,0.0019552547,0.0016530275,0.0018981745,0.0061630923],"category_scores_gemma":[0.008981396,0.0005548926,0.0009800232,0.00164673,0.0017324035,0.0033891087,0.0015055306,0.002754891,0.0022577613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004929572,0.00004723196,0.00035037287,0.00027679952,0.00004485089,0.00034296158,0.00020934214,0.378522,0.013941573,0.5704624,0.006088565,0.029664554],"study_design_scores_gemma":[0.000010195217,0.00004295967,0.00016827509,0.00007263718,0.000016402975,0.00046512208,0.00006686541,0.8825689,0.002798472,0.106365435,0.0073819766,0.000042775948],"about_ca_topic_score_codex":0.0014605041,"about_ca_topic_score_gemma":0.0008562306,"teacher_disagreement_score":0.0061630923,"about_ca_system_score_codex":0.0015447873,"about_ca_system_score_gemma":0.001241902,"threshold_uncertainty_score":0.020617604},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011710443,0.006554505,0.0068943854,0.035042115,0.13807142,0.00044126928,0.0043455935,0.0032750827,0.8042046],"genre_scores_gemma":[0.005840423,0.0065042167,0.0016508828,0.011094877,0.023597464,0.00018855857,0.005275512,0.0007519414,0.94509625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790984,0.00018962043,0.00012696227,0.00023553587,0.0013001978,0.00023784436],"domain_scores_gemma":[0.9946136,0.00069291197,0.0002214839,0.00054093084,0.003003153,0.0009278533],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001515735,0.001290442,0.0011113394,0.0019332938,0.0017391895,0.0068841167,0.0014235474,0.0043352917,0.5679505],"category_scores_gemma":[0.00885468,0.00058901566,0.00056853256,0.0015408971,0.0005511884,0.002535461,0.0014104048,0.0048337593,0.5155456],"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.000041925512,0.000039042665,0.00007825653,0.0001026726,0.0000056753215,0.00007663525,0.000008602699,0.00007022367,0.00033647494,0.0014534283,0.95356494,0.044222105],"study_design_scores_gemma":[0.000019173176,0.000030126412,0.00018221754,0.000084303836,0.0000045532774,0.000096266616,0.000014785464,0.0002466238,0.00032993226,0.001086692,0.99789494,0.0000103856055],"about_ca_topic_score_codex":0.00085524196,"about_ca_topic_score_gemma":0.0017900723,"teacher_disagreement_score":0.4320495,"about_ca_system_score_codex":0.0015464703,"about_ca_system_score_gemma":0.0025870847,"threshold_uncertainty_score":0.6162662},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011710443,0.006554505,0.0068943854,0.035042115,0.13807142,0.00044126928,0.0043455935,0.0032750827,0.8042046],"genre_scores_gemma":[0.005840423,0.0065042167,0.0016508828,0.011094877,0.023597464,0.00018855857,0.005275512,0.0007519414,0.94509625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790984,0.00018962043,0.00012696227,0.00023553587,0.0013001978,0.00023784436],"domain_scores_gemma":[0.9946136,0.00069291197,0.0002214839,0.00054093084,0.003003153,0.0009278533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001515735,0.001290442,0.0011113394,0.0019332938,0.0017391895,0.0068841167,0.0014235474,0.0043352917,0.5679505],"category_scores_gemma":[0.00885468,0.00058901566,0.00056853256,0.0015408971,0.0005511884,0.002535461,0.0014104048,0.0048337593,0.5155456],"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.000041925512,0.000039042665,0.00007825653,0.0001026726,0.0000056753215,0.00007663525,0.000008602699,0.00007022367,0.00033647494,0.0014534283,0.95356494,0.044222105],"study_design_scores_gemma":[0.000019173176,0.000030126412,0.00018221754,0.000084303836,0.0000045532774,0.000096266616,0.000014785464,0.0002466238,0.00032993226,0.001086692,0.99789494,0.0000103856055],"about_ca_topic_score_codex":0.00085524196,"about_ca_topic_score_gemma":0.0017900723,"teacher_disagreement_score":0.5679505,"about_ca_system_score_codex":0.0015464703,"about_ca_system_score_gemma":0.0025870847,"threshold_uncertainty_score":0.6162662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025374936,0.00022984346,0.9709881,0.00021889586,0.00003562913,0.00005991326,0.00008914314,0.00015377837,0.0028497977],"genre_scores_gemma":[0.77593684,0.00053808873,0.21834141,0.00019069984,0.0000436295,0.00019732866,0.00045642836,0.00011171144,0.0041838214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.0002211092,0.000042984902,0.0001647808,0.0001637386,0.00012887534],"domain_scores_gemma":[0.9994629,0.00027466894,0.00005296506,0.00007518031,0.00009413237,0.00004013148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962214,0.0010627037,0.0011202343,0.0005678353,0.00066482613,0.0013987109,0.0013298348,0.0009972816,0.0020521863],"category_scores_gemma":[0.0021811489,0.00042844302,0.000991941,0.0011844931,0.00055423396,0.0029016535,0.0018264081,0.0010220975,0.0003768243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017202045,0.00010119102,0.0009835961,0.0001733521,0.000043784323,0.00033598742,0.00014607683,0.89280516,0.0055864234,0.028274348,0.0028856387,0.06849238],"study_design_scores_gemma":[0.00000552174,0.000024064553,0.00008561938,0.0000066398025,0.000010056896,0.00006599995,0.00005598635,0.98714,0.0010379651,0.010792713,0.0007682825,0.000007164045],"about_ca_topic_score_codex":0.0020224622,"about_ca_topic_score_gemma":0.0026882258,"teacher_disagreement_score":0.0020521863,"about_ca_system_score_codex":0.00077534816,"about_ca_system_score_gemma":0.0012908144,"threshold_uncertainty_score":0.006865263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7699167,0.0009081516,0.2153048,0.00051251735,0.0001602408,0.00002836384,0.00014800868,0.00035100288,0.01267017],"genre_scores_gemma":[0.997503,0.00012388625,0.0018415329,0.00001787493,0.000009166253,0.000003058267,0.000016744081,0.0000069278653,0.000477883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953103,0.00011255424,0.000016934164,0.000054553846,0.00019706636,0.00008789104],"domain_scores_gemma":[0.9984969,0.00080182013,0.00023962445,0.00012685123,0.00028888657,0.0000459871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040417022,0.0004781076,0.00029059272,0.00021098342,0.0002534986,0.00045143283,0.00023554308,0.00037406728,0.0008415707],"category_scores_gemma":[0.0021950242,0.00013970799,0.00015090157,0.00026126255,0.00040659696,0.00055351254,0.00052745,0.00041224126,0.00012777929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002660796,0.000050148872,0.0063315267,0.00012703495,0.00006675235,0.00058811944,0.00012726049,0.925968,0.029548703,0.0069900122,0.0007534429,0.029182939],"study_design_scores_gemma":[0.000006670015,0.0002150006,0.00555539,0.000021474087,0.00003922983,0.00018668178,0.00010370893,0.9758288,0.015844632,0.0013750349,0.00080666994,0.000016685577],"about_ca_topic_score_codex":0.0025814173,"about_ca_topic_score_gemma":0.0026836297,"teacher_disagreement_score":0.0025814173,"about_ca_system_score_codex":0.0003955546,"about_ca_system_score_gemma":0.00057139277,"threshold_uncertainty_score":0.0051327944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028536852,0.00022434199,0.9689201,0.00009941453,0.000014304523,0.000026313957,0.000013491685,0.00006432878,0.0021008267],"genre_scores_gemma":[0.89325625,0.00014267143,0.105626166,0.00008878046,0.000021976233,0.000057245747,0.000018491553,0.00001904718,0.00076936325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.00024619026,0.00002174602,0.00010754373,0.00018092044,0.00009891005],"domain_scores_gemma":[0.9993678,0.0003828482,0.00007569804,0.00007415247,0.000062428706,0.000037110458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008655261,0.0005930439,0.0006173922,0.00031674086,0.00041078433,0.00078413077,0.0009421513,0.0006386614,0.0008797814],"category_scores_gemma":[0.0017638676,0.00031990797,0.00031092277,0.0004883168,0.0009909052,0.0011580139,0.0012752241,0.00077645725,0.00017363683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027864246,0.00019108708,0.00070545665,0.00014446807,0.000057456775,0.00017548671,0.00028139542,0.7821451,0.035874307,0.07045322,0.0013557853,0.10833753],"study_design_scores_gemma":[0.000008869275,0.000049018014,0.000101593556,0.0000054026386,0.0000052208097,0.000051839048,0.000028383307,0.9860525,0.002012215,0.011280478,0.0003967176,0.000007720361],"about_ca_topic_score_codex":0.00084497686,"about_ca_topic_score_gemma":0.0014583915,"teacher_disagreement_score":0.0009421513,"about_ca_system_score_codex":0.0005168476,"about_ca_system_score_gemma":0.00075604627,"threshold_uncertainty_score":0.0045773387},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011710443,0.006554505,0.0068943854,0.035042115,0.13807142,0.00044126928,0.0043455935,0.0032750827,0.8042046],"genre_scores_gemma":[0.005840423,0.0065042167,0.0016508828,0.011094877,0.023597464,0.00018855857,0.005275512,0.0007519414,0.94509625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790984,0.00018962043,0.00012696227,0.00023553587,0.0013001978,0.00023784436],"domain_scores_gemma":[0.9946136,0.00069291197,0.0002214839,0.00054093084,0.003003153,0.0009278533],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001515735,0.001290442,0.0011113394,0.0019332938,0.0017391895,0.0068841167,0.0014235474,0.0043352917,0.5679505],"category_scores_gemma":[0.00885468,0.00058901566,0.00056853256,0.0015408971,0.0005511884,0.002535461,0.0014104048,0.0048337593,0.5155456],"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.000041925512,0.000039042665,0.00007825653,0.0001026726,0.0000056753215,0.00007663525,0.000008602699,0.00007022367,0.00033647494,0.0014534283,0.95356494,0.044222105],"study_design_scores_gemma":[0.000019173176,0.000030126412,0.00018221754,0.000084303836,0.0000045532774,0.000096266616,0.000014785464,0.0002466238,0.00032993226,0.001086692,0.99789494,0.0000103856055],"about_ca_topic_score_codex":0.00085524196,"about_ca_topic_score_gemma":0.0017900723,"teacher_disagreement_score":0.4320495,"about_ca_system_score_codex":0.0015464703,"about_ca_system_score_gemma":0.0025870847,"threshold_uncertainty_score":0.6162662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046004704,0.00043138466,0.99218154,0.0002762298,0.00005728718,0.000032819265,0.00004612646,0.00010940485,0.0022647302],"genre_scores_gemma":[0.6591395,0.0019615164,0.32972872,0.0005388774,0.00033073846,0.00026653707,0.00025537994,0.00007674949,0.007702024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00023419481,0.000024409175,0.00010817854,0.00033381797,0.0000699898],"domain_scores_gemma":[0.99871755,0.0008006813,0.00010154669,0.000113069604,0.00023220674,0.000035039124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778021,0.00067504693,0.00046547878,0.0004994386,0.0003241548,0.0007211943,0.00097232114,0.0006484576,0.0024761446],"category_scores_gemma":[0.0029058824,0.00022655012,0.00038346046,0.0008001614,0.00076357345,0.0012827152,0.0008771201,0.0012673693,0.00039069695],"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.00023456464,0.00007672335,0.0006044026,0.0002959296,0.00007411573,0.00028306796,0.00022403777,0.5535967,0.017854536,0.28871703,0.0045113782,0.13352762],"study_design_scores_gemma":[0.000006339434,0.00004111228,0.00006317571,0.00001021662,0.0000058878177,0.00007869156,0.000013705053,0.9844893,0.0016819622,0.012098192,0.0015015039,0.00000981034],"about_ca_topic_score_codex":0.002092207,"about_ca_topic_score_gemma":0.0019714378,"teacher_disagreement_score":0.0024761446,"about_ca_system_score_codex":0.00076224445,"about_ca_system_score_gemma":0.001009573,"threshold_uncertainty_score":0.0082835555},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32010496,0.0006414243,0.66910887,0.00049921527,0.00006106288,0.00010450269,0.000051207564,0.000121909485,0.009306828],"genre_scores_gemma":[0.99254143,0.00007961424,0.006484758,0.00002762727,0.000010506138,0.000020445712,0.000004599853,0.0000058065575,0.0008252035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.0005092207,0.000028673006,0.000116946874,0.00014171748,0.00028017064],"domain_scores_gemma":[0.99901676,0.00059811317,0.00012490316,0.00005677998,0.00010852085,0.00009493562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172956,0.00066747057,0.0007890806,0.00038760118,0.00048439568,0.0011321537,0.0009786917,0.00086677936,0.0013126376],"category_scores_gemma":[0.0027886396,0.0003071832,0.0003699058,0.00061020313,0.0010645168,0.0014677325,0.001358568,0.00056236057,0.0001506375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049967354,0.00013288138,0.0016709721,0.00009252362,0.000072744835,0.0005662818,0.00013641243,0.9165814,0.012975387,0.043273963,0.0006409859,0.023356723],"study_design_scores_gemma":[0.0000183573,0.00008130019,0.00022699425,0.0000041190847,0.00001690541,0.000084443825,0.00006861549,0.9920345,0.001454781,0.0057776044,0.00022353898,0.0000088128445],"about_ca_topic_score_codex":0.0017963303,"about_ca_topic_score_gemma":0.0017083163,"teacher_disagreement_score":0.0017963303,"about_ca_system_score_codex":0.0008388906,"about_ca_system_score_gemma":0.00070354895,"threshold_uncertainty_score":0.006203294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005106151,0.00029904745,0.98409665,0.00030009254,0.0002954403,0.000083556624,0.00026669,0.0013521735,0.008200158],"genre_scores_gemma":[0.05632636,0.00031921704,0.9254779,0.00032612655,0.00012956285,0.000226303,0.0012055705,0.0004397543,0.01554912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989994,0.0001533185,0.0000622629,0.0001523151,0.0004919057,0.00014069967],"domain_scores_gemma":[0.99934703,0.000121765035,0.000032871623,0.0001944848,0.00025950666,0.000044407367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055220356,0.00085242896,0.0010123396,0.0013879944,0.0006820367,0.001536842,0.0017053158,0.0010060574,0.012908182],"category_scores_gemma":[0.0023889134,0.00033371372,0.0010559296,0.0018411531,0.000669435,0.0012295715,0.0022429908,0.001352313,0.009101941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053689745,0.00016647288,0.0010628563,0.00030430325,0.00009363519,0.00030103262,0.00019532956,0.07078825,0.01671476,0.115084924,0.041467585,0.753284],"study_design_scores_gemma":[0.00010705169,0.00008737254,0.0003290149,0.000038204253,0.000027643006,0.0003925955,0.00006110486,0.8971929,0.015079328,0.038916964,0.04771263,0.00005520806],"about_ca_topic_score_codex":0.0035684996,"about_ca_topic_score_gemma":0.005000683,"teacher_disagreement_score":0.012908182,"about_ca_system_score_codex":0.000833353,"about_ca_system_score_gemma":0.0023950292,"threshold_uncertainty_score":0.043182194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24046998,0.0002712535,0.7565455,0.0001575426,0.00003642664,0.000012479015,0.000009496043,0.0004491097,0.0020482172],"genre_scores_gemma":[0.9705528,0.000051291354,0.028815212,0.000026342293,0.0000085951715,0.000009346321,0.0000064176993,0.000007052632,0.0005229589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998884,0.000032235672,0.0000042272145,0.000026190151,0.00002957209,0.000019361325],"domain_scores_gemma":[0.9998332,0.000071478695,0.000036731253,0.000024957499,0.000024373408,0.000009234125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014975756,0.00033456075,0.00023055113,0.00013335247,0.00013848512,0.00027595865,0.00043723357,0.00031297846,0.000281001],"category_scores_gemma":[0.00041156274,0.0001409601,0.00019104837,0.0001545771,0.00044927583,0.000491504,0.00044629793,0.00027396213,0.00009680244],"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.0002742002,0.00005743817,0.002646631,0.00011908381,0.00005138355,0.00044079503,0.00033880046,0.53914255,0.27674955,0.006269608,0.0005008151,0.17340921],"study_design_scores_gemma":[0.000009786992,0.00017359562,0.00039126512,0.0000049254113,0.000012543615,0.00007377166,0.000042073607,0.97302306,0.024142066,0.0013517551,0.00076574076,0.0000094360375],"about_ca_topic_score_codex":0.00057048694,"about_ca_topic_score_gemma":0.00062799617,"teacher_disagreement_score":0.00057048694,"about_ca_system_score_codex":0.00017529003,"about_ca_system_score_gemma":0.00016907202,"threshold_uncertainty_score":0.0012719035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027361859,0.00021676318,0.96975887,0.00016930854,0.000018509085,0.000030464886,0.000030363108,0.00015046036,0.002263306],"genre_scores_gemma":[0.88153195,0.00032256916,0.11604006,0.00005891238,0.000039847895,0.00008674892,0.0000416871,0.000051218827,0.0018270302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937963,0.00020722854,0.000023686147,0.000076968274,0.00019810503,0.000114311355],"domain_scores_gemma":[0.9992994,0.00040279864,0.00010740328,0.00007196961,0.000095158386,0.000023158247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886239,0.00071008,0.000629698,0.00028756796,0.0002983294,0.00070905115,0.0005229787,0.00043436105,0.0010735844],"category_scores_gemma":[0.0024598062,0.00029121953,0.00024094546,0.0005588913,0.00066887826,0.0008306603,0.0006519548,0.0005689163,0.00017049538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104615,0.000043088898,0.00032159785,0.000053328793,0.000014827214,0.000049734837,0.000047480764,0.94751716,0.006320929,0.008862322,0.00061406445,0.03609438],"study_design_scores_gemma":[0.000003909035,0.00001795404,0.00008998106,0.0000031694906,0.0000029410246,0.000012972028,0.000010220816,0.99714595,0.0012921653,0.0011747293,0.00024224624,0.0000036889699],"about_ca_topic_score_codex":0.0024280376,"about_ca_topic_score_gemma":0.0036891375,"teacher_disagreement_score":0.0024280376,"about_ca_system_score_codex":0.00080281036,"about_ca_system_score_gemma":0.0012838953,"threshold_uncertainty_score":0.005824864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00621518,0.0014983177,0.98689204,0.00046853046,0.000037757163,0.000015203481,0.00006517882,0.00010478753,0.004703073],"genre_scores_gemma":[0.74334294,0.0066495608,0.24154608,0.0006712952,0.00039498048,0.0001604093,0.00036575113,0.00022940962,0.0066396347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971199,0.0007451445,0.00011014985,0.00046502164,0.0013674089,0.00019234489],"domain_scores_gemma":[0.99006313,0.0066576935,0.0010062571,0.00078094436,0.0013701792,0.00012183975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031784247,0.0010009034,0.0010458576,0.0018758113,0.00058239576,0.001968863,0.001405308,0.0015795805,0.0019984867],"category_scores_gemma":[0.02274762,0.0008612654,0.0007105322,0.0016631943,0.0022534775,0.003492656,0.0017283601,0.002006836,0.00070160854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089967,0.000057035148,0.0033872225,0.0003105856,0.00010427133,0.00017880133,0.00026189646,0.7217033,0.0073473025,0.19281012,0.0021442752,0.07160517],"study_design_scores_gemma":[0.0000093927265,0.000071454015,0.0019620946,0.00010318486,0.000027606155,0.00021605167,0.000060585822,0.93552494,0.0031309584,0.055650562,0.003180346,0.000062871564],"about_ca_topic_score_codex":0.007856695,"about_ca_topic_score_gemma":0.0068313433,"teacher_disagreement_score":0.007856695,"about_ca_system_score_codex":0.0014481312,"about_ca_system_score_gemma":0.0021021822,"threshold_uncertainty_score":0.016809285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032562718,0.00010327749,0.96592426,0.000102088874,0.000027957974,0.000014736555,0.000020223826,0.0002855251,0.000959173],"genre_scores_gemma":[0.91422474,0.00006548952,0.08410601,0.0001171568,0.000031623153,0.000027906293,0.000053642485,0.00001984793,0.001353621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958545,0.00009216132,0.00001790849,0.00012246124,0.00010047175,0.00008161147],"domain_scores_gemma":[0.9993893,0.00024997393,0.00010343356,0.00009022737,0.00012209172,0.000044936194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007341596,0.00047708084,0.00052269443,0.00036211405,0.00033212866,0.0005469736,0.00089198054,0.0008344404,0.0005736483],"category_scores_gemma":[0.00177106,0.0001799216,0.0003691565,0.0003223907,0.00072061445,0.0010395587,0.0010880801,0.00067935546,0.00014599059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019112634,0.00008714916,0.001844711,0.00005560996,0.000055723514,0.00018312014,0.000092605915,0.81431615,0.016650762,0.010604494,0.0007878878,0.15513067],"study_design_scores_gemma":[0.0000024200883,0.000024058982,0.00013560263,0.0000018869358,0.000003819014,0.000025239602,0.000009387594,0.9957547,0.0017823261,0.0020559388,0.00020121144,0.0000034210575],"about_ca_topic_score_codex":0.0018479141,"about_ca_topic_score_gemma":0.0022971674,"teacher_disagreement_score":0.0018479141,"about_ca_system_score_codex":0.0004631399,"about_ca_system_score_gemma":0.0006129868,"threshold_uncertainty_score":0.0038827062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16930452,0.004000585,0.74505395,0.0009058048,0.0002604745,0.00005367823,0.00019911595,0.0010651752,0.07915665],"genre_scores_gemma":[0.96797043,0.0022886489,0.026390417,0.00018456399,0.000117769785,0.000039692393,0.00006832725,0.00015948268,0.0027806782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992478,0.00017574843,0.00001719649,0.00012193515,0.00033999974,0.00009748218],"domain_scores_gemma":[0.99522436,0.0038406104,0.00027810253,0.00029097183,0.00031528235,0.000050737894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007591864,0.0009170753,0.00061612565,0.00044631772,0.00033363482,0.0009246873,0.0005020672,0.0006036383,0.0030609523],"category_scores_gemma":[0.006617568,0.00026646414,0.00037188552,0.00047114852,0.0012791168,0.002053598,0.0010210678,0.0009448765,0.0008461205],"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.0003745389,0.00008143984,0.001577191,0.0005071497,0.00005444717,0.0009349143,0.00035574037,0.54646105,0.23811397,0.15789653,0.0017070473,0.051935975],"study_design_scores_gemma":[0.000012156755,0.00013288303,0.0013866922,0.0000775437,0.000046983496,0.00072713726,0.00011697288,0.91617155,0.05692013,0.021631867,0.0027157534,0.000060270042],"about_ca_topic_score_codex":0.0010068364,"about_ca_topic_score_gemma":0.0008552941,"teacher_disagreement_score":0.0030609523,"about_ca_system_score_codex":0.0006788529,"about_ca_system_score_gemma":0.00044074887,"threshold_uncertainty_score":0.010239959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009738122,0.00014257722,0.9893327,0.000045809637,0.000019011837,0.000022425958,0.000016741827,0.00027374164,0.00040887957],"genre_scores_gemma":[0.3021138,0.0003235811,0.6962045,0.00010159607,0.000054273838,0.00010166257,0.00011357038,0.000056491648,0.0009305468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983069,0.00050713914,0.000106034124,0.00025070994,0.0006973303,0.0001318421],"domain_scores_gemma":[0.99723804,0.0012288722,0.0006024214,0.00035246866,0.00050178106,0.00007640256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016444527,0.0012893915,0.0010767807,0.00076397706,0.00050561246,0.0011211049,0.0009089014,0.00086528773,0.0008484142],"category_scores_gemma":[0.007639607,0.00049104483,0.00042754665,0.0007403903,0.0009301304,0.0019169918,0.0012177165,0.0010448128,0.0005247199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094177196,0.00015028284,0.0022314107,0.0003047238,0.00010157072,0.0002023981,0.0003885977,0.37617767,0.07716235,0.045332994,0.0022646124,0.4947416],"study_design_scores_gemma":[0.000023104943,0.00006196692,0.0003087041,0.000016942413,0.000010644782,0.0001286404,0.00001561581,0.96732986,0.025280569,0.0059922407,0.0007995035,0.00003224747],"about_ca_topic_score_codex":0.0010185776,"about_ca_topic_score_gemma":0.0008131388,"teacher_disagreement_score":0.0016444527,"about_ca_system_score_codex":0.00072163536,"about_ca_system_score_gemma":0.0013818317,"threshold_uncertainty_score":0.0086967945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008352769,0.00028382018,0.98828924,0.00023940705,0.000053171614,0.000044707995,0.000044514672,0.00051578245,0.0021765358],"genre_scores_gemma":[0.7614161,0.00068562926,0.23429568,0.00028734305,0.0002153691,0.00023074748,0.00016449172,0.0002777894,0.0024268464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820626,0.00052311434,0.00011330741,0.0003284558,0.0005500138,0.0002788597],"domain_scores_gemma":[0.9952225,0.0023134856,0.0004353532,0.0009387465,0.00087222777,0.00021765823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028008777,0.0014488361,0.0010780401,0.0015171625,0.0010255293,0.002085199,0.0024483674,0.0011031785,0.0022791387],"category_scores_gemma":[0.009150039,0.0004480031,0.00068664306,0.0011191298,0.0022596386,0.005105236,0.0033229569,0.0019014458,0.00051934225],"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.0004192694,0.000234995,0.00093651674,0.00035088914,0.00010978082,0.00030814836,0.00057654164,0.56038177,0.030332707,0.22948849,0.00473447,0.1721264],"study_design_scores_gemma":[0.0000144074,0.00010788622,0.000122015466,0.000027588136,0.000049382088,0.000087820525,0.00007849129,0.92118293,0.008416222,0.06706468,0.0028093483,0.000039217713],"about_ca_topic_score_codex":0.0026348399,"about_ca_topic_score_gemma":0.0020569859,"teacher_disagreement_score":0.0028008777,"about_ca_system_score_codex":0.0013782457,"about_ca_system_score_gemma":0.0028088053,"threshold_uncertainty_score":0.014812648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1721274,0.00022365765,0.8162779,0.0003621898,0.00004930121,0.00009063566,0.0001073805,0.00061321456,0.010148254],"genre_scores_gemma":[0.9022208,0.00008586975,0.095418215,0.00004541455,0.0000122839265,0.00008706593,0.00007800462,0.000040313455,0.0020120495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994795,0.00016425377,0.00001752085,0.00013249564,0.000106240506,0.00009995384],"domain_scores_gemma":[0.99930084,0.0003557958,0.00007961119,0.00012819457,0.000057524292,0.000078030134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044778132,0.0008243227,0.0006283569,0.00030356468,0.0004016062,0.001031971,0.0011282972,0.0011030923,0.0027429275],"category_scores_gemma":[0.0015183099,0.0003454758,0.0004564127,0.00035861813,0.00086562335,0.0009243156,0.0011973178,0.0007347752,0.0004558492],"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.00012780457,0.000055120872,0.0007460426,0.000082982995,0.000022437876,0.00025979898,0.000058547972,0.95025146,0.013694742,0.010506619,0.00058408023,0.023610462],"study_design_scores_gemma":[0.000015025663,0.000103372004,0.00022067924,0.0000051804977,0.00000871244,0.00008012636,0.00005063888,0.98892117,0.004459342,0.0054647895,0.0006577122,0.000013154577],"about_ca_topic_score_codex":0.0011818762,"about_ca_topic_score_gemma":0.0011997643,"teacher_disagreement_score":0.0027429275,"about_ca_system_score_codex":0.00070797285,"about_ca_system_score_gemma":0.0005249435,"threshold_uncertainty_score":0.009175956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030794512,0.00032405744,0.9659363,0.00033337175,0.000039149767,0.00004342859,0.000020375235,0.00015077977,0.002358046],"genre_scores_gemma":[0.91836625,0.00017268799,0.078085266,0.00024877838,0.000037080896,0.00012901654,0.00005616226,0.000035225574,0.0028695206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.0001236021,0.0000118477155,0.000051999763,0.00006140582,0.00005659203],"domain_scores_gemma":[0.99930835,0.0004250315,0.00007145051,0.000022190914,0.00012723771,0.000045747645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011149559,0.0006183046,0.0008392072,0.00026268224,0.00031080956,0.00048467258,0.000874721,0.00089775934,0.0015125393],"category_scores_gemma":[0.0016568201,0.00034871214,0.00040644774,0.00023005683,0.0005467706,0.0006161765,0.00071644434,0.0010758169,0.00016601346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040671406,0.00004213891,0.00056557765,0.00002897803,0.000024987414,0.000049516522,0.00003471019,0.97491336,0.0007894361,0.0024873791,0.0004708778,0.020552471],"study_design_scores_gemma":[0.0000035698467,0.0000071127974,0.000021777056,0.0000010486775,0.0000013825736,0.0000018865326,0.0000015432257,0.9995957,0.000040869538,0.00028330044,0.000040961157,8.9681123e-7],"about_ca_topic_score_codex":0.006902351,"about_ca_topic_score_gemma":0.004475156,"teacher_disagreement_score":0.006902351,"about_ca_system_score_codex":0.0007138766,"about_ca_system_score_gemma":0.0010100055,"threshold_uncertainty_score":0.013724327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012927652,0.000109961715,0.98552334,0.000048118953,0.000019509478,0.000023155775,0.000019362695,0.00017064647,0.001158209],"genre_scores_gemma":[0.50868577,0.00035743898,0.48700273,0.00013704838,0.00007899458,0.000114133276,0.00012662941,0.00004011846,0.0034571744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996252,0.000091458474,0.000017181048,0.000071045506,0.00015204771,0.000043047778],"domain_scores_gemma":[0.99962604,0.00014923741,0.0000542044,0.00006577298,0.00008553401,0.000019186702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768367,0.0008315722,0.00043618257,0.00029920728,0.00030424527,0.00044341624,0.0005708386,0.00042858906,0.001393012],"category_scores_gemma":[0.0008493962,0.00034066458,0.00041944173,0.0003051019,0.00046021835,0.0009835256,0.00085031084,0.00076775684,0.00043073157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055430597,0.00014796111,0.0022751896,0.00029690156,0.00014654348,0.00039330646,0.0003585164,0.36923486,0.16344258,0.030243143,0.0019776144,0.43092915],"study_design_scores_gemma":[0.000019684188,0.0001627358,0.00041062108,0.000010166749,0.000021344194,0.00014089842,0.000027419952,0.97016865,0.024956178,0.0025184986,0.0015386159,0.00002513431],"about_ca_topic_score_codex":0.0010503988,"about_ca_topic_score_gemma":0.0023879951,"teacher_disagreement_score":0.001393012,"about_ca_system_score_codex":0.00021758053,"about_ca_system_score_gemma":0.0005997124,"threshold_uncertainty_score":0.0046601295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13572109,0.00045279652,0.8582697,0.00026183994,0.00007710093,0.00004710991,0.000049541024,0.00038317384,0.0047376542],"genre_scores_gemma":[0.9791965,0.00007111891,0.019920558,0.000055743832,0.000011563015,0.000016041751,0.00002062693,0.000021730375,0.0006861616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998293,0.000033307573,0.0000060170973,0.000041339823,0.00003084012,0.000059230228],"domain_scores_gemma":[0.99978215,0.00009329058,0.000023537217,0.000021733105,0.000039058938,0.00004029688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031612813,0.00062476617,0.0005589502,0.00020447513,0.0003673426,0.0005485772,0.00071085594,0.00037822858,0.0008970393],"category_scores_gemma":[0.00078758225,0.00020949643,0.00024271925,0.00022320876,0.00049021374,0.000716862,0.0007019476,0.0005599679,0.00008911899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013088637,0.000045695408,0.0009998084,0.000034253404,0.000020810581,0.00014662971,0.00006533515,0.9533538,0.0052063502,0.0075326418,0.00092863565,0.031535182],"study_design_scores_gemma":[0.0000019641016,0.000010150059,0.00005314762,0.0000011616094,0.0000020593561,0.0000070004326,0.0000056877407,0.9984988,0.00030852837,0.0010282196,0.00008164552,0.000001738336],"about_ca_topic_score_codex":0.0061065936,"about_ca_topic_score_gemma":0.007406936,"teacher_disagreement_score":0.0061065936,"about_ca_system_score_codex":0.0006422392,"about_ca_system_score_gemma":0.0008464907,"threshold_uncertainty_score":0.012142062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059403744,0.0007494123,0.93043745,0.0006730482,0.00011674072,0.000045667646,0.000058683403,0.0003159793,0.00819928],"genre_scores_gemma":[0.96576524,0.00014935226,0.03124533,0.00013976607,0.000032642183,0.00004296515,0.000038751168,0.000023016371,0.002562878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998066,0.000054430948,0.000005641888,0.000039100814,0.000033931552,0.000060303773],"domain_scores_gemma":[0.9995608,0.00022548679,0.00005886366,0.000026168564,0.00008913622,0.000039504645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637957,0.0007650688,0.0007582042,0.00022698492,0.0003034744,0.00061549153,0.00071233907,0.00093358284,0.0012612963],"category_scores_gemma":[0.001393221,0.00025943763,0.00027989192,0.00025442187,0.00057942944,0.00052491546,0.0007806657,0.0010614739,0.0002066846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035885336,0.000024777572,0.00040349917,0.000022821336,0.000013729826,0.000053147996,0.000020973814,0.98132634,0.0007281974,0.003790352,0.0005742344,0.013006114],"study_design_scores_gemma":[0.0000024442113,0.000011606262,0.000027968996,0.0000017575402,0.000001811177,0.0000045387883,0.0000033268386,0.99914515,0.00008723486,0.00060815475,0.0001048242,0.0000011635846],"about_ca_topic_score_codex":0.006355173,"about_ca_topic_score_gemma":0.005819651,"teacher_disagreement_score":0.006355173,"about_ca_system_score_codex":0.00058612064,"about_ca_system_score_gemma":0.0011013462,"threshold_uncertainty_score":0.0126363635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026042338,0.0003831626,0.9700143,0.00015454755,0.00004145517,0.000027793862,0.00007187431,0.00012409782,0.0031403396],"genre_scores_gemma":[0.8302127,0.0004971902,0.16566268,0.00014799688,0.000043350337,0.000053754484,0.0001043913,0.000022180306,0.003255762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00015999265,0.000025019472,0.00009320024,0.0001718936,0.00006407808],"domain_scores_gemma":[0.99934584,0.000347316,0.00007056425,0.00007009221,0.00014575907,0.00002039716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049427757,0.00057742896,0.00068319857,0.00016307877,0.00025081754,0.0010625826,0.00048083594,0.00058933854,0.0013264997],"category_scores_gemma":[0.0018422692,0.0003388355,0.00023012001,0.00049191056,0.0007494357,0.0009074909,0.00059018226,0.00060644955,0.0003213486],"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.00011691359,0.00003477074,0.0004220165,0.00010692913,0.000030066782,0.00010164305,0.00008496807,0.9379117,0.011742805,0.019552361,0.00079483836,0.029100921],"study_design_scores_gemma":[0.000015232904,0.000056218385,0.000084516534,0.000010033893,0.000007631199,0.000041645533,0.000025647649,0.9920975,0.0033353763,0.0038464982,0.00047002983,0.000009674048],"about_ca_topic_score_codex":0.0026579974,"about_ca_topic_score_gemma":0.003374689,"teacher_disagreement_score":0.0026579974,"about_ca_system_score_codex":0.0005562187,"about_ca_system_score_gemma":0.00093896285,"threshold_uncertainty_score":0.0052850842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017642722,0.00024195135,0.9782426,0.00013837856,0.000051923544,0.000059235477,0.00009282557,0.00033608632,0.0031943778],"genre_scores_gemma":[0.7189921,0.00030849173,0.27666014,0.00016367949,0.00008510487,0.00019077143,0.00024294833,0.0000906029,0.0032661494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999236,0.00025193865,0.00003693254,0.000095014875,0.00025236234,0.00012776912],"domain_scores_gemma":[0.9985057,0.0005606843,0.00014549271,0.00018849052,0.00047511628,0.00012447429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072511804,0.0007218688,0.0007665086,0.00033503695,0.00042881301,0.0007854163,0.0012038826,0.00050470216,0.0033374084],"category_scores_gemma":[0.0032096377,0.0003309289,0.00025329352,0.00075937924,0.0005542403,0.00076473755,0.0010043412,0.00075569935,0.0011075479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050714734,0.00013350045,0.0015957467,0.0001944813,0.000050252667,0.0002682199,0.0003157059,0.71114135,0.05046065,0.05279028,0.00847825,0.1740643],"study_design_scores_gemma":[0.00003244844,0.00009710383,0.00012596513,0.0000077125105,0.0000064659775,0.000072768686,0.00003102888,0.989659,0.004499172,0.0039093974,0.0015428677,0.000016155982],"about_ca_topic_score_codex":0.0032368246,"about_ca_topic_score_gemma":0.005189191,"teacher_disagreement_score":0.0033374084,"about_ca_system_score_codex":0.0008161865,"about_ca_system_score_gemma":0.0016890022,"threshold_uncertainty_score":0.011164784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16589503,0.00029423911,0.8262635,0.00015671948,0.000047156354,0.000063390544,0.000083145664,0.0005030788,0.0066937385],"genre_scores_gemma":[0.6322993,0.00026517143,0.36429763,0.000077007295,0.000017220249,0.00006331476,0.00012303876,0.000063399406,0.002793983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998215,0.000045769655,0.0000067011065,0.000019305768,0.00007961378,0.000027194435],"domain_scores_gemma":[0.99972385,0.00011879532,0.00004709803,0.000021230038,0.00007949775,0.000009597387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022217516,0.00039291746,0.00019645967,0.00028775088,0.00022075196,0.0003472524,0.00029144756,0.00028448025,0.00081773056],"category_scores_gemma":[0.00073749915,0.0001194151,0.0001669849,0.0003262591,0.00023366458,0.0002675129,0.00028190907,0.00032978153,0.00027552148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024855844,0.00006302091,0.0013270612,0.00013995568,0.000033218494,0.00020677029,0.00014744463,0.69480413,0.12434229,0.040751353,0.0011359159,0.13680029],"study_design_scores_gemma":[0.00003378359,0.00017032189,0.0002188591,0.000011664089,0.000014228448,0.000096565025,0.000028905593,0.95164007,0.041778322,0.0039339736,0.0020606865,0.000012617205],"about_ca_topic_score_codex":0.0014335751,"about_ca_topic_score_gemma":0.0030331193,"teacher_disagreement_score":0.0014335751,"about_ca_system_score_codex":0.00036809297,"about_ca_system_score_gemma":0.0010299997,"threshold_uncertainty_score":0.0028504133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0946856,0.000667898,0.8872451,0.0015174963,0.00012226921,0.000087779845,0.00012728022,0.0002055285,0.015341078],"genre_scores_gemma":[0.86249125,0.00026811345,0.13224839,0.00026301696,0.000037617297,0.00008919681,0.00006960726,0.00009419013,0.0044385786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999647,0.00013530225,0.0000093795215,0.00005511841,0.0000710579,0.00008214906],"domain_scores_gemma":[0.9992453,0.0005256091,0.000060434242,0.00004336044,0.00007790854,0.000047442798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316942,0.00055345584,0.0008001811,0.00029564125,0.0004446382,0.0011821521,0.0006865557,0.00116221,0.0037060378],"category_scores_gemma":[0.002577923,0.00042560473,0.00044469416,0.0004895026,0.001077652,0.001184122,0.0008567399,0.0012458231,0.00029179483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053769087,0.000025568472,0.00015242326,0.000044363664,0.000011441441,0.00003634456,0.000020350271,0.9591349,0.0010068857,0.032031484,0.00086269906,0.0066198474],"study_design_scores_gemma":[0.0000065801682,0.000013040382,0.00003914333,0.0000034964544,0.0000020569028,0.0000073581114,0.000010844054,0.98916036,0.00020697483,0.01025462,0.00029279882,0.0000026529601],"about_ca_topic_score_codex":0.0032177689,"about_ca_topic_score_gemma":0.003801109,"teacher_disagreement_score":0.0037060378,"about_ca_system_score_codex":0.0016392728,"about_ca_system_score_gemma":0.0014741684,"threshold_uncertainty_score":0.012397945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03757184,0.00032647807,0.9588879,0.00033018476,0.00005271024,0.000025421907,0.00002968128,0.00028153646,0.0024942202],"genre_scores_gemma":[0.9622362,0.00010325117,0.03498222,0.00017847333,0.000026736157,0.00003769241,0.00003296696,0.000029969102,0.0023724975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997793,0.000062087995,0.000007567192,0.000048050966,0.000049451228,0.00005361986],"domain_scores_gemma":[0.999401,0.000366798,0.000062600935,0.000030894218,0.000095412426,0.000043309912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082770205,0.0005957462,0.0006853774,0.00015103862,0.000244857,0.00045813993,0.0009492641,0.0007035824,0.0011710536],"category_scores_gemma":[0.0018093066,0.0002473925,0.00025170317,0.00021398424,0.00072989863,0.00068550865,0.0008387319,0.0010964872,0.00015211786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060764938,0.00004416529,0.00043356375,0.00003166681,0.0000205647,0.000059264952,0.000033823977,0.9627638,0.0017400576,0.00685375,0.0006377574,0.027320817],"study_design_scores_gemma":[0.0000032404032,0.0000093489425,0.00001969544,9.803089e-7,0.0000016204079,0.0000034142217,0.0000016956467,0.99848264,0.00014841619,0.0012552545,0.00007259169,0.0000011275155],"about_ca_topic_score_codex":0.004579582,"about_ca_topic_score_gemma":0.0048064487,"teacher_disagreement_score":0.004579582,"about_ca_system_score_codex":0.00075906125,"about_ca_system_score_gemma":0.00092505384,"threshold_uncertainty_score":0.009105861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057308685,0.00013414356,0.93612146,0.0002527154,0.000029945895,0.000045939967,0.00004725888,0.0012911286,0.0047687944],"genre_scores_gemma":[0.6176403,0.00006034396,0.37809902,0.00015121762,0.000021596807,0.000110412046,0.00016263824,0.00015555797,0.003598936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996878,0.00007500536,0.000009987379,0.000064770175,0.00011569261,0.00004669984],"domain_scores_gemma":[0.99948066,0.00028262832,0.000047207428,0.00005151218,0.00010158166,0.000036396992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046058418,0.0006211104,0.00069957715,0.00024015327,0.00041656394,0.0005439698,0.0008080636,0.000789404,0.0019078754],"category_scores_gemma":[0.0014470814,0.00034846787,0.0003721313,0.00031286923,0.0005863612,0.0006200272,0.00086806744,0.0009064556,0.0004355664],"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.00007924409,0.000040425126,0.000667874,0.000046757763,0.000017361132,0.00007833059,0.00007211831,0.94522506,0.00391028,0.006367303,0.0015596539,0.041935485],"study_design_scores_gemma":[0.0000037134423,0.000008515896,0.000046490666,7.143925e-7,6.56909e-7,0.000006294972,0.0000056073927,0.9988223,0.00028228379,0.000664142,0.00015781287,0.0000015130527],"about_ca_topic_score_codex":0.0078068455,"about_ca_topic_score_gemma":0.00856707,"teacher_disagreement_score":0.0078068455,"about_ca_system_score_codex":0.000641531,"about_ca_system_score_gemma":0.001368166,"threshold_uncertainty_score":0.015522778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025651164,0.00042617318,0.9682985,0.00020844494,0.00005974839,0.000024493856,0.000022538366,0.00041535663,0.0048936354],"genre_scores_gemma":[0.8349763,0.00027555093,0.15902883,0.00028817845,0.00007351077,0.000046340032,0.00004297191,0.000052837357,0.0052154367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982387,0.00004524986,0.000007983016,0.000025684869,0.00007422969,0.00002301975],"domain_scores_gemma":[0.9998301,0.00007294919,0.000014585577,0.000023698765,0.000047295733,0.000011350879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004125143,0.00026664586,0.00032099526,0.00021545294,0.0003086866,0.0004819347,0.0009721868,0.0005406376,0.0015140616],"category_scores_gemma":[0.0004496428,0.00017347217,0.00029554375,0.00020031368,0.0006254325,0.0008846637,0.0005857646,0.000545813,0.00027910818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016716929,0.0001709108,0.00085129467,0.00027500815,0.00012306464,0.00022853224,0.00017441175,0.54549235,0.07688159,0.17825636,0.0023352797,0.19504389],"study_design_scores_gemma":[0.0000038074006,0.000027189268,0.000055855406,0.0000029379198,0.0000040559576,0.000026964715,0.0000040973036,0.9882719,0.0046635307,0.0062441365,0.00068952783,0.0000060712023],"about_ca_topic_score_codex":0.0010089999,"about_ca_topic_score_gemma":0.0018342974,"teacher_disagreement_score":0.0015140616,"about_ca_system_score_codex":0.00050056126,"about_ca_system_score_gemma":0.0004931361,"threshold_uncertainty_score":0.0050649643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09206429,0.0051402645,0.87898993,0.00057885994,0.00053658517,0.00010999282,0.00011573368,0.0004540171,0.022010254],"genre_scores_gemma":[0.70794916,0.0030231904,0.2811415,0.00038234115,0.00048131484,0.00015278463,0.00016269284,0.00003983691,0.006667178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972504,0.000066455694,0.000019558911,0.00004230462,0.00010680173,0.00003989816],"domain_scores_gemma":[0.99973315,0.000073840005,0.000061058556,0.00005987113,0.000055850753,0.000016228683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028925572,0.00050902425,0.0004002933,0.00053448905,0.00037657126,0.0006229717,0.0006204158,0.00046822135,0.0014284335],"category_scores_gemma":[0.0006678047,0.000117664014,0.00028319834,0.0008867495,0.00045517963,0.0010514635,0.0005728722,0.0004962081,0.00053608627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058410695,0.00015373986,0.0015795015,0.00049081637,0.000078185476,0.00037246884,0.00032410718,0.029291756,0.2191121,0.18625581,0.003547487,0.55820996],"study_design_scores_gemma":[0.00014135925,0.0012492132,0.0014863138,0.00014616842,0.00014980661,0.0024578255,0.00014160294,0.6914709,0.15250729,0.04270746,0.10741002,0.00013201842],"about_ca_topic_score_codex":0.0002317094,"about_ca_topic_score_gemma":0.00040625813,"teacher_disagreement_score":0.0014284335,"about_ca_system_score_codex":0.0003420736,"about_ca_system_score_gemma":0.00027411603,"threshold_uncertainty_score":0.004778564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020506259,0.00013737401,0.9776047,0.00020891294,0.00003666265,0.000041954918,0.000026929363,0.0005191486,0.00091801496],"genre_scores_gemma":[0.8715076,0.00008375388,0.12574881,0.00031201725,0.00005080002,0.00010663603,0.00007254076,0.0000977829,0.002020117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844164,0.00058843114,0.000064170905,0.00033196746,0.00029457058,0.00027920332],"domain_scores_gemma":[0.99608576,0.002312094,0.0003165662,0.00053876074,0.00055323285,0.00019353961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043355245,0.0011959135,0.0016692559,0.00052368804,0.0008907919,0.0017638315,0.0022012135,0.0016093779,0.0017313253],"category_scores_gemma":[0.008915166,0.0004097926,0.00058453623,0.00071180024,0.0016565874,0.0025819624,0.0021732026,0.0020785232,0.00034026158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016782546,0.000095530726,0.0005970711,0.000032096832,0.000035435845,0.000043381235,0.000047715806,0.95110226,0.00079699757,0.007501166,0.00083488075,0.03874553],"study_design_scores_gemma":[0.00000507177,0.000013659046,0.000020821382,0.000001579359,0.0000020584898,0.000004666611,0.0000038379467,0.9959252,0.00021281137,0.0037447514,0.00006344016,0.0000021010349],"about_ca_topic_score_codex":0.0040797847,"about_ca_topic_score_gemma":0.004924433,"teacher_disagreement_score":0.0043355245,"about_ca_system_score_codex":0.0014105614,"about_ca_system_score_gemma":0.0024067196,"threshold_uncertainty_score":0.022928715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015906744,0.00005916681,0.9826566,0.000052215473,0.000018535547,0.000009402913,0.000027754179,0.00022257118,0.0010470672],"genre_scores_gemma":[0.8182267,0.00012702744,0.17950241,0.00009190518,0.00002733016,0.000028202308,0.000114118535,0.00006014955,0.0018222939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967945,0.00008729425,0.00001118554,0.000067836,0.000104794664,0.00004949677],"domain_scores_gemma":[0.99916697,0.00037081528,0.00008223147,0.0001959089,0.00013750144,0.000046665897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005975005,0.0004689034,0.0005053602,0.00032644137,0.00022697519,0.0006090411,0.0007826847,0.0004813704,0.0011312971],"category_scores_gemma":[0.0027290715,0.00027338107,0.00032132686,0.00038900579,0.00066093233,0.0011625716,0.00097507954,0.0009658999,0.00021687674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011826006,0.000024414376,0.000776779,0.00003524731,0.0000218016,0.000065847125,0.000053328135,0.92417264,0.0048977924,0.013671312,0.0006726614,0.05548992],"study_design_scores_gemma":[0.0000035881174,0.000010261063,0.00005429785,0.0000016522939,0.0000025689994,0.000017099921,0.000004692086,0.99628663,0.001082517,0.0023203045,0.00021315838,0.0000032092714],"about_ca_topic_score_codex":0.0032492727,"about_ca_topic_score_gemma":0.003968623,"teacher_disagreement_score":0.0032492727,"about_ca_system_score_codex":0.0004243224,"about_ca_system_score_gemma":0.0009528166,"threshold_uncertainty_score":0.0064607263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08697125,0.00046468634,0.90868586,0.00028906213,0.00004784794,0.00002403939,0.00004201349,0.000119972254,0.0033551867],"genre_scores_gemma":[0.9308365,0.00024012045,0.066444926,0.00011941259,0.000052530344,0.000042928514,0.00003096268,0.000036272166,0.0021964177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993924,0.00034582402,0.000014272916,0.00007761149,0.000105503306,0.00006435323],"domain_scores_gemma":[0.9994881,0.00035039432,0.00004325779,0.00003772026,0.00005531321,0.00002516625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068760046,0.0006641286,0.0006763816,0.00024481566,0.00040611002,0.00077172735,0.0006604286,0.000672815,0.00072270824],"category_scores_gemma":[0.0012176735,0.00033148748,0.00027759976,0.0004633525,0.00086537184,0.0009457411,0.00090209674,0.0006002663,0.00018248541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009637608,0.00003246837,0.00033190078,0.000053122763,0.00003546973,0.00010740605,0.00007672568,0.94916326,0.007828161,0.012465442,0.0006776855,0.029131953],"study_design_scores_gemma":[0.0000062398453,0.000035257897,0.00006112002,0.0000025335212,0.000004736275,0.000023766444,0.000023378218,0.9950153,0.00075706287,0.003829133,0.00023753541,0.000003819207],"about_ca_topic_score_codex":0.0017335552,"about_ca_topic_score_gemma":0.0019996539,"teacher_disagreement_score":0.0017335552,"about_ca_system_score_codex":0.00052928244,"about_ca_system_score_gemma":0.00048952433,"threshold_uncertainty_score":0.0038402677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011170607,0.00025256045,0.9826827,0.000099733916,0.000057649057,0.000041923628,0.000018565268,0.00027938277,0.005396964],"genre_scores_gemma":[0.71904093,0.000566264,0.27542555,0.00016042996,0.00009258103,0.00011525974,0.000052515574,0.00007131159,0.004475127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950457,0.00016968124,0.000021931899,0.000081565035,0.00015711249,0.00006508403],"domain_scores_gemma":[0.999488,0.00013706976,0.0001119243,0.00006868298,0.0001683384,0.000025972788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034058857,0.0010301969,0.00061735156,0.00039099727,0.00034477466,0.0007810974,0.0008809373,0.00074267416,0.0024042444],"category_scores_gemma":[0.0012606664,0.00044006205,0.00031443045,0.0006227927,0.00037505798,0.0007818774,0.0006693926,0.0006332802,0.0007277795],"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.0002037415,0.000048348702,0.00075868843,0.00023191712,0.000045358585,0.00035549045,0.00010121694,0.7588149,0.059019644,0.026675435,0.0029734974,0.15077175],"study_design_scores_gemma":[0.00002949752,0.0003085719,0.00036237983,0.000019372585,0.000027002134,0.00040011117,0.000037188674,0.97360647,0.0123673845,0.006153138,0.006658139,0.000030668798],"about_ca_topic_score_codex":0.000709779,"about_ca_topic_score_gemma":0.0006894489,"teacher_disagreement_score":0.0024042444,"about_ca_system_score_codex":0.0006676459,"about_ca_system_score_gemma":0.00038154115,"threshold_uncertainty_score":0.008042991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1627267,0.0003680993,0.83191216,0.00013583005,0.00004230678,0.000042828553,0.000046292633,0.00033912808,0.004386605],"genre_scores_gemma":[0.93544567,0.00013987672,0.06305081,0.000039811293,0.000010388734,0.000026146334,0.00003096491,0.000030190055,0.0012260625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998375,0.00005037317,0.0000055460155,0.00003005029,0.000035528585,0.00004088773],"domain_scores_gemma":[0.9997458,0.00011678038,0.000044712157,0.00002630403,0.00004573159,0.000020608066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003354291,0.00061832817,0.0004995255,0.00021030617,0.00030307076,0.00045338448,0.00047587176,0.00058424915,0.00075433165],"category_scores_gemma":[0.0009512958,0.00022410994,0.0002746256,0.00029615327,0.00039850757,0.0005365343,0.00043119208,0.00031617968,0.00024005577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777393,0.000054581265,0.0013646001,0.00004232255,0.000021961068,0.00015329111,0.000051587773,0.95782167,0.014495171,0.0029510858,0.00075761386,0.0222183],"study_design_scores_gemma":[0.0000049918162,0.0000413654,0.00017352718,0.0000021122958,0.000005305613,0.000028732824,0.000021311143,0.9977087,0.0012386282,0.0005523546,0.00021932376,0.0000036552165],"about_ca_topic_score_codex":0.0030865194,"about_ca_topic_score_gemma":0.005543339,"teacher_disagreement_score":0.0030865194,"about_ca_system_score_codex":0.00039519678,"about_ca_system_score_gemma":0.0005642701,"threshold_uncertainty_score":0.006137073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056793466,0.00055693625,0.9379292,0.0003152902,0.000091033,0.000025127909,0.00014213438,0.0009787276,0.0031681897],"genre_scores_gemma":[0.91413236,0.00039950028,0.080289215,0.00014828083,0.000055302706,0.00005275416,0.00024407003,0.00006007273,0.0046185357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998448,0.00003561674,0.000008504508,0.00003486402,0.00004850945,0.00002778179],"domain_scores_gemma":[0.99976,0.000108700326,0.00002603829,0.000024756457,0.00007238193,0.000008231053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039102972,0.00053679186,0.0003995028,0.0002124212,0.00024111805,0.0003734845,0.00060123706,0.00049412966,0.0010653468],"category_scores_gemma":[0.0008048663,0.0003464139,0.00033694942,0.0002661285,0.000250323,0.0005659056,0.00037336504,0.0011131624,0.00033394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009831226,0.000035311597,0.0010449813,0.000031541047,0.00003187534,0.000049595914,0.000031988075,0.8897526,0.004137463,0.0030298284,0.0016004865,0.10015591],"study_design_scores_gemma":[6.961064e-7,0.0000037792674,0.00007818798,0.0000012289017,0.0000014326666,0.0000028653153,9.0380684e-7,0.9992418,0.00039116107,0.0001915139,0.000085370935,0.000001066758],"about_ca_topic_score_codex":0.01135068,"about_ca_topic_score_gemma":0.013800705,"teacher_disagreement_score":0.01135068,"about_ca_system_score_codex":0.0005323158,"about_ca_system_score_gemma":0.00065279164,"threshold_uncertainty_score":0.02256924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015388213,0.00034625246,0.9805095,0.0002941243,0.00005781161,0.00004339691,0.000064253225,0.00015794802,0.0031384632],"genre_scores_gemma":[0.8058445,0.000596011,0.18864311,0.00047439267,0.00014090826,0.00014626927,0.00015181252,0.000048439204,0.00395462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985447,0.00054221647,0.00004870454,0.00023528395,0.0005039652,0.00012517032],"domain_scores_gemma":[0.9980666,0.0012309451,0.0001767721,0.00022476978,0.00024620324,0.00005466554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009528029,0.000724066,0.00049180415,0.0003761804,0.0002945359,0.0008157266,0.001147425,0.0006369963,0.0014926767],"category_scores_gemma":[0.003847473,0.00025858785,0.00033968178,0.0007173448,0.0011393005,0.001512021,0.0013379998,0.0010892329,0.00033398456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010563061,0.00021175803,0.001198345,0.0004284276,0.00012543291,0.00055620703,0.0003672698,0.51168734,0.052105393,0.2244683,0.003494729,0.20430048],"study_design_scores_gemma":[0.000030508854,0.00013521338,0.00012888231,0.000021985794,0.000015839427,0.00017628324,0.000026206011,0.9750507,0.0076540513,0.015279698,0.0014565091,0.000024208994],"about_ca_topic_score_codex":0.001167747,"about_ca_topic_score_gemma":0.001691853,"teacher_disagreement_score":0.0014926767,"about_ca_system_score_codex":0.0005366351,"about_ca_system_score_gemma":0.0008072462,"threshold_uncertainty_score":0.0050389767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26529497,0.00094401935,0.7287353,0.0001548577,0.000038359,0.00003404021,0.000039956532,0.00026847635,0.0044899797],"genre_scores_gemma":[0.98391336,0.00012826554,0.015489316,0.000023898969,0.000009688267,0.000014957902,0.000010416151,0.000007965559,0.00040213257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.00036617334,0.000017970586,0.000097898526,0.00019529198,0.0001072617],"domain_scores_gemma":[0.9984785,0.0009872782,0.00018048027,0.00012514554,0.0001847014,0.00004389889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948871,0.00055441674,0.00062787766,0.00026278695,0.00031308437,0.00075779686,0.00067985134,0.00057909655,0.000374196],"category_scores_gemma":[0.0021233824,0.0002892852,0.00031261402,0.00044761912,0.0009489553,0.00072313746,0.0005635652,0.00036118145,0.00011638275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078974634,0.000022285552,0.00038160532,0.000026450189,0.000031463413,0.000092292314,0.000044546097,0.98267925,0.0038979913,0.0039924276,0.00016234459,0.008590474],"study_design_scores_gemma":[0.0000032706307,0.00003212865,0.00005638393,0.0000011566418,0.0000043103914,0.000012920653,0.0000076098054,0.99859804,0.00056544,0.0006454889,0.00007028392,0.0000028767336],"about_ca_topic_score_codex":0.004033608,"about_ca_topic_score_gemma":0.0039544418,"teacher_disagreement_score":0.004033608,"about_ca_system_score_codex":0.0006783634,"about_ca_system_score_gemma":0.00060532236,"threshold_uncertainty_score":0.008020222},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073842163,0.00033796768,0.99772066,0.00009406484,0.000027936418,0.000012909374,0.000027904494,0.00004787056,0.0009922032],"genre_scores_gemma":[0.42334452,0.006614914,0.5573984,0.000699684,0.0008727945,0.0006948348,0.00046354954,0.00021680926,0.009694534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980111,0.0006928857,0.00008967407,0.00023920178,0.0007957144,0.00017143175],"domain_scores_gemma":[0.9971064,0.0015327606,0.00032213388,0.00023322098,0.0007617754,0.00004368173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029863962,0.001738265,0.0013325657,0.0014997213,0.0006465501,0.0020976847,0.0017493257,0.0014148524,0.0017139945],"category_scores_gemma":[0.0074747596,0.00065581285,0.0010741139,0.0013466638,0.0016717926,0.0028334754,0.0016028411,0.002595728,0.00086985255],"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.00002710067,0.000041861687,0.00039612572,0.00019326822,0.000053576136,0.00012295775,0.00011318966,0.76277304,0.0037847662,0.20572679,0.0015307653,0.025236525],"study_design_scores_gemma":[0.000003907437,0.00002717389,0.00008826847,0.000019416953,0.000011417784,0.000042126416,0.0000121941175,0.9823172,0.00052302226,0.015753394,0.001187144,0.000014655748],"about_ca_topic_score_codex":0.0055382443,"about_ca_topic_score_gemma":0.0044633406,"teacher_disagreement_score":0.0055382443,"about_ca_system_score_codex":0.0014075923,"about_ca_system_score_gemma":0.0024194114,"threshold_uncertainty_score":0.0157938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18088733,0.00047885638,0.80979687,0.0007551458,0.00013914294,0.00010843678,0.00020851684,0.0017915131,0.0058342214],"genre_scores_gemma":[0.97919697,0.000093328024,0.019338418,0.0001333202,0.00002822683,0.000039255166,0.000062014136,0.000055930876,0.0010525103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961706,0.0011298142,0.00016144017,0.0004951339,0.0011871784,0.0008558668],"domain_scores_gemma":[0.9919538,0.004762769,0.00077980454,0.0017749183,0.0005680077,0.00016072644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024572997,0.0011514022,0.0009341728,0.0008462793,0.00084248814,0.0015603884,0.00084383076,0.001294103,0.0020075152],"category_scores_gemma":[0.012581951,0.0003528797,0.0007642199,0.00059802434,0.0030591267,0.0035342888,0.0036072037,0.0022096583,0.00039131255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010866834,0.00014982455,0.002727322,0.00024563787,0.0001776347,0.00060726184,0.00029971072,0.6531266,0.027708085,0.23424233,0.0035240585,0.07610485],"study_design_scores_gemma":[0.00003670386,0.00014269711,0.0002379718,0.000028509092,0.000024313762,0.0001920817,0.000050518902,0.9149713,0.01790389,0.06543222,0.0009455123,0.000034165365],"about_ca_topic_score_codex":0.00092137663,"about_ca_topic_score_gemma":0.0007375839,"teacher_disagreement_score":0.0024572997,"about_ca_system_score_codex":0.0010245802,"about_ca_system_score_gemma":0.0014323238,"threshold_uncertainty_score":0.012995601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1029535,0.0005131155,0.8925634,0.0001933193,0.00004927623,0.000029475914,0.000048925223,0.00019031072,0.003458651],"genre_scores_gemma":[0.9330511,0.0003421242,0.065157,0.000078211175,0.00002341509,0.000034688066,0.00005819571,0.000007725115,0.0012475067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973565,0.000087699445,0.000011411605,0.000046041256,0.00008156561,0.000037626978],"domain_scores_gemma":[0.9995981,0.00023665908,0.000055314915,0.000029715635,0.000060956296,0.000019200388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942955,0.0005053802,0.00042836682,0.00021131802,0.00024455087,0.0005205272,0.00032193214,0.00046619368,0.0006685978],"category_scores_gemma":[0.0011467072,0.00022281751,0.00025928702,0.0003122078,0.00040049214,0.0006713917,0.00079524255,0.00036092056,0.00021379314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037965085,0.000040994233,0.0036335094,0.00018097994,0.00004817889,0.0004657927,0.00018768288,0.8724654,0.037250936,0.008746062,0.00072986446,0.075870864],"study_design_scores_gemma":[0.00000748852,0.000047875976,0.0004491788,0.0000054379957,0.0000056317162,0.00006160315,0.000039730458,0.9960282,0.0024689185,0.0006746102,0.00020417412,0.0000071518334],"about_ca_topic_score_codex":0.0020939899,"about_ca_topic_score_gemma":0.0027032015,"teacher_disagreement_score":0.0020939899,"about_ca_system_score_codex":0.0002142482,"about_ca_system_score_gemma":0.00040469013,"threshold_uncertainty_score":0.0041635633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027184626,0.0006939034,0.98618174,0.0008344935,0.00008190997,0.000045989505,0.00008172645,0.00010119172,0.009260556],"genre_scores_gemma":[0.39267498,0.005229007,0.56708616,0.0011923522,0.0009036262,0.0006645655,0.0004567195,0.00033088453,0.03146172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839777,0.0006661502,0.000058770227,0.00031581506,0.0004240566,0.00013745613],"domain_scores_gemma":[0.9963003,0.002547599,0.00020820576,0.000380841,0.00037798358,0.00018505333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016699153,0.0006436672,0.0007705446,0.001496005,0.0010962909,0.0025214422,0.0021080282,0.0013392136,0.007316296],"category_scores_gemma":[0.004719527,0.000489595,0.0007022976,0.0021353625,0.0019135408,0.005270626,0.0021154145,0.0032757947,0.00094909273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039181938,0.000033528922,0.0001477796,0.00012916377,0.000030121786,0.000059270766,0.00018496088,0.07965391,0.0013529118,0.8867644,0.0035779043,0.028026825],"study_design_scores_gemma":[0.0000251311,0.000046123343,0.00011727347,0.0000436022,0.000023685521,0.00008532502,0.0001115531,0.31334502,0.00100636,0.6608283,0.024345227,0.000022423545],"about_ca_topic_score_codex":0.0025467859,"about_ca_topic_score_gemma":0.0028844187,"teacher_disagreement_score":0.007316296,"about_ca_system_score_codex":0.002663507,"about_ca_system_score_gemma":0.0014213002,"threshold_uncertainty_score":0.024475455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011435084,0.00018803992,0.9854351,0.00009332028,0.00001967223,0.00002341553,0.000026659764,0.0003580858,0.0024205798],"genre_scores_gemma":[0.278441,0.00064999325,0.7175838,0.00009517469,0.000055208686,0.00007500994,0.00015246223,0.00011720886,0.0028302532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949324,0.00014372398,0.000031475465,0.000052777385,0.00024381148,0.000035023393],"domain_scores_gemma":[0.99960524,0.00018133942,0.000037069713,0.0000713804,0.00009008701,0.000014932036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040153327,0.00068408984,0.0007897622,0.0004535189,0.00025157194,0.00052773766,0.00032868233,0.00039211634,0.0014308753],"category_scores_gemma":[0.001892988,0.00020462493,0.00036118092,0.00058231474,0.0005707891,0.00062414986,0.0005818418,0.00035709864,0.00059920625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026326577,0.000067388646,0.00056508445,0.00017909841,0.00005526474,0.00014390798,0.0001796703,0.33692428,0.074986964,0.06062616,0.0024687701,0.52354014],"study_design_scores_gemma":[0.00002675266,0.00013362918,0.00030488012,0.000015675641,0.000018498626,0.00021957199,0.00002254431,0.93682545,0.041470893,0.016681027,0.0042615714,0.000019524676],"about_ca_topic_score_codex":0.0007483976,"about_ca_topic_score_gemma":0.0011671598,"teacher_disagreement_score":0.0014308753,"about_ca_system_score_codex":0.0003055612,"about_ca_system_score_gemma":0.0008104147,"threshold_uncertainty_score":0.00478673},"labels":[],"label_agreement":null}]}