{"meta":{"query_hash":"c120936582a7","filters":{"venue":"IEEE Wireless Communications Letters"},"cohort_total":297,"direct_labels_cover":0,"predictions_cover":297,"exported":297,"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/c120936582a7","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Wireless+Communications+Letters"},"results":[{"id":"W1598656139","doi":"10.1109/wcl.2013.120513.130680","title":"Low-Latency Source-Channel Coding for Fading Channels with Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Encoder; Algorithm; Decoding methods; Transmitter; Minimum mean square error; Channel (broadcasting); Telecommunications; Mathematics; Estimator; Statistics","score_opus":0.022552857780099366,"score_gpt":0.24041365268906686,"score_spread":0.2178607949089675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598656139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19422933,0.00011336965,0.80039454,0.001884147,0.00025147293,0.000644628,0.000015436253,0.0017689528,0.000698095],"genre_scores_gemma":[0.98791754,0.0003789281,0.010146276,0.0005241567,0.000065013235,0.00068571157,0.00010127008,0.00014435533,0.000036719182],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982802,0.00017617142,0.00055301446,0.0003061372,0.00018959126,0.00049486035],"domain_scores_gemma":[0.9959481,0.00073071395,0.0001752091,0.0028369152,0.0001823291,0.00012674138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042695607,0.00037316006,0.0004165868,0.0003225863,0.00048166933,0.00015349458,0.0023543742,0.00016911968,0.000006844581],"category_scores_gemma":[0.00004153008,0.0003958368,0.000111096466,0.0004587149,0.00030961033,0.00037014863,0.00022078284,0.0006577448,0.00003066966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018071868,0.0006795422,0.0007623655,0.0011630083,0.0009207689,0.0000038322523,0.024961734,0.35138768,0.50243926,0.023589073,0.017292961,0.07661908],"study_design_scores_gemma":[0.00073601125,0.000079197394,0.00005377247,0.00077731756,0.000049709404,0.000017825723,0.00022534317,0.95041,0.0420865,0.00025560244,0.00456013,0.000748557],"about_ca_topic_score_codex":0.00004095806,"about_ca_topic_score_gemma":0.000051931587,"teacher_disagreement_score":0.79368824,"about_ca_system_score_codex":0.000169414,"about_ca_system_score_gemma":0.000017715132,"threshold_uncertainty_score":0.9998494},"labels":[],"label_agreement":null},{"id":"W1615560023","doi":"10.1109/lwc.2015.2446986","title":"Binary Signaling of Correlated Sources Over Orthogonal Multiple-Access Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Additive white Gaussian noise; Binary number; Channel (broadcasting); Upper and lower bounds; Joint (building); Algorithm; Mathematics; Gaussian; Signal-to-noise ratio (imaging); Energy (signal processing); Mathematical optimization; Computer science; Gaussian noise; Topology (electrical circuits); Statistics; Telecommunications; Combinatorics; Physics; Mathematical analysis; Engineering","score_opus":0.055449853240941815,"score_gpt":0.28771752545609625,"score_spread":0.23226767221515443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1615560023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816071,0.0010200368,0.014025832,0.001017708,0.00031560054,0.00037727505,0.000040922892,0.0011072241,0.0004882939],"genre_scores_gemma":[0.9942095,0.0004348066,0.0045842566,0.00031470717,0.000048658247,0.00016774597,0.00013654772,0.00009349875,0.000010274956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980398,0.0002839478,0.0007380381,0.00022003539,0.0003786574,0.00033954778],"domain_scores_gemma":[0.99607015,0.0005121941,0.00023971596,0.0027815322,0.00022812579,0.00016829715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046350528,0.00030430878,0.0004216624,0.00039908738,0.00017454315,0.000100087236,0.0031862755,0.00017868952,0.000018456596],"category_scores_gemma":[0.000050612194,0.00035164203,0.00013466207,0.0006526052,0.00043437915,0.0005943102,0.0005488735,0.0006331784,0.000022359209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007930262,0.00054781244,0.023849953,0.00023609065,0.00046587762,0.000010115778,0.007866304,0.31326059,0.6288823,0.0026270137,0.01729844,0.0048762113],"study_design_scores_gemma":[0.0017565605,0.00006991382,0.0027769995,0.00060309545,0.00009449654,0.000024224853,0.00054413744,0.81702185,0.164802,0.0003497128,0.010697129,0.0012598705],"about_ca_topic_score_codex":0.00017655526,"about_ca_topic_score_gemma":0.000041514126,"teacher_disagreement_score":0.5037613,"about_ca_system_score_codex":0.00014825445,"about_ca_system_score_gemma":0.00005269074,"threshold_uncertainty_score":0.99989355},"labels":[],"label_agreement":null},{"id":"W1619779794","doi":"10.1109/lwc.2015.2435737","title":"Power-Constrained Distributed Implementation of SNR-Optimal Collaborative Beamforming in Highly-Scattered Environments","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Beamforming; Computer science; Power (physics); Distributed computing; Telecommunications; Physics","score_opus":0.01449768871963832,"score_gpt":0.2607558377267106,"score_spread":0.2462581490070723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619779794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61727446,0.00009523184,0.38067633,0.00071811175,0.00015702164,0.0005577147,0.00024790523,0.00010263892,0.0001705882],"genre_scores_gemma":[0.97950834,0.0000497061,0.0197414,0.000051173007,0.000011099474,0.00014660617,0.0004520095,0.000035860237,0.000003797103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987448,0.00011153035,0.0005933525,0.00015391446,0.0001604443,0.00023596687],"domain_scores_gemma":[0.9988042,0.000070002694,0.00018362996,0.0008155637,0.00005237875,0.000074189775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018770521,0.00018225763,0.00025484798,0.00019248288,0.00005975332,0.000019516721,0.00045886406,0.00006553627,0.0000067533965],"category_scores_gemma":[0.0000111148165,0.00022188612,0.000034569704,0.0005010346,0.00014858255,0.00041914897,0.00006546037,0.00016275885,0.000009540593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015369955,0.00007301011,0.003143865,0.000025679394,0.000064741755,0.0000020945463,0.0053255865,0.7894487,0.19929795,0.00023309082,0.0007797383,0.0015901965],"study_design_scores_gemma":[0.017407319,0.0003556445,0.01207871,0.0007391141,0.00017545614,0.000041892803,0.068491906,0.5593662,0.32774693,0.00012126691,0.010320651,0.0031548988],"about_ca_topic_score_codex":0.000055346747,"about_ca_topic_score_gemma":0.000109358436,"teacher_disagreement_score":0.36223388,"about_ca_system_score_codex":0.00041601094,"about_ca_system_score_gemma":0.000040082024,"threshold_uncertainty_score":0.9048253},"labels":[],"label_agreement":null},{"id":"W1625178605","doi":"10.1109/lwc.2015.2449300","title":"Maximum Likelihood Timing Estimation for CPM Using Legendre Polynomials","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Legendre polynomials; Maximum likelihood; Estimation; Mathematics; Computer science; Applied mathematics; Statistics; Algorithm; Mathematical optimization; Mathematical analysis; Engineering","score_opus":0.08311463978326447,"score_gpt":0.31895652685580417,"score_spread":0.2358418870725397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625178605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11527152,0.00074825564,0.8791643,0.0019190785,0.00029553322,0.0007511228,0.000050343995,0.0013970142,0.0004028349],"genre_scores_gemma":[0.6602175,0.00016334058,0.3387139,0.00030905302,0.000062859515,0.00031797067,0.00010974963,0.000099009696,0.000006544652],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984057,0.0001296745,0.00059701013,0.00023204068,0.0002085536,0.00042705188],"domain_scores_gemma":[0.9964059,0.00029448574,0.00017634733,0.002780893,0.0001755544,0.00016679117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004178594,0.00029724353,0.00034013987,0.00027812106,0.00033166728,0.00009686146,0.0016517645,0.00014111114,0.0000032358498],"category_scores_gemma":[0.00005149193,0.0003668914,0.00011593215,0.00036905135,0.00018698849,0.00062103,0.00019631106,0.00034238375,0.000025792937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039721515,0.00017612227,0.00017587037,0.00017829066,0.00019070145,0.0000018559542,0.0027063366,0.37135884,0.45075774,0.002580172,0.01429099,0.15754335],"study_design_scores_gemma":[0.0006514243,0.000023019731,0.000029744508,0.00013881612,0.000053020824,0.000017441153,0.00021491652,0.917928,0.070872284,0.0016771511,0.0078111817,0.00058299094],"about_ca_topic_score_codex":0.00006356247,"about_ca_topic_score_gemma":0.0000352005,"teacher_disagreement_score":0.54656917,"about_ca_system_score_codex":0.00048871816,"about_ca_system_score_gemma":0.00006547883,"threshold_uncertainty_score":0.9998783},"labels":[],"label_agreement":null},{"id":"W1641151077","doi":"10.1109/lwc.2015.2436397","title":"Random Node Failures and Wireless Networks Connectivity: Theoretical Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Mobile Ad Hoc Networks","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 Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless network; Node (physics); Scheduling (production processes); Wireless; Wireless sensor network; Upper and lower bounds; Channel (broadcasting); Distributed computing; Telecommunications; Mathematics; Engineering; Mathematical optimization","score_opus":0.018957427859622226,"score_gpt":0.25449939935614085,"score_spread":0.23554197149651862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641151077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14217146,0.00038933096,0.83212024,0.024098627,0.00020881413,0.000291663,0.0000035449284,0.00026968727,0.00044665058],"genre_scores_gemma":[0.9801157,0.00021336746,0.016536511,0.002826283,0.00009451281,0.00015634763,0.000020782587,0.000025800251,0.000010681012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711645,0.0009769241,0.00044856337,0.0005789044,0.0003838496,0.0004952874],"domain_scores_gemma":[0.99375796,0.0014357921,0.00020177617,0.004112191,0.00016333714,0.0003289136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011220999,0.00029501112,0.0005682605,0.00026962697,0.0003830516,0.00043945276,0.003167267,0.00014983803,0.000006402908],"category_scores_gemma":[0.000047562382,0.00028634808,0.00017818024,0.0015521334,0.0010509808,0.00052297884,0.0010099921,0.0005797925,0.000015926209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010284162,0.00037640112,0.008818643,0.000016466613,0.0014516579,0.000035788064,0.0026568398,0.1417421,0.0017892392,0.79189277,0.0077948365,0.04332242],"study_design_scores_gemma":[0.0011466373,0.000021910335,0.0006621213,0.00002243941,0.00019326195,0.000018392018,0.00006656253,0.9952156,0.00010533681,0.0009246166,0.001257962,0.00036515747],"about_ca_topic_score_codex":0.00021733894,"about_ca_topic_score_gemma":0.00028836878,"teacher_disagreement_score":0.8534735,"about_ca_system_score_codex":0.00009555975,"about_ca_system_score_gemma":0.000059904276,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W1747005659","doi":"10.1109/wcl.2013.120513.130762","title":"Impact of Co-Channel Interference on the Performance of Multi-Hop Relaying over Nakagami-m Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Fading; Nakagami distribution; Fading distribution; Rayleigh fading; Hop (telecommunications); Computer science; Diversity gain; Interference (communication); Channel (broadcasting); Channel state information; Co-channel interference; Weibull fading; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.0692030566188243,"score_gpt":0.31781786724292005,"score_spread":0.24861481062409574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747005659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8483257,0.0000925486,0.14832029,0.0024420188,0.00013784744,0.00021950861,0.000003856257,0.000062500345,0.0003956722],"genre_scores_gemma":[0.9965586,0.0007369583,0.0019046032,0.0006848607,0.000021847878,0.000048631824,0.0000054965685,0.000016671369,0.000022350208],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981333,0.0006443774,0.0005003142,0.00024163914,0.0002244242,0.00025593134],"domain_scores_gemma":[0.99440634,0.0011573153,0.00041763106,0.0037648142,0.00019532429,0.00005859738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082095177,0.00020692364,0.0002928725,0.00020409033,0.00046935384,0.00007454382,0.00462448,0.000054726515,0.000009155218],"category_scores_gemma":[0.00008061335,0.00015860015,0.00016302968,0.00060738396,0.00036216818,0.00035813122,0.0006428444,0.00045929026,0.0000157947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010143116,0.001360362,0.016579885,0.0001404302,0.0005472174,8.189719e-7,0.032283075,0.14469436,0.6332311,0.06966179,0.0045173015,0.09688224],"study_design_scores_gemma":[0.00036804125,0.00014351713,0.007641886,0.00037712755,0.000007463613,0.0000021888231,0.000041487277,0.97810864,0.012930093,0.000016726994,0.00014615005,0.00021667864],"about_ca_topic_score_codex":0.00003419372,"about_ca_topic_score_gemma":0.000011176792,"teacher_disagreement_score":0.83341426,"about_ca_system_score_codex":0.00009534311,"about_ca_system_score_gemma":0.00004304556,"threshold_uncertainty_score":0.8593511},"labels":[],"label_agreement":null},{"id":"W1849749457","doi":"10.1109/wcl.2014.010414.130726","title":"A Complete Complementary Coded MIMO System and Its Performance in Multipath Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland","funders":"","keywords":"Multipath propagation; MIMO; Fading; Computer science; Bit error rate; Electronic engineering; 3G MIMO; Wireless; Antenna (radio); Diversity scheme; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.029243260153438276,"score_gpt":0.25199098858772667,"score_spread":0.2227477284342884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849749457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95307195,0.0006063738,0.040779095,0.0022066848,0.0001915054,0.00082341797,0.00006388847,0.0013973294,0.0008597246],"genre_scores_gemma":[0.98505944,0.0010254196,0.012901167,0.0003817694,0.000029234972,0.0004198164,0.00010853643,0.00006826678,0.000006371731],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984319,0.00025531152,0.0005550588,0.00023361208,0.00016472428,0.0003593467],"domain_scores_gemma":[0.99745136,0.00031150877,0.00011004758,0.0019824065,0.000055663495,0.00008903362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035445113,0.00027375307,0.0003716703,0.00028589394,0.00026691,0.000047205245,0.0014257489,0.00007428014,0.0000030182505],"category_scores_gemma":[0.000008746137,0.00032355334,0.0000425682,0.00033715292,0.0001655054,0.00033501437,0.00029372706,0.0004667808,0.000024975952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005996455,0.00035213583,0.009181737,0.00212531,0.00022368407,0.0000068097033,0.00657041,0.144948,0.73899543,0.026343016,0.0020966334,0.06909684],"study_design_scores_gemma":[0.0007037055,0.000020531264,0.0014962886,0.00038929615,0.000010625797,0.000013301099,0.00022424846,0.97787625,0.010088236,0.000015516422,0.008751428,0.00041059352],"about_ca_topic_score_codex":0.000045446617,"about_ca_topic_score_gemma":0.000095519565,"teacher_disagreement_score":0.83292824,"about_ca_system_score_codex":0.00021869528,"about_ca_system_score_gemma":0.0000068788886,"threshold_uncertainty_score":0.9999217},"labels":[],"label_agreement":null},{"id":"W1851834002","doi":"10.1109/wcl.2013.113013.130653","title":"Accuracy of Harmonic Mean Approximation in Performance Analysis of Multihop Amplify-and-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Western University","funders":"","keywords":"Upper and lower bounds; Harmonic mean; Fading; Signal-to-noise ratio (imaging); Ergodic theory; Mathematics; Outage probability; Harmonic; Algorithm; Computer science; Topology (electrical circuits); Statistics; Applied mathematics; Physics; Mathematical analysis; Combinatorics","score_opus":0.04158554766670669,"score_gpt":0.2860465707098553,"score_spread":0.2444610230431486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851834002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76052177,0.0002581425,0.23674013,0.0020699026,0.00003101908,0.0001538233,0.0000017910894,0.000038199618,0.00018519585],"genre_scores_gemma":[0.9723172,0.0026767568,0.02462392,0.00030465794,0.000004989774,0.000041365543,0.00001946808,0.000008043928,0.0000036041206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982904,0.0005003746,0.0006235474,0.00022679032,0.00019028863,0.00016856122],"domain_scores_gemma":[0.99578214,0.00092999917,0.0004471291,0.0026596675,0.00013737279,0.000043706885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094896986,0.0001322865,0.00036901908,0.00062412437,0.00018678923,0.000044154676,0.0021545948,0.000052101335,0.0000024243027],"category_scores_gemma":[0.000078980294,0.00013833099,0.00008455215,0.0018842083,0.00018098051,0.0005024625,0.0005439275,0.00028031465,0.0000022163713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026936883,0.00041314258,0.052410446,0.00015271812,0.00054372405,2.6482098e-7,0.018232964,0.03452541,0.16415672,0.071130015,0.000092317365,0.65831536],"study_design_scores_gemma":[0.00033986868,0.000015608764,0.03218143,0.000088593646,0.00005550461,6.551529e-7,0.000058120135,0.96339864,0.0034331626,0.000023784007,0.0002606833,0.0001439412],"about_ca_topic_score_codex":0.000060914554,"about_ca_topic_score_gemma":0.00022097299,"teacher_disagreement_score":0.92887324,"about_ca_system_score_codex":0.00005356632,"about_ca_system_score_gemma":0.000026419288,"threshold_uncertainty_score":0.5640974},"labels":[],"label_agreement":null},{"id":"W1855425039","doi":"10.1109/wcl.2014.020314.130839","title":"A Generalized Water-Filling Algorithm with Linear Complexity and Finite Convergence Time","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"","keywords":"Algorithm; Convergence (economics); Computational complexity theory; Mathematical optimization; Rate of convergence; Generalization; Time complexity; Mathematics; Power (physics); Computer science","score_opus":0.030960405567136935,"score_gpt":0.25858336912456137,"score_spread":0.22762296355742442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855425039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18337275,0.000028397737,0.8083633,0.007180596,0.00008985461,0.00018654918,0.0000035227001,0.0006610453,0.000113966504],"genre_scores_gemma":[0.47753966,0.000042397332,0.5206813,0.001592329,0.00002897993,0.000046928304,0.000014718985,0.000019081204,0.000034607874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983454,0.00039766866,0.0002942833,0.00040033157,0.00022478813,0.0003375386],"domain_scores_gemma":[0.9966953,0.00036648026,0.00012857544,0.0025828811,0.00012509896,0.00010170703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005421521,0.00021768356,0.00026771743,0.00014021482,0.0004940208,0.00013934495,0.0023036813,0.000059623755,0.000005312119],"category_scores_gemma":[0.000018857776,0.00017971874,0.000045736255,0.00028600002,0.00044424998,0.00036277017,0.0006006954,0.00032842412,0.000057754853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274178,0.000690252,0.004434204,0.0001648685,0.00036310023,0.000035619967,0.016348254,0.005208406,0.7027174,0.03743977,0.0045435103,0.22799185],"study_design_scores_gemma":[0.00029669845,0.000054551274,0.00012476281,0.00006390358,0.000011549717,0.000029849309,0.000008428338,0.97084665,0.02533339,0.00041203073,0.0024956393,0.00032254803],"about_ca_topic_score_codex":0.0002401103,"about_ca_topic_score_gemma":0.000039220227,"teacher_disagreement_score":0.9656382,"about_ca_system_score_codex":0.000043014472,"about_ca_system_score_gemma":0.000019840292,"threshold_uncertainty_score":0.7328717},"labels":[],"label_agreement":null},{"id":"W1967151485","doi":"10.1109/wcl.2013.070113.130185","title":"A Dynamic Time Slot Allocation Scheme for Hybrid CSMA/TDMA MAC Protocol","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Networks and Protocols","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":"Time division multiple access; Computer network; Computer science; Queue; Channel access method; Channel allocation schemes; Channel (broadcasting); Access control; Queueing theory; Scheme (mathematics); Real-time computing; Wireless; Telecommunications; Mathematics","score_opus":0.01966544636711405,"score_gpt":0.2851893316486834,"score_spread":0.26552388528156934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967151485","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865,0.000017884327,0.7150165,0.03870169,0.00015799126,0.23507474,0.000016332348,0.0006138933,0.0005359703],"genre_scores_gemma":[0.11145529,0.000005501066,0.15930705,0.0027546957,0.00007650235,0.7259989,0.00005768643,0.00004955176,0.00029483583],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775136,0.00025933082,0.0005982177,0.0005331162,0.00029839718,0.00055957946],"domain_scores_gemma":[0.994936,0.00039567173,0.0003317977,0.0039035003,0.00027776574,0.00015528714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043216007,0.0003145247,0.0003182095,0.00017144272,0.0005976737,0.00053054997,0.0045174793,0.00009462009,0.000037201175],"category_scores_gemma":[0.000019779616,0.00031680847,0.00016520548,0.00046584834,0.00020634214,0.0010361013,0.0005085648,0.00033744413,0.0005539035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008987075,0.0013950259,0.000365647,0.00050092296,0.0003234587,0.000005953678,0.0011219343,0.0046416493,0.39890116,0.043946523,0.20675755,0.3419503],"study_design_scores_gemma":[0.0009458557,0.000077653654,0.0002688265,0.00012414495,0.0000074108693,0.000012904212,0.000007010695,0.9527144,0.003010337,0.0009326412,0.041446544,0.00045226974],"about_ca_topic_score_codex":0.000088200504,"about_ca_topic_score_gemma":0.00001550197,"teacher_disagreement_score":0.94807273,"about_ca_system_score_codex":0.00015468262,"about_ca_system_score_gemma":0.00010563462,"threshold_uncertainty_score":0.9999284},"labels":[],"label_agreement":null},{"id":"W1968405041","doi":"10.1109/wcl.2012.120211.110110","title":"A Framework for Location-Aware Strategies in Cognitive Radio Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cognitive radio; Computer science; Quality of service; Frequency allocation; Network topology; Energy consumption; Efficient energy use; Power consumption; Power (physics); Distributed computing; Topology (electrical circuits); Telecommunications; Computer network; Wireless; Engineering; Electrical engineering","score_opus":0.06506736887998975,"score_gpt":0.2967758057717296,"score_spread":0.2317084368917398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968405041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039590485,0.0005257306,0.95630157,0.0018967943,0.00036462853,0.0006158889,0.000007970407,0.00015020116,0.00054671225],"genre_scores_gemma":[0.9564201,0.00012858021,0.042502597,0.0005910351,0.000077970486,0.0002371519,0.00001483053,0.000020643383,0.0000070416004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985389,0.00022430567,0.00037286434,0.00035543158,0.00014690128,0.00036156437],"domain_scores_gemma":[0.9971751,0.0010343317,0.00017095241,0.0013387565,0.00021120526,0.000069654685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030726957,0.00018865547,0.00025372594,0.00021424786,0.00030649648,0.00026234632,0.0014872126,0.00009387535,0.0000018990168],"category_scores_gemma":[0.00003622077,0.00020485466,0.00007227672,0.00075343513,0.00020919649,0.00060834386,0.00013551915,0.00034113627,0.000010510131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048668193,0.00040930696,0.0017778614,0.00008832708,0.0001520337,0.000023613136,0.01650228,0.0018330022,0.0007421617,0.9470572,0.0006221268,0.030743409],"study_design_scores_gemma":[0.0013646999,0.0001277019,0.008409259,0.0017873052,0.000053342694,0.00006245813,0.00584817,0.96382165,0.00073869055,0.016322833,0.00042248334,0.0010414029],"about_ca_topic_score_codex":0.00034327985,"about_ca_topic_score_gemma":0.00025486964,"teacher_disagreement_score":0.9619886,"about_ca_system_score_codex":0.00010420416,"about_ca_system_score_gemma":0.00011469711,"threshold_uncertainty_score":0.83537304},"labels":[],"label_agreement":null},{"id":"W1969662557","doi":"10.1109/wcl.2013.020513.120825","title":"Cooperative Spectrum Sensing over Mixture-Nakagami Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Queen's University","funders":"","keywords":"Detector; Cyclostationary process; Nakagami distribution; Energy (signal processing); Rayleigh fading; SIGNAL (programming language); Computer science; Fading; Detection theory; Signal-to-noise ratio (imaging); Algorithm; Spread spectrum; Telecommunications; Physics; Electronic engineering; Statistics; Mathematics; Channel (broadcasting); Engineering","score_opus":0.017127659974104772,"score_gpt":0.24213831726452353,"score_spread":0.22501065729041875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969662557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3184137,0.00023251775,0.6223339,0.0554333,0.00078557286,0.00051140576,0.0000031160826,0.00036023514,0.0019262369],"genre_scores_gemma":[0.97517514,0.0001406318,0.017067803,0.0072200834,0.0002341118,0.000019002757,0.0000120745635,0.000031211715,0.00009992349],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797255,0.00037046545,0.00036553704,0.00046942165,0.00027121312,0.00055082334],"domain_scores_gemma":[0.99667877,0.0004325683,0.00015869482,0.002441028,0.00014158266,0.0001473427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021261013,0.00028784218,0.00030654873,0.00019395906,0.0006978773,0.0007067557,0.0017130099,0.00008381166,0.000025533329],"category_scores_gemma":[0.000017554852,0.0002868058,0.00012321577,0.00075877935,0.00028899734,0.0008707275,0.00044645215,0.0005216503,0.00021367597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098287,0.00063496485,0.00095373084,0.00004668469,0.00068728725,0.0001424097,0.012817044,0.008221101,0.4396019,0.10656541,0.09204915,0.33825934],"study_design_scores_gemma":[0.0005527938,0.000042961037,0.0022365872,0.00013878554,0.00001902272,0.00009916017,0.00009546679,0.9803055,0.010079366,0.0012144212,0.004467586,0.0007483516],"about_ca_topic_score_codex":0.0004204109,"about_ca_topic_score_gemma":0.00014258367,"teacher_disagreement_score":0.9720844,"about_ca_system_score_codex":0.00014197484,"about_ca_system_score_gemma":0.000047741145,"threshold_uncertainty_score":0.9999584},"labels":[],"label_agreement":null},{"id":"W1973340580","doi":"10.1109/lwc.2014.2366469","title":"Hybrid PPM-BPSK for Transmitted Reference Pulse Cluster Systems in UWB and 60-GHz Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Victoria","funders":"","keywords":"Phase-shift keying; Pulse-position modulation; Computer science; Electronic engineering; Bit error rate; Telecommunications; Engineering; Pulse (music); Decoding methods; Detector; Pulse-amplitude modulation","score_opus":0.01925119416095535,"score_gpt":0.23300259148955985,"score_spread":0.2137513973286045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973340580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9093084,0.0013198256,0.07740163,0.009492961,0.00026004584,0.0009238269,0.000044971563,0.0006199262,0.0006284239],"genre_scores_gemma":[0.9937286,0.0009856521,0.0034148141,0.0005506201,0.000028516562,0.0011082493,0.00009564904,0.00006366901,0.000024263243],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985641,0.00020624416,0.0005069704,0.00024800678,0.000100998026,0.0003736707],"domain_scores_gemma":[0.99635637,0.00069507095,0.00007472942,0.0027472202,0.000060328515,0.000066271576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003758762,0.00024318758,0.0003522124,0.00033764445,0.00020991884,0.000081181846,0.001658345,0.00014593272,0.000002205017],"category_scores_gemma":[0.000033753015,0.00027271555,0.000053325428,0.00028242602,0.00025633248,0.00019762835,0.00009987641,0.0005220214,0.00001491694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015650888,0.0009293042,0.0031061962,0.0017424069,0.00073611765,0.000007817497,0.0068202578,0.20677458,0.49289647,0.04215277,0.0220058,0.22267178],"study_design_scores_gemma":[0.0018667745,0.000055830264,0.00092450756,0.00030675146,0.000057739966,0.000045672627,0.00022831353,0.9344054,0.0056939013,0.00064638024,0.054997303,0.0007714218],"about_ca_topic_score_codex":0.00018008298,"about_ca_topic_score_gemma":0.00020940753,"teacher_disagreement_score":0.7276308,"about_ca_system_score_codex":0.00009934412,"about_ca_system_score_gemma":0.000011917332,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W1975891563","doi":"10.1109/lwc.2014.2372776","title":"Diversity–Multiplexing Tradeoff of the Half-Duplex Slow Fading Multiple-Access Relay Channel Based on Generalized Quantize-and-Forward Scheme","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Concordia University","funders":"","keywords":"Relay; Fading; Multiplexing; Channel state information; Relay channel; Computer science; Computer network; Wireless; Channel (broadcasting); Diversity scheme; Topology (electrical circuits); Telecommunications; Engineering; Physics; Electrical engineering","score_opus":0.07290483281977216,"score_gpt":0.28449629985111585,"score_spread":0.21159146703134368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975891563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5007565,0.00018371614,0.45473102,0.042878553,0.00036230774,0.00052338804,0.0000070776846,0.0002196996,0.0003377166],"genre_scores_gemma":[0.9748371,0.00032935,0.02003251,0.0046479865,0.00003428773,0.000056644712,0.00001073812,0.000023237177,0.000028103173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973108,0.0010564133,0.00048635434,0.00041537662,0.00038892645,0.0003421339],"domain_scores_gemma":[0.9939468,0.0013049041,0.00038265312,0.004111742,0.00014551818,0.000108416556],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008053795,0.00027282853,0.0003570994,0.00023429682,0.0026280251,0.0001789881,0.006690473,0.00008839572,0.0000036745366],"category_scores_gemma":[0.00016630572,0.00023725559,0.0001877373,0.0008347266,0.00043024868,0.00048491097,0.0039249365,0.00052331836,0.0000046906225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018553721,0.00126367,0.07170027,0.0002447882,0.00044295253,0.0000037782029,0.020890743,0.35974762,0.2905147,0.18902813,0.0065241447,0.05945366],"study_design_scores_gemma":[0.0010755038,0.000022593385,0.006643679,0.0002006918,0.000013598994,0.0000019371994,0.000027289361,0.98513246,0.004268875,0.000030812265,0.0022969618,0.00028561594],"about_ca_topic_score_codex":0.00013193485,"about_ca_topic_score_gemma":0.0002229511,"teacher_disagreement_score":0.6253848,"about_ca_system_score_codex":0.00009028407,"about_ca_system_score_gemma":0.00003996218,"threshold_uncertainty_score":0.9986838},"labels":[],"label_agreement":null},{"id":"W1976669201","doi":"10.1109/wcl.2013.090313.130541","title":"New Expressions for TWDP Fading Statistics","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"Fading; Fading distribution; Series (stratigraphy); Phase-shift keying; Computer science; Range (aeronautics); Statistics; Algorithm; Probability density function; Mathematics; Bit error rate; Applied mathematics; Rayleigh fading; Engineering; Decoding methods","score_opus":0.024946277987973206,"score_gpt":0.275234506244695,"score_spread":0.25028822825672176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976669201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008298588,0.0003349037,0.9852244,0.0028499146,0.0001825946,0.00085994165,0.00008051025,0.0013752077,0.0007939001],"genre_scores_gemma":[0.48114333,0.0005025327,0.51663595,0.0004136198,0.000046439127,0.0009536374,0.0001086516,0.00008154177,0.00011426124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.00007111287,0.00046788802,0.00018772192,0.00014621076,0.00035131766],"domain_scores_gemma":[0.9959716,0.0007059184,0.00010437117,0.002931575,0.0001239041,0.00016260362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000965263,0.00024889945,0.00025499263,0.00017960426,0.00036707285,0.00010510968,0.0019488281,0.00009811193,0.000055016695],"category_scores_gemma":[0.00003448914,0.00028249816,0.000080241996,0.00025607177,0.00014017253,0.00047097416,0.00018222419,0.00037713768,0.00011166742],"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.000003022113,0.000048690454,0.000090158544,0.00006544649,0.00007550177,2.6265815e-7,0.0006136546,0.010340035,0.64672804,0.01680816,0.22410432,0.10112272],"study_design_scores_gemma":[0.0019540645,0.00007385656,0.0011067092,0.0006268203,0.00011971752,0.000018563724,0.00069200963,0.5356509,0.19377051,0.01938628,0.24393415,0.0026663947],"about_ca_topic_score_codex":0.00009256603,"about_ca_topic_score_gemma":0.000031081465,"teacher_disagreement_score":0.5253109,"about_ca_system_score_codex":0.00014577356,"about_ca_system_score_gemma":0.000028325789,"threshold_uncertainty_score":0.99996275},"labels":[],"label_agreement":null},{"id":"W1985170348","doi":"10.1109/lwc.2014.2344666","title":"Secure Space-Time Block Coding without Transmitter CSI","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Channel state information; Transmitter; Transmit diversity; Computer science; Block code; Coding (social sciences); Channel (broadcasting); Antenna diversity; Block (permutation group theory); Telecommunications; Decoding methods; Antenna (radio); Fading; Wireless; Mathematics; Statistics","score_opus":0.01082748960332596,"score_gpt":0.23322012787500665,"score_spread":0.22239263827168068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985170348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39160964,0.0004959581,0.57247037,0.017516881,0.000309665,0.00093559164,0.000038707847,0.0059079896,0.010715188],"genre_scores_gemma":[0.95525867,0.0007527066,0.042080604,0.0012818892,0.00008194227,0.00024519963,0.000053097847,0.00015061525,0.000095266005],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819994,0.0002806615,0.00052363833,0.0002833195,0.00025557872,0.0004568783],"domain_scores_gemma":[0.99511325,0.00037998712,0.00012175974,0.0041624135,0.000087014974,0.00013555247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031051785,0.00038245748,0.00042579725,0.0002522313,0.00037955705,0.00009477235,0.0024269696,0.00016530122,0.000025733043],"category_scores_gemma":[0.00001857765,0.00043673476,0.00014443092,0.00041028394,0.00035096824,0.00038459303,0.00017131776,0.00079882384,0.00021289935],"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.000013045405,0.00013570715,0.00069304724,0.0001434373,0.0001855921,0.0000017384905,0.0018031663,0.029206714,0.92203665,0.006062783,0.017444199,0.022273935],"study_design_scores_gemma":[0.0010700711,0.000042441956,0.0005559224,0.00044969626,0.00009577039,0.000041373383,0.0001013784,0.70199966,0.13641179,0.000559642,0.15702379,0.0016484442],"about_ca_topic_score_codex":0.000016545848,"about_ca_topic_score_gemma":0.000021352644,"teacher_disagreement_score":0.78562486,"about_ca_system_score_codex":0.00015887296,"about_ca_system_score_gemma":0.000012974603,"threshold_uncertainty_score":0.99980843},"labels":[],"label_agreement":null},{"id":"W1989607297","doi":"10.1109/wcl.2012.120312.120718","title":"Performance of Non-Symmetric Relaying Networks in the Presence of Interferers with Unequal Powers","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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":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":"Rayleigh fading; Upper and lower bounds; Computer science; Topology (electrical circuits); Moment-generating function; Monte Carlo method; Fading; Interference (communication); Applied mathematics; Algorithm; Mathematics; Telecommunications; Statistics; Probability density function; Combinatorics; Decoding methods; Mathematical analysis; Channel (broadcasting)","score_opus":0.036815811878722564,"score_gpt":0.27313305761606765,"score_spread":0.23631724573734508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989607297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8750735,0.00072168186,0.11978511,0.0028038376,0.00012185908,0.00028322742,7.7726327e-7,0.000026017213,0.0011839983],"genre_scores_gemma":[0.9904326,0.0014154875,0.007508084,0.0005549338,0.000015564967,0.000055413424,0.0000035434418,0.000009899771,0.0000044750705],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998307,0.0005493992,0.0004479005,0.0001483765,0.0002536808,0.00029363498],"domain_scores_gemma":[0.99567336,0.0009582325,0.0003036426,0.002893709,0.00012608938,0.000044963977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252218,0.00014246548,0.00022578091,0.00027792127,0.00019735246,0.00003548919,0.0044990266,0.000043734617,0.0000016790708],"category_scores_gemma":[0.000030322366,0.000107896994,0.00005124067,0.0020990733,0.000350163,0.0006468621,0.00051181566,0.00045725945,0.0000020586788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017275888,0.0019095731,0.44167492,0.00019823169,0.00026548194,0.0000029507532,0.07661229,0.13315287,0.034945436,0.078394756,0.0024254047,0.23024532],"study_design_scores_gemma":[0.0005688441,0.00013117422,0.059714593,0.0004514158,0.000016805727,0.000009982532,0.0007374764,0.935922,0.0017227428,0.0000029640928,0.0004259533,0.0002960041],"about_ca_topic_score_codex":0.00003533623,"about_ca_topic_score_gemma":0.000038986444,"teacher_disagreement_score":0.8027692,"about_ca_system_score_codex":0.00005123556,"about_ca_system_score_gemma":0.000036599176,"threshold_uncertainty_score":0.83603853},"labels":[],"label_agreement":null},{"id":"W1991454737","doi":"10.1109/lwc.2015.2415788","title":"Accuracy Analysis of the Two-Reference-Node Angle-of-Arrival Localization System","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization 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":"Western University","funders":"","keywords":"Node (physics); Angle of arrival; Computer science; Ambiguity; Time of arrival; Algorithm; Physics; Telecommunications; Wireless; Acoustics","score_opus":0.038574097183394336,"score_gpt":0.26433810439480826,"score_spread":0.22576400721141393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991454737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61718494,0.00047442017,0.37771046,0.00079485,0.00039660247,0.00032829275,0.00009113692,0.00066318054,0.0023560782],"genre_scores_gemma":[0.9988901,0.0000688179,0.0008415641,0.00008240642,0.000009876871,0.000028248669,0.000055282795,0.00001895429,0.0000047701387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895054,0.0001260132,0.0004482416,0.0001021389,0.00023187675,0.00014119473],"domain_scores_gemma":[0.99756813,0.00013872141,0.00018638538,0.0018968617,0.0001767757,0.00003315505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017920508,0.00012759486,0.00028489152,0.00031209973,0.00009751098,0.000018559938,0.0013383349,0.00008111972,0.0000025822003],"category_scores_gemma":[0.000048035618,0.00010602467,0.000118086726,0.00161941,0.00026189667,0.000117669064,0.00013293746,0.00016399042,0.0000051051425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000471223,0.000033937336,0.013411946,0.0000803073,0.00046336575,2.7446282e-7,0.00095973973,0.9605836,0.0123052085,0.008360256,0.001421736,0.0023749133],"study_design_scores_gemma":[0.00035325397,0.0000067763917,0.001113428,0.00009403315,0.00043287818,0.0000015217929,0.0010376924,0.9501432,0.0453757,0.000024589457,0.0012297055,0.00018721633],"about_ca_topic_score_codex":0.00019286804,"about_ca_topic_score_gemma":0.00012764467,"teacher_disagreement_score":0.3817051,"about_ca_system_score_codex":0.0001262118,"about_ca_system_score_gemma":0.000030447674,"threshold_uncertainty_score":0.43235606},"labels":[],"label_agreement":null},{"id":"W1992041724","doi":"10.1109/wcl.2012.041012.120016","title":"Spatial Multipath Resolution with Space Time Block Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Alberta","funders":"","keywords":"Space–time block code; MIMO; Multipath propagation; Computer science; Block code; Transmitter; Non-line-of-sight propagation; Channel state information; Interference (communication); Channel (broadcasting); Electronic engineering; Block (permutation group theory); Multipath interference; Algorithm; Telecommunications; Wireless; Decoding methods; Mathematics; Engineering","score_opus":0.014698512729094964,"score_gpt":0.23925772126557485,"score_spread":0.22455920853647987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992041724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5689541,0.0016635616,0.4150511,0.004101596,0.00023127101,0.0009798827,0.000066373264,0.0043004607,0.004651655],"genre_scores_gemma":[0.92818314,0.0006416743,0.07032885,0.0002410473,0.00008681334,0.00027719417,0.0000859705,0.00010448342,0.000050835464],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850976,0.00020061962,0.00035982896,0.00017577507,0.00024697869,0.0005070482],"domain_scores_gemma":[0.9961363,0.0002885983,0.00012514766,0.0032125406,0.000085927066,0.0001515083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024841866,0.00031534422,0.00029812596,0.00019541275,0.00034195263,0.000045456676,0.0013688509,0.00011717317,0.000014264191],"category_scores_gemma":[0.0000157257,0.00031429256,0.00007104059,0.00036965092,0.00036777245,0.0005569692,0.00018621565,0.00054305367,0.00017059632],"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.000063726984,0.00055860955,0.0044368813,0.000111847265,0.0003016526,0.0000030052054,0.002766787,0.07146025,0.8804741,0.0034784225,0.013960142,0.022384565],"study_design_scores_gemma":[0.0016436608,0.00010104267,0.006417153,0.00053219625,0.00016834724,0.00010858216,0.00027212323,0.6414131,0.25407174,0.000068767906,0.092791505,0.0024118188],"about_ca_topic_score_codex":0.00010474714,"about_ca_topic_score_gemma":0.00006468899,"teacher_disagreement_score":0.6264024,"about_ca_system_score_codex":0.00025001809,"about_ca_system_score_gemma":0.000016523043,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W1993714507","doi":"10.1109/lwc.2014.2345751","title":"Self-Interference Pricing-Based MIMO Full-Duplex Precoding","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Full-Duplex Wireless Communications","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":"McGill University","funders":"","keywords":"Precoding; Zero-forcing precoding; Computer science; MIMO; Interference (communication); Transmitter; Electronic engineering; Duplex (building); Wireless; Spectral efficiency; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.019877175582288013,"score_gpt":0.23490148197659214,"score_spread":0.21502430639430412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993714507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8242377,0.00037870632,0.1633518,0.006310656,0.0005111319,0.00059223536,0.000025789064,0.0028005715,0.0017913858],"genre_scores_gemma":[0.95039994,0.00031127504,0.047589026,0.00095195865,0.00009211317,0.00038866585,0.00010302898,0.00013893987,0.000025028887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975308,0.00040883716,0.00074670557,0.0003881128,0.00029606247,0.00062948867],"domain_scores_gemma":[0.9927412,0.0011058028,0.00017840105,0.0056343377,0.00014462283,0.00019562968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004596945,0.0004621293,0.00044878264,0.0003724239,0.0006059577,0.0001922572,0.0039060996,0.00017151768,0.00003706642],"category_scores_gemma":[0.000066204484,0.000537197,0.00018336657,0.00071554014,0.00030648778,0.00035317492,0.00030293563,0.00089299574,0.0003041742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001225608,0.00025859373,0.00074840465,0.00023511346,0.00017142123,0.0000011958997,0.001264264,0.79319155,0.18802734,0.0025017906,0.0041379947,0.0094500985],"study_design_scores_gemma":[0.00051074516,0.000030183874,0.0005001329,0.00018311942,0.000052612817,0.0000086175005,0.00006226297,0.9746183,0.0074187918,0.0000041411895,0.016023878,0.00058722706],"about_ca_topic_score_codex":0.000056559737,"about_ca_topic_score_gemma":0.0002744666,"teacher_disagreement_score":0.18142676,"about_ca_system_score_codex":0.00034955624,"about_ca_system_score_gemma":0.000049723574,"threshold_uncertainty_score":0.99970794},"labels":[],"label_agreement":null},{"id":"W1993933675","doi":"10.1109/wcl.2012.091312.120600","title":"Aggregate Interference Analysis for Underlay Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":84,"is_retracted":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; Cognitive radio; Path loss; Interference (communication); Rayleigh fading; Fading; Log-distance path loss model; Shadow mapping; Computer science; Moment (physics); Aggregate (composite); Topology (electrical circuits); Mathematical optimization; Mathematics; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Physics; Combinatorics; Artificial intelligence","score_opus":0.038536810949105646,"score_gpt":0.28097904542826524,"score_spread":0.24244223447915958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993933675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087315656,0.0009091646,0.90639853,0.004145976,0.00038199106,0.0003106751,0.000008853578,0.00017299931,0.0003561453],"genre_scores_gemma":[0.97963387,0.00031635675,0.017565718,0.0020885773,0.00022485075,0.00006920861,0.00004665776,0.000022077376,0.00003269497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981626,0.00030935093,0.00036550293,0.00035719626,0.00016045374,0.0006448473],"domain_scores_gemma":[0.9963707,0.0014149548,0.00023597461,0.0016435472,0.00015958537,0.00017527546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004993549,0.00024108196,0.00036616487,0.00031567318,0.00056446705,0.00024398607,0.001692234,0.00007953746,0.000005111201],"category_scores_gemma":[0.000030742336,0.0002495513,0.00029351015,0.0014474908,0.0002542686,0.0006727823,0.00030768928,0.0003376834,0.000013211287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019710639,0.0017711349,0.061766487,0.00007602508,0.010415271,0.000020397365,0.020062093,0.033975363,0.010758192,0.15991043,0.009325375,0.69172215],"study_design_scores_gemma":[0.00053464447,0.000035442732,0.009232738,0.000104202256,0.00042506523,0.000018494284,0.00018472975,0.98737967,0.00067379774,0.00013469296,0.0007495083,0.0005270172],"about_ca_topic_score_codex":0.00004071617,"about_ca_topic_score_gemma":0.0001376582,"teacher_disagreement_score":0.9534043,"about_ca_system_score_codex":0.00011643825,"about_ca_system_score_gemma":0.000027174312,"threshold_uncertainty_score":0.99999565},"labels":[],"label_agreement":null},{"id":"W1995434282","doi":"10.1109/wcl.2012.061212.120206","title":"Opportunistic Energy Efficient Cooperative Communication","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Efficient energy use; Metric (unit); Transmission (telecommunications); Signal-to-noise ratio (imaging); Energy (signal processing); Computer network; Wireless; Selection (genetic algorithm); Performance metric; Scheme (mathematics); Telecommunications; Engineering; Mathematics; Electrical engineering; Power (physics)","score_opus":0.0531044485982936,"score_gpt":0.2841344898953911,"score_spread":0.23103004129709748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995434282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027799606,0.0042706565,0.9282598,0.028836498,0.0005643958,0.0003687334,0.000011106308,0.0006361992,0.009253024],"genre_scores_gemma":[0.97249,0.003412544,0.018476333,0.005146676,0.00006676214,0.00013208229,0.00008305138,0.000028876186,0.00016367614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970927,0.0012034536,0.0005407265,0.0003000775,0.00031777134,0.0005452668],"domain_scores_gemma":[0.9920342,0.0006613082,0.00025894522,0.0065066195,0.00026729537,0.00027161065],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008102516,0.000286939,0.00028670015,0.00022389863,0.0013044631,0.00024993694,0.0056863124,0.000083604915,0.000029708614],"category_scores_gemma":[0.00004843697,0.0002962296,0.00011072719,0.0009620049,0.00043177733,0.0007396848,0.0015548135,0.00043952576,0.00012624194],"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.000004884463,0.00055383024,0.00034913496,0.0000065272598,0.000072046874,0.0000010390502,0.0032430664,0.0014499221,0.025122449,0.90873003,0.009695883,0.05077117],"study_design_scores_gemma":[0.001179684,0.000056292254,0.0020341163,0.00022370534,0.000061343984,0.00007496281,0.0003678689,0.75422645,0.007284608,0.00024270815,0.23266605,0.0015822329],"about_ca_topic_score_codex":0.000034468998,"about_ca_topic_score_gemma":0.00003782278,"teacher_disagreement_score":0.9446904,"about_ca_system_score_codex":0.00020918946,"about_ca_system_score_gemma":0.000086652275,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W1997211193","doi":"10.1109/wcl.2013.102513.130586","title":"A New Multicast Scheduling Scheme for Cellular Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Multicast; Scheduling (production processes); Throughput; Computational complexity theory; Distributed computing; Computer network; Mathematical optimization; Algorithm; Wireless; Mathematics","score_opus":0.0148212454460398,"score_gpt":0.23296925596472645,"score_spread":0.21814801051868665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997211193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020735534,0.00041649028,0.9759617,0.0011668041,0.0004339489,0.00042543825,0.0000041480484,0.00065996713,0.00019599703],"genre_scores_gemma":[0.58810276,0.00017303468,0.4108064,0.00032371408,0.0002835679,0.00011959555,0.00008335834,0.00008666381,0.00002091561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987708,0.00006549734,0.00038316695,0.00023326196,0.00012168839,0.0004256195],"domain_scores_gemma":[0.9976656,0.0004166538,0.00008707413,0.0016203083,0.000067971065,0.00014238515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018185559,0.00025104455,0.00026741432,0.00011148894,0.00027611302,0.0000728954,0.000903482,0.00012522074,0.000006872113],"category_scores_gemma":[0.000028199047,0.00030462,0.00010362083,0.0003373761,0.000090427864,0.0002425923,0.00007907796,0.0003463062,0.000022349474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005347455,0.000014577654,0.00006846436,0.000022434118,0.00003718919,1.7165752e-7,0.0000821002,0.94482225,0.032583646,0.0015244248,0.001735917,0.019103466],"study_design_scores_gemma":[0.0005687702,0.00000918407,0.000019302583,0.000073499046,0.000023229924,0.0000014100699,0.000017111757,0.98796684,0.002538513,0.00005208581,0.008402334,0.0003277533],"about_ca_topic_score_codex":0.000008917976,"about_ca_topic_score_gemma":0.00001856821,"teacher_disagreement_score":0.5673672,"about_ca_system_score_codex":0.00010243465,"about_ca_system_score_gemma":0.000013838282,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W2003025695","doi":"10.1109/lwc.2014.2349514","title":"On the Secrecy Rate Achievability in Dual-Hop Amplify-and-Forward Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Secrecy; Computer science; Computer network; Wireless; Transmitter power output; Hop (telecommunications); Link (geometry); Signal-to-noise ratio (imaging); Dual (grammatical number); Topology (electrical circuits); Power (physics); Telecommunications; Transmitter; Computer security; Electrical engineering; Channel (broadcasting); Physics; Engineering","score_opus":0.016061845824045892,"score_gpt":0.23849041181981875,"score_spread":0.22242856599577288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003025695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92969835,0.0002752995,0.045822825,0.020386796,0.00014803266,0.000645491,0.000011245736,0.00088603434,0.00212592],"genre_scores_gemma":[0.9935057,0.0013940709,0.0015637496,0.0029591788,0.00003772302,0.0004200532,0.00004066715,0.00007005814,0.0000087688295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973354,0.0012627896,0.0005686027,0.0002752848,0.00017987053,0.0003780906],"domain_scores_gemma":[0.991972,0.0031050998,0.00010956747,0.00467573,0.00004835722,0.00008918959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018290231,0.00030250393,0.00033670047,0.0001886675,0.00035880995,0.00011877032,0.0015140283,0.00018707332,0.000013148192],"category_scores_gemma":[0.00013215675,0.0002723408,0.00008175421,0.00049249013,0.00048072496,0.00019345766,0.00035236916,0.0014717507,0.0000346306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011371536,0.0007679307,0.0067213974,0.0002364789,0.0003497786,0.000006429373,0.007909859,0.3224901,0.0567096,0.52557236,0.02956826,0.04955412],"study_design_scores_gemma":[0.00066608784,0.000047190035,0.009319249,0.00028142732,0.000031099742,0.000011559278,0.00018375719,0.9631972,0.0022191757,0.0034795282,0.019705445,0.0008582999],"about_ca_topic_score_codex":0.00011225594,"about_ca_topic_score_gemma":0.00035003576,"teacher_disagreement_score":0.6407071,"about_ca_system_score_codex":0.00016684383,"about_ca_system_score_gemma":0.00001148018,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2003321312","doi":"10.1109/wcl.2012.101812.120671","title":"On Approximating the Cognitive Radio Aggregate Interference} \\IEEEaftertitletextvspace{-1\\baselineskip","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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 Alberta","funders":"","keywords":"Interference (communication); Cognitive radio; Rayleigh fading; Path loss; Log-distance path loss model; Shadow mapping; Moment (physics); Fading; Aggregate (composite); Power control; Upper and lower bounds; Computer science; Power (physics); Topology (electrical circuits); Telecommunications; Mathematics; Physics; Mathematical analysis; Wireless; Combinatorics; Channel (broadcasting)","score_opus":0.030751178611009723,"score_gpt":0.26774282713506914,"score_spread":0.2369916485240594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003321312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25414887,0.0006415339,0.71851057,0.022624224,0.0007925112,0.0004122653,0.000007075188,0.00024885254,0.002614102],"genre_scores_gemma":[0.98701334,0.0001284451,0.006109012,0.006294437,0.00030813777,0.00007074448,0.000011032904,0.000026851261,0.000037992857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979394,0.00054915005,0.0003716819,0.0003056417,0.00026814992,0.0005659575],"domain_scores_gemma":[0.99581707,0.0017845832,0.0002451889,0.0019243577,0.000101672944,0.00012711041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069203594,0.00026037198,0.00023606107,0.00013591438,0.00074922905,0.00027384734,0.0019413873,0.00005864997,0.000009461342],"category_scores_gemma":[0.00009676195,0.00019979499,0.0001295663,0.0005444478,0.00033854786,0.0005164349,0.00037075483,0.0006024313,0.00016837523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092181486,0.00097245147,0.002134348,0.000049785227,0.00048392898,0.00002424287,0.021437993,0.0006995882,0.020117018,0.15684761,0.017801667,0.7793392],"study_design_scores_gemma":[0.0020226396,0.00018641981,0.003792181,0.0017961039,0.00016227695,0.0002769992,0.00129631,0.9656529,0.015536528,0.0018095754,0.005494814,0.0019732616],"about_ca_topic_score_codex":0.000042648575,"about_ca_topic_score_gemma":0.00003367313,"teacher_disagreement_score":0.9649533,"about_ca_system_score_codex":0.00010027314,"about_ca_system_score_gemma":0.000029673956,"threshold_uncertainty_score":0.8147403},"labels":[],"label_agreement":null},{"id":"W2005686751","doi":"10.1109/lwc.2014.2357032","title":"Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Collision; Routing (electronic design automation); Computer network; Mathematical optimization; Dynamic Source Routing; Static routing; Link-state routing protocol; Minification; Time constraint; Constraint (computer-aided design); Equal-cost multi-path routing; Routing protocol; Distributed computing; Engineering; Mathematics","score_opus":0.027816884016450803,"score_gpt":0.25285235047095966,"score_spread":0.22503546645450886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005686751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26538435,0.00009120058,0.72553,0.008024436,0.00009233001,0.00068821135,0.0000025071836,0.0001040157,0.00008292759],"genre_scores_gemma":[0.92385507,0.0005005111,0.073653325,0.0015500239,0.000033126493,0.0003034043,0.000058894937,0.000028729748,0.000016919163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978386,0.0006838212,0.00051199226,0.0004589474,0.00017797,0.0003286263],"domain_scores_gemma":[0.9963742,0.0010696248,0.0002488974,0.0018723862,0.0003424878,0.00009241241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074191584,0.00025271272,0.0003233015,0.00020359932,0.00073601655,0.00028210302,0.0011950606,0.00009415552,0.0000012479289],"category_scores_gemma":[0.00010077049,0.00024121124,0.000045014553,0.0007499864,0.00017732503,0.0005698891,0.00036983812,0.00032255324,0.0000027398692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002316678,0.0008964322,0.013399526,0.00008003264,0.00018018945,0.0000029881014,0.016778097,0.59810656,0.12725252,0.11150903,0.0019703377,0.12959263],"study_design_scores_gemma":[0.0012398066,0.00007535945,0.003259537,0.00019011403,0.000008616412,0.000005860212,0.00014062846,0.9925829,0.0012393373,0.000010509316,0.0009294788,0.00031785254],"about_ca_topic_score_codex":0.000029225737,"about_ca_topic_score_gemma":0.0007664673,"teacher_disagreement_score":0.65847075,"about_ca_system_score_codex":0.00012808887,"about_ca_system_score_gemma":0.000049981874,"threshold_uncertainty_score":0.9836309},"labels":[],"label_agreement":null},{"id":"W2007538147","doi":"10.1109/lwc.2015.2422820","title":"Transient Analysis for a Trust-Based Cognitive Radio Collaborative Spectrum Sensing Scheme","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","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 British Columbia","funders":"","keywords":"Transient (computer programming); Cognitive radio; Computer science; Cascading Style Sheets; Scheme (mathematics); Transient analysis; Process (computing); Energy (signal processing); Topology (electrical circuits); Computer network; Transient response; Telecommunications; Wireless; Mathematics; Statistics; Engineering; Electrical engineering","score_opus":0.036876142401522455,"score_gpt":0.2785901626221066,"score_spread":0.24171402022058416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007538147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12600058,0.00025914455,0.8504451,0.021911237,0.00019155581,0.0006078832,0.000055836077,0.00020364726,0.00032500527],"genre_scores_gemma":[0.88014555,0.00002827238,0.11723875,0.0023243306,0.000092898226,0.000042685006,0.000088486755,0.000026706522,0.000012296452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764115,0.00044934973,0.000453054,0.0005716292,0.00036224409,0.00052258285],"domain_scores_gemma":[0.99642104,0.0009593807,0.00025147776,0.0016163847,0.0005081498,0.00024357546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061706797,0.00030355068,0.00050894823,0.00053621625,0.00055519363,0.00033851797,0.0011332039,0.000084064784,0.0000021642231],"category_scores_gemma":[0.000059349637,0.00032674588,0.00030502948,0.0027287358,0.00034440498,0.00034589178,0.000105014806,0.0003095773,0.000014486156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026728832,0.0053918245,0.0200195,0.00029548036,0.025557749,0.00056393584,0.092796504,0.23827776,0.113950565,0.10074819,0.033976395,0.3657492],"study_design_scores_gemma":[0.0016982382,0.00008704893,0.0005726202,0.00006504367,0.0003208415,0.000010107828,0.0004914999,0.99056834,0.0038567225,0.00016432008,0.0016949357,0.00047025227],"about_ca_topic_score_codex":0.00008346369,"about_ca_topic_score_gemma":0.00043895835,"teacher_disagreement_score":0.75414497,"about_ca_system_score_codex":0.00028019375,"about_ca_system_score_gemma":0.00029483798,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W2016868347","doi":"10.1109/wcl.2012.031512.120063","title":"Design of Heterogeneous Sensor Networks with Lifetime and Coverage Considerations","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Wireless sensor network; Computer science; Computer network; Scalability; Key distribution in wireless sensor networks; Focus (optics); Sink (geography); Distributed computing; Wireless network; Wireless; Telecommunications","score_opus":0.023400877514377423,"score_gpt":0.23058948925822687,"score_spread":0.20718861174384945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016868347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11507688,0.0007240495,0.88099647,0.0025125893,0.00015021677,0.00028194377,0.0000029208613,0.00015117685,0.00010375349],"genre_scores_gemma":[0.83032036,0.000295497,0.16794887,0.0013017071,0.000047592115,0.00004358445,0.000006316525,0.000025773743,0.000010315437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981062,0.0005300914,0.00038735394,0.00027987687,0.00024370593,0.00045281992],"domain_scores_gemma":[0.99593323,0.0012018131,0.00025673292,0.0023254638,0.000113652946,0.00016908415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034503505,0.0002354056,0.00029682062,0.00014229321,0.00038698135,0.00011364381,0.00093994115,0.00009297813,0.0000042853694],"category_scores_gemma":[0.000014444489,0.00022268585,0.000046772486,0.000378345,0.0004294863,0.00042824863,0.00029261172,0.0002847489,0.000006309884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009883319,0.00016581579,0.0010255472,0.000007495549,0.00007654144,0.0000055649093,0.00069410977,0.9828793,0.007951202,0.0056282273,0.00035910297,0.001197228],"study_design_scores_gemma":[0.0005424574,0.000067987676,0.000601667,0.00007880008,0.000041089326,0.00024889092,0.000019997886,0.99300885,0.004633071,0.000020160513,0.0003083475,0.0004286905],"about_ca_topic_score_codex":0.000024933744,"about_ca_topic_score_gemma":0.0000093614035,"teacher_disagreement_score":0.71524346,"about_ca_system_score_codex":0.000042974392,"about_ca_system_score_gemma":0.000035585377,"threshold_uncertainty_score":0.90808654},"labels":[],"label_agreement":null},{"id":"W2021610694","doi":"10.1109/wcl.2013.032013.130164","title":"On Planar Tessellations and Interference Estimation in Wireless Ad-Hoc Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Analysis","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":"Wireless ad hoc network; Planar; Interference (communication); Square (algebra); Computer science; Hexagonal tiling; Stochastic geometry; Wireless; Stochastic geometry models of wireless networks; Wireless network; Hexagonal crystal system; Range (aeronautics); Transmitter; Probabilistic logic; Topology (electrical circuits); Algorithm; Geometry; Mathematics; Vehicular ad hoc network; Computer network; Telecommunications; Statistics; Combinatorics; Artificial intelligence; Channel (broadcasting); Engineering","score_opus":0.015030103448296193,"score_gpt":0.22293545251200864,"score_spread":0.20790534906371244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021610694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67259157,0.00046851995,0.32362816,0.0025487235,0.00006668708,0.00021884235,0.0000046674786,0.00019435564,0.00027845413],"genre_scores_gemma":[0.99596316,0.0014410004,0.0019515031,0.00043805558,0.0000100804245,0.000107752334,0.000042771182,0.00002668366,0.000018982146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920815,0.000076054675,0.0002809384,0.00015134484,0.00008243792,0.00020106821],"domain_scores_gemma":[0.9988175,0.00029328253,0.000046558347,0.00075231335,0.000029276775,0.00006106883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000867733,0.00015905271,0.00018513927,0.00022464988,0.00012911805,0.00008842123,0.0004276733,0.00007091148,0.000020541467],"category_scores_gemma":[0.0000073003434,0.00016646755,0.000035947818,0.00036233143,0.00012253805,0.00022967625,0.000030872958,0.00032578252,0.000064239495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003080411,0.00038552948,0.008447368,0.00016460152,0.00039741065,0.000011014765,0.0041185804,0.46306095,0.27176628,0.009871346,0.012660799,0.22908531],"study_design_scores_gemma":[0.00015688491,0.000009792924,0.0034370555,0.0001243828,0.000013270997,0.0000019656788,0.000097504664,0.99571043,0.00007462517,0.0001451092,0.000047069832,0.00018192209],"about_ca_topic_score_codex":0.000055360742,"about_ca_topic_score_gemma":0.00014239944,"teacher_disagreement_score":0.53264946,"about_ca_system_score_codex":0.0000661678,"about_ca_system_score_gemma":0.000005521806,"threshold_uncertainty_score":0.678835},"labels":[],"label_agreement":null},{"id":"W2023381350","doi":"10.1109/lwc.2015.2402126","title":"Resource Provisioning in Wireless Virtualized Networks via Massive-MIMO","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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 Toronto; McGill University","funders":"","keywords":"Computer science; Provisioning; Base station; Computer network; Wireless network; Resource allocation; Wireless; Femtocell; MIMO; Geometric programming; Orthogonal frequency-division multiple access; Distributed computing; Mathematical optimization; Channel (broadcasting); Orthogonal frequency-division multiplexing; Telecommunications; Mathematics","score_opus":0.02093999804864105,"score_gpt":0.24867261659646933,"score_spread":0.22773261854782828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023381350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097806826,0.0006697471,0.8967974,0.0014299029,0.0004057026,0.00065363117,0.0000056883882,0.00072638126,0.0015046855],"genre_scores_gemma":[0.9882433,0.0001572495,0.010661978,0.00034764296,0.000088966204,0.00024927588,0.00009915035,0.0001113536,0.00004112175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981965,0.00029353832,0.00061863894,0.00026825766,0.00020628732,0.00041681598],"domain_scores_gemma":[0.9975632,0.0002316389,0.00014384478,0.0018240907,0.00008434461,0.00015292673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040518955,0.00027667423,0.00035839164,0.00027119744,0.00015062605,0.00007198661,0.0010646565,0.00015431055,0.000003041824],"category_scores_gemma":[0.000030160703,0.00032050262,0.000060756887,0.0007334973,0.00014774347,0.00041223312,0.00015806283,0.0005571093,0.00003371037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014281291,0.00003592951,0.00041340993,0.000019941912,0.000023326973,0.0000057336574,0.0008755246,0.9797428,0.008657179,0.000350319,0.0021085246,0.007752988],"study_design_scores_gemma":[0.00094460975,0.0000122087595,0.00006681341,0.00019259675,0.000011450703,0.000008572081,0.0003582149,0.9937944,0.00067594036,0.000023129274,0.003533722,0.0003783694],"about_ca_topic_score_codex":0.00008172346,"about_ca_topic_score_gemma":0.00013344787,"teacher_disagreement_score":0.8904364,"about_ca_system_score_codex":0.00041775033,"about_ca_system_score_gemma":0.000027380074,"threshold_uncertainty_score":0.9999247},"labels":[],"label_agreement":null},{"id":"W2027091837","doi":"10.1109/lwc.2015.2421910","title":"Performance Analysis of Non-Orthogonal AF Relaying in Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Mathematical optimization; Computer science; Probability density function; Signal-to-noise ratio (imaging); Underlay; Channel (broadcasting); Transmission (telecommunications); Optimization problem; Quadratic growth; Quadratic equation; Topology (electrical circuits); Mathematics; Algorithm; Wireless; Telecommunications; Statistics","score_opus":0.06310172859259572,"score_gpt":0.30368277000474037,"score_spread":0.24058104141214465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027091837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67547077,0.0004969243,0.32038555,0.0020266608,0.000108670356,0.00017634992,0.0000026322002,0.000056414177,0.0012760307],"genre_scores_gemma":[0.9897264,0.0015464637,0.007757155,0.00080440775,0.000018883056,0.00007200567,0.000042676853,0.000011236222,0.000020720168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816585,0.00045482864,0.0005573525,0.0002866644,0.00025901545,0.00027627242],"domain_scores_gemma":[0.9964503,0.0005392529,0.0002670477,0.0023553688,0.00027755823,0.00011046073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009383394,0.00017235399,0.00038972884,0.0006504614,0.00022035353,0.000072005816,0.0029029606,0.00006661755,0.000004857519],"category_scores_gemma":[0.000040206967,0.00018703466,0.00012418212,0.0037121526,0.00025829824,0.0005490423,0.0006998549,0.00046351852,0.000007061967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007763058,0.0007368356,0.35648042,0.000022918095,0.001298395,0.000010417203,0.01693558,0.40909338,0.00572156,0.008151955,0.0021767819,0.1992941],"study_design_scores_gemma":[0.00047867539,0.000021299533,0.06265117,0.00010012693,0.00007277865,0.000002346839,0.000111831585,0.9360404,0.00014261635,0.000004155084,0.00017526845,0.00019932436],"about_ca_topic_score_codex":0.000031996984,"about_ca_topic_score_gemma":0.000261074,"teacher_disagreement_score":0.526947,"about_ca_system_score_codex":0.00012686351,"about_ca_system_score_gemma":0.00009708363,"threshold_uncertainty_score":0.76270527},"labels":[],"label_agreement":null},{"id":"W2028741922","doi":"10.1109/wcl.2011.111211.110064","title":"Spatial Multipath Resolution for MIMO Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Analysis","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":"Rake receiver; MIMO; Multipath propagation; Computer science; Beamforming; Non-line-of-sight propagation; Transmitter; Multi-user MIMO; Spatial multiplexing; Electronic engineering; Multipath interference; 3G MIMO; Transmission (telecommunications); Channel (broadcasting); Wireless; Telecommunications; Engineering","score_opus":0.05010305113049045,"score_gpt":0.23611184128193777,"score_spread":0.18600879015144733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028741922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048326567,0.00040539476,0.9493669,0.00030049245,0.00031655637,0.00029571558,0.000033410146,0.0003426663,0.0006122651],"genre_scores_gemma":[0.9921275,0.00018190057,0.0071612457,0.00011932989,0.00007067066,0.00021477276,0.000044973447,0.00003465648,0.000044970475],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992904,0.00006063961,0.00024939587,0.000116468924,0.00007997883,0.00020310181],"domain_scores_gemma":[0.99875766,0.00007703265,0.0000492045,0.0010147368,0.00005022717,0.00005115703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013785115,0.00012395064,0.00016523166,0.0001157728,0.00017391844,0.000027393091,0.0005854205,0.000060152823,0.000005274315],"category_scores_gemma":[0.0000068736144,0.00013067796,0.00010147157,0.00014539207,0.000089186746,0.00010569052,0.000027612854,0.00012736378,0.00003732045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005518994,0.00027553804,0.0018300682,0.00028091102,0.0006546189,0.0000055058986,0.0043148063,0.009799013,0.95158786,0.006059795,0.0144434925,0.010693216],"study_design_scores_gemma":[0.00024549649,0.000010289338,0.00045023646,0.00004561569,0.000054862794,0.0000022787685,0.00013587455,0.9949949,0.0010322054,0.0000111189,0.002822806,0.00019433264],"about_ca_topic_score_codex":0.0004951551,"about_ca_topic_score_gemma":0.00009172207,"teacher_disagreement_score":0.9851959,"about_ca_system_score_codex":0.0000603226,"about_ca_system_score_gemma":0.000006648214,"threshold_uncertainty_score":0.53288925},"labels":[],"label_agreement":null},{"id":"W2032839102","doi":"10.1109/lwc.2014.2351818","title":"RF Energy Harvesting With Cooperative Beam Selection for Wireless Sensors","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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 Victoria","funders":"","keywords":"Energy harvesting; Rayleigh fading; Computer science; Wireless sensor network; Beamforming; MIMO; Radio frequency; Transmission (telecommunications); Fading; Energy (signal processing); Wireless; Electronic engineering; Computer network; Telecommunications; Engineering; Mathematics; Channel (broadcasting)","score_opus":0.01414695946532515,"score_gpt":0.2189594085956752,"score_spread":0.20481244913035004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032839102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56721115,0.00006397566,0.42948288,0.0007420211,0.0003070798,0.00024279158,0.0000122674355,0.0010103091,0.00092751905],"genre_scores_gemma":[0.9822584,0.00010751546,0.015485806,0.0006618695,0.00037285633,0.00057978084,0.00012587367,0.00019850527,0.00020939048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981242,0.00016565614,0.00048887543,0.00039529265,0.00023124252,0.0005947418],"domain_scores_gemma":[0.9969698,0.0011224262,0.00016001062,0.0013621273,0.00023650742,0.00014910163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032631657,0.00042979504,0.00042196567,0.0001958888,0.00068155763,0.00017656974,0.00096839224,0.00017218031,0.0000037707841],"category_scores_gemma":[0.000043971002,0.0004452387,0.00009234384,0.0006332608,0.00033227465,0.00036833138,0.00007236275,0.00048418387,0.000008627878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001850476,0.000048665643,0.00066636404,0.000058472517,0.00014555534,6.6579895e-7,0.00025134225,0.89759886,0.08463178,0.0037782697,0.0022492092,0.010552289],"study_design_scores_gemma":[0.00072901056,0.00008176327,0.00024921936,0.00027766393,0.00006186325,0.000029526695,0.00006398075,0.9458309,0.03767241,0.00002254569,0.014283947,0.0006971625],"about_ca_topic_score_codex":0.00023719677,"about_ca_topic_score_gemma":0.00094311405,"teacher_disagreement_score":0.41504726,"about_ca_system_score_codex":0.00020096522,"about_ca_system_score_gemma":0.000035350095,"threshold_uncertainty_score":0.99979997},"labels":[],"label_agreement":null},{"id":"W2033150818","doi":"10.1109/wcl.2013.13.130292","title":"Reconfigurable Feedback Shift Register Based Stream Cipher for Wireless Sensor Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Security in Wireless Sensor Networks","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":"Computer science; Stream cipher; Wireless sensor network; Cipher; Cryptography; Overhead (engineering); Block cipher mode of operation; Embedded system; Shift register; Computer network; Encryption; Telecommunications; Algorithm","score_opus":0.027511038136833036,"score_gpt":0.2504166585981517,"score_spread":0.22290562046131868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033150818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1404637,0.00028329197,0.7824778,0.070233665,0.0013921916,0.0023015633,0.000028003193,0.00095638935,0.0018633922],"genre_scores_gemma":[0.92912364,0.00012412385,0.05720565,0.011591199,0.000306231,0.0011654195,0.00010472557,0.0001142072,0.00026480522],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588895,0.00056079036,0.0009515705,0.0009690764,0.00044800152,0.0011816061],"domain_scores_gemma":[0.98952734,0.0019388068,0.00054141675,0.0072845677,0.00037999815,0.00032787165],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053021044,0.0005959583,0.00065422186,0.00025866381,0.0008620957,0.000943628,0.0063093915,0.0003578199,0.00007315672],"category_scores_gemma":[0.00003557981,0.0006361543,0.00036490432,0.0008542201,0.0005461673,0.0011230153,0.00032691195,0.00085098646,0.0002609551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016804959,0.002418962,0.004353603,0.0004488244,0.00094607775,0.000037888,0.004971327,0.20720384,0.037278052,0.047766548,0.46426162,0.2301452],"study_design_scores_gemma":[0.0012804781,0.000063075415,0.000868919,0.00020215598,0.000038921626,0.000014114753,0.000098297205,0.9820355,0.0020377159,0.00033125296,0.012082337,0.0009471845],"about_ca_topic_score_codex":0.0004977868,"about_ca_topic_score_gemma":0.00019806046,"teacher_disagreement_score":0.78865993,"about_ca_system_score_codex":0.00023397726,"about_ca_system_score_gemma":0.000098691875,"threshold_uncertainty_score":0.999609},"labels":[],"label_agreement":null},{"id":"W2033226012","doi":"10.1109/wcl.2013.070913.130310","title":"An Energy-Efficient Transmission Range Assignment for 1-D Wireless Ad Hoc Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Mobile Ad Hoc Networks","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":"Wireless ad hoc network; Computer science; Range (aeronautics); Transmission (telecommunications); Computer network; Node (physics); Energy consumption; Wireless network; Bounded function; Wireless; Topology (electrical circuits); Telecommunications; Mathematics; Engineering","score_opus":0.01744871819082773,"score_gpt":0.24696025626022897,"score_spread":0.22951153806940122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033226012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034053534,0.0013735025,0.9508324,0.011706332,0.000455058,0.0010553509,0.0000055784994,0.00041356406,0.00010465017],"genre_scores_gemma":[0.933423,0.0009417343,0.058921505,0.0041500623,0.00012858756,0.0022584607,0.00006156735,0.00006127398,0.000053801523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969971,0.0004995267,0.0006256914,0.00070696237,0.0004204476,0.00075025763],"domain_scores_gemma":[0.9936839,0.00053379027,0.00026834413,0.0049843993,0.00018135746,0.00034822963],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004823712,0.00038061326,0.00038281197,0.000159599,0.000774804,0.00044344767,0.0055578714,0.00018764596,0.000020673337],"category_scores_gemma":[0.0000032436462,0.00037393035,0.00020605639,0.0005711308,0.0002498122,0.0006667225,0.00030496283,0.00039461922,0.000027293876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018602206,0.00067118165,0.000048883976,0.000020247271,0.00006364203,0.0000025206766,0.00092450966,0.13786799,0.024854353,0.011957423,0.013133119,0.8104375],"study_design_scores_gemma":[0.00070567074,0.000093266215,0.00023002972,0.000081294405,0.000019992523,0.000006224303,0.000039119514,0.9777956,0.00092396303,0.00013151167,0.019509315,0.000464026],"about_ca_topic_score_codex":0.000075811164,"about_ca_topic_score_gemma":0.000036047342,"teacher_disagreement_score":0.8993695,"about_ca_system_score_codex":0.000203637,"about_ca_system_score_gemma":0.000061273095,"threshold_uncertainty_score":0.99987125},"labels":[],"label_agreement":null},{"id":"W2034787332","doi":"10.1109/lwc.2015.2400995","title":"Fair Scheduling for Energy Harvesting Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Energy harvesting; Scheduling (production processes); Wireless; MIMO; Mathematical optimization; Power control; Lyapunov optimization; Transmitter power output; Queue; Computer network; Channel (broadcasting); Energy (signal processing); Power (physics); Transmitter; Telecommunications; Mathematics","score_opus":0.05142953384261153,"score_gpt":0.2564653820463407,"score_spread":0.20503584820372914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034787332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22784398,0.0010355716,0.76361394,0.0019114312,0.00098281,0.0001839759,0.000017132616,0.0016715137,0.00273963],"genre_scores_gemma":[0.8869939,0.000120399236,0.11131735,0.0006550086,0.00030141193,0.00030832566,0.000082165396,0.0001246444,0.000096815245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998551,0.000102013015,0.00044024893,0.0002431753,0.00019111132,0.00047243896],"domain_scores_gemma":[0.99730414,0.0006264182,0.00009806721,0.0016338079,0.00014389642,0.00019366818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036531547,0.0002739732,0.00027721733,0.00015090879,0.00028050147,0.00013823503,0.0013399542,0.00013037027,0.0000013820473],"category_scores_gemma":[0.0000951207,0.0003235877,0.00009980483,0.00035469478,0.00020093122,0.000347377,0.00013172525,0.00032365497,0.000013496703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005169259,0.000030132314,0.00041204537,0.0000398564,0.0000718699,0.000001733856,0.0002693744,0.9487855,0.023752488,0.0069474597,0.0045956774,0.015088711],"study_design_scores_gemma":[0.0005223088,0.000012383613,0.00006478773,0.00017493316,0.000029267687,0.000011347348,0.000112157795,0.9691581,0.0054376004,0.0002038977,0.02380452,0.00046871172],"about_ca_topic_score_codex":0.00013970704,"about_ca_topic_score_gemma":0.00016959177,"teacher_disagreement_score":0.6591499,"about_ca_system_score_codex":0.00018778814,"about_ca_system_score_gemma":0.000042187356,"threshold_uncertainty_score":0.9999216},"labels":[],"label_agreement":null},{"id":"W2036446891","doi":"10.1109/wcl.2013.012513.120837","title":"Rational Gauss-Chebyshev Quadratures for Wireless Performance Analysis","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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 Alberta","funders":"","keywords":"Chebyshev filter; Wireless; Rate of convergence; Quadrature (astronomy); Rational function; Signal-to-noise ratio (imaging); Computer science; Convergence (economics); Gauss; Function (biology); Algorithm; Mathematics; Applied mathematics; Statistics; Mathematical analysis; Telecommunications; Physics; Electronic engineering; Engineering","score_opus":0.0177842799983198,"score_gpt":0.2572134825973886,"score_spread":0.23942920259906877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036446891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6384668,0.00047106636,0.3533575,0.003871104,0.00017425293,0.00117424,0.00006694895,0.001539256,0.00087888277],"genre_scores_gemma":[0.94856864,0.0012370875,0.046461836,0.0007767544,0.000065265405,0.0022678918,0.00044710163,0.000093323855,0.00008210484],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813336,0.0001188249,0.00069818617,0.0003143242,0.000273721,0.0004616057],"domain_scores_gemma":[0.9953754,0.0005488492,0.00017989238,0.0034672073,0.00030275094,0.00012588447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023594806,0.00036955724,0.00047984952,0.00052845717,0.00053170434,0.0001693115,0.002327576,0.00017033864,0.000056591656],"category_scores_gemma":[0.00001910012,0.00040723567,0.00026779753,0.0011600256,0.00034228346,0.0008324704,0.00016373738,0.0005221408,0.000082104045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000251002,0.0002962234,0.005800231,0.00027015965,0.0019641637,6.5195195e-7,0.0012173129,0.18956853,0.6770338,0.005490983,0.056344368,0.061988488],"study_design_scores_gemma":[0.0004560981,0.000027796827,0.008112569,0.00007250445,0.00023258683,0.000004193363,0.00013157493,0.9089359,0.07180172,0.00021069891,0.009136808,0.00087756076],"about_ca_topic_score_codex":0.000051067913,"about_ca_topic_score_gemma":0.00008042519,"teacher_disagreement_score":0.7193674,"about_ca_system_score_codex":0.00020781362,"about_ca_system_score_gemma":0.000029002966,"threshold_uncertainty_score":0.99983793},"labels":[],"label_agreement":null},{"id":"W2047516065","doi":"10.1109/wcl.2014.031814.140016","title":"Fading Statistics for the Joint Fading and Two Path Shadowing Channel","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"York University; University of Calgary","funders":"","keywords":"Fading; Fading distribution; Channel state information; Shadow mapping; Joint (building); Log-distance path loss model; Level crossing; Statistics; Path loss; Mathematics; Channel (broadcasting); Computer science; Telecommunications; Rayleigh fading; Wireless; Artificial intelligence; Engineering","score_opus":0.03264970936028006,"score_gpt":0.2730584988910536,"score_spread":0.24040878953077355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047516065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016460769,0.00060573313,0.97850966,0.0027926355,0.00016376772,0.0005344272,0.00005126261,0.00067810016,0.00020361002],"genre_scores_gemma":[0.89147663,0.0014676916,0.10558869,0.0007340202,0.000065908105,0.0005305202,0.000042761683,0.000084303734,0.000009469558],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879503,0.00012453343,0.00041782652,0.00019321463,0.00013673517,0.0003326718],"domain_scores_gemma":[0.9959954,0.0015378825,0.00011822906,0.0021989585,0.00007902586,0.00007049376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005131272,0.00023833288,0.00026139428,0.00013287032,0.00076911785,0.000113000235,0.0012266758,0.000058670572,0.0000017782213],"category_scores_gemma":[0.0000714855,0.00022576647,0.000063510604,0.00019364849,0.0002899923,0.00023665438,0.00023585586,0.0004224311,0.000005016113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016680362,0.000100103636,0.0003406979,0.0004280278,0.00036244083,0.0000012534745,0.007236327,0.20414373,0.3320079,0.12600847,0.011764455,0.3175899],"study_design_scores_gemma":[0.00037938752,0.0000143967145,0.00019567141,0.00014045132,0.000039894065,0.0000069275825,0.00025750196,0.98207647,0.0069570383,0.001717732,0.007854977,0.0003595664],"about_ca_topic_score_codex":0.000033529668,"about_ca_topic_score_gemma":0.00003961863,"teacher_disagreement_score":0.87501585,"about_ca_system_score_codex":0.00010897478,"about_ca_system_score_gemma":0.000008266805,"threshold_uncertainty_score":0.92064893},"labels":[],"label_agreement":null},{"id":"W2053823116","doi":"10.1109/wcl.2012.051712.120156","title":"Prediction-Based Energy-Aware Relay Cooperation for Lifetime Maximization","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Relay; Maximization; Power (physics); Channel (broadcasting); Channel state information; Energy (signal processing); Computational complexity theory; Mathematical optimization; Computer network; Algorithm; Wireless; Telecommunications; Mathematics","score_opus":0.04824519487529482,"score_gpt":0.2687440016354856,"score_spread":0.2204988067601908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053823116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002675589,0.00060217554,0.97618335,0.01890861,0.0005287555,0.000389808,0.000021932277,0.00040825197,0.00028150613],"genre_scores_gemma":[0.9191566,0.00057156745,0.07342876,0.0056075742,0.00017247122,0.0005918482,0.00033141335,0.000031091193,0.00010864878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.00045838492,0.00046410662,0.00028219653,0.00021309666,0.0003799756],"domain_scores_gemma":[0.99576145,0.00056607515,0.00020391989,0.002976908,0.0003413571,0.00015027284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005566018,0.00021679887,0.00019844243,0.00020952254,0.0010695204,0.00020954569,0.0022910354,0.000099752266,0.000013770602],"category_scores_gemma":[0.00003874141,0.00023351311,0.00010855675,0.0007173308,0.00013702273,0.0010401886,0.00026809523,0.0002164845,0.000028316223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073024166,0.0019667658,0.008452742,0.00008592993,0.00028033543,8.7341635e-7,0.0044602333,0.046800647,0.07613458,0.43373224,0.123033874,0.30497876],"study_design_scores_gemma":[0.0005800869,0.000029485145,0.00049261935,0.000051502717,0.000019500496,0.0000034001366,0.000015127272,0.92506784,0.003656281,0.000025498584,0.06977024,0.00028840688],"about_ca_topic_score_codex":0.000010698526,"about_ca_topic_score_gemma":0.00003103885,"teacher_disagreement_score":0.916481,"about_ca_system_score_codex":0.00017040058,"about_ca_system_score_gemma":0.00009450356,"threshold_uncertainty_score":0.9522388},"labels":[],"label_agreement":null},{"id":"W2055465175","doi":"10.1109/wcl.2012.072012.120473","title":"Performance Analysis of Pairwise Amplify-and-Forward Multi-Way Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","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":"University of Alberta","funders":"","keywords":"Moment-generating function; Pairwise error probability; Cumulative distribution function; Relay; Probability density function; Computer science; Pairwise comparison; Expression (computer science); Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Context (archaeology); Closed-form expression; Interference (communication); Random variable; Algorithm; Mathematics; Telecommunications; Fading; Statistics; Power (physics); Decoding methods; Artificial intelligence; Channel (broadcasting); Physics","score_opus":0.0512651973555051,"score_gpt":0.28661516263349224,"score_spread":0.23534996527798713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055465175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46691784,0.0019397591,0.5275312,0.0028479346,0.00016778398,0.00018770254,0.0000039971546,0.00014033279,0.000263427],"genre_scores_gemma":[0.9598008,0.0063561047,0.03252336,0.0011487284,0.000027659538,0.00006284948,0.000029281342,0.000014129583,0.000037088983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982191,0.00048741497,0.00049551675,0.00023810151,0.00019154433,0.0003683228],"domain_scores_gemma":[0.99526453,0.00047699135,0.00027515346,0.0036993574,0.00013096034,0.0001529836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457085,0.0001955671,0.00037287807,0.00038745903,0.00050332665,0.00007581122,0.0026960135,0.00008270975,0.0000087123135],"category_scores_gemma":[0.000022157335,0.00019412067,0.0001382524,0.0018756015,0.000313864,0.0007109624,0.00093263935,0.00041153515,0.000011259711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028078946,0.001333496,0.37943986,0.00006623119,0.0027068665,0.0000011082763,0.015353053,0.08655497,0.024475247,0.04820722,0.0032223202,0.43861154],"study_design_scores_gemma":[0.00022732453,0.000011807919,0.08635599,0.00003327384,0.00014887305,0.0000023860616,0.000034976874,0.9101032,0.00027351035,8.396744e-7,0.0025757034,0.00023208687],"about_ca_topic_score_codex":0.000025579151,"about_ca_topic_score_gemma":0.00006509718,"teacher_disagreement_score":0.82354826,"about_ca_system_score_codex":0.00006408273,"about_ca_system_score_gemma":0.000018575955,"threshold_uncertainty_score":0.7916011},"labels":[],"label_agreement":null},{"id":"W2063772741","doi":"10.1109/wcl.2014.021314.140030","title":"Privacy Risks in Publishing Mobile Device Trajectories","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Privacy-Preserving Technologies in Data","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; University of British Columbia","funders":"","keywords":"Computer science; Geospatial analysis; Trajectory; Matching (statistics); Location-based service; Data publishing; Mobile device; Privacy software; Location data; Information sensitivity; Information privacy; Computer security; Privacy protection; Mobile computing; Feature (linguistics); Internet privacy; Data mining; Publishing; Computer network; World Wide Web; Geography; Remote sensing; Mathematics","score_opus":0.06914141377382978,"score_gpt":0.31375737481475346,"score_spread":0.2446159610409237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063772741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55248725,0.0002978265,0.2883617,0.15599026,0.0004292791,0.00037340802,0.000011130481,0.0012789583,0.00077020127],"genre_scores_gemma":[0.7878989,0.00016212685,0.21001971,0.001626465,0.000031331125,0.00021997881,0.000020381529,0.000018073559,0.000003007006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773383,0.0004737072,0.00046837286,0.0005154589,0.00033368843,0.00047493915],"domain_scores_gemma":[0.9726465,0.0010831262,0.00021356455,0.025901033,0.000086391934,0.00006941274],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011347565,0.00021543831,0.0002639328,0.00038001317,0.00032184727,0.0009173737,0.0776652,0.00015150789,0.0000029493622],"category_scores_gemma":[0.00562368,0.00023343632,0.000060463866,0.0013637955,0.00032769484,0.003375272,0.046606064,0.0009096395,0.00003969085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015225753,0.0008722151,0.07001698,0.00019187655,0.00012552377,0.000020105861,0.0049856524,0.0014783276,0.04269205,0.045809105,0.27445582,0.55933714],"study_design_scores_gemma":[0.001657668,0.00009511701,0.03254737,0.00041348932,0.0000229073,0.00003731126,0.0003659888,0.787317,0.014152655,0.050192375,0.1115388,0.0016593263],"about_ca_topic_score_codex":0.0009557171,"about_ca_topic_score_gemma":0.00031071063,"teacher_disagreement_score":0.78583866,"about_ca_system_score_codex":0.00019224206,"about_ca_system_score_gemma":0.00005484905,"threshold_uncertainty_score":0.9611048},"labels":[],"label_agreement":null},{"id":"W2069278863","doi":"10.1109/lwc.2014.2316378","title":"A Practical Differential Receiver for Amplify-and-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Computer science; Algorithm; Channel (broadcasting); Keying; Telecommunications","score_opus":0.06727772671051806,"score_gpt":0.32526192886380795,"score_spread":0.2579842021532899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069278863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028172413,0.000081038845,0.91226,0.058265544,0.00021892306,0.0003053276,0.0000025716274,0.00018846062,0.00050574064],"genre_scores_gemma":[0.8716831,0.0007613518,0.12367086,0.003525505,0.00007065012,0.00019055969,0.000017825827,0.000018159477,0.00006199459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984046,0.0005082867,0.00032145643,0.00032773305,0.0001582529,0.0002796193],"domain_scores_gemma":[0.99542606,0.0015168857,0.00015222425,0.0026684348,0.00012287174,0.00011352811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005127621,0.00017099825,0.00022045772,0.00011437901,0.00085513736,0.00027830273,0.0019478783,0.000074457035,0.0000048708102],"category_scores_gemma":[0.00013889973,0.00017154156,0.00007822448,0.00025731107,0.00022157874,0.0004620556,0.00074365805,0.00039099887,0.000019285146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002464411,0.0002187146,0.0005197941,0.000031379583,0.000102986836,6.753775e-7,0.001899784,0.00005737692,0.054528,0.7178916,0.024943281,0.19978176],"study_design_scores_gemma":[0.0013160908,0.00008114588,0.0014788136,0.00010600789,0.00004608349,0.00002932487,0.000056599572,0.8166365,0.0015606025,0.00096238154,0.17709045,0.0006360136],"about_ca_topic_score_codex":0.0000067904325,"about_ca_topic_score_gemma":0.000023165429,"teacher_disagreement_score":0.8435107,"about_ca_system_score_codex":0.000053463056,"about_ca_system_score_gemma":0.000032383123,"threshold_uncertainty_score":0.69952613},"labels":[],"label_agreement":null},{"id":"W2072987868","doi":"10.1109/lwc.2014.2362744","title":"Ergodic Capacity of Two-Hop Multiple Antenna AF Systems With Co-Channel Interference","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Ergodic theory; Relay; Topology (electrical circuits); Interference (communication); Channel (broadcasting); Computer science; Mathematics; Algorithm; Discrete mathematics; Telecommunications; Combinatorics; Mathematical analysis; Physics","score_opus":0.10311037602521435,"score_gpt":0.29398180028908644,"score_spread":0.1908714242638721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072987868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2441861,0.00063468295,0.7496492,0.0039484366,0.00025874915,0.00036752873,0.00001224041,0.00020602254,0.0007370441],"genre_scores_gemma":[0.98801994,0.00036548026,0.010822897,0.000583357,0.000029737026,0.00010914585,0.000016751856,0.000019628771,0.00003307396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781847,0.0007285662,0.00049711723,0.00032810494,0.00032636596,0.00030138323],"domain_scores_gemma":[0.9942399,0.00045302912,0.00033724026,0.0042774,0.0005117693,0.00018065293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063969905,0.00023616382,0.00036088692,0.00020898583,0.00031902798,0.00016813575,0.004637221,0.000053544656,0.0000015463035],"category_scores_gemma":[0.000049951967,0.00021270248,0.000064684624,0.00074063125,0.000551234,0.0005592683,0.00064584275,0.00042819246,0.000030468362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003439441,0.003052414,0.034500316,0.0003492563,0.0010334048,0.000038442704,0.07478067,0.06797028,0.5808958,0.18658239,0.025512427,0.024940679],"study_design_scores_gemma":[0.0018739413,0.00014549616,0.00063723343,0.0004929485,0.000021615519,0.000055796638,0.0005854218,0.9896655,0.0041672816,0.000060918977,0.0017236883,0.00057015294],"about_ca_topic_score_codex":0.00025184412,"about_ca_topic_score_gemma":0.0003901562,"teacher_disagreement_score":0.92169523,"about_ca_system_score_codex":0.00013894492,"about_ca_system_score_gemma":0.000121842226,"threshold_uncertainty_score":0.86737555},"labels":[],"label_agreement":null},{"id":"W2073880248","doi":"10.1109/wcl.2012.100912.120637","title":"Improved Throughput Physical-Layer Network Coding in Multi-Way Relay Channels with Binary Signaling","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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 Victoria","funders":"","keywords":"Relay; Linear network coding; Computer science; Binary number; Computer network; Throughput; Node (physics); Coding (social sciences); Relay channel; Channel (broadcasting); Physical layer; Routing (electronic design automation); Algorithm; Topology (electrical circuits); Wireless; Mathematics; Telecommunications; Arithmetic; Network packet; Engineering","score_opus":0.07665106158219796,"score_gpt":0.3053915965003876,"score_spread":0.22874053491818963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073880248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46478036,0.0011815382,0.5239935,0.008530866,0.00041273312,0.0005437859,0.0000017187037,0.00031044663,0.00024506607],"genre_scores_gemma":[0.9311832,0.0006175865,0.065504394,0.0021884686,0.0001883288,0.00022278736,0.0000140272205,0.000039697115,0.000041481693],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974064,0.00074578787,0.0004485988,0.00039936282,0.00023214484,0.000767676],"domain_scores_gemma":[0.9953591,0.0006393741,0.00025437004,0.003466894,0.0001196513,0.00016055841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008056838,0.0003267002,0.00038056177,0.00018088253,0.0007942027,0.00020862347,0.0034024243,0.000079861224,0.000004650907],"category_scores_gemma":[0.00001975719,0.00030414804,0.00009821966,0.0014519364,0.00024908924,0.0013056151,0.0010253565,0.00079343584,0.000035541038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000733786,0.0024087252,0.020749023,0.0000730298,0.0003247827,0.000016020978,0.04147074,0.13201188,0.6915166,0.06458351,0.0034007984,0.043371513],"study_design_scores_gemma":[0.0010873487,0.000053878615,0.0030453436,0.0003443298,0.000020331436,0.000013569204,0.00013900577,0.98633343,0.0060159587,0.00002256495,0.0022226188,0.00070163194],"about_ca_topic_score_codex":0.000039788654,"about_ca_topic_score_gemma":0.00008348015,"teacher_disagreement_score":0.85432154,"about_ca_system_score_codex":0.00018613879,"about_ca_system_score_gemma":0.00004814326,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W2075177459","doi":"10.1109/wcl.2013.061213.130313","title":"Outage Probability of Decode-and-Forward Relaying with Optimum Combining in the Presence of Co-Channel Interference and Nakagami Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Co-channel interference; Interference (communication); Maximal-ratio combining; Diversity gain; Relay; Node (physics); Topology (electrical circuits); Outage probability; Computer science; Channel (broadcasting); Diversity combining; Signal-to-noise ratio (imaging); Telecommunications; Computer network; Mathematics; Physics; Power (physics); Combinatorics; Acoustics","score_opus":0.04865655103986991,"score_gpt":0.2802560984705362,"score_spread":0.23159954743066627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075177459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84609056,0.00036996338,0.1458937,0.0067772013,0.000021615226,0.00048859505,0.000001657374,0.000029270623,0.00032745005],"genre_scores_gemma":[0.9811883,0.0006375765,0.017590245,0.0004450089,0.0000026995974,0.00012323316,0.0000022883669,0.0000071503955,0.0000035009516],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.0005946836,0.00042952335,0.00023731588,0.00016517704,0.00018168699],"domain_scores_gemma":[0.9963167,0.0012267391,0.00024905748,0.0020246864,0.00014039277,0.000042435375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079955894,0.00013951016,0.00024793617,0.00012820493,0.00024641314,0.000110490575,0.0024135897,0.000037499958,0.000001508224],"category_scores_gemma":[0.000060355647,0.00010717634,0.000027162594,0.00045407063,0.00062919327,0.0005640244,0.0006777542,0.0003610685,0.0000010335841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010980978,0.0014944962,0.1724882,0.0007343367,0.0003322338,0.000007093396,0.27994663,0.019721542,0.16644876,0.19229166,0.0009876336,0.1654376],"study_design_scores_gemma":[0.0011806116,0.00020652436,0.048246685,0.0012041163,0.00002259032,0.000034415923,0.002939423,0.9412243,0.0029971756,0.0013136183,0.000105553634,0.00052502356],"about_ca_topic_score_codex":0.00011171036,"about_ca_topic_score_gemma":0.00012240726,"teacher_disagreement_score":0.9215027,"about_ca_system_score_codex":0.00002707223,"about_ca_system_score_gemma":0.000030598778,"threshold_uncertainty_score":0.44850907},"labels":[],"label_agreement":null},{"id":"W2080296812","doi":"10.1109/wcl.2012.012012.110257","title":"Optimal Energy-Efficient Channel Exploration for Opportunistic Spectrum Usage","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Network Optimization","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Channel (broadcasting); Energy (signal processing); State (computer science); Optimal stopping; Channel state information; Efficient energy use; Mathematical optimization; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.0391848611990751,"score_gpt":0.251679458433113,"score_spread":0.2124945972340379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080296812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01785305,0.00030770912,0.9778562,0.0019381011,0.0007631875,0.0003663631,0.000043999946,0.0005244054,0.0003469542],"genre_scores_gemma":[0.9693494,0.00059308135,0.028124755,0.0003998889,0.00028900895,0.0006496541,0.00044353894,0.000106618434,0.00004404119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986672,0.00007139363,0.0003807321,0.0001785506,0.00016335763,0.00053880515],"domain_scores_gemma":[0.998249,0.00021636489,0.00010736032,0.0012261532,0.000048129845,0.00015298375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002053978,0.0002511239,0.0002259849,0.00016944099,0.00033714008,0.000050215276,0.0006047723,0.000090391695,0.000007856153],"category_scores_gemma":[0.000011684607,0.00029830137,0.00008738382,0.00033027728,0.00012219773,0.00049300905,0.00007150026,0.00018195409,0.000018964221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000733341,0.00008196899,0.000010649268,0.000019674677,0.000033248387,3.2466184e-7,0.00043567718,0.9803414,0.00793961,0.0061938893,0.002647127,0.0022891124],"study_design_scores_gemma":[0.00028765874,0.00001214927,0.00002122939,0.000035128047,0.00003025386,0.0000044445123,0.00010048426,0.9884852,0.0037606917,0.000046417736,0.0068734023,0.0003429276],"about_ca_topic_score_codex":0.000006667763,"about_ca_topic_score_gemma":0.000011121893,"teacher_disagreement_score":0.95149636,"about_ca_system_score_codex":0.00020866569,"about_ca_system_score_gemma":0.000014591343,"threshold_uncertainty_score":0.9999469},"labels":[],"label_agreement":null},{"id":"W2082771129","doi":"10.1109/lwc.2014.2344669","title":"Analysis of Sub-Band Allocation in Multi-Service Cognitive Radio Access Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cognitive radio; Computer science; Computer network; Network packet; Quality of service; Markov process; Markov chain; Poisson distribution; Service (business); Telecommunications; Wireless; Mathematics","score_opus":0.03710038917370081,"score_gpt":0.2904872163541656,"score_spread":0.2533868271804648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082771129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40140054,0.000117936455,0.59531665,0.0027903523,0.00007534053,0.00015073078,0.0000024230585,0.000045861118,0.000100183286],"genre_scores_gemma":[0.9943403,0.00028931515,0.0030138956,0.0022182749,0.000031171592,0.00002988254,0.000060446964,0.000014760361,0.0000019373194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980261,0.0005763553,0.00049996964,0.00038514318,0.00020515262,0.00030728805],"domain_scores_gemma":[0.99668497,0.0010895458,0.00030698025,0.0015992522,0.00024637964,0.000072893934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059506233,0.00018691584,0.00042892408,0.000649973,0.00019396323,0.00016960116,0.002106514,0.000080330545,0.000001775865],"category_scores_gemma":[0.000038109825,0.00020742619,0.00013120064,0.003858392,0.00016488023,0.00055018865,0.00026071665,0.00032138228,0.000003144689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007388816,0.0012263806,0.13809645,0.00006621094,0.0021043117,0.000011668809,0.006213247,0.5416012,0.035365883,0.00774672,0.000259277,0.2672348],"study_design_scores_gemma":[0.00050115626,0.00001002009,0.11211962,0.00009244209,0.00014902183,0.0000018036109,0.000029981602,0.8854717,0.0013814439,0.000015930616,0.000024793328,0.00020207994],"about_ca_topic_score_codex":0.000635579,"about_ca_topic_score_gemma":0.0064524463,"teacher_disagreement_score":0.5929398,"about_ca_system_score_codex":0.00008579749,"about_ca_system_score_gemma":0.000032482043,"threshold_uncertainty_score":0.84585947},"labels":[],"label_agreement":null},{"id":"W2084779827","doi":"10.1109/wcl.2014.030514.140092","title":"Achieving Secure Communications over Wiretap Channels via Security Codes from Resilient Functions","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","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 Waterloo","funders":"","keywords":"Computer science; Encoding (memory); Information-theoretic security; Concrete security; Theoretical computer science; Binary number; Channel (broadcasting); Cryptography; Computer security; Computer network; Algorithm; Mathematics; Arithmetic","score_opus":0.015731213389507528,"score_gpt":0.24660599212685066,"score_spread":0.23087477873734313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084779827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81212646,0.0024615692,0.16010946,0.013748295,0.0008343712,0.0010872716,0.00036307628,0.004487809,0.0047816737],"genre_scores_gemma":[0.9818607,0.002273016,0.012637431,0.0012503775,0.00018345214,0.0006598865,0.00093066937,0.00018028326,0.000024201181],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962265,0.0010482162,0.0010527651,0.00052298605,0.0004999262,0.00064963155],"domain_scores_gemma":[0.98523813,0.0015037499,0.00029565682,0.0124821095,0.00021494948,0.0002654084],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00071362336,0.0006294308,0.0006946694,0.0004322984,0.001206947,0.00028183768,0.006262241,0.00034399115,0.000073],"category_scores_gemma":[0.00007069851,0.0007338048,0.00029750925,0.00087852863,0.00094255345,0.0007110995,0.0012295303,0.0017020331,0.00021296667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007658957,0.002079757,0.017139362,0.00042210374,0.0018026413,0.0000055273076,0.027094712,0.019998752,0.7386073,0.03050878,0.120731525,0.041532964],"study_design_scores_gemma":[0.0013554518,0.00007246741,0.007923208,0.0006990134,0.00031046016,0.0000226782,0.0005625516,0.76761514,0.014558988,0.0027280091,0.20166346,0.002488542],"about_ca_topic_score_codex":0.00091769267,"about_ca_topic_score_gemma":0.0014659851,"teacher_disagreement_score":0.7476164,"about_ca_system_score_codex":0.00037616814,"about_ca_system_score_gemma":0.000035638288,"threshold_uncertainty_score":0.9995113},"labels":[],"label_agreement":null},{"id":"W2087464664","doi":"10.1109/lwc.2014.2387833","title":"Linear Precoding Game for MIMO MAC With Dynamic Access Point Selection","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Potential game; Precoding; MIMO; Mathematical optimization; Computer science; Nash equilibrium; Convergence (economics); Selection (genetic algorithm); Game theory; Iterative method; Interference (communication); Function (biology); Algorithm; Mathematics; Telecommunications; Beamforming; Channel (broadcasting)","score_opus":0.036630290916954814,"score_gpt":0.2917137272046375,"score_spread":0.2550834362876827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087464664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054568008,0.00016286066,0.9421812,0.0012603864,0.00025307736,0.000727034,0.000021675056,0.0005955114,0.00023020999],"genre_scores_gemma":[0.92242336,0.00010078777,0.076518744,0.00016030621,0.000058972575,0.00048198315,0.0001239084,0.00009039324,0.000041572315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910325,0.000059265592,0.00029428798,0.00018324755,0.00010917955,0.0002507683],"domain_scores_gemma":[0.9986597,0.000117266325,0.00010183499,0.0008691614,0.00016499538,0.00008706026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016823487,0.00018590485,0.00019654681,0.00016358636,0.0001312378,0.00007659822,0.0006800494,0.000069453985,0.0000018664771],"category_scores_gemma":[0.000016809985,0.00019574731,0.000041885836,0.00037062867,0.00006583065,0.00063301367,0.000054091666,0.00020513216,0.000011128116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020976191,0.000024705323,0.00031720998,0.00006601074,0.000054621978,3.104165e-7,0.00047389156,0.98357654,0.0117942495,0.000086163294,0.0012164376,0.0023688944],"study_design_scores_gemma":[0.00066214695,0.000028474751,0.00003748547,0.0000991584,0.00002906515,0.000015358635,0.000104791856,0.9930229,0.0036969425,0.000033894958,0.0019991687,0.0002705864],"about_ca_topic_score_codex":0.000032167634,"about_ca_topic_score_gemma":0.00029105894,"teacher_disagreement_score":0.8678553,"about_ca_system_score_codex":0.00036945072,"about_ca_system_score_gemma":0.000030090203,"threshold_uncertainty_score":0.79823434},"labels":[],"label_agreement":null},{"id":"W2088747343","doi":"10.1109/wcl.2012.061212.120348","title":"Analytical Performance of M-PSK Communications Systems in the Presence of Gain/Phase Imbalances and DC-Offsets","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Radio Frequency Integrated Circuit Design","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":"Communications Research Centre Canada","funders":"","keywords":"Transmitter; Phase-shift keying; Communications system; Computer science; DC bias; Electronic engineering; Phase (matter); Quadrature (astronomy); Bit error rate; Control theory (sociology); Telecommunications; Electrical engineering; Engineering; Voltage; Physics; Decoding methods","score_opus":0.04098670853820564,"score_gpt":0.28410257493782287,"score_spread":0.24311586639961724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088747343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903127,0.0056931325,0.0006563989,0.0008455955,0.00011320033,0.0003389602,0.00003276197,0.000048069578,0.0019591558],"genre_scores_gemma":[0.9967311,0.002721879,0.00029531476,0.00006381747,0.000017876666,0.00013067425,0.000018930912,0.000017727387,0.0000026779114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856997,0.0003724949,0.0005299677,0.00008855985,0.00019279947,0.00024622554],"domain_scores_gemma":[0.9964039,0.00077863666,0.00012310644,0.002582768,0.00006205545,0.00004957571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727696,0.00014231415,0.00026570456,0.00016730904,0.00010118428,0.000023193941,0.0018989304,0.000068672394,0.0000016051093],"category_scores_gemma":[0.00003425754,0.00012058251,0.00004133988,0.0005251675,0.0006859256,0.00031971658,0.000026001226,0.00039721353,0.0000035155986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036292415,0.001537753,0.17785916,0.0010867547,0.0004492993,0.0000027381486,0.024118207,0.037479103,0.6895126,0.04819843,0.005522755,0.014196899],"study_design_scores_gemma":[0.00095066725,0.0000839429,0.0242721,0.00071494706,0.0001182034,0.000068267174,0.0024104938,0.9520958,0.016905904,0.00003114906,0.0018594982,0.00048903044],"about_ca_topic_score_codex":0.00021458871,"about_ca_topic_score_gemma":0.000029873032,"teacher_disagreement_score":0.9146167,"about_ca_system_score_codex":0.00005857211,"about_ca_system_score_gemma":0.000018925859,"threshold_uncertainty_score":0.49172118},"labels":[],"label_agreement":null},{"id":"W2100648790","doi":"10.1109/wcl.2013.052813.130085","title":"Joint Optimization of Bit and Power Loading for Multicarrier Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Network 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":"Communications Research Centre Canada; Memorial University of Newfoundland","funders":"","keywords":"Subcarrier; Transmitter power output; Computer science; Lagrange multiplier; Bit error rate; Mathematical optimization; Power (physics); Bisection method; Throughput; Weighting; Power optimization; Constraint (computer-aided design); Joint (building); Algorithm; Orthogonal frequency-division multiplexing; Wireless; Mathematics; Telecommunications; Decoding methods; Power consumption; Transmitter; Channel (broadcasting); Engineering","score_opus":0.01660448581424558,"score_gpt":0.22241142325306787,"score_spread":0.20580693743882228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100648790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11884863,0.0005352875,0.87872607,0.00048800412,0.00023453901,0.00080616446,0.000016770817,0.0001937842,0.0001507581],"genre_scores_gemma":[0.901024,0.00041175247,0.0979709,0.00007421251,0.000025144122,0.00038300845,0.000042776563,0.000057606092,0.000010583029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999116,0.00004578315,0.00039925924,0.0001410356,0.00009421634,0.00020367368],"domain_scores_gemma":[0.99868125,0.0002021038,0.000112470625,0.0008009519,0.00014044212,0.00006278854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009671492,0.00015491288,0.00023839102,0.00013799305,0.0001264817,0.000053669555,0.00028636734,0.00007655608,0.000007640948],"category_scores_gemma":[0.0000191133,0.00017166481,0.000043047934,0.00020270022,0.00013992761,0.00034567295,0.000048983045,0.00012116819,0.0000040193418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001682465,0.0000127194835,0.00009974286,0.00006618697,0.000037007267,5.505782e-8,0.00023188166,0.9592801,0.038381536,0.00047646894,0.0007183659,0.0006942812],"study_design_scores_gemma":[0.00030139033,0.000009705172,0.00010123673,0.00010111773,0.000018146475,0.0000021985836,0.00012807864,0.9970281,0.0018727919,0.000011386351,0.0002481848,0.0001776587],"about_ca_topic_score_codex":0.000022968428,"about_ca_topic_score_gemma":0.0000022051993,"teacher_disagreement_score":0.78217536,"about_ca_system_score_codex":0.00006661104,"about_ca_system_score_gemma":0.000006566009,"threshold_uncertainty_score":0.7000288},"labels":[],"label_agreement":null},{"id":"W2104189200","doi":"10.1109/wcl.2013.101613.130636","title":"The Impact of Imperfect Channel Estimations on the Performance of Optimum Combining in Decode-and-Forward Relaying in the Presence of Co-Channel Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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 Alberta","funders":"","keywords":"Channel (broadcasting); Computer science; Relay; Overhead (engineering); Interference (communication); Node (physics); Channel state information; Diversity gain; Co-channel interference; Imperfect; Performance improvement; Computer network; Telecommunications; Electronic engineering; Fading; Wireless; Engineering; Power (physics); Physics","score_opus":0.0476921736671704,"score_gpt":0.308237082248134,"score_spread":0.26054490858096363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104189200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775836,0.0003062651,0.011450386,0.009768876,0.00003683031,0.0005425225,0.0000027707122,0.000013522413,0.00029525076],"genre_scores_gemma":[0.99672556,0.0021034486,0.0007385453,0.00020402609,0.000003621201,0.00021153277,0.0000024811243,0.000007507371,0.0000032754012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792415,0.00090255844,0.00059539534,0.00016099354,0.00019655148,0.00022037012],"domain_scores_gemma":[0.9926185,0.0042832918,0.0003706708,0.0025465167,0.00015440125,0.000026617716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014663041,0.00015015538,0.00023500415,0.00017148718,0.00042911223,0.000086568914,0.004321971,0.00003855737,0.0000021343276],"category_scores_gemma":[0.00015583068,0.00008653038,0.00007794276,0.00081752986,0.00059978355,0.0003890285,0.0005425925,0.0005100636,0.0000027639671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013417011,0.0015337715,0.04491399,0.00017481802,0.00032667353,0.0000013907894,0.15818903,0.51479584,0.09478222,0.106023416,0.0033812497,0.07574346],"study_design_scores_gemma":[0.0002316292,0.00010938834,0.028215641,0.00038077246,0.0000035589026,0.000003351151,0.00063632615,0.9684822,0.0016708631,0.00016080518,0.000004270987,0.00010119435],"about_ca_topic_score_codex":0.0003148204,"about_ca_topic_score_gemma":0.00011713949,"teacher_disagreement_score":0.4536864,"about_ca_system_score_codex":0.000053505377,"about_ca_system_score_gemma":0.00006081195,"threshold_uncertainty_score":0.8031369},"labels":[],"label_agreement":null},{"id":"W2118597021","doi":"10.1109/wcl.2013.052813.130176","title":"QAM Constellation Design for Complex Field Network Coding in Multi-Way Relay Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Relay; Additive white Gaussian noise; Linear network coding; QAM; Precoding; Quadrature amplitude modulation; Demodulation; Throughput; Computer network; Constellation; Relay channel; Channel (broadcasting); Constellation diagram; Electronic engineering; Algorithm; MIMO; Telecommunications; Bit error rate; Wireless; Network packet; Engineering","score_opus":0.14826665615185267,"score_gpt":0.3177926819130673,"score_spread":0.16952602576121464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118597021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008589759,0.0003054849,0.9563888,0.032518912,0.00034430288,0.0013345344,0.0000014330739,0.00019058243,0.00032623406],"genre_scores_gemma":[0.7573662,0.00064356887,0.23718753,0.004447344,0.000051969553,0.00022765,0.000020315345,0.000018049965,0.000037367496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776256,0.00070791045,0.0005747765,0.00035907765,0.00014876804,0.00044689298],"domain_scores_gemma":[0.99471164,0.0022602042,0.00022435086,0.0025194283,0.00019178237,0.00009260078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076568534,0.00022323726,0.00029256797,0.00018994053,0.00070088636,0.00032999183,0.0029541187,0.00009987923,0.000026352986],"category_scores_gemma":[0.00005841988,0.00024282144,0.000092139715,0.0007480864,0.00014595926,0.0006453378,0.0005208583,0.00037596887,0.00005512437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004049429,0.0006686545,0.0033286533,0.00006995439,0.0001666261,0.0000034828674,0.007857429,0.37025023,0.13106614,0.08834521,0.15007447,0.24812867],"study_design_scores_gemma":[0.0006905467,0.000032831624,0.0009152155,0.0001178724,0.0000052875394,0.000003845237,0.000041912936,0.9919008,0.0010849593,0.00017689461,0.004721969,0.00030785453],"about_ca_topic_score_codex":0.00005554996,"about_ca_topic_score_gemma":0.00008993679,"teacher_disagreement_score":0.74877644,"about_ca_system_score_codex":0.00012205707,"about_ca_system_score_gemma":0.000043131116,"threshold_uncertainty_score":0.99019706},"labels":[],"label_agreement":null},{"id":"W2118727061","doi":"10.1109/wcl.2012.020612.110279","title":"Dynamic Propagation Modeling for Mobile Users' Position and Heading Estimation in Wireless Local Area Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Heading (navigation); Computer science; RSS; Real-time computing; Position (finance); Wi-Fi; Parametric statistics; Process (computing); Gaussian process; Wireless network; Wireless; Artificial intelligence; Algorithm; Gaussian; Telecommunications; Statistics; Engineering; Mathematics","score_opus":0.014479900915796163,"score_gpt":0.24633533155932874,"score_spread":0.2318554306435326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118727061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42453435,0.00024109287,0.57426834,0.00022143516,0.00009555971,0.00036931026,0.000004617258,0.00025215143,0.000013155224],"genre_scores_gemma":[0.9911089,0.00032141505,0.0076394556,0.00011135192,0.000014707358,0.0005709222,0.00019022086,0.000041573323,0.0000014438634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990979,0.00004530965,0.0003257277,0.00013311605,0.00008725021,0.0003107079],"domain_scores_gemma":[0.99924445,0.000114155795,0.000052704123,0.0005028213,0.000042892592,0.00004298821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022682335,0.00016347028,0.00017397835,0.00022815452,0.00020675987,0.000051215295,0.00026614027,0.00014270698,8.599893e-7],"category_scores_gemma":[0.000008670396,0.0001874679,0.00003563972,0.0002806,0.000109207336,0.0005167532,0.000044636785,0.00023378036,0.0000020286868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006504712,0.000028837887,0.0005384858,0.000055291115,0.000012829475,1.3748357e-7,0.00047096357,0.9692782,0.008414532,0.00079335645,0.00003789263,0.02036296],"study_design_scores_gemma":[0.00029437928,0.000010893925,0.00014397166,0.000110962,0.000016974547,0.000005273665,0.00031750987,0.9964436,0.002373151,0.00006424903,0.000014339468,0.00020468023],"about_ca_topic_score_codex":0.000026206742,"about_ca_topic_score_gemma":0.000059072903,"teacher_disagreement_score":0.5666289,"about_ca_system_score_codex":0.00026740378,"about_ca_system_score_gemma":0.0000073973065,"threshold_uncertainty_score":0.7644719},"labels":[],"label_agreement":null},{"id":"W2119612043","doi":"10.1109/wcl.2012.010912.110220","title":"Performance Analysis of Zero-Forcing for Two-Way MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Alberta","funders":"","keywords":"MIMO; Relay; Computer science; Multiplexing; Relay channel; Transmission (telecommunications); Linear network coding; Outage probability; Signal-to-noise ratio (imaging); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Computer network; Mathematics; Fading","score_opus":0.04744994333609972,"score_gpt":0.29469158679061336,"score_spread":0.24724164345451363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119612043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23968177,0.0010295206,0.75536984,0.0027594466,0.00026009072,0.00028591958,0.0000047383623,0.00011386772,0.0004948386],"genre_scores_gemma":[0.95286757,0.0012647079,0.04433199,0.0012006969,0.000057168138,0.00016196542,0.0000487411,0.000019118275,0.000048073234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816734,0.00034453342,0.00058164395,0.0002487305,0.00019866638,0.00045909386],"domain_scores_gemma":[0.9943551,0.0008515936,0.00035818285,0.0040914025,0.0002227946,0.00012096552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354168,0.00020499626,0.00040416513,0.0004210652,0.0006739186,0.00008426014,0.0036473155,0.00006603175,0.0000066487232],"category_scores_gemma":[0.00002786593,0.00021080025,0.00025238213,0.0021581815,0.00020859012,0.00080188963,0.0006641269,0.00031173014,0.0000074045965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048669513,0.00084050815,0.07638026,0.000078453646,0.0025910535,4.2888593e-7,0.010439168,0.43972766,0.06033648,0.122487135,0.007945531,0.27912465],"study_design_scores_gemma":[0.0003395965,0.000018300494,0.008394247,0.00005256863,0.00019339341,0.0000016330355,0.000026497268,0.98597234,0.0013765655,0.00000487008,0.0033570507,0.00026294665],"about_ca_topic_score_codex":0.000017190494,"about_ca_topic_score_gemma":0.000055364177,"teacher_disagreement_score":0.7131858,"about_ca_system_score_codex":0.000099100675,"about_ca_system_score_gemma":0.000027504615,"threshold_uncertainty_score":0.8596185},"labels":[],"label_agreement":null},{"id":"W2139041587","doi":"10.1109/wcl.2014.032814.130888","title":"Frequency and Power Allocation for Energy Efficient OFDMA Systems with Proportional Rate Constraints","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Computer science; Base station; Computational complexity theory; Power (physics); Convergence (economics); Energy (signal processing); Frequency-division multiple access; Orthogonal frequency-division multiplexing; Rate of convergence; Efficient energy use; Orthogonal frequency-division multiple access; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.009087603806520557,"score_gpt":0.20965229961942258,"score_spread":0.20056469581290204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139041587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07510533,0.00023749314,0.92272776,0.00078151346,0.00020599466,0.00044219664,0.000026970245,0.00020964461,0.0002631167],"genre_scores_gemma":[0.98486865,0.00006906929,0.014036783,0.0001332949,0.000037124577,0.0006974885,0.00009452897,0.000046273904,0.000016806294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991494,0.000089782516,0.00030796952,0.00017525944,0.0000951229,0.00018249631],"domain_scores_gemma":[0.9988319,0.00016867848,0.000118551434,0.00067536626,0.00014705479,0.000058416917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020776669,0.0001592973,0.0001751537,0.00010064784,0.00018150048,0.00005182234,0.00025754306,0.00005826283,0.0000020428097],"category_scores_gemma":[0.0000135996315,0.00015452637,0.000023517608,0.00014085154,0.00023003724,0.00012510964,0.00001878995,0.000078420504,0.0000018818652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053254685,0.00003068676,0.00024582236,0.00008772139,0.00005861525,2.2657565e-7,0.00017958789,0.9011613,0.07348474,0.023017371,0.00024232996,0.0014862343],"study_design_scores_gemma":[0.00059897575,0.000022125847,0.00023199865,0.00018005587,0.000027907096,0.00001578609,0.00009672726,0.99587,0.0018939559,0.000036155852,0.000740808,0.00028548343],"about_ca_topic_score_codex":0.00002674615,"about_ca_topic_score_gemma":0.000024133133,"teacher_disagreement_score":0.9097633,"about_ca_system_score_codex":0.0000885417,"about_ca_system_score_gemma":0.000019521545,"threshold_uncertainty_score":0.6301402},"labels":[],"label_agreement":null},{"id":"W2147758080","doi":"10.1109/wcl.2014.022314.130796","title":"Dynamic Spectrum Management in Multi-Radio Access Technology (RAT) Cellular Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Spectrum management; Frequency allocation; Radio resource management; Computer network; Cognitive radio; Spectrum (functional analysis); Access technology; Resource management (computing); Distributed computing; Telecommunications; Wireless; Wireless network","score_opus":0.013920787295434176,"score_gpt":0.24663566402053802,"score_spread":0.23271487672510385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147758080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118936665,0.0007638012,0.8760788,0.0017556242,0.00062780845,0.00060675485,0.000003811247,0.000829931,0.00039682843],"genre_scores_gemma":[0.97686183,0.0014256296,0.021016805,0.000095872434,0.000022646334,0.0003829317,0.00006002718,0.000093593386,0.000040671563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985374,0.00012249578,0.00047295212,0.0002860029,0.00014527098,0.00043586607],"domain_scores_gemma":[0.9975493,0.00008484043,0.00010013047,0.0021871023,0.000023525079,0.00005509738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001764209,0.00026475225,0.00031314907,0.0006332014,0.00015058898,0.00008986013,0.0018389195,0.0001395454,0.0000027328854],"category_scores_gemma":[0.000004843658,0.0003231359,0.000045372202,0.0010643133,0.000165315,0.00030881344,0.00022551623,0.00046050083,0.00004226477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002157796,0.000048804744,0.00047901116,0.000070267975,0.000040470368,0.0000053161793,0.000055471497,0.98822236,0.0059646075,0.0019564661,0.00019007624,0.0029649634],"study_design_scores_gemma":[0.0005374366,0.000005521659,0.00034244888,0.00012955556,0.000016992124,0.0000046131786,0.000060654922,0.9956766,0.0008329335,0.0000625044,0.0019981074,0.0003326736],"about_ca_topic_score_codex":0.00002367891,"about_ca_topic_score_gemma":0.0001817886,"teacher_disagreement_score":0.8579252,"about_ca_system_score_codex":0.0003888719,"about_ca_system_score_gemma":0.0000056625986,"threshold_uncertainty_score":0.9999221},"labels":[],"label_agreement":null},{"id":"W2155411199","doi":"10.1109/wcl.2012.071612.120392","title":"Separating the Effect of Independent Interference Sources with Rayleigh Faded Signal Link: Outage Analysis and Applications","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Interference (communication); Link (geometry); Computer science; Outage probability; SIGNAL (programming language); Simple (philosophy); Log-normal distribution; Co-channel interference; Rayleigh fading; Signal-to-interference ratio; Expression (computer science); Power (physics); Rayleigh distribution; Telecommunications; Mathematics; Statistics; Computer network; Physics; Probability density function; Fading; Channel (broadcasting)","score_opus":0.012606988507593163,"score_gpt":0.24756958761324224,"score_spread":0.23496259910564907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155411199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46563634,0.00027851426,0.53225064,0.0014394724,0.000015703044,0.00022070957,0.0000022125153,0.000037006943,0.00011937919],"genre_scores_gemma":[0.9954787,0.00004696489,0.0040691993,0.00023264842,0.00006933325,0.000081435304,0.000006973218,0.0000090834765,0.0000056948375],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860656,0.00044523983,0.00027051818,0.000217896,0.00020196171,0.00025782574],"domain_scores_gemma":[0.99710095,0.0011537526,0.00024390461,0.0013733723,0.00005454472,0.000073477466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055022485,0.00016352927,0.00027453137,0.00017244068,0.00047147818,0.00014844799,0.0012149137,0.00004077112,0.0000020390075],"category_scores_gemma":[0.000006009985,0.00011077122,0.000087914384,0.0009740779,0.00034630307,0.0002896384,0.00030580183,0.00032468466,0.0000025674808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007994857,0.00025051858,0.48199445,0.00009557782,0.0029076068,0.0000038659364,0.01797295,0.009893219,0.08634668,0.014308462,0.00009093933,0.3860558],"study_design_scores_gemma":[0.001872507,0.00049246626,0.14172979,0.00032612612,0.002032358,0.00011979637,0.00089765375,0.76584935,0.08403954,0.0001213233,0.001113606,0.0014054604],"about_ca_topic_score_codex":0.00009236596,"about_ca_topic_score_gemma":0.00013482494,"teacher_disagreement_score":0.7559562,"about_ca_system_score_codex":0.0000305727,"about_ca_system_score_gemma":0.0000137271145,"threshold_uncertainty_score":0.45171195},"labels":[],"label_agreement":null},{"id":"W2160645803","doi":"10.1109/wcl.2012.022012.120051","title":"Cognitive Radio with Imperfect Spectrum Sensing: The Optimal Set of Channels to Sense","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Cognitive radio; Channel (broadcasting); Computer science; Sense (electronics); Imperfect; Set (abstract data type); Computer network; Simple (philosophy); Selection (genetic algorithm); Telecommunications; Wireless; Machine learning; Engineering; Electrical engineering","score_opus":0.027218320458024428,"score_gpt":0.2644341148922218,"score_spread":0.23721579443419738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160645803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60371643,0.00012062835,0.36829525,0.026978979,0.000225499,0.0003541201,0.000007696144,0.00008226171,0.00021912449],"genre_scores_gemma":[0.98469543,0.0000388299,0.012696629,0.0022710834,0.00023620386,0.000012467039,0.000008023208,0.000028854965,0.000012483423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980439,0.00046530203,0.00030178856,0.00029081554,0.00030448198,0.000593698],"domain_scores_gemma":[0.99668247,0.0009776348,0.00018479004,0.001858187,0.00012444082,0.00017247687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057615933,0.00024933222,0.00030624602,0.0001700398,0.00049259193,0.00014058233,0.0010197362,0.000048754588,0.0000023922016],"category_scores_gemma":[0.000021108595,0.00018844746,0.000104996274,0.00091797934,0.0003872404,0.0003803115,0.0003669614,0.00038949543,0.000017979391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009731567,0.0016661241,0.009210498,0.0001692108,0.0035630069,0.0003012242,0.20439748,0.041417744,0.27192363,0.15981732,0.015070985,0.29148963],"study_design_scores_gemma":[0.0039253337,0.0009961291,0.01681247,0.0011685592,0.0005214849,0.0034852442,0.0047794823,0.77074844,0.18612136,0.0002311424,0.007858118,0.0033522423],"about_ca_topic_score_codex":0.00008901988,"about_ca_topic_score_gemma":0.000060701313,"teacher_disagreement_score":0.7293307,"about_ca_system_score_codex":0.00007992428,"about_ca_system_score_gemma":0.0000498002,"threshold_uncertainty_score":0.7684664},"labels":[],"label_agreement":null},{"id":"W2165568771","doi":"10.1109/wcl.2013.070113.130406","title":"EM-Based Semi-Blind Channel Estimation in Amplify-and-Forward Two-Way Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Estimator; Computer science; Expectation–maximization algorithm; Channel (broadcasting); Maximization; Algorithm; Least-squares function approximation; Cramér–Rao bound; Reciprocal; Estimation theory; Maximum likelihood; Mathematical optimization; Mathematics; Statistics; Telecommunications","score_opus":0.03452578479422909,"score_gpt":0.2812812217511334,"score_spread":0.24675543695690433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165568771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15247262,0.00064922887,0.8184823,0.02699856,0.00019060972,0.0006568083,0.0000017166035,0.00024166012,0.00030653586],"genre_scores_gemma":[0.96198344,0.00078430615,0.031442393,0.005195351,0.000030623138,0.0004585881,0.00004918354,0.00002533661,0.000030775722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977433,0.000647993,0.00056307996,0.00041490296,0.00022076936,0.0004099532],"domain_scores_gemma":[0.99545926,0.0006863131,0.00022292398,0.0033371563,0.00015026226,0.00014406536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006290671,0.00026415204,0.00029197504,0.00034219585,0.00056317187,0.00045651232,0.0029098566,0.000110914865,0.000014316638],"category_scores_gemma":[0.00004136372,0.00027821225,0.000067398025,0.0010336259,0.00022269733,0.00088041596,0.0006932877,0.00072876224,0.00007846428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024644878,0.0004960773,0.0020618772,0.000035364785,0.000081907754,0.0000049177734,0.0048730527,0.66958755,0.0072959894,0.027876744,0.0077466797,0.27991515],"study_design_scores_gemma":[0.0009609121,0.000017242908,0.0029991234,0.00011408628,0.000006504577,0.0000050440026,0.000045115587,0.99461395,0.00015978978,0.00015167981,0.00061195454,0.00031458994],"about_ca_topic_score_codex":0.00013843493,"about_ca_topic_score_gemma":0.000415208,"teacher_disagreement_score":0.8095108,"about_ca_system_score_codex":0.00014144543,"about_ca_system_score_gemma":0.000048901555,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W2169216872","doi":"10.1109/wcl.2013.090313.130366","title":"Spectral Efficiency of Carbon Nanotube Antenna Based MIMO Systems in the Terahertz Band","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Molecular Communication and Nanonetworks","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":"University of Victoria","funders":"University of Victoria","keywords":"Antenna (radio); MIMO; Terahertz radiation; Carbon nanotube; Spectral efficiency; Dipole antenna; Materials science; Electronic engineering; Optoelectronics; Computer science; Telecommunications; Nanotechnology; Engineering; Channel (broadcasting)","score_opus":0.01327193368090697,"score_gpt":0.21200330120243213,"score_spread":0.19873136752152515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169216872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853894,0.0022677325,0.005383073,0.0034663049,0.00019447504,0.0006290245,0.0000041043495,0.000105934414,0.0025599455],"genre_scores_gemma":[0.99850816,0.0002584867,0.00047582,0.00047867696,0.000018751647,0.00020752304,0.000018582343,0.000026968522,0.0000070149026],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998679,0.0003668856,0.0004208559,0.000113525755,0.00018006322,0.00023966067],"domain_scores_gemma":[0.9970676,0.0002810511,0.00007585226,0.0024948856,0.000044644436,0.00003600588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941963,0.00015506058,0.00020650956,0.00016108205,0.00008872547,0.000059943024,0.0017713128,0.00007108698,0.000007920422],"category_scores_gemma":[0.000008139426,0.0001315645,0.00007202706,0.0005194058,0.0001698187,0.0000735434,0.000039616665,0.00036992758,0.000011054492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007096174,0.0003143364,0.003320499,0.00013044983,0.00006414598,0.0000038744734,0.0022343681,0.054003853,0.93406826,0.0006961193,0.0025408652,0.0026161321],"study_design_scores_gemma":[0.0004809472,0.000017165716,0.0041241143,0.00017615836,0.000016077754,0.000006573031,0.00026462556,0.98766476,0.005195034,0.0000075475555,0.0017952116,0.00025176088],"about_ca_topic_score_codex":0.00075847784,"about_ca_topic_score_gemma":0.00012631487,"teacher_disagreement_score":0.9336609,"about_ca_system_score_codex":0.00005470882,"about_ca_system_score_gemma":0.000016634265,"threshold_uncertainty_score":0.53650445},"labels":[],"label_agreement":null},{"id":"W2170295971","doi":"10.1109/wcl.2012.051112.120277","title":"Utility-Optimal Random Access for Wireless Multimedia Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","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","funders":"","keywords":"Computer science; Random access; Wireless network; Quality of service; Computer network; Telecommunications link; Wireless; Transmission (telecommunications); Convex optimization; Optimization problem; Access network; Mathematical optimization; Regular polygon; Algorithm; Mathematics; Telecommunications","score_opus":0.0533881653453624,"score_gpt":0.3216632795835048,"score_spread":0.26827511423814243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170295971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02557559,0.00047619044,0.9602115,0.006625876,0.0010810728,0.0053078705,0.000018375173,0.00043341907,0.0002701173],"genre_scores_gemma":[0.92912215,0.00017312984,0.059150327,0.0030141713,0.00066705525,0.007701162,0.000065411456,0.000057967107,0.000048618866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996737,0.000533747,0.00071377796,0.0005263702,0.0003503431,0.001138764],"domain_scores_gemma":[0.99303013,0.0018045775,0.000370397,0.0042495234,0.00018364229,0.00036171678],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001215725,0.00041755429,0.000546744,0.00017683458,0.00089460803,0.00057288224,0.0073068524,0.00021850376,0.0000145327385],"category_scores_gemma":[0.000031705124,0.00041370746,0.00030031617,0.0007346823,0.00038105194,0.0020594015,0.0011335318,0.00061082677,0.000033596833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005361009,0.0022533997,0.027580779,0.0002591534,0.0006107072,0.0000071726295,0.0049230196,0.029670881,0.006238023,0.04077768,0.11589733,0.7712458],"study_design_scores_gemma":[0.0021858432,0.000026988693,0.0022141265,0.00009014364,0.000032800195,0.0000111432455,0.000023264785,0.95942354,0.0011969463,0.000059065263,0.034140814,0.0005953314],"about_ca_topic_score_codex":0.000071508795,"about_ca_topic_score_gemma":0.000038419515,"teacher_disagreement_score":0.92975265,"about_ca_system_score_codex":0.00007435281,"about_ca_system_score_gemma":0.000073238756,"threshold_uncertainty_score":0.9998315},"labels":[],"label_agreement":null},{"id":"W2200746630","doi":"10.1109/lwc.2016.2516543","title":"Saddle Point Approximation for Outage Probability Using Cumulant Generating Functions","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Saddle point; Cumulant; Fading; Rician fading; Point (geometry); Saddle; Channel (broadcasting); Wireless","score_opus":0.047892405076065805,"score_gpt":0.26271357660116534,"score_spread":0.21482117152509955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200746630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15363492,0.00006276956,0.843917,0.0007665817,0.00030026614,0.0007771009,0.00006978104,0.00040813364,0.0000634252],"genre_scores_gemma":[0.7539944,0.00002758447,0.24521543,0.00008365462,0.00009628084,0.00043230003,0.00006427987,0.000056361223,0.000029726463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888146,0.000091503054,0.0004582148,0.00021474554,0.000095124204,0.00025897092],"domain_scores_gemma":[0.9981286,0.00024146875,0.00012089021,0.0013369865,0.00011730187,0.000054749307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002623171,0.00018122155,0.00019379318,0.00011188945,0.0003553532,0.00004616563,0.00037866147,0.000073594885,0.000005246885],"category_scores_gemma":[0.00005267961,0.00016179291,0.00008118092,0.00019349942,0.00009667069,0.00048996386,0.00005104889,0.000105704654,0.000014053362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033318056,0.000024879771,0.00010495519,0.000052882726,0.000026615293,1.0038064e-7,0.00021250281,0.48512244,0.50925654,0.00036986545,0.00028102053,0.004544871],"study_design_scores_gemma":[0.0004529868,0.000008777431,0.000017112205,0.000120996585,0.000026136902,0.0000069351304,0.00007726553,0.9875472,0.010667717,0.00011687166,0.0006954183,0.00026257476],"about_ca_topic_score_codex":0.000016074799,"about_ca_topic_score_gemma":0.000044265882,"teacher_disagreement_score":0.6003595,"about_ca_system_score_codex":0.00040072607,"about_ca_system_score_gemma":0.000019400244,"threshold_uncertainty_score":0.65977234},"labels":[],"label_agreement":null},{"id":"W2204949160","doi":"10.1109/lwc.2015.2483509","title":"Wireless Access Point Localization Using Nonlinear Least Squares and Multi-Level Quality Control","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization Technologies","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 Calgary","funders":"","keywords":"RSS; Computer science; Wireless; A priori and a posteriori; Nonlinear system; Path loss; Path (computing); Non-linear least squares; Algorithm; Point (geometry); Radio propagation; Wireless network; Real-time computing; Mathematical optimization; Estimation theory; Computer network; Mathematics; Telecommunications","score_opus":0.13378755560969374,"score_gpt":0.33436905778277043,"score_spread":0.2005815021730767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204949160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32295847,0.00028462606,0.6744419,0.000992987,0.00023181994,0.00028079672,0.00007331018,0.00065348734,0.00008261439],"genre_scores_gemma":[0.9892658,0.0001942802,0.009541695,0.0007605819,0.000047604583,0.00004969159,0.00007104765,0.000060904065,0.000008421339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849904,0.00019253264,0.00052581524,0.00023582627,0.00023471726,0.00031208794],"domain_scores_gemma":[0.99813795,0.00014944791,0.00012864351,0.0012508398,0.00021312726,0.00011999782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003583419,0.00026324255,0.0003353538,0.00022782934,0.00023841973,0.00018899178,0.0010024045,0.00017067288,0.0000027334027],"category_scores_gemma":[0.00007560867,0.00028109472,0.00005814641,0.00043116664,0.00041171812,0.00054663065,0.00018960616,0.00031633003,0.000011420656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090407135,0.00043918125,0.052246675,0.00045946028,0.00039062442,0.00001164276,0.004166887,0.8064354,0.072481096,0.00431213,0.0044191265,0.05454739],"study_design_scores_gemma":[0.0013568419,0.000009873207,0.0011655556,0.000076439246,0.000034739063,0.000009640703,0.0006606969,0.99044687,0.00523194,0.00004835499,0.0005666329,0.00039240654],"about_ca_topic_score_codex":0.0003607322,"about_ca_topic_score_gemma":0.00023924696,"teacher_disagreement_score":0.66630733,"about_ca_system_score_codex":0.0001866001,"about_ca_system_score_gemma":0.000040239163,"threshold_uncertainty_score":0.9999641},"labels":[],"label_agreement":null},{"id":"W2246096453","doi":"10.1109/lwc.2015.2487347","title":"Low Power Wideband Sensing for One-Bit Quantized Cognitive Radio Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":23,"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":"Cognitive radio; Quantization (signal processing); Wideband; Computer science; False alarm; Electronic engineering; Signal-to-noise ratio (imaging); Algorithm; Telecommunications; Artificial intelligence; Wireless; Engineering","score_opus":0.051938700796010706,"score_gpt":0.27867948866826386,"score_spread":0.22674078787225316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246096453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13845007,0.00056075613,0.8499584,0.008533397,0.0008579645,0.0007320138,0.000014288509,0.00026419686,0.00062890135],"genre_scores_gemma":[0.9750552,0.00007260324,0.022913758,0.0016572467,0.00015512567,0.000034585086,0.000030215093,0.00004033395,0.000040889685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776095,0.000436361,0.00047137527,0.0004752977,0.00034131468,0.0005147052],"domain_scores_gemma":[0.99597394,0.0013316302,0.00026198145,0.0017337017,0.00048129473,0.00021742476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072486635,0.00026764168,0.00043869278,0.00020370507,0.0005248988,0.0005296739,0.0012795129,0.00009446622,6.545472e-7],"category_scores_gemma":[0.000103849765,0.00029031464,0.00015171319,0.00053077814,0.0002743941,0.0005200974,0.00023850413,0.0003235725,0.000027233222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011758675,0.0029593152,0.0017246084,0.00047639766,0.0035607612,0.0003105076,0.046530385,0.014585868,0.3018502,0.20615621,0.08652185,0.33414802],"study_design_scores_gemma":[0.0042590937,0.00016829604,0.00022768229,0.0010361114,0.00011425169,0.00018505722,0.0008968929,0.97986865,0.007047014,0.0005255392,0.004568483,0.001102905],"about_ca_topic_score_codex":0.0001343498,"about_ca_topic_score_gemma":0.000071288276,"teacher_disagreement_score":0.9652828,"about_ca_system_score_codex":0.0001846206,"about_ca_system_score_gemma":0.0001293362,"threshold_uncertainty_score":0.9999549},"labels":[],"label_agreement":null},{"id":"W2288338004","doi":"10.1109/lwc.2015.2488646","title":"Integral Approximations for Coverage Probability","year":2015,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximations of π; Poisson distribution; Laplace transform; Mathematics; Laplace's method; Noise (video); Poisson point process; Applied mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.049671454996825286,"score_gpt":0.2793022279883548,"score_spread":0.2296307729915295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288338004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018557524,0.00040959893,0.97298807,0.0015308248,0.0011356064,0.002627827,0.00060435844,0.001033736,0.0011124606],"genre_scores_gemma":[0.79900503,0.00022353006,0.19412649,0.0001676366,0.00017384114,0.0042372416,0.0018375335,0.00015782437,0.000070866365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.00014739025,0.0006854475,0.00036380056,0.00016108307,0.0003178123],"domain_scores_gemma":[0.99548066,0.00024647676,0.00021569977,0.0036122357,0.00033638015,0.000108549524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004072332,0.00039394776,0.0004791641,0.00019256603,0.0001884755,0.00012275654,0.0016052278,0.00030084923,0.0000034575512],"category_scores_gemma":[0.000081231265,0.0004582011,0.00018236371,0.00021653679,0.00018836212,0.00023650048,0.00038195093,0.0008316508,0.000019344305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060407056,0.00006230848,0.000037253692,0.00061194896,0.00009970728,2.0775329e-7,0.00078144256,0.98302376,0.0018547779,0.0013663995,0.009558997,0.0025971667],"study_design_scores_gemma":[0.0004945303,0.000010605091,0.00001475801,0.0002928654,0.00006945884,0.000003784348,0.00007544623,0.98473966,0.0005860967,0.0059976033,0.0070447335,0.0006704535],"about_ca_topic_score_codex":0.000038304748,"about_ca_topic_score_gemma":0.00009890037,"teacher_disagreement_score":0.78044754,"about_ca_system_score_codex":0.0008058262,"about_ca_system_score_gemma":0.00010467154,"threshold_uncertainty_score":0.999787},"labels":[],"label_agreement":null},{"id":"W2345860503","doi":"10.1109/lwc.2016.2561285","title":"Secrecy Capacity Scaling With Untrustworthy Aggressive Relays Cooperating With a Wire-Tapper","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Université du Québec à Montréal","funders":"","keywords":"Secrecy; Bounded function; Computer network; Scaling; Computer science; Relay; Beamforming; Trustworthiness; Topology (electrical circuits); Value (mathematics); Computer security; Telecommunications; Mathematics; Power (physics); Physics; Combinatorics","score_opus":0.032190279773112465,"score_gpt":0.24572945123910833,"score_spread":0.21353917146599588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345860503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3648612,0.000304567,0.60745525,0.025561063,0.000088546374,0.00047887475,0.000006646664,0.00036620768,0.0008776735],"genre_scores_gemma":[0.9383611,0.0007574846,0.057522215,0.0028721578,0.00006012259,0.00028507988,0.000009010262,0.000043360236,0.00008947551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973531,0.000665734,0.00046095636,0.0005849985,0.00040143577,0.00053379696],"domain_scores_gemma":[0.99345183,0.0007377229,0.00046861984,0.0047192853,0.00043126897,0.00019129418],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004719345,0.00037267045,0.00036324642,0.00019254725,0.0013578528,0.00033325973,0.003902139,0.00008459856,0.0000180054],"category_scores_gemma":[0.000051041483,0.00024027363,0.00007241139,0.0011107433,0.0007290008,0.0010825176,0.00070374773,0.00052731787,0.0000578588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018497006,0.0007222799,0.028407458,0.000062650084,0.0007102623,0.00009267724,0.013420648,0.004690531,0.18779299,0.28719038,0.0030906757,0.47363448],"study_design_scores_gemma":[0.030124871,0.002153101,0.0308198,0.024708437,0.0006163262,0.0027878848,0.0022313197,0.681564,0.110311285,0.0014774048,0.09793542,0.015270191],"about_ca_topic_score_codex":0.00003506145,"about_ca_topic_score_gemma":0.00044911777,"teacher_disagreement_score":0.67687345,"about_ca_system_score_codex":0.00019600545,"about_ca_system_score_gemma":0.00015277595,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W2414872774","doi":"10.1109/lwc.2016.2575820","title":"Uplink Energy-Efficient Load Balancing Over Multipath Wireless Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Green IT and Sustainability","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Energy consumption; Network packet; Quality of service; Multipath propagation; Wireless; Efficient energy use; Load balancing (electrical power); Wireless network; Real-time computing; Distributed computing; Telecommunications; Grid","score_opus":0.009108458550065843,"score_gpt":0.21477237335599642,"score_spread":0.20566391480593058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414872774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7094184,0.00036699264,0.28709897,0.0016454952,0.0004233015,0.00016200352,0.000009354867,0.00048115608,0.0003942938],"genre_scores_gemma":[0.99825937,0.00030016995,0.0005830899,0.0004508439,0.000113730486,0.00012650414,0.000011831372,0.000067397945,0.00008706282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983523,0.0001281946,0.00043307935,0.0002861262,0.0002463199,0.0005539751],"domain_scores_gemma":[0.99685985,0.00035534636,0.00006310654,0.0024573773,0.00012185644,0.00014247047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031835298,0.0002864033,0.00028695163,0.00010327294,0.00028171204,0.000055869834,0.0011418223,0.00014137615,0.000018679566],"category_scores_gemma":[0.000018122366,0.00024200226,0.0001396507,0.0003147408,0.00027261028,0.00015041092,0.0001883963,0.00029904788,0.000025181407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000531035,0.0004412881,0.025427535,0.00015710828,0.0003193397,0.000029977618,0.0019023924,0.5499327,0.14536856,0.0100334,0.012922946,0.25341165],"study_design_scores_gemma":[0.00070099626,0.000008886814,0.0030803888,0.00012375352,0.000023363658,0.000005559804,0.0000863785,0.9893842,0.0016964906,0.000038452665,0.004367444,0.00048409784],"about_ca_topic_score_codex":0.00020149,"about_ca_topic_score_gemma":0.0001664879,"teacher_disagreement_score":0.4394515,"about_ca_system_score_codex":0.00067209796,"about_ca_system_score_gemma":0.00004355804,"threshold_uncertainty_score":0.9868566},"labels":[],"label_agreement":null},{"id":"W2428133240","doi":"10.1109/lwc.2016.2581810","title":"Employing Broadcast Channel for Frequency Tracking in LTE-MTC Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless 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":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; Channel (broadcasting); Synchronization (alternating current); Single-frequency network; Signal-to-noise ratio (imaging); Diversity scheme; Antenna (radio); Noise (video); Electronic engineering; Real-time computing; Computer network; Telecommunications; Fading; Engineering","score_opus":0.04162520930799082,"score_gpt":0.2888146067721533,"score_spread":0.2471893974641625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2428133240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17985979,0.0024394435,0.80895185,0.0043163765,0.0004645417,0.0013650402,0.000097333555,0.0019330223,0.00057261565],"genre_scores_gemma":[0.9803579,0.0022130979,0.015255015,0.00018527044,0.000066283494,0.0017348794,0.000029794299,0.00013480062,0.000022979086],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981756,0.00016045471,0.00071822485,0.00027810526,0.00016995086,0.0004976524],"domain_scores_gemma":[0.9958861,0.000804997,0.0001520055,0.0029596542,0.00011357629,0.00008370916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003742779,0.00030311538,0.0003769102,0.00040427543,0.00024436417,0.00007437365,0.0020632267,0.00014350915,0.000002953944],"category_scores_gemma":[0.000051063773,0.00029089866,0.000108426284,0.00042752168,0.0002139854,0.00065495813,0.00013604538,0.00033908282,0.000021974764],"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.000013852989,0.00014345784,0.0015735569,0.00023833221,0.000092801885,0.0000035152464,0.0013333343,0.0157963,0.87667125,0.010246563,0.0017093074,0.092177704],"study_design_scores_gemma":[0.01152814,0.00028904006,0.006860025,0.013343213,0.00021189213,0.00016693192,0.0027869747,0.53960556,0.33543876,0.009467777,0.07106095,0.009240726],"about_ca_topic_score_codex":0.00008853506,"about_ca_topic_score_gemma":0.00010968358,"teacher_disagreement_score":0.80049807,"about_ca_system_score_codex":0.00045141968,"about_ca_system_score_gemma":0.000021469501,"threshold_uncertainty_score":0.99995434},"labels":[],"label_agreement":null},{"id":"W2435702290","doi":"10.1109/lwc.2016.2537819","title":"CoV-Based Metrics for Quantifying the Regularity of Hard-Core Point Processes for Modeling Base Station Locations","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Ministry of Higher Education and Scientific Research","keywords":"Point process; Stochastic geometry; Base station; Computer science; Base (topology); Point (geometry); Lattice (music); Poisson distribution; Poisson point process; Metric (unit); Core (optical fiber); Stochastic process; Range (aeronautics); Homogeneous; Wireless network; Statistical physics; Wireless; Mathematics; Statistics; Geometry; Mathematical analysis; Physics; Telecommunications; Engineering","score_opus":0.11131855965708255,"score_gpt":0.3071100871076363,"score_spread":0.19579152745055378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2435702290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025520634,0.00029962682,0.96830326,0.004073348,0.0001295368,0.001208929,0.00027254783,0.00018383279,0.000008308912],"genre_scores_gemma":[0.8145942,0.000110301764,0.18398035,0.0001399074,0.000024998564,0.000967697,0.000126092,0.00005141438,0.0000050217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897915,0.000053077987,0.00049280666,0.00016770375,0.00010969502,0.00019756689],"domain_scores_gemma":[0.99642384,0.0015198542,0.00018934923,0.001242737,0.0005946042,0.000029623183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004190091,0.00015302683,0.0001980716,0.00020038545,0.00031956064,0.000029799,0.00061368046,0.000062835585,5.835243e-7],"category_scores_gemma":[0.00036621979,0.00011956485,0.000079449565,0.0005040003,0.00011102494,0.0003174557,0.000023484967,0.000082266066,0.0000010309825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014747749,0.0000357502,0.000115955285,0.0004107886,0.00004149158,2.0619966e-8,0.00023239311,0.85682315,0.13761581,0.0022774884,0.00039358527,0.002038832],"study_design_scores_gemma":[0.00057796715,0.000013337819,0.000010980673,0.00022811077,0.000056779692,5.513077e-7,0.00014006732,0.9612949,0.037078198,0.00022191003,0.00021509956,0.00016208153],"about_ca_topic_score_codex":0.000024625746,"about_ca_topic_score_gemma":0.0001526276,"teacher_disagreement_score":0.7890736,"about_ca_system_score_codex":0.00015783634,"about_ca_system_score_gemma":0.00007520594,"threshold_uncertainty_score":0.4875713},"labels":[],"label_agreement":null},{"id":"W2509323143","doi":"10.1109/lwc.2016.2601609","title":"Analytical Approximation of Packet Delay Jitter in Simple Queues","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Network Optimization","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":"Western University","funders":"","keywords":"Jitter; Computer science; Network packet; Queueing theory; Quality of service; Computer network; Processing delay; Scheduling (production processes); Real-time computing; Queue; Transmission delay; Packet analyzer; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.017660280032283895,"score_gpt":0.24967348994576055,"score_spread":0.23201320991347665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509323143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6227403,0.00008483568,0.37452188,0.001885372,0.00006822931,0.00019239286,0.000015080947,0.00016942217,0.00032246046],"genre_scores_gemma":[0.9906856,0.00045640583,0.008509701,0.00015455305,0.000030522675,0.000072127965,0.000039348648,0.000042770786,0.000008965855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989211,0.000102455655,0.00045131185,0.0001467973,0.00014121273,0.0002371326],"domain_scores_gemma":[0.998395,0.00030304358,0.00008479863,0.0011201161,0.000052420775,0.00004461119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014924542,0.00015182512,0.00023273786,0.00020932725,0.0000458421,0.000012851805,0.00052798854,0.0000806635,0.000016552154],"category_scores_gemma":[0.000020195115,0.00013448665,0.000052249816,0.00042730183,0.00018665213,0.00033091896,0.00005922065,0.00015085621,0.00002106597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029035667,0.00016786868,0.01633974,0.00010119134,0.0001013028,0.0000038448034,0.00081010564,0.77503544,0.13293634,0.005471615,0.0056566503,0.06334684],"study_design_scores_gemma":[0.0007261079,0.000011203202,0.0023985372,0.00019318356,0.000019414783,0.000003790251,0.000053533928,0.98288244,0.011881724,0.00037825646,0.0011011686,0.00035064778],"about_ca_topic_score_codex":0.000013610056,"about_ca_topic_score_gemma":0.000079542086,"teacher_disagreement_score":0.36794525,"about_ca_system_score_codex":0.00015091979,"about_ca_system_score_gemma":0.000010346158,"threshold_uncertainty_score":0.5484206},"labels":[],"label_agreement":null},{"id":"W2558612042","doi":"10.1109/lwc.2016.2633990","title":"Optimization of Watchdog Selection in Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","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 Ottawa","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Software deployment; Key distribution in wireless sensor networks; Distrust; Node (physics); Sensor node; Wireless; Computer security; Wireless network; Telecommunications; Engineering","score_opus":0.015253843999126292,"score_gpt":0.2329542501091517,"score_spread":0.2177004061100254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558612042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21916863,0.000055480068,0.773572,0.0063466816,0.00025596702,0.00021537625,0.000001853361,0.0002095255,0.00017447407],"genre_scores_gemma":[0.92925596,0.0005789185,0.06948796,0.00045256878,0.000062261664,0.000066172695,0.0000070359897,0.00003728913,0.000051807274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731135,0.0005624475,0.00074783165,0.000507864,0.0003512776,0.00051919965],"domain_scores_gemma":[0.99651855,0.0006994946,0.00040443946,0.0020841756,0.00019512151,0.000098234465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047915726,0.00027303782,0.00037448716,0.0004114569,0.00019874623,0.00006969562,0.002669306,0.00018008247,0.0000066764096],"category_scores_gemma":[0.000024404453,0.00023776646,0.00011430505,0.0015680258,0.0003231346,0.00061798445,0.00036839367,0.00031655992,0.000009442258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012581742,0.000177549,0.0038303982,0.000008552713,0.000023997649,0.000002667903,0.00018016694,0.9233333,0.051477462,0.0062375185,0.00031024445,0.014405573],"study_design_scores_gemma":[0.0006854678,0.000028338995,0.0015093354,0.00022304372,0.000008875662,0.000012790123,0.000017022423,0.989645,0.007357979,0.000015888587,0.00016392139,0.0003323348],"about_ca_topic_score_codex":0.00013595907,"about_ca_topic_score_gemma":0.00014661886,"teacher_disagreement_score":0.71008736,"about_ca_system_score_codex":0.00023256004,"about_ca_system_score_gemma":0.000052558753,"threshold_uncertainty_score":0.9695835},"labels":[],"label_agreement":null},{"id":"W2579947163","doi":"10.1109/lwc.2017.2659732","title":"Automation of Millimeter Wave Network Planning for Outdoor Coverage in Dense Urban Areas Using Wall-Mounted Base Stations","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":47,"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":"Base station; Extremely high frequency; Computer science; Network planning and design; Millimeter; Cellular network; Automation; Computer network; Base (topology); Process (computing); Telecommunications; Engineering; Physics; Optics","score_opus":0.07225577056434274,"score_gpt":0.3022131560072835,"score_spread":0.22995738544294075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579947163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53918904,0.000105196945,0.45975077,0.0003333017,0.00013834746,0.00031487396,0.000037506383,0.000064769025,0.00006618386],"genre_scores_gemma":[0.95881945,0.00006542635,0.04048178,0.00027834685,0.00005059646,0.00010494527,0.00013985658,0.000048907896,0.000010704672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874276,0.00009657053,0.00055875926,0.00017547017,0.00013879056,0.0002876378],"domain_scores_gemma":[0.99785715,0.00026819005,0.00025525768,0.0014445676,0.000115064744,0.00005978172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035407543,0.00018743578,0.00026801598,0.00021113176,0.00048166575,0.00010918464,0.0005395056,0.00008551695,0.000006322711],"category_scores_gemma":[0.000057348694,0.0002199541,0.000095329364,0.00012287503,0.00010247795,0.00035951336,0.00007102949,0.00021474231,0.0000035078428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002335609,0.000050102557,0.0026440255,0.00011000743,0.000095133546,0.000002405644,0.0019267316,0.8223642,0.16933201,0.00010456494,0.0009294751,0.002417964],"study_design_scores_gemma":[0.0006637198,0.0000093137205,0.0025064535,0.00027609122,0.0000423311,0.0000028890668,0.00006908016,0.9868382,0.009122461,0.00007917477,0.00015938796,0.00023090129],"about_ca_topic_score_codex":0.000101851416,"about_ca_topic_score_gemma":0.00008797384,"teacher_disagreement_score":0.41963038,"about_ca_system_score_codex":0.00015780776,"about_ca_system_score_gemma":0.000025401472,"threshold_uncertainty_score":0.89694685},"labels":[],"label_agreement":null},{"id":"W2581797895","doi":"10.1109/lwc.2017.2730204","title":"Relay-Assisted Mixed FSO/RF Systems Over Málaga- $\\mathcal {M}$ and $\\kappa $ – $\\mu $ Shadowed Fading Channels","year":2017,"lang":"en","type":"preprint","venue":"IEEE Wireless 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Transmission (telecommunications); Relay; Electronic engineering; Telecommunications; Physics; Computer science; Optics; Engineering; Channel (broadcasting); Quantum mechanics","score_opus":0.04713809605147177,"score_gpt":0.276412661861033,"score_spread":0.22927456580956126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581797895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9323837,0.01600074,0.022707725,0.012943426,0.004642667,0.002334214,0.000344927,0.005929523,0.0027130903],"genre_scores_gemma":[0.98020047,0.01134542,0.0062631546,0.00016147841,0.00015329495,0.0011909987,0.00031890086,0.00027612763,0.00009017172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595207,0.0004114508,0.0013365871,0.0008662218,0.0005557104,0.00087797316],"domain_scores_gemma":[0.98512566,0.00089032104,0.0006788775,0.012837873,0.00020559257,0.0002616753],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00072421215,0.0010245423,0.0013726663,0.00066219777,0.0011024394,0.0012095678,0.007831704,0.0012674513,0.000008341532],"category_scores_gemma":[0.00018544588,0.0011668485,0.00031784523,0.0003179878,0.0014308232,0.0004405587,0.0046442146,0.0036942486,0.00008385335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015810288,0.0015942545,0.005082316,0.009404485,0.0071165594,0.0001982868,0.0072250096,0.41336003,0.21635717,0.060633052,0.06560903,0.21326171],"study_design_scores_gemma":[0.0015821164,0.0000438772,0.0053770356,0.003961376,0.0003369876,0.00009710756,0.0006753415,0.96452194,0.0034773087,0.0007850007,0.01579275,0.0033491324],"about_ca_topic_score_codex":0.00036487807,"about_ca_topic_score_gemma":0.000102009,"teacher_disagreement_score":0.55116194,"about_ca_system_score_codex":0.0005973924,"about_ca_system_score_gemma":0.00007801411,"threshold_uncertainty_score":0.99982727},"labels":[],"label_agreement":null},{"id":"W2586461115","doi":"10.1109/lwc.2017.2665472","title":"Cell Switch-Off for Networks Deployed With Variable Spatial Regularity","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Computer science; Cellular network; Energy (signal processing); Variable (mathematics); Set (abstract data type); Efficient energy use; Energy consumption; Computer network; Algorithm; Mathematics; Engineering; Electrical engineering","score_opus":0.01418865303635925,"score_gpt":0.22890567752693794,"score_spread":0.2147170244905787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586461115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023682803,0.00017877056,0.97333735,0.0007108569,0.00036487085,0.00064732396,0.000020193142,0.00036193107,0.0006959185],"genre_scores_gemma":[0.8870246,0.00013458567,0.11200498,0.00013055021,0.00012976423,0.00035169162,0.000073628216,0.00009157637,0.000058665173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907666,0.000049702172,0.00027280662,0.00020062555,0.00009469999,0.00030548585],"domain_scores_gemma":[0.9962317,0.00014210578,0.00018189402,0.003270993,0.000102701306,0.000070651266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018252886,0.00020348183,0.00023466331,0.000057493926,0.00083181413,0.00016254948,0.0013136317,0.0001072441,0.0000020564075],"category_scores_gemma":[0.000015769408,0.00021464415,0.00004805692,0.00008378881,0.00015277429,0.00039555217,0.000092692884,0.0002581655,0.000004782933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002178748,0.00004031282,0.00065132935,0.00006486896,0.000056391353,8.742656e-7,0.000112543836,0.9803347,0.011810523,0.00033955145,0.0037630657,0.0028040344],"study_design_scores_gemma":[0.00094360637,0.000019642957,0.0003133894,0.000096364376,0.000049370465,0.000004344731,0.000023671528,0.9910284,0.0033463116,0.00003793063,0.003790393,0.0003465224],"about_ca_topic_score_codex":0.00017532779,"about_ca_topic_score_gemma":0.00031454573,"teacher_disagreement_score":0.86334175,"about_ca_system_score_codex":0.00011244979,"about_ca_system_score_gemma":0.000020835316,"threshold_uncertainty_score":0.87529343},"labels":[],"label_agreement":null},{"id":"W2593419552","doi":"10.1109/lwc.2017.2676109","title":"Wireless Information and Power Transfer in Secure Massive MIMO Downlink With Phase Noise","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Base station; Wireless; Artificial noise; MIMO; Computer network; Secrecy; Information leakage; Maximum power transfer theorem; Information transfer; Noise (video); Channel (broadcasting); Electronic engineering; Telecommunications; Transmitter; Power (physics); Computer security; Engineering; Physics; Artificial intelligence","score_opus":0.011292203049547379,"score_gpt":0.23448310252341184,"score_spread":0.22319089947386447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593419552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756522,0.00014928487,0.018786674,0.003357074,0.00019388182,0.0003129668,0.00003793671,0.0002561284,0.0012538338],"genre_scores_gemma":[0.996694,0.0005679399,0.0019610205,0.0004327371,0.000039008006,0.0001655207,0.000076440076,0.000055082168,0.000008214455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871194,0.00008024991,0.00044043286,0.00019217558,0.000199823,0.0003753814],"domain_scores_gemma":[0.99733484,0.0001566727,0.00010708815,0.0022111798,0.000072129136,0.00011810341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019232887,0.00030423194,0.0003093563,0.00020318753,0.00047360372,0.0003234004,0.0012445201,0.00016552901,0.0000063797106],"category_scores_gemma":[0.0000137746565,0.00030613717,0.000044880657,0.00017261371,0.0004756453,0.0013587933,0.00009947804,0.000692661,0.000013113331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045747042,0.0009198897,0.031343944,0.0009182393,0.00085829827,0.00015797067,0.024938507,0.6217949,0.12956409,0.015441696,0.007293475,0.16631155],"study_design_scores_gemma":[0.011735254,0.00018053208,0.026749207,0.0020130933,0.00014315854,0.00008070704,0.0008403667,0.93063277,0.010498239,0.00006077578,0.014609266,0.0024566364],"about_ca_topic_score_codex":0.00013881052,"about_ca_topic_score_gemma":0.0007121372,"teacher_disagreement_score":0.3088379,"about_ca_system_score_codex":0.00010587458,"about_ca_system_score_gemma":0.00002822169,"threshold_uncertainty_score":0.9999391},"labels":[],"label_agreement":null},{"id":"W2604831012","doi":"10.1109/lwc.2017.2690677","title":"Cell Switch-Off Algorithms for Spatially Irregular Base Station Deployments","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Base station; Computer science; Algorithm; Software deployment; Grid; Interference (communication); Cellular network; Poisson point process; Process (computing); Point process; Stochastic geometry; Computer network; Mathematics","score_opus":0.02997745173238225,"score_gpt":0.27332216981091384,"score_spread":0.24334471807853159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604831012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04821568,0.00025284372,0.94792944,0.0013287293,0.00064125477,0.0008391288,0.00009717588,0.000362298,0.00033346406],"genre_scores_gemma":[0.8747242,0.00029090082,0.12380373,0.00018369542,0.000097982804,0.00047877125,0.00022697262,0.00010585471,0.00008786103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989317,0.000058168956,0.00037456758,0.00021366666,0.0001415426,0.00028035376],"domain_scores_gemma":[0.99668497,0.00012497955,0.00022689957,0.0027655463,0.000118185955,0.00007940681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000195636,0.00021171602,0.00020964895,0.00010826317,0.0007313952,0.0001643245,0.001255123,0.00008253918,0.000003842299],"category_scores_gemma":[0.000026999865,0.00025474906,0.00007614562,0.00007032991,0.00010957123,0.00059946196,0.000086830616,0.00016267707,0.000029408851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018177263,0.00013658372,0.0005859745,0.00022044017,0.00011630346,0.000003173811,0.00086649344,0.684563,0.25603446,0.00030089926,0.008712264,0.048442252],"study_design_scores_gemma":[0.001194079,0.000019237226,0.00034119288,0.0000935766,0.000048047117,0.0000023348557,0.00006507165,0.96153927,0.030915752,0.000064769345,0.005288848,0.00042779444],"about_ca_topic_score_codex":0.000082098675,"about_ca_topic_score_gemma":0.00012229707,"teacher_disagreement_score":0.8265086,"about_ca_system_score_codex":0.00017004563,"about_ca_system_score_gemma":0.000021238837,"threshold_uncertainty_score":0.99999046},"labels":[],"label_agreement":null},{"id":"W2611908895","doi":"10.1109/lwc.2017.2700840","title":"3-D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage","year":2017,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","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":"Carleton University","funders":"","keywords":"Software deployment; Base station; Computer science; Dimension (graph theory); Real-time computing; Transmitter power output; Wireless; Base (topology); Computer network; Telecommunications; Mathematics","score_opus":0.023264278415849552,"score_gpt":0.25882862092418407,"score_spread":0.23556434250833452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611908895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47438583,0.00011367272,0.5221041,0.0007961543,0.00049034413,0.000853041,0.00086800865,0.00019579445,0.00019308293],"genre_scores_gemma":[0.9726326,0.00040249416,0.021886019,0.00012398235,0.00013508198,0.0013331149,0.0033777086,0.00009108413,0.000017903663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984429,0.00010294188,0.00060554943,0.00034694275,0.00023212719,0.00026957],"domain_scores_gemma":[0.99573207,0.00013422602,0.00040515652,0.0034394073,0.00019803361,0.00009110214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002796638,0.00031100324,0.0003678379,0.00015482373,0.0004034465,0.00015825045,0.0015070143,0.00021498917,0.0000111198],"category_scores_gemma":[0.000013746029,0.00037999375,0.00014145288,0.00010025845,0.00016485722,0.0001434132,0.0002780774,0.00029445876,0.0000041028875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004589344,0.00020880355,0.000010316005,0.00014681993,0.000087397886,3.1028128e-7,0.00038276147,0.96184045,0.028136406,0.0012417657,0.0008739157,0.00702518],"study_design_scores_gemma":[0.00083878386,0.0000317278,0.00012982807,0.00010577667,0.00008674165,6.9470093e-7,0.000045938483,0.98310417,0.013255045,0.00013644001,0.0018858586,0.00037896677],"about_ca_topic_score_codex":0.0002809478,"about_ca_topic_score_gemma":0.00018562483,"teacher_disagreement_score":0.50021803,"about_ca_system_score_codex":0.00024888318,"about_ca_system_score_gemma":0.000066748806,"threshold_uncertainty_score":0.9998652},"labels":[],"label_agreement":null},{"id":"W2736754802","doi":"10.1109/lwc.2017.2729554","title":"Mode Switching for SWIPT Over Fading Channel With Nonlinear Energy Harvesting","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Fading; Energy harvesting; Computer science; Wireless; Decoding methods; Nonlinear system; Maximum power transfer theorem; Channel (broadcasting); Energy (signal processing); Information transfer; Electronic engineering; Power (physics); Computer network; Telecommunications; Mathematics; Engineering; Statistics; Physics","score_opus":0.025542153711147896,"score_gpt":0.26272124661162366,"score_spread":0.23717909290047576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736754802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44350374,0.00018545028,0.55143344,0.0015310672,0.0005860752,0.00024288302,0.000030625706,0.0008270602,0.0016596589],"genre_scores_gemma":[0.95480937,0.00016210532,0.043485627,0.0004693008,0.00041171405,0.00030790715,0.00006487336,0.00019257277,0.000096529366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837744,0.000058136895,0.00041460534,0.0003399245,0.00021094347,0.0005989742],"domain_scores_gemma":[0.9956974,0.0004793893,0.00026605313,0.0033319485,0.00008843807,0.00013681456],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00024020535,0.0003720371,0.00036403097,0.0001465459,0.00165236,0.00045952506,0.002344686,0.00014061849,0.0000015806089],"category_scores_gemma":[0.00005558271,0.0003922962,0.00010890279,0.00012925532,0.00022067544,0.0007270853,0.00022064551,0.00048189823,0.0000036021675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283579,0.000044640878,0.0008047602,0.00009181893,0.00018639324,0.0000065182153,0.00047585164,0.9302576,0.050379504,0.002464195,0.0009814865,0.014290922],"study_design_scores_gemma":[0.0006222682,0.00001638861,0.00040124558,0.0004820746,0.00004416363,0.000012820307,0.000032692147,0.989066,0.0046085906,0.0000639697,0.004112498,0.00053727423],"about_ca_topic_score_codex":0.0006393876,"about_ca_topic_score_gemma":0.0014189791,"teacher_disagreement_score":0.51130563,"about_ca_system_score_codex":0.0001445732,"about_ca_system_score_gemma":0.000028869874,"threshold_uncertainty_score":0.9998529},"labels":[],"label_agreement":null},{"id":"W2738208647","doi":"10.1109/lwc.2017.2731840","title":"Physical Layer Security in Ultra-Dense Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","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":"Concordia University","funders":"","keywords":"Physical layer; Secrecy; Stochastic geometry; Computer science; Rician fading; Fading; Computer network; Wireless; Channel (broadcasting); Telecommunications; Mathematics; Computer security; Statistics","score_opus":0.025510955519572345,"score_gpt":0.2852912983913028,"score_spread":0.25978034287173046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738208647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98088145,0.0003264162,0.005332666,0.0055728545,0.00022350853,0.00040832305,0.000018062463,0.000981775,0.0062549147],"genre_scores_gemma":[0.9964612,0.0014335004,0.0012065094,0.00042385358,0.00009999593,0.00025580666,0.00003215819,0.00007833944,0.000008632933],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.00021248938,0.00041896093,0.00024847165,0.00020974544,0.00042422774],"domain_scores_gemma":[0.9920454,0.00029873117,0.00015259016,0.007339174,0.00006133183,0.00010274079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003334989,0.00029131252,0.00037816036,0.00017745764,0.0005697287,0.0002581432,0.004464992,0.00015387137,0.0000072570683],"category_scores_gemma":[0.00003506454,0.0003467339,0.00012905651,0.00019240598,0.00054634723,0.0005714092,0.0003293819,0.0011147417,0.000047738602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009317816,0.0027156065,0.044651672,0.0004063884,0.00062128087,0.00009781543,0.025470918,0.08415749,0.6562538,0.053192005,0.058413997,0.073925816],"study_design_scores_gemma":[0.0012033379,0.000024594687,0.015740212,0.00039219516,0.000045391145,0.000022375354,0.00021025624,0.923031,0.044333603,0.0014610173,0.012086819,0.0014491944],"about_ca_topic_score_codex":0.00026294088,"about_ca_topic_score_gemma":0.00084949797,"teacher_disagreement_score":0.8388735,"about_ca_system_score_codex":0.00017872656,"about_ca_system_score_gemma":0.000015237522,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W2751369415","doi":"10.1109/lwc.2017.2747543","title":"A Hierarchical Learning Solution for Anti-Jamming Stackelberg Game With Discrete Power Strategies","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Distributed Control Multi-Agent Systems","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":"Toronto Metropolitan University; McMaster University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Mathematical optimization; Convergence (economics); Game theory; Bounded rationality; Nash equilibrium; Power (physics); Bounded function; Mathematics; Artificial intelligence; Mathematical economics","score_opus":0.026824362111032084,"score_gpt":0.2874370576465063,"score_spread":0.2606126955354742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751369415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16639806,0.00004737074,0.81306916,0.01913756,0.00022882872,0.0005045018,0.000019220462,0.000234027,0.0003612889],"genre_scores_gemma":[0.97607625,0.00002029991,0.023211025,0.00024047545,0.000054812357,0.0002630713,0.000042940126,0.000030132218,0.000060984465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800235,0.00029225298,0.0003815068,0.00046487342,0.00032921473,0.0005297988],"domain_scores_gemma":[0.9947148,0.00036633492,0.000498928,0.0041378117,0.00016172552,0.00012041831],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004938679,0.00025546976,0.00033000176,0.0001224362,0.0017785984,0.0016302579,0.004746044,0.00008417757,0.0000013330209],"category_scores_gemma":[0.00007269561,0.00023601126,0.00012603927,0.00013754751,0.00048571962,0.0016863063,0.0004967484,0.0004666356,0.000020092877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033045304,0.00094301265,0.019796085,0.0003397296,0.0014574574,0.00008591672,0.019873746,0.029068245,0.44765726,0.38749805,0.0046758777,0.08827415],"study_design_scores_gemma":[0.003981876,0.00032141435,0.023011692,0.00050386763,0.000082907995,0.00004642276,0.0006208473,0.94451815,0.0012867434,0.00041727442,0.023939064,0.0012697615],"about_ca_topic_score_codex":0.0002447528,"about_ca_topic_score_gemma":0.00016484357,"teacher_disagreement_score":0.91544986,"about_ca_system_score_codex":0.00010802033,"about_ca_system_score_gemma":0.00012213369,"threshold_uncertainty_score":0.99952096},"labels":[],"label_agreement":null},{"id":"W2753471900","doi":"10.1109/lwc.2017.2747555","title":"Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Exploit; Computer science; Resource allocation; Bipartite graph; Matching (statistics); Cellular network; Resource management (computing); Distributed computing; Graph; Resource (disambiguation); Computer network; Computer security; Theoretical computer science; Mathematics","score_opus":0.030334745496058302,"score_gpt":0.25524594467233774,"score_spread":0.22491119917627944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753471900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19470818,0.0001548167,0.80077046,0.0014503478,0.00030686866,0.0006051726,0.000010407617,0.0005486341,0.0014450826],"genre_scores_gemma":[0.9967513,0.000069628964,0.0021871526,0.0002436816,0.00018039258,0.0002619126,0.00018054363,0.00009955523,0.00002579546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984187,0.00057464314,0.00036723432,0.00018051968,0.000121591125,0.0003373043],"domain_scores_gemma":[0.9959615,0.0003719993,0.0002607576,0.0032389478,0.000096724434,0.00007010635],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004722971,0.00026644432,0.00029159724,0.000106711464,0.003389203,0.00022868124,0.0020659417,0.00017925889,0.0000020392497],"category_scores_gemma":[0.00002942949,0.000333047,0.00009825014,0.00014581007,0.0003327456,0.00038845505,0.00028735292,0.0009664913,0.000018060739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013426898,0.00009029673,0.000879283,0.00014052457,0.00017981,0.0000026968687,0.0033715423,0.9183548,0.04857452,0.0005564329,0.0017019985,0.026134653],"study_design_scores_gemma":[0.0007783354,0.00001654797,0.0026009865,0.00022501414,0.00007351005,0.000005373838,0.000989035,0.98867583,0.0043116407,0.00005155627,0.0016064058,0.0006657469],"about_ca_topic_score_codex":0.0002585073,"about_ca_topic_score_gemma":0.00035746564,"teacher_disagreement_score":0.80204314,"about_ca_system_score_codex":0.00035810607,"about_ca_system_score_gemma":0.000011883417,"threshold_uncertainty_score":0.99991214},"labels":[],"label_agreement":null},{"id":"W2754349741","doi":"10.1109/lwc.2017.2752161","title":"3-D Placement of an Unmanned Aerial Vehicle Base Station for Maximum Coverage of Users With Different QoS Requirements","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":454,"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":"Base station; Quality of service; Wireless; Base (topology); Computational complexity theory; Wireless network","score_opus":0.028552766520178456,"score_gpt":0.26632325978868904,"score_spread":0.23777049326851057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754349741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.822511,0.000009866521,0.17616011,0.0003879237,0.000095053874,0.0005707683,0.00013958913,0.000043461918,0.00008218752],"genre_scores_gemma":[0.98852307,0.0001087055,0.010669663,0.00004298415,0.000027367465,0.0002863797,0.00030231941,0.00003346379,0.0000060482535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921393,0.00004257372,0.00032529252,0.00012972226,0.00014752217,0.00014093198],"domain_scores_gemma":[0.9977549,0.00006867949,0.00025648435,0.0017712112,0.00010317547,0.000045557365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012824118,0.00012935678,0.00018462223,0.00007747402,0.00027062866,0.000047511647,0.0006760711,0.000041736286,0.000005919906],"category_scores_gemma":[0.00000777605,0.00012848413,0.000039274106,0.000060155246,0.00014198829,0.0003055887,0.00004517783,0.0000668355,7.898804e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033484498,0.00061673555,0.0033318112,0.00029717686,0.00026529908,4.273585e-7,0.0012512059,0.4350859,0.540664,0.0014518945,0.0006317998,0.016068919],"study_design_scores_gemma":[0.0046655857,0.00026633526,0.014297293,0.00018737646,0.0001518559,9.0329615e-7,0.00026944003,0.7968989,0.18216783,0.000107457876,0.0005236193,0.00046342006],"about_ca_topic_score_codex":0.00008039313,"about_ca_topic_score_gemma":0.00019279959,"teacher_disagreement_score":0.361813,"about_ca_system_score_codex":0.000074178635,"about_ca_system_score_gemma":0.00001322061,"threshold_uncertainty_score":0.523943},"labels":[],"label_agreement":null},{"id":"W2756263459","doi":"10.1109/lwc.2017.2752165","title":"Multi-User Detection Using ADMM-Based Compressive Sensing for Uplink Grant-Free NOMA","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":50,"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; Mitacs","keywords":"Noma; Telecommunications link; Computer science; Compressed sensing; Telecommunications; Algorithm","score_opus":0.06288613182131962,"score_gpt":0.3007873308354745,"score_spread":0.23790119901415485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756263459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22958572,0.00025956464,0.76560014,0.0024374784,0.00033531405,0.0005886135,0.00004574092,0.0011125955,0.000034817676],"genre_scores_gemma":[0.6899906,0.00011989303,0.30944666,0.00015640313,0.00003281563,0.00012450264,0.00002702172,0.00009349305,0.00000860742],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984972,0.000088668094,0.00049680134,0.000316604,0.0001594527,0.00044131238],"domain_scores_gemma":[0.98934233,0.00047415576,0.0003779176,0.009526939,0.00020370765,0.00007494705],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00019783685,0.0003524067,0.0003794735,0.00026733222,0.00205312,0.00022978465,0.004415369,0.00021329969,0.0000015402738],"category_scores_gemma":[0.0001997202,0.00041947994,0.00017176592,0.00015794199,0.0007116052,0.0005274659,0.0005558462,0.00059116696,0.000010219393],"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.000019872517,0.00006125634,0.00024852753,0.00008533273,0.000093444534,0.0000019696056,0.00015368263,0.15830357,0.7997996,0.0002366318,0.00019872004,0.040797338],"study_design_scores_gemma":[0.0012162206,0.000009518058,0.0004950371,0.00015491253,0.00003448727,0.0000060017746,0.00008035003,0.8127784,0.1824861,0.00009719271,0.0022215755,0.00042020445],"about_ca_topic_score_codex":0.00010150407,"about_ca_topic_score_gemma":0.000430327,"teacher_disagreement_score":0.6544748,"about_ca_system_score_codex":0.00027025273,"about_ca_system_score_gemma":0.000026430085,"threshold_uncertainty_score":0.9998257},"labels":[],"label_agreement":null},{"id":"W2757460375","doi":"10.1109/lwc.2017.2761350","title":"Level-Triggered Harvest-Then-Consume Protocol With Two Bits or Less Energy State Information","year":2017,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Protocol (science); Energy (signal processing); Battery (electricity); Energy consumption; Duty cycle; State (computer science); Process (computing); Real-time computing; Algorithm; Voltage; Mathematics; Electrical engineering; Engineering; Statistics; Physics","score_opus":0.0572284219485145,"score_gpt":0.28346967935638623,"score_spread":0.22624125740787174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757460375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22190535,0.0004573086,0.65023255,0.007354513,0.0043230485,0.09014901,0.0020252203,0.00981217,0.013740839],"genre_scores_gemma":[0.76928926,0.00062448595,0.031042973,0.000941273,0.00037189605,0.19515455,0.0013363353,0.0004955421,0.00074371597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996225,0.00039662884,0.0013087201,0.0005570403,0.00063892396,0.00087370444],"domain_scores_gemma":[0.9898746,0.0005409888,0.001081731,0.007855343,0.00037815387,0.00026916532],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00047611672,0.0010477542,0.00097248994,0.00056690053,0.00082362466,0.0012409228,0.005390965,0.00047215546,0.0000138414225],"category_scores_gemma":[0.00005941239,0.00096881227,0.00019178039,0.00035544118,0.0007731045,0.0013779458,0.0012281106,0.002160719,0.00005160026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014397036,0.000113641116,0.00036984446,0.0009685103,0.0006467962,0.000028356304,0.0008693144,0.915516,0.0010443907,0.00086302473,0.007749397,0.071686745],"study_design_scores_gemma":[0.006999206,0.0001204211,0.002365668,0.009418732,0.00036590899,0.0001681278,0.00014088022,0.79729706,0.009267191,0.00042774243,0.1678122,0.005616868],"about_ca_topic_score_codex":0.0017688097,"about_ca_topic_score_gemma":0.004867042,"teacher_disagreement_score":0.61918956,"about_ca_system_score_codex":0.00049658853,"about_ca_system_score_gemma":0.00040927573,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W2757471963","doi":"10.1109/lwc.2017.2757468","title":"Performance of SWIPT-Based Differential AF Relaying Over Nakagami- $m$ Fading Channels With Direct Link","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Nakagami distribution; Fading; Link (geometry); Computer science; Differential (mechanical device); Computer network; Channel (broadcasting); Electronic engineering; Telecommunications; Physics; Engineering","score_opus":0.019813855390867375,"score_gpt":0.23188044924789844,"score_spread":0.21206659385703105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757471963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984155,0.0000914785,0.01150743,0.0006479344,0.0006079927,0.00017642966,0.000010270986,0.00038571222,0.0024177535],"genre_scores_gemma":[0.99641407,0.00019602524,0.002851044,0.00010377728,0.00016883542,0.00010425116,0.000030500347,0.00009939463,0.000032110634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985333,0.00008702867,0.00041534723,0.0002502612,0.00029887463,0.00041515767],"domain_scores_gemma":[0.9958533,0.00029474654,0.0002990931,0.003394782,0.00006745846,0.00009060429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019892532,0.00031221096,0.00039488162,0.00016658095,0.0007999391,0.00015763247,0.0020190997,0.00015031558,0.000008404949],"category_scores_gemma":[0.000022635635,0.00031494934,0.00009796355,0.00016342882,0.00048745444,0.000393004,0.00016841234,0.00062538177,0.0000066490147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003160359,0.00005379427,0.025532283,0.00020754323,0.00017309461,0.0000050675476,0.00031583908,0.90330935,0.06517409,0.00026007873,0.00030983606,0.0046274518],"study_design_scores_gemma":[0.00073433877,0.000035272747,0.016952299,0.0010572982,0.000061300125,0.000003722801,0.000010356917,0.96265143,0.017632876,0.0000024076803,0.00038662215,0.00047205074],"about_ca_topic_score_codex":0.00011128141,"about_ca_topic_score_gemma":0.00007958579,"teacher_disagreement_score":0.05934214,"about_ca_system_score_codex":0.00014414913,"about_ca_system_score_gemma":0.000027995759,"threshold_uncertainty_score":0.99993026},"labels":[],"label_agreement":null},{"id":"W2768147779","doi":"10.1109/lwc.2017.2776920","title":"A Game-Theoretic Approach for Optimal Distributed Cooperative Hybrid Caching in D2D Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Nash equilibrium; Cache; Base station; Potential game; Aggregate (composite); Function (biology); Mathematical optimization; Computer network; Distributed computing; Mathematics","score_opus":0.030209561253599512,"score_gpt":0.2682377018568233,"score_spread":0.23802814060322375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768147779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2329923,0.000099551144,0.76179725,0.00436569,0.00015191815,0.0003489448,0.000027355603,0.00009179664,0.00012520746],"genre_scores_gemma":[0.9842338,0.00008597895,0.014330249,0.00084684644,0.00005277865,0.00028421817,0.00012860965,0.000018733977,0.000018796005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984797,0.0002686556,0.00032357176,0.00039995156,0.00014445648,0.00038364885],"domain_scores_gemma":[0.99555767,0.00033763607,0.00022384665,0.0037100997,0.000092442,0.0000783141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005597527,0.00020064911,0.00027342464,0.00010573492,0.0010553536,0.0006893977,0.0048768786,0.00005419036,4.4375125e-7],"category_scores_gemma":[0.00004058,0.00020660879,0.00011979931,0.00012795186,0.00037249314,0.0006093015,0.0005033068,0.00047989306,0.000003171202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758854,0.0009544199,0.0041774134,0.00007869576,0.00023297506,0.00003799898,0.0037502488,0.8663547,0.010213304,0.073253155,0.004046969,0.03677255],"study_design_scores_gemma":[0.0006801654,0.000021960283,0.0004897472,0.000064981235,0.00001179332,0.000013947584,0.000052842133,0.99799275,0.00017032832,0.000058148595,0.00018815152,0.0002551837],"about_ca_topic_score_codex":0.00024354832,"about_ca_topic_score_gemma":0.000041373616,"teacher_disagreement_score":0.7512415,"about_ca_system_score_codex":0.00011783567,"about_ca_system_score_gemma":0.00004137537,"threshold_uncertainty_score":0.9062535},"labels":[],"label_agreement":null},{"id":"W2770095216","doi":"10.1109/lwc.2017.2778242","title":"Environment-Aware Drone-Base-Station Placements in Modern Metropolitans","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":73,"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":"Huawei Technologies; Ontario Ministry of Economic Development and Innovation","keywords":"Drone; Computer science; Base station; Benchmark (surveying); Real-time computing; Channel (broadcasting); Roof; Simulation; Computer network; Geography; Engineering; Civil engineering","score_opus":0.02318963483147364,"score_gpt":0.24835745794727426,"score_spread":0.22516782311580064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770095216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63131475,0.00012818025,0.36350185,0.0028016919,0.00011495376,0.00042006394,0.00006635517,0.00017974582,0.0014724178],"genre_scores_gemma":[0.99133635,0.00060153974,0.007331859,0.00014762029,0.000022808748,0.00028038886,0.0001859948,0.000043103293,0.000050321767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.000046118163,0.000284442,0.00017544243,0.00014163894,0.0002246893],"domain_scores_gemma":[0.99741143,0.000049359125,0.00010023389,0.0023687358,0.000017114413,0.000053151485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119001095,0.00015341613,0.00014184341,0.00014769,0.00044988072,0.00011194965,0.0010143272,0.00006603755,0.000019125706],"category_scores_gemma":[0.0000053562344,0.0001868318,0.000039418614,0.00008082946,0.00016006979,0.0003772266,0.00008863129,0.00020386181,0.00006457233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012381066,0.0002677548,0.0140133,0.000059066646,0.00010537824,0.000002844619,0.001553521,0.88403696,0.06816231,0.0021644859,0.0026058266,0.027016195],"study_design_scores_gemma":[0.00061607943,0.000006696185,0.007837335,0.00003539598,0.00002011268,9.544882e-7,0.00017587455,0.98757297,0.0022870544,0.00018265122,0.0009820058,0.00028290148],"about_ca_topic_score_codex":0.00026600636,"about_ca_topic_score_gemma":0.00029465248,"teacher_disagreement_score":0.36002162,"about_ca_system_score_codex":0.00031371,"about_ca_system_score_gemma":0.000009642695,"threshold_uncertainty_score":0.76187795},"labels":[],"label_agreement":null},{"id":"W2773861676","doi":"10.1109/lwc.2017.2779483","title":"Strategic Densification With UAV-BSs in Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":110,"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":"Huawei Technologies","keywords":"Computer science; Base station; Cellular network; Software deployment; Wireless network; Quality of service; Field (mathematics); Wireless; Computer network; Real-time computing; Distributed computing; Telecommunications","score_opus":0.025903444881559424,"score_gpt":0.22640109859201057,"score_spread":0.20049765371045114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773861676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8081633,0.00019495732,0.18578705,0.002203805,0.00010428662,0.00036075295,0.000004951179,0.00021615093,0.0029647504],"genre_scores_gemma":[0.99286973,0.0004883905,0.0061386577,0.000108371896,0.00004399928,0.00020784116,0.000083683975,0.000042344018,0.000016976406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992235,0.000040870575,0.00024802686,0.00017189782,0.00010099502,0.00021472505],"domain_scores_gemma":[0.9969216,0.00004702744,0.00010780278,0.0028226592,0.000050989383,0.000049929433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013237417,0.00015312832,0.00014670116,0.00010512035,0.0004432799,0.00020055992,0.0011268326,0.00008201886,0.000005938434],"category_scores_gemma":[0.0000025411496,0.00015985186,0.000028336084,0.0001795158,0.00019035705,0.00027579453,0.00004892221,0.00028668152,0.00002321783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007937603,0.000084888015,0.005321774,0.00002386027,0.00003932634,0.0000034936434,0.0002581419,0.9495486,0.033294912,0.006867885,0.0004122184,0.0041369707],"study_design_scores_gemma":[0.00037628395,0.0000073099327,0.008712053,0.000055179633,0.00001831784,0.000003165166,0.00008762819,0.98828757,0.001530464,0.00006556754,0.0005822831,0.0002741579],"about_ca_topic_score_codex":0.00013212698,"about_ca_topic_score_gemma":0.00059524114,"teacher_disagreement_score":0.18470645,"about_ca_system_score_codex":0.00009105329,"about_ca_system_score_gemma":0.000014250337,"threshold_uncertainty_score":0.65185696},"labels":[],"label_agreement":null},{"id":"W2783785065","doi":"10.1109/lwc.2018.2792023","title":"Optimal Epidemic Information Dissemination in Uncertain Dynamic Environment","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Opportunistic and Delay-Tolerant 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":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain; Computer science; Reliability (semiconductor); Dynamic programming; Markov decision process; Epidemic model; Markov process; Dissemination; Mathematical optimization; Stochastic programming; Continuous-time Markov chain; Stochastic process; Markov model; Stochastic modelling; Variable-order Markov model; Mathematics; Population; Machine learning; Algorithm","score_opus":0.017124376884706385,"score_gpt":0.2710108525983225,"score_spread":0.25388647571361617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783785065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1095233,0.000045278062,0.878583,0.010713472,0.00019125809,0.00020797369,0.000005501844,0.00008881176,0.0006414215],"genre_scores_gemma":[0.9448125,0.00020135682,0.05325519,0.0015191089,0.000027577718,0.00006992469,0.000075452306,0.000007614405,0.000031271473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863744,0.0001795063,0.00047780218,0.0002002066,0.00022298342,0.0002820546],"domain_scores_gemma":[0.99764407,0.00027387327,0.00019789956,0.0017689147,0.000041824987,0.00007342735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004923949,0.00014798353,0.00015923385,0.00020934516,0.00024191385,0.000110304805,0.0017660984,0.000078311976,0.000011018845],"category_scores_gemma":[0.000006517114,0.00015789722,0.0000446594,0.0003447608,0.0002804347,0.0010537121,0.00030627576,0.0002561136,0.00018320644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029698336,0.00030654317,0.0018746491,0.00002948466,0.000044517248,0.000011186131,0.008523375,0.010829298,0.007409588,0.014344996,0.010938778,0.9456579],"study_design_scores_gemma":[0.00019037383,0.000024382423,0.001281627,0.00005401019,0.000004545971,0.000009137477,0.00007951097,0.9945621,0.000084723026,0.00012747015,0.0033961565,0.00018597557],"about_ca_topic_score_codex":0.00005590259,"about_ca_topic_score_gemma":0.000023185903,"teacher_disagreement_score":0.98373276,"about_ca_system_score_codex":0.00021977823,"about_ca_system_score_gemma":0.000037914542,"threshold_uncertainty_score":0.64388615},"labels":[],"label_agreement":null},{"id":"W2792981848","doi":"10.1109/lwc.2018.2815683","title":"Optimal User Grouping for Downlink NOMA","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":68,"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":"Telecommunications link; Noma; Computer science; Computational complexity theory; Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.026126756547836263,"score_gpt":0.2712134743253921,"score_spread":0.24508671777755586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792981848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2551942,0.00042996253,0.73512936,0.005237147,0.00044114637,0.00052977435,0.0000389694,0.0023360462,0.0006634056],"genre_scores_gemma":[0.7960471,0.0004933593,0.20216876,0.00050939573,0.00011290613,0.00050355133,0.000056639252,0.0000805601,0.000027722837],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.000053782627,0.00043844455,0.0002458329,0.00013130132,0.00042902262],"domain_scores_gemma":[0.9953631,0.00039849512,0.000101791506,0.003929515,0.00014423278,0.000062865096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017768006,0.00026296006,0.0002656849,0.00022461744,0.0005393452,0.000074489806,0.0027966932,0.00014796646,0.0000120494915],"category_scores_gemma":[0.00004092336,0.00030227978,0.00011122986,0.00042690433,0.0007537396,0.0003762505,0.00031619243,0.000398292,0.00010698293],"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.000052123865,0.00023472808,0.0006801884,0.0001909834,0.00042191616,0.00000215725,0.0020866385,0.09333668,0.687458,0.037471343,0.037339017,0.14072627],"study_design_scores_gemma":[0.0015257446,0.00011981596,0.00072999287,0.00022820955,0.000057201923,0.00001734719,0.00076538644,0.5550099,0.1654155,0.00066807074,0.2739364,0.0015264327],"about_ca_topic_score_codex":0.000009679797,"about_ca_topic_score_gemma":0.0000442579,"teacher_disagreement_score":0.5408529,"about_ca_system_score_codex":0.00016540328,"about_ca_system_score_gemma":0.000014881532,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W2796932148","doi":"10.1109/lwc.2018.2859965","title":"Approximation of Meta Distribution and its Moments for Poisson Cellular Networks","year":2018,"lang":"en","type":"preprint","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Poisson distribution; Distribution (mathematics); Applied mathematics; Mathematics; Scaling; Compound Poisson distribution; Zero-inflated model; Simple (philosophy); Statistical physics; Mathematical optimization; Computer science; Poisson regression; Mathematical analysis; Statistics; Physics","score_opus":0.034187466703745784,"score_gpt":0.25845921745389944,"score_spread":0.22427175075015365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796932148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052400075,0.0025366403,0.94229317,0.0003651332,0.00045751638,0.0013349416,0.00038912924,0.00019563359,0.000027786149],"genre_scores_gemma":[0.98000115,0.0011003077,0.014736933,0.000026121656,0.00009789095,0.0009326878,0.0030209268,0.0000726185,0.000011387702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871343,0.000108525266,0.00058514625,0.00026156957,0.000119670454,0.00021166442],"domain_scores_gemma":[0.99782115,0.00014284,0.00035134322,0.0014228465,0.0002104625,0.000051333533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028549414,0.00029003777,0.00049734337,0.00011031181,0.00013677664,0.000042466843,0.00065162743,0.0002570479,0.0000019560603],"category_scores_gemma":[0.000021488644,0.00032980496,0.00013600138,0.00015303289,0.000102318285,0.00017421469,0.00025178306,0.00030974453,0.0000015688016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000841604,0.000037233192,0.000017336224,0.0007485286,0.00065914396,9.844232e-8,0.00023024443,0.9751277,0.021002486,0.0005344152,0.0010630169,0.0005713606],"study_design_scores_gemma":[0.00024280814,0.000010385074,0.00001693853,0.0001826438,0.00045245793,8.218427e-7,0.000017310367,0.98511344,0.013242756,0.00011807367,0.0003282133,0.0002741212],"about_ca_topic_score_codex":0.000013148434,"about_ca_topic_score_gemma":0.0000071154927,"teacher_disagreement_score":0.92760104,"about_ca_system_score_codex":0.0001691211,"about_ca_system_score_gemma":0.000012073295,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W2799870440","doi":"10.1109/lwc.2018.2835449","title":"Joint Channel Resources Allocation and Beamforming in Energy Harvesting Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Research Foundation of Korea; Ministry of Education","keywords":"Beamforming; Channel state information; Computer science; Telecommunications link; Channel (broadcasting); Upper and lower bounds; Mathematical optimization; Energy harvesting; Joint (building); Energy (signal processing); Control theory (sociology); Wireless; Mathematics; Telecommunications; Statistics; Engineering","score_opus":0.02275773492035144,"score_gpt":0.2155324524581857,"score_spread":0.19277471753783426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799870440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.944074,0.0014703376,0.050645936,0.0009095045,0.0005512388,0.00014720115,0.0000037495531,0.00056552986,0.0016325345],"genre_scores_gemma":[0.9956316,0.0005717045,0.0029719102,0.00025882656,0.00028403898,0.00014400041,0.000020856582,0.00007090278,0.00004618019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985954,0.00014832785,0.0004936018,0.00023547358,0.00015486327,0.00037229015],"domain_scores_gemma":[0.99840045,0.0002437592,0.0001096602,0.0010988702,0.000061141574,0.0000861427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037689778,0.00022330956,0.00025077604,0.0002940738,0.0002896087,0.00014342695,0.00060683256,0.00011724728,9.604563e-7],"category_scores_gemma":[0.0000300351,0.00026037244,0.000029796836,0.00046163893,0.00034164722,0.00032354327,0.00014290289,0.00031205983,0.000005928464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058204223,0.000047762016,0.0012178766,0.00014885694,0.00007212319,0.0000054672055,0.0033935,0.87863296,0.09274585,0.004637593,0.0009950071,0.01809717],"study_design_scores_gemma":[0.00022306271,0.000014301643,0.0012266885,0.0005906872,0.000010739465,0.000023109922,0.00023134665,0.9901289,0.002265729,0.00002487651,0.0049289903,0.00033156638],"about_ca_topic_score_codex":0.0010573447,"about_ca_topic_score_gemma":0.0010227067,"teacher_disagreement_score":0.11149593,"about_ca_system_score_codex":0.00014061954,"about_ca_system_score_gemma":0.000010750451,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W2805055016","doi":"10.1109/lwc.2018.2845373","title":"Power-Based Broadband RF Interference Detector for Wireless Communication Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Detector; Interference (communication); Nakagami distribution; Co-channel interference; Computer science; False alarm; Broadband; Fading; Electronic engineering; Electromagnetic interference; Radio frequency; Wireless; Kurtosis; Power (physics); Telecommunications; Physics; Channel (broadcasting); Engineering; Mathematics","score_opus":0.025930480690004244,"score_gpt":0.25699062057362193,"score_spread":0.23106013988361768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805055016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84341747,0.0014480567,0.14656107,0.0034462293,0.00089192414,0.0015442774,0.0002153434,0.0014840764,0.0009915743],"genre_scores_gemma":[0.98573655,0.0004045808,0.0108955465,0.00056005165,0.00011823032,0.0017634053,0.0002684779,0.00019922495,0.00005393336],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997174,0.0003781085,0.0009944586,0.0004406933,0.00031283428,0.00069990114],"domain_scores_gemma":[0.98963964,0.0014276825,0.0002851423,0.007912376,0.00052617333,0.0002089727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005520929,0.00053945056,0.00057249324,0.0004359074,0.0011061811,0.00033473273,0.0052492684,0.00026096872,0.000033660963],"category_scores_gemma":[0.00006601787,0.00062440283,0.00021940077,0.0008006336,0.0012044411,0.00045928537,0.00034593718,0.0007187814,0.00017094762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018260909,0.00072167814,0.0010682289,0.00054032035,0.0006902382,0.0000020853008,0.004298903,0.14693551,0.7836156,0.012458687,0.036688246,0.0127978865],"study_design_scores_gemma":[0.001229545,0.000111186506,0.00044112332,0.00051039475,0.000070793736,0.000011264815,0.0003536618,0.9519511,0.023129318,0.000016534588,0.021275895,0.0008992215],"about_ca_topic_score_codex":0.00017799338,"about_ca_topic_score_gemma":0.0004818824,"teacher_disagreement_score":0.80501556,"about_ca_system_score_codex":0.00044985217,"about_ca_system_score_gemma":0.00009582652,"threshold_uncertainty_score":0.99962074},"labels":[],"label_agreement":null},{"id":"W2806013832","doi":"10.1109/lwc.2018.2844852","title":"Compute-and-Forward for Uplink Non-Orthogonal Multiple Access","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Decoding methods; Single antenna interference cancellation; Noma; Computer science; Interference (communication); Power (physics); Outage probability; De facto; Algorithm; Computer network; Fading; Channel (broadcasting)","score_opus":0.03322761231276616,"score_gpt":0.2941235707643596,"score_spread":0.2608959584515934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806013832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23807502,0.00029718655,0.7550339,0.004256347,0.00026691463,0.00055325933,0.00003932079,0.0012032279,0.00027480244],"genre_scores_gemma":[0.8945752,0.00087900355,0.10313877,0.00063953013,0.000084386826,0.0005188195,0.0000770609,0.00007588108,0.000011386533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987307,0.000040738625,0.00043858052,0.0002768913,0.00012646415,0.00038658033],"domain_scores_gemma":[0.99601775,0.00067259144,0.00011407434,0.0029593732,0.00015239217,0.00008382897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017745556,0.00027593336,0.00031179018,0.00023774762,0.00056843524,0.00012061704,0.002955633,0.00014548634,0.000004975882],"category_scores_gemma":[0.00004476449,0.00031033522,0.00009147689,0.00033004986,0.0008909159,0.00045145192,0.0006714884,0.00039940036,0.000031562915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102978185,0.0003642793,0.011774425,0.00048623185,0.0007250953,0.0000026647017,0.0021940286,0.06433219,0.29352725,0.025390316,0.039767835,0.5613327],"study_design_scores_gemma":[0.0010110858,0.000044708966,0.0028889177,0.000106113235,0.000027621223,0.000009298133,0.00009714131,0.9324535,0.035321604,0.0010525889,0.026323931,0.00066348107],"about_ca_topic_score_codex":0.000015409927,"about_ca_topic_score_gemma":0.00008901261,"teacher_disagreement_score":0.8681213,"about_ca_system_score_codex":0.00009492513,"about_ca_system_score_gemma":0.000018284944,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W2887000081","doi":"10.1109/lwc.2018.2864758","title":"Incentivizing Consensus Propagation in Proof-of-Stake Based Consortium Blockchain Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":112,"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":"Ministry of Education, India; Nanyang Technological University; National Research Foundation of Korea; Energy Market Authority of Singapore; Israel Science Foundation; National Research Foundation Singapore; National Research Foundation","keywords":"Blockchain; Stackelberg competition; Computer science; Database transaction; Proof-of-work system; Block (permutation group theory); Backward induction; Wireless network; Wireless; Cryptocurrency; Uniqueness; Computer network; Game theory; Computer security; Telecommunications; Mathematics; Mathematical economics","score_opus":0.022234782880950276,"score_gpt":0.2551769841751901,"score_spread":0.23294220129423981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887000081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44217733,0.000108229724,0.5418841,0.014833781,0.00011252826,0.00051939697,0.0000040416253,0.00018059376,0.00017999053],"genre_scores_gemma":[0.9586322,0.000009066891,0.04015874,0.0009239476,0.000027787899,0.00022088876,0.000008598425,0.000013960567,0.000004860015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981868,0.0003185357,0.00058677077,0.00038818852,0.0001812751,0.00033840045],"domain_scores_gemma":[0.9960563,0.00035283016,0.0003491391,0.0029712627,0.00021832652,0.000052125604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071258395,0.00017629792,0.00025468357,0.00035099286,0.00032327083,0.000044647717,0.0024376218,0.00015821659,0.0000028887491],"category_scores_gemma":[0.00003902163,0.00019356144,0.000060128204,0.0013426859,0.0011626855,0.00007219828,0.00032532497,0.00043575568,0.0000064325536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010049405,0.003209408,0.031341277,0.00017746714,0.00018560042,0.00002539134,0.004903163,0.020731932,0.15556031,0.48486716,0.003958567,0.29493922],"study_design_scores_gemma":[0.00045161037,0.000038724207,0.001269836,0.00008498469,0.000007491041,0.0000059826098,0.00004438791,0.9618586,0.034739405,0.0005579244,0.0007148831,0.00022621888],"about_ca_topic_score_codex":0.000105356274,"about_ca_topic_score_gemma":0.00039345774,"teacher_disagreement_score":0.94112664,"about_ca_system_score_codex":0.000088628614,"about_ca_system_score_gemma":0.0001088599,"threshold_uncertainty_score":0.78932065},"labels":[],"label_agreement":null},{"id":"W2891613953","doi":"10.1109/lwc.2018.2869152","title":"Joint Antenna Selection and Power Allocation for an Energy-efficient Massive MIMO System","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Telecommunications link; Mathematical optimization; Precoding; MIMO; Computer science; Optimization problem; Channel state information; Iterative method; Efficient energy use; Transmitter power output; Channel (broadcasting); Mathematics; Wireless; Telecommunications; Transmitter; Engineering","score_opus":0.018152894794548558,"score_gpt":0.23691020907730306,"score_spread":0.2187573142827545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891613953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11349262,0.00012321463,0.88447183,0.0004253836,0.00037740014,0.0004121233,0.000015659036,0.00048138882,0.00020034234],"genre_scores_gemma":[0.97806144,0.000041946336,0.021186545,0.00012972453,0.00010970389,0.00032964526,0.00006503613,0.0000628003,0.0000131393135],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990243,0.000091729264,0.00034095036,0.00022490376,0.00009303493,0.00022512543],"domain_scores_gemma":[0.99866414,0.00006343878,0.000112750335,0.00084847654,0.00023641501,0.000074762385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016816825,0.00017727604,0.00018275522,0.00017675085,0.00036078767,0.00006258037,0.00028995928,0.00008525861,0.0000013212406],"category_scores_gemma":[0.00001021898,0.00019928958,0.000037616617,0.00025619406,0.00012049523,0.00023840496,0.000034644436,0.00009889091,0.0000065550753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017006252,0.00006167313,0.00003765868,0.000115659976,0.00007285411,2.5260246e-7,0.0013985519,0.28206223,0.7055602,0.0075576585,0.0008866995,0.002229535],"study_design_scores_gemma":[0.00029384656,0.00005447587,0.000068783345,0.00010504278,0.000022034885,0.000012898537,0.00044004578,0.9852949,0.012810391,0.0000086282735,0.0006656084,0.00022337041],"about_ca_topic_score_codex":0.000049773244,"about_ca_topic_score_gemma":0.00013811463,"teacher_disagreement_score":0.8645688,"about_ca_system_score_codex":0.00026507117,"about_ca_system_score_gemma":0.0000137679945,"threshold_uncertainty_score":0.8126793},"labels":[],"label_agreement":null},{"id":"W2891685769","doi":"10.1109/lwc.2018.2868645","title":"Sequential Relay Selection in D2D-Enabled Cellular Networks With Outdated CSI Over Mixed Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Fading; Relay; Computer science; Channel state information; Outage probability; Selection (genetic algorithm); Computer network; Signal-to-noise ratio (imaging); Channel (broadcasting); Relay channel; Throughput; Cellular network; Cellular radio; Diversity combining; Algorithm; Telecommunications; Wireless; Physics; Base station; Power (physics)","score_opus":0.0328936548253857,"score_gpt":0.2657566319595045,"score_spread":0.2328629771341188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891685769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3778956,0.00016864945,0.61619955,0.0043791165,0.00038315548,0.0003503855,9.594947e-7,0.0002782387,0.00034433312],"genre_scores_gemma":[0.98362505,0.00037350634,0.013888232,0.0016338336,0.00018098777,0.00012641703,0.00003160308,0.000037392245,0.00010294468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729055,0.0009006718,0.00050900714,0.0005030152,0.00026772567,0.0005290286],"domain_scores_gemma":[0.99672097,0.00023331039,0.0002521573,0.002419328,0.0002620614,0.00011218734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007081764,0.0002901666,0.00030577465,0.00037307607,0.0009089822,0.0003681223,0.0031731073,0.00012531463,0.000023156883],"category_scores_gemma":[0.000015822246,0.00029063,0.000070414,0.002153664,0.0003590837,0.0008442822,0.0007053381,0.0007106049,0.000040092982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021818928,0.001126045,0.01181899,0.000045786473,0.0004908922,0.000044511475,0.014452538,0.23396209,0.6276849,0.033821695,0.018656453,0.05767794],"study_design_scores_gemma":[0.00091124175,0.00007165912,0.0013138513,0.0001674215,0.0000148541485,0.000013782011,0.00003726988,0.98418427,0.008290095,0.000018337898,0.0045381146,0.00043913216],"about_ca_topic_score_codex":0.00010345422,"about_ca_topic_score_gemma":0.00100052,"teacher_disagreement_score":0.75022215,"about_ca_system_score_codex":0.00027261116,"about_ca_system_score_gemma":0.000081393,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W2893192565","doi":"10.1109/lwc.2018.2871677","title":"Double Shadowing the Rician Fading Model","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":45,"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":"Engineering and Physical Sciences Research Council; Khalifa University of Science, Technology and Research; Queen's University; Queen's University Belfast; Department for the Economy","keywords":"Nakagami distribution; Rician fading; Notation; Inverse; Fading; Mathematics; Envelope (radar); Algorithm; Computer science; Discrete mathematics; Telecommunications; Arithmetic; Geometry","score_opus":0.03218998593421339,"score_gpt":0.2621793640646779,"score_spread":0.2299893781304645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893192565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058556113,0.00020157265,0.92965305,0.002402102,0.00036769474,0.0003017569,0.0000051933885,0.0005659392,0.007946604],"genre_scores_gemma":[0.9813929,0.00007936421,0.017504232,0.0006481619,0.00013030201,0.00010511308,0.00001236196,0.000055787423,0.00007178407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992283,0.000041932435,0.00025639476,0.0001287289,0.0001010024,0.00024364796],"domain_scores_gemma":[0.998086,0.00008160334,0.0000535351,0.0016795822,0.000060488735,0.000038813694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015952405,0.0001430697,0.00012577233,0.000087813016,0.00051800866,0.000065992856,0.0010418468,0.000051606636,0.00000406311],"category_scores_gemma":[0.000004969253,0.00013019267,0.000047449725,0.00033483203,0.0001954264,0.00030520328,0.00008999121,0.00023599032,0.0000816758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024733247,0.0000084127505,0.000046751942,0.000010619441,0.000028080349,2.3160761e-7,0.0018354941,0.93604743,0.05611392,0.0019100333,0.0022038245,0.0017927269],"study_design_scores_gemma":[0.00020022452,0.0000029360453,0.000011985784,0.000044489574,0.000012635675,0.0000035435755,0.0001364731,0.9931685,0.004263227,0.000051892293,0.0019393058,0.00016479417],"about_ca_topic_score_codex":0.000034450437,"about_ca_topic_score_gemma":0.00009927521,"teacher_disagreement_score":0.9228368,"about_ca_system_score_codex":0.0001322135,"about_ca_system_score_gemma":0.000010275982,"threshold_uncertainty_score":0.5309103},"labels":[],"label_agreement":null},{"id":"W2900083088","doi":"10.1109/lwc.2018.2890031","title":"Codeword Position Index Based Sparse Code Multiple Access System","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Huawei Technologies (Canada)","funders":"Engineering and Physical Sciences Research Council; National University of Defense Technology; National Natural Science Foundation of China","keywords":"Codebook; Code word; Computer science; Code (set theory); Algorithm; Block (permutation group theory); Position (finance); Decoding methods; Mathematics; Set (abstract data type)","score_opus":0.03491528759638738,"score_gpt":0.2769332008486084,"score_spread":0.24201791325222102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900083088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27366602,0.0002450049,0.714821,0.0043665813,0.00042392666,0.0005470985,0.00009117753,0.0046455897,0.0011935751],"genre_scores_gemma":[0.9782954,0.00020755277,0.020059822,0.00068409595,0.000072252464,0.00043980745,0.00012353422,0.00010926186,0.000008315993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822384,0.00018070548,0.0005720134,0.00031226396,0.00026633425,0.00044482344],"domain_scores_gemma":[0.9938682,0.00043825945,0.00018311688,0.005218995,0.00019659924,0.00009485969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020991941,0.00034102972,0.00034117777,0.00040365165,0.0006045645,0.0001596041,0.004185051,0.00020767808,0.000013042648],"category_scores_gemma":[0.000038038343,0.0003960392,0.00009953745,0.00083336286,0.0008323057,0.00061046827,0.0004479238,0.0006195474,0.00015470029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013394309,0.0004937681,0.022675056,0.0005980515,0.00041544138,0.000017482538,0.0009166402,0.47049925,0.4167653,0.012696841,0.01989702,0.054891206],"study_design_scores_gemma":[0.0007619742,0.000022996228,0.0025674584,0.00029339196,0.000023413228,0.000012243323,0.00024609047,0.91674405,0.07183042,0.000059114922,0.006855097,0.00058371533],"about_ca_topic_score_codex":0.000073449955,"about_ca_topic_score_gemma":0.0004689511,"teacher_disagreement_score":0.7046293,"about_ca_system_score_codex":0.00047683486,"about_ca_system_score_gemma":0.00003264304,"threshold_uncertainty_score":0.99984914},"labels":[],"label_agreement":null},{"id":"W2900255759","doi":"10.1109/lwc.2018.2879840","title":"Coupling Information Transmission With Window Decoding","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Decoding methods; Interleaving; Computer science; Network packet; Transmission (telecommunications); Channel (broadcasting); Sliding window protocol; Single antenna interference cancellation; Interference (communication); Algorithm; Coupling (piping); Electronic engineering; Window (computing); Telecommunications; Computer network; Engineering","score_opus":0.029512511676998344,"score_gpt":0.2676081651393079,"score_spread":0.23809565346230957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900255759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07660017,0.00013445642,0.90599304,0.014887592,0.00012254747,0.00023312353,0.0000011158482,0.00031345032,0.0017145135],"genre_scores_gemma":[0.9059574,0.00062030036,0.090728916,0.0025513326,0.000048076738,0.000050213268,0.000016922986,0.000011406649,0.000015424896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881375,0.00012499731,0.00035098745,0.0001952133,0.00024606285,0.00026897088],"domain_scores_gemma":[0.9966073,0.00019543925,0.00017254516,0.0026370634,0.00028654965,0.00010107139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037509788,0.00017312444,0.00015911958,0.00020416339,0.0011328812,0.00034301385,0.0030728974,0.00005044739,0.000013031706],"category_scores_gemma":[0.000010921563,0.00015660783,0.00004720476,0.00082334696,0.00030494717,0.0018146364,0.00033424865,0.00030178388,0.000110582274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055592245,0.00021564928,0.0018678011,0.000037113216,0.00012851335,0.0000027926342,0.014414638,0.0039434233,0.12339042,0.08488924,0.005424951,0.7656299],"study_design_scores_gemma":[0.0007424075,0.00008160101,0.0013258377,0.00022397297,0.000013654414,0.000021887981,0.00010021585,0.9263974,0.009457282,0.000045801746,0.061146606,0.00044332762],"about_ca_topic_score_codex":0.000011538746,"about_ca_topic_score_gemma":0.000042757016,"teacher_disagreement_score":0.922454,"about_ca_system_score_codex":0.00008733355,"about_ca_system_score_gemma":0.00006966353,"threshold_uncertainty_score":0.871332},"labels":[],"label_agreement":null},{"id":"W2907187178","doi":"10.1109/lwc.2018.2865770","title":"Extending the ITU-R P.530 Deep-Fading Outage Probability Results to SIMO-MRC and MIMO-MRC Line-of-Sight Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Ultra Electronics (Canada); École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maximal-ratio combining; Fading; Rayleigh fading; MIMO; Mathematics; Computer science; Signal-to-noise ratio (imaging); Algorithm; Topology (electrical circuits); Telecommunications; Statistics; Beamforming; Decoding methods; Combinatorics","score_opus":0.029443136400491125,"score_gpt":0.26358284015942274,"score_spread":0.23413970375893162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907187178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4085422,0.0011680023,0.582476,0.002980243,0.0010993913,0.0018208723,0.00007534533,0.0005439185,0.0012939826],"genre_scores_gemma":[0.98457056,0.00017419986,0.014587642,0.00015020059,0.00018305483,0.0002095707,0.000024861474,0.00006548829,0.00003441066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807936,0.00025818846,0.00079551974,0.0003236246,0.00019479482,0.00034850562],"domain_scores_gemma":[0.996395,0.0005796303,0.00021034047,0.0025170573,0.00018972946,0.00010828015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070757477,0.00026658687,0.00034750337,0.0001826038,0.000440427,0.00010137024,0.0010596184,0.000104183615,0.0000018679355],"category_scores_gemma":[0.00014800666,0.00023750661,0.00006004474,0.00056548475,0.00035809862,0.00031713385,0.00020883247,0.00030455017,0.000021599553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035803536,0.000057297282,0.0005687665,0.0002859005,0.0001186737,0.0000017291777,0.0069699544,0.831015,0.15429029,0.0016245694,0.0010065,0.0040255557],"study_design_scores_gemma":[0.00075431843,0.000060835955,0.00046560462,0.000687993,0.00006757625,0.000024041354,0.0008463992,0.9781374,0.012395258,0.0000774239,0.005836625,0.00064657297],"about_ca_topic_score_codex":0.00014284237,"about_ca_topic_score_gemma":0.00025801483,"teacher_disagreement_score":0.57602835,"about_ca_system_score_codex":0.0001951146,"about_ca_system_score_gemma":0.000015645468,"threshold_uncertainty_score":0.96852386},"labels":[],"label_agreement":null},{"id":"W2910858494","doi":"10.1109/lwc.2019.2901460","title":"On the Impact of Mode Selection on Effective Capacity of Device-to-Device Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Underlay; Computer science; Transmitter; Channel (broadcasting); Mode (computer interface); Overlay; Markov process; Quality of service; Selection (genetic algorithm); Computer network; Channel state information; Markov chain; Queue; Topology (electrical circuits); Signal-to-noise ratio (imaging); Telecommunications; Mathematics; Wireless; Statistics; Engineering; Electrical engineering","score_opus":0.017335028398187007,"score_gpt":0.27312614339192404,"score_spread":0.255791114993737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910858494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96575457,0.00003140088,0.031177416,0.0004422353,0.00007088507,0.0011860174,0.0000321865,0.00011620347,0.0011890722],"genre_scores_gemma":[0.99716926,0.000043732467,0.002349769,0.00015455905,0.00001028309,0.0001937653,0.00002539939,0.0000468715,0.000006352847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987528,0.00038198478,0.00038759504,0.0001458219,0.00016201905,0.00016978808],"domain_scores_gemma":[0.9962167,0.0011462239,0.00021348942,0.0022114057,0.00017174793,0.000040427607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002798663,0.00019646392,0.00028950474,0.00020650167,0.00012062148,0.000014305596,0.00090676977,0.00007865361,0.0000091875545],"category_scores_gemma":[0.00004905712,0.00016545654,0.00011489346,0.0006218339,0.00009170621,0.00016447608,0.000057190067,0.00036994647,0.000054659464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022025046,0.000058755944,0.0006004088,0.000036992627,0.00007853625,1.382884e-8,0.0007721057,0.7760692,0.22016269,0.0014456166,0.00030778686,0.00044587854],"study_design_scores_gemma":[0.0006282519,0.0002577446,0.007707591,0.00074766215,0.000039250073,0.0000026927235,0.00018353171,0.8624189,0.12738863,0.00018032368,0.00005466784,0.00039074864],"about_ca_topic_score_codex":0.0005651852,"about_ca_topic_score_gemma":0.00012071769,"teacher_disagreement_score":0.092774056,"about_ca_system_score_codex":0.00038746747,"about_ca_system_score_gemma":0.000017331244,"threshold_uncertainty_score":0.6747122},"labels":[],"label_agreement":null},{"id":"W2911910187","doi":"10.1109/lwc.2019.2895039","title":"Deep Autoencoder Based CSI Feedback With Feedback Errors and Feedback Delay in FDD Massive MIMO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":91,"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; Channel state information; Autoencoder; MIMO; Telecommunications link; Feedback loop; Control theory (sociology); Channel (broadcasting); Transmission (telecommunications); Deep learning; Artificial intelligence; Wireless; Telecommunications","score_opus":0.010038081438527122,"score_gpt":0.21400958702095638,"score_spread":0.20397150558242927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911910187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46582952,0.0013712028,0.5256221,0.0022026892,0.0005988155,0.002052054,0.00003372097,0.000657251,0.001632581],"genre_scores_gemma":[0.96959424,0.00018303357,0.02929666,0.0002743719,0.000033442022,0.0002952508,0.00009003487,0.00014840967,0.00008457215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997992,0.00021814363,0.0006190507,0.00042257895,0.00024365283,0.00050458114],"domain_scores_gemma":[0.99715817,0.00029244114,0.00020039076,0.002092997,0.00012106989,0.00013492395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020887952,0.00042456234,0.00051660184,0.00035844053,0.00015229819,0.00012506172,0.00084070663,0.00018522724,0.000015485428],"category_scores_gemma":[0.000010091677,0.000435448,0.000057589757,0.0006235873,0.00021583645,0.00055990595,0.000091045964,0.0005310742,0.00014079784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022013968,0.000039958617,0.004337162,0.00021404507,0.00005956146,0.0000060024972,0.0006008906,0.9882669,0.0056258417,0.00014594027,0.00036370152,0.00031801505],"study_design_scores_gemma":[0.0015940133,0.000030599902,0.001290978,0.00051559927,0.000030387973,0.00002318202,0.0007469662,0.99408233,0.00028165212,0.000004552498,0.0008305077,0.0005692188],"about_ca_topic_score_codex":0.0001901399,"about_ca_topic_score_gemma":0.00043440965,"teacher_disagreement_score":0.5037647,"about_ca_system_score_codex":0.00038338013,"about_ca_system_score_gemma":0.00004352752,"threshold_uncertainty_score":0.99980974},"labels":[],"label_agreement":null},{"id":"W2915498241","doi":"10.1109/lwc.2019.2922610","title":"Design and Performance Analysis of Secure Multicasting Cooperative Protocol for Wireless Sensor Network Applications","year":2019,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security 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":"Université du Québec à Montréal","funders":"","keywords":"Computer network; Relay; Computer science; Secrecy; Beamforming; Channel state information; Wireless; Multicast; Hop (telecommunications); Transmission (telecommunications); Wireless sensor network; Computer security; Telecommunications","score_opus":0.049450084915339906,"score_gpt":0.3125135281763849,"score_spread":0.26306344326104497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915498241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028456423,0.00014542034,0.8527313,0.0005658946,0.00006806492,0.11694564,0.00022532944,0.0007323661,0.00012960633],"genre_scores_gemma":[0.5058184,0.00037892486,0.14364448,0.00012028478,0.00005196595,0.34952554,0.00033108282,0.00012074492,0.000008544669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969173,0.00048147276,0.0012424833,0.00058066804,0.0002946894,0.0004834055],"domain_scores_gemma":[0.99182975,0.0017692903,0.00067135337,0.005055027,0.0005637015,0.00011086454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080417935,0.00062658254,0.0012337549,0.0006174301,0.00042035608,0.00014958176,0.0025851543,0.0004744226,0.000006076224],"category_scores_gemma":[0.00001999157,0.0007181772,0.00028200442,0.0011610928,0.000514855,0.00020325586,0.0009816721,0.001281715,0.000004234477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005139324,0.00013563389,0.000884856,0.0015919468,0.0018138496,1.8925887e-7,0.0013981488,0.9782608,0.008299226,0.0006896385,0.0010148872,0.0058594407],"study_design_scores_gemma":[0.00048248083,0.00003619968,0.00035630562,0.0006251949,0.00066724414,0.0000017338525,0.00007648227,0.9900945,0.0046389555,0.00003364679,0.0023046376,0.0006826457],"about_ca_topic_score_codex":0.000029418929,"about_ca_topic_score_gemma":0.00003296135,"teacher_disagreement_score":0.7090868,"about_ca_system_score_codex":0.00021676204,"about_ca_system_score_gemma":0.00010534098,"threshold_uncertainty_score":0.9995269},"labels":[],"label_agreement":null},{"id":"W2917328431","doi":"10.1109/lwc.2019.2900310","title":"Achievable Secure Degrees of Freedom of ${K}$ -User MISO Broadcast Channel With Imperfect CSIT","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Degrees of freedom (physics and chemistry); Imperfect; Computer science; Computer network; Channel (broadcasting); Broadcasting (networking); Telecommunications; Physics","score_opus":0.011482889251643516,"score_gpt":0.22211101525899868,"score_spread":0.21062812600735517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917328431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881715,0.0009880733,0.0067543653,0.0008631813,0.00010125374,0.00065251376,0.00007811066,0.00049483083,0.0018961545],"genre_scores_gemma":[0.9812478,0.0010817403,0.017261868,0.00007353986,0.000019498224,0.000111144145,0.00006490217,0.00010002974,0.000039479113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831027,0.00018469819,0.00062327215,0.00022669359,0.00033127292,0.00032382153],"domain_scores_gemma":[0.9945472,0.00033418273,0.00027207378,0.004559319,0.00021104608,0.000076216216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028420828,0.00031785935,0.00057021773,0.000320535,0.0001045543,0.000030778636,0.0026273145,0.00016213041,0.00003390777],"category_scores_gemma":[0.000009588004,0.0003201115,0.00014148098,0.00061446446,0.00043650705,0.00034118068,0.00028042652,0.000574628,0.000028518301],"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.00007969665,0.00043466012,0.006441681,0.00078033394,0.0005486414,0.0000017276883,0.004782568,0.14810434,0.8262195,0.00535987,0.005249919,0.001997073],"study_design_scores_gemma":[0.005369411,0.00076508196,0.018644584,0.0036365138,0.0004228747,0.000102192265,0.0028300488,0.5708433,0.3651116,0.00011258261,0.028689468,0.003472397],"about_ca_topic_score_codex":0.00033106093,"about_ca_topic_score_gemma":0.00019974704,"teacher_disagreement_score":0.4611079,"about_ca_system_score_codex":0.00008980771,"about_ca_system_score_gemma":0.000037920192,"threshold_uncertainty_score":0.9999251},"labels":[],"label_agreement":null},{"id":"W2917383620","doi":"10.1109/lwc.2019.2900654","title":"On the Throughput of Wireless Powered Communication Systems With a Multiple Antenna Bidirectional Relay","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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 Toronto","funders":"","keywords":"Relay; Beamforming; Throughput; Computer science; Wireless; Relay channel; Ergodic theory; Antenna (radio); Power (physics); Computer network; Topology (electrical circuits); Electronic engineering; Telecommunications; Electrical engineering; Engineering; Mathematics; Physics","score_opus":0.013944334310206113,"score_gpt":0.20681853176458442,"score_spread":0.1928741974543783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917383620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876748,0.0006049453,0.00615493,0.001635203,0.00048099956,0.00062735553,0.000029767214,0.0004682851,0.0023237318],"genre_scores_gemma":[0.9969433,0.00064053934,0.0015536981,0.00028958745,0.000040560117,0.00025036995,0.00007265172,0.00011149663,0.00009777734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800205,0.0004300001,0.000557975,0.00026328163,0.00040125023,0.00034546084],"domain_scores_gemma":[0.99303985,0.0024649827,0.00026759363,0.004000161,0.00016495207,0.000062435196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044688836,0.0003207633,0.00039725789,0.000160026,0.00031415556,0.0000811868,0.0019322033,0.00014301596,0.000013808171],"category_scores_gemma":[0.000029736435,0.000254177,0.00010075203,0.00066318625,0.0004505041,0.00022343082,0.00013775744,0.00078524166,0.00006122965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006442612,0.00018456449,0.005974731,0.00011313681,0.00037762223,0.0000017715292,0.0008667363,0.89834726,0.0673425,0.02275124,0.0034752851,0.0005007368],"study_design_scores_gemma":[0.0008645365,0.00006948653,0.0034348834,0.0013391526,0.000045349498,0.000028204451,0.0004013355,0.98931265,0.0020736104,0.000028046345,0.0018704274,0.00053232117],"about_ca_topic_score_codex":0.00029541337,"about_ca_topic_score_gemma":0.000180203,"teacher_disagreement_score":0.09096539,"about_ca_system_score_codex":0.00017088502,"about_ca_system_score_gemma":0.000034560264,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W2921642927","doi":"10.1109/lwc.2019.2904034","title":"Placement and Power Allocation for NOMA-UAV Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":191,"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; Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Noma; Computer science; Base station; Power (physics); Cellular network; Real-time computing; Scheme (mathematics); Path loss; Computer network; Path (computing); Convex optimization; Wireless; Regular polygon; Telecommunications link; Telecommunications; Mathematics","score_opus":0.008791963734104723,"score_gpt":0.213599130360244,"score_spread":0.20480716662613926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921642927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3696495,0.00034189166,0.62547535,0.0022061837,0.00021319439,0.000897612,0.00001269164,0.00022684515,0.0009767319],"genre_scores_gemma":[0.98347527,0.0003834101,0.0150213875,0.00047149404,0.000026152216,0.00039976905,0.00013274369,0.000035353874,0.00005444952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994302,0.000019118646,0.00019830675,0.00013603414,0.000061664294,0.00015472504],"domain_scores_gemma":[0.998841,0.000113207905,0.0000423862,0.0009182614,0.000045405406,0.000039767096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010714481,0.00011332962,0.00010979818,0.000067889974,0.00012901382,0.000051948668,0.0003139493,0.00005829595,0.000013222599],"category_scores_gemma":[0.0000020293153,0.00012866869,0.00003065624,0.00014284563,0.000047169928,0.00013028785,0.000038535487,0.00010446516,0.000023611698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009789761,0.000053874373,0.0009152469,0.000045826604,0.00007095086,5.2103513e-8,0.00046696226,0.9526666,0.027741162,0.0054188347,0.0073181703,0.005292524],"study_design_scores_gemma":[0.00039852152,0.000014469262,0.0009161937,0.000021616746,0.000017273805,0.0000014266155,0.000082155646,0.985879,0.0004715642,0.000015307014,0.011990975,0.00019146687],"about_ca_topic_score_codex":0.000006754459,"about_ca_topic_score_gemma":0.000012767155,"teacher_disagreement_score":0.61382574,"about_ca_system_score_codex":0.00006282295,"about_ca_system_score_gemma":0.0000061574747,"threshold_uncertainty_score":0.5246957},"labels":[],"label_agreement":null},{"id":"W2943083470","doi":"10.1109/lwc.2019.2932435","title":"On the Effect of Temporal Correlation on Joint Success Probability and Distribution of Number of Interferers in Mobile UAV Networks","year":2019,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and 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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Joint probability distribution; Computer science; Joint (building); Interference (communication); Real-time computing; Cellular network; Correlation; Distribution (mathematics); Telecommunications; Statistics; Mathematics; Engineering","score_opus":0.011759452428070603,"score_gpt":0.23901785390751848,"score_spread":0.22725840147944787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943083470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94441843,0.00008766426,0.05339438,0.00024200405,0.00013399853,0.0014473505,0.000098247605,0.00003189457,0.00014600593],"genre_scores_gemma":[0.99842066,0.00026401383,0.00029590278,0.000012915868,0.000008549192,0.00045247292,0.0005191543,0.000024627174,0.0000016924461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985944,0.00030171478,0.00064709183,0.00019641382,0.00014529694,0.000115079194],"domain_scores_gemma":[0.99711514,0.0007062165,0.0003774888,0.0017048334,0.00007610304,0.000020202198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165434,0.00020737354,0.00043076527,0.00009254958,0.000041432075,0.000015153576,0.00052738853,0.00019555946,0.0000055534206],"category_scores_gemma":[0.000027713219,0.00017496808,0.00009330031,0.00025237375,0.0002537667,0.0000530441,0.00017852422,0.0006180458,0.0000016532929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003976654,0.00007282518,0.032314226,0.00035957305,0.00004082819,2.9776345e-8,0.00016921881,0.9642137,0.0004740721,0.0011184191,0.00014342625,0.0010539057],"study_design_scores_gemma":[0.00038697605,0.00008765365,0.022859734,0.00085632096,0.00004944475,5.1584203e-7,0.000024486506,0.9722498,0.0031383603,0.00014121221,0.000014489024,0.00019102881],"about_ca_topic_score_codex":0.00020450368,"about_ca_topic_score_gemma":0.000043728796,"teacher_disagreement_score":0.054002218,"about_ca_system_score_codex":0.00015833673,"about_ca_system_score_gemma":0.000015276604,"threshold_uncertainty_score":0.7134991},"labels":[],"label_agreement":null},{"id":"W2944750697","doi":"10.1109/lwc.2019.2936854","title":"On Coverage Probability in Uplink NOMA With Instantaneous Signal Power-Based User Ranking","year":2019,"lang":"en","type":"preprint","venue":"IEEE Wireless 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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Noma; Ranking (information retrieval); Base station; Decoding methods; Computer science; SIGNAL (programming language); Interference (communication); Coverage probability; Signal-to-noise ratio (imaging); Power (physics); Signal-to-interference-plus-noise ratio; Algorithm; Statistics; Telecommunications; Mathematics; Artificial intelligence; Physics","score_opus":0.018457638246616694,"score_gpt":0.23603381370036425,"score_spread":0.21757617545374755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944750697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7470848,0.0005224982,0.2442012,0.0027144058,0.00025208402,0.0019234777,0.0001011666,0.001843945,0.0013564443],"genre_scores_gemma":[0.97620887,0.0006164447,0.02120097,0.0006161195,0.000011898688,0.0009000385,0.00023580014,0.00020099095,0.000008865632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970131,0.0003114283,0.0009177796,0.0007207164,0.00043882342,0.00059816084],"domain_scores_gemma":[0.9885228,0.0012653957,0.00036526975,0.009648266,0.0001238691,0.000074383905],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00035540515,0.00077248947,0.00086505903,0.00067620736,0.0002094667,0.00014942844,0.0048538256,0.0005740575,0.000022007358],"category_scores_gemma":[0.00004197606,0.00082143355,0.00017315423,0.0006252193,0.00059745804,0.00019610104,0.00095590897,0.0037149084,0.000057671212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008413448,0.00022660998,0.0010215513,0.00026314674,0.00008690718,0.000018536777,0.00024719202,0.9867952,0.0038218696,0.001990072,0.00012659145,0.005318192],"study_design_scores_gemma":[0.004428667,0.00028491273,0.001889214,0.005393448,0.000088541456,0.00003236694,0.00020549589,0.9589148,0.016099492,0.005963431,0.002633081,0.004066511],"about_ca_topic_score_codex":0.000060828956,"about_ca_topic_score_gemma":0.00026013,"teacher_disagreement_score":0.2291241,"about_ca_system_score_codex":0.0012563987,"about_ca_system_score_gemma":0.00017369937,"threshold_uncertainty_score":0.9994236},"labels":[],"label_agreement":null},{"id":"W2962765152","doi":"10.1109/lwc.2018.2851229","title":"Joint Tx Power Allocation and Rx Power Splitting for SWIPT System With Multiple Nonlinear Energy Harvesting Circuits","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":56,"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; National Research Foundation of Korea","keywords":"Maximum power transfer theorem; Nonlinear system; Electronic circuit; Wireless; Computer science; Energy harvesting; Wireless power transfer; Power (physics); Transmitter power output; Electronic engineering; Control theory (sociology); Telecommunications; Electrical engineering; Transmitter; Engineering; Physics; Channel (broadcasting)","score_opus":0.0179328199600312,"score_gpt":0.21385907956901354,"score_spread":0.19592625960898233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962765152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56101435,0.00033441963,0.43356788,0.0009863182,0.00046635309,0.00042320255,0.00002818458,0.0011963852,0.00198288],"genre_scores_gemma":[0.96511346,0.000033242257,0.03363711,0.00039908633,0.00024104965,0.00027470328,0.00007066796,0.00016374887,0.00006692656],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816835,0.0001224112,0.00057886785,0.00039442422,0.00021358018,0.0005223503],"domain_scores_gemma":[0.9971395,0.0006251669,0.00021127104,0.001618095,0.00026004843,0.0001459128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040582436,0.00035873635,0.00035819874,0.00017728392,0.00061393884,0.00018401413,0.00070857065,0.00015460807,0.000003560493],"category_scores_gemma":[0.00006953072,0.00037709027,0.00006673492,0.00036186105,0.00038745117,0.0003499315,0.00012517627,0.00031852917,0.000012074534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007758784,0.00031203864,0.0063607628,0.0011111675,0.001064728,0.000020016505,0.0050201477,0.35544685,0.5541853,0.018029828,0.0059706727,0.052400935],"study_design_scores_gemma":[0.0009070855,0.00008935204,0.001393352,0.0010882406,0.000054439122,0.00006224115,0.00033328024,0.97611445,0.009941658,0.0000046571195,0.0093023935,0.00070881925],"about_ca_topic_score_codex":0.00016908298,"about_ca_topic_score_gemma":0.0003553269,"teacher_disagreement_score":0.62066764,"about_ca_system_score_codex":0.00020134343,"about_ca_system_score_gemma":0.0000336092,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W2964050133","doi":"10.1109/lwc.2018.2803825","title":"Channel Diagonalization for Cloud Radio Access","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Baseband; Multi-user MIMO; Precoding; Channel (broadcasting); Singular value decomposition; Computer network; Topology (electrical circuits); Electronic engineering; Algorithm; Bandwidth (computing); Engineering; Electrical engineering","score_opus":0.03403531581985487,"score_gpt":0.2869369936422904,"score_spread":0.25290167782243556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964050133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011785327,0.00015974662,0.9841478,0.0012445403,0.0011097041,0.00058700435,0.000033205888,0.0005216264,0.00041107732],"genre_scores_gemma":[0.98835194,0.00023285678,0.009600877,0.0004805433,0.00054409663,0.00048802758,0.00017591364,0.00008379504,0.000041962525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915296,0.0000519349,0.00030556245,0.00016454943,0.00008585754,0.00023912973],"domain_scores_gemma":[0.9983544,0.00013743312,0.0000830131,0.0012224494,0.00014752809,0.000055209945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001323014,0.00016120642,0.00016858013,0.0001356669,0.0002930566,0.000079220525,0.0009937376,0.00007356078,0.0000064735013],"category_scores_gemma":[0.00002236644,0.00018979897,0.000055189794,0.00034434948,0.00016068271,0.0004646816,0.00006835585,0.00010445214,0.000031292842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028716617,0.0000987979,0.0003133281,0.0002492946,0.00019542618,6.7593675e-7,0.002503775,0.86474013,0.0508169,0.004640399,0.0671643,0.009248265],"study_design_scores_gemma":[0.0005315913,0.00001837367,0.00009645319,0.000086619264,0.00002817964,0.000005008569,0.00004424665,0.9720187,0.011538056,0.0002047726,0.0150581235,0.00036984205],"about_ca_topic_score_codex":0.000013986641,"about_ca_topic_score_gemma":0.00004636277,"teacher_disagreement_score":0.9765666,"about_ca_system_score_codex":0.00013762774,"about_ca_system_score_gemma":0.000012250397,"threshold_uncertainty_score":0.77397776},"labels":[],"label_agreement":null},{"id":"W2965986362","doi":"10.1109/lwc.2019.2932673","title":"Secrecy Outage Performance of Opportunistic Relay Selection With Limited CSI Feedback","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless 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 Waterloo","funders":"Hubei Key Laboratory of Intelligent Wireless Communications; China Scholarship Council; National Natural Science Foundation of China","keywords":"Secrecy; Relay; Computer science; Selection (genetic algorithm); Expression (computer science); Computer network; Signal-to-noise ratio (imaging); Outage probability; Topology (electrical circuits); Fading; Telecommunications; Mathematics; Computer security; Power (physics); Channel (broadcasting); Artificial intelligence; Physics","score_opus":0.03317512131693756,"score_gpt":0.24921568125484866,"score_spread":0.2160405599379111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965986362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948127,0.00011232089,0.09727668,0.0053271097,0.00014675285,0.00038854798,0.000003300465,0.00019875928,0.001733805],"genre_scores_gemma":[0.9795773,0.0009020303,0.018039117,0.001042527,0.000017912085,0.00005029927,0.000030181645,0.000022202874,0.00031842658],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984183,0.0003322846,0.00041588262,0.00030567037,0.00026665197,0.00026124675],"domain_scores_gemma":[0.9957186,0.00029708704,0.00030744547,0.0033125712,0.0002796543,0.00008462393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366117,0.0001989881,0.00027171834,0.00021175512,0.0003453688,0.00009979227,0.0029636344,0.000062280575,0.000025161362],"category_scores_gemma":[0.000012706768,0.00018795747,0.00006256921,0.0010763357,0.00019778096,0.00060974463,0.0004497747,0.00043243374,0.00008288306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019042262,0.0010803397,0.11735161,0.0002861081,0.00045628706,0.0000050354247,0.007131601,0.027567819,0.5376755,0.15213536,0.0029671108,0.1531528],"study_design_scores_gemma":[0.0010608642,0.00028456398,0.01695546,0.00038919656,0.000030296265,0.000038011745,0.00008765618,0.967079,0.00648365,0.000016030419,0.0069845915,0.00059069967],"about_ca_topic_score_codex":0.000014120323,"about_ca_topic_score_gemma":0.000046446406,"teacher_disagreement_score":0.9395112,"about_ca_system_score_codex":0.00009851827,"about_ca_system_score_gemma":0.000109722154,"threshold_uncertainty_score":0.76646835},"labels":[],"label_agreement":null},{"id":"W2967263386","doi":"10.1109/lwc.2019.2934453","title":"Delay Minimization for NOMA-Assisted MEC Under Power and Energy Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":66,"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 Science Foundation","keywords":"Noma; Time division multiple access; Computer science; Minification; Energy (signal processing); Constraint (computer-aided design); Reduction (mathematics); Mobile edge computing; Power (physics); Enhanced Data Rates for GSM Evolution; Computer network; Mathematical optimization; Telecommunications; Telecommunications link; Mathematics","score_opus":0.016525822727349825,"score_gpt":0.2384921826599543,"score_spread":0.2219663599326045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967263386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24620585,0.00091737544,0.74460006,0.0048023225,0.00028117516,0.00039790387,0.000056038807,0.0012108892,0.0015283943],"genre_scores_gemma":[0.95360744,0.00087747804,0.044300277,0.0006947182,0.0000083331815,0.00027538065,0.00010529752,0.00006876508,0.00006233703],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989304,0.00006660639,0.00037853722,0.00023420095,0.000114891576,0.00027539395],"domain_scores_gemma":[0.996929,0.00050433417,0.00011149285,0.002309707,0.00009030598,0.000055157543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009460951,0.00023155463,0.00026670608,0.0002104827,0.00019742774,0.000057981022,0.0010757298,0.00015612021,0.000020090787],"category_scores_gemma":[0.000018019513,0.00026424145,0.00006885409,0.00028039483,0.00045649355,0.00026737532,0.00017616797,0.00022860913,0.00001717029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042552278,0.00023211862,0.0017214953,0.00017554022,0.0005391604,0.0000017262211,0.0008342833,0.1256928,0.4849103,0.19147179,0.0054527316,0.1889255],"study_design_scores_gemma":[0.0064565665,0.00017503042,0.010907185,0.0005443899,0.00017217525,0.00014286894,0.0038535788,0.81831235,0.05718721,0.0044405875,0.09418285,0.0036251917],"about_ca_topic_score_codex":0.0000116634055,"about_ca_topic_score_gemma":0.000038294893,"teacher_disagreement_score":0.7074016,"about_ca_system_score_codex":0.00012263817,"about_ca_system_score_gemma":0.000018708384,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W2972917489","doi":"10.1109/lwc.2019.2940942","title":"Contract Design for Time Resource Assignment and Pricing in Backscatter-Assisted RF-Powered Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":49,"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; Ministry of Education - Singapore","keywords":"Computer science; Gateway (web page); Default gateway; Incentive; Profit (economics); Computer network; Transmitter; Backscatter (email); Telecommunications; Operations research; Wireless; Economics; Microeconomics; Engineering","score_opus":0.017180595625792012,"score_gpt":0.22417888773110095,"score_spread":0.20699829210530893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972917489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6851396,0.0010410247,0.30872166,0.0019579476,0.00032907305,0.0014254837,0.000010433502,0.0005410419,0.0008337045],"genre_scores_gemma":[0.98603785,0.00017713696,0.012476428,0.0007148904,0.000065421016,0.0002840541,0.00006212231,0.00010796402,0.00007414781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983174,0.00022155955,0.0005123542,0.00030811894,0.00014362102,0.00049693824],"domain_scores_gemma":[0.99650526,0.0018059175,0.00012398115,0.001438147,0.000032254797,0.00009445427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057547016,0.0002891432,0.00039540368,0.00016423708,0.00014357356,0.000107151565,0.00079015555,0.00017354744,0.000010438183],"category_scores_gemma":[0.000019003892,0.00033110255,0.00006616457,0.00030045075,0.00012188551,0.00018378251,0.000103637234,0.00048990693,0.000018813993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023471304,0.000052866068,0.0014669638,0.00004325037,0.000071461436,0.0000019867778,0.00021127253,0.92169785,0.06464897,0.00007824869,0.002677594,0.009026088],"study_design_scores_gemma":[0.0010158735,0.000030700012,0.004674441,0.00037655095,0.000025606558,0.000009175917,0.000028099545,0.9897716,0.0009544317,0.000007781159,0.002692867,0.00041284415],"about_ca_topic_score_codex":0.000029323257,"about_ca_topic_score_gemma":0.00003062354,"teacher_disagreement_score":0.30089822,"about_ca_system_score_codex":0.00023255024,"about_ca_system_score_gemma":0.000015332298,"threshold_uncertainty_score":0.9999141},"labels":[],"label_agreement":null},{"id":"W2978812740","doi":"10.1109/lwc.2019.2921769","title":"Novel Theoretical Performance Comparisons of Open-Loop and Closed-Loop Timing Recovery in Rayleigh Fading Channels With and Without a Receiver Outage Condition","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Loop (graph theory); Control theory (sociology); Open-loop controller; Electronic engineering; Outage probability; Closed loop; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Control engineering","score_opus":0.022594945349426694,"score_gpt":0.26109245279906795,"score_spread":0.23849750744964127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978812740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91171277,0.00009865491,0.08660051,0.00022530642,0.00008451881,0.000625431,0.000016998581,0.000057363828,0.0005784267],"genre_scores_gemma":[0.98266613,0.00033478637,0.016724035,0.000084801,0.0000094706775,0.00007751732,0.000036553465,0.000043400993,0.000023308969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.00006928467,0.0003394493,0.00020381967,0.00009281809,0.0001943243],"domain_scores_gemma":[0.9989302,0.0001790089,0.00011918666,0.000680747,0.000044901844,0.000045931163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022454902,0.00017511968,0.00034468612,0.00017942299,0.0000954174,0.00006584281,0.0004169656,0.000072434064,0.0000062578115],"category_scores_gemma":[0.000008955891,0.00017911699,0.000015358823,0.00023961002,0.0002773018,0.0006702567,0.00013374824,0.0002672737,0.0000034782784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116048155,0.00010572247,0.045154046,0.0003901892,0.00010390974,8.16056e-7,0.0021296246,0.7310948,0.21492521,0.0036197468,0.00007951037,0.0022803624],"study_design_scores_gemma":[0.0023567944,0.00007470149,0.0046100803,0.0012002471,0.00003577899,0.00003346149,0.0004625652,0.98211604,0.008592658,0.000020603144,0.000064300024,0.00043276072],"about_ca_topic_score_codex":0.000040852745,"about_ca_topic_score_gemma":0.000032542397,"teacher_disagreement_score":0.25102124,"about_ca_system_score_codex":0.000075942684,"about_ca_system_score_gemma":0.0000126150135,"threshold_uncertainty_score":0.7304179},"labels":[],"label_agreement":null},{"id":"W2979343006","doi":"10.1109/lwc.2020.2981066","title":"Counterexamples on the monotonicity of delay optimal strategies for energy harvesting transmitters","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Markov decision process; Queue; Monotonic function; Monotone polygon; Energy (signal processing); Bellman equation; Function (biology); Computer science; Markov process; State (computer science); Energy harvesting; Mathematical optimization; Queueing theory; Transmission (telecommunications); Battery (electricity); Sample (material); Control theory (sociology); Telecommunications; Mathematics; Computer network; Algorithm; Discrete mathematics","score_opus":0.05232629945539267,"score_gpt":0.2559595585693874,"score_spread":0.20363325911399474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979343006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39142448,0.0005648202,0.59728986,0.007557956,0.00065960706,0.00066974753,0.00032226945,0.00070804986,0.000803188],"genre_scores_gemma":[0.97641087,0.00067515264,0.019875228,0.0013843734,0.00019407895,0.0010033635,0.00025984706,0.00018872673,0.000008352617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755394,0.00029205825,0.00089500676,0.00047222656,0.0003091436,0.00047760757],"domain_scores_gemma":[0.99404484,0.002481338,0.00037645843,0.0028673753,0.00012995522,0.00010003021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003612449,0.0006031036,0.00068448845,0.00014336733,0.00031903444,0.00024841962,0.0034799508,0.00032349335,0.0000040786804],"category_scores_gemma":[0.00003900552,0.00056968245,0.00035836105,0.00024351043,0.0005791693,0.000158119,0.00035683997,0.001349956,0.0000020852656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021162205,0.000039570925,0.000019657966,0.00031078118,0.00035202046,0.0000017865838,0.0008449916,0.95868945,0.015811287,0.018544212,0.0029807705,0.0023843078],"study_design_scores_gemma":[0.00029695925,0.000038057027,0.00007029562,0.0010227218,0.0001325531,0.0000037451214,0.0002899954,0.9851435,0.0068255737,0.0005147853,0.0049913283,0.0006705262],"about_ca_topic_score_codex":0.00048465747,"about_ca_topic_score_gemma":0.00033598143,"teacher_disagreement_score":0.5849864,"about_ca_system_score_codex":0.0001955757,"about_ca_system_score_gemma":0.00013972285,"threshold_uncertainty_score":0.99967545},"labels":[],"label_agreement":null},{"id":"W2980029642","doi":"10.1109/lwc.2019.2946144","title":"Design of Energy Efficient Hybrid VLC/RF/PLC Communication System for Indoor Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Visible light communication; Backhaul (telecommunications); Radio frequency; Benchmark (surveying); Power-line communication; Efficient energy use; Electronic engineering; Computer network; Wireless; Power (physics); Telecommunications; Electrical engineering; Engineering","score_opus":0.01632363490880718,"score_gpt":0.21816494601982495,"score_spread":0.20184131111101777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980029642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18984199,0.002826067,0.80238664,0.0013892279,0.0003305142,0.0011103443,0.000037876736,0.001420429,0.0006569242],"genre_scores_gemma":[0.966692,0.0014982363,0.03068996,0.00012816621,0.000017019494,0.00072335755,0.00013280883,0.00010302136,0.000015470385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789953,0.0002827554,0.00086796645,0.00026830207,0.00024242014,0.0004389959],"domain_scores_gemma":[0.9915004,0.0017319234,0.00029248834,0.006181846,0.00021812889,0.00007520993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005465446,0.00033209048,0.000550703,0.00030621458,0.00025640323,0.00006556232,0.0039253547,0.00019309486,0.0000058818464],"category_scores_gemma":[0.000032281572,0.00036759177,0.00016116299,0.00052499236,0.00042465705,0.00016189399,0.00044052047,0.0004806588,0.000030935473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031860716,0.00013281679,0.0001166807,0.00018321503,0.00016683048,3.1727126e-7,0.00013283051,0.9139412,0.05513496,0.019581053,0.0012659259,0.009312293],"study_design_scores_gemma":[0.0006411826,0.00003672922,0.000059917922,0.00027265408,0.000036966456,0.0000061990404,0.00023906001,0.9502261,0.046733614,0.000047268426,0.0013237344,0.0003765467],"about_ca_topic_score_codex":0.000033088498,"about_ca_topic_score_gemma":0.000006961302,"teacher_disagreement_score":0.77685,"about_ca_system_score_codex":0.00030651642,"about_ca_system_score_gemma":0.00003143695,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W2980136036","doi":"10.1109/lwc.2019.2921314","title":"Design Criteria for Omnidirectional STBC in Massive MIMO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Space–time block code; Upper and lower bounds; Telecommunications link; Block code; Computer science; Metric (unit); Rank (graph theory); Omnidirectional antenna; Algorithm; Mathematics; Theoretical computer science; Control theory (sociology); Telecommunications; Decoding methods; Antenna (radio); Combinatorics; Beamforming; Artificial intelligence","score_opus":0.03779133799062512,"score_gpt":0.2904647976278763,"score_spread":0.2526734596372512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980136036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1205331,0.0011853669,0.8701369,0.0023038099,0.0008694023,0.0024989552,0.00006111861,0.0013571957,0.0010541606],"genre_scores_gemma":[0.9284423,0.00065409765,0.06851783,0.0002182443,0.00004015062,0.0018863357,0.00008112188,0.00009345622,0.000066449495],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844915,0.00026332328,0.00053836097,0.00024356025,0.00016132274,0.00034427067],"domain_scores_gemma":[0.9964177,0.0008605021,0.00011587318,0.0024369878,0.000109929664,0.00005903494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003820136,0.00025254634,0.00034620299,0.00033462193,0.00014143497,0.00007708546,0.001528205,0.00013006308,0.000014755587],"category_scores_gemma":[0.000018178223,0.00030385994,0.000080643345,0.00039236213,0.000119235025,0.0003800706,0.00011196034,0.00039164562,0.00006174069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042551816,0.0001435274,0.0006496307,0.00023599649,0.00010306715,0.0000013558622,0.0007067966,0.41284496,0.5628521,0.0065139513,0.010949211,0.004956846],"study_design_scores_gemma":[0.0009396313,0.000041189083,0.00044604714,0.00033918553,0.00001718821,0.000009232885,0.00027856944,0.94899625,0.03072049,0.00034487285,0.017160276,0.0007070742],"about_ca_topic_score_codex":0.00004488497,"about_ca_topic_score_gemma":0.000021401445,"teacher_disagreement_score":0.80790925,"about_ca_system_score_codex":0.00036624167,"about_ca_system_score_gemma":0.000029766288,"threshold_uncertainty_score":0.99994135},"labels":[],"label_agreement":null},{"id":"W2983908431","doi":"10.1109/lwc.2019.2953165","title":"Quasi-Optimization of Distance and Blocklength in URLLC Aided Multi-Hop UAV Relay Links","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":68,"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; Network packet; Relay; Optimization problem; Decoding methods; Wireless; Low latency (capital markets); Reliability (semiconductor); Bit error rate; Algorithm; Mathematical optimization; Computer network; Telecommunications; Mathematics","score_opus":0.010855370886008481,"score_gpt":0.22267698633813227,"score_spread":0.21182161545212377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983908431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5405017,0.00042969603,0.4570822,0.0010267259,0.000085445565,0.0004462301,0.00001828289,0.00013569518,0.0002739801],"genre_scores_gemma":[0.9368426,0.0014594386,0.06133208,0.000121473415,0.000009571268,0.000093566596,0.00007192904,0.000037981576,0.000031337036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990902,0.00006136071,0.00040781297,0.00017565924,0.00010126823,0.00016372323],"domain_scores_gemma":[0.9984979,0.00014070694,0.00009938242,0.0011639863,0.00005771825,0.0000402813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014232914,0.00014559511,0.00021189942,0.00017417753,0.00006866286,0.000025631685,0.0004265577,0.00013643183,0.000010682212],"category_scores_gemma":[0.000009728903,0.00016818136,0.000033696382,0.00044028446,0.000104636136,0.00019544733,0.000054972166,0.00033391177,0.000011892388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048913516,0.00012390042,0.0055027413,0.000057240202,0.00001792215,1.7050945e-7,0.0007168776,0.9830981,0.007936933,0.00074523955,0.000095988384,0.0017000196],"study_design_scores_gemma":[0.00057835935,0.000012054578,0.0015609108,0.00008220394,0.000011405864,0.0000012473834,0.000121040495,0.9960804,0.0007110848,0.0000056897356,0.0006533996,0.00018219782],"about_ca_topic_score_codex":0.000059126945,"about_ca_topic_score_gemma":0.00016790844,"teacher_disagreement_score":0.39634088,"about_ca_system_score_codex":0.00007528944,"about_ca_system_score_gemma":0.000011652242,"threshold_uncertainty_score":0.6858237},"labels":[],"label_agreement":null},{"id":"W2986108879","doi":"10.1109/lwc.2019.2952862","title":"Antenna Array Gain and Capacity Improvements of Ultra-Wideband Millimeter Wave Systems Using a Novel Analog Architecture Design","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","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":"École de Technologie Supérieure","funders":"","keywords":"Array gain; Computer science; Wideband; Electronic engineering; Antenna gain; Antenna array; USable; Communications system; Bandwidth (computing); Antenna (radio); Telecommunications; Dipole antenna; Engineering; Antenna aperture","score_opus":0.05843747620982403,"score_gpt":0.2340069502266804,"score_spread":0.17556947401685635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986108879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4340225,0.0002158478,0.5651544,0.00009563971,0.00010442544,0.00027829566,0.000033749988,0.000043749365,0.0000513903],"genre_scores_gemma":[0.95723504,0.00015177076,0.042179447,0.00031959752,0.000018629422,0.000023836885,0.000019200108,0.000043275784,0.000009205401],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880505,0.00013579694,0.00043322978,0.00021262786,0.00016518826,0.00024809522],"domain_scores_gemma":[0.9984757,0.00018790139,0.00012283267,0.0010492286,0.00009109842,0.00007328119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027504208,0.00021243942,0.0003101307,0.000186521,0.000103791375,0.000050716324,0.00031055106,0.00008592977,0.0000042918537],"category_scores_gemma":[0.000011629383,0.00021394511,0.00006948497,0.0001930044,0.0001148428,0.00011829684,0.000034974106,0.00029148502,0.0000038221474],"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.0000060093425,0.000026056416,0.00014999406,0.00014561214,0.00010380202,3.2475143e-7,0.0006241369,0.081362024,0.91718787,0.000013112387,0.000016106045,0.0003649294],"study_design_scores_gemma":[0.0005775955,0.000020951804,0.00005031525,0.00022668157,0.000052761014,0.000028498152,0.00011707373,0.58611375,0.41244072,0.000027736382,0.000050091065,0.00029381306],"about_ca_topic_score_codex":0.00010841131,"about_ca_topic_score_gemma":0.000012760635,"teacher_disagreement_score":0.52321255,"about_ca_system_score_codex":0.00007203769,"about_ca_system_score_gemma":0.000017494158,"threshold_uncertainty_score":0.87244284},"labels":[],"label_agreement":null},{"id":"W2991301449","doi":"10.1109/lwc.2020.2970696","title":"Joint User Association and Resource Allocation in the Uplink of Heterogeneous Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":63,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Resource allocation; Joint (building); Resource management (computing); Computer network; Association (psychology); Heterogeneous network; Telecommunications; Wireless network; Wireless; Engineering","score_opus":0.019894312131319935,"score_gpt":0.21876835846000767,"score_spread":0.19887404632868774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991301449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33904073,0.00082964834,0.64270973,0.016365249,0.00008377863,0.0005860903,0.0000059566487,0.00017115008,0.0002076316],"genre_scores_gemma":[0.9961234,0.00033014893,0.0023806903,0.0010134217,0.00003660485,0.0000577323,0.000032435226,0.000023013776,0.0000025802751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920464,0.0001567704,0.00032608863,0.00009890507,0.00009280669,0.00012079656],"domain_scores_gemma":[0.9990721,0.00019192768,0.00011973427,0.0005580872,0.000032352975,0.000025844338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022814794,0.000094198505,0.00014413489,0.00004889532,0.00006364979,0.00002412987,0.00035689108,0.00006644743,8.655771e-7],"category_scores_gemma":[0.000029059032,0.00009250442,0.000027450473,0.00028209478,0.00003943382,0.00010816519,0.0000399084,0.0002215635,0.0000021548042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024146607,0.00001050559,0.00090735615,0.00002548445,0.000018843839,3.433202e-7,0.001704026,0.98331934,0.011988866,0.00011490682,0.00072092615,0.001186994],"study_design_scores_gemma":[0.0002355296,0.000009137449,0.0007673377,0.00004298486,0.000014603489,0.000002440006,0.00018230542,0.99626195,0.0012274538,0.000005132157,0.0011345838,0.00011654988],"about_ca_topic_score_codex":0.000017253504,"about_ca_topic_score_gemma":0.000033349726,"teacher_disagreement_score":0.6570826,"about_ca_system_score_codex":0.00009119294,"about_ca_system_score_gemma":0.000004092215,"threshold_uncertainty_score":0.3772221},"labels":[],"label_agreement":null},{"id":"W2993963137","doi":"10.1109/lwc.2019.2956702","title":"Joint Placement Design, Admission Control, and Power Allocation for NOMA-Based UAV Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematical optimization; Computer science; Convexity; Noma; Quality of service; Admission control; Optimization problem; Power (physics); Power control; Joint (building); Computational complexity theory; Convex optimization; Regular polygon; Computer network; Mathematics; Algorithm; Telecommunications link; Engineering","score_opus":0.018612308029426632,"score_gpt":0.2219544249569995,"score_spread":0.20334211692757287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993963137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09336034,0.0003629094,0.9015471,0.0025026773,0.00018512404,0.0016703294,0.000024421903,0.00020774097,0.00013939873],"genre_scores_gemma":[0.97642374,0.000093325536,0.021959852,0.00043850005,0.000019549418,0.0008852923,0.00010570835,0.000044120054,0.000029932567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991466,0.000071263625,0.00031625328,0.00017702862,0.00011050323,0.00017834423],"domain_scores_gemma":[0.9985058,0.0002187973,0.000085987675,0.0010283417,0.00009042277,0.00007068205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560116,0.00015647618,0.00018366947,0.00011901206,0.00016806241,0.00008344482,0.00029656853,0.000075102405,0.000008065618],"category_scores_gemma":[0.000007304425,0.00016399148,0.000041284162,0.00013827413,0.000044610377,0.00013280888,0.00002029189,0.00010724676,0.000025814743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001914305,0.00004708573,0.0001318645,0.00007764964,0.00003962157,6.0388054e-8,0.00011171644,0.8319958,0.16331543,0.00094051246,0.0027681293,0.00055303046],"study_design_scores_gemma":[0.0010867246,0.00003604808,0.0003228163,0.000071964845,0.000028701792,0.0000012940217,0.00006343838,0.9909099,0.0027899446,0.0000064529395,0.004478243,0.00020449095],"about_ca_topic_score_codex":0.000015754822,"about_ca_topic_score_gemma":0.0000032140824,"teacher_disagreement_score":0.8830634,"about_ca_system_score_codex":0.00012316332,"about_ca_system_score_gemma":0.000025197673,"threshold_uncertainty_score":0.6687378},"labels":[],"label_agreement":null},{"id":"W2998916130","doi":"10.1109/lwc.2020.2966624","title":"Nested Construction of Polar Codes for Blind Detection","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Control channel; Telecommunications link; Latency (audio); Polar; Scheme (mathematics); Coding (social sciences); Channel code; Real-time computing; Computer network; Algorithm; Telecommunications; Mathematics","score_opus":0.04607982118845658,"score_gpt":0.28753787770252914,"score_spread":0.24145805651407257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998916130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20363396,0.00004105628,0.7822721,0.01302562,0.00017096051,0.00033877866,0.000008005173,0.00046152933,0.000048000686],"genre_scores_gemma":[0.76878995,0.000024041547,0.23012087,0.0009397554,0.00003014308,0.0000749643,0.0000065774425,0.000012400782,0.0000012712809],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895495,0.0001621785,0.00034014753,0.00024211819,0.00014441436,0.00015616447],"domain_scores_gemma":[0.9977717,0.00034721795,0.00027360534,0.0013672679,0.00018081421,0.000059429487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021656128,0.00012155267,0.0001920915,0.00013016896,0.0002272983,0.000057072302,0.0018009741,0.00006766038,6.66015e-7],"category_scores_gemma":[0.000082159284,0.00013922341,0.00009250393,0.0005924332,0.00019618354,0.0003495229,0.00019491058,0.0002071231,0.000003887122],"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.000033296827,0.000058496338,0.00088592904,0.000055015058,0.000039910476,4.1553417e-7,0.0016839637,0.00014718651,0.92830044,0.007904739,0.0005365842,0.06035405],"study_design_scores_gemma":[0.00081992935,0.00019306185,0.00052226684,0.00007385565,0.000034928264,0.000028146256,0.00021972545,0.3542148,0.6398434,0.0006856299,0.0029625876,0.00040164622],"about_ca_topic_score_codex":0.00007974241,"about_ca_topic_score_gemma":0.00005304515,"teacher_disagreement_score":0.565156,"about_ca_system_score_codex":0.00004678695,"about_ca_system_score_gemma":0.00003802238,"threshold_uncertainty_score":0.5677366},"labels":[],"label_agreement":null},{"id":"W3000235881","doi":"10.1109/lwc.2020.2965515","title":"Mobility-Assisted Over-the-Air Computation for Backscatter Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Precoding; Computer science; Channel (broadcasting); Benchmark (surveying); Wireless sensor network; Superposition principle; Key (lock); Wireless; Computation; Overhead (engineering); Real-time computing; Backscatter (email); Electronic engineering; Telecommunications; Computer network; Algorithm; MIMO; Engineering","score_opus":0.02410386285009042,"score_gpt":0.24502294144188064,"score_spread":0.22091907859179022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000235881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09659404,0.000107355154,0.8779743,0.023875767,0.00012222974,0.0007578576,0.00003372101,0.00039151334,0.00014323836],"genre_scores_gemma":[0.9697476,0.00009195519,0.023912534,0.0052696294,0.00013182675,0.0005105444,0.0002761363,0.00005300274,0.0000067696606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991146,0.00006937711,0.00033182555,0.00018547199,0.00009769709,0.00020105955],"domain_scores_gemma":[0.9985559,0.00032619855,0.000073955984,0.00089530065,0.000077573015,0.00007109402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113493035,0.00016099631,0.00015982261,0.00004083577,0.0003362267,0.00006468276,0.0006258172,0.000072604016,0.00000795594],"category_scores_gemma":[0.000008075376,0.00015542263,0.00009376082,0.00039449587,0.00012567389,0.00012624759,0.000052839892,0.00022678838,0.000023011633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069379466,0.00003761158,0.00018487919,0.000035331585,0.000051811443,1.0643002e-7,0.00033928602,0.9649985,0.006870108,0.00022729227,0.020278005,0.0069701504],"study_design_scores_gemma":[0.00031216338,0.000009489827,0.0035570061,0.000011384161,0.00003398034,0.000001414586,0.000060308987,0.98595303,0.00025410237,0.000011625615,0.009614451,0.00018104407],"about_ca_topic_score_codex":0.000014981133,"about_ca_topic_score_gemma":0.000021240312,"teacher_disagreement_score":0.87315357,"about_ca_system_score_codex":0.00007114383,"about_ca_system_score_gemma":0.00000923324,"threshold_uncertainty_score":0.6337951},"labels":[],"label_agreement":null},{"id":"W3003713006","doi":"10.1109/lwc.2020.2994930","title":"Reconfigurable Intelligent Surface-Assisted Space Shift Keying","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless 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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Transmission (telecommunications); Keying; Modulation (music); Computer science; Scheme (mathematics); Detector; Electronic engineering; Space (punctuation); Energy (signal processing); Bit error rate; Surface (topology); Molecular communication; Telecommunications; Algorithm; Mathematics; Physics; Engineering; Acoustics; Statistics","score_opus":0.060090197822960795,"score_gpt":0.27771505798411755,"score_spread":0.21762486016115676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003713006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23652382,0.012673555,0.6194397,0.10110259,0.0027161005,0.0027460207,0.0003982688,0.016370038,0.0080299],"genre_scores_gemma":[0.9276443,0.013602165,0.05698879,0.00056379766,0.000059353693,0.00042710936,0.00041588943,0.00026159507,0.0000369661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967623,0.0003187203,0.0011385196,0.00072675134,0.0003832232,0.0006705096],"domain_scores_gemma":[0.9890221,0.00063341844,0.00044720553,0.009575705,0.00012671389,0.00019488127],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00028881407,0.0008370603,0.00096343167,0.0003323577,0.00045095326,0.00028267252,0.0074992245,0.000636741,0.000040704348],"category_scores_gemma":[0.00008265209,0.0010392797,0.00033300044,0.0007282745,0.0006250604,0.0002684574,0.0019928715,0.003948079,0.00030275347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017152477,0.00014816583,0.00021510689,0.00073702366,0.0006542384,0.000014379141,0.0025266805,0.7931651,0.14440887,0.004013669,0.012338384,0.04176123],"study_design_scores_gemma":[0.0011035624,0.00005704543,0.0013855024,0.0029875757,0.00030169616,0.00003364106,0.0018610237,0.6514959,0.24108747,0.008304432,0.08573746,0.0056447457],"about_ca_topic_score_codex":0.00016746826,"about_ca_topic_score_gemma":0.0001608065,"teacher_disagreement_score":0.6911205,"about_ca_system_score_codex":0.00073435716,"about_ca_system_score_gemma":0.00009607231,"threshold_uncertainty_score":0.99920577},"labels":[],"label_agreement":null},{"id":"W3008952064","doi":"10.1109/lwc.2020.2987992","title":"NOMA Design With Power-Outage Tradeoff for Two-User Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Power (physics); Noma; Computer network; Telecommunications link","score_opus":0.041196612044803106,"score_gpt":0.24831475535920622,"score_spread":0.20711814331440312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008952064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028502714,0.0010547308,0.95413095,0.012064692,0.00012381171,0.001223521,0.00005647249,0.002571684,0.00027140652],"genre_scores_gemma":[0.90607405,0.0002669991,0.09155358,0.00080896955,0.000032944452,0.0010743795,0.000041882762,0.00013504877,0.000012157672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984995,0.00013061544,0.0004692305,0.00029686262,0.00019149751,0.00041226437],"domain_scores_gemma":[0.99600536,0.0006314729,0.00014033077,0.0030152518,0.000086056854,0.00012154391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015072436,0.00034192568,0.0003998821,0.00013900136,0.0003164862,0.00011063656,0.0027816172,0.00011474158,0.000004117705],"category_scores_gemma":[0.00003293927,0.00034555572,0.00008770227,0.0005262031,0.00035134607,0.00035718305,0.0001559338,0.00052434945,0.000039976585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004793912,0.00005799352,0.00010164851,0.00012718496,0.00018965019,0.0000036039082,0.0011272228,0.8569504,0.124854356,0.007121694,0.006208248,0.0032100747],"study_design_scores_gemma":[0.0028173083,0.00024221666,0.00011436018,0.0002584746,0.00008362179,0.000030596748,0.0021042642,0.88577944,0.04854167,0.00008154773,0.058434907,0.0015115915],"about_ca_topic_score_codex":0.0000100403995,"about_ca_topic_score_gemma":0.000008836385,"teacher_disagreement_score":0.87757134,"about_ca_system_score_codex":0.00013406354,"about_ca_system_score_gemma":0.000027183372,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W3013701988","doi":"10.1109/lwc.2020.2982641","title":"VLI: Variable-Length Identifier for Interconnecting Heterogeneous IoT Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Software-Defined Networks and 5G","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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China","keywords":"Identifier; Header; Computer science; IPv6; Computer network; Network packet; Unique identifier; Address space; Distributed computing; The Internet; Operating system","score_opus":0.043887721945573555,"score_gpt":0.25916846029934215,"score_spread":0.2152807383537686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013701988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021336347,0.00044207356,0.9503976,0.026157772,0.0006670155,0.00040637198,0.000006945601,0.00051228807,0.000073561474],"genre_scores_gemma":[0.87373704,0.00008829956,0.10340562,0.022166455,0.00032039874,0.00019888052,0.000025487214,0.00004344635,0.000014357208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981264,0.00020320494,0.000483781,0.0005238391,0.00017630243,0.0004864554],"domain_scores_gemma":[0.9960775,0.0010970602,0.00021652199,0.0023052907,0.00012349775,0.00018015526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003325051,0.00024682257,0.00030074638,0.00007838643,0.0005877672,0.00038990463,0.0039226967,0.00011023894,0.00000761352],"category_scores_gemma":[0.00007991798,0.00026602813,0.00016610784,0.00066206936,0.000112227346,0.00029148947,0.00067981787,0.00042486197,0.000026932592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011276749,0.00049337215,0.0020690789,0.00019860979,0.00084890565,0.00003420487,0.0075655864,0.5136064,0.022726707,0.07121237,0.10834788,0.27278408],"study_design_scores_gemma":[0.00047386737,0.00004980173,0.000032169806,0.000064430096,0.000027664999,0.000017827722,0.000039465624,0.977083,0.00054636115,0.00026492638,0.021028457,0.0003720273],"about_ca_topic_score_codex":0.000038316328,"about_ca_topic_score_gemma":0.000018302868,"teacher_disagreement_score":0.8524007,"about_ca_system_score_codex":0.00006253659,"about_ca_system_score_gemma":0.00003819681,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W3016171125","doi":"10.1109/lwc.2020.2986750","title":"Multiuser Scheduling for Asymmetric FSO/RF Links in Satellite-UAV-Terrestrial Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":104,"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; Channel state information; Scheduling (production processes); Rayleigh fading; Fading; Beamforming; Computer network; Electronic engineering; Channel (broadcasting); Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.061334721162200526,"score_gpt":0.275365620096991,"score_spread":0.2140308989347905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016171125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54061806,0.03417381,0.37566066,0.036948036,0.0029592193,0.004812473,0.00008169272,0.002830076,0.0019159594],"genre_scores_gemma":[0.97608435,0.0048314994,0.01622603,0.0017434304,0.0003657487,0.00045742796,0.00015803325,0.00012788137,0.000005603601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977348,0.00027363485,0.00096079276,0.00032734676,0.00020888977,0.00049452676],"domain_scores_gemma":[0.99574476,0.0013667435,0.00016064856,0.0024778538,0.00006864752,0.0001813551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048852054,0.00033127077,0.00047516328,0.00034232697,0.0001955269,0.00014919986,0.0024556136,0.00033910316,0.0000040633204],"category_scores_gemma":[0.00010182226,0.00039684988,0.00017892748,0.0014344467,0.00013660373,0.00028246807,0.00020621462,0.0011906363,0.000070912094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012749941,0.00019731655,0.009960564,0.00028428287,0.00029914427,0.00000625665,0.0047389916,0.7872585,0.040573925,0.0006379244,0.0023174318,0.15359813],"study_design_scores_gemma":[0.0015563641,0.00002038817,0.001044328,0.00014543194,0.00002631877,0.0000027712967,0.00023742978,0.9326265,0.0011294768,0.000008673074,0.06267853,0.0005237888],"about_ca_topic_score_codex":0.00006715437,"about_ca_topic_score_gemma":0.00009713494,"teacher_disagreement_score":0.4354663,"about_ca_system_score_codex":0.00020854537,"about_ca_system_score_gemma":0.000028750495,"threshold_uncertainty_score":0.99984837},"labels":[],"label_agreement":null},{"id":"W3020160405","doi":"10.1109/lwc.2020.2990337","title":"Secrecy Outage Performance of Ground-to-Air Communications With Multiple Aerial Eavesdroppers and Its Deep Learning Evaluation","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","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":"Qatar University","keywords":"Secrecy; Computer science; Beamforming; Fading; Base station; Transmission (telecommunications); Channel (broadcasting); Computation; Wireless; Stochastic geometry; Data transmission; Computer network; Real-time computing; Telecommunications; Computer security; Algorithm; Statistics","score_opus":0.025969938333197076,"score_gpt":0.23598701298180033,"score_spread":0.21001707464860325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020160405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94121236,0.0003131706,0.053568564,0.0035830417,0.000038240247,0.0007245509,0.000015418162,0.00021606452,0.00032862183],"genre_scores_gemma":[0.9821062,0.0007552257,0.016155774,0.00036663032,0.00003404339,0.00034482163,0.00018187636,0.000051709892,0.0000037124307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887115,0.00014847482,0.0003609486,0.00020005889,0.0002282239,0.00019115602],"domain_scores_gemma":[0.99820703,0.000164606,0.00011527165,0.0011630454,0.00022419996,0.00012581637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002189417,0.00018599753,0.00022064241,0.00012361891,0.00036737844,0.00004168203,0.000850406,0.00006559967,0.000008641586],"category_scores_gemma":[0.000033874374,0.00020136771,0.000031891846,0.0006911043,0.00014731323,0.00029619248,0.0001625288,0.0003202469,0.000019960251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048102822,0.000069112735,0.007212241,0.000121099525,0.00011143395,1.6332389e-7,0.0066404343,0.85592467,0.11181052,0.00061386416,0.00006227497,0.017386116],"study_design_scores_gemma":[0.00057045167,0.000058775768,0.0046212142,0.00004924023,0.00006317597,0.000002524832,0.00032163892,0.99081445,0.002388847,0.0000021738056,0.00087539887,0.00023212685],"about_ca_topic_score_codex":0.00004885735,"about_ca_topic_score_gemma":0.00011856358,"teacher_disagreement_score":0.1348898,"about_ca_system_score_codex":0.000085456944,"about_ca_system_score_gemma":0.000027523147,"threshold_uncertainty_score":0.8211537},"labels":[],"label_agreement":null},{"id":"W3033035734","doi":"10.1109/lwc.2020.2999333","title":"Dynamic Spectrum Anti-Jamming in Broadband Communications: A Hierarchical Deep Reinforcement Learning Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Jamming; Computer science; Reinforcement learning; Frequency band; Frequency-hopping spread spectrum; Selection (genetic algorithm); Broadband; Convergence (economics); Throughput; Q-learning; Telecommunications; Algorithm; Artificial intelligence; Wireless; Bandwidth (computing)","score_opus":0.02210946267116902,"score_gpt":0.2529385481066058,"score_spread":0.2308290854354368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033035734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40748176,0.0040565967,0.5234096,0.051226657,0.00013925506,0.0020202245,0.0000126803725,0.0041008885,0.007552313],"genre_scores_gemma":[0.9583962,0.006376524,0.03306186,0.0012903312,0.00002505518,0.00044738667,0.000274957,0.00011972855,0.00000796666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970735,0.00059868145,0.0009980982,0.00039029174,0.0003639417,0.0005755167],"domain_scores_gemma":[0.99458593,0.0004280598,0.00018612384,0.004537909,0.00005597314,0.00020597802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047061176,0.00041949432,0.0005566436,0.00041051244,0.00046359855,0.00016516096,0.004987845,0.00019515157,0.000014167767],"category_scores_gemma":[0.000061050465,0.00052254775,0.00015345156,0.0011854902,0.0005702844,0.0004595014,0.0010362153,0.00228197,0.000054568027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041654817,0.00048749617,0.0031481406,0.00044721508,0.00028885668,0.000013655067,0.023353973,0.8660957,0.07644543,0.007483014,0.0010593216,0.021135498],"study_design_scores_gemma":[0.00055455556,0.000031014817,0.00067109184,0.00012224056,0.000022244665,0.000014105363,0.00052370044,0.9899987,0.0009449861,0.00006587758,0.0064963414,0.0005551401],"about_ca_topic_score_codex":0.00009984571,"about_ca_topic_score_gemma":0.00015433025,"teacher_disagreement_score":0.5509144,"about_ca_system_score_codex":0.00038270807,"about_ca_system_score_gemma":0.000039485873,"threshold_uncertainty_score":0.9997226},"labels":[],"label_agreement":null},{"id":"W3034324601","doi":"10.1109/lwc.2020.3003221","title":"Interference and Coverage Analysis in Coexisting RF and Dense TeraHertz Wireless Networks","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless 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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terahertz radiation; Interference (communication); Stochastic geometry; Computer science; SIGNAL (programming language); Telecommunications link; Coverage probability; Wireless; Wireless network; Radio frequency; Electronic engineering; Physics; Algorithm; Mathematics; Telecommunications; Statistics; Optoelectronics; Engineering","score_opus":0.04232890803716572,"score_gpt":0.26095707859450346,"score_spread":0.21862817055733774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034324601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55132836,0.0009399469,0.44591847,0.0012285718,0.00011024659,0.00021452658,0.000023989867,0.00014546364,0.00009044854],"genre_scores_gemma":[0.9905602,0.0053257644,0.0029474497,0.0007642565,0.000048647355,0.000110698566,0.00017721886,0.000059893468,0.0000058865535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826694,0.00019587197,0.00064536504,0.00046857208,0.00013439832,0.00028886093],"domain_scores_gemma":[0.9980844,0.0002884749,0.00015672707,0.0012815773,0.000052597028,0.0001361874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026336667,0.00038158355,0.0006179915,0.00041125395,0.00014770796,0.00025121233,0.0007290541,0.00022017301,0.0000050559956],"category_scores_gemma":[0.00001846075,0.0004538203,0.000105231324,0.00045010127,0.00016882957,0.00011150158,0.0008095279,0.0013474117,0.0000024610601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030850577,0.000064956716,0.011686535,0.0006427529,0.0015505153,0.000029728564,0.005112679,0.8588808,0.05570806,0.000084867104,0.00040114624,0.06580711],"study_design_scores_gemma":[0.00024151367,0.0000059163553,0.0012243656,0.00031370964,0.00023884016,0.0000044143476,0.000074016396,0.99690175,0.00042568072,0.00005316332,0.00007331239,0.00044329834],"about_ca_topic_score_codex":0.00022417384,"about_ca_topic_score_gemma":0.00067150284,"teacher_disagreement_score":0.44297102,"about_ca_system_score_codex":0.000122040496,"about_ca_system_score_gemma":0.000018947601,"threshold_uncertainty_score":0.9997913},"labels":[],"label_agreement":null},{"id":"W3035706601","doi":"10.1109/lwc.2020.3032596","title":"Handover Rate and Sojourn Time Analysis in Mobile Drone-Assisted Cellular Networks","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and 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 Manitoba","funders":"National Natural Science Foundation of China","keywords":"Drone; Handover; Base station; Computer science; Cellular network; Computer network; Channel (broadcasting); Wireless network; Real-time computing; Wireless; Telecommunications","score_opus":0.013016500815376503,"score_gpt":0.22006837243859015,"score_spread":0.20705187162321365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035706601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300363,0.0033576174,0.4612718,0.0031107252,0.00016879571,0.0011023119,0.00007498171,0.0005002294,0.0003772575],"genre_scores_gemma":[0.98867047,0.003942896,0.00551771,0.00028184304,0.00005719716,0.0006369639,0.0007876344,0.00007425562,0.000031023745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848294,0.00019602208,0.00058036175,0.00037226407,0.00011757761,0.0002508446],"domain_scores_gemma":[0.997566,0.00015650327,0.00016810073,0.0019551935,0.00005018524,0.00010402589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024526523,0.00031921003,0.00056610827,0.00041138098,0.00015153154,0.0001839534,0.0009149424,0.00026075568,0.000023420838],"category_scores_gemma":[0.0000044929384,0.00038368508,0.00016418354,0.0010230729,0.00013092408,0.00010218731,0.00041090988,0.0009329561,0.000021980537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005115305,0.000040843166,0.0004822279,0.000044744982,0.00041007914,0.000002230741,0.00027251535,0.98669404,0.008846972,0.000030907493,0.0008944926,0.002275847],"study_design_scores_gemma":[0.00026812148,0.0000038432418,0.003345401,0.000058684116,0.00037214215,7.663843e-7,0.000020729474,0.9942229,0.00022147763,0.000023342525,0.0010914742,0.000371136],"about_ca_topic_score_codex":0.00010715432,"about_ca_topic_score_gemma":0.00016882965,"teacher_disagreement_score":0.4586342,"about_ca_system_score_codex":0.00016470713,"about_ca_system_score_gemma":0.000021473743,"threshold_uncertainty_score":0.9998615},"labels":[],"label_agreement":null},{"id":"W3040757938","doi":"10.1109/lwc.2020.3007915","title":"Differential Unitary Space-Time Constellations From Spherical Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless 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; University of Toronto","funders":"","keywords":"Constellation; Unitary state; Transmit diversity; Computer science; Antenna (radio); Mathematics; Differential (mechanical device); Topology (electrical circuits); Product (mathematics); Algorithm; Telecommunications; Fading; Decoding methods; Combinatorics; Physics; Geometry","score_opus":0.022386369799594397,"score_gpt":0.2352920510936343,"score_spread":0.2129056812940399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040757938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42952105,0.0007126345,0.5382682,0.02276113,0.00017171219,0.0005872566,0.0002987637,0.00410149,0.0035777718],"genre_scores_gemma":[0.9393673,0.0009416686,0.057551973,0.0014022734,0.00010718002,0.00009881166,0.00041899193,0.0000991201,0.000012669186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984278,0.00023455643,0.00052034017,0.0002741163,0.00022873869,0.00031441852],"domain_scores_gemma":[0.9964907,0.0006691117,0.00010681505,0.002445976,0.00007147591,0.00021591345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004582946,0.00033763223,0.0004242749,0.00008543245,0.00031453322,0.000080308884,0.00202428,0.00013516119,0.00026871279],"category_scores_gemma":[0.000027576576,0.0003850839,0.0001370668,0.00050206383,0.00049253553,0.0003051189,0.000336138,0.00069765333,0.00032358427],"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.00001845103,0.00010499804,0.0006769933,0.000029926256,0.00023422585,0.000004329266,0.0012021977,0.020506462,0.94519913,0.0016656027,0.020038165,0.01031949],"study_design_scores_gemma":[0.0009253299,0.000042138687,0.00092696655,0.00014646609,0.00013725099,0.000006490809,0.00036412338,0.8371438,0.12041481,0.00047831124,0.03803894,0.0013754049],"about_ca_topic_score_codex":0.000065750646,"about_ca_topic_score_gemma":0.000021191547,"teacher_disagreement_score":0.82478434,"about_ca_system_score_codex":0.0001198539,"about_ca_system_score_gemma":0.000024877143,"threshold_uncertainty_score":0.9998601},"labels":[],"label_agreement":null},{"id":"W3044485544","doi":"10.1109/lwc.2020.3011210","title":"Power Minimization for Multi-Cell Uplink NOMA With Imperfect SIC","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","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; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Telecommunications link; Computer science; Noma; Imperfect; Single antenna interference cancellation; Mathematical optimization; Quality of service; Linear programming; Optimization problem; Interference (communication); Power (physics); Minification; Computer network; Decoding methods; Telecommunications; Algorithm; Mathematics","score_opus":0.03159006945792532,"score_gpt":0.2514037574338976,"score_spread":0.21981368797597228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044485544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002026,0.00095044053,0.8953211,0.010511557,0.000083375795,0.0008193259,0.000038942442,0.0020009317,0.00025406657],"genre_scores_gemma":[0.8113226,0.00061942014,0.18629691,0.0010265217,0.000018424847,0.00050267286,0.000095927244,0.00010719607,0.000010303357],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880385,0.000057808866,0.00039435222,0.00028318417,0.00012740352,0.0003334126],"domain_scores_gemma":[0.99697745,0.00030229925,0.00013155374,0.0023813802,0.00011020839,0.00009712902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007270448,0.00030133085,0.00030305734,0.0001313846,0.00029335517,0.00006164977,0.0019480939,0.00013094036,0.000008771755],"category_scores_gemma":[0.000035289795,0.00031170095,0.00009223223,0.0005224816,0.0002823526,0.0003066592,0.0001806343,0.00043964488,0.00004310212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105358384,0.000421144,0.001010731,0.00037503612,0.00027838838,0.0000039541737,0.003666898,0.4405083,0.50779873,0.002268106,0.009800808,0.03376254],"study_design_scores_gemma":[0.0018135974,0.00011924613,0.0001582265,0.00006297466,0.000034161585,0.0000041599515,0.00051534356,0.9138005,0.06873082,0.000016622089,0.014051374,0.00069297256],"about_ca_topic_score_codex":0.000003702575,"about_ca_topic_score_gemma":0.000011072817,"teacher_disagreement_score":0.7213024,"about_ca_system_score_codex":0.00010636714,"about_ca_system_score_gemma":0.000024114097,"threshold_uncertainty_score":0.9999335},"labels":[],"label_agreement":null},{"id":"W3044567815","doi":"10.1109/lwc.2020.3010809","title":"Indoor Mixed Dual-Hop VLC/RF Systems Through Reconfigurable Intelligent Surfaces","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","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 Victoria","funders":"Department of Education of Guangdong Province; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Visible light communication; Relay; Radio frequency; Computer science; Bit error rate; Electronic engineering; Outage probability; Wireless; SIGNAL (programming language); Telecommunications; Physics; Fading; Optics; Engineering; Decoding methods; Light-emitting diode","score_opus":0.051691156027783146,"score_gpt":0.2591911018905435,"score_spread":0.20749994586276035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044567815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59087056,0.015744597,0.31803757,0.053777166,0.0016289976,0.0019535732,0.00017991204,0.009910832,0.007896817],"genre_scores_gemma":[0.9783574,0.009486241,0.010486924,0.0009704955,0.00005536838,0.00039021188,0.000096444994,0.00012486057,0.000032081374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776834,0.000217262,0.0008391951,0.00038192305,0.0002828833,0.0005103713],"domain_scores_gemma":[0.9950729,0.00054049835,0.00022164862,0.003913662,0.00011968536,0.0001316035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020030716,0.00042569844,0.0005454414,0.00013791883,0.00039914774,0.00016523404,0.0030593427,0.00021343576,0.00002425605],"category_scores_gemma":[0.00008210757,0.000474075,0.00013002718,0.0008736785,0.00047923904,0.00060049014,0.0003423543,0.0010006009,0.00036419329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020208972,0.00011853968,0.00037431563,0.0003126535,0.00036243736,0.000009461703,0.003526236,0.6533039,0.2840656,0.00838526,0.028819002,0.020702371],"study_design_scores_gemma":[0.0010105431,0.000082277504,0.00017340507,0.0004401258,0.000073983196,0.00002836381,0.0075291544,0.481419,0.24223205,0.00038077286,0.2647039,0.0019264243],"about_ca_topic_score_codex":0.00009853691,"about_ca_topic_score_gemma":0.00004292799,"teacher_disagreement_score":0.38748685,"about_ca_system_score_codex":0.00022160099,"about_ca_system_score_gemma":0.000029978317,"threshold_uncertainty_score":0.9997711},"labels":[],"label_agreement":null},{"id":"W3047253995","doi":"10.1109/lwc.2020.3045005","title":"Faded-Experience Trust Region Policy Optimization for Model-Free Power Allocation in Interference Channel","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Reinforcement Learning in Robotics","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":"Carleton University","funders":"","keywords":"Reinforcement learning; Memorization; Convergence (economics); Computer science; Interference (communication); Channel (broadcasting); Power (physics); Control (management); Artificial intelligence; Telecommunications; Mathematics; Economics","score_opus":0.07360881230310362,"score_gpt":0.30746428122084635,"score_spread":0.23385546891774273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047253995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019972925,0.000046205212,0.92406887,0.071639374,0.00041406445,0.0011869001,0.000012169319,0.00032166805,0.0003134311],"genre_scores_gemma":[0.8078355,0.0003790367,0.18722068,0.0033327476,0.000066370405,0.0009084496,0.00015925955,0.00005134724,0.000046574023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705976,0.00025534473,0.0009093373,0.0008916764,0.00039271795,0.00049114146],"domain_scores_gemma":[0.99231535,0.00024409422,0.0007272979,0.00631313,0.0002683004,0.00013183148],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00029392279,0.0004602508,0.00046943777,0.0006213177,0.0002942366,0.00046453648,0.010670396,0.00031631408,0.0000012807681],"category_scores_gemma":[0.00029436138,0.00055558933,0.0001700187,0.00082030846,0.00027355234,0.000720596,0.0039932104,0.0010776304,0.000007678871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013634461,0.00005275798,0.000036259677,0.00007440855,0.000022622395,0.0000012044109,0.007653694,0.9747513,0.00053692015,0.015523398,0.0007864839,0.0005473295],"study_design_scores_gemma":[0.00045423408,0.000039834074,0.000042392585,0.00032001908,0.000011697525,0.0000033320619,0.00011266192,0.99710137,0.00029481572,0.0010009542,0.00011151087,0.00050719036],"about_ca_topic_score_codex":0.00018469503,"about_ca_topic_score_gemma":0.000025159432,"teacher_disagreement_score":0.8058382,"about_ca_system_score_codex":0.00061796,"about_ca_system_score_gemma":0.00038986828,"threshold_uncertainty_score":0.9996896},"labels":[],"label_agreement":null},{"id":"W3047363982","doi":"10.1109/lwc.2020.3036094","title":"Learning Power Control From a Fixed Batch of Data","year":2020,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Smart Grid Security and Resilience","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":"Exploit; Reinforcement learning; Computer science; Control (management); Power (physics); Power control; Rest (music); Data transmission; Transmission (telecommunications); Artificial intelligence; Machine learning; Computer network; Computer security; Telecommunications","score_opus":0.04025398243726231,"score_gpt":0.2652640322137783,"score_spread":0.225010049776516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047363982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8908908,0.0030784158,0.08322999,0.016705973,0.0017061115,0.0007450471,0.0018707622,0.0008688122,0.0009040975],"genre_scores_gemma":[0.99306536,0.001110016,0.0041123247,0.00048805063,0.00012188304,0.000033335047,0.0010072092,0.000057296602,0.0000045260226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983717,0.00025001576,0.0005125036,0.00039112792,0.00024994748,0.00022470616],"domain_scores_gemma":[0.994273,0.00058281946,0.00017842227,0.004824454,0.000051896714,0.0000894302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018411291,0.00027825497,0.0005143306,0.0000931712,0.00012636252,0.00006317699,0.005085681,0.00022996982,0.000033051256],"category_scores_gemma":[0.000051931627,0.0003160409,0.00011476762,0.00017487603,0.0002725832,0.00015765495,0.0015479593,0.0018423031,0.000043420125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006623497,0.00024462302,0.0039168843,0.0007147682,0.0019077439,0.000026552429,0.015782816,0.5622822,0.35302582,0.00023938065,0.055455584,0.00633738],"study_design_scores_gemma":[0.00072958897,0.000018635446,0.0023227124,0.00059005077,0.00018614542,0.0000021222982,0.00045259096,0.97599226,0.0022744066,0.00009489394,0.016611036,0.00072553946],"about_ca_topic_score_codex":0.00035857398,"about_ca_topic_score_gemma":0.00008729366,"teacher_disagreement_score":0.4137101,"about_ca_system_score_codex":0.000052745447,"about_ca_system_score_gemma":0.00005253758,"threshold_uncertainty_score":0.9999292},"labels":[],"label_agreement":null},{"id":"W3081351766","doi":"10.1109/lwc.2020.3019001","title":"Energy-Efficient Data Dissemination Using a UAV: An Ant Colony Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Science Foundation","keywords":"Dissemination; Computer science; Ant colony optimization algorithms; Energy consumption; Efficient energy use; Optimization problem; Path (computing); Set (abstract data type); Energy (signal processing); Real-time computing; Distributed computing; Mathematical optimization; Computer network; Algorithm; Engineering","score_opus":0.0645541453642864,"score_gpt":0.27936934792505336,"score_spread":0.21481520256076697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081351766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18728545,0.00016449709,0.8097563,0.0016881231,0.00005689458,0.00020658184,0.00009126205,0.00035453006,0.0003963999],"genre_scores_gemma":[0.9340253,0.00015320015,0.06376941,0.00049796526,0.000080110476,0.000074190604,0.0013475437,0.00004911097,0.0000031561901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989925,0.00007921836,0.00029153028,0.00028626944,0.00016117655,0.00018931612],"domain_scores_gemma":[0.9973671,0.000065269196,0.000070790076,0.0023271057,0.00005351814,0.000116228824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012670139,0.00015979499,0.0001533427,0.000085631276,0.00026954422,0.00009775701,0.0015857468,0.000066099776,0.000005905777],"category_scores_gemma":[0.0000066634398,0.00018261322,0.000029707728,0.00055742625,0.00009864477,0.0002914543,0.00020275483,0.00017369956,0.0000075822118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004679039,0.00018100366,0.000085356434,0.0000343506,0.00004015103,5.317165e-7,0.0011670133,0.8599968,0.12403733,0.0015035389,0.0029084857,0.01004073],"study_design_scores_gemma":[0.00011412714,0.0000063410803,0.000082062834,0.000015048524,0.000031763924,0.0000032812543,0.00015462333,0.9956226,0.0010331095,0.000002951574,0.0027264014,0.00020772545],"about_ca_topic_score_codex":0.000056502893,"about_ca_topic_score_gemma":0.0000123709315,"teacher_disagreement_score":0.74673986,"about_ca_system_score_codex":0.00009111596,"about_ca_system_score_gemma":0.000018851622,"threshold_uncertainty_score":0.7446751},"labels":[],"label_agreement":null},{"id":"W3081615953","doi":"10.1109/lwc.2020.3021026","title":"Towards High Data Rates in Dynamic Environments Using Hybrid Cell-Free Massive MIMO/Small-Cell System","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications link; MIMO; Rician fading; Fading; Real-time computing; Computer network; Algorithm; Decoding methods","score_opus":0.030317414415548156,"score_gpt":0.2376359392455688,"score_spread":0.20731852483002064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081615953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25447354,0.0006951646,0.7409163,0.0019539695,0.00030967634,0.0007131856,0.000409698,0.00029979117,0.00022864781],"genre_scores_gemma":[0.95317036,0.00031538974,0.04546112,0.00023225627,0.000040539937,0.00006794751,0.0005934853,0.00010997892,0.000008900998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983393,0.00019045173,0.00057555863,0.00039332037,0.00016473643,0.00033662663],"domain_scores_gemma":[0.9958699,0.00010243263,0.00017333221,0.003727723,0.00001765115,0.000108977714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013597411,0.00029652758,0.00034875024,0.00013501316,0.00014346853,0.000060779657,0.0029628696,0.00007933256,0.0000040128193],"category_scores_gemma":[0.0000143031875,0.00036444986,0.000042472777,0.000326676,0.00009304415,0.00042993997,0.0006989345,0.0003921608,0.000047298112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046567357,0.00003576094,0.00013300996,0.00023766424,0.000027765069,0.000013579522,0.00031228663,0.7681998,0.23035361,0.000018801098,0.00045626034,0.00020679334],"study_design_scores_gemma":[0.00077242916,0.000007193907,0.00004773277,0.00014163918,0.000038931903,0.0000061295505,0.00042025512,0.9815887,0.01627769,0.0000029172736,0.0003404707,0.00035590355],"about_ca_topic_score_codex":0.00016161117,"about_ca_topic_score_gemma":0.00004975292,"teacher_disagreement_score":0.69869685,"about_ca_system_score_codex":0.0005296092,"about_ca_system_score_gemma":0.000027397693,"threshold_uncertainty_score":0.99988073},"labels":[],"label_agreement":null},{"id":"W3082266747","doi":"10.1109/lwc.2020.3020122","title":"8-QAM Division for Uplink Massive SIMO Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless 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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Shandong University","keywords":"Telecommunications link; Computer science; Division (mathematics); QAM; Quadrature amplitude modulation; Computer network; Telecommunications; Bit error rate; Channel (broadcasting); Mathematics","score_opus":0.030235539630821578,"score_gpt":0.2515279246381302,"score_spread":0.2212923850073086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082266747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012478578,0.00052857265,0.9781546,0.006476597,0.00048593516,0.0008852,0.000048003974,0.00069926155,0.00024323449],"genre_scores_gemma":[0.97960377,0.0001594716,0.018860074,0.0005558992,0.00013431122,0.0004457817,0.00013667718,0.00008800387,0.000016007363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990103,0.000050353636,0.0003975729,0.00019963221,0.000101857026,0.00024024387],"domain_scores_gemma":[0.9983629,0.00025808284,0.00010209377,0.0010805073,0.00008875808,0.000107633285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008888174,0.00019202883,0.00025266813,0.00007127599,0.0002056044,0.00006919704,0.0007945549,0.00008548075,0.000002223135],"category_scores_gemma":[0.00003156393,0.0002163733,0.000078101766,0.00027015826,0.00006546938,0.00025216967,0.00007482165,0.00020805268,0.00005189378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004196398,0.0000117485815,0.000048923623,0.00014997288,0.000043095435,6.0054373e-7,0.00049154274,0.9262785,0.06447969,0.0009191585,0.00606105,0.0015115679],"study_design_scores_gemma":[0.00038129374,0.00001640738,0.000014135305,0.000085566986,0.000019383604,0.0000010649934,0.00015883947,0.98826206,0.0020318418,0.000007488814,0.008769551,0.00025234587],"about_ca_topic_score_codex":0.000009268411,"about_ca_topic_score_gemma":0.000003173223,"teacher_disagreement_score":0.9671252,"about_ca_system_score_codex":0.000117767566,"about_ca_system_score_gemma":0.000010910058,"threshold_uncertainty_score":0.88234466},"labels":[],"label_agreement":null},{"id":"W3083085256","doi":"10.1109/lwc.2020.3021991","title":"RSS Localization Under Gaussian Distributed Path Loss Exponent Model","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization 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":"University of British Columbia","funders":"Mitacs","keywords":"RSS; Estimator; Mathematics; Maximum a posteriori estimation; Algorithm; Gaussian; Cramér–Rao bound; Statistics; Random variable; Node (physics); Computer science; Mathematical optimization; Maximum likelihood","score_opus":0.02766037570336851,"score_gpt":0.23041915226067752,"score_spread":0.202758776557309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083085256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0430407,0.00014237234,0.9391644,0.015557274,0.00008116345,0.00020247744,0.00008878015,0.0015230118,0.00019984685],"genre_scores_gemma":[0.9938984,0.00043204264,0.0022127333,0.0029008707,0.00003336661,0.000075320466,0.00038467252,0.000056147106,0.000006480949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893606,0.00005276866,0.0003524684,0.00019596558,0.00018626497,0.00027647323],"domain_scores_gemma":[0.9986384,0.00004296122,0.000059671773,0.0011053805,0.000055340446,0.00009823668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005600501,0.00021366039,0.00020216819,0.00008401616,0.00024094849,0.00006755069,0.0009782629,0.00012991975,0.000011065731],"category_scores_gemma":[0.000014809582,0.00023069383,0.000071852824,0.0005200523,0.00020956786,0.00019542922,0.00012574666,0.00030421396,0.00006788964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004677794,0.00003012018,0.00032868446,0.00003965112,0.000046093428,0.0000023762348,0.00059900637,0.97267014,0.010272436,0.0054872185,0.009761684,0.00075789826],"study_design_scores_gemma":[0.0002786175,0.0000075639973,0.000074082476,0.000029063349,0.0000233332,0.000001854258,0.00026266056,0.9866606,0.009941239,0.00018382391,0.0022577487,0.00027943923],"about_ca_topic_score_codex":0.000012321456,"about_ca_topic_score_gemma":0.000011081772,"teacher_disagreement_score":0.95085764,"about_ca_system_score_codex":0.000136296,"about_ca_system_score_gemma":0.000018928597,"threshold_uncertainty_score":0.94074214},"labels":[],"label_agreement":null},{"id":"W3086917883","doi":"10.1109/lwc.2020.3023253","title":"Joint Location and Transmit Power Optimization for NOMA-UAV Networks via Updating Decoding Order","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","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":"Western University","funders":"","keywords":"Decoding methods; Computer science; Noma; Joint (building); Transmitter power output; Power (physics); Algorithm; Convex optimization; Mathematical optimization; Throughput; Real-time computing; Regular polygon; Wireless; Telecommunications; Mathematics; Telecommunications link; Channel (broadcasting); Engineering; Transmitter","score_opus":0.018158650098289285,"score_gpt":0.21376171224356913,"score_spread":0.19560306214527984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086917883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014012766,0.00027705004,0.97788656,0.0066374084,0.0000808565,0.000599997,0.000010088099,0.0003324459,0.0001628378],"genre_scores_gemma":[0.81545734,0.00041681563,0.18232965,0.0011986006,0.000059308055,0.0002731671,0.00020423652,0.00005915344,0.0000017146216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990432,0.000040509163,0.00039721673,0.00022118351,0.00008575744,0.00021209872],"domain_scores_gemma":[0.9989756,0.000113758506,0.00009015126,0.00058140355,0.00014429128,0.000094839335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287069,0.00018146426,0.0001831119,0.00008003627,0.00033900866,0.00010268829,0.0003334821,0.000092117676,0.000015959758],"category_scores_gemma":[0.000017043281,0.00021587747,0.000042606647,0.00053389627,0.00007612402,0.00028921466,0.00003862732,0.00018821482,0.000004837139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046090954,0.000016138525,0.00005858437,0.000047060657,0.000031274605,7.815185e-8,0.0005535381,0.98521656,0.005839495,0.0006063467,0.0006882816,0.006938025],"study_design_scores_gemma":[0.00036407236,0.000013205227,0.0001053444,0.000032043743,0.000035391233,0.0000020709626,0.00010089119,0.99792105,0.00049109955,0.000009174004,0.00069093757,0.0002347251],"about_ca_topic_score_codex":0.000010531704,"about_ca_topic_score_gemma":0.000012097508,"teacher_disagreement_score":0.8014446,"about_ca_system_score_codex":0.000060900024,"about_ca_system_score_gemma":0.000012334341,"threshold_uncertainty_score":0.88032275},"labels":[],"label_agreement":null},{"id":"W3088537232","doi":"10.1109/lwc.2020.3026712","title":"Outage Probability and Capacity Scaling Law of Multiple RIS-Aided Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":161,"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":"Department of Education of Guangdong Province; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Scaling law; Relay; Expression (computer science); Scaling; Outage probability; Computer science; Signal-to-noise ratio (imaging); Topology (electrical circuits); Capacity planning; Applied mathematics; Mathematical optimization; Mathematics; Telecommunications; Fading; Power (physics); Physics; Combinatorics","score_opus":0.04757574156426466,"score_gpt":0.23191814780051323,"score_spread":0.18434240623624856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088537232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70300996,0.000786076,0.28980732,0.0045395703,0.000058508464,0.00040742266,0.00003246758,0.0011237084,0.00023494131],"genre_scores_gemma":[0.94446117,0.0007901344,0.054047342,0.0005254327,0.0000163279,0.00009600906,0.000020347206,0.000042685606,5.419283e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987334,0.00013804834,0.000518177,0.00022892034,0.00013104503,0.00025039612],"domain_scores_gemma":[0.99687433,0.0005039048,0.00014016565,0.0023214666,0.00006901967,0.00009110731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001710969,0.00022053327,0.0003596396,0.00005985942,0.00022100372,0.0000322397,0.0014547775,0.00013312593,0.0000026451353],"category_scores_gemma":[0.000089658824,0.00024975723,0.00007213967,0.00036863744,0.0009929204,0.0002678482,0.00040265493,0.0006477592,0.000004176399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002280711,0.00011759151,0.0065234364,0.00035110128,0.0001572197,0.000001112364,0.0025310102,0.7168642,0.23132522,0.021931691,0.00036242272,0.019812187],"study_design_scores_gemma":[0.00056049734,0.000018771947,0.0011551683,0.000098098404,0.00002358195,0.0000028566055,0.00032529407,0.9536723,0.041518234,0.0005925793,0.0015915986,0.00044100612],"about_ca_topic_score_codex":0.00008572161,"about_ca_topic_score_gemma":0.00011985565,"teacher_disagreement_score":0.2414512,"about_ca_system_score_codex":0.00006650189,"about_ca_system_score_gemma":0.0000065954255,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W3089130280","doi":"10.1109/lwc.2020.3026700","title":"Secure and Energy Efficient Transmission for RSMA-Based Cognitive Satellite-Terrestrial Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":210,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation","keywords":"Computer science; Beamforming; Base station; Transmitter power output; Secure transmission; Energy consumption; Convex optimization; Optimization problem; Mathematical optimization; Transmission (telecommunications); Efficient energy use; Channel (broadcasting); Computer network; Telecommunications; Regular polygon; Algorithm; Mathematics; Electrical engineering","score_opus":0.03436024305649066,"score_gpt":0.2449457525203187,"score_spread":0.21058550946382804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089130280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0675765,0.0121652195,0.9084635,0.009472889,0.000336435,0.00072657014,0.0000656716,0.0006961186,0.0004971327],"genre_scores_gemma":[0.99259776,0.0018053243,0.0029576975,0.0018468378,0.00014328005,0.0003098757,0.00025712705,0.00007666545,0.000005414898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986351,0.00023768951,0.0004573703,0.0002461275,0.00014703324,0.00027668025],"domain_scores_gemma":[0.99765813,0.0010360461,0.00009186195,0.000966783,0.000060126575,0.00018707619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017007631,0.00024903638,0.00029512143,0.000090073154,0.00024969256,0.000089677786,0.0008380956,0.00013518952,0.000005449727],"category_scores_gemma":[0.000014664005,0.00027192212,0.00011237303,0.0003199735,0.00018501462,0.00007373582,0.000061162405,0.00028318062,0.0000071708682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042308177,0.00021048164,0.0004006008,0.0003980523,0.00036559242,0.000004474145,0.0058590174,0.44736725,0.08173526,0.00092047924,0.004219595,0.45809612],"study_design_scores_gemma":[0.0011778853,0.000028200098,0.00006853356,0.00014889755,0.00004344332,0.0000019852494,0.00014006419,0.8945417,0.003313602,0.0000026397038,0.10023818,0.00029486782],"about_ca_topic_score_codex":0.000018780805,"about_ca_topic_score_gemma":0.000010522922,"teacher_disagreement_score":0.9250213,"about_ca_system_score_codex":0.00005310737,"about_ca_system_score_gemma":0.000021645992,"threshold_uncertainty_score":0.9999733},"labels":[],"label_agreement":null},{"id":"W3109590391","doi":"10.1109/lwc.2020.3039483","title":"On the Aperture Efficiency of Intelligent Reflecting Surfaces","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":18,"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":"East China Institute of Technology; Queen's University; Queen's University Belfast; Engineering and Physical Sciences Research Council; Leverhulme Trust; UK Research and Innovation","keywords":"Tapering; Aperture (computer memory); Computer science; Point (geometry); Antenna (radio); Antenna aperture; Work (physics); Electronic engineering; Telecommunications; Acoustics; Physics; Radiation pattern; Engineering; Computer graphics (images); Mathematics; Geometry; Mechanical engineering","score_opus":0.05931718062010783,"score_gpt":0.2828084682566031,"score_spread":0.22349128763649528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109590391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6320511,0.0016892819,0.25794125,0.10427742,0.0001342295,0.00053264224,0.000024113782,0.0016086514,0.0017413144],"genre_scores_gemma":[0.9913374,0.0012138659,0.00522816,0.0020912068,0.000010007936,0.00006735014,0.000009003117,0.000039137976,0.0000038486282],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989588,0.00012001649,0.0003851997,0.0001567876,0.00018105678,0.0001981072],"domain_scores_gemma":[0.99567866,0.0016643042,0.0001223328,0.002443308,0.000051714294,0.000039703238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015123411,0.00018117842,0.000209628,0.00007831648,0.0002445115,0.0000258113,0.002831212,0.000073656214,0.000012574708],"category_scores_gemma":[0.000233291,0.00014678376,0.00007716921,0.0006143252,0.0003910251,0.00009134644,0.00024806452,0.0006665974,0.00004547107],"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.000010942805,0.000075875585,0.00015253857,0.00006823056,0.000088370456,7.2322126e-7,0.0027122449,0.35467649,0.6018793,0.026788848,0.0040087816,0.009537678],"study_design_scores_gemma":[0.000249433,0.00007894278,0.000114135146,0.00021641035,0.000019608877,0.0000030543704,0.002451435,0.5964111,0.38553014,0.0006581755,0.013705121,0.0005624305],"about_ca_topic_score_codex":0.000007898327,"about_ca_topic_score_gemma":0.000008909346,"teacher_disagreement_score":0.3592863,"about_ca_system_score_codex":0.000060901988,"about_ca_system_score_gemma":0.0000103201555,"threshold_uncertainty_score":0.5985668},"labels":[],"label_agreement":null},{"id":"W3110737355","doi":"10.1109/lwc.2020.3043365","title":"Robust Cooperative Communication Optimization for Multi-UAV-Aided Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China; China Postdoctoral Science Foundation; Beihang University; Royal Society","keywords":"Computer science; Robustness (evolution); Mathematical optimization; Quality of service; Robust optimization; Parametric statistics; Minimax; Minification; Optimization problem; Distributed computing; Computer network; Algorithm; Mathematics","score_opus":0.05399239494067296,"score_gpt":0.24470101386777096,"score_spread":0.190708618927098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110737355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061638863,0.000640109,0.9845451,0.006647131,0.00008741964,0.001106091,0.000044268276,0.0006217471,0.00014422611],"genre_scores_gemma":[0.65228283,0.001596613,0.34197265,0.0019165762,0.00007684932,0.0009452124,0.0011046774,0.000094655035,0.000009947798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.00013333382,0.00048953464,0.00026302147,0.00011934319,0.00026982182],"domain_scores_gemma":[0.9978323,0.00019373397,0.00012319055,0.0014861886,0.00023581744,0.00012875817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016699161,0.00025584997,0.00026623413,0.00008403218,0.00054421445,0.00013801601,0.0011165494,0.00014191087,0.000020909576],"category_scores_gemma":[0.000030935546,0.00029722473,0.000101127,0.00060186314,0.00016631663,0.0003617741,0.00010237751,0.00033658874,0.000019104024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084700505,0.000049241404,0.00005174718,0.000026302932,0.00006280924,1.3069096e-7,0.00049871864,0.99019694,0.0027772312,0.00087002653,0.0041306284,0.0013277611],"study_design_scores_gemma":[0.0007209622,0.000015950753,0.000048670187,0.000033424938,0.000052352152,0.0000011223417,0.00012691456,0.9951316,0.00070723926,0.0000027684362,0.002839035,0.0003199235],"about_ca_topic_score_codex":0.00001776672,"about_ca_topic_score_gemma":0.000034423814,"teacher_disagreement_score":0.64611894,"about_ca_system_score_codex":0.00011702654,"about_ca_system_score_gemma":0.000020612088,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W3128770299","doi":"10.1109/lwc.2021.3058005","title":"Outage of NOMA-Based Hybrid Satellite-Terrestrial Multi-antenna DF Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":29,"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; Relay; Noma; Computer network; Antenna (radio); Satellite; Channel (broadcasting); Key (lock); Communications satellite; Electronic engineering; Telecommunications; Telecommunications link; Power (physics); Engineering","score_opus":0.0439470787004307,"score_gpt":0.26124031243883383,"score_spread":0.21729323373840315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128770299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68587905,0.021453949,0.28263253,0.0036435095,0.0029548325,0.0009651828,0.00013470507,0.0012211145,0.0011151042],"genre_scores_gemma":[0.9832501,0.0032735928,0.0123014655,0.00047356778,0.00009837699,0.00011846539,0.0003376424,0.000106839856,0.00003999721],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974043,0.0006155288,0.0010269919,0.00028875572,0.00027013323,0.00039429223],"domain_scores_gemma":[0.99303997,0.000843371,0.0002441409,0.005589394,0.00015645471,0.00012668585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041339386,0.00032193068,0.00051874784,0.00020165963,0.00018913494,0.00008865748,0.002103341,0.00013889972,0.000020797743],"category_scores_gemma":[0.000054978154,0.00038158367,0.00025207718,0.00061043096,0.00031089206,0.00018593686,0.0002206806,0.00063734525,0.00006740595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070412796,0.0007786624,0.013589184,0.00033087074,0.00068025483,0.00007619757,0.0016465083,0.24348846,0.70357573,0.0003216166,0.0024257118,0.033016384],"study_design_scores_gemma":[0.0019183448,0.000015627855,0.0026520414,0.0004114849,0.00007887402,0.000028946464,0.00023144702,0.9178001,0.038993325,0.0000034401007,0.037151173,0.00071518857],"about_ca_topic_score_codex":0.00006989397,"about_ca_topic_score_gemma":0.000111456335,"teacher_disagreement_score":0.67431164,"about_ca_system_score_codex":0.00015807047,"about_ca_system_score_gemma":0.000065939916,"threshold_uncertainty_score":0.9998636},"labels":[],"label_agreement":null},{"id":"W3131650466","doi":"10.1109/lwc.2021.3058942","title":"Outage Performance for Optical Feeder Link in Satellite Communications With Diversity Combining","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Shenzhen International Cooperation Research Project; Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Independent and identically distributed random variables; Fading; Computer science; Probability density function; Expression (computer science); Diversity combining; Outage probability; Diversity gain; Communications satellite; Satellite; Maximal-ratio combining; Telecommunications; Random variable; Mathematics; Physics; Statistics; Decoding methods","score_opus":0.03507381391898306,"score_gpt":0.24683703314581062,"score_spread":0.21176321922682756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131650466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93623877,0.0037236246,0.017266976,0.036051944,0.0001661086,0.00077972404,0.000042097738,0.0013761073,0.0043546334],"genre_scores_gemma":[0.9125941,0.010069257,0.07624064,0.0005294528,0.00001417347,0.00031289275,0.00015015095,0.00006325392,0.000026081065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983581,0.00012439243,0.00052880263,0.0002895268,0.00022187403,0.00047731836],"domain_scores_gemma":[0.9930402,0.0010336427,0.000088573404,0.005549803,0.00019418572,0.0000935671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032336617,0.00029035268,0.00040715872,0.00022561224,0.00073409395,0.00011500578,0.0033905676,0.00018850333,0.000005484193],"category_scores_gemma":[0.00004952029,0.00032141976,0.00009536288,0.00079844566,0.00082247733,0.00038383962,0.0016352328,0.00095048395,0.00003171215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018442473,0.0018897512,0.10650258,0.0009917556,0.0010141488,0.000038559985,0.007820661,0.03172981,0.10895898,0.11212693,0.0011654922,0.6275769],"study_design_scores_gemma":[0.006731152,0.0002322766,0.05642432,0.0015297419,0.00024370241,0.00009307,0.004640158,0.807137,0.061079614,0.00082628557,0.057667017,0.0033956529],"about_ca_topic_score_codex":0.000019499532,"about_ca_topic_score_gemma":0.0003617452,"teacher_disagreement_score":0.7754072,"about_ca_system_score_codex":0.0002430596,"about_ca_system_score_gemma":0.000048435548,"threshold_uncertainty_score":0.99992377},"labels":[],"label_agreement":null},{"id":"W3134397748","doi":"10.1109/lwc.2021.3063122","title":"Novel Efficient Multiwavelet-Based Modulation for Downlink NOMA Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"National Natural Science Foundation of China","keywords":"Noma; Telecommunications link; Computer science; Spectral efficiency; Demodulation; Computational complexity theory; Electronic engineering; Orthogonal frequency-division multiplexing; Bit error rate; Signal-to-noise ratio (imaging); Base station; Algorithm; Telecommunications; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.03419659269430386,"score_gpt":0.25776882736810064,"score_spread":0.22357223467379678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134397748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32273242,0.00025931982,0.67125875,0.0029133256,0.001622961,0.00046147805,0.00010578482,0.00044279004,0.00020319661],"genre_scores_gemma":[0.9672963,0.000020421634,0.031488117,0.0002556938,0.00014067577,0.00046173052,0.00024383736,0.00005918152,0.000034014993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890304,0.00006251295,0.00039276792,0.00021237755,0.00017225515,0.00025708004],"domain_scores_gemma":[0.99769473,0.00029241998,0.00007811068,0.0016888004,0.000175646,0.00007027764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015527764,0.00018023881,0.00020375814,0.00013401186,0.00025044772,0.00008610177,0.0005273602,0.00009274213,0.0000043157825],"category_scores_gemma":[0.000028464594,0.00021931667,0.00011230007,0.00032800567,0.00009755382,0.00007729445,0.000040313982,0.00020962319,0.000027500213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021705407,0.000062497085,0.000021082149,0.000057893412,0.000031490614,4.251632e-7,0.000080410035,0.6165853,0.38083363,0.00033418403,0.00092115643,0.0010697523],"study_design_scores_gemma":[0.000660858,0.000004212293,0.00033264523,0.00007088597,0.00002103668,0.000009292915,0.000076939265,0.97037596,0.018946039,0.0000019578824,0.0092615625,0.00023863472],"about_ca_topic_score_codex":0.000025658184,"about_ca_topic_score_gemma":0.000011967063,"teacher_disagreement_score":0.6445639,"about_ca_system_score_codex":0.0002509315,"about_ca_system_score_gemma":0.000041597068,"threshold_uncertainty_score":0.8943474},"labels":[],"label_agreement":null},{"id":"W3163044580","doi":"10.1109/lwc.2021.3078156","title":"Ergodic Capacity of High Throughput Satellite Systems With Mixed FSO-RF Transmission","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Optical 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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Computer science; Fading; Ergodic theory; Rician fading; Beamforming; Throughput; Transmission (telecommunications); Electronic engineering; MIMO; Radio frequency; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Mathematics; Decoding methods; Electrical engineering; Engineering","score_opus":0.023419965172702967,"score_gpt":0.21970765299718764,"score_spread":0.19628768782448466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163044580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.909789,0.0061041834,0.07602926,0.005338112,0.00022611338,0.00032986372,0.0000422171,0.0011097976,0.0010314337],"genre_scores_gemma":[0.9622189,0.008372656,0.02900651,0.00009653983,0.00001516283,0.00012437569,0.00007590378,0.00007003106,0.000019924257],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998206,0.00023177295,0.000630565,0.0002677114,0.00032059982,0.00034333713],"domain_scores_gemma":[0.99483037,0.00046416553,0.00013744058,0.0042678765,0.00021034779,0.000089783774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018726097,0.00029552125,0.00051146664,0.00015913295,0.00021170228,0.00007024261,0.0017682024,0.00019958566,0.000010071798],"category_scores_gemma":[0.000021527203,0.0002854494,0.00010266988,0.0008118195,0.00069962675,0.0002462021,0.00018006904,0.0006639976,0.000025233794],"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.0000327883,0.00047763,0.00089386385,0.00076066965,0.00054983754,0.00001737349,0.001199935,0.057331268,0.839885,0.037955254,0.0011620854,0.059734292],"study_design_scores_gemma":[0.0021127274,0.0001117431,0.0061914115,0.0017457233,0.00020960708,0.00012681683,0.0017978855,0.08211016,0.8726028,0.00040894438,0.030897757,0.0016844141],"about_ca_topic_score_codex":0.00014384717,"about_ca_topic_score_gemma":0.00009028143,"teacher_disagreement_score":0.05804988,"about_ca_system_score_codex":0.00014523607,"about_ca_system_score_gemma":0.00004572163,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W3164338795","doi":"10.1109/lwc.2021.3084163","title":"Random Access Based on Maximum Average Distance Code for Massive MTC in Cellular IoT Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"IoT Networks and Protocols","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 Manitoba","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo; Government of Canada","keywords":"Random access; Code (set theory); Computer science; Decoding methods; Ambiguity; Scheme (mathematics); Channel (broadcasting); Inference; Algorithm; Computer network; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.029501451963634386,"score_gpt":0.277982674774879,"score_spread":0.2484812228112446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164338795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018219372,0.0007598899,0.96601903,0.0032995162,0.0009306176,0.009949424,0.00018707407,0.00027655813,0.00035850066],"genre_scores_gemma":[0.96469086,0.00042113365,0.0052497373,0.0018476067,0.00028639223,0.026260791,0.0010536321,0.00017051377,0.000019314257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762267,0.00036334337,0.00071130716,0.0005162686,0.00022884874,0.00055755884],"domain_scores_gemma":[0.9950678,0.0009077619,0.0002234492,0.0036110438,0.00009190689,0.000098086995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004417696,0.00052967074,0.0007366752,0.00020855993,0.00022667141,0.00043523914,0.0027932448,0.0004455164,0.000021175945],"category_scores_gemma":[0.00001610154,0.000618444,0.00031489634,0.00034796444,0.0001369983,0.00009544792,0.00041959446,0.0018006954,0.0000037090629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000949257,0.00008567571,0.0002557416,0.00032301436,0.00008455165,0.000012596603,0.00011779371,0.9926238,0.0005532787,0.00005531435,0.0035548955,0.0022384047],"study_design_scores_gemma":[0.0019811757,0.000010430852,0.00011845081,0.0013430003,0.000036109497,5.0801253e-7,0.0000129806585,0.9871617,0.0009075268,0.00009104318,0.007704648,0.0006324586],"about_ca_topic_score_codex":0.00004590097,"about_ca_topic_score_gemma":0.0003130479,"teacher_disagreement_score":0.9607693,"about_ca_system_score_codex":0.00038392865,"about_ca_system_score_gemma":0.0000763549,"threshold_uncertainty_score":0.9996267},"labels":[],"label_agreement":null},{"id":"W3167888726","doi":"10.1109/lwc.2021.3087581","title":"Improved RSSD-Based Source Localization With Unknown Sensor Position Errors","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Semidefinite programming; Robustness (evolution); Mathematics; Estimator; Mean squared error; Mathematical optimization; Convex optimization; Minimax; Noise measurement; Nonlinear programming; Algorithm; Computer science; Nonlinear system; Regular polygon; Statistics","score_opus":0.010202895442946515,"score_gpt":0.2124274257161078,"score_spread":0.20222453027316128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167888726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15270765,0.0001574614,0.84101003,0.0040865815,0.00013768974,0.00020016474,0.000013724286,0.0013573198,0.00032939002],"genre_scores_gemma":[0.98808557,0.00009261216,0.009743806,0.0015491901,0.00002676556,0.00008314154,0.00029479727,0.000068390866,0.000055721568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899536,0.00009674619,0.00028051596,0.000204783,0.00016197174,0.00026059203],"domain_scores_gemma":[0.9981683,0.000093281604,0.00006718583,0.0014484299,0.00017218683,0.000050601036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074280884,0.00020829207,0.00018917378,0.0001599747,0.00030200338,0.00008256019,0.00047919445,0.0001312637,0.000015639356],"category_scores_gemma":[0.000017526801,0.00021513543,0.00006147682,0.00069662934,0.0002212267,0.00015924196,0.000048737034,0.0002815421,0.000020725132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017815284,0.00010997026,0.00078410684,0.00011151246,0.0001105515,0.000012829987,0.00058260787,0.73566246,0.25297785,0.00093784096,0.0016970002,0.0069954493],"study_design_scores_gemma":[0.00054010504,0.000018424067,0.000089174166,0.000084935295,0.00004247713,0.000017447965,0.00034350803,0.75826406,0.23171106,0.00001128864,0.008544041,0.00033346366],"about_ca_topic_score_codex":0.000026813575,"about_ca_topic_score_gemma":0.00014555854,"teacher_disagreement_score":0.83537793,"about_ca_system_score_codex":0.00015251568,"about_ca_system_score_gemma":0.000040286865,"threshold_uncertainty_score":0.87729686},"labels":[],"label_agreement":null},{"id":"W3175439978","doi":"10.1109/lwc.2021.3091896","title":"An Efficient Information Sampling Method for Multi-Category RFID Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Coding (social sciences); Sampling (signal processing); Identification (biology); Data mining; Object (grammar); Construct (python library); Information retrieval; Artificial intelligence; Computer network; Telecommunications; Mathematics; Statistics","score_opus":0.04829854963668167,"score_gpt":0.31039410719299726,"score_spread":0.2620955575563156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175439978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03054716,0.0002997361,0.9668024,0.00047743003,0.00049137214,0.0003196101,0.00006967854,0.0009058688,0.000086706925],"genre_scores_gemma":[0.8295682,0.00010597846,0.16926742,0.0003642572,0.000029010878,0.00028077658,0.0003489812,0.000030127552,0.0000052662344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908054,0.00008600648,0.0003778098,0.00011816723,0.00011222701,0.00022526238],"domain_scores_gemma":[0.9981729,0.00015996063,0.000069021335,0.0013692041,0.0001856521,0.00004327696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002483336,0.00014546223,0.00017888073,0.00016734496,0.00028379782,0.00015301771,0.0006534301,0.00011342888,0.000002257637],"category_scores_gemma":[0.000037676302,0.00016291671,0.000064425265,0.00031936733,0.00006253116,0.00028502688,0.000052575346,0.00019373979,0.000014988631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022440179,0.00004049647,0.000040882827,0.00012007255,0.000037714843,3.150492e-7,0.0007764058,0.9373779,0.044119664,0.0077674706,0.0005107439,0.009206033],"study_design_scores_gemma":[0.00032840413,0.000005638739,0.00007302926,0.0000318172,0.000018465149,0.0000066315993,0.0012237692,0.96685505,0.02341212,0.000011806512,0.00783449,0.0001987544],"about_ca_topic_score_codex":0.0000322547,"about_ca_topic_score_gemma":0.00001703056,"teacher_disagreement_score":0.799021,"about_ca_system_score_codex":0.00011739024,"about_ca_system_score_gemma":0.000025861325,"threshold_uncertainty_score":0.66435504},"labels":[],"label_agreement":null},{"id":"W3176457495","doi":"10.1109/lwc.2021.3092147","title":"Cascaded Channel Estimation for RIS Assisted mmWave MIMO Transmissions","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":76,"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":"Wideband; Channel (broadcasting); MIMO; Computer science; Overhead (engineering); Transmission (telecommunications); Cramér–Rao bound; Base station; Electronic engineering; Estimation theory; Algorithm; Telecommunications; Engineering","score_opus":0.0398110962780329,"score_gpt":0.27973966866430044,"score_spread":0.23992857238626755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176457495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024744747,0.0016597412,0.9532663,0.016988868,0.0002646929,0.000541536,0.000114710536,0.0019382692,0.00048108952],"genre_scores_gemma":[0.8518534,0.0017639035,0.14463188,0.00041325061,0.000023432718,0.00078692404,0.00037656102,0.00008762018,0.00006303459],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984725,0.00012503221,0.00054700184,0.00028912048,0.00017837886,0.00038793398],"domain_scores_gemma":[0.99543303,0.000662611,0.000117616866,0.0035074016,0.00018521785,0.00009411436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015288407,0.00029066662,0.00034785166,0.0002198202,0.0005516399,0.00007618721,0.0015225692,0.0002065699,0.000012437882],"category_scores_gemma":[0.000104888604,0.0003425543,0.0001776466,0.0006939626,0.0002675145,0.00031848805,0.00014881206,0.0005245862,0.000026209662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149028465,0.00026398586,0.00002472221,0.0001936821,0.00028025138,0.0000066921784,0.0012419358,0.21726137,0.5564758,0.0048251497,0.01084607,0.20856541],"study_design_scores_gemma":[0.0009011695,0.000015494956,0.0003251749,0.0002003027,0.00006330903,0.000038626138,0.00061803806,0.74405915,0.2375041,0.001093954,0.014536807,0.00064384984],"about_ca_topic_score_codex":0.000011247964,"about_ca_topic_score_gemma":0.00006836366,"teacher_disagreement_score":0.8271086,"about_ca_system_score_codex":0.00020414333,"about_ca_system_score_gemma":0.000046942623,"threshold_uncertainty_score":0.99990267},"labels":[],"label_agreement":null},{"id":"W3184419608","doi":"10.1109/lwc.2021.3099302","title":"Symbol Error Analysis of Amplify-and-Forward Based Multiuser Hybrid Satellite-Terrestrial Relay Network","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication 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":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Relay; Computer science; Communications satellite; Signal-to-noise ratio (imaging); Bit error rate; Symbol rate; Scheduling (production processes); Channel (broadcasting); Satellite; Computer network; Telecommunications; Mathematics; Mathematical optimization; Power (physics); Engineering","score_opus":0.036518687208620185,"score_gpt":0.2691225660053658,"score_spread":0.23260387879674566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184419608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95951617,0.009987311,0.025237706,0.0025547927,0.00070676534,0.0005237481,0.00014021977,0.00055213564,0.0007811751],"genre_scores_gemma":[0.98682874,0.00305306,0.00881646,0.0004849769,0.00007204754,0.00011501013,0.0005384064,0.000069674796,0.000021610907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974708,0.0006393518,0.0009454994,0.00029934302,0.00028916812,0.00035584168],"domain_scores_gemma":[0.9935289,0.0012906536,0.00022414947,0.0046986593,0.00012605291,0.00013158291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005004745,0.00028748886,0.0006953247,0.00036825295,0.00020581021,0.000087947774,0.0013497991,0.00012723806,0.00003017619],"category_scores_gemma":[0.00005010474,0.00033286444,0.00028324107,0.0016113683,0.00026322497,0.00016086787,0.00021279076,0.00047579806,0.000026031821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006965592,0.0003189847,0.043575622,0.00025690228,0.0058810664,0.000022667022,0.002226266,0.78358203,0.13794766,0.0006860059,0.0030476095,0.02238553],"study_design_scores_gemma":[0.0014456585,0.000016020855,0.016071854,0.00028362393,0.0014752456,0.000014285851,0.00040915702,0.8961441,0.014569507,0.000014119216,0.0686327,0.0009237493],"about_ca_topic_score_codex":0.00009664099,"about_ca_topic_score_gemma":0.00023013902,"teacher_disagreement_score":0.12337815,"about_ca_system_score_codex":0.00011278064,"about_ca_system_score_gemma":0.000046173293,"threshold_uncertainty_score":0.9999123},"labels":[],"label_agreement":null},{"id":"W3186948062","doi":"10.1109/lwc.2022.3165194","title":"Fast First-Order Algorithm for Large-Scale Max-Min Fair Multi-Group Multicast Beamforming","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Beamforming; Subgradient method; Mathematical optimization; Computer science; Computational complexity theory; Algorithm; Optimization problem; Mathematics; Distributed computing; Telecommunications","score_opus":0.01636819332469828,"score_gpt":0.2469705793853637,"score_spread":0.23060238606066544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186948062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007359805,0.00020940282,0.9889776,0.0007701529,0.00054300076,0.0010323124,0.0004341804,0.0005936821,0.00007985861],"genre_scores_gemma":[0.36108443,0.00007015037,0.6349503,0.00033254357,0.000093328956,0.0026302484,0.00054142135,0.00016573399,0.00013186753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984985,0.00008743431,0.00044793787,0.00029218767,0.00018613685,0.00048782516],"domain_scores_gemma":[0.99788123,0.00025730437,0.00012338406,0.0015691996,0.00008252969,0.00008634012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002527117,0.00027574252,0.0003002346,0.00021330813,0.0011317014,0.000050905826,0.0010903359,0.00006151724,0.000016098104],"category_scores_gemma":[0.000014049467,0.00034752084,0.00012145736,0.0004899487,0.00007264141,0.0003314435,0.0002986229,0.00042855486,0.000016876582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051545835,0.00025000807,0.000090719055,0.00007675653,0.00007545057,0.0000016643529,0.00432039,0.9592874,0.015466161,0.00009758057,0.0010617364,0.019267002],"study_design_scores_gemma":[0.0011019001,0.000019955121,0.000019528181,0.000030320502,0.000027860204,0.000013259122,0.0020164312,0.9692743,0.00043717888,0.000003953525,0.026680663,0.00037465146],"about_ca_topic_score_codex":0.000037042308,"about_ca_topic_score_gemma":0.0002604804,"teacher_disagreement_score":0.35402733,"about_ca_system_score_codex":0.00039593017,"about_ca_system_score_gemma":0.0000133178755,"threshold_uncertainty_score":0.99989766},"labels":[],"label_agreement":null},{"id":"W3187112037","doi":"10.1109/lwc.2021.3102189","title":"Downlink Multi-Carrier NOMA With Opportunistic Bandwidth Allocations","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","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":"Memorial University of Newfoundland","funders":"","keywords":"Noma; Bandwidth (computing); Computer science; Telecommunications link; Bandwidth allocation; Convexity; Dynamic bandwidth allocation; Wireless; Computer network; Maximization; Wireless network; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.034090108744700316,"score_gpt":0.2535972353987007,"score_spread":0.2195071266540004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187112037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0941557,0.0019962976,0.88229054,0.014737746,0.00029119186,0.0005301686,0.00019711608,0.0034263923,0.0023748367],"genre_scores_gemma":[0.88677025,0.002488836,0.10905529,0.0006871666,0.000022322658,0.00038431602,0.00034879116,0.000097812335,0.00014522613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840796,0.00013275529,0.00048891676,0.00033033956,0.00022790454,0.00041212738],"domain_scores_gemma":[0.9935828,0.00033377882,0.00011667317,0.005568002,0.0002676738,0.00013106885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000119578195,0.00033522834,0.00034151174,0.00020272106,0.00048604346,0.000113013484,0.00202161,0.00014518073,0.00003791155],"category_scores_gemma":[0.000055815628,0.0003558734,0.000088386114,0.00083521707,0.0006218153,0.00037865486,0.00030715816,0.00072328484,0.00007004712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028264942,0.0010387383,0.0045388676,0.00030022982,0.0011107519,0.00013530071,0.0022743521,0.23457126,0.5824241,0.040744446,0.010079421,0.12275428],"study_design_scores_gemma":[0.00497438,0.00009795359,0.007655912,0.000863144,0.00033275026,0.00044728976,0.0042797215,0.66719204,0.12530257,0.00070839806,0.18385118,0.0042946553],"about_ca_topic_score_codex":0.000016202432,"about_ca_topic_score_gemma":0.0002862322,"teacher_disagreement_score":0.7926145,"about_ca_system_score_codex":0.000202514,"about_ca_system_score_gemma":0.0001048274,"threshold_uncertainty_score":0.9998893},"labels":[],"label_agreement":null},{"id":"W3198091448","doi":"10.1109/lwc.2021.3110305","title":"Deep Learning-Based RIS Channel Extrapolation With Element-Grouping","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Channel (broadcasting); Overhead (engineering); Interference (communication); Extrapolation; Cascade; Element (criminal law); Wireless; Wireless network; Electronic engineering; Computer network; Artificial intelligence; Telecommunications; Engineering; Mathematics","score_opus":0.017006183769322582,"score_gpt":0.23399852847424987,"score_spread":0.2169923447049273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198091448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075078264,0.001803834,0.91527367,0.0048102047,0.0001000567,0.00024677144,0.000005939151,0.0021441558,0.00053712126],"genre_scores_gemma":[0.95663244,0.0014561916,0.040868286,0.00041303408,0.000022862587,0.00028338702,0.00020957517,0.000094624804,0.000019615192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984799,0.0001850613,0.00041382233,0.0002817293,0.00024618919,0.00039332203],"domain_scores_gemma":[0.9962822,0.0003264737,0.00014404576,0.003021024,0.00015837396,0.000067839064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014986846,0.00028904574,0.00027586275,0.00024147755,0.0005066196,0.00009285675,0.0012950272,0.00012267951,0.000021480757],"category_scores_gemma":[0.000035554705,0.0003262018,0.00007999666,0.00083866046,0.00029296128,0.00034169544,0.0001670632,0.00082238426,0.000035590703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066279176,0.00007098866,0.0007542186,0.00004814284,0.00008404699,0.0000057572697,0.00031441764,0.92623085,0.052038137,0.0006545293,0.0001479589,0.019644314],"study_design_scores_gemma":[0.0006978027,0.00002585391,0.00083841773,0.0001536253,0.000030014635,0.000013538939,0.0007972732,0.9357705,0.05518554,0.000092266615,0.005836534,0.0005586288],"about_ca_topic_score_codex":0.000014175941,"about_ca_topic_score_gemma":0.0001970048,"teacher_disagreement_score":0.8815542,"about_ca_system_score_codex":0.00021601141,"about_ca_system_score_gemma":0.0000313991,"threshold_uncertainty_score":0.999919},"labels":[],"label_agreement":null},{"id":"W3198555314","doi":"10.1109/lwc.2021.3107731","title":"Evolution Strategies for Lightwave Power Transfer Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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":"Université du Québec à Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Heuristic; Context (archaeology); Transfer of learning; Mathematical optimization; Artificial intelligence; Power (physics); Mathematics","score_opus":0.01641084505397546,"score_gpt":0.22763809955846534,"score_spread":0.21122725450448987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198555314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15044765,0.001577236,0.84274954,0.0013116747,0.00087065145,0.00020803731,0.000018841954,0.00069188233,0.0021244932],"genre_scores_gemma":[0.9899258,0.0003925898,0.008409911,0.0005208529,0.00018537574,0.00027332752,0.00013437527,0.00009864262,0.000059153597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867755,0.00011641365,0.0003877316,0.00024669993,0.0001399679,0.00043161225],"domain_scores_gemma":[0.99769163,0.000420914,0.000030787793,0.0016320988,0.00013894188,0.000085633146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015660375,0.0002504532,0.0002560311,0.000082906205,0.00029684388,0.00015765056,0.0007355522,0.0001764107,0.000015821224],"category_scores_gemma":[0.000010500131,0.0002985815,0.00015034789,0.0003963935,0.00016799424,0.00032384208,0.000050720733,0.00043846486,0.00000977452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004888451,0.00004311198,0.00008154319,0.000035965513,0.00009708097,0.0000040160526,0.00026251332,0.9234377,0.039816506,0.028827744,0.0063247704,0.0010641745],"study_design_scores_gemma":[0.00060368405,0.000018626017,0.0006124837,0.00020581906,0.000066999244,0.000024813628,0.00033627986,0.97852486,0.0042213025,0.00036960564,0.014369785,0.0006457377],"about_ca_topic_score_codex":0.000014544038,"about_ca_topic_score_gemma":0.00022914438,"teacher_disagreement_score":0.83947814,"about_ca_system_score_codex":0.00016510881,"about_ca_system_score_gemma":0.00005997508,"threshold_uncertainty_score":0.99994665},"labels":[],"label_agreement":null},{"id":"W3207982743","doi":"10.1109/lwc.2021.3123568","title":"Ultraviolet Communications for Unmanned Aerial Vehicle Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Optical Wireless Communication Technologies","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 Alberta","funders":"","keywords":"Non-line-of-sight propagation; Telecommunications link; Computer science; Real-time computing; Interference (communication); Wireless sensor network; Transmission (telecommunications); Bit error rate; Wireless; Computer network; Telecommunications; Decoding methods","score_opus":0.0272840163053653,"score_gpt":0.2605116811310224,"score_spread":0.2332276648256571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207982743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40645617,0.016580394,0.45514473,0.1014046,0.002195895,0.002545376,0.00044525854,0.008741096,0.0064864773],"genre_scores_gemma":[0.9421499,0.0073662307,0.04788292,0.0009910265,0.00008181528,0.0008692145,0.0005087342,0.000110273046,0.000039888557],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805975,0.00023222023,0.0006801915,0.00030490733,0.0001803797,0.00054252736],"domain_scores_gemma":[0.98963857,0.0012556829,0.00011479829,0.008605576,0.0002655709,0.00011979296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026796584,0.00032475416,0.0004165393,0.00014804807,0.0006900349,0.0001758868,0.0044884933,0.00026236838,0.000015269121],"category_scores_gemma":[0.000114467075,0.0003947944,0.00020970067,0.00073474145,0.0007760962,0.00027282932,0.00069280784,0.0007909648,0.000053217685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060566414,0.0010944157,0.0009933389,0.00021517742,0.0008545574,0.000008215937,0.00094701565,0.07367951,0.61114025,0.12385601,0.04265151,0.14449942],"study_design_scores_gemma":[0.0015879554,0.000036216017,0.0007252525,0.00017665589,0.00009992492,0.000021050791,0.0006066941,0.86296386,0.050194565,0.00083103654,0.08168306,0.0010737007],"about_ca_topic_score_codex":0.000015946856,"about_ca_topic_score_gemma":0.00013909287,"teacher_disagreement_score":0.78928435,"about_ca_system_score_codex":0.00019039215,"about_ca_system_score_gemma":0.000050213443,"threshold_uncertainty_score":0.9998504},"labels":[],"label_agreement":null},{"id":"W3211182027","doi":"10.1109/lwc.2021.3124298","title":"Multi-Pair Two-Way Massive MIMO DF Relaying Over Rician Fading Channels Under Imperfect CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Engineering and Physical Sciences Research Council; European Research Council; Southeast University; National Natural Science Foundation of China","keywords":"Rician fading; Relay; Computer science; MIMO; Fading; Channel state information; Context (archaeology); Channel (broadcasting); Spectral efficiency; Imperfect; Maximal-ratio combining; Topology (electrical circuits); Telecommunications; Power (physics); Mathematics; Wireless; Physics","score_opus":0.02432443683960801,"score_gpt":0.2669311821798236,"score_spread":0.2426067453402156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211182027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23669864,0.0013526079,0.7561294,0.0024506592,0.0012253295,0.00044759244,0.000026323483,0.0008523197,0.00081713323],"genre_scores_gemma":[0.9598931,0.00030282795,0.038314983,0.0007880952,0.00013363882,0.00017147708,0.00010749235,0.00014143375,0.00014697337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982463,0.0002471969,0.00051272643,0.00034725334,0.00017630572,0.00047021976],"domain_scores_gemma":[0.9972769,0.00032377118,0.00014302903,0.002016392,0.00012790144,0.0001119791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018306346,0.00032922957,0.00035439074,0.00021646215,0.0004444835,0.00012013946,0.00073265244,0.00013527238,0.000020837968],"category_scores_gemma":[0.00003737213,0.00039940083,0.00014362087,0.0006868942,0.000113536036,0.0005190118,0.00018023262,0.0005573194,0.00007355615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016004867,0.00003260612,0.00022661469,0.00003928883,0.00009047404,0.000009985125,0.00084190915,0.73945326,0.257636,0.0002466511,0.0005887376,0.000832882],"study_design_scores_gemma":[0.0011916329,0.000008283094,0.00037093964,0.00035609008,0.000061841034,0.000033349967,0.0008806766,0.96459866,0.030055135,0.000027545837,0.0016786287,0.0007372439],"about_ca_topic_score_codex":0.00006656273,"about_ca_topic_score_gemma":0.00013136442,"teacher_disagreement_score":0.7231944,"about_ca_system_score_codex":0.0004832062,"about_ca_system_score_gemma":0.000031380125,"threshold_uncertainty_score":0.9998458},"labels":[],"label_agreement":null},{"id":"W3212374164","doi":"10.1109/lwc.2021.3125625","title":"Age- and Correlation-Aware Information Gathering","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Age of Information Optimization","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Metric (unit); Set (abstract data type); Ant colony optimization algorithms; Correlation; Optimization problem; Process (computing); Data mining; Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.014406053489598707,"score_gpt":0.22794838047702304,"score_spread":0.21354232698742434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212374164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016554894,0.000055707074,0.970164,0.010723227,0.00019462481,0.000124444,0.0000034480938,0.00022245011,0.0019571953],"genre_scores_gemma":[0.84880066,0.0002501293,0.14640991,0.004279642,0.00001851452,0.000041862444,0.00013133691,0.000008826896,0.000059134287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908316,0.00009548529,0.00035553673,0.00012151107,0.00019611133,0.00014819251],"domain_scores_gemma":[0.9979977,0.00013477393,0.00018248435,0.0014306875,0.00019295156,0.00006139987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016078522,0.000112049296,0.00010958681,0.00013422409,0.00038270457,0.00043895602,0.00086713623,0.000055208184,0.000007902207],"category_scores_gemma":[0.000036158614,0.00012916968,0.000034172437,0.00046337827,0.000092593385,0.0034544407,0.0003641376,0.00018005744,0.00007950306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012054307,0.00021785071,0.0035375168,0.00020215008,0.00018371824,0.000049800536,0.03950368,0.18987262,0.010786062,0.3067958,0.016188588,0.43265015],"study_design_scores_gemma":[0.00035549048,0.000006766236,0.0025619445,0.00005361002,0.000007237432,0.00005323065,0.00029804037,0.9852542,0.0008221233,0.00016325573,0.010172549,0.00025155072],"about_ca_topic_score_codex":0.000014485895,"about_ca_topic_score_gemma":0.000011747486,"teacher_disagreement_score":0.83224577,"about_ca_system_score_codex":0.000065444634,"about_ca_system_score_gemma":0.000056890458,"threshold_uncertainty_score":0.52673864},"labels":[],"label_agreement":null},{"id":"W3212559433","doi":"10.1109/lwc.2021.3108036","title":"NOMA Computation Over Multi-Access Channels for Multimodal Sensing","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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; Polytechnique Montréal; University of Ottawa","funders":"","keywords":"Computation; Noma; Wireless sensor network; Channel (broadcasting); Mean squared error; Computer science; Decoding methods; Algorithm; Topology (electrical circuits); Mathematics; Mathematical optimization; Telecommunications link; Telecommunications; Computer network; Statistics; Combinatorics","score_opus":0.04530520252195038,"score_gpt":0.2986479517448956,"score_spread":0.25334274922294525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212559433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41401914,0.00024144414,0.5829797,0.00092306355,0.0009802788,0.00021839689,0.00001875401,0.0005191329,0.0001000855],"genre_scores_gemma":[0.88831186,0.00010665527,0.11016447,0.0007297211,0.00021251936,0.00008182763,0.00025428753,0.000107275075,0.000031399155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986151,0.00013024718,0.00041962526,0.00028832027,0.0001526271,0.00039411584],"domain_scores_gemma":[0.9978178,0.00063406595,0.00009730213,0.0011863252,0.000171958,0.00009252127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015617658,0.0002584111,0.0002837675,0.00011990019,0.0003506221,0.00024416108,0.0007297443,0.00013246069,0.000003631691],"category_scores_gemma":[0.000037926708,0.0003298056,0.00012410484,0.00039649173,0.00013799137,0.00035486015,0.00017153783,0.00034396938,0.000009311236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034607103,0.000051083356,0.00027266878,0.000071674396,0.0000849718,0.000006942179,0.000273258,0.92577904,0.057522293,0.00016638805,0.0018786356,0.013889552],"study_design_scores_gemma":[0.0007240071,0.000004348173,0.00094745413,0.00015427341,0.00002809461,0.000015566697,0.00003777147,0.9857651,0.010269324,0.0000207537,0.0016627334,0.00037055343],"about_ca_topic_score_codex":0.000058696558,"about_ca_topic_score_gemma":0.00025012204,"teacher_disagreement_score":0.4742927,"about_ca_system_score_codex":0.00015411012,"about_ca_system_score_gemma":0.000033416,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W3214808368","doi":"10.1109/lwc.2021.3131848","title":"On the Design of Channel Coding Autoencoders With Arbitrary Rates for ISI Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Signal Modulation Classification","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoencoder; Additive white Gaussian noise; Transmitter; Computer science; Algorithm; Convolutional code; Low-density parity-check code; Channel (broadcasting); Encoder; Coding (social sciences); Intersymbol interference; Decoding methods; Electronic engineering; Telecommunications; Deep learning; Mathematics; Artificial intelligence; Statistics; Engineering","score_opus":0.08187394098894299,"score_gpt":0.28933101253657845,"score_spread":0.20745707154763546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214808368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011719948,0.00007303071,0.92086095,0.066361345,0.00017208759,0.0005904811,0.000009033872,0.00010402234,0.000109098],"genre_scores_gemma":[0.9236893,0.000070181595,0.073019095,0.002698869,0.000031783984,0.00041414937,0.000022070737,0.000025294361,0.00002927194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820477,0.0004756987,0.0003777481,0.00036894417,0.0003114343,0.000261397],"domain_scores_gemma":[0.9938652,0.0028488005,0.0003239848,0.0025795593,0.00032666017,0.000055823282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224651,0.00019357493,0.00023120907,0.00014257891,0.00057578157,0.00015745735,0.0022016047,0.00006079774,0.0000030949368],"category_scores_gemma":[0.000076482465,0.00015271986,0.00008741009,0.00073500857,0.00026878048,0.0003714086,0.00014405181,0.00022517033,0.000008317678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050489758,0.00033721418,0.000030431542,0.000053124997,0.00019092932,0.00000376992,0.0026326722,0.28121352,0.12067963,0.58932054,0.0034644825,0.0020231635],"study_design_scores_gemma":[0.00036778935,0.00006141485,0.00014510754,0.00014999436,0.000018839188,0.000008114736,0.00015121882,0.9123549,0.08394116,0.002382635,0.00020446589,0.0002143791],"about_ca_topic_score_codex":0.000011521394,"about_ca_topic_score_gemma":0.000007520894,"teacher_disagreement_score":0.91196936,"about_ca_system_score_codex":0.0000720041,"about_ca_system_score_gemma":0.00014734894,"threshold_uncertainty_score":0.6227735},"labels":[],"label_agreement":null},{"id":"W3216949739","doi":"10.1109/lwc.2021.3130169","title":"Exploiting RIS for Limiting Information Leakage to Active Eavesdropper in Cell-Free Massive MIMO","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":42,"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; Robustness (evolution); Secrecy; Spoofing attack; Boosting (machine learning); Information leakage; Limiting; MIMO; Telecommunications link; Computer network; Distributed computing; Computer security; Engineering; Channel (broadcasting); Artificial intelligence","score_opus":0.0215606033871614,"score_gpt":0.24829852958767573,"score_spread":0.22673792620051433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216949739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6329221,0.00044779322,0.3442827,0.017300423,0.00023283654,0.00097529823,0.00015826788,0.001225276,0.0024552802],"genre_scores_gemma":[0.8988909,0.00058453303,0.09821999,0.0009852452,0.000023338318,0.0010756511,0.00014599439,0.000059868624,0.0000144516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984149,0.00010442726,0.00063529407,0.00021946488,0.00017698643,0.00044895397],"domain_scores_gemma":[0.9954375,0.0007607389,0.00016012657,0.0033739558,0.00019490985,0.00007278265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001760731,0.0002657643,0.00031320326,0.00042370602,0.00031117816,0.000101715494,0.0020370607,0.00014389768,0.0000055555006],"category_scores_gemma":[0.00031541198,0.0003416704,0.00010033324,0.0008385769,0.00012170055,0.0007782809,0.00063787604,0.0006098104,0.00004319974],"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.000028820745,0.00015196539,0.00044638294,0.00027183443,0.00009341788,0.0000063947036,0.008089265,0.41309828,0.40217006,0.0050726812,0.0050384174,0.16553248],"study_design_scores_gemma":[0.0021942286,0.00003995413,0.0012116296,0.0005498872,0.000031920692,0.000010686732,0.021433165,0.16636015,0.77972233,0.00089941354,0.026218206,0.0013284143],"about_ca_topic_score_codex":0.000023248194,"about_ca_topic_score_gemma":0.00015842349,"teacher_disagreement_score":0.37755227,"about_ca_system_score_codex":0.00041119545,"about_ca_system_score_gemma":0.000039564777,"threshold_uncertainty_score":0.99990356},"labels":[],"label_agreement":null},{"id":"W4200632245","doi":"10.1109/lwc.2021.3132255","title":"Favorable Propagation for Massive MIMO With Circular and Cylindrical Antenna Arrays","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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 Ottawa","funders":"","keywords":"Kronecker delta; Bessel function; MIMO; Antenna (radio); Interference (communication); Topology (electrical circuits); Mathematical analysis; Mathematics; Physics; Computer science; Telecommunications; Channel (broadcasting); Combinatorics","score_opus":0.016126577264174262,"score_gpt":0.22822216042916044,"score_spread":0.21209558316498617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200632245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04943882,0.0004542842,0.9468957,0.0022614158,0.00009592839,0.00046841303,0.00001886424,0.00019859328,0.00016793855],"genre_scores_gemma":[0.92254275,0.00023647644,0.07645614,0.00020067948,0.000037647285,0.00031125895,0.00013483531,0.000054474007,0.00002573163],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992272,0.000060576152,0.00022916502,0.00019597635,0.00008991988,0.00019712669],"domain_scores_gemma":[0.998699,0.0001274871,0.00006600754,0.00088719727,0.00016352728,0.000056757643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007851161,0.00014825,0.0001899834,0.000069982234,0.00020703717,0.000060552702,0.00022940406,0.00006282217,0.0000016841964],"category_scores_gemma":[0.000020054205,0.0001545506,0.000033251767,0.00027029586,0.00010420379,0.00025241385,0.00003202872,0.00016237906,0.000003932383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014077353,0.00006589072,0.00047033583,0.00028766543,0.00014053713,0.0000092042,0.0008276155,0.36050087,0.63319933,0.0014792078,0.00047975537,0.0025255173],"study_design_scores_gemma":[0.0008899017,0.00002563355,0.00015114721,0.00019821097,0.000058729664,0.000049968832,0.0004719106,0.9718603,0.024335798,0.00006931098,0.0015018171,0.0003872582],"about_ca_topic_score_codex":0.0000059225263,"about_ca_topic_score_gemma":0.000027826161,"teacher_disagreement_score":0.8731039,"about_ca_system_score_codex":0.00009813027,"about_ca_system_score_gemma":0.000029371093,"threshold_uncertainty_score":0.630239},"labels":[],"label_agreement":null},{"id":"W4205434634","doi":"10.1109/lwc.2021.3139024","title":"MSE-Based Joint Transceiver and Passive Beamforming Designs for Intelligent Reflecting Surface-Aided MIMO Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Kingston Health Sciences Centre; Queen's University","funders":"Institute for Information and Communications Technology Promotion; National Research Foundation","keywords":"Beamforming; MIMO; Mean squared error; Transceiver; Computer science; Minification; Minimum mean square error; Algorithm; Filter (signal processing); Control theory (sociology); Mathematical optimization; Mathematics; Telecommunications; Wireless; Artificial intelligence; Statistics; Computer vision","score_opus":0.09376458531483889,"score_gpt":0.29933937694475526,"score_spread":0.20557479162991638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205434634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17361428,0.002552393,0.8174776,0.004378585,0.00021827398,0.00065798365,0.00004124451,0.00097468443,0.00008495763],"genre_scores_gemma":[0.8731355,0.0016557745,0.124366276,0.00023597461,0.000018941257,0.00040253936,0.000079089536,0.00008648559,0.00001940187],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983043,0.00015947036,0.0006344246,0.00032272795,0.00016621636,0.0004128267],"domain_scores_gemma":[0.99609077,0.00092401815,0.0001628907,0.0025337667,0.00020611491,0.00008246014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021552942,0.00031119047,0.00042014715,0.00017487313,0.0005399268,0.00012842003,0.0009691939,0.00016204761,0.0000029475189],"category_scores_gemma":[0.00008252884,0.00036174696,0.0001284565,0.00042432913,0.00030107374,0.00026430207,0.0001243746,0.0005262103,0.0000057395637],"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.0000073847345,0.00004898336,0.00011066542,0.00021938329,0.000112407055,0.0000027132248,0.00060704903,0.43168202,0.5552879,0.0015100295,0.00030911752,0.010102378],"study_design_scores_gemma":[0.0006973796,0.000028910337,0.000060536287,0.0004664772,0.00005792186,0.000021264668,0.0025698086,0.46627882,0.52397466,0.0001832019,0.0050227116,0.00063831353],"about_ca_topic_score_codex":0.000034487202,"about_ca_topic_score_gemma":0.00008254621,"teacher_disagreement_score":0.69952124,"about_ca_system_score_codex":0.00029216002,"about_ca_system_score_gemma":0.000053510084,"threshold_uncertainty_score":0.9998835},"labels":[],"label_agreement":null},{"id":"W4205471910","doi":"10.1109/lwc.2022.3140223","title":"Low-Density Spreading Design Based on an Algebraic Scheme for NOMA Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Additive white Gaussian noise; Bit error rate; Rayleigh fading; Algorithm; Computer science; Algebraic number; Noma; Code (set theory); Code division multiple access; Fading; Mathematics; Set (abstract data type); Decoding methods; White noise; Telecommunications; Telecommunications link","score_opus":0.036642688004987656,"score_gpt":0.25753575582970184,"score_spread":0.22089306782471418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205471910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18714814,0.00024827995,0.8062213,0.0022646075,0.00037963837,0.0011681401,0.00007780911,0.0023790435,0.0001130368],"genre_scores_gemma":[0.9414021,0.00006912786,0.054918252,0.0006436477,0.000028278959,0.0026399218,0.00016735605,0.000119407945,0.000011953407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981213,0.00038934694,0.00045623002,0.00033307952,0.00028371523,0.00041631586],"domain_scores_gemma":[0.9936383,0.0010061234,0.00015555717,0.0050440924,0.000074679934,0.00008127028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005355601,0.00030291008,0.0003362011,0.00039018458,0.0011520995,0.00008896744,0.003265889,0.00009296429,0.000008678133],"category_scores_gemma":[0.000045550256,0.000381951,0.00010630549,0.0005377039,0.00021746522,0.00027536566,0.00030932607,0.00074072054,0.000016404887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025163074,0.0001510743,0.00008903409,0.000051297815,0.000037762977,0.0000014870897,0.00015224336,0.88637894,0.10405713,0.0033548113,0.0013934046,0.004307646],"study_design_scores_gemma":[0.00052062905,0.00008593604,0.000068361966,0.000056403584,0.0000126199075,0.0000058040814,0.0004156331,0.97347325,0.022123085,0.00010084181,0.002693836,0.00044359456],"about_ca_topic_score_codex":0.000021860575,"about_ca_topic_score_gemma":0.000009911551,"teacher_disagreement_score":0.7542539,"about_ca_system_score_codex":0.000552155,"about_ca_system_score_gemma":0.000040721032,"threshold_uncertainty_score":0.99986327},"labels":[],"label_agreement":null},{"id":"W4206866472","doi":"10.1109/lwc.2022.3153927","title":"A Gridless Fourth-Order Cumulant-Based DOA Estimation Method Under Unknown Colored Noise","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Algorithm; Redundancy (engineering); Computer science; Colors of noise; Gaussian noise; Minification; Direction of arrival; Rotational invariance; Gaussian; Colored; Noise (video); Mathematical optimization; Mathematics; Noise reduction; Artificial intelligence; Telecommunications","score_opus":0.03150678632848905,"score_gpt":0.31368492653889773,"score_spread":0.28217814021040866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206866472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017884865,0.000031010703,0.961913,0.018260414,0.00035218717,0.000531542,0.000024294219,0.00071373495,0.00028893343],"genre_scores_gemma":[0.42700848,0.000008492802,0.57089907,0.0014937428,0.000009324707,0.00048450526,0.000052678773,0.000022557426,0.000021134316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970013,0.0010514123,0.0006291915,0.00042582676,0.00059862505,0.00029367438],"domain_scores_gemma":[0.9950737,0.00092428166,0.0005108385,0.0031343747,0.0002685233,0.000088311535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009540473,0.00023971534,0.00033239962,0.0005233599,0.0008094739,0.00013399775,0.0036158676,0.000064924294,0.000027757405],"category_scores_gemma":[0.00006371713,0.0002783456,0.0001385852,0.0017295667,0.0002119177,0.00054893544,0.0007378662,0.00046480141,0.000014972421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023028942,0.000481486,0.00009481756,0.000042557444,0.00006829892,0.000003476423,0.0009970831,0.8642604,0.050710607,0.044462018,0.0030886033,0.03576765],"study_design_scores_gemma":[0.0004432865,0.000052960557,0.00019934378,0.000035471356,0.000025618143,0.000017839133,0.000048899405,0.97315115,0.023011163,0.001072594,0.001645185,0.00029649597],"about_ca_topic_score_codex":0.00034479794,"about_ca_topic_score_gemma":0.000041244148,"teacher_disagreement_score":0.4091236,"about_ca_system_score_codex":0.00032072232,"about_ca_system_score_gemma":0.0002325823,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W4206969593","doi":"10.1109/lwc.2021.3105859","title":"IEEE Wireless Communications Letters","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Canadian Standards Association","funders":"","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.07237867976110617,"score_gpt":0.24883961438610994,"score_spread":0.17646093462500378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206969593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67438364,0.0064431643,0.009825347,0.12671053,0.007671453,0.00081688154,0.001915195,0.0005169237,0.17171688],"genre_scores_gemma":[0.97008747,0.0045019793,0.0052668517,0.009413111,0.0001458056,0.00020308614,0.00021252877,0.000070569346,0.010098597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974759,0.00013560981,0.0010265601,0.0007059929,0.00008551386,0.0005703767],"domain_scores_gemma":[0.9926851,0.0003367593,0.00052286737,0.006199721,0.000103144615,0.00015243968],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065651076,0.00031712136,0.0006509779,0.00030460776,0.0011204244,0.00031134425,0.0032372808,0.00011085809,0.0006707439],"category_scores_gemma":[0.000046166082,0.00042188787,0.00030820648,0.00067256275,0.0010627811,0.0005015172,0.0008482887,0.00049046037,0.008507967],"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.000017983153,0.0009456334,0.014332597,0.000082222556,0.0009561646,0.000023231414,0.0055013336,0.00064021983,0.025390003,0.22213288,0.7259322,0.004045535],"study_design_scores_gemma":[0.001758971,0.00001902804,0.0034971838,0.00013399059,0.000086316446,0.00003607427,0.0023587947,0.014988494,0.0025040996,0.0011357954,0.9718548,0.0016264411],"about_ca_topic_score_codex":0.00035715316,"about_ca_topic_score_gemma":0.0002325276,"teacher_disagreement_score":0.29570386,"about_ca_system_score_codex":0.00029407706,"about_ca_system_score_gemma":0.000050641862,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W4210380051","doi":"10.1109/lwc.2022.3146251","title":"Performance Analysis for Rate Splitting Uplink NOMA Transmission in High Throughput Satellite Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications","keywords":"Telecommunications link; Rician fading; Noma; Computer science; Throughput; Fading; Transmission (telecommunications); Channel state information; Spectral efficiency; Beamforming; Communications satellite; Bit error rate; Electronic engineering; Channel (broadcasting); Computer network; Satellite; Telecommunications; Wireless; Engineering","score_opus":0.03263083027557444,"score_gpt":0.24867747124916273,"score_spread":0.21604664097358828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210380051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94171745,0.008244227,0.0452586,0.001994479,0.00051580236,0.001227243,0.000059711656,0.0005042127,0.00047829404],"genre_scores_gemma":[0.9892009,0.004267618,0.004168882,0.00020547437,0.00004227383,0.0016175882,0.00036296996,0.00008328381,0.000050992876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974745,0.00057453534,0.00097096944,0.00031889323,0.00023870352,0.00042242798],"domain_scores_gemma":[0.9957318,0.0007757603,0.00019795272,0.003147964,0.00007118158,0.00007537668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001352347,0.00027479316,0.00052161975,0.0006382871,0.00065487646,0.00009976734,0.0021778492,0.00007763153,0.00001249001],"category_scores_gemma":[0.0000076047118,0.00032814406,0.00019644901,0.0019851488,0.000091680195,0.00026199355,0.00019572838,0.00056805456,0.000015903614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031838023,0.00010409435,0.018516567,0.0003168514,0.0005097673,0.0000018316576,0.0032054821,0.90830445,0.04042174,0.0005617192,0.0001305719,0.027895091],"study_design_scores_gemma":[0.0006512301,0.000019632056,0.009063406,0.00008975947,0.00013215467,0.000006226791,0.00058106263,0.94056284,0.0008167943,0.000006758234,0.04761999,0.00045011746],"about_ca_topic_score_codex":0.00021076233,"about_ca_topic_score_gemma":0.00003257439,"teacher_disagreement_score":0.047489416,"about_ca_system_score_codex":0.00050187216,"about_ca_system_score_gemma":0.000027630427,"threshold_uncertainty_score":0.9999171},"labels":[],"label_agreement":null},{"id":"W4210698675","doi":"10.1109/lwc.2022.3146207","title":"Digital Twin-Aided Intelligent Offloading With Edge Selection in Mobile Edge Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":145,"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; Royal Academy of Engineering; Ho Chi Minh City University of Technology and Education","keywords":"Computer science; Server; Mobile edge computing; Latency (audio); Edge computing; Computation offloading; Cloud computing; Computer network; Distributed computing; Operating system","score_opus":0.022291092435623407,"score_gpt":0.2535970482659557,"score_spread":0.23130595583033228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210698675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7165151,0.00015503415,0.2784841,0.0018151455,0.0014774522,0.00040905504,0.0000010837016,0.00034121898,0.0008017696],"genre_scores_gemma":[0.9891268,0.000011697004,0.0095180115,0.0008927274,0.00023991487,0.00011587097,0.000019611354,0.00003080878,0.000044536802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978671,0.00029982167,0.00049372925,0.0004744456,0.00035399236,0.000510889],"domain_scores_gemma":[0.99795765,0.00038735342,0.00022828225,0.0012710851,0.000071429036,0.000084201594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005221553,0.0002354915,0.00026674377,0.00044085467,0.0011378466,0.00038617928,0.002937162,0.000037774265,0.0000032080904],"category_scores_gemma":[0.000011763112,0.0002599442,0.00008418838,0.0017129717,0.0001294521,0.00062867056,0.0015037104,0.0008023246,0.000031278654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006620876,0.0015767916,0.05046499,0.000091589776,0.00020224605,0.00006891898,0.031696998,0.16817024,0.036187496,0.0032912644,0.017453346,0.6907299],"study_design_scores_gemma":[0.00088258524,0.00022637322,0.0023199248,0.00015534801,0.00001489004,0.0001902705,0.00087554095,0.9413331,0.0031776468,0.00009006577,0.04981419,0.00092004647],"about_ca_topic_score_codex":0.000065079264,"about_ca_topic_score_gemma":0.00001660799,"teacher_disagreement_score":0.7731629,"about_ca_system_score_codex":0.0005141083,"about_ca_system_score_gemma":0.00010642826,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W4214911960","doi":"10.1109/lwc.2022.3155610","title":"Improved Pilot Designs for Enhancing Connectivity in Multicarrier Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Spectral efficiency; Overhead (engineering); MIMO-OFDM; Orthogonal frequency-division multiplexing; Guard interval; Channel (broadcasting); Computer engineering; Multiplexing; Electronic engineering; Computer network; Telecommunications; Engineering","score_opus":0.033029610009776667,"score_gpt":0.2595386825299865,"score_spread":0.22650907252020985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214911960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11960263,0.00031424037,0.8767323,0.00052646414,0.0007061546,0.001627236,0.00009866387,0.00031888354,0.00007341924],"genre_scores_gemma":[0.9850051,0.000026898875,0.010734956,0.00012120998,0.000041359355,0.0038943025,0.00006873666,0.00008264535,0.000024808085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985843,0.00027744556,0.00046454594,0.0002344424,0.00010959469,0.00032969058],"domain_scores_gemma":[0.9978432,0.000685613,0.00012307879,0.0012316318,0.00006123422,0.00005525859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040964637,0.00019235836,0.0002874359,0.00021285188,0.0003964092,0.000041953997,0.0006942875,0.000041232477,0.000004236456],"category_scores_gemma":[0.00005014865,0.00024834363,0.000056010194,0.00037373818,0.00006449432,0.00022477386,0.00011904109,0.00036630264,0.0000026959428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012034959,0.000038029473,0.00005942779,0.00005246152,0.000025060517,7.1663084e-7,0.0004927402,0.62439245,0.37432522,0.00023887579,0.00017061242,0.00019234036],"study_design_scores_gemma":[0.00087370153,0.000046143472,0.00003084743,0.00004791959,0.000016593278,0.0000051583484,0.00103186,0.9894871,0.0075392015,0.000010730258,0.0006070137,0.00030374358],"about_ca_topic_score_codex":0.0001838364,"about_ca_topic_score_gemma":0.0004521148,"teacher_disagreement_score":0.8659974,"about_ca_system_score_codex":0.00071939547,"about_ca_system_score_gemma":0.00003088815,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4226327313","doi":"10.1109/lwc.2022.3169806","title":"On the Achievable Capacity of Cooperative NOMA Networks: RIS or Relay?","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication 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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Noma; Relay; Computer science; Computer network; Telecommunications; Telecommunications link; Power (physics); Physics","score_opus":0.03523073555362313,"score_gpt":0.2413338152780326,"score_spread":0.20610307972440947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226327313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.882737,0.00068743963,0.098896936,0.013853916,0.00031446252,0.00081931776,0.00012383245,0.0011450234,0.0014220852],"genre_scores_gemma":[0.9930673,0.00088310335,0.0041598217,0.0009048523,0.000011503737,0.0008337905,0.000030772422,0.000057408444,0.00005144171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983974,0.00044334732,0.0004467206,0.00018472887,0.00024776184,0.0002800137],"domain_scores_gemma":[0.9936815,0.0016763905,0.00017362903,0.004370226,0.00006516345,0.00003308483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035856318,0.00022528414,0.00028275716,0.00015850912,0.0010221433,0.00002792296,0.0035320295,0.0000644658,0.000094694675],"category_scores_gemma":[0.000080589205,0.00018537811,0.000086274544,0.0009308079,0.00062754034,0.00014642392,0.00066386355,0.0012734283,0.000015281532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024445968,0.00009975153,0.000054737142,0.000009802204,0.00008555163,9.028467e-7,0.0005728737,0.9535594,0.014283448,0.021213427,0.008231659,0.0018639872],"study_design_scores_gemma":[0.00081269786,0.0002065999,0.00031973983,0.00011176568,0.000041440475,0.000024240891,0.0034102425,0.9439136,0.027052974,0.0006056389,0.022684114,0.00081697135],"about_ca_topic_score_codex":0.00004534045,"about_ca_topic_score_gemma":0.00006754259,"teacher_disagreement_score":0.11033032,"about_ca_system_score_codex":0.00026096145,"about_ca_system_score_gemma":0.000023589266,"threshold_uncertainty_score":0.7861603},"labels":[],"label_agreement":null},{"id":"W4232542662","doi":"10.1109/wcl.2014.06.cover3","title":"Staff List","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"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","score_opus":0.028762564597885003,"score_gpt":0.2772185999454572,"score_spread":0.2484560353475722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232542662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93726194,0.000074838346,0.00858198,0.037634645,0.00030070601,0.00033463573,0.00006260992,0.00088562624,0.014863031],"genre_scores_gemma":[0.9906785,0.000028386274,0.0057448326,0.002935701,0.00010395533,0.00012655977,0.000102133316,0.000121667115,0.0001582568],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979392,0.00064866105,0.00038739765,0.0002928752,0.00031728187,0.00041454745],"domain_scores_gemma":[0.9935416,0.00046901868,0.00020263807,0.0055399835,0.00010626946,0.00014051775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005654376,0.00023038006,0.0002516168,0.00021832164,0.000550194,0.00013009472,0.0028403294,0.00007163003,0.0000569718],"category_scores_gemma":[0.00006665583,0.00025289276,0.00011537011,0.00055629254,0.0006667814,0.00028124044,0.0002999727,0.0004454979,0.0036434452],"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.000023961671,0.00058922236,0.004040512,0.000025012276,0.0001107704,0.0000020805458,0.0012959065,0.00063685025,0.771245,0.04426392,0.16325949,0.014507292],"study_design_scores_gemma":[0.0014965609,0.00006585019,0.0033708962,0.00010856145,0.00010127968,0.000026953041,0.00030760668,0.035781007,0.014580647,0.0003507033,0.94265735,0.0011525821],"about_ca_topic_score_codex":0.00023432069,"about_ca_topic_score_gemma":0.00041053697,"teacher_disagreement_score":0.77939785,"about_ca_system_score_codex":0.000166466,"about_ca_system_score_gemma":0.00002861785,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W4240314826","doi":"10.1109/wcl.2013.02.cover2","title":"Staff List","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università di Pisa; Shanghai Jiao Tong University; Queen's University; Korea University; Nanyang Technological University; Indian Institute of Science; National University of Singapore; University College London; Kungliga Tekniska Högskolan; Institute of Electrical and Electronics Engineers; King's College London; Institute for Infocomm Research; Curtin University of Technology; West Virginia University","keywords":"Computer science","score_opus":0.030890283378542646,"score_gpt":0.2722998134844872,"score_spread":0.24140953010594451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240314826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9428563,0.00011081957,0.00086852914,0.047364693,0.00018693044,0.0005992688,0.000049881473,0.00066396006,0.007299632],"genre_scores_gemma":[0.9903201,0.000046921086,0.005704868,0.0028108652,0.00006380216,0.0005263019,0.000099414625,0.00012258314,0.00030513137],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981658,0.0003711017,0.00041372227,0.00028067012,0.00030945227,0.00045925585],"domain_scores_gemma":[0.99405646,0.00029712342,0.00019240096,0.005118204,0.00017345094,0.00016233251],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022526295,0.00023918944,0.00023366256,0.00022432224,0.00050718326,0.00022972842,0.0028614334,0.000073532916,0.00038306974],"category_scores_gemma":[0.000030384452,0.00025407525,0.00011355334,0.0006133289,0.0006879316,0.00061949826,0.00033609694,0.00046289354,0.017414529],"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.000004503743,0.0003553766,0.0025363734,0.000010888982,0.000075376236,0.000001692059,0.0008117163,0.00012576155,0.6886739,0.0045665973,0.2971943,0.0056435075],"study_design_scores_gemma":[0.0043609473,0.00016207511,0.035052393,0.0003562778,0.00027878387,0.00011480437,0.0034507753,0.05649068,0.052300043,0.0013100166,0.84172285,0.0044003623],"about_ca_topic_score_codex":0.0013228925,"about_ca_topic_score_gemma":0.00030823142,"teacher_disagreement_score":0.6363739,"about_ca_system_score_codex":0.00020730414,"about_ca_system_score_gemma":0.000038329224,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W4243354576","doi":"10.1109/wcl.2013.08.cover2","title":"Staff list","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università di Pisa; Shanghai Jiao Tong University; Queen's University; Korea University; Nanyang Technological University; Indian Institute of Science; National University of Singapore; University College London; Kungliga Tekniska Högskolan; Institute of Electrical and Electronics Engineers; King's College London; Institute for Infocomm Research; Curtin University of Technology; West Virginia University","keywords":"Computer science; Computer network","score_opus":0.030890283378542646,"score_gpt":0.2722998134844872,"score_spread":0.24140953010594451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243354576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9428563,0.00011081957,0.00086852914,0.047364693,0.00018693044,0.0005992688,0.000049881473,0.00066396006,0.007299632],"genre_scores_gemma":[0.9903201,0.000046921086,0.005704868,0.0028108652,0.00006380216,0.0005263019,0.000099414625,0.00012258314,0.00030513137],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981658,0.0003711017,0.00041372227,0.00028067012,0.00030945227,0.00045925585],"domain_scores_gemma":[0.99405646,0.00029712342,0.00019240096,0.005118204,0.00017345094,0.00016233251],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022526295,0.00023918944,0.00023366256,0.00022432224,0.00050718326,0.00022972842,0.0028614334,0.000073532916,0.00038306974],"category_scores_gemma":[0.000030384452,0.00025407525,0.00011355334,0.0006133289,0.0006879316,0.00061949826,0.00033609694,0.00046289354,0.017414529],"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.000004503743,0.0003553766,0.0025363734,0.000010888982,0.000075376236,0.000001692059,0.0008117163,0.00012576155,0.6886739,0.0045665973,0.2971943,0.0056435075],"study_design_scores_gemma":[0.0043609473,0.00016207511,0.035052393,0.0003562778,0.00027878387,0.00011480437,0.0034507753,0.05649068,0.052300043,0.0013100166,0.84172285,0.0044003623],"about_ca_topic_score_codex":0.0013228925,"about_ca_topic_score_gemma":0.00030823142,"teacher_disagreement_score":0.6363739,"about_ca_system_score_codex":0.00020730414,"about_ca_system_score_gemma":0.000038329224,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W4244371513","doi":"10.1109/wcl.2013.06.cover2","title":"[Staff list]","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università di Pisa; Shanghai Jiao Tong University; Queen's University; Korea University; Nanyang Technological University; Indian Institute of Science; National University of Singapore; University College London; Kungliga Tekniska Högskolan; Institute of Electrical and Electronics Engineers; King's College London; Institute for Infocomm Research; Curtin University of Technology; West Virginia University","keywords":"Computer science; Computer network","score_opus":0.03079078591610704,"score_gpt":0.27107747347366684,"score_spread":0.2402866875575598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244371513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93806,0.00012960454,0.00092059537,0.05051081,0.00021209112,0.00062544615,0.000038834754,0.0007287351,0.008773926],"genre_scores_gemma":[0.98956865,0.000051328443,0.0060161417,0.0031726097,0.00007107029,0.0005666301,0.00009081766,0.00012727382,0.0003354576],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980999,0.00038094856,0.00042968165,0.00029482634,0.0003138148,0.00048078486],"domain_scores_gemma":[0.99388146,0.00031194778,0.00019775215,0.005266954,0.00017361481,0.00016825543],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023236901,0.00025051428,0.00024461388,0.00024042661,0.00049871666,0.00021766918,0.0029766974,0.000081731625,0.00039004398],"category_scores_gemma":[0.00003301865,0.00026612007,0.00012639943,0.0006491245,0.0006651644,0.00062154443,0.00034592245,0.00048074473,0.019832581],"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.00000436266,0.00033340353,0.0022143414,0.000010588934,0.00007439114,0.0000018131632,0.0008265358,0.000112033136,0.6910885,0.0047812774,0.29430047,0.0062522897],"study_design_scores_gemma":[0.0040647895,0.00014602188,0.029288197,0.0003427783,0.00027536042,0.00013407029,0.002767589,0.05401764,0.052213613,0.0015320287,0.8510011,0.0042168247],"about_ca_topic_score_codex":0.0011267464,"about_ca_topic_score_gemma":0.00022939104,"teacher_disagreement_score":0.6388749,"about_ca_system_score_codex":0.00020499338,"about_ca_system_score_gemma":0.00003826821,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W4245628427","doi":"10.1109/wcl.2014.06.cover2","title":"Staff List","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università degli Studi di Ferrara; National Chiao Tung University; Korea Advanced Institute of Science and Technology; Shanghai Jiao Tong University; Università di Pisa; University of Crete; Kungliga Tekniska Högskolan; Tsinghua University; Bilkent Üniversitesi; Queen's University; Yonsei University; Shanghai Educational Development Foundation; Indian Institute of Science; University College London; Korea University; University of Warwick; King's College London; Università degli Studi di Parma; University of Alberta; Institute for Infocomm Research; Curtin University of Technology; Intel Corporation; West Virginia University","keywords":"Computer science","score_opus":0.028762564597885003,"score_gpt":0.2772185999454572,"score_spread":0.2484560353475722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245628427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93726194,0.000074838346,0.00858198,0.037634645,0.00030070601,0.00033463573,0.00006260992,0.00088562624,0.014863031],"genre_scores_gemma":[0.9906785,0.000028386274,0.0057448326,0.002935701,0.00010395533,0.00012655977,0.000102133316,0.000121667115,0.0001582568],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979392,0.00064866105,0.00038739765,0.0002928752,0.00031728187,0.00041454745],"domain_scores_gemma":[0.9935416,0.00046901868,0.00020263807,0.0055399835,0.00010626946,0.00014051775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005654376,0.00023038006,0.0002516168,0.00021832164,0.000550194,0.00013009472,0.0028403294,0.00007163003,0.0000569718],"category_scores_gemma":[0.00006665583,0.00025289276,0.00011537011,0.00055629254,0.0006667814,0.00028124044,0.0002999727,0.0004454979,0.0036434452],"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.000023961671,0.00058922236,0.004040512,0.000025012276,0.0001107704,0.0000020805458,0.0012959065,0.00063685025,0.771245,0.04426392,0.16325949,0.014507292],"study_design_scores_gemma":[0.0014965609,0.00006585019,0.0033708962,0.00010856145,0.00010127968,0.000026953041,0.00030760668,0.035781007,0.014580647,0.0003507033,0.94265735,0.0011525821],"about_ca_topic_score_codex":0.00023432069,"about_ca_topic_score_gemma":0.00041053697,"teacher_disagreement_score":0.77939785,"about_ca_system_score_codex":0.000166466,"about_ca_system_score_gemma":0.00002861785,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W4246740717","doi":"10.1109/wcl.2014.04.cover2","title":"Staff List","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università di Pisa; Shanghai Jiao Tong University; Queen's University; Korea University; Nanyang Technological University; Indian Institute of Science; National University of Singapore; University College London; Kungliga Tekniska Högskolan; Institute of Electrical and Electronics Engineers; King's College London; Institute for Infocomm Research; Curtin University of Technology; West Virginia University","keywords":"Computer science; Computer network","score_opus":0.028762564597885003,"score_gpt":0.2772185999454572,"score_spread":0.2484560353475722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246740717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93726194,0.000074838346,0.00858198,0.037634645,0.00030070601,0.00033463573,0.00006260992,0.00088562624,0.014863031],"genre_scores_gemma":[0.9906785,0.000028386274,0.0057448326,0.002935701,0.00010395533,0.00012655977,0.000102133316,0.000121667115,0.0001582568],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979392,0.00064866105,0.00038739765,0.0002928752,0.00031728187,0.00041454745],"domain_scores_gemma":[0.9935416,0.00046901868,0.00020263807,0.0055399835,0.00010626946,0.00014051775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005654376,0.00023038006,0.0002516168,0.00021832164,0.000550194,0.00013009472,0.0028403294,0.00007163003,0.0000569718],"category_scores_gemma":[0.00006665583,0.00025289276,0.00011537011,0.00055629254,0.0006667814,0.00028124044,0.0002999727,0.0004454979,0.0036434452],"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.000023961671,0.00058922236,0.004040512,0.000025012276,0.0001107704,0.0000020805458,0.0012959065,0.00063685025,0.771245,0.04426392,0.16325949,0.014507292],"study_design_scores_gemma":[0.0014965609,0.00006585019,0.0033708962,0.00010856145,0.00010127968,0.000026953041,0.00030760668,0.035781007,0.014580647,0.0003507033,0.94265735,0.0011525821],"about_ca_topic_score_codex":0.00023432069,"about_ca_topic_score_gemma":0.00041053697,"teacher_disagreement_score":0.77939785,"about_ca_system_score_codex":0.000166466,"about_ca_system_score_gemma":0.00002861785,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W4247491502","doi":"10.1109/wcl.2014.02.cover2","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Università di Pisa; Shanghai Jiao Tong University; Queen's University; Korea University; Nanyang Technological University; Indian Institute of Science; National University of Singapore; University College London; Kungliga Tekniska Högskolan; Institute of Electrical and Electronics Engineers; King's College London; Institute for Infocomm Research; Curtin University of Technology; West Virginia University","keywords":"Computer science","score_opus":0.028762564597885003,"score_gpt":0.2772185999454572,"score_spread":0.2484560353475722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247491502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93726194,0.000074838346,0.00858198,0.037634645,0.00030070601,0.00033463573,0.00006260992,0.00088562624,0.014863031],"genre_scores_gemma":[0.9906785,0.000028386274,0.0057448326,0.002935701,0.00010395533,0.00012655977,0.000102133316,0.000121667115,0.0001582568],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979392,0.00064866105,0.00038739765,0.0002928752,0.00031728187,0.00041454745],"domain_scores_gemma":[0.9935416,0.00046901868,0.00020263807,0.0055399835,0.00010626946,0.00014051775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005654376,0.00023038006,0.0002516168,0.00021832164,0.000550194,0.00013009472,0.0028403294,0.00007163003,0.0000569718],"category_scores_gemma":[0.00006665583,0.00025289276,0.00011537011,0.00055629254,0.0006667814,0.00028124044,0.0002999727,0.0004454979,0.0036434452],"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.000023961671,0.00058922236,0.004040512,0.000025012276,0.0001107704,0.0000020805458,0.0012959065,0.00063685025,0.771245,0.04426392,0.16325949,0.014507292],"study_design_scores_gemma":[0.0014965609,0.00006585019,0.0033708962,0.00010856145,0.00010127968,0.000026953041,0.00030760668,0.035781007,0.014580647,0.0003507033,0.94265735,0.0011525821],"about_ca_topic_score_codex":0.00023432069,"about_ca_topic_score_gemma":0.00041053697,"teacher_disagreement_score":0.77939785,"about_ca_system_score_codex":0.000166466,"about_ca_system_score_gemma":0.00002861785,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W4285124289","doi":"10.1109/lwc.2022.3173307","title":"A Novel ASAPPP Approach to Characterize the SIR Distribution in General Cellular Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"York University; Ericsson (Canada)","funders":"Dalian Science and Technology Innovation Fund; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Liaoning Revitalization Talents Program; National Natural Science Foundation of China","keywords":"Computer science; Poisson distribution; Point process; Cellular network; Coverage probability; Stochastic geometry; Poisson point process; Interference (communication); Simple (philosophy); Mathematical optimization; Key (lock); Probability distribution; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.02114213325877405,"score_gpt":0.21504770443031032,"score_spread":0.19390557117153628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285124289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12115184,0.00012936402,0.8758213,0.0015770739,0.0002859112,0.00059325114,0.00009168458,0.000179061,0.00017050924],"genre_scores_gemma":[0.99018574,0.00003847505,0.0067179035,0.0006284208,0.000079852776,0.0012669301,0.0010097455,0.000048294223,0.00002464817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889976,0.00016644235,0.00033836492,0.00017929476,0.00014108614,0.0002750792],"domain_scores_gemma":[0.9983935,0.00007652599,0.00006773525,0.0013876597,0.000028152213,0.000046474805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894441,0.00015795298,0.00016842752,0.000083740255,0.00038325292,0.000043631462,0.001080616,0.000039836854,0.000003377853],"category_scores_gemma":[0.000007666057,0.00016395905,0.000044744615,0.0008746424,0.00005374324,0.00013100069,0.0002391373,0.00050096505,0.000005017359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003702267,0.00005888333,0.000059139045,0.000006961812,0.000012689672,3.8476435e-7,0.0004193321,0.907682,0.08954109,0.0005627977,0.0010289329,0.0006241009],"study_design_scores_gemma":[0.00024331725,0.000005618072,0.0006453384,0.0000111833215,0.0000074291256,0.000008739884,0.00015499514,0.9911878,0.0003418883,0.0000023765315,0.007184072,0.00020724363],"about_ca_topic_score_codex":0.00008250299,"about_ca_topic_score_gemma":0.000021473514,"teacher_disagreement_score":0.8691034,"about_ca_system_score_codex":0.00041464932,"about_ca_system_score_gemma":0.000011429492,"threshold_uncertainty_score":0.66860557},"labels":[],"label_agreement":null},{"id":"W4285284453","doi":"10.1109/lwc.2022.3175147","title":"A Distortion Nullforming Precoder in Massive MIMO Systems With Nonlinear Hardware","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Ericsson (Canada)","funders":"","keywords":"Precoding; MIMO; Distortion (music); Nonlinear distortion; Computer science; Nonlinear system; Electronic engineering; Envelope (radar); Antenna (radio); SIGNAL (programming language); Transmission (telecommunications); Line-of-sight; Control theory (sociology); Topology (electrical circuits); Telecommunications; Channel (broadcasting); Physics; Electrical engineering; Engineering; Bandwidth (computing); Artificial intelligence","score_opus":0.0132052497345853,"score_gpt":0.22080504050446223,"score_spread":0.20759979076987692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285284453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31315014,0.0010180386,0.6806445,0.0011453561,0.0008171976,0.0014294209,0.00013713707,0.0007164246,0.0009417566],"genre_scores_gemma":[0.99100304,0.00006840265,0.007306817,0.00008194347,0.0000374277,0.0011501156,0.00020260022,0.00007573939,0.00007392275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988624,0.00014980944,0.0003779149,0.00018519063,0.00018248204,0.00024220716],"domain_scores_gemma":[0.9987404,0.00007838373,0.00012002306,0.0009742878,0.000042454376,0.000044505574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015367927,0.00017234067,0.00021403487,0.00022400676,0.0002992313,0.000038030357,0.00055432087,0.000038658993,0.000007714729],"category_scores_gemma":[0.000005493636,0.00019416156,0.00003465492,0.00049511576,0.000057407993,0.00031093514,0.00009755499,0.00043104735,0.000008930961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009130242,0.00003708451,0.0008263909,0.000057727724,0.000025491008,0.0000052749388,0.0009542512,0.99317604,0.0036697232,0.00004776294,0.0004437329,0.0007473709],"study_design_scores_gemma":[0.0005192368,0.000020859205,0.00013350057,0.00013124665,0.000015592615,0.000027670105,0.0013530453,0.99098426,0.00029566308,0.0000019117058,0.0061951983,0.00032181933],"about_ca_topic_score_codex":0.00012555603,"about_ca_topic_score_gemma":0.00019682496,"teacher_disagreement_score":0.67785287,"about_ca_system_score_codex":0.0007121672,"about_ca_system_score_gemma":0.000023767865,"threshold_uncertainty_score":0.79176784},"labels":[],"label_agreement":null},{"id":"W4289792367","doi":"10.1109/lwc.2022.3196467","title":"A Novel Non-Coherent SCMA With Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; MIMO; Channel state information; Spectral efficiency; Leverage (statistics); Computer engineering; Benchmark (surveying); Message passing; Algorithm; Wireless; Demodulation; Channel (broadcasting); Transmission (telecommunications); Bit error rate; Decoding methods; Theoretical computer science; Computer network; Telecommunications; Parallel computing; Artificial intelligence","score_opus":0.018700401428010674,"score_gpt":0.23174947976116653,"score_spread":0.21304907833315584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289792367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43340552,0.0013491234,0.5410204,0.016701285,0.00039030338,0.0012004108,0.00017003702,0.0034206898,0.002342223],"genre_scores_gemma":[0.9538613,0.00042642708,0.043038327,0.00059360435,0.000016045255,0.001827112,0.00008885185,0.00010341261,0.000044948767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985464,0.00008377995,0.00037647752,0.00026781415,0.00033210774,0.00039340276],"domain_scores_gemma":[0.99503297,0.00022458402,0.00014381944,0.0044702417,0.000061044906,0.000067315654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013731285,0.00029343556,0.0002927328,0.00029545158,0.0008104594,0.000051421182,0.003464463,0.00005874399,0.00004384041],"category_scores_gemma":[0.00000797688,0.00031846674,0.000078851626,0.000847021,0.00041980602,0.00023433838,0.00082409504,0.0010523702,0.000032733013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001927429,0.00026332313,0.000313187,0.000042585212,0.00019437818,0.0000070245073,0.00093587686,0.59994143,0.36994678,0.0031798617,0.00511308,0.020043211],"study_design_scores_gemma":[0.0048472933,0.0003110043,0.002565921,0.00029948834,0.00013376943,0.00023519553,0.009025445,0.7256721,0.09526058,0.0003914812,0.15783599,0.0034216929],"about_ca_topic_score_codex":0.000046571524,"about_ca_topic_score_gemma":0.0000686891,"teacher_disagreement_score":0.5204558,"about_ca_system_score_codex":0.00043242605,"about_ca_system_score_gemma":0.000036204576,"threshold_uncertainty_score":0.99992675},"labels":[],"label_agreement":null},{"id":"W4292825909","doi":"10.1109/lwc.2022.3200912","title":"On the Scalability of Duty-Cycled LoRa Networks With Imperfect SF Orthogonality","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"IoT Networks and Protocols","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":"","keywords":"Scalability; Orthogonality; Kronecker delta; Computer science; Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics; Physics; Geometry","score_opus":0.017320284572283403,"score_gpt":0.22839701974459614,"score_spread":0.21107673517231273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292825909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824383,0.000108336964,0.009207462,0.0039232643,0.00015440215,0.0028551114,0.000030697494,0.0001786856,0.0011037329],"genre_scores_gemma":[0.9948507,0.000025882848,0.0002612995,0.00091021264,0.000039899587,0.0038437997,0.000025644002,0.000035982415,0.0000065623417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998518,0.0005488035,0.00030350115,0.0001546014,0.00023374044,0.00024133678],"domain_scores_gemma":[0.9966643,0.00087581563,0.0000923872,0.0022898868,0.000036563426,0.0000410879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074273057,0.0001653412,0.00021794603,0.000043891716,0.0005166137,0.000028222792,0.0011949629,0.00003177151,0.000094090174],"category_scores_gemma":[0.000007719005,0.00012728614,0.00009175955,0.0004733396,0.00026377023,0.000056149966,0.00017800098,0.00076661934,0.000004160667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073719246,0.00011499601,0.0032645669,0.000030492347,0.00009899018,0.0000012806878,0.00024697997,0.98323005,0.0017548895,0.0029522863,0.005354357,0.0028774096],"study_design_scores_gemma":[0.001161684,0.00021614363,0.019104447,0.00015384496,0.00007621297,0.000017421047,0.00018606633,0.96729106,0.001314119,0.0004888128,0.0092378585,0.00075235893],"about_ca_topic_score_codex":0.00006220827,"about_ca_topic_score_gemma":0.00006571749,"teacher_disagreement_score":0.015939001,"about_ca_system_score_codex":0.00011030114,"about_ca_system_score_gemma":0.000021288031,"threshold_uncertainty_score":0.5190578},"labels":[],"label_agreement":null},{"id":"W4293281807","doi":"10.1109/lwc.2022.3177638","title":"Cognitive Radios Equipped With Modulation and STBC Recognition Over Coded Transmissions","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Signal Modulation Classification","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Prince Sultan University","keywords":"Space–time block code; Computer science; Transmitter; Cognitive radio; Block code; Coding (social sciences); Channel (broadcasting); Transmission (telecommunications); Modulation (music); Maximization; Algorithm; Electronic engineering; Decoding methods; Wireless; Telecommunications; Mathematics; Engineering","score_opus":0.04684438269283786,"score_gpt":0.26784207799149845,"score_spread":0.2209976952986606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293281807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46061796,0.00005582141,0.5280769,0.010201546,0.00008885391,0.0005282098,0.000046619713,0.00022943696,0.00015465968],"genre_scores_gemma":[0.9796485,0.00005203471,0.017831238,0.0015058409,0.000028576505,0.00060692773,0.00025879024,0.000033769098,0.00003437007],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750936,0.0007096677,0.00041012824,0.0005362196,0.0005463269,0.00028831154],"domain_scores_gemma":[0.99746037,0.0005504206,0.00030692926,0.001388106,0.0001606667,0.00013351478],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00039320948,0.00023052763,0.00022605159,0.00033431404,0.0013863175,0.00017653711,0.0012047192,0.000054188895,0.00003875658],"category_scores_gemma":[0.00001797423,0.0002459138,0.000059609494,0.00092186185,0.00025058584,0.00088650075,0.0002980263,0.00047160784,0.00001241341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032588578,0.0012420453,0.004907499,0.000079199184,0.00034178107,0.000022651033,0.011318698,0.019656632,0.59581727,0.021545881,0.0017367795,0.34300572],"study_design_scores_gemma":[0.0022867355,0.00016187142,0.026829066,0.00010403287,0.00006555402,0.00007771221,0.000440834,0.96459585,0.0029633706,0.00089227984,0.0009160771,0.000666609],"about_ca_topic_score_codex":0.00006915305,"about_ca_topic_score_gemma":0.000029439845,"teacher_disagreement_score":0.94493926,"about_ca_system_score_codex":0.00019787592,"about_ca_system_score_gemma":0.00009237262,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W4294811364","doi":"10.1109/lwc.2022.3204666","title":"Partial Non-Orthogonal Multiple Access: A New Perspective for RIS-Aided Downlink","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Noma; Beamforming; Computer science; Channel (broadcasting); Perspective (graphical); Closed-form expression; Algorithm; Mathematics; Mathematical optimization; Topology (electrical circuits); Telecommunications; Combinatorics; Artificial intelligence; Mathematical analysis","score_opus":0.04078692693221976,"score_gpt":0.30005695792916004,"score_spread":0.2592700309969403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15218545,0.0015443908,0.8072039,0.032185115,0.0007109891,0.0019783801,0.00040781123,0.003061436,0.0007225166],"genre_scores_gemma":[0.9629027,0.00051833474,0.032760523,0.000669705,0.00008535954,0.0026996175,0.00020908758,0.00010654173,0.00004810245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820733,0.00013205026,0.00052685785,0.00036792253,0.00028093203,0.00048488448],"domain_scores_gemma":[0.99520147,0.0007662989,0.00018270583,0.0036087942,0.00013391247,0.00010683632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022421418,0.00032225586,0.00036455342,0.00033078904,0.0010768736,0.00010449897,0.00463573,0.00009313139,0.000043276206],"category_scores_gemma":[0.00009710698,0.0004003647,0.00018181397,0.00071172876,0.0003029193,0.00047697392,0.0011729583,0.00096114294,0.000020579513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106491585,0.0003181034,0.0010881,0.00005737585,0.00038513448,0.0000037110535,0.0028191544,0.7768126,0.12201518,0.0194056,0.048702616,0.028285945],"study_design_scores_gemma":[0.0040187617,0.00012716025,0.0010121654,0.00007023565,0.00009906736,0.000030941053,0.005087086,0.8282974,0.038489185,0.006389205,0.1146178,0.0017610095],"about_ca_topic_score_codex":0.00014220987,"about_ca_topic_score_gemma":0.00014209092,"teacher_disagreement_score":0.8107173,"about_ca_system_score_codex":0.00065492257,"about_ca_system_score_gemma":0.00010582735,"threshold_uncertainty_score":0.99984485},"labels":[],"label_agreement":null},{"id":"W4296211802","doi":"10.1109/lwc.2022.3207358","title":"Resilient Topology Design for Wireless Backhaul: A Deep Reinforcement Learning Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":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":"Backhaul (telecommunications); Reinforcement learning; Computer science; Wireless network; Wireless; Mathematical optimization; Integer programming; Network topology; Computer network; Distributed computing; Topology (electrical circuits); Artificial intelligence; Algorithm; Mathematics; Telecommunications","score_opus":0.028243505735606588,"score_gpt":0.252265610973021,"score_spread":0.22402210523741445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296211802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007843894,0.0002958451,0.988478,0.00070397765,0.0003423055,0.0011881094,0.0000056095187,0.00047135664,0.0006708935],"genre_scores_gemma":[0.9273073,0.00013232866,0.06852568,0.00031788327,0.0000483385,0.0031835486,0.00023426954,0.000096654345,0.00015397511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983079,0.00035255757,0.00048673392,0.0002659234,0.00018299212,0.0004039038],"domain_scores_gemma":[0.99807036,0.00032028524,0.00014691605,0.0013334837,0.00006144426,0.000067499335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043392062,0.00022559095,0.00027849711,0.00020786955,0.0008915469,0.000035469933,0.0010558462,0.000062270046,0.000019132473],"category_scores_gemma":[0.00001702025,0.00028426797,0.000091440364,0.00037482937,0.0001156542,0.00015931654,0.00021920426,0.0004947868,0.000008868222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021884007,0.0000394341,0.000021936183,0.000052322666,0.000057039648,6.5995624e-7,0.0012048678,0.9780889,0.015836788,0.0013507252,0.0017336879,0.0015917169],"study_design_scores_gemma":[0.0005561455,0.00005349656,0.00000425715,0.000012908669,0.000024907042,0.000015793714,0.0009002412,0.99064565,0.0012569006,0.000023540508,0.006205512,0.0003006444],"about_ca_topic_score_codex":0.000022637016,"about_ca_topic_score_gemma":0.000008285661,"teacher_disagreement_score":0.91995233,"about_ca_system_score_codex":0.0005177264,"about_ca_system_score_gemma":0.000025274756,"threshold_uncertainty_score":0.99996096},"labels":[],"label_agreement":null},{"id":"W4296870977","doi":"10.1109/lwc.2022.3208916","title":"MIMO Device-to-Device Communications via Cooperative Dual-Polarized Intelligent Surfaces","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":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":"MIMO; Computer science; Dual (grammatical number); Computer network; Telecommunications","score_opus":0.03809808061769414,"score_gpt":0.2834743639150393,"score_spread":0.24537628329734512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296870977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44610426,0.009355989,0.43164635,0.09633513,0.0011338586,0.0038691778,0.0005734081,0.007982996,0.002998839],"genre_scores_gemma":[0.94741565,0.0022979374,0.045019004,0.002420316,0.000019314815,0.0022489151,0.00034190074,0.00015754974,0.00007938207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965769,0.0008246524,0.0010004805,0.00046789504,0.00048510553,0.0006449692],"domain_scores_gemma":[0.98760843,0.001117302,0.00024279214,0.010619581,0.0002288902,0.00018301819],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005887628,0.00052241416,0.00058702525,0.0005921783,0.002209538,0.00013900935,0.008210534,0.00012747583,0.00009679817],"category_scores_gemma":[0.00007510885,0.0006420058,0.00016450886,0.002144679,0.00071871583,0.0004409592,0.00379711,0.0018814045,0.0002290067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033865752,0.00048653482,0.0005150852,0.000058407768,0.00039513852,0.0000055131313,0.004352878,0.4272893,0.53107464,0.006939756,0.006053591,0.022795318],"study_design_scores_gemma":[0.0014221909,0.00016115085,0.00071038335,0.00014560968,0.00012676559,0.00007804993,0.007846526,0.51294196,0.056474466,0.0004550577,0.41702503,0.0026128048],"about_ca_topic_score_codex":0.00018296856,"about_ca_topic_score_gemma":0.0005139074,"teacher_disagreement_score":0.5013114,"about_ca_system_score_codex":0.0008697233,"about_ca_system_score_gemma":0.00007249033,"threshold_uncertainty_score":0.9996031},"labels":[],"label_agreement":null},{"id":"W4311414630","doi":"10.1109/lwc.2022.3210435","title":"Handling Interference in Integrated HAPS-Terrestrial Networks Through Radio Resource Management","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Carleton University","funders":"","keywords":"Computer science; Bottleneck; Radio resource management; Interference (communication); Resource management (computing); Wireless network; Subcarrier; Resource allocation; Wireless; Computer network; Distributed computing; Telecommunications; Orthogonal frequency-division multiplexing; Channel (broadcasting); Embedded system","score_opus":0.021262059762648968,"score_gpt":0.2388482222757694,"score_spread":0.21758616251312043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311414630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03518588,0.00060302304,0.96025556,0.0007334471,0.0007334643,0.0005782871,0.000014392767,0.00043529188,0.0014606328],"genre_scores_gemma":[0.987559,0.00033072566,0.011005045,0.0002560456,0.000049508628,0.00048924173,0.000214133,0.00005700217,0.000039304665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.00028140907,0.00046770304,0.00021911916,0.00012086545,0.00028477842],"domain_scores_gemma":[0.99840516,0.00013442908,0.00008962243,0.0013264432,0.000011718253,0.000032613756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023726955,0.00018838725,0.00022088968,0.00019360372,0.00028389593,0.000053691354,0.0012136535,0.00004392032,0.000015492835],"category_scores_gemma":[0.000004743036,0.00023322468,0.000048395188,0.00072570454,0.000080198624,0.00022401003,0.0002990072,0.000670564,0.0000058340734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019495687,0.000032174237,0.00010415504,0.000013404775,0.00003696482,0.000007379042,0.00086926605,0.9910488,0.0011377247,0.0003093911,0.0022138776,0.0042073578],"study_design_scores_gemma":[0.0008092806,0.000013623711,0.000029772638,0.00013742347,0.000015963093,0.000010225522,0.0011425021,0.98249125,0.00016249288,0.000020382398,0.014867926,0.00029914183],"about_ca_topic_score_codex":0.000101636186,"about_ca_topic_score_gemma":0.000105882245,"teacher_disagreement_score":0.9523731,"about_ca_system_score_codex":0.0005108434,"about_ca_system_score_gemma":0.000008853242,"threshold_uncertainty_score":0.9510627},"labels":[],"label_agreement":null},{"id":"W4311414710","doi":"10.1109/lwc.2022.3215570","title":"Meta Distribution of Partial-NOMA","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Manitoba","funders":"","keywords":"Notation; Matching (statistics); Percentile; Computer science; Mathematics; Distribution (mathematics); Moment (physics); Discrete mathematics; Combinatorics; Algorithm; Arithmetic; Statistics; Mathematical analysis","score_opus":0.04464508438457455,"score_gpt":0.25293364240613336,"score_spread":0.20828855802155882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311414710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67294747,0.0058735088,0.30654058,0.009734277,0.00042038396,0.0006498472,0.0005834472,0.002551217,0.0006992812],"genre_scores_gemma":[0.9937226,0.0008500741,0.0041527757,0.00013318125,0.000007894505,0.0008143251,0.00026543753,0.000039837494,0.000013840565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987265,0.00019589208,0.0004649972,0.00015261244,0.00023133375,0.00022867334],"domain_scores_gemma":[0.9959941,0.0002505605,0.00015144117,0.003523351,0.00004602035,0.000034520992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023449169,0.00017514755,0.0003267376,0.000134327,0.00041476672,0.000014515532,0.0024606448,0.000044120432,0.00005180396],"category_scores_gemma":[0.000014963886,0.00020382466,0.00015847076,0.0006441883,0.0003399768,0.00017010544,0.00064172474,0.0005295323,0.000010354273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014549648,0.00028104516,0.0005052464,0.00007012062,0.001443194,0.0000025516144,0.00063893583,0.7283249,0.20342882,0.034102105,0.008251025,0.022937546],"study_design_scores_gemma":[0.0014675759,0.00013251022,0.0018999149,0.000049807568,0.0010396653,0.00005457074,0.002267052,0.40710628,0.31147698,0.0021939883,0.270446,0.0018656541],"about_ca_topic_score_codex":0.000027521417,"about_ca_topic_score_gemma":0.0000074640147,"teacher_disagreement_score":0.32121858,"about_ca_system_score_codex":0.0001940394,"about_ca_system_score_gemma":0.000015119786,"threshold_uncertainty_score":0.8311728},"labels":[],"label_agreement":null},{"id":"W4311457526","doi":"10.1109/lwc.2022.3211530","title":"Relay-Aided Double-Hop RISs-Empowered Outdoor-to-Indoor Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Relay; MIMO; Hop (telecommunications); Computer science; Upper and lower bounds; Communications system; Computer network; Channel (broadcasting); Mathematics; Power (physics)","score_opus":0.03549067811457437,"score_gpt":0.2773763755014099,"score_spread":0.24188569738683555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311457526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6737667,0.0075516454,0.14696829,0.13740464,0.0020695839,0.0048586237,0.00071064435,0.015777953,0.010891981],"genre_scores_gemma":[0.9385779,0.0016864177,0.05351368,0.0019332753,0.000031296895,0.0035435564,0.00033834213,0.00021045907,0.00016510341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965869,0.00048205335,0.001082416,0.00051698845,0.0005666465,0.00076497387],"domain_scores_gemma":[0.9825259,0.00074051117,0.00027731797,0.01609021,0.00014901391,0.00021704726],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00057866157,0.0005395295,0.00059939077,0.00081455114,0.0027285668,0.00017999871,0.012696363,0.00015821056,0.00009385483],"category_scores_gemma":[0.00005702304,0.00069375,0.00023163111,0.002139547,0.000874334,0.00045276879,0.0043161097,0.002226635,0.00032764697],"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.00016313947,0.0009935331,0.0015603177,0.000105437866,0.00064768567,0.00001570231,0.007699117,0.5145152,0.32337263,0.033400442,0.069810785,0.047716],"study_design_scores_gemma":[0.004405749,0.00017080797,0.00091970456,0.00017313467,0.00013440564,0.000106298976,0.006825915,0.16656007,0.027830591,0.0009186066,0.7887223,0.00323243],"about_ca_topic_score_codex":0.00013408432,"about_ca_topic_score_gemma":0.00019816692,"teacher_disagreement_score":0.71891147,"about_ca_system_score_codex":0.0009088439,"about_ca_system_score_gemma":0.00008021531,"threshold_uncertainty_score":0.99955136},"labels":[],"label_agreement":null},{"id":"W4312513620","doi":"10.1109/lwc.2022.3227468","title":"Harvested Power Fairness-Based Multi-Carrier NOMA IoT Networks With SWIPT","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Maximum power transfer theorem; Noma; Wireless; Power (physics); Mathematical optimization; Wireless power transfer; Convexity; Quality of service; Optimization problem; Power optimization; Computer network; Telecommunications; Algorithm; Mathematics","score_opus":0.016422078688948447,"score_gpt":0.21753339199891952,"score_spread":0.20111131330997106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312513620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6869451,0.00069450866,0.30529946,0.0028911252,0.0009114151,0.00056272635,0.00006460391,0.0020339848,0.0005970902],"genre_scores_gemma":[0.98301166,0.000029262179,0.013136449,0.0023516384,0.00007596807,0.00084135245,0.00019883458,0.0002359916,0.00011884613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758106,0.000399113,0.0005195198,0.00041034,0.00041427067,0.00067570206],"domain_scores_gemma":[0.99597275,0.00044800979,0.00016355599,0.0031461236,0.00008619921,0.00018333762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033052644,0.00044949897,0.00039651935,0.000247175,0.00096778956,0.0001404629,0.002233738,0.00012100452,0.00007812825],"category_scores_gemma":[0.0000105623985,0.0005013341,0.0001285797,0.0010414359,0.000383542,0.00017741497,0.00027702993,0.0014065288,0.0000129287755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020856656,0.00012722207,0.0031845167,0.000017427541,0.00011720456,0.000021373186,0.00020790697,0.9879896,0.003583309,0.00024616125,0.0035395662,0.00094485347],"study_design_scores_gemma":[0.0011938899,0.000050518327,0.0040618423,0.00008930948,0.00004761479,0.000027236338,0.00012832823,0.97636545,0.00043014198,0.0000018097046,0.016875517,0.0007283414],"about_ca_topic_score_codex":0.00009793346,"about_ca_topic_score_gemma":0.0003831932,"teacher_disagreement_score":0.29606655,"about_ca_system_score_codex":0.00038142613,"about_ca_system_score_gemma":0.000063618776,"threshold_uncertainty_score":0.9997438},"labels":[],"label_agreement":null},{"id":"W4312564693","doi":"10.1109/lwc.2022.3229441","title":"Joint User Scheduling and Phase Shift Design for RIS Assisted Multi-Cell MISO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Department for the Economy","keywords":"Telecommunications link; Codebook; Computer science; Scheduling (production processes); Spectral efficiency; Mathematical optimization; Algorithm; Wireless; Ergodic theory; Multi-user; Channel (broadcasting); Real-time computing; Mathematics; Computer network; Telecommunications","score_opus":0.07599553856081136,"score_gpt":0.2884469639193112,"score_spread":0.2124514253584998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312564693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13203453,0.0048117847,0.85809946,0.002256099,0.00024213851,0.0011065481,0.00011086225,0.0013121333,0.000026455553],"genre_scores_gemma":[0.809046,0.0007341059,0.18746345,0.00016423735,0.000013485793,0.002378824,0.000081346916,0.00009368173,0.00002490886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998254,0.0003041659,0.0005753839,0.00029846726,0.00018999848,0.0003780107],"domain_scores_gemma":[0.9960685,0.0006553519,0.00019952316,0.0029379542,0.00006108236,0.00007762916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046332795,0.00029221593,0.00037210627,0.0003131747,0.0010643111,0.00010695362,0.0017964471,0.0000952273,0.000005085357],"category_scores_gemma":[0.00004091477,0.00035681622,0.00009324575,0.0004183762,0.0002637737,0.00023766127,0.0005320975,0.0007260926,0.0000064676733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002092663,0.00035120736,0.00005068525,0.00014070545,0.00010136029,0.0000019825195,0.00069568056,0.75333434,0.23461553,0.0008471922,0.0014984428,0.008341923],"study_design_scores_gemma":[0.0024294804,0.000058097517,0.00006726724,0.000054500673,0.000040549563,0.000014353114,0.0014061009,0.96968234,0.0139111765,0.00003926263,0.011761086,0.0005358086],"about_ca_topic_score_codex":0.000033506287,"about_ca_topic_score_gemma":0.000009402537,"teacher_disagreement_score":0.67701143,"about_ca_system_score_codex":0.00029087017,"about_ca_system_score_gemma":0.000026956264,"threshold_uncertainty_score":0.99988836},"labels":[],"label_agreement":null},{"id":"W4312979465","doi":"10.1109/lwc.2022.3229843","title":"RIS-Assisted Cooperative NOMA With SWIPT","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":41,"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":"Noma; Computer science; Computer network; Telecommunications link","score_opus":0.02020971244832278,"score_gpt":0.23332520327185538,"score_spread":0.2131154908235326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312979465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79459244,0.0019925814,0.17313918,0.017761113,0.00038556673,0.0011180749,0.00017922932,0.0058280337,0.005003773],"genre_scores_gemma":[0.9785807,0.00045152658,0.018652564,0.0006845706,0.000012787051,0.0013340164,0.0001231863,0.00009483003,0.00006581581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.00023949886,0.00037455367,0.0002513898,0.00028776302,0.0003524357],"domain_scores_gemma":[0.9952848,0.00029191212,0.00011949358,0.0041643977,0.00007822197,0.000061199775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001567541,0.0002806431,0.00029255412,0.00026910263,0.0011209644,0.0000568974,0.0031276704,0.00005641322,0.00005871698],"category_scores_gemma":[0.000011628141,0.000300059,0.000063474545,0.0010239567,0.00048602367,0.0002694019,0.00068131986,0.0010762855,0.000039259347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048828388,0.00035899892,0.0010153507,0.000044611537,0.0003662883,0.000020739591,0.0019489928,0.73292047,0.19270124,0.009838642,0.013049088,0.04768677],"study_design_scores_gemma":[0.0058643715,0.0005708303,0.008341033,0.0002599691,0.00018703031,0.0005259477,0.015954772,0.512531,0.094173506,0.0005238617,0.35604924,0.0050184866],"about_ca_topic_score_codex":0.00003076274,"about_ca_topic_score_gemma":0.00009503289,"teacher_disagreement_score":0.34300014,"about_ca_system_score_codex":0.0004176612,"about_ca_system_score_gemma":0.000036817408,"threshold_uncertainty_score":0.99994516},"labels":[],"label_agreement":null},{"id":"W4313043402","doi":"10.1109/lwc.2022.3217675","title":"BNET: A Neural Network Approach for LLR-Based Detection in the Presence of Bursty Impulsive Noise","year":2022,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Power Line Communications and Noise","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":"Hydro-Québec; École de Technologie Supérieure","funders":"","keywords":"Computer science; Noise (video); Artificial neural network; Algorithm; Wireless; Function (biology); Artificial intelligence; Telecommunications","score_opus":0.02232906318146207,"score_gpt":0.24395949592641916,"score_spread":0.22163043274495708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313043402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85535765,0.0014682703,0.13652444,0.0038703696,0.0003081026,0.0017090335,0.00011788485,0.00018418994,0.0004600408],"genre_scores_gemma":[0.991213,0.000060874907,0.006000677,0.00047640403,0.00003533342,0.002068034,0.000111286005,0.000030153311,0.000004217073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986905,0.0004136042,0.00035335968,0.00013596025,0.00016461876,0.00024198033],"domain_scores_gemma":[0.9968207,0.00068348955,0.00010604022,0.0023217516,0.000041880518,0.000026120393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551587,0.00013732743,0.00017572452,0.00013250444,0.00044643768,0.000024205341,0.0021539181,0.00003297177,0.00000342736],"category_scores_gemma":[0.000017890361,0.00013381448,0.00010562408,0.0007209279,0.00014219378,0.00009354518,0.00016898455,0.00048670915,5.248803e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025644898,0.00015932322,0.00033873375,0.00003233089,0.000021248496,2.7508415e-7,0.0008053469,0.9778236,0.014981685,0.00017724822,0.0013536048,0.004280948],"study_design_scores_gemma":[0.0004487853,0.00003706673,0.0013890978,0.000011581926,0.00002148993,0.000004153122,0.00037854645,0.99260753,0.0007906807,0.000028833852,0.0041244784,0.00015774244],"about_ca_topic_score_codex":0.00011760516,"about_ca_topic_score_gemma":0.00011132749,"teacher_disagreement_score":0.13585535,"about_ca_system_score_codex":0.000087375534,"about_ca_system_score_gemma":0.000021070864,"threshold_uncertainty_score":0.54567957},"labels":[],"label_agreement":null},{"id":"W4318823904","doi":"10.1109/lwc.2023.3238510","title":"Optimal Hovering Height and Power Allocation for UAV-Aided NOMA Covert Communication System","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Covert; Computer science; Telecommunications link; Transmission (telecommunications); Transmitter power output; Signal-to-noise ratio (imaging); Power (physics); Real-time computing; Geometric programming; Mathematical optimization; Power budget; Power control; Computer network; Transmitter; Mathematics; Telecommunications","score_opus":0.013229475807088952,"score_gpt":0.22270374797409134,"score_spread":0.2094742721670024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318823904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908739,0.0005413417,0.30012205,0.0040832055,0.00023740601,0.0012223074,0.00008635828,0.0017603002,0.0010731006],"genre_scores_gemma":[0.9762077,0.000978316,0.02103207,0.00016115964,0.000031967345,0.0009699287,0.00050436956,0.00007745164,0.00003708054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889815,0.000067121524,0.00040670275,0.00022231853,0.0001349686,0.00027074135],"domain_scores_gemma":[0.997669,0.00030458663,0.00009792336,0.0017450636,0.000108659224,0.00007477351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029653733,0.00020480507,0.00021377981,0.00021927353,0.00051408773,0.00013212294,0.0007324297,0.000106903855,0.0000032034561],"category_scores_gemma":[0.000012067279,0.00024195742,0.00006485574,0.00055021007,0.00012729474,0.00034005614,0.00013033948,0.00017925935,0.00004912469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043147476,0.00012854737,0.00082890125,0.0006023832,0.000355555,0.000001372268,0.0036924193,0.74746335,0.16446672,0.042917855,0.028746277,0.010753471],"study_design_scores_gemma":[0.0005378106,0.000014518223,0.0015804585,0.00011474683,0.00004260069,0.000007907673,0.0005376888,0.9849768,0.002460413,0.000023942328,0.009356913,0.00034619833],"about_ca_topic_score_codex":0.000035104487,"about_ca_topic_score_gemma":0.000029182444,"teacher_disagreement_score":0.28533372,"about_ca_system_score_codex":0.0001843784,"about_ca_system_score_gemma":0.000015780459,"threshold_uncertainty_score":0.9866737},"labels":[],"label_agreement":null},{"id":"W4321609156","doi":"10.1109/lwc.2023.3245280","title":"Energy Minimization for Wireless-Powered Federated Learning Network With NOMA","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Benchmark (surveying); Wireless; Wireless network; Mathematical optimization; Minification; Energy minimization; Energy consumption; Computational complexity theory; Resource allocation; Energy (signal processing); Distributed computing; Algorithm; Computer network; Mathematics; Telecommunications; Telecommunications link; Engineering; Electrical engineering","score_opus":0.03411326830583272,"score_gpt":0.2670262845850714,"score_spread":0.23291301627923866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321609156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033629715,0.00008259953,0.8728705,0.08963444,0.0002896668,0.000324949,0.000014804646,0.0029794553,0.0001738399],"genre_scores_gemma":[0.78210026,0.0003889443,0.21518801,0.0012403501,0.00006441115,0.0004605858,0.00042552556,0.000056803903,0.000075120784],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790263,0.00026519134,0.00038774777,0.00055982516,0.0002793308,0.0006052598],"domain_scores_gemma":[0.98903084,0.0008761932,0.00028435013,0.009584497,0.00015370392,0.00007043473],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00035771803,0.00025607026,0.0002775143,0.00026550284,0.0011466735,0.00039287307,0.022076603,0.00014403574,0.0000020762018],"category_scores_gemma":[0.00057791354,0.00026035815,0.000067104986,0.002199951,0.00027727836,0.00065837376,0.014702454,0.00036316054,0.000025458074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063718086,0.00015972195,0.0023345535,0.00005798744,0.00027277443,0.000022041366,0.00039296495,0.019554486,0.016419385,0.018393653,0.81895834,0.1233704],"study_design_scores_gemma":[0.00053226197,0.00006336809,0.00029538706,0.00009970545,0.000013511841,0.0000092938,0.00005872186,0.97323304,0.0018997741,0.0025889615,0.020824775,0.00038121274],"about_ca_topic_score_codex":0.00007302331,"about_ca_topic_score_gemma":0.00012942252,"teacher_disagreement_score":0.95367855,"about_ca_system_score_codex":0.00011244843,"about_ca_system_score_gemma":0.00008317131,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W4323540130","doi":"10.1109/lwc.2023.3243743","title":"IEEE Wireless Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Oak Ridge National Laboratory; University of New South Wales; Indian Institute of Technology, Patna; Xidian University; Polytechnique Montréal; National Institute of Informatics; Heriot-Watt University; Queen Mary University of London","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.06812218074900049,"score_gpt":0.24569989062717518,"score_spread":0.17757770987817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323540130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597746,0.0007585571,0.013504883,0.24281907,0.007981385,0.0021104685,0.003240347,0.0020412267,0.16776946],"genre_scores_gemma":[0.9807755,0.0026056927,0.0017191065,0.008101513,0.00011578401,0.00057337584,0.0012181748,0.000053052325,0.0048378063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758744,0.000090316455,0.0012187765,0.0004354889,0.00011044635,0.0005575275],"domain_scores_gemma":[0.9940487,0.00028277948,0.0007879324,0.0046077776,0.00013873607,0.00013407237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011976517,0.00028243958,0.00046865686,0.0009598888,0.0011717065,0.00049307704,0.0033683092,0.00011651979,0.0002719786],"category_scores_gemma":[0.00008320501,0.0003635976,0.00020973424,0.0014306568,0.0007611819,0.0019631705,0.0006507362,0.0003886616,0.036419712],"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.000009538293,0.00013952897,0.0043699997,0.00004403554,0.00022421656,6.929556e-7,0.0042352304,0.0005030163,0.0017439368,0.10516703,0.87885463,0.004708139],"study_design_scores_gemma":[0.0010448332,0.000015950827,0.006393731,0.00005566999,0.000033663662,0.0000052729956,0.0015680419,0.057341866,0.00024498618,0.0006730901,0.9317044,0.0009184727],"about_ca_topic_score_codex":0.00044038406,"about_ca_topic_score_gemma":0.00006778798,"teacher_disagreement_score":0.4210009,"about_ca_system_score_codex":0.00031514166,"about_ca_system_score_gemma":0.000032601423,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4324125340","doi":"10.1109/lwc.2023.3256300","title":"Efficient Massive Machine Type Communication (mMTC) via AMP","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Algorithm; Upper and lower bounds; Network packet; Separable space; Gaussian; Theoretical computer science; Mathematics","score_opus":0.029974775724644923,"score_gpt":0.2631534754109956,"score_spread":0.2331786996863507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324125340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9446038,0.00086014596,0.03774897,0.00805826,0.00050099863,0.00045853335,0.000024687384,0.0050235884,0.0027210193],"genre_scores_gemma":[0.99245197,0.000813221,0.0057022586,0.0006217998,0.000030606196,0.0000669104,0.00020101608,0.0000658367,0.00004640178],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.00014366314,0.0002839601,0.0001591115,0.00017300557,0.0002784565],"domain_scores_gemma":[0.99668324,0.00021778775,0.00006775048,0.0028805777,0.00008839587,0.00006227079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017272873,0.00019349469,0.00019460729,0.00024754961,0.0003062155,0.0000554758,0.0012523426,0.00008176139,0.000013849902],"category_scores_gemma":[0.0000129857135,0.00021353105,0.000071099006,0.0008145541,0.00018792725,0.00005446034,0.0002442362,0.00038984724,0.00047169707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011733342,0.00008613732,0.00018950367,0.000026714817,0.00014427569,0.000007002003,0.0012844214,0.3136713,0.58203316,0.0010823305,0.08735092,0.014112499],"study_design_scores_gemma":[0.00021323409,0.000010746303,0.0006418603,0.00011934123,0.000031917192,0.000009093448,0.000063495725,0.9570534,0.018409025,0.0002048625,0.022841878,0.00040112127],"about_ca_topic_score_codex":0.000083896506,"about_ca_topic_score_gemma":0.00006112173,"teacher_disagreement_score":0.64338213,"about_ca_system_score_codex":0.00009913934,"about_ca_system_score_gemma":0.000010353258,"threshold_uncertainty_score":0.87075436},"labels":[],"label_agreement":null},{"id":"W4353004175","doi":"10.1109/lwc.2023.3259719","title":"Optimization of Speed and Network Deployment for Reliable V2I Communication in the Presence of Handoffs and Interference","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interference (communication); Base station; Maximization; Wireless; Computer network; Software deployment; Throughput; Real-time computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.021583965759916498,"score_gpt":0.24459102177440814,"score_spread":0.22300705601449164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353004175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94819236,0.0018874622,0.045717157,0.0030063128,0.00007556034,0.0009002318,0.000013609428,0.00010439133,0.000102912156],"genre_scores_gemma":[0.9860621,0.0046304245,0.009034148,0.000083056824,0.0000107587,0.00010421194,0.00005096897,0.000019924883,0.0000044165936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919266,0.00013595258,0.00031892513,0.00009779991,0.000090792455,0.00016387149],"domain_scores_gemma":[0.99805945,0.0007457117,0.000091789094,0.0010384086,0.00004390765,0.000020735522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801903,0.00009549614,0.00017814888,0.00008449613,0.00009238772,0.000024525965,0.00064455013,0.000046281373,6.8549423e-7],"category_scores_gemma":[0.0000241226,0.00008940545,0.000023722392,0.00041819972,0.00020167933,0.000115402385,0.00013439335,0.00015638348,4.13338e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009492739,0.0000150288615,0.0012190925,0.00007168087,0.000020556643,1.2771314e-7,0.00097476406,0.9912999,0.0031976644,0.00041670192,0.0018729498,0.0009020032],"study_design_scores_gemma":[0.00032506062,0.000015962185,0.0016319443,0.00024211913,0.000017883815,0.000001907453,0.00018370424,0.99659854,0.0005641662,0.00009919754,0.00023678306,0.00008271669],"about_ca_topic_score_codex":0.000072870454,"about_ca_topic_score_gemma":0.00016900127,"teacher_disagreement_score":0.03786973,"about_ca_system_score_codex":0.000021084274,"about_ca_system_score_gemma":0.000007631636,"threshold_uncertainty_score":0.36458483},"labels":[],"label_agreement":null},{"id":"W4367031761","doi":"10.1109/lwc.2023.3270122","title":"On the Performance of MRC Receivers in UAV-to-Ground Channels With Shadowing","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Ottawa","funders":"","keywords":"Fading; Maximal-ratio combining; Computer science; Channel (broadcasting); Shadow mapping; Monte Carlo method; Moment-generating function; Ergodic theory; Moment (physics); Topology (electrical circuits); Bit error rate; Algorithm; Probability density function; Electronic engineering; Telecommunications; Mathematics; Statistics; Physics; Electrical engineering; Engineering; Artificial intelligence","score_opus":0.019249707634580313,"score_gpt":0.21916603245276056,"score_spread":0.19991632481818025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367031761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913553,0.00001039136,0.0027130977,0.0049301474,0.000056696128,0.00029752823,0.000005620233,0.00014127525,0.0004899227],"genre_scores_gemma":[0.998159,0.00022519635,0.0009703124,0.00032554066,0.000012492272,0.00023845004,0.000022112623,0.000026368567,0.00002053168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994089,0.000034881858,0.00017827022,0.000103390004,0.000116554525,0.00015802341],"domain_scores_gemma":[0.99869144,0.00021300127,0.0000335824,0.0010081232,0.000028763961,0.000025092286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017871901,0.000096665455,0.00010458701,0.00021474088,0.0001357025,0.000023590155,0.00061399356,0.000029910701,0.000005802046],"category_scores_gemma":[0.0000053314902,0.000080399564,0.00002060793,0.0011912511,0.00007276665,0.00010000495,0.00004095779,0.00017291753,0.000056188434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060670814,0.000017128372,0.0007593505,0.0000167066,0.000015548529,2.862762e-7,0.0009922263,0.9854341,0.0093915565,0.0010490534,0.0011092328,0.0012087312],"study_design_scores_gemma":[0.00024018458,0.00003263396,0.009614884,0.00020442173,0.000009188834,0.0000011884758,0.000331669,0.98453027,0.0039937906,0.000016482552,0.0008207283,0.00020454494],"about_ca_topic_score_codex":0.000051143834,"about_ca_topic_score_gemma":0.000063511536,"teacher_disagreement_score":0.008855533,"about_ca_system_score_codex":0.00006738737,"about_ca_system_score_gemma":0.000008221698,"threshold_uncertainty_score":0.3278599},"labels":[],"label_agreement":null},{"id":"W4375928819","doi":"10.1109/lwc.2023.3274040","title":"Multi-Level Design for Multiple-Symbol Non-Coherent Unitary Constellations for Massive SIMO Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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 Saskatchewan","funders":"","keywords":"Constellation; Computer science; Rayleigh fading; Unitary state; Computational complexity theory; Algorithm; Block (permutation group theory); Decoding methods; Divergence (linguistics); Communication complexity; Fading; Exploit; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.12604532713316186,"score_gpt":0.31310485859734205,"score_spread":0.1870595314641802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375928819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016080324,0.00034143645,0.97347367,0.0019400575,0.00044735192,0.004587992,0.00072643923,0.002341544,0.000061177074],"genre_scores_gemma":[0.7564361,0.00073497446,0.23384939,0.00019648053,0.00005831746,0.0077274805,0.00074350287,0.00017175218,0.00008201499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997942,0.0001686076,0.0007867896,0.00033915747,0.00018867258,0.0005747947],"domain_scores_gemma":[0.99225634,0.003955831,0.00021092939,0.003115808,0.00032680557,0.00013428341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045259984,0.00040559433,0.0004750648,0.00048074184,0.0007462373,0.000097914315,0.0020079026,0.0001961475,0.0000022801562],"category_scores_gemma":[0.00011495184,0.00047770844,0.00019962715,0.00071967207,0.00030373165,0.00031923025,0.00019447342,0.00038282483,0.00004503993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026395368,0.00011320758,0.00013951649,0.00028201466,0.00023941012,0.000001032092,0.0007711699,0.7654476,0.19700149,0.00088179536,0.027554018,0.0075423443],"study_design_scores_gemma":[0.0011593029,0.000029480832,0.00020328714,0.00019914667,0.000052717114,0.0000026014848,0.0007322028,0.9741687,0.015268729,0.00007470012,0.007553983,0.00055510324],"about_ca_topic_score_codex":0.000037411737,"about_ca_topic_score_gemma":0.000046981793,"teacher_disagreement_score":0.7403558,"about_ca_system_score_codex":0.0002945794,"about_ca_system_score_gemma":0.000058603222,"threshold_uncertainty_score":0.9997675},"labels":[],"label_agreement":null},{"id":"W4376456609","doi":"10.1109/lwc.2023.3274535","title":"Caching Placement Optimization in UAV-Assisted Cellular Networks: A Deep Reinforcement Learning-Based Framework","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","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":"National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Leverage (statistics); Base station; Latency (audio); Scheme (mathematics); Popularity; Content delivery; Computer network; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.01413615227525539,"score_gpt":0.2319499839258982,"score_spread":0.2178138316506428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376456609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029191138,0.00011165569,0.96760523,0.001414079,0.00015464978,0.0004834704,0.0000014904468,0.00080242683,0.00023583828],"genre_scores_gemma":[0.98194766,0.00053085963,0.015730534,0.00034224582,0.000047484365,0.0005966003,0.0007099502,0.00007299261,0.000021673817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856436,0.00014462294,0.0005005379,0.00022242319,0.00020314737,0.0003648776],"domain_scores_gemma":[0.9983184,0.00026874585,0.00010599645,0.0011893949,0.000048454945,0.00006904283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033667716,0.00021767024,0.00020038725,0.0003995769,0.00034102652,0.00009414404,0.0006228113,0.0001370248,0.000029991272],"category_scores_gemma":[0.000021353411,0.000265795,0.00006467281,0.0015256009,0.000068199304,0.00015367153,0.00008055459,0.00054570247,0.000045015644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068496947,0.00003522415,0.0003190391,0.000025495468,0.000024113513,0.0000016729165,0.00030334954,0.9970818,0.0008500199,0.00014982949,0.00032676387,0.0008758105],"study_design_scores_gemma":[0.00036870662,0.00001061878,0.00036514926,0.00011132801,0.000018041233,5.234171e-7,0.00013889177,0.9979037,0.00020369589,0.0000048841594,0.0006067803,0.00026765311],"about_ca_topic_score_codex":0.000051994255,"about_ca_topic_score_gemma":0.0000759492,"teacher_disagreement_score":0.9527565,"about_ca_system_score_codex":0.000302407,"about_ca_system_score_gemma":0.00001858285,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4381748099","doi":"10.1109/lwc.2023.3288517","title":"Channel Estimation for Reconfigurable Intelligent Surface-Assisted Full-Duplex MIMO With Hardware Impairments","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Full-Duplex Wireless Communications","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; MIMO; Transceiver; Computer science; Channel (broadcasting); Mean squared error; Wireless; Computer hardware; Minimum mean square error; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.04216059898697745,"score_gpt":0.268311860901269,"score_spread":0.22615126191429158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381748099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91630167,0.00027646532,0.06998446,0.008466335,0.0004274106,0.0016704376,0.00027485166,0.0024028309,0.00019553948],"genre_scores_gemma":[0.9769883,0.0008541391,0.018357957,0.00028169493,0.000040058614,0.0014459499,0.0016096531,0.00019824224,0.00022400961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773425,0.0001616855,0.0007069711,0.00038964048,0.00031207348,0.00069535285],"domain_scores_gemma":[0.99505275,0.00070666056,0.00018798132,0.003641468,0.00023246557,0.00017869403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004124916,0.00044734252,0.00044597714,0.00036693778,0.0007725444,0.00018069163,0.002125334,0.00016086415,0.000024970106],"category_scores_gemma":[0.0000409798,0.00047801272,0.0001678537,0.0013069187,0.00026464832,0.00043032054,0.0001403648,0.00048629433,0.00031312057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003128149,0.00010525359,0.000055224005,0.00014811609,0.00021017146,0.000002428328,0.0009809252,0.931683,0.048151802,0.00012803519,0.012601844,0.0059019173],"study_design_scores_gemma":[0.0007520027,0.00006368058,0.00072818337,0.00025487298,0.00006900141,0.000023353388,0.00052040344,0.98473114,0.006828362,0.000008732704,0.005444922,0.00057533226],"about_ca_topic_score_codex":0.000105345964,"about_ca_topic_score_gemma":0.00036641792,"teacher_disagreement_score":0.06068663,"about_ca_system_score_codex":0.0003912112,"about_ca_system_score_gemma":0.000063869105,"threshold_uncertainty_score":0.9997672},"labels":[],"label_agreement":null},{"id":"W4384303959","doi":"10.1109/lwc.2023.3295727","title":"Range-Direction Tracking and Bayesian Cramer–Rao Bound Analysis in <i>mm</i>wave Systems Equipped With Imperfect Transceivers","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":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; Tracking (education); Benchmark (surveying); Computer science; Context (archaeology); Kalman filter; Bayesian probability; Monte Carlo method; Transceiver; Particle filter; Tracking system; Algorithm; Artificial intelligence; Telecommunications; Estimation theory; Mathematics; Wireless; Statistics","score_opus":0.029077767561378275,"score_gpt":0.24149213297492816,"score_spread":0.21241436541354988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384303959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8480692,0.00038483075,0.14967743,0.0006541966,0.00011752182,0.00031818458,0.000014665172,0.00045726067,0.0003066935],"genre_scores_gemma":[0.99804056,0.0010912665,0.00047100778,0.00011183855,0.000024455863,0.00012514775,0.000068403555,0.00005035063,0.000016996772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870384,0.0001837572,0.00036679555,0.00024856755,0.00018281536,0.00031422466],"domain_scores_gemma":[0.99887276,0.00017488703,0.00006336572,0.00076697307,0.000042283755,0.00007970633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038875942,0.00021058366,0.0003338079,0.00082026736,0.00023848783,0.0001549628,0.00026470178,0.000080594094,0.0000044203634],"category_scores_gemma":[0.000005684412,0.00022075333,0.00009051294,0.0016439513,0.00011346583,0.0002569174,0.0000184923,0.00032700182,0.000007989294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025336156,0.00003355756,0.00441276,0.00016377808,0.00064370065,0.000014330093,0.0039192713,0.6241275,0.35794735,0.000023584666,0.00018788705,0.008500949],"study_design_scores_gemma":[0.0005732547,0.000016063132,0.0026838852,0.00012043595,0.00022759277,0.00000996777,0.0006205826,0.99219704,0.0031232438,0.0000044138483,0.00011274061,0.00031080696],"about_ca_topic_score_codex":0.00039369462,"about_ca_topic_score_gemma":0.0010173278,"teacher_disagreement_score":0.3680695,"about_ca_system_score_codex":0.00012894189,"about_ca_system_score_gemma":0.000013420036,"threshold_uncertainty_score":0.9002059},"labels":[],"label_agreement":null},{"id":"W4385757409","doi":"10.1109/lwc.2023.3304477","title":"IRS Element Selection Using LSTM-Based Deep Learning for UAV Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Bit error rate; Selection (genetic algorithm); Artificial intelligence; Computational complexity theory; Word error rate; Compensation (psychology); Algorithm; Computation; Machine learning","score_opus":0.04890966928684529,"score_gpt":0.3013884973285602,"score_spread":0.2524788280417149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385757409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09480428,0.0008217128,0.8888888,0.0070016133,0.00025147878,0.0011387651,0.00003728849,0.0068038665,0.00025223757],"genre_scores_gemma":[0.8729814,0.00207063,0.12277189,0.00025720245,0.000032442134,0.0012501548,0.0004655999,0.00014664911,0.000024002326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979045,0.00024273999,0.0006836666,0.00031449823,0.0002449098,0.0006097208],"domain_scores_gemma":[0.9938102,0.0012038781,0.00022054114,0.0044891634,0.00019226028,0.000083999235],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047288917,0.00035419848,0.00035706753,0.00069543184,0.0014020267,0.00010534022,0.003466236,0.00018446267,0.000007842511],"category_scores_gemma":[0.00011608445,0.00044525333,0.00017544326,0.0017442099,0.00047965292,0.00034158173,0.00047360925,0.0008593849,0.00006495094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066093435,0.000057106252,0.0006371003,0.00006810879,0.000086053136,2.9006762e-7,0.0002521943,0.81919044,0.15018365,0.0018977952,0.00083373126,0.026786929],"study_design_scores_gemma":[0.00050544733,0.000023270359,0.00019125572,0.0000834161,0.00003691378,0.0000028572979,0.0005325911,0.95791864,0.013637121,0.00021345577,0.026399158,0.00045584986],"about_ca_topic_score_codex":0.00003300946,"about_ca_topic_score_gemma":0.00017453366,"teacher_disagreement_score":0.77817714,"about_ca_system_score_codex":0.000585123,"about_ca_system_score_gemma":0.000047165187,"threshold_uncertainty_score":0.999898},"labels":[],"label_agreement":null},{"id":"W4386231900","doi":"10.1109/lwc.2023.3308965","title":"Rate-Splitting Multiple Access Scheme Based on Frequency Diverse Array","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Victoria","funders":"","keywords":"Computer science; Interference (communication); Scheme (mathematics); Orthogonal frequency-division multiple access; Relaxation (psychology); Precoding; Optimization problem; Multi-user; Wireless; Beamforming; Mathematical optimization; Algorithm; Orthogonal frequency-division multiplexing; Channel (broadcasting); MIMO; Computer network; Mathematics; Telecommunications","score_opus":0.052991451753232936,"score_gpt":0.29116574297748654,"score_spread":0.2381742912242536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386231900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85740507,0.00016464682,0.12098934,0.008965621,0.00047362072,0.0007246073,0.00008462991,0.009737356,0.0014551072],"genre_scores_gemma":[0.97220165,0.0007112334,0.025406733,0.0007807621,0.00003337275,0.00054983416,0.0001912327,0.00011087838,0.000014298741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818987,0.00017639528,0.00050936127,0.0003457165,0.00025366808,0.0005249867],"domain_scores_gemma":[0.99319947,0.0013079945,0.00014186211,0.0051947394,0.000083435196,0.000072502444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035855165,0.00034767177,0.00030744207,0.0005917168,0.00059104536,0.00012659119,0.0042520743,0.00016066998,0.000019103514],"category_scores_gemma":[0.00019815976,0.00039785643,0.00012596326,0.0016140826,0.00038458066,0.0005214929,0.0003999088,0.00083895936,0.00039467376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020090207,0.0001306514,0.010327508,0.00014146823,0.00008891633,0.000009625995,0.00039697913,0.48432606,0.4761583,0.0021386836,0.004630448,0.021631278],"study_design_scores_gemma":[0.0010464716,0.000021721953,0.005403863,0.00034877594,0.000014182849,0.000001316202,0.0005265509,0.9219885,0.06586201,0.0003450946,0.0035525013,0.0008890555],"about_ca_topic_score_codex":0.000041565236,"about_ca_topic_score_gemma":0.00005243832,"teacher_disagreement_score":0.4376624,"about_ca_system_score_codex":0.00024075029,"about_ca_system_score_gemma":0.000025910122,"threshold_uncertainty_score":0.99984735},"labels":[],"label_agreement":null},{"id":"W4386558689","doi":"10.1109/lwc.2023.3306090","title":"IEEE Wireless Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; University of Essex; University of Wollongong; Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Polytechnique Montréal; National Institute of Informatics; University of Miami","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.06812218074900049,"score_gpt":0.24569989062717518,"score_spread":0.17757770987817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386558689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597746,0.0007585571,0.013504883,0.24281907,0.007981385,0.0021104685,0.003240347,0.0020412267,0.16776946],"genre_scores_gemma":[0.9807755,0.0026056927,0.0017191065,0.008101513,0.00011578401,0.00057337584,0.0012181748,0.000053052325,0.0048378063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758744,0.000090316455,0.0012187765,0.0004354889,0.00011044635,0.0005575275],"domain_scores_gemma":[0.9940487,0.00028277948,0.0007879324,0.0046077776,0.00013873607,0.00013407237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011976517,0.00028243958,0.00046865686,0.0009598888,0.0011717065,0.00049307704,0.0033683092,0.00011651979,0.0002719786],"category_scores_gemma":[0.00008320501,0.0003635976,0.00020973424,0.0014306568,0.0007611819,0.0019631705,0.0006507362,0.0003886616,0.036419712],"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.000009538293,0.00013952897,0.0043699997,0.00004403554,0.00022421656,6.929556e-7,0.0042352304,0.0005030163,0.0017439368,0.10516703,0.87885463,0.004708139],"study_design_scores_gemma":[0.0010448332,0.000015950827,0.006393731,0.00005566999,0.000033663662,0.0000052729956,0.0015680419,0.057341866,0.00024498618,0.0006730901,0.9317044,0.0009184727],"about_ca_topic_score_codex":0.00044038406,"about_ca_topic_score_gemma":0.00006778798,"teacher_disagreement_score":0.4210009,"about_ca_system_score_codex":0.00031514166,"about_ca_system_score_gemma":0.000032601423,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4386883085","doi":"10.1109/lwc.2023.3317440","title":"Beamforming Design for Novel Relay-Assisted Multi-User Multi-Tag Symbiotic Radios","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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 Manitoba","funders":"Natural Science Foundation of Zhejiang Province","keywords":"Beamforming; Relay; Computer science; Computer network; Telecommunications","score_opus":0.07418319617716958,"score_gpt":0.287455546920909,"score_spread":0.21327235074373946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386883085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010523701,0.0001583014,0.98511416,0.00070926914,0.0005605961,0.001299574,0.000054138374,0.0015600973,0.000020190908],"genre_scores_gemma":[0.43083993,0.00018468765,0.56730896,0.00017472968,0.000051494553,0.00079350756,0.00019485058,0.00016846521,0.0002833593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984989,0.00008082914,0.00055060576,0.00027410328,0.00012800378,0.00046755158],"domain_scores_gemma":[0.9973429,0.0006055718,0.00013126475,0.0017255513,0.00010009216,0.000094631825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034081927,0.00028677573,0.00031443202,0.0003288004,0.0004201532,0.00006469441,0.0009708593,0.0001484671,0.0000017044044],"category_scores_gemma":[0.00007398733,0.00033676284,0.00012054376,0.0007585423,0.00011020694,0.00037459884,0.000086716514,0.00029215773,0.00007656218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000483758,0.00005299612,0.00004540906,0.00008119886,0.000072291274,8.904243e-7,0.00048309672,0.74286956,0.2540404,0.00010847963,0.0012380688,0.0010027728],"study_design_scores_gemma":[0.0014734768,0.000010689615,0.00017750246,0.00015678191,0.00004266293,0.000010731357,0.00021032368,0.9882341,0.007386184,0.0000016116452,0.0018998382,0.00039608564],"about_ca_topic_score_codex":0.000020196803,"about_ca_topic_score_gemma":0.000038057224,"teacher_disagreement_score":0.42031622,"about_ca_system_score_codex":0.00029493365,"about_ca_system_score_gemma":0.000023569282,"threshold_uncertainty_score":0.99990845},"labels":[],"label_agreement":null},{"id":"W4386973824","doi":"10.1109/lwc.2023.3318432","title":"Performance of OTFS-NOMA Scheme for Coordinated Direct and Relay Transmission Networks in High-Mobility Scenarios","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"PAPR reduction in OFDM","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 British Columbia","funders":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Noma; Relay; Transmission (telecommunications); Topology (electrical circuits); Outage probability; Interference (communication); Transformation (genetics); Electronic engineering; Algorithm; Computer network; Decoding methods; Mathematics; Telecommunications; Telecommunications link; Engineering; Fading; Power (physics); Channel (broadcasting); Physics","score_opus":0.016340167140817388,"score_gpt":0.2399928815101284,"score_spread":0.223652714369311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386973824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950328,0.00023114144,0.0023969172,0.0014105571,0.00014314648,0.00039096436,0.000012412435,0.0003021247,0.00007995665],"genre_scores_gemma":[0.995643,0.0009878548,0.0029793105,0.0000367157,0.00001905736,0.00022840212,0.00004858144,0.000034678105,0.000022393288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991057,0.00007271667,0.00035717295,0.00015981334,0.00007980369,0.0002248195],"domain_scores_gemma":[0.9987316,0.00029227894,0.000052620242,0.00083470275,0.000040249182,0.0000485575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441217,0.00013476332,0.00022883613,0.00019158228,0.00012909576,0.000013111715,0.00042153613,0.0000975133,0.00000272178],"category_scores_gemma":[0.000014587684,0.00015050179,0.000043698925,0.00064797857,0.00018583119,0.00014695773,0.000045948345,0.00026034683,0.000002789541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042237483,0.00007119241,0.012041348,0.0003000305,0.000056161538,6.558806e-7,0.00063915225,0.8364598,0.1338007,0.00005397166,0.0025701695,0.013964588],"study_design_scores_gemma":[0.00050686684,0.000017886532,0.014713429,0.0001680174,0.000010524401,0.0000019315871,0.000042506053,0.9780004,0.005205597,0.0000039064116,0.0011672792,0.00016162662],"about_ca_topic_score_codex":0.000047590238,"about_ca_topic_score_gemma":0.000012806136,"teacher_disagreement_score":0.14154063,"about_ca_system_score_codex":0.00008069459,"about_ca_system_score_gemma":0.000011589713,"threshold_uncertainty_score":0.61372846},"labels":[],"label_agreement":null},{"id":"W4387409826","doi":"10.1109/lwc.2023.3315942","title":"IEEE Wireless Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; University of Essex; University of Wollongong; Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Polytechnique Montréal; National Institute of Informatics; University of Miami","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.06812218074900049,"score_gpt":0.24569989062717518,"score_spread":0.17757770987817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387409826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597746,0.0007585571,0.013504883,0.24281907,0.007981385,0.0021104685,0.003240347,0.0020412267,0.16776946],"genre_scores_gemma":[0.9807755,0.0026056927,0.0017191065,0.008101513,0.00011578401,0.00057337584,0.0012181748,0.000053052325,0.0048378063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758744,0.000090316455,0.0012187765,0.0004354889,0.00011044635,0.0005575275],"domain_scores_gemma":[0.9940487,0.00028277948,0.0007879324,0.0046077776,0.00013873607,0.00013407237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011976517,0.00028243958,0.00046865686,0.0009598888,0.0011717065,0.00049307704,0.0033683092,0.00011651979,0.0002719786],"category_scores_gemma":[0.00008320501,0.0003635976,0.00020973424,0.0014306568,0.0007611819,0.0019631705,0.0006507362,0.0003886616,0.036419712],"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.000009538293,0.00013952897,0.0043699997,0.00004403554,0.00022421656,6.929556e-7,0.0042352304,0.0005030163,0.0017439368,0.10516703,0.87885463,0.004708139],"study_design_scores_gemma":[0.0010448332,0.000015950827,0.006393731,0.00005566999,0.000033663662,0.0000052729956,0.0015680419,0.057341866,0.00024498618,0.0006730901,0.9317044,0.0009184727],"about_ca_topic_score_codex":0.00044038406,"about_ca_topic_score_gemma":0.00006778798,"teacher_disagreement_score":0.4210009,"about_ca_system_score_codex":0.00031514166,"about_ca_system_score_gemma":0.000032601423,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4387623805","doi":"10.1109/lwc.2023.3324592","title":"Securing LPWANs: A Reconfigurable Intelligent Surface (RIS)-Assisted UAV Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Ottawa; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"LPWAN; Secrecy; Nakagami distribution; Default gateway; Computer science; Wide area network; Fading; Transmission (telecommunications); Wireless sensor network; Computer network; Channel (broadcasting); Telecommunications; Computer security","score_opus":0.0464876766510424,"score_gpt":0.2652204391862,"score_spread":0.21873276253515758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387623805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70197767,0.0038407058,0.24928313,0.009591781,0.000777903,0.0013844623,0.0001073497,0.019551406,0.013485562],"genre_scores_gemma":[0.96709025,0.0066813165,0.025114035,0.00019766342,0.000024306968,0.00037301355,0.00023496697,0.00013743559,0.00014701019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979018,0.00017396726,0.00066285447,0.00037067907,0.0002691692,0.00062156003],"domain_scores_gemma":[0.9941096,0.0004703221,0.00014190856,0.005089088,0.000088186374,0.00010094043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038154633,0.00037830631,0.0004105568,0.00040602745,0.0004979191,0.00011274771,0.0034267863,0.00019695336,0.000014346589],"category_scores_gemma":[0.000045787074,0.00043975556,0.00014327472,0.0018257166,0.00041020507,0.00038306823,0.00034049194,0.00094934175,0.000388534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008421411,0.00013798491,0.00028541443,0.0001944274,0.00022835018,0.0000055749206,0.0016876939,0.6407684,0.2846169,0.0031896357,0.013306991,0.055570226],"study_design_scores_gemma":[0.0006907553,0.000025325658,0.0009101474,0.00028806803,0.000044701967,0.00003871724,0.004136787,0.7993964,0.14862634,0.0005987926,0.043728568,0.0015153936],"about_ca_topic_score_codex":0.00004598626,"about_ca_topic_score_gemma":0.000031357282,"teacher_disagreement_score":0.26511255,"about_ca_system_score_codex":0.00031399578,"about_ca_system_score_gemma":0.00002557043,"threshold_uncertainty_score":0.99980545},"labels":[],"label_agreement":null},{"id":"W4387717425","doi":"10.1109/lwc.2023.3324981","title":"EsaNet: Environment Semantics Enabled Physical Layer Authentication","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Spoofing attack; Physical layer; Computer network; Wireless network; Authentication (law); Wireless; Wireless security; Computer security; Telecommunications","score_opus":0.02934541922318499,"score_gpt":0.2619509789833638,"score_spread":0.2326055597601788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387717425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96661067,0.00016710779,0.014770834,0.0120843835,0.0001821101,0.0005990531,0.000038620565,0.004248091,0.0012991129],"genre_scores_gemma":[0.99315614,0.002101356,0.0034809995,0.00034061202,0.00007147501,0.0004256584,0.0002411239,0.00010600282,0.000076613636],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983962,0.000187695,0.00041775007,0.00024956206,0.00033484062,0.0004139269],"domain_scores_gemma":[0.9954716,0.0003259056,0.00009198648,0.0039675217,0.00003982753,0.00010315913],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002899335,0.0002777958,0.0002880338,0.0003089891,0.00030649116,0.00008959028,0.0019880477,0.000110621004,0.000022223332],"category_scores_gemma":[0.000011926913,0.00032519354,0.00012401975,0.0006389612,0.00028353257,0.0002577331,0.00035023948,0.0005092847,0.0011017644],"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.0000051943666,0.0002696732,0.0003609897,0.000109340064,0.00017774291,0.0000049545697,0.004937604,0.017012214,0.9278305,0.008793534,0.029923273,0.01057496],"study_design_scores_gemma":[0.00044983882,0.000020555015,0.0025962286,0.00010710003,0.0000802089,0.0000084711355,0.0002893928,0.8373848,0.08110281,0.000847451,0.07625832,0.0008548043],"about_ca_topic_score_codex":0.000020280766,"about_ca_topic_score_gemma":0.00001019116,"teacher_disagreement_score":0.8467277,"about_ca_system_score_codex":0.00017879093,"about_ca_system_score_gemma":0.0000135455975,"threshold_uncertainty_score":0.99992},"labels":[],"label_agreement":null},{"id":"W4388486624","doi":"10.1109/lwc.2023.3326635","title":"IEEE Wireless Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; University of Essex; University of Wollongong; Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Polytechnique Montréal; National Institute of Informatics; University of Miami","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.06812218074900049,"score_gpt":0.24569989062717518,"score_spread":0.17757770987817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388486624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597746,0.0007585571,0.013504883,0.24281907,0.007981385,0.0021104685,0.003240347,0.0020412267,0.16776946],"genre_scores_gemma":[0.9807755,0.0026056927,0.0017191065,0.008101513,0.00011578401,0.00057337584,0.0012181748,0.000053052325,0.0048378063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758744,0.000090316455,0.0012187765,0.0004354889,0.00011044635,0.0005575275],"domain_scores_gemma":[0.9940487,0.00028277948,0.0007879324,0.0046077776,0.00013873607,0.00013407237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011976517,0.00028243958,0.00046865686,0.0009598888,0.0011717065,0.00049307704,0.0033683092,0.00011651979,0.0002719786],"category_scores_gemma":[0.00008320501,0.0003635976,0.00020973424,0.0014306568,0.0007611819,0.0019631705,0.0006507362,0.0003886616,0.036419712],"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.000009538293,0.00013952897,0.0043699997,0.00004403554,0.00022421656,6.929556e-7,0.0042352304,0.0005030163,0.0017439368,0.10516703,0.87885463,0.004708139],"study_design_scores_gemma":[0.0010448332,0.000015950827,0.006393731,0.00005566999,0.000033663662,0.0000052729956,0.0015680419,0.057341866,0.00024498618,0.0006730901,0.9317044,0.0009184727],"about_ca_topic_score_codex":0.00044038406,"about_ca_topic_score_gemma":0.00006778798,"teacher_disagreement_score":0.4210009,"about_ca_system_score_codex":0.00031514166,"about_ca_system_score_gemma":0.000032601423,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4388838024","doi":"10.1109/lwc.2023.3333965","title":"Competitive IRS Assignment for IRS-Based NOMA System","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":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","keywords":"Computer science; Noma; Telecommunications link; Transmitter power output; Mathematical optimization; Quality of service; Optimization problem; Transmission (telecommunications); Wireless; Minification; Channel (broadcasting); Convex optimization; Computer network; Algorithm; Regular polygon; Telecommunications; Mathematics; Transmitter","score_opus":0.030930960118805743,"score_gpt":0.263541900233236,"score_spread":0.23261094011443023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388838024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08160545,0.0005994374,0.87910724,0.016424822,0.00082588004,0.0021203698,0.00036189536,0.015398236,0.003556687],"genre_scores_gemma":[0.97150844,0.0003095804,0.0252234,0.00027805706,0.00003160453,0.0021768936,0.0003544662,0.00008891412,0.000028637416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841404,0.00011363108,0.00050424744,0.00027368832,0.00022141183,0.00047299944],"domain_scores_gemma":[0.99465775,0.0013229743,0.0001338211,0.003710233,0.00010156266,0.00007366854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002738788,0.00030108157,0.0003526735,0.0004034384,0.00049086724,0.00006557383,0.0024482466,0.00013997247,0.0000034464754],"category_scores_gemma":[0.000042053347,0.00034771347,0.00014797467,0.00080178055,0.00037590883,0.00017815387,0.00023929577,0.0003954955,0.00010880968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026106442,0.00013158955,0.00029446304,0.0005812562,0.0002666971,0.0000070492374,0.00057519425,0.6676558,0.16856304,0.118205115,0.018318687,0.025375001],"study_design_scores_gemma":[0.0012629316,0.00004419656,0.00052511686,0.00042124846,0.00004147236,0.000005004507,0.0028315664,0.8774257,0.055927947,0.00016300971,0.060502063,0.0008497435],"about_ca_topic_score_codex":0.00000896168,"about_ca_topic_score_gemma":0.00003029159,"teacher_disagreement_score":0.889903,"about_ca_system_score_codex":0.0006364088,"about_ca_system_score_gemma":0.00003351116,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W4388919309","doi":"10.1109/lwc.2023.3335622","title":"Robust Design for IRS-Assisted MISO-NOMA Systems: A DRL-Based Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; HORIZON EUROPE Marie Sklodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Computer network; Telecommunications link","score_opus":0.1182114896886735,"score_gpt":0.2700910521237607,"score_spread":0.1518795624350872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388919309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125499135,0.0009056478,0.97461057,0.0032346786,0.00027565344,0.0014924008,0.00007918575,0.0065072654,0.00034467416],"genre_scores_gemma":[0.80730397,0.0004930078,0.18734984,0.0001893491,0.000031011332,0.0040254667,0.00043304134,0.00012230087,0.00005198772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978878,0.00025793473,0.00065169006,0.00036524434,0.00024226237,0.00059505925],"domain_scores_gemma":[0.992902,0.0015616156,0.00017528523,0.0051326505,0.0001383647,0.00009013153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004992545,0.00038923352,0.0004613323,0.00059704616,0.0005899523,0.00013458777,0.0034434188,0.00023617019,0.0000018791367],"category_scores_gemma":[0.00008830878,0.00044154047,0.0001650285,0.0014376573,0.00040945743,0.00024891473,0.00022609996,0.00052634714,0.00004786089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011488156,0.000075737014,0.00003509929,0.00020232849,0.0000911023,0.0000011379564,0.00015047347,0.9506042,0.028698638,0.001594727,0.01332215,0.0052129175],"study_design_scores_gemma":[0.0007055752,0.0000209779,0.00013718208,0.00012606141,0.000029818832,0.0000061418723,0.0006119101,0.98520297,0.004540313,0.00006423717,0.008040036,0.00051475066],"about_ca_topic_score_codex":0.000018563867,"about_ca_topic_score_gemma":0.000008806958,"teacher_disagreement_score":0.7947541,"about_ca_system_score_codex":0.00034730867,"about_ca_system_score_gemma":0.000051414903,"threshold_uncertainty_score":0.99980366},"labels":[],"label_agreement":null},{"id":"W4389252565","doi":"10.1109/lwc.2023.3338273","title":"Aerial IRS-Enabled Secure Mobile Communications: Joint 3-D Trajectory and Beamforming Design","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shanghai","keywords":"Computer science; Beamforming; Trajectory; Benchmark (surveying); Real-time computing; Channel (broadcasting); Optimization problem; Mobile telephony; Computer network; Algorithm; Mobile radio; Telecommunications","score_opus":0.03397268780542367,"score_gpt":0.24089144734524318,"score_spread":0.2069187595398195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389252565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52808774,0.0025426063,0.4526987,0.007195512,0.00058883906,0.0030409389,0.000114813025,0.0040812395,0.0016495865],"genre_scores_gemma":[0.91976976,0.0075513185,0.06993716,0.00036199213,0.000079464095,0.0018530638,0.0003023819,0.00010010945,0.000044726727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872124,0.00015169871,0.0004392326,0.00021530112,0.00015032974,0.00032218895],"domain_scores_gemma":[0.99674165,0.0003369489,0.00008628803,0.0026728923,0.0000673129,0.00009493249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003792956,0.00022623173,0.00024304037,0.00029129072,0.00063201255,0.00012210835,0.0010859764,0.00011756041,0.000012033587],"category_scores_gemma":[0.00001449803,0.0002593207,0.0000640048,0.0008155801,0.00028072318,0.0002996916,0.00023583823,0.00035736058,0.00008628548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015533553,0.00015848839,0.00014826842,0.0001609995,0.00021336669,0.0000022836396,0.005815641,0.643467,0.29583785,0.0025000968,0.029092314,0.022588162],"study_design_scores_gemma":[0.00060237787,0.00002329755,0.0004128632,0.000084226274,0.000057106685,0.000011943739,0.00065567135,0.9740412,0.0040353364,0.00013737597,0.019438017,0.0005005832],"about_ca_topic_score_codex":0.000039593775,"about_ca_topic_score_gemma":0.000042265565,"teacher_disagreement_score":0.39168203,"about_ca_system_score_codex":0.00013400584,"about_ca_system_score_gemma":0.00003178784,"threshold_uncertainty_score":0.9999859},"labels":[],"label_agreement":null},{"id":"W4389475140","doi":"10.1109/lwc.2023.3334382","title":"IEEE Wireless Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; University of Essex; University of Wollongong; Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Polytechnique Montréal; National Institute of Informatics; University of Miami","keywords":"Computer science; Wireless; Computer network; Telecommunications","score_opus":0.06812218074900049,"score_gpt":0.24569989062717518,"score_spread":0.17757770987817467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389475140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597746,0.0007585571,0.013504883,0.24281907,0.007981385,0.0021104685,0.003240347,0.0020412267,0.16776946],"genre_scores_gemma":[0.9807755,0.0026056927,0.0017191065,0.008101513,0.00011578401,0.00057337584,0.0012181748,0.000053052325,0.0048378063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758744,0.000090316455,0.0012187765,0.0004354889,0.00011044635,0.0005575275],"domain_scores_gemma":[0.9940487,0.00028277948,0.0007879324,0.0046077776,0.00013873607,0.00013407237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011976517,0.00028243958,0.00046865686,0.0009598888,0.0011717065,0.00049307704,0.0033683092,0.00011651979,0.0002719786],"category_scores_gemma":[0.00008320501,0.0003635976,0.00020973424,0.0014306568,0.0007611819,0.0019631705,0.0006507362,0.0003886616,0.036419712],"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.000009538293,0.00013952897,0.0043699997,0.00004403554,0.00022421656,6.929556e-7,0.0042352304,0.0005030163,0.0017439368,0.10516703,0.87885463,0.004708139],"study_design_scores_gemma":[0.0010448332,0.000015950827,0.006393731,0.00005566999,0.000033663662,0.0000052729956,0.0015680419,0.057341866,0.00024498618,0.0006730901,0.9317044,0.0009184727],"about_ca_topic_score_codex":0.00044038406,"about_ca_topic_score_gemma":0.00006778798,"teacher_disagreement_score":0.4210009,"about_ca_system_score_codex":0.00031514166,"about_ca_system_score_gemma":0.000032601423,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4390659262","doi":"10.1109/lwc.2023.3343088","title":"IEEE Wireless Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontifícia Universidade Católica do Rio de Janeiro; University of Bristol; Oak Ridge National Laboratory; Oulun Yliopisto; University of New South Wales; Indian Institute of Technology, Patna; Polytechnique Montréal; University of Wollongong; University of Essex; National Institute of Informatics; University of Miami","keywords":"Wireless; Computer science; Computer network; Telecommunications","score_opus":0.0535688105798536,"score_gpt":0.24288500463919543,"score_spread":0.18931619405934183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659262","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2533801,0.0075402455,0.06462881,0.3356543,0.016652191,0.0026169561,0.00457602,0.0023273064,0.3126241],"genre_scores_gemma":[0.9827852,0.0026951123,0.002537394,0.0067656753,0.00014578774,0.00042813428,0.0006221057,0.000051718333,0.0039688214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976858,0.00007936106,0.001193801,0.00047718824,0.00010008379,0.00046375388],"domain_scores_gemma":[0.9950334,0.00028432554,0.00044996958,0.0039980956,0.000109549874,0.00012464938],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010040537,0.00029320057,0.0004314277,0.000813733,0.0008497168,0.0010084923,0.0029070165,0.00011691199,0.0004162257],"category_scores_gemma":[0.000048744303,0.0003606386,0.00023655675,0.0009142065,0.00076143397,0.0025760033,0.00047029817,0.00048383453,0.0211827],"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.000007493459,0.00014074513,0.0011107099,0.00009655851,0.00033049964,0.0000010830427,0.004633813,0.00021047787,0.0016728593,0.27823323,0.70436966,0.00919285],"study_design_scores_gemma":[0.0003901963,0.000011063364,0.0007222386,0.00009071639,0.00003544467,0.000008170533,0.0006022713,0.055790935,0.0001746059,0.00055525906,0.9410087,0.0006104004],"about_ca_topic_score_codex":0.00043005048,"about_ca_topic_score_gemma":0.000058600974,"teacher_disagreement_score":0.72940516,"about_ca_system_score_codex":0.00042474276,"about_ca_system_score_gemma":0.000045699715,"threshold_uncertainty_score":0.99988455},"labels":[],"label_agreement":null},{"id":"W4391936127","doi":"10.1109/lwc.2024.3367132","title":"Extremely Large-Scale Array System: Cooperative NFC or FFC?","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Relay; Correctness; Near and far field; Base station; Communications system; Near field communication; Rayleigh fading; Topology (electrical circuits); Channel (broadcasting); Telecommunications; Algorithm; Electrical engineering; Physics; Fading; Engineering; Ultra high frequency; Optics","score_opus":0.04981561741888009,"score_gpt":0.29605440713827846,"score_spread":0.2462387897193984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391936127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008684367,0.004019251,0.94239545,0.036024734,0.0011240368,0.0005664541,0.000026750213,0.0016115287,0.0055474583],"genre_scores_gemma":[0.9644948,0.0019840582,0.02933271,0.0028172557,0.00013451223,0.00029931875,0.000037731286,0.000044501616,0.000855079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972391,0.0008124874,0.00056598376,0.00057706796,0.0003302093,0.00047510955],"domain_scores_gemma":[0.9940749,0.0006988687,0.00011009922,0.0047355,0.00022487504,0.00015574996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007271626,0.00031995188,0.00033995457,0.0002833743,0.0011177104,0.00089981884,0.0051602605,0.00009340961,0.00004398918],"category_scores_gemma":[0.000024785817,0.0002746666,0.00014763183,0.0016699231,0.00024983872,0.0009661486,0.0008357812,0.0006852141,0.00046134807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045860328,0.0006742807,0.00022765274,0.0003575909,0.0005361933,0.00009779976,0.030703014,0.001229066,0.23639573,0.5108883,0.10347445,0.11537009],"study_design_scores_gemma":[0.0006139278,0.000067181056,0.00017350253,0.0010181258,0.00004935907,0.00011261119,0.0009863259,0.6656385,0.005723479,0.000040893978,0.32468286,0.0008931977],"about_ca_topic_score_codex":0.00001575904,"about_ca_topic_score_gemma":0.00034017878,"teacher_disagreement_score":0.9558105,"about_ca_system_score_codex":0.00029379674,"about_ca_system_score_gemma":0.0002056087,"threshold_uncertainty_score":0.99997056},"labels":[],"label_agreement":null},{"id":"W4391992556","doi":"10.1109/lwc.2024.3368272","title":"Sum Rate Maximization for RSMA-Assisted CF mMIMO Networks With SWIPT Users","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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 Alberta","funders":"","keywords":"Computer science; Maximization; Mathematical optimization; Mathematics","score_opus":0.018620906360397645,"score_gpt":0.24038667618888848,"score_spread":0.22176576982849083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391992556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00855848,0.00074385625,0.98563224,0.0019703584,0.0006820131,0.00079530687,0.000033850283,0.0012414054,0.0003424829],"genre_scores_gemma":[0.94961363,0.00035741026,0.048106413,0.0003049577,0.00012855195,0.0006843436,0.00043548417,0.00018072869,0.0001884835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998822,0.000093957715,0.00038966376,0.00026632805,0.00009890686,0.00032918432],"domain_scores_gemma":[0.99812317,0.00033652975,0.000071320974,0.0012950207,0.000101516925,0.000072423565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020420014,0.00025993655,0.00023912585,0.00020744946,0.00024392713,0.00018328356,0.0005813551,0.00011196157,0.000006382373],"category_scores_gemma":[0.00001116403,0.00026450146,0.00007879538,0.00066983054,0.0001113113,0.0004678031,0.000037718135,0.00028042588,0.000022556787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013398597,0.000016165537,0.000070014845,0.00013509857,0.00012306623,0.0000021262165,0.00020941987,0.9780244,0.01016799,0.0005245545,0.0073216786,0.0033920817],"study_design_scores_gemma":[0.00038219462,0.000017510503,0.00010524545,0.0002741795,0.0000715021,0.000011293323,0.00007488959,0.98914415,0.000850292,0.000010984198,0.0087166075,0.00034114477],"about_ca_topic_score_codex":0.000021172014,"about_ca_topic_score_gemma":0.0001602843,"teacher_disagreement_score":0.9410551,"about_ca_system_score_codex":0.00023571747,"about_ca_system_score_gemma":0.000026805092,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W4396506601","doi":"10.1109/lwc.2024.3395511","title":"Efficient User-Centric AP Clustering Through Stable UE-AP Matching for Indoor VLC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; Natural Science Foundation of Xiamen City","keywords":"Computer science; Visible light communication; Cluster analysis; Matching (statistics); Computer network; Light-emitting diode; Artificial intelligence; Optoelectronics; Mathematics; Physics","score_opus":0.027218066184729328,"score_gpt":0.2658453725123714,"score_spread":0.23862730632764206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396506601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3103042,0.013212235,0.6602217,0.006614148,0.0016432004,0.0014862765,0.00012381916,0.005311544,0.0010828719],"genre_scores_gemma":[0.9707241,0.0018321847,0.025832096,0.00019150329,0.00007831921,0.0010429627,0.00006818778,0.00016495142,0.00006567485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777895,0.00012856926,0.0007543101,0.0003846384,0.0002925049,0.00066100317],"domain_scores_gemma":[0.99514216,0.0011630523,0.00009081989,0.0034276412,0.000091979964,0.00008435719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003967369,0.00039218715,0.0004441314,0.00035104554,0.00050281273,0.0005442667,0.0026967996,0.00021735742,0.00000673519],"category_scores_gemma":[0.000040296472,0.00041700772,0.00017690101,0.00091942895,0.00026939815,0.00031317637,0.00056940824,0.0008411525,0.00012491364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001339913,0.00016833557,0.000052540854,0.0014314223,0.00036673323,0.000006849045,0.0021000144,0.8788861,0.0560907,0.042204335,0.0071936604,0.011485906],"study_design_scores_gemma":[0.00034263797,0.00001629154,0.000028497576,0.0006217595,0.000049923052,0.000015436715,0.0007967575,0.95836025,0.003463493,0.00014126323,0.035635,0.00052866986],"about_ca_topic_score_codex":0.0001127438,"about_ca_topic_score_gemma":0.000032353513,"teacher_disagreement_score":0.66041994,"about_ca_system_score_codex":0.00051995926,"about_ca_system_score_gemma":0.00003923756,"threshold_uncertainty_score":0.99982816},"labels":[],"label_agreement":null},{"id":"W4396680560","doi":"10.1109/lwc.2024.3397081","title":"Near-Field ISAC: Beamforming for Multi-Target Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization Technologies","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":"Beamforming; Computer science; Base station; Transmitter power output; Benchmark (surveying); Electronic engineering; Real-time computing; Telecommunications; Engineering; Transmitter","score_opus":0.027126239652734502,"score_gpt":0.27196046487934294,"score_spread":0.24483422522660844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053165242,0.00073507515,0.9410161,0.0017873328,0.0007458231,0.00028501832,0.00001829334,0.0020807881,0.00016636506],"genre_scores_gemma":[0.9499018,0.0002175142,0.049040083,0.00040827208,0.00005105346,0.00026895653,0.000027635853,0.000051529994,0.000033128705],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993203,0.000017401453,0.0002278422,0.0001384259,0.000075962635,0.00022006201],"domain_scores_gemma":[0.99895966,0.0001980706,0.00001923896,0.0007627955,0.000032593176,0.00002766318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011151618,0.00013895657,0.000122066354,0.00015048955,0.00029361446,0.00014472588,0.0005343198,0.00011780394,0.000006637892],"category_scores_gemma":[0.000026949168,0.00014861913,0.00009032928,0.00031190168,0.00009002195,0.00021759846,0.000047025613,0.00027695496,0.00004013961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017207954,0.000082352824,0.00025759073,0.00076388766,0.00033924673,0.000005533906,0.0031143518,0.15186892,0.49566412,0.0046756375,0.017651664,0.3255595],"study_design_scores_gemma":[0.000116735704,0.0000110585615,0.000011114366,0.000051245137,0.000015040775,0.0000040060777,0.0001033912,0.7792883,0.17526206,0.00006173603,0.044914998,0.00016034074],"about_ca_topic_score_codex":0.000025496187,"about_ca_topic_score_gemma":0.000060693605,"teacher_disagreement_score":0.89673656,"about_ca_system_score_codex":0.00009625971,"about_ca_system_score_gemma":0.000012831777,"threshold_uncertainty_score":0.60605127},"labels":[],"label_agreement":null},{"id":"W4399417715","doi":"10.1109/lwc.2024.3410173","title":"Hybrid <i>k</i>-Preemptive Transmission Scheme for Minimal Age of Information in IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Queen's University; University of Windsor","funders":"","keywords":"Computer science; Scheme (mathematics); Computer network; Transmission (telecommunications); Information transmission; Internet of Things; Mathematics; Telecommunications; Embedded system","score_opus":0.015713391623175373,"score_gpt":0.25191581789776796,"score_spread":0.2362024262745926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399417715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016663957,0.00022030425,0.9761123,0.005852568,0.00015983763,0.00048788838,0.000014517148,0.00016486496,0.00032373975],"genre_scores_gemma":[0.7020766,0.00016545475,0.2964228,0.000969629,0.000018968323,0.00014730691,0.00017707133,0.000010851974,0.000011315459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987034,0.00007890559,0.0006636944,0.00014458562,0.00020471295,0.0002047008],"domain_scores_gemma":[0.9983381,0.00031718324,0.00017243778,0.0010101468,0.000114071714,0.000048033413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043303292,0.00014120458,0.0001796553,0.00042080105,0.00012073965,0.00019062946,0.0015366797,0.00006440962,0.0000028580114],"category_scores_gemma":[0.000019227924,0.0001480354,0.000096542455,0.00055929495,0.000113395196,0.0020127096,0.0001293398,0.00022417454,0.0000110395995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009361771,0.00023200156,0.00015903288,0.0006429077,0.00011810822,0.000008034817,0.018286716,0.5165224,0.020838056,0.06527849,0.01349453,0.3643261],"study_design_scores_gemma":[0.00033615166,0.00002598468,0.00014451893,0.00025770205,0.000005497966,0.000004905726,0.000048788654,0.99031234,0.0020981033,0.00011417663,0.0064964998,0.000155357],"about_ca_topic_score_codex":0.00001936732,"about_ca_topic_score_gemma":0.000004401961,"teacher_disagreement_score":0.68541265,"about_ca_system_score_codex":0.00010048405,"about_ca_system_score_gemma":0.00007189643,"threshold_uncertainty_score":0.60367084},"labels":[],"label_agreement":null},{"id":"W4399526704","doi":"10.1109/lwc.2024.3412974","title":"Mutual Information-Based Integrated Sensing and Communications: A WMMSE Framework","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Sichuan Province; China Mobile Research Institute; Natural Science Foundation of Shenzhen City","keywords":"Computer science; Mutual information; Computer network; Telecommunications; Artificial intelligence","score_opus":0.01770513243932297,"score_gpt":0.25860405021839783,"score_spread":0.24089891777907485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399526704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036533044,0.0008520997,0.9610167,0.032516584,0.00051199767,0.00022226352,0.00003740039,0.00088016514,0.00030948545],"genre_scores_gemma":[0.73047686,0.00038609258,0.26448336,0.0044361493,0.000038634116,0.000034292545,0.00011617917,0.000016117516,0.000012295867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849486,0.00028649397,0.00045908775,0.0002529455,0.00023498268,0.00027159846],"domain_scores_gemma":[0.9948967,0.0011516636,0.00010993703,0.0035585656,0.000161859,0.0001212885],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035403133,0.00021121532,0.00018920493,0.00033446765,0.0006113372,0.0012967308,0.0021224667,0.00012573981,0.000004576701],"category_scores_gemma":[0.000063608786,0.00021215585,0.00008502784,0.0013703172,0.00041969912,0.0010923198,0.0004478058,0.0007721531,0.00011998085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009647635,0.00008751047,0.000044143988,0.00006246054,0.00012423618,0.000010684625,0.0024256941,0.0021105963,0.0011282272,0.07564817,0.010819326,0.9075293],"study_design_scores_gemma":[0.0001297024,0.00001491531,0.000037864822,0.0002264634,0.00001434699,0.000028650624,0.0001285008,0.891514,0.0001739998,0.00054195704,0.106960446,0.00022912276],"about_ca_topic_score_codex":0.00014457009,"about_ca_topic_score_gemma":0.000039553273,"teacher_disagreement_score":0.9073002,"about_ca_system_score_codex":0.0001159359,"about_ca_system_score_gemma":0.00011253695,"threshold_uncertainty_score":0.99974},"labels":[],"label_agreement":null},{"id":"W4399563084","doi":"10.1109/lwc.2024.3413544","title":"QoS-Aware Deep Unsupervised Learning for STAR-RIS Assisted Networks: A Novel Differentiable Projection Framework","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of the Fraser Valley; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Differentiable function; Artificial intelligence; Projection (relational algebra); Quality of service; Deep learning; Star (game theory); Computer network; Algorithm; Mathematics","score_opus":0.029587898679513776,"score_gpt":0.2716755902637346,"score_spread":0.24208769158422083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399563084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041780595,0.0033505396,0.9456494,0.0025239354,0.000634489,0.000801759,0.000026097845,0.0051596873,0.00007352521],"genre_scores_gemma":[0.91445184,0.0026712304,0.0805022,0.00016817954,0.00012079919,0.0015770845,0.00027793925,0.000179191,0.00005156698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981858,0.00011094429,0.0005679305,0.00040109962,0.0002036436,0.00053059304],"domain_scores_gemma":[0.99588096,0.0011835445,0.00009612811,0.0026476486,0.00011942355,0.00007226878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002208059,0.0003916342,0.00037822156,0.00040873478,0.0006481735,0.00029218456,0.0018237601,0.000317494,0.0000140355],"category_scores_gemma":[0.0000785943,0.0004331587,0.00019360211,0.0011413137,0.00026222246,0.00046658644,0.00027628202,0.0014681851,0.000022018921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027836693,0.00020434344,0.0002445149,0.00058562896,0.000554351,0.0000026569069,0.0011228159,0.7902294,0.090207145,0.0059516146,0.0030100096,0.1078597],"study_design_scores_gemma":[0.00029126392,0.000027036333,0.0002801585,0.00048624264,0.000055444565,0.000009155664,0.00059962465,0.9800601,0.0021385364,0.00020123036,0.015359465,0.000491754],"about_ca_topic_score_codex":0.00002731956,"about_ca_topic_score_gemma":0.00006841428,"teacher_disagreement_score":0.87267125,"about_ca_system_score_codex":0.0003697925,"about_ca_system_score_gemma":0.00002785104,"threshold_uncertainty_score":0.999812},"labels":[],"label_agreement":null},{"id":"W4399995522","doi":"10.1109/lwc.2024.3418780","title":"Robust Energy Efficient Beamforming Design for ISAC Full-Duplex Communication Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Full-Duplex Wireless Communications","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":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Beamforming; Computer science; Duplex (building); Electronic engineering; Telecommunications; Engineering","score_opus":0.04773910854113959,"score_gpt":0.24420107575416777,"score_spread":0.1964619672130282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399995522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11180383,0.015612416,0.8633178,0.004172148,0.001051122,0.0011825976,0.00014505009,0.0024378826,0.000277151],"genre_scores_gemma":[0.92725766,0.0032356242,0.0653498,0.00024306835,0.00013703814,0.0028840273,0.0005032974,0.00026016412,0.00012931565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703985,0.00042937254,0.0010146952,0.00045566354,0.00036045973,0.0006999716],"domain_scores_gemma":[0.9913145,0.0024343,0.00014093437,0.0057256827,0.00020421474,0.00018040516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084325345,0.00052960945,0.0005014057,0.0005850868,0.0009791035,0.0005769054,0.003717146,0.00024218857,0.000012285101],"category_scores_gemma":[0.000043156368,0.000596426,0.00027077572,0.0010497333,0.00042878272,0.0004361579,0.000351677,0.000703787,0.00008974089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001050553,0.0000792685,0.0000023688062,0.0001774998,0.00020153204,0.0000011963367,0.0008276394,0.9171207,0.04689121,0.019436546,0.0117111765,0.0035403776],"study_design_scores_gemma":[0.00032197652,0.000024576753,0.000007502518,0.000523315,0.00010399306,0.00003398933,0.00032942113,0.9501168,0.0018347288,0.0000095984915,0.046086483,0.0006076049],"about_ca_topic_score_codex":0.00020727354,"about_ca_topic_score_gemma":0.000112626716,"teacher_disagreement_score":0.8154538,"about_ca_system_score_codex":0.0006689077,"about_ca_system_score_gemma":0.000097769655,"threshold_uncertainty_score":0.9996487},"labels":[],"label_agreement":null},{"id":"W4400275910","doi":"10.1109/lwc.2024.3422841","title":"Content-Aware Cross-Modal Stream Transmission","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Data Compression Techniques","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 Waterloo","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Modal; Computer network; Telecommunications","score_opus":0.05226353412076621,"score_gpt":0.33223985804950185,"score_spread":0.2799763239287356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400275910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015152108,0.00089455175,0.96529067,0.015717197,0.00033942718,0.00025966662,0.000040456434,0.002006904,0.00029901875],"genre_scores_gemma":[0.8646386,0.0005036772,0.1329608,0.0014339875,0.000045107143,0.00014985877,0.000062347026,0.0000335889,0.00017200665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982814,0.00017553329,0.00040043818,0.00051120494,0.00031222007,0.0003191726],"domain_scores_gemma":[0.9955278,0.0003527435,0.00007701441,0.0038281078,0.000086170694,0.0001281519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021684336,0.00022774845,0.00020069956,0.00022087737,0.0004071831,0.00055210514,0.004837078,0.00009022811,0.000015664717],"category_scores_gemma":[0.000008674606,0.00020920605,0.00012692623,0.0005380035,0.00029187577,0.0015820824,0.00065299287,0.00052140024,0.000094077564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009609876,0.00018831475,0.00024032872,0.00008803262,0.000060057755,0.00004891849,0.00081649795,0.00028294063,0.33152667,0.049251366,0.02074116,0.5967461],"study_design_scores_gemma":[0.00059712294,0.00007551917,0.0010289765,0.0011073047,0.00002742321,0.00009884838,0.00006153961,0.5605195,0.17227665,0.0030046336,0.26010507,0.0010974021],"about_ca_topic_score_codex":0.00005413161,"about_ca_topic_score_gemma":0.000005348431,"teacher_disagreement_score":0.84948653,"about_ca_system_score_codex":0.000102379214,"about_ca_system_score_gemma":0.000065801236,"threshold_uncertainty_score":0.8988575},"labels":[],"label_agreement":null},{"id":"W4400679915","doi":"10.1109/lwc.2024.3429236","title":"Full-Duplex Cooperative NOMA With Signal Space Diversity: Minimizing SIC Operations","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Noma; Computer science; Duplex (building); Antenna diversity; Space (punctuation); SIGNAL (programming language); Diversity (politics); Signal-to-noise ratio (imaging); Cooperative diversity; Telecommunications; Telecommunications link; Wireless; Wireless network","score_opus":0.022807781414438857,"score_gpt":0.24098230356133143,"score_spread":0.2181745221468926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400679915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40057653,0.0022049772,0.5796231,0.012441784,0.00019862261,0.0005169692,0.00006944308,0.0036554004,0.0007131711],"genre_scores_gemma":[0.96134233,0.0012422955,0.036552716,0.00029130751,0.00003957237,0.00026236926,0.00009501266,0.00009309289,0.000081272825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853534,0.000121746714,0.00035290417,0.0003470447,0.00025658845,0.00038639107],"domain_scores_gemma":[0.99680984,0.00043915253,0.000038360788,0.0025041858,0.000121420206,0.000087024855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013593659,0.0003585223,0.00030616397,0.0003746914,0.0010334,0.0002683198,0.0020883486,0.0001276272,0.000036529324],"category_scores_gemma":[0.0000142103745,0.0003556335,0.0000855779,0.001030328,0.0006597819,0.0007759051,0.00073408784,0.0008661488,0.00014262604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015531612,0.00006235567,0.0001002959,0.000073695155,0.00028743662,0.000019787334,0.002342726,0.819165,0.14824283,0.01722433,0.0027471548,0.00971886],"study_design_scores_gemma":[0.00043631718,0.00008104421,0.00010155,0.0003920565,0.000073779025,0.00005117123,0.0019466636,0.96429104,0.02296438,0.00004807239,0.008789832,0.0008241139],"about_ca_topic_score_codex":0.000053727603,"about_ca_topic_score_gemma":0.00038101268,"teacher_disagreement_score":0.56076586,"about_ca_system_score_codex":0.00030411276,"about_ca_system_score_gemma":0.00005478088,"threshold_uncertainty_score":0.99988955},"labels":[],"label_agreement":null},{"id":"W4400878012","doi":"10.1109/lwc.2024.3432157","title":"IRS-Enabled Secure Backscatter Communication Design for V2I MIMO Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Backscatter (email); MIMO; Computer science; Computer network; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.024378682716458294,"score_gpt":0.24528948674020276,"score_spread":0.22091080402374447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400878012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01691273,0.007984709,0.9623823,0.007033351,0.00123241,0.0008774492,0.000028851804,0.0024798731,0.0010682796],"genre_scores_gemma":[0.9364717,0.0024427113,0.05762478,0.0011639766,0.00034680124,0.0011950306,0.0003144397,0.0002617833,0.00017878153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783415,0.0003421138,0.0006239017,0.00038002682,0.00019545479,0.000624366],"domain_scores_gemma":[0.9940292,0.0023717603,0.00008106392,0.0032826732,0.00010545888,0.00012983728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068087387,0.00042144288,0.0003670755,0.00023352796,0.00048698462,0.0004075343,0.0022199703,0.00027831245,0.000020394536],"category_scores_gemma":[0.000025963533,0.0004687297,0.00019904859,0.000674836,0.0002985062,0.0004678211,0.00018265101,0.0009591322,0.00006444735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008777609,0.000033326553,0.0000357059,0.00014698574,0.00020510593,0.0000028152317,0.00042805923,0.8577283,0.0061820527,0.0029060105,0.12492572,0.0073971404],"study_design_scores_gemma":[0.00028225195,0.000015022669,0.00005171671,0.000576889,0.00008726777,0.000014780432,0.00004050503,0.95355195,0.0010200642,0.00019590439,0.0436448,0.0005188497],"about_ca_topic_score_codex":0.000028480528,"about_ca_topic_score_gemma":0.00007571386,"teacher_disagreement_score":0.91955894,"about_ca_system_score_codex":0.00029312167,"about_ca_system_score_gemma":0.00004203358,"threshold_uncertainty_score":0.9997764},"labels":[],"label_agreement":null},{"id":"W4400878026","doi":"10.1109/lwc.2024.3432391","title":"Simplex Transformation-Based Deep Unsupervised Learning for Optimization: Power Control With QoS Constraints in Multi-User Interference Channel","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interference (communication); Power control; Quality of service; Channel (broadcasting); Simplex; Transformation (genetics); Artificial intelligence; Power (physics); Mathematical optimization; Computer network; Mathematics","score_opus":0.01925534058184105,"score_gpt":0.24992544689358653,"score_spread":0.23067010631174548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400878026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026565273,0.0002441857,0.9936399,0.0013327416,0.00021948095,0.0011417277,0.00004834618,0.0005909088,0.00012622015],"genre_scores_gemma":[0.95784426,0.000053401833,0.040888734,0.00026138395,0.000021117703,0.0005921224,0.0002389746,0.000089747955,0.000010241377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987701,0.00010725984,0.00048429333,0.0002279911,0.000106371204,0.00030399393],"domain_scores_gemma":[0.99873435,0.00043922794,0.000055302484,0.0005924837,0.00011562035,0.00006302911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018772506,0.00025587706,0.00026672505,0.0003256549,0.00015777897,0.000120370685,0.00046897185,0.000099064164,0.000021263666],"category_scores_gemma":[0.000020031883,0.00026497754,0.00006642582,0.00047820417,0.00017292409,0.00050339504,0.000011506055,0.00036702384,0.000009351252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022251386,0.000030588446,0.00005138383,0.00015978594,0.00005348302,0.0000017850126,0.0019684078,0.99375665,0.0025327995,0.00024790436,0.000033743163,0.0011412008],"study_design_scores_gemma":[0.0017893118,0.00002861764,0.000015727843,0.00040358293,0.000024830353,0.0000047080166,0.0005586381,0.995923,0.00050618756,0.0000021363142,0.0004372163,0.0003060333],"about_ca_topic_score_codex":0.000011365217,"about_ca_topic_score_gemma":0.00012158066,"teacher_disagreement_score":0.95518774,"about_ca_system_score_codex":0.00020015646,"about_ca_system_score_gemma":0.000046581896,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4401507783","doi":"10.1109/lwc.2024.3442170","title":"RIS-Assisted Receive Generalized Space-Shift Keying and Receive Generalized Spatial Modulation","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Saskatchewan","funders":"","keywords":"Spatial modulation; Modulation (music); Computer science; Keying; Space (punctuation); Phase-shift keying; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Bit error rate; Combinatorics; Decoding methods; Acoustics; Channel (broadcasting); MIMO","score_opus":0.027894753974605585,"score_gpt":0.2677257487622839,"score_spread":0.2398309947876783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401507783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6993509,0.0055837543,0.27821308,0.0110661555,0.00059281965,0.00064176397,0.00006317994,0.0040742564,0.00041409553],"genre_scores_gemma":[0.93743205,0.008036848,0.053394783,0.00024129963,0.0000827152,0.00040486286,0.00021818765,0.00014311317,0.000046133442],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978294,0.00031318088,0.0006688835,0.0004665372,0.0002725249,0.00044951125],"domain_scores_gemma":[0.9960757,0.0005021359,0.00013453866,0.0030973156,0.00008210944,0.00010822151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027992547,0.000446863,0.0004605185,0.0005340269,0.00050000317,0.00031773202,0.0014411127,0.00026537036,0.000021921962],"category_scores_gemma":[0.000051556643,0.00049710734,0.00013389366,0.0008163344,0.00049620174,0.0005932146,0.00037428722,0.00090357964,0.00005422325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041999607,0.00009303437,0.00057379133,0.00029799662,0.0005504819,0.000017037504,0.0041531553,0.14093551,0.54220605,0.019247046,0.0043503083,0.28753358],"study_design_scores_gemma":[0.0009638788,0.000025310203,0.0046375054,0.0004287199,0.00008598436,0.00003107722,0.00025920215,0.9550831,0.019164559,0.0017610613,0.016526354,0.0010332509],"about_ca_topic_score_codex":0.00028856302,"about_ca_topic_score_gemma":0.00032266832,"teacher_disagreement_score":0.8141476,"about_ca_system_score_codex":0.000357062,"about_ca_system_score_gemma":0.00003363542,"threshold_uncertainty_score":0.99974805},"labels":[],"label_agreement":null},{"id":"W4401507801","doi":"10.1109/lwc.2024.3441605","title":"Multi-Agent DRL Approach to Two-Timescale Transmission for RIS-Aided MU-MISO Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Computer science; Transmission (telecommunications); Physics; Telecommunications","score_opus":0.0417181336442742,"score_gpt":0.2869990876182278,"score_spread":0.24528095397395358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401507801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02770288,0.008797998,0.9532845,0.004692191,0.00076144945,0.0015138495,0.00013356739,0.0012733721,0.001840215],"genre_scores_gemma":[0.9002451,0.0007126946,0.09648568,0.00027660566,0.000095246716,0.0015084095,0.00019866403,0.00011919242,0.00035844493],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844974,0.00013928814,0.0005368099,0.0003173258,0.00016897089,0.0003878766],"domain_scores_gemma":[0.99644804,0.00033009137,0.000036495156,0.002914281,0.000070352915,0.00020071605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039113045,0.00029516488,0.0003115678,0.00030278394,0.00035535335,0.00022523389,0.0018240144,0.00009818343,0.0000054332827],"category_scores_gemma":[0.000009956433,0.00030045706,0.00019344527,0.0005552081,0.000092874616,0.0002116323,0.00012889318,0.00042022872,0.00009061582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002283798,0.0007013922,0.0000516722,0.0010147621,0.00048786908,0.0000029831865,0.005191975,0.3604922,0.474508,0.0028605866,0.11642608,0.038239654],"study_design_scores_gemma":[0.00040906927,0.0000119523465,0.000052000694,0.00025004038,0.000057259553,0.0000077093055,0.00013189536,0.8145434,0.0017368692,0.00000700542,0.18244265,0.0003500969],"about_ca_topic_score_codex":0.00009810263,"about_ca_topic_score_gemma":0.000016905886,"teacher_disagreement_score":0.8725422,"about_ca_system_score_codex":0.00020014687,"about_ca_system_score_gemma":0.000034898112,"threshold_uncertainty_score":0.99994475},"labels":[],"label_agreement":null},{"id":"W4401806895","doi":"10.1109/lwc.2024.3448614","title":"Covert Communications for Text Semantic With Finite Blocklength","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Covert; Theoretical computer science; Computer network","score_opus":0.023875735656729406,"score_gpt":0.26744422764846404,"score_spread":0.24356849199173464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401806895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098393805,0.017187746,0.7883993,0.06693052,0.0007866342,0.004014823,0.00065524573,0.013811934,0.009820039],"genre_scores_gemma":[0.9440743,0.006057591,0.046882626,0.0007100979,0.000060197013,0.0016101495,0.00032464764,0.00019674626,0.00008365019],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815845,0.00018478562,0.0006026637,0.00033467726,0.00026432596,0.00045507058],"domain_scores_gemma":[0.98970574,0.0024877316,0.0000796994,0.007445886,0.00016000874,0.000120944394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003944424,0.0003986942,0.0003891774,0.0004222605,0.00053955865,0.0003361674,0.004197106,0.00015839057,0.000013967416],"category_scores_gemma":[0.000033856417,0.00040992192,0.00017667115,0.00086008833,0.0006415819,0.00048682242,0.00038422362,0.0008382981,0.00010883604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012205035,0.0013196736,0.0008345413,0.0034156416,0.0033584924,0.000027498992,0.016268177,0.03253348,0.2622163,0.23725119,0.23576197,0.20689099],"study_design_scores_gemma":[0.0004010455,0.00004916072,0.0000653228,0.0006993924,0.00013936164,0.000030875348,0.00017442714,0.6627642,0.006930368,0.00039640837,0.32760355,0.00074590876],"about_ca_topic_score_codex":0.000055231598,"about_ca_topic_score_gemma":0.00028056174,"teacher_disagreement_score":0.8456805,"about_ca_system_score_codex":0.00023703097,"about_ca_system_score_gemma":0.0000746365,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W4401807690","doi":"10.1109/lwc.2024.3448409","title":"Cooperative Rate Splitting Multiple Access for Active STAR-RIS Assisted Downlink Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer network; Computer science; Telecommunications","score_opus":0.08684084028544377,"score_gpt":0.3320976934332083,"score_spread":0.24525685314776452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401807690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6117337,0.03435997,0.2567114,0.059722636,0.0044840365,0.010406161,0.003500004,0.011102131,0.007979997],"genre_scores_gemma":[0.97557974,0.004405907,0.015580362,0.0006626471,0.00012397266,0.0023708015,0.0009933392,0.00018661171,0.00009661514],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710596,0.00072857627,0.0009965796,0.0004330806,0.00022493217,0.00051086035],"domain_scores_gemma":[0.9874678,0.0050081573,0.00016234434,0.0068712058,0.0003648977,0.00012555832],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000867878,0.00044834294,0.00049293466,0.00041667145,0.0009102454,0.00076744094,0.0054369923,0.00019021276,0.000017573895],"category_scores_gemma":[0.00014544127,0.00049048744,0.0002445557,0.0011960224,0.0004990478,0.0010430912,0.0007306934,0.00093696784,0.00014997629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012318978,0.0005991274,0.0013323526,0.0018133078,0.0031201565,0.000009749725,0.01907869,0.015909981,0.7125317,0.011468632,0.027352815,0.20666033],"study_design_scores_gemma":[0.00081182143,0.000022425578,0.0016906749,0.00066854234,0.0001293574,0.000016449892,0.0009250591,0.7148722,0.013313053,0.000082900966,0.26654693,0.0009205977],"about_ca_topic_score_codex":0.00013600978,"about_ca_topic_score_gemma":0.00031086092,"teacher_disagreement_score":0.69921863,"about_ca_system_score_codex":0.00055035437,"about_ca_system_score_gemma":0.00010481098,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W4402128025","doi":"10.1109/lwc.2024.3453592","title":"Aerial Reconfigurable Intelligent Surface-Assisted LPWANs for IoT: A Cross-Layer Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication 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":"University of Ottawa; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Computer science; Layer (electronics); Computer network; Internet of Things; Embedded system; Nanotechnology; Materials science","score_opus":0.04869555935774642,"score_gpt":0.3179636798662118,"score_spread":0.2692681205084654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402128025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33102268,0.0050105127,0.6492525,0.006949079,0.000937441,0.0008506737,0.0002920043,0.0046108756,0.0010742295],"genre_scores_gemma":[0.95766336,0.001874224,0.039174575,0.00017092079,0.000048808044,0.0005462345,0.00023118911,0.00011427321,0.0001763967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980852,0.00010063538,0.0007345466,0.00040306256,0.00019318362,0.00048335124],"domain_scores_gemma":[0.9947958,0.0008713938,0.00009348342,0.004019547,0.0001350285,0.00008473026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034007343,0.00035679387,0.0004843392,0.0005516448,0.0004110522,0.000362583,0.0024683867,0.00021562744,0.000056546283],"category_scores_gemma":[0.000046859623,0.00039169367,0.00039545534,0.0018761936,0.00044505158,0.0002936317,0.00014667943,0.0006223171,0.00009683825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002088153,0.000087901346,0.00027152876,0.00019066123,0.0018413116,0.0000030700999,0.0006208554,0.62616193,0.30280757,0.0075405343,0.0057951785,0.054658595],"study_design_scores_gemma":[0.00037847456,0.000025948839,0.0003463386,0.00016024626,0.00037730162,0.00000879748,0.00028434923,0.7884735,0.12567243,0.00062708545,0.08279661,0.0008489052],"about_ca_topic_score_codex":0.00006205133,"about_ca_topic_score_gemma":0.0002663265,"teacher_disagreement_score":0.6266407,"about_ca_system_score_codex":0.0003911809,"about_ca_system_score_gemma":0.000052329255,"threshold_uncertainty_score":0.9998535},"labels":[],"label_agreement":null},{"id":"W4402262781","doi":"10.1109/lwc.2024.3454728","title":"Dual-Robust Integrated Sensing and Communication: Beamforming Under CSI Imperfection and Location Uncertainty","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Concordia University","funders":"Key Research and Development Program of Heilongjiang","keywords":"Beamforming; Computer science; Dual (grammatical number); Robustness (evolution); Telecommunications","score_opus":0.01944089471585603,"score_gpt":0.24404861990481785,"score_spread":0.22460772518896183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402262781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059727672,0.002000567,0.92121947,0.015695538,0.0003792313,0.00021287185,0.000007365865,0.00055838714,0.00019892698],"genre_scores_gemma":[0.9647957,0.0014665192,0.03263904,0.0009000284,0.000053578562,0.000019266825,0.00006958392,0.000020907835,0.000035366065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986141,0.00026763926,0.00033765374,0.0003790776,0.00016866953,0.00023290863],"domain_scores_gemma":[0.99767447,0.00043779198,0.0000932245,0.0014960585,0.000199249,0.000099207486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004338465,0.00020056227,0.0001757357,0.00022013618,0.00077617395,0.00088933355,0.00051380857,0.0001014655,0.0000017983406],"category_scores_gemma":[0.000019902187,0.00020072608,0.000038319937,0.0012410976,0.0003333688,0.0007637559,0.00032401033,0.00049587723,0.000009865785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015515428,0.00010068838,0.00007347274,0.00013514169,0.00023838099,0.000012822799,0.0032607052,0.074705675,0.018002389,0.07360668,0.0044848174,0.8253637],"study_design_scores_gemma":[0.00017178302,0.000019546957,0.00019263396,0.00021509953,0.000023966179,0.00020052456,0.0003828708,0.9918607,0.00026618305,0.00062367256,0.005797878,0.0002451257],"about_ca_topic_score_codex":0.0005382127,"about_ca_topic_score_gemma":0.00025941635,"teacher_disagreement_score":0.917155,"about_ca_system_score_codex":0.00016246334,"about_ca_system_score_gemma":0.000059698817,"threshold_uncertainty_score":0.8575864},"labels":[],"label_agreement":null},{"id":"W4402352074","doi":"10.1109/lwc.2024.3456249","title":"Non-Orthogonal Downlink Transmission for CSS-Based LEO Satellite IoT","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication 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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China","keywords":"Telecommunications link; Computer science; Satellite; Transmission (telecommunications); Telecommunications; Computer network; Internet of Things; Satellite broadcasting; Remote sensing; Computer security; Geology; Engineering; Aerospace engineering","score_opus":0.03043597760340853,"score_gpt":0.2802855693635586,"score_spread":0.24984959176015006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402352074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17996103,0.054015312,0.7201312,0.0307435,0.0024597063,0.0030953619,0.0003170319,0.004749498,0.004527327],"genre_scores_gemma":[0.97619927,0.0030464204,0.018623402,0.00072042545,0.00014656637,0.0006770939,0.00036218966,0.00015060723,0.00007404226],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824256,0.00012631656,0.00067336217,0.00031184457,0.00024991727,0.0003959861],"domain_scores_gemma":[0.9959117,0.00086402387,0.000055648856,0.002938039,0.000091415044,0.00013916891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047906776,0.00032689917,0.00032065046,0.00034526523,0.00028982462,0.00021665962,0.0018025136,0.00016811679,0.000020933738],"category_scores_gemma":[0.0000064960063,0.00034503193,0.0002718271,0.0006084216,0.00018867823,0.0001722756,0.000054869917,0.00052329554,0.00017803446],"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.000036355883,0.00013349782,0.00038526935,0.0013695894,0.00032050555,0.0000073655774,0.0021650228,0.02500408,0.5576965,0.0020132915,0.006346801,0.4045217],"study_design_scores_gemma":[0.00038345737,0.000015777501,0.00029106202,0.0005109697,0.000045163855,0.00000993126,0.000048726084,0.47099075,0.013486864,0.000043128617,0.51373863,0.0004355799],"about_ca_topic_score_codex":0.000013899158,"about_ca_topic_score_gemma":0.000023079048,"teacher_disagreement_score":0.79623824,"about_ca_system_score_codex":0.00019882775,"about_ca_system_score_gemma":0.00007005226,"threshold_uncertainty_score":0.99990016},"labels":[],"label_agreement":null},{"id":"W4402674153","doi":"10.1109/lwc.2024.3464858","title":"Deep Deterministic Policy Gradient-Based Physical Layer Authentication Scheme Under Unknown Attacking Environment","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Physical Unclonable Functions (PUFs) and Hardware 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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Physical layer; Layer (electronics); Scheme (mathematics); Message authentication code; Computer network; Computer security; Cryptography; Wireless; Telecommunications; Mathematics; Materials science; Nanotechnology","score_opus":0.03069299761277094,"score_gpt":0.2874346572759761,"score_spread":0.25674165966320517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402674153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13707988,0.00017073075,0.832528,0.028602432,0.00039465688,0.0002926565,0.000011677502,0.00055969926,0.00036028813],"genre_scores_gemma":[0.9875855,0.00004618396,0.009947142,0.0018147787,0.0002632693,0.0001905671,0.000054356005,0.000036260644,0.00006195397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979371,0.00023809136,0.00033942147,0.00060419337,0.00041244752,0.00046874626],"domain_scores_gemma":[0.99624676,0.00050360564,0.000097174416,0.002931531,0.00004979274,0.00017116191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018327571,0.00029011176,0.00024832084,0.000324687,0.0005840093,0.00044641423,0.0021975432,0.00007081095,0.000009662448],"category_scores_gemma":[0.00001954321,0.0002919744,0.0002273069,0.0008559902,0.00037437677,0.0005794811,0.00043719952,0.0004871794,0.00048209366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000869016,0.0013539292,0.00006618184,0.00011749232,0.00017034596,0.00001662042,0.002320134,0.009537523,0.107322544,0.8446354,0.0009579204,0.033493217],"study_design_scores_gemma":[0.00022208913,0.00004314611,0.00046022428,0.00009115632,0.000045239794,0.0000075009166,0.000022292576,0.9759568,0.0021036088,0.004317776,0.016349873,0.00038031815],"about_ca_topic_score_codex":0.000063607076,"about_ca_topic_score_gemma":0.000020123685,"teacher_disagreement_score":0.9664193,"about_ca_system_score_codex":0.0004224278,"about_ca_system_score_gemma":0.00016183134,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W4402742600","doi":"10.1109/lwc.2024.3466246","title":"Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advancements in Semiconductor Devices and Circuit Design","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":"Science and Engineering Research Council; University of Tabriz","keywords":"Relay; Computer science; Bandwidth (computing); Computer network; Task (project management); Bandwidth allocation; Flow control (data); Engineering","score_opus":0.016947509116675325,"score_gpt":0.2419682128034077,"score_spread":0.22502070368673235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402742600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43573934,0.013617664,0.54439485,0.0028489172,0.0011832475,0.0006569742,0.00009007153,0.00080047315,0.00066847156],"genre_scores_gemma":[0.9976753,0.00042102777,0.0011096997,0.00053640996,0.000038626524,0.00012795837,0.000021248992,0.00004535092,0.0000243861],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991438,0.000066011955,0.00027694716,0.00018599468,0.000105413266,0.00022186553],"domain_scores_gemma":[0.99885416,0.0002813351,0.000021017986,0.00077625713,0.0000136755025,0.00005357816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014088629,0.00016369467,0.0001905566,0.0001544373,0.00008353821,0.00008452117,0.00041510866,0.000060101967,0.000011905813],"category_scores_gemma":[0.000005451472,0.00017298272,0.000036979807,0.00027422668,0.00011334521,0.00022005943,0.000028117414,0.00036285195,0.000025385138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443104,0.00009303334,0.00041466023,0.00027600446,0.00036548873,0.000042095628,0.0028164927,0.28995562,0.57367915,0.002500522,0.00555484,0.12428868],"study_design_scores_gemma":[0.00058962934,0.000010664963,0.00043294503,0.0003067236,0.000050203264,0.00002265536,0.00011061094,0.99098885,0.00018512293,0.00011622817,0.006865854,0.00032050107],"about_ca_topic_score_codex":0.00002104099,"about_ca_topic_score_gemma":0.000056287947,"teacher_disagreement_score":0.70103323,"about_ca_system_score_codex":0.00012221972,"about_ca_system_score_gemma":0.000012511802,"threshold_uncertainty_score":0.7054031},"labels":[],"label_agreement":null},{"id":"W4402916028","doi":"10.1109/lwc.2024.3469557","title":"RARE-FL: Resilient Accelerated and Risk-Aware Edge Federated Learning in Scarce Data Scenario","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Artificial intelligence","score_opus":0.07315575434626846,"score_gpt":0.31443793893247124,"score_spread":0.24128218458620276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402916028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543817,0.003152883,0.18607071,0.15191612,0.00046918378,0.0005380501,0.000118950775,0.0031636932,0.00018870669],"genre_scores_gemma":[0.9573757,0.0031986604,0.03860299,0.00040574378,0.000022117847,0.000055241697,0.00027890358,0.000034738096,0.000025926933],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718463,0.00065694,0.0004675692,0.0009521509,0.00028511402,0.00045357057],"domain_scores_gemma":[0.9801253,0.0007951055,0.00013634539,0.018797958,0.00006795415,0.000077307435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010128355,0.0002599044,0.00026333446,0.00046635765,0.0006463122,0.0012489227,0.040827755,0.0001525236,0.000003748379],"category_scores_gemma":[0.0019384822,0.00027131554,0.000030851425,0.0017093734,0.0003958264,0.0016858717,0.07929472,0.0016129499,0.000048250447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032895325,0.00036379028,0.047097605,0.00027112183,0.00030757303,0.0002666195,0.0019838102,0.0014729297,0.044800334,0.0016621655,0.50789833,0.39384282],"study_design_scores_gemma":[0.00026444206,0.00001725205,0.003320775,0.00034363946,0.000014726455,0.00002690392,0.00009065151,0.98576045,0.001442911,0.0005444784,0.007825341,0.0003484288],"about_ca_topic_score_codex":0.0008294642,"about_ca_topic_score_gemma":0.0007777827,"teacher_disagreement_score":0.9842875,"about_ca_system_score_codex":0.00019219118,"about_ca_system_score_gemma":0.00015206373,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W4402979132","doi":"10.1109/lwc.2024.3471509","title":"Interleaved Training for Massive MIMO Downlink via Exploring Channel Temporal Correlation","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Telecommunications link; MIMO; Computer science; Training (meteorology); Correlation; Channel (broadcasting); Spatial correlation; Telecommunications; Mathematics; Physics","score_opus":0.06841453027298339,"score_gpt":0.2711386728321502,"score_spread":0.20272414255916682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402979132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006892361,0.00086461956,0.9858458,0.0028130473,0.0016603832,0.00064482447,0.00004066683,0.0011052573,0.00013301702],"genre_scores_gemma":[0.9680956,0.00019796686,0.0298481,0.00015266241,0.00018890943,0.0010446394,0.00031864032,0.000113053924,0.000040405026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988317,0.00006345304,0.00047614973,0.00023412667,0.00009816646,0.00029640083],"domain_scores_gemma":[0.99869525,0.00027183082,0.00007892611,0.00083317095,0.000053434767,0.00006737235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020377376,0.00022224576,0.0002461314,0.000274611,0.00021961895,0.000105587336,0.00048044705,0.000073921095,0.0000033773783],"category_scores_gemma":[0.000014861183,0.000258544,0.00011136716,0.00035186252,0.00007191824,0.0006806857,0.000045668974,0.00031042998,0.00003259432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007486005,0.000016545428,0.000014496246,0.00025026695,0.00014022239,0.0000022434738,0.01132252,0.9096329,0.026489485,0.00075035513,0.002060514,0.049312923],"study_design_scores_gemma":[0.00023034615,0.000015994945,0.000010017112,0.00046024902,0.000020215239,0.0000074782265,0.00083625334,0.9933081,0.001083203,0.00009354257,0.0036588185,0.0002757365],"about_ca_topic_score_codex":0.000018829562,"about_ca_topic_score_gemma":0.000039588926,"teacher_disagreement_score":0.9612033,"about_ca_system_score_codex":0.0003027385,"about_ca_system_score_gemma":0.000023650682,"threshold_uncertainty_score":0.99998665},"labels":[],"label_agreement":null},{"id":"W4403182703","doi":"10.1109/lwc.2024.3474774","title":"Novel Iterative Approach for Time-of-Arrivals-Based Localization With Maximum Likelihood Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Indoor and Outdoor Localization 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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Chongqing Municipal Education Commission; Natural Science Foundation of Chongqing; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Maximum likelihood; Computer science; Iterative method; Estimation; Maximum likelihood sequence estimation; Mathematical optimization; Algorithm; Estimation theory; Mathematics; Statistics","score_opus":0.014478236440935936,"score_gpt":0.23735390058550043,"score_spread":0.2228756641445645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403182703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046151807,0.00019961582,0.9924279,0.00073676085,0.00009038082,0.00053688657,0.00008368002,0.0010059351,0.00030368226],"genre_scores_gemma":[0.83843,0.000024453971,0.16047452,0.00017628101,0.000018575827,0.00032074188,0.0004877229,0.000060574188,0.0000071629497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991384,0.00002912361,0.00031033697,0.00018142474,0.00014780271,0.00019287877],"domain_scores_gemma":[0.99881256,0.00018626591,0.00005458514,0.00080588344,0.0001114288,0.000029282606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013386384,0.00018735399,0.00019835916,0.0002842524,0.00014397409,0.000087978566,0.00049623894,0.00010412234,0.0000045417696],"category_scores_gemma":[0.000014741046,0.00017482345,0.000067047986,0.00059840747,0.00019832721,0.00022340834,0.000026342685,0.00016314429,0.000008792157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015363496,0.000078566816,0.00004122797,0.00046746712,0.000108376575,4.1072505e-7,0.000699059,0.93134594,0.049776815,0.0024760154,0.0017994725,0.013191272],"study_design_scores_gemma":[0.00032479953,0.00003173692,0.000008905333,0.00015923608,0.0000468949,0.0000030868816,0.00006819624,0.93924403,0.059177086,0.00013999963,0.0005971243,0.00019887621],"about_ca_topic_score_codex":0.000007554836,"about_ca_topic_score_gemma":0.0000043688856,"teacher_disagreement_score":0.8338148,"about_ca_system_score_codex":0.00009899597,"about_ca_system_score_gemma":0.00003951113,"threshold_uncertainty_score":0.71290934},"labels":[],"label_agreement":null},{"id":"W4403210499","doi":"10.1109/lwc.2024.3476142","title":"Secure Communication in Active RIS-Assisted MISO Systems With Hardware Impairments","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","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":"Western University","funders":"China Scholarship Council","keywords":"Computer science; Computer network; Embedded system; Computer hardware","score_opus":0.021850002173127547,"score_gpt":0.2529744599754124,"score_spread":0.23112445780228486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403210499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.912738,0.052105978,0.00770795,0.007885547,0.0013228283,0.0031334043,0.0002915984,0.004177141,0.010637532],"genre_scores_gemma":[0.99300396,0.003908961,0.0014730309,0.00013420888,0.00003964428,0.00088454905,0.0003335491,0.0001432553,0.00007882638],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975339,0.0006656902,0.00072097126,0.0003228848,0.0003471199,0.00040940245],"domain_scores_gemma":[0.9941125,0.00060632173,0.00011360877,0.004939,0.00011687719,0.00011169294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044647444,0.000378118,0.00041673717,0.00052222214,0.0002546448,0.0003582362,0.0024910697,0.00017483775,0.000011131332],"category_scores_gemma":[0.000009402745,0.00037867454,0.00009563696,0.001285123,0.00025641482,0.0006182385,0.00020516833,0.001003401,0.00016734579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047073074,0.0025966095,0.029024575,0.009820112,0.0068047973,0.000444427,0.13991581,0.23704743,0.27039087,0.0147693595,0.068356164,0.22035912],"study_design_scores_gemma":[0.0028105956,0.000102248356,0.020162163,0.009939997,0.00022656322,0.00051815336,0.010602211,0.69310474,0.0031145075,0.000064105705,0.25661466,0.0027400572],"about_ca_topic_score_codex":0.00044075825,"about_ca_topic_score_gemma":0.00057723286,"teacher_disagreement_score":0.4560573,"about_ca_system_score_codex":0.0007660451,"about_ca_system_score_gemma":0.000063410975,"threshold_uncertainty_score":0.99986655},"labels":[],"label_agreement":null},{"id":"W4403722362","doi":"10.1109/lwc.2024.3486201","title":"Over-the-Air Federated Learning in User-Centric Cell-Free Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Privacy-Preserving Technologies in Data","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 Manitoba","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computer network; User-centered design; Human–computer interaction","score_opus":0.02159849605247896,"score_gpt":0.26117819328676734,"score_spread":0.23957969723428837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403722362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14601046,0.00289452,0.5439668,0.302673,0.0008090676,0.00039951896,0.000007853495,0.0027377612,0.00050099986],"genre_scores_gemma":[0.97045386,0.0010997287,0.026321216,0.0018718234,0.000039677383,0.00010890965,0.000025963407,0.000032527263,0.000046321005],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978327,0.00046994205,0.00040603033,0.000502834,0.0002856287,0.00050283567],"domain_scores_gemma":[0.9819595,0.0011387302,0.000107939515,0.01670727,0.000038249862,0.000048318354],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006817445,0.00022358916,0.0001961995,0.00035337452,0.00055613817,0.00067042775,0.053493667,0.00014062788,0.0000044482044],"category_scores_gemma":[0.00096347503,0.00020349397,0.00007719286,0.0024710244,0.00027853623,0.0007670001,0.048928495,0.0016162868,0.00005414264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006202571,0.00022000964,0.004022404,0.00007030362,0.000085260624,0.000107517175,0.0005208237,0.022312239,0.006865259,0.008669868,0.8893851,0.06773503],"study_design_scores_gemma":[0.00022979085,0.000011325562,0.0012742893,0.00012870494,0.0000072842913,0.000011441852,0.000035563957,0.97724897,0.0004990458,0.0015394435,0.018761436,0.0002527082],"about_ca_topic_score_codex":0.00023695838,"about_ca_topic_score_gemma":0.00016777706,"teacher_disagreement_score":0.95493674,"about_ca_system_score_codex":0.00024401587,"about_ca_system_score_gemma":0.00007948068,"threshold_uncertainty_score":0.9587636},"labels":[],"label_agreement":null},{"id":"W4403758959","doi":"10.1109/lwc.2024.3486325","title":"Integrated Sensing and Communication With Symbiotic Radio and RIS-Assisted Backscatter","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Backscatter (email); Radio frequency; Remote sensing; Computer science; Wireless; Telecommunications; Geology","score_opus":0.012675400685579154,"score_gpt":0.21134597088381962,"score_spread":0.19867057019824047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403758959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9445262,0.008623856,0.03931612,0.0050904276,0.0002029275,0.00023290137,0.000011292015,0.0012926245,0.0007036595],"genre_scores_gemma":[0.9713701,0.0024778638,0.025567375,0.0003094708,0.00003688709,0.000023063552,0.00007902159,0.00009975345,0.000036444162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988542,0.00020386859,0.0003014566,0.00025271418,0.00012229128,0.00026547085],"domain_scores_gemma":[0.99771714,0.0006153942,0.000041723168,0.0014833107,0.00004688224,0.00009551781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021656428,0.0002688685,0.00024382143,0.00019041651,0.00028326243,0.0003437439,0.0004598362,0.000113971386,0.0000030416331],"category_scores_gemma":[0.0000070374176,0.00025608033,0.000030511555,0.0004662567,0.0005517623,0.00028059958,0.0001199633,0.00071484596,0.000009307566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044144082,0.000119219476,0.0041669523,0.0013531819,0.0015252009,0.00009422061,0.006965991,0.044213142,0.21891445,0.0051628505,0.01884754,0.6985931],"study_design_scores_gemma":[0.00034854366,0.000018895375,0.003043035,0.001818977,0.00012555516,0.00030011617,0.00020976023,0.9876027,0.0013191985,0.000040297233,0.004620721,0.00055218884],"about_ca_topic_score_codex":0.0001658994,"about_ca_topic_score_gemma":0.0003788834,"teacher_disagreement_score":0.9433896,"about_ca_system_score_codex":0.00011801835,"about_ca_system_score_gemma":0.000019060719,"threshold_uncertainty_score":0.99998915},"labels":[],"label_agreement":null},{"id":"W4404035675","doi":"10.1109/lwc.2024.3490856","title":"Beyond Shannon Capacity: Deep Semantic Communication for Enhanced Performance in Impulsive Noise Environments","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Music Technology and Sound Studies","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Noise (video); Computer network; Artificial intelligence","score_opus":0.01716767485965804,"score_gpt":0.24471984638621685,"score_spread":0.22755217152655882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404035675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6493115,0.0010682192,0.3350684,0.013202137,0.00026303646,0.0004618991,0.0000070824744,0.00020929462,0.00040844083],"genre_scores_gemma":[0.9767926,0.001372592,0.020091785,0.0010137017,0.00001863073,0.0006075361,0.000023006247,0.000017190312,0.000063002495],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986608,0.0001406322,0.00036230672,0.00036483016,0.00014965583,0.00032175911],"domain_scores_gemma":[0.9968335,0.00040765677,0.00007967765,0.0026181089,0.000026234122,0.000034822813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037208878,0.00019103097,0.00023034892,0.00027746224,0.00050482416,0.000118617325,0.0027127152,0.00011227007,0.0000019257934],"category_scores_gemma":[0.000017162749,0.00020020292,0.00007817356,0.00048174988,0.00041781078,0.00057730946,0.00054318365,0.00043992928,0.000045077264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004565468,0.0008630799,0.0034998434,0.00060285244,0.00055494497,0.000013054302,0.07076359,0.0038661319,0.36027506,0.23891713,0.0025418603,0.3180568],"study_design_scores_gemma":[0.0014468635,0.00014817232,0.011460513,0.0007275375,0.000079744204,0.000029397586,0.00072630396,0.9208747,0.033384517,0.010825167,0.019060623,0.0012364216],"about_ca_topic_score_codex":0.00004027674,"about_ca_topic_score_gemma":0.00032424438,"teacher_disagreement_score":0.9170086,"about_ca_system_score_codex":0.00016955686,"about_ca_system_score_gemma":0.000024084133,"threshold_uncertainty_score":0.8164038},"labels":[],"label_agreement":null},{"id":"W4405205315","doi":"10.1109/lwc.2024.3514452","title":"A Scalable Architecture for Future Regenerative Satellite Payloads","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Spacecraft Design and Technology","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":"C-Com Satellite Systems (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Computer science; Satellite; Scalability; Architecture; Satellite broadcasting; Computer architecture; Distributed computing; Astrobiology; Aerospace engineering; Engineering; Operating system","score_opus":0.014798398281119321,"score_gpt":0.2412183883637226,"score_spread":0.2264199900826033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405205315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16876902,0.034782134,0.6717301,0.11191366,0.0028639282,0.0014375896,0.00014840925,0.0057499637,0.0026052138],"genre_scores_gemma":[0.9714102,0.001960347,0.024611158,0.0008096061,0.0003134743,0.0005371697,0.00008041038,0.0000892877,0.00018833156],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992311,0.000043851625,0.00018281999,0.00019388818,0.000077027486,0.00027128798],"domain_scores_gemma":[0.9985345,0.00018726094,0.000016102982,0.0011874886,0.000027390432,0.000047275098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009993027,0.00018527989,0.00017430435,0.0002090535,0.0001494456,0.00008933932,0.00067502516,0.00014511409,0.000007939675],"category_scores_gemma":[0.000004381532,0.00017712446,0.000101033664,0.00040787866,0.00014555783,0.000087866436,0.00004230717,0.00043853055,0.00004962926],"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.000010518303,0.00003290544,0.000046156027,0.00023395006,0.00030215958,0.000010367139,0.0020775972,0.0040392703,0.7181365,0.026911505,0.061555374,0.18664373],"study_design_scores_gemma":[0.00029350753,0.00003085293,0.00004902672,0.00014367307,0.00005807137,0.00003887159,0.00024440512,0.12205775,0.07747169,0.0010414026,0.7980911,0.00047963386],"about_ca_topic_score_codex":0.00000672915,"about_ca_topic_score_gemma":0.000083623156,"teacher_disagreement_score":0.8026412,"about_ca_system_score_codex":0.000084696905,"about_ca_system_score_gemma":0.000016989537,"threshold_uncertainty_score":0.72229254},"labels":[],"label_agreement":null},{"id":"W4405269905","doi":"10.1109/lwc.2024.3515032","title":"Traffic-Aware Cost-Optimized Fronthaul Planning for Ultra-Dense Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.02592108835187117,"score_gpt":0.27413780879985683,"score_spread":0.24821672044798565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405269905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027716057,0.0047689807,0.9571106,0.003823224,0.00083035557,0.000786988,0.0000476489,0.004657097,0.00025905235],"genre_scores_gemma":[0.91190153,0.001081395,0.085414186,0.0003592394,0.00014075602,0.000831279,0.000117329095,0.00012671833,0.000027542652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987022,0.000040996583,0.0003709712,0.0002738224,0.000113615104,0.0004983741],"domain_scores_gemma":[0.9972571,0.001156493,0.00003293436,0.0014423295,0.000036348032,0.00007477291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014857782,0.00027880687,0.00030476516,0.0001543021,0.00022940424,0.00013450657,0.0010916641,0.00019117969,0.000006116488],"category_scores_gemma":[0.0000242059,0.0002959033,0.00014715146,0.0003809421,0.00026837154,0.00022971984,0.00006251082,0.00070374104,0.000022976601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012561051,0.000014382098,0.000004806068,0.00005216807,0.00009841987,0.000008008243,0.00016082267,0.94545794,0.0020098074,0.00053314865,0.017723098,0.033924866],"study_design_scores_gemma":[0.00032224786,0.000012999291,0.000007450555,0.00024691527,0.000046026744,0.000009476421,0.00016139312,0.9818885,0.00037791286,0.000065454195,0.01651294,0.00034872632],"about_ca_topic_score_codex":0.0000017119014,"about_ca_topic_score_gemma":0.000007625645,"teacher_disagreement_score":0.8841855,"about_ca_system_score_codex":0.00017176877,"about_ca_system_score_gemma":0.000011879096,"threshold_uncertainty_score":0.99994934},"labels":[],"label_agreement":null},{"id":"W4405440138","doi":"10.1109/lwc.2024.3518694","title":"Communication-Aware Optimizers for FedMeta Learning in Aerial Wireless Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Efficient Wireless Sensor 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":"Queen's University","funders":"","keywords":"Computer science; Wireless; Wireless network; Computer network; Artificial intelligence; Telecommunications","score_opus":0.019995779537166466,"score_gpt":0.2651504723436993,"score_spread":0.24515469280653285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405440138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048862185,0.0030606354,0.92144305,0.022780998,0.0015301888,0.00075014506,0.000009032193,0.0012274998,0.00033626595],"genre_scores_gemma":[0.9379748,0.0022432834,0.057620138,0.00095178146,0.00017725647,0.00060736586,0.00016136114,0.00009865227,0.00016536703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962339,0.00085365976,0.0008818933,0.0008246325,0.00037270255,0.0008332215],"domain_scores_gemma":[0.9927776,0.0024511933,0.00023053637,0.004227701,0.00015291464,0.00016004796],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011312662,0.000444501,0.0005212736,0.000553811,0.0008036363,0.0009348439,0.0062180404,0.0002590688,0.0000060968887],"category_scores_gemma":[0.00003505198,0.00049430865,0.00028430557,0.0017788251,0.00043286223,0.00086219795,0.0009332129,0.001332246,0.000027652353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022882681,0.00016213818,0.00020834547,0.00005274273,0.00009941508,0.0000150433625,0.0010380881,0.91527075,0.0015475338,0.044928845,0.004956334,0.03169786],"study_design_scores_gemma":[0.0006200914,0.000028846152,0.00008638393,0.0004875793,0.000025177547,0.000014937568,0.000113882925,0.98695105,0.0002809463,0.00008371686,0.010767996,0.0005393662],"about_ca_topic_score_codex":0.00022229017,"about_ca_topic_score_gemma":0.00029916086,"teacher_disagreement_score":0.8891126,"about_ca_system_score_codex":0.00033552895,"about_ca_system_score_gemma":0.00014145739,"threshold_uncertainty_score":0.99975085},"labels":[],"label_agreement":null},{"id":"W4405441209","doi":"10.1109/lwc.2024.3516818","title":"Fast Beam Placement for Ultra-Dense LEO Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Photonic and Optical Devices","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":"H2020 Marie Skłodowska-Curie Actions; European Commission","keywords":"Computer science; Beam (structure); Telecommunications; Computer network; Physics; Optics","score_opus":0.017199616907216584,"score_gpt":0.24930599742909973,"score_spread":0.23210638052188315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405441209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26833466,0.009730447,0.690247,0.011790896,0.002758315,0.0013747023,0.00015292835,0.002497955,0.01311313],"genre_scores_gemma":[0.9957915,0.000858627,0.0019207412,0.000818391,0.00011093416,0.0003175766,0.0000613983,0.000050698836,0.00007014225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920654,0.000022860724,0.00023630391,0.00015564449,0.000094023475,0.00028461346],"domain_scores_gemma":[0.99859536,0.00040870343,0.000015315733,0.0008884952,0.000020387566,0.00007175842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013526856,0.0001554351,0.00014957313,0.00007248114,0.00014670404,0.00012107166,0.00062407827,0.00006742663,0.000012904075],"category_scores_gemma":[0.000004317885,0.00015750763,0.000098749886,0.00019166718,0.000107104344,0.00013057687,0.000033758086,0.00028897013,0.000059055703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023538769,0.000121129066,0.000050247134,0.000535765,0.0006103933,0.000010503279,0.0014553217,0.7409501,0.13997383,0.02230979,0.070207074,0.023752308],"study_design_scores_gemma":[0.0001842877,0.0000141409,0.00004244552,0.00015078987,0.00005124119,0.000005711194,0.000096839314,0.9489775,0.0047952235,0.000038391925,0.045384966,0.00025847158],"about_ca_topic_score_codex":0.000010515479,"about_ca_topic_score_gemma":0.000031966996,"teacher_disagreement_score":0.72745687,"about_ca_system_score_codex":0.00009877022,"about_ca_system_score_gemma":0.000012717644,"threshold_uncertainty_score":0.6422975},"labels":[],"label_agreement":null},{"id":"W4405717855","doi":"10.1109/lwc.2024.3520995","title":"Generative AI as a Service in 6G Edge-Cloud: Generation Task Offloading by In-Context Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"IoT and Edge/Fog Computing","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":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Context (archaeology); Task (project management); Enhanced Data Rates for GSM Evolution; Edge computing; Service (business); Generative model; Artificial intelligence; Human–computer interaction; Generative grammar; Operating system; Systems engineering; Engineering","score_opus":0.024852874293900356,"score_gpt":0.2750548680152016,"score_spread":0.25020199372130125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7548956,0.0017234932,0.17105594,0.06638601,0.004800026,0.0003203602,7.7718227e-7,0.00033346596,0.0004842927],"genre_scores_gemma":[0.9851495,0.00011251673,0.0041577807,0.009650521,0.0006537307,0.00008962987,0.000045557845,0.000030836138,0.00010994206],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790823,0.0004255275,0.00049809826,0.0005197566,0.00022316485,0.00042518892],"domain_scores_gemma":[0.9982936,0.00029320465,0.00009307964,0.0011686031,0.00008086901,0.000070666676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006010125,0.0002377094,0.00024428585,0.00041967025,0.00038994104,0.000621823,0.0018721528,0.0001026292,0.0000022181825],"category_scores_gemma":[0.000023179635,0.0002678396,0.00006630166,0.0015649303,0.00007055235,0.00087639404,0.0004832267,0.0009625773,0.00017673298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009491993,0.00027231587,0.0026458083,0.00012064699,0.000103106824,0.000082048355,0.068548046,0.016108328,0.63043565,0.010611447,0.10546949,0.1655936],"study_design_scores_gemma":[0.00027369647,0.000019266812,0.00014467115,0.000241923,0.0000059224794,0.000017053124,0.00015043023,0.95871955,0.0050451136,0.0001112282,0.03492138,0.0003497461],"about_ca_topic_score_codex":0.00094895565,"about_ca_topic_score_gemma":0.0005718326,"teacher_disagreement_score":0.9426112,"about_ca_system_score_codex":0.0003142307,"about_ca_system_score_gemma":0.00013137519,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W4405717859","doi":"10.1109/lwc.2024.3521192","title":"Movable Access Point-Aided Integrated Visible Light Communication and Sensing Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Optical Wireless Communication 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":"University of Guelph","funders":"University of Guelph","keywords":"Visible light communication; Computer science; Computer network; Visible spectrum; Point (geometry); Telecommunications; Optoelectronics; Light-emitting diode; Physics; Mathematics","score_opus":0.018000671314540834,"score_gpt":0.25710193963876027,"score_spread":0.23910126832421943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5083781,0.060082797,0.30021426,0.09783946,0.001211593,0.0016672446,0.000053819233,0.017706221,0.012846505],"genre_scores_gemma":[0.9616601,0.017385386,0.020025488,0.0005300648,0.000028834089,0.00009545779,0.00010745741,0.00011988062,0.000047365374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.00024168513,0.0006232658,0.00033705676,0.00019074006,0.00045118362],"domain_scores_gemma":[0.99466395,0.0008166925,0.00007233611,0.0042249192,0.000111862464,0.000110248075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043009975,0.000371733,0.0003774997,0.00046868113,0.00047579763,0.0009268835,0.0027212077,0.0002507671,0.000018535937],"category_scores_gemma":[0.000049583945,0.00038797338,0.00009589736,0.0013352819,0.0005593473,0.0011830179,0.00091614237,0.0013263385,0.000059463997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003515944,0.00024629518,0.0004401611,0.00068008155,0.0011794324,0.000036000314,0.003002016,0.06688741,0.24598362,0.07221964,0.07769896,0.53159124],"study_design_scores_gemma":[0.00021800905,0.0000119916185,0.00016428732,0.0006227424,0.00004796878,0.000034593784,0.00030555853,0.96163315,0.011879928,0.0007719542,0.023760729,0.00054907537],"about_ca_topic_score_codex":0.00012758271,"about_ca_topic_score_gemma":0.00015040534,"teacher_disagreement_score":0.89474577,"about_ca_system_score_codex":0.00024332227,"about_ca_system_score_gemma":0.00003028555,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W4405968108","doi":"10.1109/lwc.2024.3524722","title":"Phase Noise Resilient Neural Transceivers for High Data-Rate Sub-THz Links","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Superconducting and THz Device Technology","field":"Physics and Astronomy","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":"Bell (Canada)","funders":"","keywords":"Transceiver; Computer science; Phase noise; Noise (video); Telecommunications; Electronic engineering; Wireless; Artificial intelligence; Engineering","score_opus":0.0399455942210313,"score_gpt":0.31736787242481324,"score_spread":0.27742227820378196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405968108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95155185,0.00008636603,0.013465925,0.03340174,0.00038506603,0.0004069075,0.00034540598,0.00016172018,0.0001950421],"genre_scores_gemma":[0.99606913,0.000021575148,0.0013019177,0.0014088523,0.000076923585,0.00017867521,0.000857862,0.000022519953,0.00006254829],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988216,0.0001349075,0.00032033736,0.00036356333,0.00006664448,0.0002929421],"domain_scores_gemma":[0.9962234,0.00038358077,0.00008896577,0.0031876694,0.000071901544,0.000044470584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023803572,0.00018450516,0.00024373287,0.00016150028,0.0005046562,0.000055688157,0.0020724144,0.00009680809,0.000012640733],"category_scores_gemma":[0.000010152893,0.00019696658,0.000093508104,0.00032094104,0.00029362418,0.0002163985,0.00013605258,0.0005522348,0.00001670149],"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.000062015126,0.001686863,0.0050516394,0.00007378462,0.000655758,0.0000020821572,0.0010240637,0.0006482378,0.76374245,0.055136584,0.020182913,0.1517336],"study_design_scores_gemma":[0.034840405,0.0005209676,0.0014993929,0.00070234784,0.0020860627,0.0000075875196,0.022737842,0.13666105,0.65579265,0.007629559,0.13403627,0.0034858305],"about_ca_topic_score_codex":0.0008403542,"about_ca_topic_score_gemma":0.00008885114,"teacher_disagreement_score":0.14824778,"about_ca_system_score_codex":0.000033469318,"about_ca_system_score_gemma":0.0000549939,"threshold_uncertainty_score":0.8032064},"labels":[],"label_agreement":null},{"id":"W4405968127","doi":"10.1109/lwc.2024.3524883","title":"Low Complexity Joint Detection and Estimation for MIMO RIS-ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Memorial University of Newfoundland","funders":"Canada Research Chairs","keywords":"Computer science; Joint (building); MIMO; Telecommunications; Engineering; Beamforming","score_opus":0.03366265358605396,"score_gpt":0.2685360955005998,"score_spread":0.23487344191454584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405968127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02306509,0.00019101854,0.96871364,0.006156293,0.00089138007,0.0005319308,0.00002147923,0.0002888648,0.00014030389],"genre_scores_gemma":[0.9589612,0.00007342426,0.03986026,0.00076446426,0.00003729993,0.00022319205,0.000026056676,0.000009382553,0.000044742716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.0001688453,0.0003647804,0.00030544327,0.0001301557,0.0002204516],"domain_scores_gemma":[0.9979184,0.00025996394,0.00016306103,0.0014497912,0.00014560593,0.000063166175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107471,0.00015159002,0.00020730609,0.00018655238,0.00071485096,0.00039050472,0.0007944061,0.00007929569,4.9057627e-7],"category_scores_gemma":[0.000027591292,0.0001635777,0.00007086042,0.0005126238,0.00019823415,0.0003298734,0.0001813575,0.00020054926,0.0000065113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055767017,0.0005519746,0.000114914925,0.00053654116,0.0002705908,0.000002863969,0.0007403545,0.075773396,0.07244374,0.15105036,0.016349524,0.68210995],"study_design_scores_gemma":[0.00039045393,0.000022918348,0.00059269764,0.00007969469,0.0000164935,0.000008706007,0.000038243954,0.9913189,0.0033920663,0.00075628597,0.0032210215,0.00016253369],"about_ca_topic_score_codex":0.00014854869,"about_ca_topic_score_gemma":0.00006461167,"teacher_disagreement_score":0.9358961,"about_ca_system_score_codex":0.00011675602,"about_ca_system_score_gemma":0.000026308035,"threshold_uncertainty_score":0.6670505},"labels":[],"label_agreement":null},{"id":"W4406094368","doi":"10.1109/lwc.2025.3526756","title":"Performance Analysis of Rate-Splitting Multiple Access Technique in Impulsive Noise Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Power Line Communications and Noise","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Noise (video); Computer network; Telecommunications; Artificial intelligence","score_opus":0.015435759693161424,"score_gpt":0.2669357236220612,"score_spread":0.2514999639288998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406094368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754627,0.0002447633,0.022469303,0.0005624085,0.00005617894,0.00034744083,0.000027003236,0.000083937484,0.00074627117],"genre_scores_gemma":[0.9945566,0.0016444109,0.0031115697,0.000177151,0.0000039257307,0.00038632427,0.00008170329,0.000019364303,0.000018936746],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998829,0.00015015715,0.00056831696,0.00015858002,0.00008572642,0.0002082374],"domain_scores_gemma":[0.99679834,0.0004119906,0.000107879874,0.002628358,0.000026522013,0.000026895255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036303076,0.00016417593,0.00033005784,0.0009154896,0.00012801315,0.000028413051,0.001982039,0.00007395888,0.0000061947403],"category_scores_gemma":[0.00002634008,0.000190305,0.00011056661,0.0019777527,0.00015661759,0.00026617903,0.00037246125,0.00034190004,0.0000037548396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012807003,0.00020324443,0.18822406,0.00008784648,0.00054825045,6.587553e-7,0.00041696907,0.24908553,0.5539528,0.00013353514,0.00021620565,0.0071180565],"study_design_scores_gemma":[0.00035325397,0.000004528784,0.22387236,0.00016359916,0.0001917811,2.6168792e-7,0.00005616226,0.71589124,0.058061473,0.00000842069,0.0011565461,0.00024034774],"about_ca_topic_score_codex":0.00012443327,"about_ca_topic_score_gemma":0.00016195959,"teacher_disagreement_score":0.49589136,"about_ca_system_score_codex":0.00015997692,"about_ca_system_score_gemma":0.00001849347,"threshold_uncertainty_score":0.7760412},"labels":[],"label_agreement":null},{"id":"W4406354548","doi":"10.1109/lwc.2025.3529635","title":"IRS With Discrete Phase Shifts: When Is Quantization Optimal?","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Optical and Acousto-Optic Technologies","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quantization (signal processing); Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.014145710570054868,"score_gpt":0.2837576747083861,"score_spread":0.2696119641383312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406354548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58922446,0.00005176299,0.3580459,0.048924834,0.00006545189,0.00027801713,0.00006121031,0.00020454585,0.0031438093],"genre_scores_gemma":[0.9784102,0.000017604818,0.019872917,0.0012030663,0.000025636733,0.00013492438,0.000077286095,0.000017486002,0.000240892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00004665028,0.00025546295,0.00023923024,0.00012029931,0.0002440045],"domain_scores_gemma":[0.99815637,0.00013612109,0.00010289838,0.0015025216,0.00006260603,0.000039509217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069387934,0.00018380849,0.00020564749,0.00012138058,0.0003427427,0.0001120449,0.0009975742,0.000047661004,0.00005204182],"category_scores_gemma":[0.0000043328223,0.00015388569,0.00007159657,0.00034326257,0.00044452684,0.0002161715,0.00018912775,0.0002933653,0.000027910999],"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.00018767209,0.0023089885,0.023859052,0.000115838964,0.001251242,0.0000057578577,0.0036228015,0.0029939185,0.08485059,0.5636831,0.056632582,0.26048848],"study_design_scores_gemma":[0.027965605,0.0011297173,0.0059508155,0.0033111735,0.0023539325,0.000007872883,0.037033,0.35412216,0.24174948,0.06269164,0.25621426,0.0074703614],"about_ca_topic_score_codex":0.00014629083,"about_ca_topic_score_gemma":0.000007727266,"teacher_disagreement_score":0.50099146,"about_ca_system_score_codex":0.00003412714,"about_ca_system_score_gemma":0.000042543234,"threshold_uncertainty_score":0.6275276},"labels":[],"label_agreement":null},{"id":"W4406458572","doi":"10.1109/lwc.2025.3530301","title":"Passive Six-Dimensional Movable Antenna (6DMA)-Assisted Multiuser Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Analysis","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":"Fundamental Research Funds for the Central Universities; Guangdong Provincial Key Laboratory of Construction Foundation; Natural Science Foundation of Guangdong Province; Grant Foundation","keywords":"Computer science; Antenna (radio); Telecommunications; Acoustics; Electronic engineering; Physics; Engineering","score_opus":0.015922667009401002,"score_gpt":0.24142161217558758,"score_spread":0.22549894516618657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406458572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7000962,0.0052539157,0.23561956,0.048662696,0.0009011307,0.0011357927,0.00014300502,0.0026601565,0.005527534],"genre_scores_gemma":[0.9868068,0.00078300096,0.009415346,0.002105191,0.000018969544,0.00013832877,0.00019136237,0.000041670828,0.00049931876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985786,0.00020868902,0.00047994315,0.00022450679,0.00018671872,0.00032150734],"domain_scores_gemma":[0.9966258,0.00034439223,0.000090884554,0.002707207,0.00015610114,0.00007564634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018022904,0.0002576356,0.00033066986,0.0003471152,0.000507796,0.00009135168,0.0014730057,0.000121455414,0.00003423062],"category_scores_gemma":[0.000016986698,0.0002738856,0.00017540516,0.00088512315,0.00030074306,0.00025030147,0.00019528027,0.00048373642,0.0001379543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018290135,0.0002378387,0.0009866576,0.00006757831,0.0006767058,0.000006007828,0.00036784905,0.004368677,0.9585313,0.0021937005,0.02563966,0.006905695],"study_design_scores_gemma":[0.00095826417,0.000008340941,0.0078035085,0.00037552716,0.000205763,0.000007785923,0.00032112782,0.97780913,0.0029055309,0.00013831742,0.008868033,0.00059869874],"about_ca_topic_score_codex":0.00016737854,"about_ca_topic_score_gemma":0.0001839301,"teacher_disagreement_score":0.9734404,"about_ca_system_score_codex":0.00018901273,"about_ca_system_score_gemma":0.000036407248,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W4407128653","doi":"10.1109/lwc.2025.3538822","title":"Parameter-Based Estimation of Block Time-Varying Channels in OTFS Modulation Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Tellabs (Canada); Lakehead University","funders":"","keywords":"Block (permutation group theory); Modulation (music); Computer science; Estimation theory; Time–frequency analysis; Control theory (sociology); Algorithm; Electronic engineering; Mathematics; Telecommunications; Radar; Physics; Artificial intelligence; Engineering; Acoustics","score_opus":0.019417811915656,"score_gpt":0.2585749019309562,"score_spread":0.23915709001530022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407128653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159676,0.00021177622,0.080889575,0.0011942686,0.00058604113,0.00039740017,0.000009325892,0.00024933898,0.00049470155],"genre_scores_gemma":[0.99555534,0.000024150804,0.0040565613,0.0000727713,0.000016669508,0.00018192644,0.00004447719,0.000022884431,0.00002519558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989533,0.00013274244,0.0004891772,0.00013233807,0.00012985067,0.00016262787],"domain_scores_gemma":[0.99839467,0.00031747532,0.00009391212,0.001122474,0.00004652733,0.000024936637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019273756,0.0001379676,0.00022561924,0.0004945634,0.00007893392,0.000037521706,0.00050010125,0.00008309148,0.0000024219514],"category_scores_gemma":[0.00003056273,0.00017303757,0.00005100054,0.0006562346,0.00009480857,0.00016835232,0.000033571752,0.0002075807,0.000014791255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031409654,0.000037260696,0.00028667477,0.00010886809,0.000026034548,2.2915566e-7,0.00012325558,0.92700624,0.06996354,0.00014207579,0.00038102208,0.0019216613],"study_design_scores_gemma":[0.00029541014,0.0000040700124,0.0004998886,0.00035250915,0.000013602681,0.0000012024765,0.000019672976,0.9863094,0.012221109,0.000031341657,0.00012295392,0.00012885091],"about_ca_topic_score_codex":0.00008914903,"about_ca_topic_score_gemma":0.0000034802147,"teacher_disagreement_score":0.079587795,"about_ca_system_score_codex":0.00020481572,"about_ca_system_score_gemma":0.000023564187,"threshold_uncertainty_score":0.7056267},"labels":[],"label_agreement":null},{"id":"W4407168872","doi":"10.1109/lwc.2025.3538843","title":"Optimizing Downlink Communication in a Multi-STAR-RIS-Assisted Multi-Antenna AAV Network","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","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":"York University; University of Manitoba","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Star (game theory); Physics","score_opus":0.05832053264697959,"score_gpt":0.2960850414516865,"score_spread":0.23776450880470693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407168872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41936818,0.08618132,0.45107064,0.02369929,0.0032067564,0.0053720064,0.00012746037,0.0053922203,0.0055821314],"genre_scores_gemma":[0.8689674,0.0075107333,0.12137124,0.0010581434,0.00002548054,0.0006354395,0.00023879296,0.00009196232,0.000100801466],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963761,0.0010358528,0.0013421017,0.00037587676,0.00022635661,0.0006436873],"domain_scores_gemma":[0.9907491,0.0011916937,0.0002362431,0.007535141,0.0001788398,0.00010894161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009919027,0.00045395794,0.00061770156,0.0006025059,0.0005511733,0.00019409422,0.0043701013,0.00027230088,0.000009727794],"category_scores_gemma":[0.00007280155,0.0005458391,0.00018279758,0.0019264523,0.00037288648,0.00040778585,0.0006428634,0.0012642269,0.00009358418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015914538,0.0028992984,0.06241243,0.0011805742,0.0019574778,0.000030401276,0.026844341,0.3682616,0.42781132,0.005699478,0.016140796,0.086603135],"study_design_scores_gemma":[0.0024014884,0.000007581765,0.025249792,0.0019117565,0.00006199835,0.000008596587,0.001062729,0.9454992,0.00070710375,0.000023731682,0.022224048,0.00084198196],"about_ca_topic_score_codex":0.00047866264,"about_ca_topic_score_gemma":0.0026937563,"teacher_disagreement_score":0.5772376,"about_ca_system_score_codex":0.00062453677,"about_ca_system_score_gemma":0.00006246151,"threshold_uncertainty_score":0.9996993},"labels":[],"label_agreement":null},{"id":"W4407168874","doi":"10.1109/lwc.2025.3539638","title":"Hybrid LLM-DDQN-Based Joint Optimization of V2I Communication and Autonomous Driving","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","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; York University","funders":"","keywords":"Computer science; Joint (building); Computer network; Engineering","score_opus":0.009442303099471087,"score_gpt":0.2140161326704723,"score_spread":0.2045738295710012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407168874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50594807,0.0016989514,0.48451665,0.0052408697,0.00017942506,0.0004875088,0.0000146873235,0.0004975759,0.0014162776],"genre_scores_gemma":[0.964618,0.00073119166,0.03389354,0.000471299,0.0000122158835,0.00009251038,0.00012423332,0.000042298452,0.000014660258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874645,0.00020420642,0.0005086996,0.00017466054,0.00012817963,0.0002377983],"domain_scores_gemma":[0.9971414,0.0002929224,0.0001274828,0.0022941334,0.00008652579,0.000057523004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003147785,0.00020056825,0.00029547876,0.00026983145,0.00023799295,0.00006391415,0.0008420247,0.000077770754,0.000008093352],"category_scores_gemma":[0.000022899236,0.00024586747,0.00007552924,0.00033036596,0.0002863842,0.0001762029,0.0001673796,0.0003654337,0.0000037434788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023579573,0.000052625186,0.00032634937,0.00006875117,0.0000644306,5.4507285e-7,0.00010080549,0.9807993,0.012315902,0.00046228332,0.0014602011,0.004346446],"study_design_scores_gemma":[0.0003774971,0.000007915236,0.00093145925,0.0002885943,0.00005032723,0.0000031508887,0.00002760411,0.9889417,0.008127113,0.000035898105,0.0010101695,0.00019854002],"about_ca_topic_score_codex":0.000051330222,"about_ca_topic_score_gemma":0.0000634032,"teacher_disagreement_score":0.45867002,"about_ca_system_score_codex":0.00017217713,"about_ca_system_score_gemma":0.000045180812,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W4407639535","doi":"10.1109/lwc.2025.3542546","title":"6DMA-Aided Cell-Free Massive MIMO Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"MIMO; Computer science; 3G MIMO; Telecommunications; Beamforming","score_opus":0.010635152271927142,"score_gpt":0.2346188389388593,"score_spread":0.22398368666693214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407639535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050079208,0.003632801,0.8903829,0.016089939,0.00090571796,0.0012331931,0.000064341344,0.0018635638,0.03574836],"genre_scores_gemma":[0.95620906,0.0012170478,0.040861174,0.00080629915,0.000026406218,0.00034920222,0.00014027322,0.00006480262,0.00032575044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860406,0.00021323876,0.0005386676,0.00021432654,0.00013348467,0.0002961971],"domain_scores_gemma":[0.9939282,0.00036013348,0.0001276777,0.0053974628,0.00012581181,0.000060708917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018540939,0.00025544775,0.00028225133,0.00029645936,0.00038144676,0.00008209931,0.0026014328,0.00013062939,0.000010744711],"category_scores_gemma":[0.000036030015,0.0003100087,0.000092067,0.0007005748,0.0002104794,0.0003739337,0.00032525763,0.0004503115,0.00006786245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014076444,0.00016129336,0.0004935577,0.00028540444,0.00020287318,0.0000024349097,0.0013038904,0.6452596,0.23857188,0.009562333,0.097077206,0.0070654205],"study_design_scores_gemma":[0.0040338007,0.000026301666,0.0008813312,0.0010671972,0.0002532,0.000010033209,0.0015446426,0.851276,0.08782024,0.0019923763,0.0492729,0.0018220239],"about_ca_topic_score_codex":0.00006213172,"about_ca_topic_score_gemma":0.000117491865,"teacher_disagreement_score":0.90612984,"about_ca_system_score_codex":0.00033852027,"about_ca_system_score_gemma":0.000033310956,"threshold_uncertainty_score":0.9999352},"labels":[],"label_agreement":null},{"id":"W4407783027","doi":"10.1109/lwc.2025.3543965","title":"Parameter-Efficient Online Fine-Tuning of ML-Based Hybrid Beamforming With LoRA","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design 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 British Columbia","funders":"","keywords":"Computer science; Beamforming; Telecommunications","score_opus":0.015244191539877437,"score_gpt":0.23085176008846586,"score_spread":0.21560756854858842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407783027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37950456,0.00012369391,0.61893547,0.0009026991,0.00006340089,0.00014428752,0.000017269078,0.00015007901,0.00015853673],"genre_scores_gemma":[0.9397792,0.000044677847,0.059569817,0.00041288245,0.000008886964,0.00003276951,0.000107751024,0.000026859065,0.000017139047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.000048296162,0.00030735575,0.00012353431,0.000117152296,0.00018223637],"domain_scores_gemma":[0.9985331,0.00023691401,0.00007496425,0.0010482196,0.00007346674,0.000033312863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099363686,0.00015109187,0.00020154708,0.00024511226,0.00012613392,0.000025112706,0.0005547213,0.000035676097,0.000004040574],"category_scores_gemma":[0.000013568137,0.00014889233,0.000052884818,0.00045844354,0.00016556929,0.000071203096,0.000040036488,0.00021646648,0.000002540032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012817996,0.00009290524,0.0002999273,0.00006640101,0.000051410614,0.0000013680872,0.00010863105,0.955902,0.038865265,0.00018989027,0.00027375086,0.0041356697],"study_design_scores_gemma":[0.0003791513,0.000014758819,0.00015012565,0.0002914072,0.0000371353,0.0000015429725,0.000065124004,0.98610234,0.012442624,0.0000039363204,0.0003599311,0.00015191322],"about_ca_topic_score_codex":0.000025309482,"about_ca_topic_score_gemma":0.000026611786,"teacher_disagreement_score":0.56027466,"about_ca_system_score_codex":0.00007251192,"about_ca_system_score_gemma":0.00003469608,"threshold_uncertainty_score":0.60716534},"labels":[],"label_agreement":null},{"id":"W4408182352","doi":"10.1109/lwc.2025.3548929","title":"Enhancing Localization and Synchronization Through Neural Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Neural Networks and Applications","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":"Lakehead University","funders":"","keywords":"Computer science; Synchronization (alternating current); Artificial neural network; Computer network; Artificial intelligence","score_opus":0.013515198261181211,"score_gpt":0.2590314020781683,"score_spread":0.2455162038169871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408182352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009554086,0.00060649443,0.9672336,0.021634916,0.00022518066,0.0002443693,9.2220534e-7,0.00021938875,0.0002810737],"genre_scores_gemma":[0.97670513,0.00059635885,0.015063526,0.007429303,0.00004495203,0.0000933489,0.000021838698,0.000010129038,0.000035406098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895597,0.00013222669,0.0002940784,0.00030240053,0.00009988917,0.00021546069],"domain_scores_gemma":[0.9979795,0.0002219105,0.000107208245,0.0015790545,0.00007345718,0.00003883813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120793564,0.00013800955,0.00013854884,0.00007912912,0.0006821307,0.0002371203,0.0012647683,0.00006067594,0.0000012113618],"category_scores_gemma":[0.000008199863,0.000145603,0.00003568214,0.00093860907,0.00016820536,0.00056096184,0.00039124364,0.00020899474,0.0000034243192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005912946,0.00019019262,0.0025923848,0.000063092346,0.000079558224,0.0000026370883,0.0010253977,0.2835932,0.013128111,0.51474416,0.011085283,0.17349006],"study_design_scores_gemma":[0.00014349385,0.0000055821324,0.0003091888,0.000050276194,0.000011416238,0.000003916093,0.000017313565,0.9948685,0.0006830125,0.0007055114,0.0030626631,0.00013912225],"about_ca_topic_score_codex":0.000054866443,"about_ca_topic_score_gemma":0.00007209656,"teacher_disagreement_score":0.96715105,"about_ca_system_score_codex":0.000052462245,"about_ca_system_score_gemma":0.00002135867,"threshold_uncertainty_score":0.5937518},"labels":[],"label_agreement":null},{"id":"W4408441438","doi":"10.1109/lwc.2025.3551510","title":"Waveform Design for Integrated Sensing and Communications With PAPR Constraint","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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 Alberta","funders":"Natural Science Basic Research Program of Shaanxi Province; Aeronautical Science Foundation of China; National Natural Science Foundation of China","keywords":"Waveform; Computer science; Constraint (computer-aided design); Electronic engineering; Telecommunications; Engineering","score_opus":0.031163412781134388,"score_gpt":0.26116365042778283,"score_spread":0.23000023764664845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408441438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052561894,0.0005353401,0.9293511,0.013698217,0.00022085133,0.00088518433,0.000041153606,0.00059252896,0.0021137504],"genre_scores_gemma":[0.845908,0.00044027847,0.15281802,0.0005163746,0.000013062703,0.00016756439,0.0000541348,0.00003478924,0.00004778278],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911284,0.000111155365,0.00031238722,0.00015855249,0.00007417895,0.0002308582],"domain_scores_gemma":[0.99699837,0.00062324567,0.00005821898,0.0021426873,0.0001206026,0.000056872268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002264019,0.00019451803,0.0002161391,0.0002124671,0.0004580229,0.00008920272,0.0007791215,0.00007622611,0.0000017263953],"category_scores_gemma":[0.000019374393,0.00019170177,0.000041904543,0.00040016673,0.00076903705,0.00014211009,0.00009907063,0.0003486032,0.00000342775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012492255,0.0002565353,0.000609138,0.00046738845,0.0016658695,0.0000039283636,0.0044023264,0.039385557,0.46826002,0.026671153,0.036850452,0.42130274],"study_design_scores_gemma":[0.0012251223,0.0000339376,0.00018771482,0.00048859464,0.00015198589,0.00005817789,0.0016595495,0.93656653,0.018127063,0.00044789872,0.040493764,0.00055968243],"about_ca_topic_score_codex":0.000049786377,"about_ca_topic_score_gemma":0.00009713794,"teacher_disagreement_score":0.897181,"about_ca_system_score_codex":0.00017371267,"about_ca_system_score_gemma":0.000059320013,"threshold_uncertainty_score":0.78173715},"labels":[],"label_agreement":null},{"id":"W4409102161","doi":"10.1109/lwc.2025.3557313","title":"A-Gamba: An Adaptive Graph-Mamba Model for Traffic Prediction in Wireless Cellular Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Network Traffic and Congestion Control","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":"Computer science; Wireless; Computer network; Wireless network; Graph; Telecommunications; Theoretical computer science","score_opus":0.023216375453546313,"score_gpt":0.24893911688605927,"score_spread":0.22572274143251295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409102161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12313059,0.0003033849,0.8681313,0.0067076734,0.0004795272,0.0007601984,0.000014848752,0.00036565957,0.00010680762],"genre_scores_gemma":[0.98041195,0.00016112246,0.015987853,0.0023533544,0.00007384632,0.0008051213,0.00006199529,0.00002389149,0.000120845216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977947,0.00034839337,0.00057693233,0.00058945024,0.0001998201,0.00049073156],"domain_scores_gemma":[0.99664813,0.00042489002,0.00016802594,0.0024938667,0.00015560427,0.00010948427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005617949,0.0002806843,0.00034834904,0.00038478122,0.00049026374,0.00017204133,0.0029239876,0.00018437653,8.8259065e-7],"category_scores_gemma":[0.000007355414,0.00031695017,0.0001556263,0.0010186954,0.00023604798,0.0006749931,0.00018556579,0.0005271332,0.00000381853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605897,0.0002500424,0.0000863592,0.000009939573,0.000050386247,0.0000016154116,0.00045841903,0.79843307,0.0010493615,0.05830394,0.0022067751,0.13910405],"study_design_scores_gemma":[0.0010317116,0.00005046147,0.00014543218,0.000101719714,0.000032246277,0.0000013791517,0.000064382206,0.99757177,0.00005992364,0.0004526516,0.00022708604,0.00026121514],"about_ca_topic_score_codex":0.000028736911,"about_ca_topic_score_gemma":0.00038947497,"teacher_disagreement_score":0.8572814,"about_ca_system_score_codex":0.00015342506,"about_ca_system_score_gemma":0.00014186736,"threshold_uncertainty_score":0.99992824},"labels":[],"label_agreement":null},{"id":"W4409102298","doi":"10.1109/lwc.2025.3557052","title":"CSI Robust Joint User Selection and Precoder Design in MIMO Downlink Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Telecommunications link; Computer science; MIMO; Joint (building); Selection (genetic algorithm); Multi-user MIMO; Computer network; Control theory (sociology); Engineering; Artificial intelligence; Control (management)","score_opus":0.027227603242737652,"score_gpt":0.23704507387436638,"score_spread":0.20981747063162873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409102298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03378085,0.0010096163,0.9624486,0.0008714978,0.0003654228,0.0007047966,0.0000045190204,0.00033469844,0.0004799775],"genre_scores_gemma":[0.96144414,0.000614825,0.03719968,0.00013575713,0.000026845622,0.00038861553,0.000019399018,0.000040103154,0.000130622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888,0.00021971874,0.0004271392,0.00019050573,0.00007004493,0.00021253899],"domain_scores_gemma":[0.99888796,0.0001775213,0.000064070075,0.0007759365,0.000058986167,0.000035512086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002575428,0.00017334541,0.0002328978,0.00033828506,0.00013979331,0.000080741534,0.0003156929,0.00010884051,0.0000019381032],"category_scores_gemma":[0.000018064646,0.0002013441,0.000026444874,0.00054417073,0.000056708206,0.00029726315,0.000053035546,0.00029923767,0.000008581843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033990318,0.000019970461,0.00050487806,0.0000973262,0.000032348456,3.985397e-7,0.0002181926,0.9697377,0.026149103,0.00035447106,0.002133929,0.0007482902],"study_design_scores_gemma":[0.00037661128,0.000005424761,0.0005470241,0.0003091496,0.000017380984,0.000006518364,0.00010875489,0.995272,0.0019912673,0.000014253521,0.0011452732,0.0002063813],"about_ca_topic_score_codex":0.00012611979,"about_ca_topic_score_gemma":0.00021475754,"teacher_disagreement_score":0.9276633,"about_ca_system_score_codex":0.00028151265,"about_ca_system_score_gemma":0.000020610698,"threshold_uncertainty_score":0.8210574},"labels":[],"label_agreement":null},{"id":"W4409235178","doi":"10.1109/lwc.2025.3558198","title":"Geo2ComMap: Deep Learning-Based MIMO Throughput Prediction Using Geographic Data","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced MIMO Systems Optimization","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":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Computer science; Throughput; MIMO; Deep learning; Data modeling; Artificial intelligence; Machine learning; Data mining; Computer network; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.02883248799079383,"score_gpt":0.2718138897967052,"score_spread":0.24298140180591135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409235178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044162184,0.0008355781,0.95128125,0.0013236683,0.0004891056,0.00039588762,0.000050723167,0.0009637616,0.00049781473],"genre_scores_gemma":[0.96795684,0.0003433027,0.03044223,0.00040464982,0.00004604434,0.00008390504,0.00064355094,0.00006238415,0.000017115151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985868,0.00021506549,0.0004618971,0.0003063459,0.00013880356,0.00029109328],"domain_scores_gemma":[0.99586177,0.00028775545,0.0001067428,0.0036090252,0.00008671484,0.000048020276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002794169,0.00023284924,0.00023889034,0.00036872004,0.00046045234,0.00008193274,0.0016551374,0.00012359461,0.000009217274],"category_scores_gemma":[0.000044944194,0.00028526818,0.000060818133,0.0008344351,0.000176408,0.00050038035,0.00023827661,0.0005143118,0.000014152953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003134281,0.000034370234,0.003058803,0.00007403899,0.00008371251,7.161437e-7,0.00007232118,0.9770062,0.017147547,0.00021943288,0.00076214044,0.0015375849],"study_design_scores_gemma":[0.0003078055,0.000004617071,0.00031964047,0.00021211225,0.000056585875,0.0000020253203,0.000076459684,0.9931641,0.0008428259,0.000021127158,0.0047785644,0.00021409961],"about_ca_topic_score_codex":0.000105689884,"about_ca_topic_score_gemma":0.00011568411,"teacher_disagreement_score":0.9237946,"about_ca_system_score_codex":0.00018530422,"about_ca_system_score_gemma":0.000030216459,"threshold_uncertainty_score":0.99995995},"labels":[],"label_agreement":null},{"id":"W4409474001","doi":"10.1109/lwc.2025.3560861","title":"Dimensional Scaling Laws for Continuous Fluid Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Vibration and Dynamic Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; European Research Council; Queen's University; Queen's University Belfast; European Commission","keywords":"Scaling law; Computer science; Antenna (radio); Scaling; Telecommunications; Mathematics; Geometry","score_opus":0.012361835441352335,"score_gpt":0.2401486300058851,"score_spread":0.22778679456453277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409474001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09972479,0.0008816116,0.8929119,0.0042099743,0.0006017643,0.00033979502,0.000042681426,0.00039667363,0.000890824],"genre_scores_gemma":[0.9953938,0.00009195719,0.00304393,0.00088058313,0.00003447639,0.00016994729,0.00011056559,0.000022070317,0.0002526838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.000054614924,0.00032779193,0.00013040283,0.00009018703,0.00017744467],"domain_scores_gemma":[0.9986879,0.00022593298,0.00004046949,0.00092788524,0.000078924,0.000038844708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015171935,0.0001277036,0.00022505873,0.0001739185,0.00025643696,0.00007833679,0.0005006658,0.00006089983,0.0000036237443],"category_scores_gemma":[0.0000125357565,0.00013649439,0.000109556175,0.00029097148,0.00008681491,0.000099885714,0.00004585175,0.00012921871,0.0000131722545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001654792,0.00009308217,0.00071896863,0.00020376974,0.0006039196,0.0000015911501,0.00029603348,0.5716269,0.37010035,0.015920717,0.03633842,0.0040796865],"study_design_scores_gemma":[0.00027113923,0.0000025346849,0.00009783948,0.00008489786,0.00005281743,0.0000014558864,0.00011361653,0.9915518,0.0003130477,0.000023879838,0.0073499153,0.0001370429],"about_ca_topic_score_codex":0.00004363042,"about_ca_topic_score_gemma":0.000032747015,"teacher_disagreement_score":0.895669,"about_ca_system_score_codex":0.00007825514,"about_ca_system_score_gemma":0.000017252602,"threshold_uncertainty_score":0.55660796},"labels":[],"label_agreement":null},{"id":"W4409494585","doi":"10.1109/lwc.2025.3561716","title":"Broadband Channel Characterization and Estimation for Wideband Terahertz Wireless Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","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","keywords":"Wideband; Wireless; Computer science; Terahertz radiation; Broadband; Broadband networks; Telecommunications; Channel (broadcasting); Wireless broadband; Characterization (materials science); Narrowband; Electronic engineering; Wireless network; Optoelectronics; Engineering; Physics; Optics","score_opus":0.026756424654684415,"score_gpt":0.262194672958844,"score_spread":0.2354382483041596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409494585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22750577,0.0004058393,0.764753,0.005922875,0.0002237986,0.0006244717,0.000058141275,0.00028005269,0.00022606611],"genre_scores_gemma":[0.9840723,0.0024401108,0.010741301,0.0012728127,0.000030180121,0.00058175164,0.0006984715,0.00004852897,0.00011454238],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883246,0.00010090407,0.0004902771,0.00022678247,0.000103445826,0.00024614352],"domain_scores_gemma":[0.99769,0.00028237075,0.000101150385,0.0017312592,0.00012728482,0.00006791802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024139945,0.00023147682,0.00025667736,0.0002931376,0.0005725885,0.00016011365,0.00079049135,0.000111790556,0.0000027706103],"category_scores_gemma":[0.00002145014,0.00026750975,0.00006722776,0.0003168251,0.00019613952,0.00035473978,0.0001420026,0.00024404768,0.000006071366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018547275,0.00009142924,0.00016596782,0.00027252804,0.0001788202,1.921522e-7,0.0014705026,0.004892693,0.82687265,0.0012293616,0.0011806223,0.16362669],"study_design_scores_gemma":[0.00063291163,0.0000104521505,0.00031004762,0.00020726594,0.00007351352,0.0000030178696,0.00007471874,0.9664061,0.026586546,0.00018919667,0.0052188863,0.0002873619],"about_ca_topic_score_codex":0.000026796084,"about_ca_topic_score_gemma":0.00006021334,"teacher_disagreement_score":0.9615134,"about_ca_system_score_codex":0.00010038144,"about_ca_system_score_gemma":0.000025684969,"threshold_uncertainty_score":0.9999777},"labels":[],"label_agreement":null},{"id":"W4409641268","doi":"10.1109/lwc.2025.3563156","title":"A Novel Machine Learning Algorithm With Mathematical Modeling for Channel Estimation in VLC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Semiconductor Lasers and Optical Devices","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Algorithm; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.023535127042039576,"score_gpt":0.25117002650979414,"score_spread":0.22763489946775456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409641268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06872004,0.00041638277,0.9291328,0.0007853425,0.000086432854,0.00039063947,0.000018561834,0.00018551224,0.0002642481],"genre_scores_gemma":[0.93953615,0.000052660926,0.05980275,0.000115689494,0.000014057193,0.00034712916,0.000064437285,0.000031958043,0.00003515654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923617,0.00002799159,0.00030032307,0.00013857974,0.000089853,0.00020708464],"domain_scores_gemma":[0.99910057,0.00027651538,0.000032457083,0.0005170915,0.000038281687,0.000035095847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017773156,0.00014712109,0.00022517842,0.00017785378,0.00012252513,0.000074941025,0.00038874723,0.00006402563,0.0000016857788],"category_scores_gemma":[0.000018180348,0.00013857879,0.000036617013,0.0002815175,0.000050159546,0.00014977541,0.000035552985,0.00028357533,0.0000067109654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058205505,0.000045602563,0.000015861177,0.00019895902,0.000046607245,4.207003e-7,0.00020114136,0.98925066,0.006446346,0.001696912,0.00003446458,0.0020572336],"study_design_scores_gemma":[0.0004666477,0.000010610068,0.000006333961,0.00040115908,0.000025777043,0.0000036144713,0.00015805078,0.9983279,0.00024302698,0.000073626405,0.00013143042,0.00015183886],"about_ca_topic_score_codex":0.0000889592,"about_ca_topic_score_gemma":0.00003895333,"teacher_disagreement_score":0.8708161,"about_ca_system_score_codex":0.00009573132,"about_ca_system_score_gemma":0.000011303518,"threshold_uncertainty_score":0.56510794},"labels":[],"label_agreement":null},{"id":"W4409763379","doi":"10.1109/lwc.2025.3564053","title":"A Multi-Feature Spectrum Sensing Algorithm Based on GRU-AM","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Algorithms and Applications","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":"China Scholarship Council","keywords":"Computer science; Algorithm; Feature (linguistics); Spectrum (functional analysis); Physics","score_opus":0.011740186179399334,"score_gpt":0.2538360115394322,"score_spread":0.24209582536003285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409763379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046084854,0.00016630955,0.97430336,0.018397495,0.0003079902,0.00034904582,0.000056876044,0.0006832417,0.0011271713],"genre_scores_gemma":[0.5384847,0.00016081177,0.45721355,0.0035674914,0.00008431823,0.00011453451,0.00010151473,0.000064161664,0.00020893574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990962,0.000047840622,0.00022144604,0.0002278001,0.00011856734,0.00028811052],"domain_scores_gemma":[0.9977441,0.00019977876,0.000042285476,0.0019188761,0.000033731525,0.000061217026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000758494,0.00022551083,0.00019926955,0.0002165105,0.00036830717,0.000060160222,0.00067393965,0.000090895126,0.0000042903507],"category_scores_gemma":[0.000006437948,0.00024848714,0.00009376837,0.0006125404,0.000135998,0.00008881435,0.000057801743,0.0005477686,0.00004180393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008529051,0.0003711552,0.00010278708,0.000094276664,0.00018592144,0.000011989026,0.00028731092,0.46569246,0.1164154,0.002208184,0.02564344,0.38897854],"study_design_scores_gemma":[0.0004031674,0.0000049485475,0.00038975495,0.000109483575,0.000020468893,0.0000020090629,0.000042374806,0.966287,0.005618912,0.00006799233,0.026812153,0.0002416998],"about_ca_topic_score_codex":0.00002532139,"about_ca_topic_score_gemma":0.00004209206,"teacher_disagreement_score":0.5338762,"about_ca_system_score_codex":0.0001680846,"about_ca_system_score_gemma":0.000022951632,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W4410115200","doi":"10.1109/lwc.2025.3567563","title":"Low-Complexity CRB Minimization for ISAC With a Generalized Target Response Matrix","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Fault Detection and Control 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":"Minification; Computer science; Computational complexity theory; Matrix (chemical analysis); Matrix algebra; Algorithm; Mathematical optimization; Mathematics; Physics; Materials science","score_opus":0.016933369568478306,"score_gpt":0.26659040598430056,"score_spread":0.24965703641582226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410115200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5581753,0.0002844587,0.42949826,0.009554439,0.00047918726,0.00091430685,0.00006505259,0.0006599039,0.00036907877],"genre_scores_gemma":[0.9827537,0.00003548121,0.0149888545,0.00095291674,0.00003959947,0.0007247766,0.000057434743,0.000039420484,0.0004078517],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895895,0.00022259697,0.00032734274,0.00016639131,0.00010594345,0.00021880963],"domain_scores_gemma":[0.9983364,0.00027405794,0.00006167673,0.0012021869,0.00007925607,0.000046448306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023286995,0.0001738983,0.0002392186,0.0002114817,0.00028416837,0.00008013745,0.0005603005,0.00007551391,0.000008555833],"category_scores_gemma":[0.000021852402,0.00017500621,0.000083489234,0.0004056483,0.000121423516,0.0001151216,0.000027565196,0.00015299632,0.000013309329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018988661,0.00020121106,0.00035476327,0.0004469014,0.00049489253,0.0000026040605,0.001171467,0.257164,0.6790869,0.005929926,0.049975652,0.0032728026],"study_design_scores_gemma":[0.0027281784,0.000033915552,0.0005454251,0.00014564901,0.00005526131,0.0000053461945,0.00016183894,0.9099858,0.0154054025,0.00009133003,0.070468254,0.0003736037],"about_ca_topic_score_codex":0.000046319867,"about_ca_topic_score_gemma":0.00010938398,"teacher_disagreement_score":0.6636815,"about_ca_system_score_codex":0.00014748955,"about_ca_system_score_gemma":0.000036250072,"threshold_uncertainty_score":0.7136546},"labels":[],"label_agreement":null},{"id":"W4410428209","doi":"10.1109/lwc.2025.3570738","title":"AI-Based CSI Feedback With Digital Twins: Real-World Validation and Insights","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Digital Transformation in Industry","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":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.016389811113372163,"score_gpt":0.24162619784222336,"score_spread":0.2252363867288512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410428209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8644771,0.00009757006,0.033540733,0.010663313,0.0002311663,0.00049139746,0.000057329165,0.0008486754,0.08959275],"genre_scores_gemma":[0.99759656,0.00006687082,0.00078807806,0.0011353347,0.000013012943,0.00009776927,0.00014517008,0.000030048963,0.00012713448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921584,0.000030313828,0.0003000778,0.00013986036,0.00014209797,0.0001718109],"domain_scores_gemma":[0.99868506,0.000175116,0.000040158026,0.0009810517,0.00006198412,0.000056652847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004718535,0.00018150339,0.00015878289,0.00031394497,0.00016523601,0.00034157804,0.0004813449,0.000065514345,0.000003718454],"category_scores_gemma":[0.0000040156133,0.00018322967,0.000033317472,0.00064355653,0.00022963969,0.0009575071,0.000034142202,0.00031481584,0.00002181534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021371158,0.0010506633,0.046512596,0.0020839798,0.0016140228,0.000018859353,0.0068309954,0.55993634,0.035082716,0.09796514,0.09434643,0.15434454],"study_design_scores_gemma":[0.011251903,0.00018406988,0.030535214,0.005136837,0.0004638616,0.000030193058,0.0027450563,0.42664054,0.1578137,0.0024584013,0.3579198,0.0048204083],"about_ca_topic_score_codex":0.000018080123,"about_ca_topic_score_gemma":0.00007587705,"teacher_disagreement_score":0.26357338,"about_ca_system_score_codex":0.00011713159,"about_ca_system_score_gemma":0.00003766607,"threshold_uncertainty_score":0.7471889},"labels":[],"label_agreement":null},{"id":"W4411055418","doi":"10.1109/lwc.2025.3577065","title":"Tightly Coupled Hexagonal Antenna Arrays for Multi-Band Massive MIMO Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Analysis","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 Manitoba","funders":"","keywords":"MIMO; Hexagonal crystal system; Computer science; Antenna (radio); Physics; Optoelectronics; Electronic engineering; Materials science; Telecommunications; Chemistry; Beamforming; Engineering","score_opus":0.03167160155526375,"score_gpt":0.2644318286880291,"score_spread":0.23276022713276537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411055418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029137777,0.001316071,0.96430415,0.0037186155,0.00048606694,0.00045621206,0.00006334679,0.00032332065,0.00019445823],"genre_scores_gemma":[0.9907615,0.00043583856,0.007033459,0.0007299146,0.00007177219,0.00036357014,0.00009827417,0.00003944837,0.0004661982],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989371,0.0000709187,0.00038708048,0.00019875861,0.000110340225,0.00029584498],"domain_scores_gemma":[0.99830604,0.00026093744,0.00007070201,0.001181064,0.00011677979,0.0000644968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015871893,0.00021555016,0.00033815295,0.00024205683,0.00031271312,0.00010390245,0.0008941078,0.00009102181,0.0000045693373],"category_scores_gemma":[0.000013575354,0.0002196748,0.00017795914,0.00039920805,0.00015978016,0.00011817643,0.0000348827,0.00023175353,0.00002372964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015334748,0.00009996783,0.00040044254,0.00019608962,0.0006196097,0.0000029863438,0.00028365795,0.0052497955,0.9828884,0.0019531727,0.0076998016,0.0005907602],"study_design_scores_gemma":[0.00054627465,0.0000061140877,0.00015471848,0.00017132767,0.00011018909,0.0000015716349,0.00024950062,0.9924422,0.0015430924,0.000008809622,0.004521839,0.0002443556],"about_ca_topic_score_codex":0.00006839343,"about_ca_topic_score_gemma":0.00005200023,"teacher_disagreement_score":0.9871924,"about_ca_system_score_codex":0.00011434882,"about_ca_system_score_gemma":0.000030146459,"threshold_uncertainty_score":0.8958078},"labels":[],"label_agreement":null},{"id":"W4411086864","doi":"10.1109/lwc.2025.3577135","title":"Prediction of Wireless Channel Statistics With Ray Tracing and Uncalibrated Digital Twin","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","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 Waterloo","funders":"","keywords":"Computer science; Ray tracing (physics); Wireless; Channel (broadcasting); Shadow mapping; Statistics; Algorithm; Artificial intelligence; Computer network; Telecommunications; Mathematics","score_opus":0.016358012824108058,"score_gpt":0.23889377246199814,"score_spread":0.22253575963789007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411086864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4947698,0.00001788085,0.5033356,0.001193194,0.00003128149,0.00012025609,0.00017398527,0.00008771127,0.0002702686],"genre_scores_gemma":[0.984453,0.0000131059,0.015288895,0.00007143104,0.000010183101,0.000019984598,0.000100911384,0.00001417001,0.000028297876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993242,0.000033655415,0.0002403639,0.00016139261,0.00008530361,0.00015510985],"domain_scores_gemma":[0.9987951,0.00025818747,0.000114966504,0.0007289775,0.00007518124,0.000027607784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041534568,0.00012994857,0.00019238955,0.00008996707,0.00016211647,0.000055950502,0.00031799168,0.00003836041,0.0000015630638],"category_scores_gemma":[0.000007850069,0.00012001706,0.000021298027,0.0002909534,0.00057307107,0.00020785205,0.00011924901,0.00022664132,0.0000011227594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002727789,0.0014459878,0.12681043,0.00029876715,0.0014060129,0.000007626026,0.0026046701,0.025292058,0.13784263,0.36948195,0.004168669,0.33036843],"study_design_scores_gemma":[0.007307639,0.00046072577,0.037788685,0.002994742,0.0006554449,0.000010384922,0.009424589,0.76390314,0.13418908,0.039090578,0.0020540806,0.0021208997],"about_ca_topic_score_codex":0.000042280884,"about_ca_topic_score_gemma":0.0000041856724,"teacher_disagreement_score":0.7386111,"about_ca_system_score_codex":0.00002355183,"about_ca_system_score_gemma":0.000025873827,"threshold_uncertainty_score":0.48941535},"labels":[],"label_agreement":null},{"id":"W4411640094","doi":"10.1109/lwc.2025.3583270","title":"Near-Field Energy Harvesting Using XL-MIMO Over Non-Stationary Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Engineering and Physical Sciences Research Council; European Commission; Queen's University; Queen's University Belfast; Department for the Economy; UK Research and Innovation","keywords":"Energy harvesting; MIMO; Energy (signal processing); Computer science; Field (mathematics); Channel (broadcasting); Telecommunications; Physics; Mathematics","score_opus":0.0167477046907739,"score_gpt":0.25487685339984695,"score_spread":0.23812914870907304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411640094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60776156,0.00066770084,0.38167214,0.0020773106,0.001661668,0.00017312789,0.000010389837,0.00084742723,0.0051286644],"genre_scores_gemma":[0.9757372,0.00024282798,0.020188423,0.0031021642,0.00017904927,0.00011446717,0.000058912574,0.000091687805,0.00028527275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830496,0.00013849251,0.0005517473,0.00030547305,0.00020814082,0.00049116777],"domain_scores_gemma":[0.9969485,0.000907355,0.00011374035,0.0018455045,0.00008963093,0.00009527697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020417612,0.0003312476,0.00031777262,0.0002573505,0.0006303304,0.00023492152,0.0013117177,0.00018962198,0.0000129107275],"category_scores_gemma":[0.000045156674,0.00041307393,0.00011059603,0.0008730165,0.00022320471,0.0004083634,0.00024804674,0.0005705459,0.000009703658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004663862,0.000039576196,0.0012249408,0.00006198705,0.00013321197,0.00000822715,0.00021448972,0.93725985,0.03915858,0.002887821,0.008903886,0.010102759],"study_design_scores_gemma":[0.00029552652,0.000007125037,0.00059908885,0.00048982864,0.00004080169,0.000008397904,0.00003674761,0.9836313,0.0050780517,0.00009573977,0.009310887,0.00040648275],"about_ca_topic_score_codex":0.0007830538,"about_ca_topic_score_gemma":0.00017574003,"teacher_disagreement_score":0.36797562,"about_ca_system_score_codex":0.0002159016,"about_ca_system_score_gemma":0.00007435943,"threshold_uncertainty_score":0.9998321},"labels":[],"label_agreement":null},{"id":"W4412170927","doi":"10.1109/lwc.2025.3587705","title":"Quantum-Enhanced Support Vector Regression for Full-Duplex Self-Interference Cancellation","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada; Canada Research Chairs","keywords":"Interference (communication); Single antenna interference cancellation; Computer science; Duplex (building); Telecommunications; Decoding methods","score_opus":0.021385713140126866,"score_gpt":0.27617903238377833,"score_spread":0.25479331924365145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412170927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84127593,0.00065458403,0.14369136,0.009157538,0.0011221565,0.001275857,0.00011332185,0.0017109939,0.000998235],"genre_scores_gemma":[0.98218775,0.0012746543,0.014081825,0.00055809534,0.00006627071,0.0011830637,0.000330228,0.00008779561,0.00023031363],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979298,0.00017420844,0.00077829504,0.0003931532,0.00020477941,0.00051972916],"domain_scores_gemma":[0.99469024,0.000822539,0.00018326023,0.003946607,0.00024865963,0.00010868569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027622937,0.00041194566,0.0004467621,0.0003674696,0.00065367064,0.00013099045,0.0025437414,0.00019629928,0.00003144238],"category_scores_gemma":[0.000046866433,0.00045405768,0.00018991751,0.0007674157,0.00022982167,0.0003347522,0.0002526488,0.0005640831,0.00006669583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054126813,0.00018868578,0.00010961424,0.00030216225,0.0002399946,6.5213686e-7,0.0016298044,0.14924906,0.80612826,0.0065086414,0.027171617,0.008417379],"study_design_scores_gemma":[0.0008760512,0.000040439903,0.0004987417,0.00039999516,0.00009005084,0.000003426114,0.0001911788,0.9287876,0.04914781,0.000022059603,0.01939147,0.00055120717],"about_ca_topic_score_codex":0.000060647242,"about_ca_topic_score_gemma":0.00040584782,"teacher_disagreement_score":0.7795385,"about_ca_system_score_codex":0.0005266353,"about_ca_system_score_gemma":0.0001288265,"threshold_uncertainty_score":0.99979115},"labels":[],"label_agreement":null},{"id":"W4412984960","doi":"10.1109/lwc.2025.3596094","title":"Frequency-Selective Modeling and Analysis for OFDM-Integrated Wideband Pinching-Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Central University Basic Research Fund of China","keywords":"Orthogonal frequency-division multiplexing; Wideband; Computer science; Electronic engineering; Antenna (radio); Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.019745213197075333,"score_gpt":0.2455417440746446,"score_spread":0.22579653087756926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412984960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1053272,0.0018982844,0.8909848,0.0010093808,0.00009266915,0.0002565939,0.00004545852,0.00023315323,0.00015251615],"genre_scores_gemma":[0.9942123,0.0006425145,0.0044642836,0.00027346393,0.000017222064,0.0001850166,0.00010887879,0.00002689784,0.00006938899],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988967,0.00010457973,0.0004101629,0.00023913222,0.00009285647,0.00025654235],"domain_scores_gemma":[0.9985199,0.00024664772,0.0000578741,0.00096477114,0.00015493201,0.000055886783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023516487,0.00021567811,0.00044686478,0.00064087234,0.0003424847,0.0001346196,0.00057391403,0.0000867507,0.0000013181448],"category_scores_gemma":[0.000023657974,0.00021439238,0.00019347378,0.001415082,0.000106882995,0.00015485747,0.000038471797,0.0002586104,0.000002049183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022670036,0.000089170455,0.0107730385,0.0002474113,0.008662429,0.000002493902,0.0010627409,0.28937915,0.68176544,0.0052598664,0.0010770444,0.0016585472],"study_design_scores_gemma":[0.0002224971,0.000004727102,0.00014308492,0.00009936423,0.00080484495,0.0000010406235,0.00027533562,0.9978428,0.00020297887,0.00012892223,0.00006375204,0.00021066146],"about_ca_topic_score_codex":0.00062574504,"about_ca_topic_score_gemma":0.000290168,"teacher_disagreement_score":0.88888514,"about_ca_system_score_codex":0.00012824377,"about_ca_system_score_gemma":0.000025545787,"threshold_uncertainty_score":0.87426674},"labels":[],"label_agreement":null},{"id":"W4413267670","doi":"10.1109/lwc.2025.3593066","title":"Cyber Physical Awareness via Intent-Driven Threat Assessment: Enhanced Space Networks With Intershell Links","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Information and Cyber Security","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Space (punctuation); Computer security; Computer network","score_opus":0.012748204850951978,"score_gpt":0.27748909458928506,"score_spread":0.2647408897383331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413267670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093622275,0.000027526368,0.8825905,0.017508013,0.00035928132,0.00029360762,0.0000024094124,0.00027712565,0.0053192624],"genre_scores_gemma":[0.9757736,0.000050496306,0.018109981,0.0057235984,0.00004127406,0.00014125848,0.000036071833,0.000014318891,0.00010944667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845284,0.00022408468,0.00034554504,0.0003452826,0.00026301833,0.00036921533],"domain_scores_gemma":[0.9963495,0.00023228706,0.00019649442,0.002918377,0.00021427617,0.000089081535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001663106,0.00026606515,0.00030369687,0.00019578687,0.00050496485,0.00031147123,0.0033659178,0.00012545,0.000004256634],"category_scores_gemma":[0.0000044582002,0.00024009115,0.000117342795,0.0008517121,0.0003118642,0.0009015738,0.0007309391,0.00095902476,0.000036940826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012295782,0.002236893,0.007217605,0.00021257311,0.0010843574,0.000027601296,0.027962826,0.07018472,0.032759886,0.67594516,0.01486415,0.16738129],"study_design_scores_gemma":[0.00078979385,0.0000407923,0.0022373218,0.0002519553,0.000036177626,0.00000845036,0.00022546704,0.9881248,0.005485127,0.00024069552,0.0021331636,0.0004262657],"about_ca_topic_score_codex":0.00011561318,"about_ca_topic_score_gemma":0.00018070503,"teacher_disagreement_score":0.9179401,"about_ca_system_score_codex":0.00018451885,"about_ca_system_score_gemma":0.000120016965,"threshold_uncertainty_score":0.9790633},"labels":[],"label_agreement":null},{"id":"W4413349479","doi":"10.1109/lwc.2025.3600899","title":"Energy-Efficient Resource Allocation for NOMA-Assisted Uplink Pinching-Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Telecommunications link; Computer science; Resource management (computing); Resource allocation; Energy (signal processing); Antenna (radio); Computer network; Telecommunications; Physics","score_opus":0.02019233114213491,"score_gpt":0.255448193834522,"score_spread":0.23525586269238707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413349479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01891798,0.0031408092,0.965481,0.007982749,0.00043213292,0.0006563235,0.000030747215,0.0022680792,0.0010901731],"genre_scores_gemma":[0.97721857,0.0007240713,0.019491203,0.00055255863,0.000029612553,0.0015484586,0.00020403818,0.000077370976,0.00015409749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820447,0.0001425117,0.0007292673,0.0003366506,0.00016897677,0.00041811905],"domain_scores_gemma":[0.99452025,0.0007669114,0.00018394872,0.004306317,0.00016506518,0.000057525634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000306756,0.00033021686,0.00038920218,0.00052756513,0.00062244025,0.00012794686,0.0028978053,0.00020408366,0.0000011694194],"category_scores_gemma":[0.000055697765,0.00037754452,0.00014377544,0.00087749556,0.0003436409,0.00014377186,0.00033135602,0.00043838614,0.000010528638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025941286,0.00022704608,0.000067688874,0.00031666888,0.00030756046,8.4871505e-7,0.00029390308,0.55713636,0.26486048,0.09579451,0.011048225,0.06992076],"study_design_scores_gemma":[0.00050460314,0.000010838326,0.00012227906,0.00026912364,0.00003958631,0.000004085741,0.0003339337,0.93529,0.00961487,0.00017095242,0.053246923,0.00039282354],"about_ca_topic_score_codex":0.000051452298,"about_ca_topic_score_gemma":0.000028849778,"teacher_disagreement_score":0.9583006,"about_ca_system_score_codex":0.0004349383,"about_ca_system_score_gemma":0.00003916446,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W4413472492","doi":"10.1109/lwc.2025.3601979","title":"Efficient Channel Estimation for Rotatable Antenna-Enabled Wireless Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Channel (broadcasting); Antenna (radio); Computer network; Telecommunications; Electronic engineering; Engineering","score_opus":0.029170896705145322,"score_gpt":0.3046146977958106,"score_spread":0.27544380109066524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030963494,0.0011805379,0.91022897,0.053429812,0.00037093955,0.0019502209,0.000023719249,0.00066580065,0.001186509],"genre_scores_gemma":[0.89306504,0.00074053416,0.10108977,0.0021741732,0.000030880918,0.0022943858,0.00018538556,0.00005021728,0.00036960348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957516,0.0010309035,0.0010315542,0.0007501365,0.0005548513,0.00088093505],"domain_scores_gemma":[0.98513603,0.0023558515,0.0004556002,0.011111315,0.0007663156,0.00017488479],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018901331,0.00043555585,0.0005578198,0.00080749573,0.0021310025,0.0007072137,0.012089039,0.00020600646,0.000004755729],"category_scores_gemma":[0.00014817684,0.00048330027,0.00024241871,0.0025457207,0.000609101,0.00065198954,0.0023269113,0.0008166405,0.000059601134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015188832,0.0018861034,0.00022022593,0.0004340544,0.00048627378,0.0000032518954,0.0030874559,0.25086534,0.07052519,0.5170355,0.034366295,0.12093846],"study_design_scores_gemma":[0.0011703176,0.000025390123,0.0002851472,0.00036114117,0.000029909595,0.0000053806248,0.000122863,0.9896159,0.002757224,0.0016658007,0.003520219,0.00044071383],"about_ca_topic_score_codex":0.00021102173,"about_ca_topic_score_gemma":0.00010975993,"teacher_disagreement_score":0.86210155,"about_ca_system_score_codex":0.0005025371,"about_ca_system_score_gemma":0.00032841766,"threshold_uncertainty_score":0.9997619},"labels":[],"label_agreement":null},{"id":"W4413754844","doi":"10.1109/lwc.2025.3603423","title":"UAV Individual Identification via Distilled RF Fingerprints-Based LLM in ISAC Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":3,"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; National Science Foundation","keywords":"Identification (biology); Computer science; Distilled water; Chemistry; Chromatography","score_opus":0.01061884664931444,"score_gpt":0.2383904291956958,"score_spread":0.22777158254638136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413754844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16162582,0.00029307706,0.8328574,0.003400697,0.00026900336,0.00048069662,0.00001778292,0.00034569215,0.0007098811],"genre_scores_gemma":[0.9934325,0.00021497853,0.004650848,0.00068581704,0.00002725292,0.00056236767,0.00035788925,0.00003425881,0.000034088393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876326,0.000086223954,0.0005327268,0.00023296407,0.00013546071,0.00024936986],"domain_scores_gemma":[0.99785644,0.00022158121,0.0000875171,0.0017316397,0.00005992519,0.000042905507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028548468,0.00018776646,0.00019735699,0.00036451986,0.00022421924,0.00011189135,0.0010656118,0.0001234247,0.000013987022],"category_scores_gemma":[0.0000141345545,0.00023035894,0.0000642885,0.0010712382,0.00013531525,0.00016073733,0.00008278183,0.0003618284,0.000030544063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006214599,0.00015906103,0.0027722677,0.000035164067,0.00004665242,4.547365e-7,0.00017116567,0.9639256,0.009801764,0.0011878093,0.0024376186,0.019456234],"study_design_scores_gemma":[0.00042082803,0.0000031119196,0.021944607,0.0000749227,0.000033650103,4.3303694e-7,0.000026948353,0.9738055,0.0013875994,0.00006746481,0.0020067922,0.00022815162],"about_ca_topic_score_codex":0.0000795592,"about_ca_topic_score_gemma":0.00026900318,"teacher_disagreement_score":0.83180666,"about_ca_system_score_codex":0.00020490134,"about_ca_system_score_gemma":0.000028286788,"threshold_uncertainty_score":0.93937653},"labels":[],"label_agreement":null},{"id":"W4414054218","doi":"10.1109/lwc.2025.3607032","title":"Joint Transmit Probabilities Optimization for AoI-Constrained Covert Communications With Multiple Friendly Jammers","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Ontario Ministry of Research and Innovation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Covert; Joint (building); Channel (broadcasting); Jamming; Throughput; Noise (video); Selection (genetic algorithm); Artificial noise; Sampling (signal processing)","score_opus":0.02008483865894526,"score_gpt":0.2458992257003919,"score_spread":0.22581438704144666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414054218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02431488,0.0008895278,0.9430155,0.022473551,0.00015548196,0.003211109,0.00025518553,0.0021024304,0.0035823006],"genre_scores_gemma":[0.77677715,0.0012936438,0.21651909,0.0007832045,0.00001438243,0.004045197,0.00044570793,0.000085405074,0.00003624409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978413,0.00027017316,0.0008467186,0.00034995793,0.00022715561,0.00046467464],"domain_scores_gemma":[0.9921592,0.0011046834,0.00016889311,0.006117859,0.00034918048,0.000100187346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042122212,0.00042684932,0.0005078666,0.00046008697,0.0007648309,0.00017169579,0.0032104126,0.00019545334,0.000012457898],"category_scores_gemma":[0.000054434102,0.00046780697,0.00019153005,0.0008152403,0.0011524282,0.0005035439,0.00024394039,0.0006214072,0.0000056671015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034056153,0.0022718145,0.003165501,0.0025511268,0.0027019177,0.0000028072407,0.011124408,0.51451147,0.13923793,0.17203367,0.04212558,0.10993325],"study_design_scores_gemma":[0.001771411,0.000068096895,0.00013760458,0.00052288733,0.00014893962,0.000006059038,0.0010071172,0.9378953,0.013621286,0.00034790052,0.043686178,0.0007872347],"about_ca_topic_score_codex":0.000091663205,"about_ca_topic_score_gemma":0.0005179769,"teacher_disagreement_score":0.75246227,"about_ca_system_score_codex":0.000402208,"about_ca_system_score_gemma":0.00014036137,"threshold_uncertainty_score":0.9997774},"labels":[],"label_agreement":null},{"id":"W4414798857","doi":"10.1109/lwc.2025.3617299","title":"A CNN-Based Digital Predistortion Method for Multi-Beam Phased-Array Transmitters","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Radio Frequency Integrated Circuit Design","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Baseband; Predistortion; Robustness (evolution); Transceiver; Transmitter; Nonlinear distortion; Mean squared error; Adjacent channel power ratio; Artificial neural network; Convolutional neural network","score_opus":0.032828249297218094,"score_gpt":0.29543643822533244,"score_spread":0.26260818892811433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414798857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009202298,0.00038925678,0.98290586,0.003073431,0.00052221003,0.0008415571,0.0001806665,0.0007865315,0.0020981769],"genre_scores_gemma":[0.9594573,0.00003030301,0.037938476,0.0011927502,0.00003115335,0.0010284736,0.00018901308,0.00007167894,0.00006084969],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986185,0.00009889818,0.0004982992,0.00028055158,0.00014080986,0.00036294028],"domain_scores_gemma":[0.9976749,0.00047736854,0.000067538786,0.0016103217,0.00009259363,0.00007728216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023073854,0.00029212795,0.0002967524,0.00034079896,0.00023491296,0.00013495443,0.0011842314,0.00013833595,0.000005310762],"category_scores_gemma":[0.000034797984,0.00033237005,0.00022372144,0.0005240952,0.00017546803,0.0003072178,0.0000018711344,0.00029769898,0.00001350753],"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.000013434577,0.0001284253,0.000096866694,0.00010826344,0.0001804355,6.640938e-7,0.0002666217,0.024818782,0.9481948,0.0003025494,0.005641748,0.0202474],"study_design_scores_gemma":[0.002138062,0.000035946545,0.00013438621,0.0002743641,0.00017137204,0.0000041285466,0.00012651618,0.28305662,0.68596095,0.000108698434,0.027330985,0.00065800163],"about_ca_topic_score_codex":0.000039318016,"about_ca_topic_score_gemma":0.000026066371,"teacher_disagreement_score":0.950255,"about_ca_system_score_codex":0.00051080715,"about_ca_system_score_gemma":0.00008553585,"threshold_uncertainty_score":0.99991286},"labels":[],"label_agreement":null},{"id":"W4414871556","doi":"10.1109/lwc.2025.3618168","title":"DRL-Based User Fairness in Beyond Diagonal Reconfigurable Intelligent Surface-Assisted Extremely Large Antenna Array Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Control reconfiguration; Telecommunications link; Benchmark (surveying); Diagonal; Reinforcement learning; Convergence (economics); Channel (broadcasting); Wavefront; Antenna (radio)","score_opus":0.02355632434579261,"score_gpt":0.25907951927569883,"score_spread":0.23552319492990623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25814527,0.0070722653,0.7166542,0.010213381,0.0009911048,0.0009911223,0.00015389177,0.0022487233,0.003530072],"genre_scores_gemma":[0.98878276,0.0021768787,0.007552918,0.0005568463,0.000010548411,0.00045097386,0.00017875501,0.0000810737,0.00020922541],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739033,0.00035276747,0.0009656343,0.00041627183,0.0002450913,0.0006299305],"domain_scores_gemma":[0.99404,0.000849546,0.00017489107,0.004679858,0.000182028,0.00007367439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043154458,0.00042330622,0.00057583017,0.0005595219,0.00033617517,0.00014147512,0.0028187933,0.0002666752,0.000018107048],"category_scores_gemma":[0.0000716422,0.0004945795,0.00013577806,0.0016156567,0.0003489905,0.00034056595,0.00018328351,0.0010394453,0.00006311765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039610055,0.0006483879,0.010210854,0.00043434367,0.00025452988,0.000016771002,0.0004026187,0.42452636,0.5267662,0.020060042,0.0042189327,0.01242137],"study_design_scores_gemma":[0.0031421967,0.000029730123,0.009313547,0.0021761858,0.00008504497,0.000017882212,0.0031848864,0.65737,0.22948879,0.0010077817,0.09201889,0.002165089],"about_ca_topic_score_codex":0.00010472623,"about_ca_topic_score_gemma":0.00074632326,"teacher_disagreement_score":0.7306375,"about_ca_system_score_codex":0.00062078197,"about_ca_system_score_gemma":0.00010962207,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W4415048550","doi":"10.1109/lwc.2025.3620133","title":"ZC-OFDM-Aided Waveform Design for LEO Satellite Integrated Communication and Navigation","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication 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 British Columbia","funders":"","keywords":"Ranging; Waveform; Low earth orbit; Satellite; Sequence (biology); Communications satellite; Multiplexing; Satellite navigation; Differential (mechanical device); Bit error rate","score_opus":0.03565849134907074,"score_gpt":0.27314987228083093,"score_spread":0.2374913809317602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415048550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23388053,0.039284557,0.6936765,0.017925454,0.00096971414,0.0053583975,0.0001232655,0.0027288704,0.006052742],"genre_scores_gemma":[0.9426459,0.011350922,0.043585476,0.00061389257,0.0000226643,0.0010211428,0.00055263564,0.00007388857,0.00013344624],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979703,0.00046088413,0.0008100762,0.00026717148,0.00015655062,0.00033500852],"domain_scores_gemma":[0.9941194,0.0014286042,0.00016527488,0.003944881,0.00025955724,0.00008227051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008686464,0.00032713034,0.00038504798,0.00036270483,0.0005612923,0.00021104424,0.0018823666,0.00019011047,0.0000033278254],"category_scores_gemma":[0.00005111318,0.00036069847,0.000099768506,0.0007857558,0.00036333676,0.00042786344,0.0001967488,0.00047641568,0.00002476958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017586834,0.00032355855,0.0022596098,0.0012136176,0.0010911274,0.000001430305,0.008420657,0.012357053,0.46351358,0.03849437,0.014475472,0.45767367],"study_design_scores_gemma":[0.0031599284,0.00006090828,0.0030656373,0.002208996,0.00025361913,0.000030867453,0.0023595772,0.56403214,0.0645426,0.0027759275,0.35587773,0.0016320682],"about_ca_topic_score_codex":0.0000941502,"about_ca_topic_score_gemma":0.00006887078,"teacher_disagreement_score":0.7087654,"about_ca_system_score_codex":0.00033544254,"about_ca_system_score_gemma":0.000050486746,"threshold_uncertainty_score":0.9998845},"labels":[],"label_agreement":null},{"id":"W4415179205","doi":"10.1109/lwc.2025.3621073","title":"Mode Switching-Based STAR-RIS With Discrete Phase Shifters","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Radar Systems and Signal Processing","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":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Maximization; Optimization problem; Coordinate descent; Scalability; Block (permutation group theory); Nonlinear programming; Power (physics); Linear programming; Phase (matter)","score_opus":0.01135323239109639,"score_gpt":0.26849956842044304,"score_spread":0.25714633602934667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415179205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54949886,0.0003732376,0.4449122,0.0034783366,0.00014592691,0.0001986678,0.000018281993,0.00037041574,0.001004094],"genre_scores_gemma":[0.9936727,0.00002602713,0.005038773,0.0010500434,0.00002423464,0.00009094921,0.00002895286,0.000043868284,0.000024409508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990046,0.00007677149,0.0003148615,0.00018027259,0.00016332822,0.00026013452],"domain_scores_gemma":[0.9983587,0.00012867009,0.00005983966,0.0013502485,0.000036724436,0.00006576313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012682923,0.00021255377,0.0002384194,0.00019369798,0.00031518267,0.00013623806,0.0008215613,0.000055826156,0.0000039650977],"category_scores_gemma":[0.0000038098215,0.00019551568,0.000064526896,0.00039871706,0.000108599954,0.00021609252,0.00003608039,0.000348798,0.000008200907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001544672,0.00029637985,0.0016798829,0.0008310505,0.00059613626,0.000025884086,0.0026413405,0.5473949,0.39948893,0.0016861823,0.0133390725,0.03186584],"study_design_scores_gemma":[0.0014855975,0.00002510952,0.00012007434,0.00059788366,0.00005911086,0.0000023210855,0.00018961703,0.9815009,0.009496497,0.000037247668,0.006078745,0.00040689766],"about_ca_topic_score_codex":0.00018003158,"about_ca_topic_score_gemma":0.00018841735,"teacher_disagreement_score":0.44417387,"about_ca_system_score_codex":0.00011505697,"about_ca_system_score_gemma":0.000051182487,"threshold_uncertainty_score":0.7972898},"labels":[],"label_agreement":null},{"id":"W4415368597","doi":"10.1109/lwc.2025.3623872","title":"Low-Complexity Beamforming for NF Secure ISAC","year":2025,"lang":"","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Eavesdropping; Beamforming; Base station; Constraint (computer-aided design); Exploit; Power (physics); Antenna array; Transmitter power output; Throughput","score_opus":0.030369054859652484,"score_gpt":0.2708032144542914,"score_spread":0.2404341595946389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01745323,0.0012345352,0.9603855,0.016027128,0.0013208815,0.0013573972,0.00015172864,0.0003834363,0.0016861509],"genre_scores_gemma":[0.90296865,0.0021026027,0.08960316,0.0037779075,0.00016584314,0.00043871062,0.0003144099,0.00011422344,0.0005144812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766874,0.00016740338,0.0008749167,0.00042713387,0.00019378327,0.00066802074],"domain_scores_gemma":[0.9960395,0.0005593612,0.00019809911,0.002861032,0.0002234001,0.00011857327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003809569,0.00048502325,0.00052968063,0.00041573864,0.0011200976,0.00023002329,0.002065074,0.00029109154,0.000033114084],"category_scores_gemma":[0.000048530426,0.00060452573,0.00031448243,0.0009087172,0.0005587598,0.00045849147,0.00023866739,0.00068887055,0.000045095876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024257119,0.001118968,0.0004970987,0.0039978186,0.0014760727,0.0000051595,0.007612531,0.46320334,0.2541328,0.13693209,0.07570488,0.055076644],"study_design_scores_gemma":[0.0010706943,0.000022556349,0.0001093437,0.0008324025,0.00021323543,0.0000028168163,0.00035666896,0.97647107,0.0060137655,0.00055899774,0.01370916,0.0006393104],"about_ca_topic_score_codex":0.00006789052,"about_ca_topic_score_gemma":0.00010002257,"teacher_disagreement_score":0.88551545,"about_ca_system_score_codex":0.00041040155,"about_ca_system_score_gemma":0.00011537451,"threshold_uncertainty_score":0.9996406},"labels":[],"label_agreement":null},{"id":"W4415482699","doi":"10.1109/lwc.2025.3624761","title":"Sum Rate Maximization for NOMA-Assisted Uplink Pinching-Antenna Systems","year":2025,"lang":"","type":"article","venue":"IEEE Wireless 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":"Memorial University of Newfoundland; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Maximization; Particle swarm optimization; Position (finance); Quality of service; Transmitter power output; Point (geometry)","score_opus":0.030175466631378368,"score_gpt":0.28076980352881187,"score_spread":0.2505943368974335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415482699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141638,0.010549195,0.9380665,0.028101366,0.002611787,0.0031588743,0.00022041964,0.002430616,0.00069748],"genre_scores_gemma":[0.93377715,0.012203288,0.048903815,0.00094107207,0.000086021995,0.0027609463,0.0005734951,0.00024312438,0.00051111006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946546,0.00071393413,0.002267752,0.0009342488,0.00029775334,0.0011317094],"domain_scores_gemma":[0.98522437,0.0025585108,0.0008707802,0.01053126,0.0006622962,0.00015278088],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010521521,0.001013023,0.0012606727,0.0013572476,0.0019401767,0.0006172124,0.007451079,0.0007301637,0.000008766197],"category_scores_gemma":[0.00038880768,0.0012618048,0.00046008654,0.0024204736,0.0011267817,0.0008333943,0.0012413411,0.0016335307,0.000067621324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017466626,0.0008235267,0.00069253513,0.0024910665,0.001928762,0.000005110327,0.0008616147,0.39783695,0.3752595,0.109816045,0.011477944,0.09863228],"study_design_scores_gemma":[0.0020529435,0.000044940825,0.00081034313,0.0017602298,0.00030452092,0.000009765699,0.00074852275,0.9622397,0.007090998,0.0008580062,0.022778083,0.0013019897],"about_ca_topic_score_codex":0.00017921362,"about_ca_topic_score_gemma":0.00011299071,"teacher_disagreement_score":0.9196133,"about_ca_system_score_codex":0.0012087342,"about_ca_system_score_gemma":0.00020840282,"threshold_uncertainty_score":0.9993592},"labels":[],"label_agreement":null},{"id":"W4415707387","doi":"10.1109/lwc.2025.3627524","title":"A Hyperbolic Secant-Based Pulse for Enhanced FTN Signaling in 5G/6G Systems","year":2025,"lang":"","type":"article","venue":"IEEE Wireless 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":"University of Ottawa","funders":"","keywords":"Pulse shaping; Robustness (evolution); Pulse compression; Spectral efficiency; Pulse (music); Hyperbolic function; Interference (communication); Signal processing","score_opus":0.023916017604878447,"score_gpt":0.27895594580121874,"score_spread":0.2550399281963403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415707387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747747,0.005517329,0.1959759,0.0130844405,0.0048875827,0.0031109238,0.00017067806,0.00052832166,0.0019501474],"genre_scores_gemma":[0.9912574,0.0005265451,0.0038604753,0.0009532512,0.00020200846,0.0027939572,0.00008924315,0.00013775777,0.00017936243],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961044,0.0005275306,0.0015299729,0.00062225875,0.00029958374,0.0009162073],"domain_scores_gemma":[0.99400824,0.0014493247,0.00029803562,0.0038715587,0.0002225881,0.00015026252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007258252,0.0006088338,0.0008621557,0.0011764814,0.00058977125,0.00028586117,0.0025491018,0.00035257865,0.000017662072],"category_scores_gemma":[0.00009543989,0.00081294746,0.00031202217,0.0017943109,0.00041074562,0.00031550362,0.0001305876,0.0010527023,0.000042625452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041088653,0.00018521184,0.00009324452,0.0007373756,0.00018802135,0.000001666249,0.00067339727,0.40047652,0.5908982,0.0010604162,0.0010330523,0.004611778],"study_design_scores_gemma":[0.0033675502,0.000036894668,0.0002426417,0.0035669645,0.00022866973,0.0000061579217,0.0012045326,0.7740829,0.20285901,0.000043648342,0.013204699,0.0011563161],"about_ca_topic_score_codex":0.0007557002,"about_ca_topic_score_gemma":0.00018998621,"teacher_disagreement_score":0.3880392,"about_ca_system_score_codex":0.001195309,"about_ca_system_score_gemma":0.00031789232,"threshold_uncertainty_score":0.99943215},"labels":[],"label_agreement":null},{"id":"W4415821327","doi":"10.1109/lwc.2025.3628136","title":"Moments of the Bivariate Fox-H Function Fading Model and Applications to Wireless System Performance Evaluation","year":2025,"lang":"","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Moment (physics); Moment-generating function; Bivariate analysis; Probability density function; Wireless; Ergodic theory; Cumulative distribution function; Bit error rate","score_opus":0.02759361873074427,"score_gpt":0.283855057693861,"score_spread":0.2562614389631167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415821327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3370684,0.0016525503,0.6512332,0.0032417523,0.00043005115,0.004153513,0.00008152761,0.00046324448,0.0016757791],"genre_scores_gemma":[0.9846571,0.0022393407,0.008148077,0.0005143913,0.00003328378,0.0041687917,0.000044632285,0.00010238185,0.00009201671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599475,0.0006329227,0.0015233443,0.00063362694,0.0006812544,0.00053412927],"domain_scores_gemma":[0.9910386,0.0004199485,0.0006405053,0.0071320697,0.0006513569,0.00011749198],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012716092,0.0005819924,0.0006699931,0.00075460767,0.0014189602,0.00013766695,0.0035985445,0.0002853135,0.000003239561],"category_scores_gemma":[0.00003493565,0.000616565,0.00018423467,0.0024086442,0.0005528012,0.0006082834,0.0013386763,0.00091148226,0.000013285739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045477525,0.00018135498,0.00082407665,0.0010280928,0.00034785175,5.3292734e-8,0.0011384174,0.6145617,0.15504943,0.02992989,0.0003320541,0.1965616],"study_design_scores_gemma":[0.0006648407,0.00002380026,0.0027923628,0.0021074265,0.00043960274,0.0000026015332,0.0004513792,0.9751689,0.015971957,0.00024076947,0.0016129279,0.00052347075],"about_ca_topic_score_codex":0.000094420895,"about_ca_topic_score_gemma":0.000046914352,"teacher_disagreement_score":0.6475887,"about_ca_system_score_codex":0.0012950128,"about_ca_system_score_gemma":0.00021203615,"threshold_uncertainty_score":0.999881},"labels":[],"label_agreement":null},{"id":"W7092300471","doi":"10.1109/lwc.2025.3622730","title":"Pinching Antenna-Aided Wireless Powered Communication Networks","year":2025,"lang":"","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Molecular Communication and Nanonetworks","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":"Université Laval","funders":"Fundamental Research Funds for the Central Universities","keywords":"Maximization; Wireless; Transmission (telecommunications); Resource allocation; Wireless network; Power (physics); Position (finance); Nonlinear system; Nonlinear programming","score_opus":0.01350829718360907,"score_gpt":0.24951296023643324,"score_spread":0.23600466305282417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092300471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703198,0.054552898,0.8339669,0.023102732,0.0035129604,0.0024661417,0.00005021845,0.0015343783,0.0137817655],"genre_scores_gemma":[0.9287557,0.051115245,0.013580968,0.0046574683,0.00015074252,0.0004494749,0.00057994365,0.0002463038,0.0004641552],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914884,0.0030524347,0.0025217766,0.0009353831,0.0005736313,0.0014283834],"domain_scores_gemma":[0.9786593,0.0019674478,0.0007651537,0.01780135,0.00044364645,0.00036311414],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016860255,0.0012172245,0.0013573163,0.0010581346,0.0025425258,0.00082762726,0.010612533,0.0008792191,0.00007840399],"category_scores_gemma":[0.00009435759,0.0015656739,0.0007371007,0.0032572292,0.0013809038,0.0007407416,0.0024064237,0.0036425143,0.00014998447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006003392,0.003586212,0.008383126,0.0018118374,0.0064550294,0.00003790771,0.0068818177,0.27032825,0.29098868,0.082900986,0.09374489,0.23428091],"study_design_scores_gemma":[0.0021205903,0.000026640424,0.0013787764,0.002657028,0.00045150777,0.000017181605,0.00037946829,0.9637017,0.0012349093,0.00026188427,0.02624495,0.0015253498],"about_ca_topic_score_codex":0.0004646317,"about_ca_topic_score_gemma":0.00069828826,"teacher_disagreement_score":0.8617237,"about_ca_system_score_codex":0.0009001519,"about_ca_system_score_gemma":0.00027029356,"threshold_uncertainty_score":0.99875605},"labels":[],"label_agreement":null},{"id":"W7108209639","doi":"10.1109/lwc.2025.3638965","title":"Dynamic Data Routing for Non-ISL LEO Satellite-Based NT-IoT Communications","year":2025,"lang":"","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Routing (electronic design automation); Exploit; Heuristic; Static routing; Enhanced Data Rates for GSM Evolution; Visibility; Dynamic Source Routing; Construct (python library); Dynamic programming; Link-state routing protocol","score_opus":0.06659904309957577,"score_gpt":0.3320469446273908,"score_spread":0.26544790152781506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108209639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01903624,0.0848358,0.7035967,0.15747072,0.0054147807,0.011929597,0.0042229057,0.00269683,0.010796395],"genre_scores_gemma":[0.86905265,0.020477917,0.09941667,0.0031882443,0.000094982715,0.0015860522,0.00548711,0.00034783475,0.00034854046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99106705,0.0017444905,0.00353612,0.0014585016,0.0006303211,0.0015635412],"domain_scores_gemma":[0.9310403,0.007923285,0.0010327894,0.058953986,0.00073323224,0.00031642267],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003266001,0.001300222,0.001571437,0.0013279293,0.003010913,0.00095958257,0.03583863,0.0007233714,0.000022190505],"category_scores_gemma":[0.00039618977,0.0017093763,0.0005773553,0.0031291393,0.0018554698,0.00087511126,0.00532101,0.0023596177,0.00027072398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039845923,0.0044101668,0.009154805,0.007099484,0.0068635885,0.000009055945,0.009886884,0.04299354,0.30055642,0.025028871,0.027877549,0.56572115],"study_design_scores_gemma":[0.0019286467,0.000026169788,0.00081488414,0.0021274593,0.00047240377,0.000005346224,0.00091766106,0.7705273,0.0012388342,0.00006958799,0.22066413,0.0012075874],"about_ca_topic_score_codex":0.0005456163,"about_ca_topic_score_gemma":0.0015963771,"teacher_disagreement_score":0.8500164,"about_ca_system_score_codex":0.0016128846,"about_ca_system_score_gemma":0.00077841675,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W7116766820","doi":"10.1109/lwc.2025.3646864","title":"Backscatter-Assisted High-Speed Rail Communications in Straight Tunnel Environments: Effects of Tag Number and Phase Control","year":2025,"lang":"","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Backscatter (email); Channel (broadcasting); Automatic gain control; Phase (matter); Gaussian; Communications system; Signal-to-noise ratio (imaging); Wireless","score_opus":0.011819913595345267,"score_gpt":0.2596095345304609,"score_spread":0.2477896209351156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116766820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9266217,0.006833249,0.045317527,0.015583668,0.0012003429,0.0020807423,0.0002758051,0.0002751275,0.0018118873],"genre_scores_gemma":[0.9817508,0.00785797,0.008053364,0.0012559745,0.000057452307,0.000400544,0.00025486448,0.00015032485,0.00021870907],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944214,0.0016044334,0.0020041203,0.00071433745,0.0003805291,0.0008751573],"domain_scores_gemma":[0.98657525,0.004685573,0.00061457686,0.007813973,0.000084542735,0.00022609078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065164996,0.00084871106,0.0013439907,0.0005893596,0.00055529847,0.00016840726,0.0040949844,0.0005257891,0.000047069356],"category_scores_gemma":[0.00011473579,0.0010782963,0.00023234995,0.0013474199,0.0023239832,0.0005112567,0.0009192971,0.0018326176,0.000030845487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019930035,0.0058995145,0.013101342,0.0021302432,0.0025851838,0.000036563,0.0020989908,0.09671213,0.7964798,0.01701307,0.0042274846,0.059516367],"study_design_scores_gemma":[0.048342913,0.00023971342,0.12421659,0.014675781,0.0022552495,0.000048555627,0.0005170276,0.7620873,0.02821632,0.0003355401,0.015181937,0.0038830675],"about_ca_topic_score_codex":0.00061689457,"about_ca_topic_score_gemma":0.00052486715,"teacher_disagreement_score":0.7682635,"about_ca_system_score_codex":0.0005689897,"about_ca_system_score_gemma":0.00009818932,"threshold_uncertainty_score":0.9991667},"labels":[],"label_agreement":null}]}