{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":608,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":608,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"7e8552bd3650","filters":{"venue":"IEEE Communications Letters"}},"results":[{"id":"W2125669974","doi":"10.1109/lcomm.2008.080739","title":"Spatial modulation: optimal detection and performance analysis","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":913,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"","keywords":"Detector; Spatial modulation; Computer science; Modulation (music); Algorithm; Bit error rate; Wireless; Antenna (radio); Probability of error; Electronic engineering; Telecommunications; MIMO; Channel (broadcasting); Decoding methods; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02177888912411954,"gpt":0.2281418422577608,"spread":0.2063629531336413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005950943,0.0001188037,0.0001473456,0.0003012514,0.0003902617,0.00001659012,0.0005992716,0.00006165448,0.000005570847],"category_scores_gemma":[0.00001252068,0.000138907,0.00004761623,0.0006503298,0.0002956818,0.0002698349,0.0001203912,0.0002562285,0.00001337264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007054087,"about_ca_system_score_gemma":0.000004026803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002422986,"about_ca_topic_score_gemma":0.00005852493,"domain_scores_codex":[0.9993998,0.00003544881,0.0002145474,0.0001202331,0.00009384668,0.0001360694],"domain_scores_gemma":[0.9980437,0.00008195081,0.00004882691,0.001758783,0.00003662433,0.00003014115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005656647,0.00002205832,0.01112235,0.00001298495,0.000228315,7.126706e-7,0.0004333861,0.8662495,0.04181823,0.00005710288,0.00009078874,0.07995892],"study_design_scores_gemma":[0.0001296767,0.00001123877,0.0845683,0.000005100658,0.00003878267,0.00001296706,0.00003326147,0.9040852,0.009784139,0.00001020784,0.00113949,0.0001816697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6089829,0.0002637152,0.38952,0.0004507218,0.00003497351,0.00007044467,0.000002416908,0.000535136,0.0001397472],"genre_scores_gemma":[0.968481,0.003136664,0.02818262,0.00006573516,0.00001412475,0.00007455703,0.00001820679,0.00001830647,0.000008751798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3613374,"threshold_uncertainty_score":0.5664462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169948709","doi":"10.1109/lcom.2007.348292","title":"Performance Analysis of Cooperative Diversity Wireless Networks over Nakagami-m Fading Channel","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":517,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Fading; Moment-generating function; Probability density function; Signal-to-noise ratio (imaging); Outage probability; Diversity combining; Computer science; Wireless; Channel (broadcasting); Maximal-ratio combining; Bit error rate; Probability of error; Algorithm; Statistics; Mathematics; Wireless network; Topology (electrical circuits); Telecommunications; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04499486000545759,"gpt":0.2818834896058828,"spread":0.2368886296004252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044019,0.0001867699,0.0003466101,0.0005584501,0.001167061,0.00007336534,0.004093491,0.0000689009,0.00001321958],"category_scores_gemma":[0.00002199586,0.0001974701,0.0001690062,0.003435542,0.0003001747,0.0005953256,0.002349103,0.0003757625,0.000005365651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000137209,"about_ca_system_score_gemma":0.00002646893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003744347,"about_ca_topic_score_gemma":0.0003136533,"domain_scores_codex":[0.9983747,0.0002753419,0.000461108,0.0002941544,0.0002633007,0.0003313704],"domain_scores_gemma":[0.9957079,0.0005756082,0.000273045,0.003057291,0.0002859386,0.0001002754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001189478,0.001317548,0.2067873,0.00005828311,0.005775764,0.00001527286,0.04464167,0.4775948,0.04029002,0.05828298,0.007243758,0.1578736],"study_design_scores_gemma":[0.0002508977,0.0000227509,0.07811908,0.00003740239,0.0001281523,0.000001263731,0.00007043206,0.9197542,0.0008198137,0.000004499465,0.0005421797,0.0002493429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4404238,0.0002749266,0.5567707,0.001202835,0.0001428637,0.0001424052,0.000003007953,0.00009002885,0.0009493103],"genre_scores_gemma":[0.9931306,0.001696057,0.003432711,0.001627353,0.00002634254,0.00001107617,0.00002718824,0.000009343209,0.00003934866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5533381,"threshold_uncertainty_score":0.8976209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3165173280","doi":"10.1109/lcomm.2021.3082214","title":"STAR-RISs: Simultaneous Transmitting and Reflecting Reconfigurable Intelligent Surfaces","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":490,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Star (game theory); Computer science; Reflection (computer programming); Transmission (telecommunications); Channel (broadcasting); Field (mathematics); Telecommunications; Electronic engineering; Physics; Engineering; Mathematics; Astrophysics","retraction":null,"screen_n_in":null,"score":{"opus":0.04116816728878759,"gpt":0.2890209109472617,"spread":0.2478527436584742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685337,0.0001715319,0.0002032175,0.00009880841,0.0003429158,0.0000806083,0.0008373676,0.00008253516,0.00001627669],"category_scores_gemma":[0.0002077,0.000204892,0.00004361158,0.00038742,0.0001947454,0.0001923915,0.0001101511,0.0005440189,0.00001670643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000101142,"about_ca_system_score_gemma":0.00001533366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002008825,"about_ca_topic_score_gemma":0.000126214,"domain_scores_codex":[0.9989796,0.0001090935,0.0003686099,0.0001955863,0.00009428658,0.0002528138],"domain_scores_gemma":[0.9966199,0.001114351,0.00006503865,0.002070937,0.00008289539,0.0000468927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000332935,0.00004308161,0.0002177113,0.00008890223,0.0001089684,0.00001149677,0.001853999,0.2706626,0.5770558,0.0005471345,0.0004649057,0.1489422],"study_design_scores_gemma":[0.0003660807,0.0000225107,0.0001169727,0.0002915888,0.000037868,0.00008031922,0.005315234,0.3246538,0.5946956,0.00101049,0.07258938,0.0008201692],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8370296,0.02436673,0.1158278,0.01472752,0.0002832265,0.0003593355,0.00002168844,0.002937953,0.004446174],"genre_scores_gemma":[0.909716,0.01102532,0.07881618,0.0002865585,0.0000097071,0.00004004572,0.00001948286,0.00004151754,0.0000452577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.148122,"threshold_uncertainty_score":0.8355253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168359139","doi":"10.1109/4234.852929","title":"On timing offset estimation for OFDM systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":469,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Estimator; Intersymbol interference; Additive white Gaussian noise; Computer science; Channel (broadcasting); Offset (computer science); Multiplexing; Carrier frequency offset; Algorithm; UTC offset; Statistics; Frequency offset; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03405987405489248,"gpt":0.2899356195008858,"spread":0.2558757454459933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441594,0.0001428857,0.000146214,0.0001223106,0.0002415116,0.00005018082,0.0009883507,0.00006052668,0.00001870675],"category_scores_gemma":[0.00002229746,0.000166508,0.00005535993,0.0001728152,0.00007831404,0.0002020999,0.00002598117,0.0002060884,0.00008537633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142386,"about_ca_system_score_gemma":0.000006030952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253514,"about_ca_topic_score_gemma":0.000003252855,"domain_scores_codex":[0.9992571,0.00006300542,0.0003010162,0.0001176348,0.00008776928,0.0001734283],"domain_scores_gemma":[0.9971601,0.0004252877,0.00004919082,0.002286806,0.00003859807,0.00004006809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008798311,0.00005532968,0.000007572259,0.00006027822,0.00003852211,1.255417e-7,0.000246475,0.8157932,0.01538248,0.01482673,0.0250981,0.1284824],"study_design_scores_gemma":[0.0002273475,0.00001925515,0.00002061067,0.0001209571,0.00001351496,0.000002307102,0.00001647723,0.9330721,0.003937282,0.00110735,0.06121564,0.0002471356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03325833,0.0006542506,0.9522703,0.00290098,0.0001905201,0.001038463,0.00007962585,0.002136339,0.007471237],"genre_scores_gemma":[0.9064325,0.00046335,0.09156494,0.0004451353,0.00002402336,0.000753847,0.0001768109,0.00005376176,0.00008560946],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8731742,"threshold_uncertainty_score":0.679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051270424","doi":"10.1109/lcomm.2011.101811.111480","title":"A Simplified Successive-Cancellation Decoder for Polar Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":457,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Block code; Algorithm; Latency (audio); Soft-decision decoder; Polar; Bit error rate; Concatenated error correction code; Linear code; Polar code; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.09236214429013771,"gpt":0.3130310112581669,"spread":0.2206688669680292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571399,0.0001413695,0.0001467079,0.0001619318,0.0003840647,0.00008803119,0.003154958,0.00006110661,0.00000529271],"category_scores_gemma":[0.00009346312,0.0001522864,0.00008646347,0.00032477,0.0001186637,0.0004861999,0.0002808084,0.0001763763,0.00002164611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008179357,"about_ca_system_score_gemma":0.00004406562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002855839,"about_ca_topic_score_gemma":0.0002757873,"domain_scores_codex":[0.998925,0.0001387526,0.0002804617,0.0002818388,0.0001234029,0.0002505835],"domain_scores_gemma":[0.9963715,0.0004960168,0.0001972191,0.002722898,0.0001550281,0.00005734796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000111441,0.001065659,0.0206975,0.000157702,0.0003463132,0.000009207194,0.03843427,0.0003896856,0.413162,0.2710165,0.1298676,0.1247421],"study_design_scores_gemma":[0.002560214,0.0005063617,0.01608674,0.000407298,0.000189491,0.00006883372,0.0004500422,0.4810406,0.3466175,0.05595727,0.09277444,0.003341226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223396,0.0001138711,0.9784964,0.005934917,0.0002647024,0.0004259134,0.000008908242,0.0006988197,0.00182251],"genre_scores_gemma":[0.630879,0.00001956329,0.3671762,0.001692589,0.00002059457,0.0001581468,0.000009050444,0.00001390205,0.00003085541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6186451,"threshold_uncertainty_score":0.6210058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157915296","doi":"10.1109/lcomm.2008.071408","title":"BER Performance of FSO Links over Strong Atmospheric Turbulence Channels with Pointing Errors","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":376,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Bit error rate; Free-space optical communication; Keying; Modulation (music); Channel (broadcasting); Computer science; Turbulence; Electronic engineering; Atmospheric turbulence; Fading distribution; Telecommunications; Optical communication; Optics; Physics; Acoustics; Engineering; Rayleigh fading","retraction":null,"screen_n_in":null,"score":{"opus":0.02095227486009887,"gpt":0.2234517765847681,"spread":0.2024995017246693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103577,0.0001893704,0.0002318515,0.00005071644,0.0002417272,0.0000165361,0.001711075,0.0001314905,0.00001516885],"category_scores_gemma":[0.00002608002,0.0001848734,0.00005347596,0.0005224502,0.0006790874,0.0003066224,0.000236081,0.0007703209,0.00002424685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007898516,"about_ca_system_score_gemma":0.00001745915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002566418,"about_ca_topic_score_gemma":0.000008210472,"domain_scores_codex":[0.9989933,0.0000442491,0.0003584688,0.0001433403,0.0001868829,0.0002737923],"domain_scores_gemma":[0.9969094,0.0001877128,0.0001111164,0.002673562,0.00007474844,0.00004340578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005263392,0.0004353292,0.06846797,0.0004030949,0.0004535894,0.00000952701,0.004818523,0.8096319,0.07708108,0.002506937,0.004479907,0.03165953],"study_design_scores_gemma":[0.0007800768,0.0001310987,0.02467848,0.0004408919,0.00004279865,0.00004821619,0.0003916893,0.9291418,0.03962581,0.00002221826,0.003839148,0.0008577998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901159,0.0007128578,0.005445836,0.0017163,0.00007648249,0.000176891,0.000003620603,0.0006126002,0.001139498],"genre_scores_gemma":[0.9355224,0.00170725,0.06247049,0.0001432066,0.00001268296,0.00006752778,0.000008393285,0.00004219614,0.00002580161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1195099,"threshold_uncertainty_score":0.7538917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146516326","doi":"10.1109/lcomm.2002.1010873","title":"Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":350,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Rayleigh fading; Fading; Algorithm; Uncorrelated; Mathematics; Computer science; Waveform; Statistics; Telecommunications; Decoding methods; Radar","retraction":null,"screen_n_in":null,"score":{"opus":0.07360447148231299,"gpt":0.2573257716440019,"spread":0.1837213001616889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084,0.0001404337,0.0001528023,0.00009774569,0.0002926255,0.00002352346,0.001227982,0.00007120238,0.000006096093],"category_scores_gemma":[0.00004000634,0.0001189477,0.00009011049,0.0002397489,0.000141261,0.0003181028,0.00008638722,0.0002475344,0.000003472257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014061,"about_ca_system_score_gemma":0.000003655006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002762071,"about_ca_topic_score_gemma":0.00004578875,"domain_scores_codex":[0.9992035,0.00004409778,0.0003939985,0.0001036136,0.00008389054,0.0001709134],"domain_scores_gemma":[0.9968753,0.0005503802,0.0001140541,0.002335581,0.00009712508,0.00002759296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002726371,0.00003747199,0.00001667563,0.00002009327,0.00006835767,3.363681e-8,0.0008895035,0.4855861,0.4886674,0.001010129,0.003637294,0.02006419],"study_design_scores_gemma":[0.000241394,0.000009086045,0.000007661206,0.00001821157,0.0000183774,0.000001139127,0.00004556236,0.9369341,0.06002674,0.0001721299,0.002395929,0.0001297462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01540563,0.001477047,0.9793055,0.002106321,0.0001481866,0.0007364656,0.000026398,0.0004837008,0.0003107405],"genre_scores_gemma":[0.9253113,0.00212867,0.0716818,0.0002158545,0.00002824582,0.0005117344,0.0000485433,0.00004500763,0.00002885539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9099057,"threshold_uncertainty_score":0.4850548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116551454","doi":"10.1109/lcomm.2006.061048","title":"A closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Relay; Outage probability; Expression (computer science); Transmission (telecommunications); Computer network; Wireless; Fading distribution; Closed-form expression; Telecommunications; Channel (broadcasting); Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05420197605574768,"gpt":0.2942957767705044,"spread":0.2400938007147567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009414,0.0001463465,0.0002076988,0.0001293302,0.0006080926,0.0001066102,0.002476683,0.00005198826,0.000001925023],"category_scores_gemma":[0.00009980911,0.0001160567,0.00008893323,0.0004497799,0.0002216542,0.0003934902,0.000750452,0.000269258,0.000001130836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008232838,"about_ca_system_score_gemma":0.00002968459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003854276,"about_ca_topic_score_gemma":0.0001706698,"domain_scores_codex":[0.9986048,0.0002655693,0.0004969179,0.0002544369,0.0001421638,0.0002360648],"domain_scores_gemma":[0.9957139,0.001386486,0.0002069505,0.002562587,0.0000944174,0.0000355962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001333226,0.001384707,0.0424407,0.0003439142,0.0001541862,0.000003271,0.03666877,0.04800397,0.3786841,0.2759453,0.012401,0.2038368],"study_design_scores_gemma":[0.002535096,0.00009472709,0.03441607,0.0007393199,0.00005022056,0.000009621011,0.0003710744,0.8857872,0.02911315,0.01515913,0.03078115,0.0009432817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2417888,0.001869109,0.7210186,0.03337959,0.0001992852,0.001235365,0.000007753214,0.0001077507,0.0003937205],"genre_scores_gemma":[0.9495674,0.0005775906,0.04890699,0.0005822397,0.00002593527,0.0002962317,0.000008471128,0.00001101304,0.00002416599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8377832,"threshold_uncertainty_score":0.4732654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765492968","doi":"10.1109/lcomm.2018.2815018","title":"Anti-Jamming Communications Using Spectrum Waterfall: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":248,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Jamming; Waterfall; Reinforcement learning; Computer science; Waterfall model; Artificial neural network; Artificial intelligence; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05123723027287137,"gpt":0.2837576061952535,"spread":0.2325203759223821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006174147,0.0002873653,0.0003062861,0.0003018466,0.001887802,0.0004301039,0.008616295,0.0001137759,0.000009376267],"category_scores_gemma":[0.00004262641,0.0003186223,0.0001258703,0.0009449204,0.0008847433,0.0007263384,0.002511141,0.000850964,0.0001278901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002526873,"about_ca_system_score_gemma":0.00005044127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003380939,"about_ca_topic_score_gemma":0.00007594621,"domain_scores_codex":[0.9973349,0.0006029509,0.0005921318,0.0004611891,0.0003692814,0.0006395524],"domain_scores_gemma":[0.9907516,0.0003157073,0.0003206635,0.00832121,0.0001565375,0.0001342477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002545812,0.001096895,0.005373973,0.0001041536,0.0006984354,0.00001583024,0.06118554,0.6836237,0.1312476,0.09250859,0.003419052,0.02070075],"study_design_scores_gemma":[0.0002600067,0.0000416673,0.0001450956,0.00005379285,0.00002630467,0.00005035749,0.0001796783,0.9890029,0.001594606,0.0001388692,0.008121301,0.0003853868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06506305,0.0003013099,0.9183953,0.01160038,0.0003700776,0.0003982148,5.54286e-7,0.0005308763,0.003340262],"genre_scores_gemma":[0.7665755,0.0002118483,0.2313991,0.001551262,0.0001418181,0.00003702117,0.00002625393,0.00003153576,0.00002568039],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7015125,"threshold_uncertainty_score":0.9999266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076469583","doi":"10.1109/lcomm.2014.2371014","title":"Optimal Model for the Controller Placement Problem in Software Defined Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Solver; Controller (irrigation); Software-defined networking; Cloud computing; Set (abstract data type); Plan (archaeology); Distributed computing; Software; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02955619038868122,"gpt":0.2541274689037797,"spread":0.2245712785150985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773721,0.000171299,0.0002030117,0.00007840757,0.0004409141,0.0001647782,0.003001657,0.00006748862,0.000001207702],"category_scores_gemma":[0.0000718868,0.0001336227,0.0001063797,0.0003146197,0.0001121551,0.0001923998,0.0003888656,0.0002897368,0.000007681811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006679612,"about_ca_system_score_gemma":0.00003314657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003212911,"about_ca_topic_score_gemma":0.00007900909,"domain_scores_codex":[0.9986639,0.0001505847,0.0003560651,0.0002845676,0.0001533709,0.0003914802],"domain_scores_gemma":[0.9954187,0.002158429,0.0001320467,0.002165688,0.00007025791,0.00005488119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000149532,0.00004869654,0.0002556047,0.000003403197,0.00002093159,1.004838e-7,0.0002840117,0.9664314,0.00002735063,0.008829968,0.01474461,0.009338948],"study_design_scores_gemma":[0.001023854,0.00002589575,0.0002148503,0.00002516259,0.00001329225,0.000001623661,0.000007347975,0.9916459,0.000003873653,0.0007070365,0.006164627,0.00016653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007315127,0.0004466783,0.9708886,0.02682897,0.0001465583,0.0007285689,0.000003132667,0.0001696196,0.00005632513],"genre_scores_gemma":[0.4893418,0.0001003184,0.5006077,0.00890421,0.00006272073,0.0008993705,0.00001123743,0.00001941357,0.00005328565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4886102,"threshold_uncertainty_score":0.5577875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206542241","doi":"10.1109/lcomm.2022.3140271","title":"NOMA Empowered Integrated Sensing and Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Noma; Computer science; Base station; Throughput; Beamforming; Single antenna interference cancellation; Power (physics); Mathematical optimization; Computer network; Wireless; Telecommunications; Telecommunications link; Channel (broadcasting); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01382482148692997,"gpt":0.2175281669731723,"spread":0.2037033454862423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001552704,0.0001046296,0.0001068925,0.0001658425,0.0006056097,0.00004502227,0.0006854916,0.00003442809,0.00002519273],"category_scores_gemma":[0.00001987894,0.0001238731,0.00002743696,0.0003706243,0.0001782849,0.00009308509,0.0002919958,0.0003979256,0.000008660938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001272553,"about_ca_system_score_gemma":0.000008783031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007165279,"about_ca_topic_score_gemma":0.00004570555,"domain_scores_codex":[0.9993493,0.0001286922,0.0001973226,0.00009411635,0.00009329092,0.0001372663],"domain_scores_gemma":[0.9984221,0.0001078794,0.00003748319,0.001379724,0.00002911168,0.00002365832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004557816,0.0002283706,0.004351773,0.0001280206,0.0004672154,0.00001878279,0.01507539,0.1739508,0.400114,0.014781,0.186147,0.2046922],"study_design_scores_gemma":[0.001051984,0.00004786685,0.001623302,0.0000525437,0.00006153016,0.0001246694,0.006398231,0.615082,0.01376845,0.001086614,0.359786,0.0009167861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9000841,0.003488953,0.07087538,0.0163193,0.0004947981,0.0005368112,0.00007240156,0.00320242,0.004925875],"genre_scores_gemma":[0.9900663,0.0003541417,0.008642829,0.0007404583,0.000005445574,0.00003765286,0.0001037281,0.00002667106,0.00002280438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4411312,"threshold_uncertainty_score":0.50514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152076414","doi":"10.1109/lcomm.2005.1496587","title":"Outage probability at arbitrary SNR with cooperative diversity","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Independent and identically distributed random variables; Computer science; Outage probability; Signal-to-noise ratio (imaging); Cooperative diversity; Diversity combining; Wireless; Wireless network; Topology (electrical circuits); Random variable; Fading; Computer network; Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05843134168805304,"gpt":0.2664886045503591,"spread":0.208057262862306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003929405,0.0002064111,0.0001996907,0.00009614492,0.001952331,0.0001442541,0.004377146,0.0000472687,0.00004450715],"category_scores_gemma":[0.00002702956,0.0001857266,0.00006979236,0.0005969591,0.0004349018,0.0008793636,0.003708247,0.0004138614,0.0001456248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003372161,"about_ca_system_score_gemma":0.00006294039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000160996,"about_ca_topic_score_gemma":0.0007737461,"domain_scores_codex":[0.9982959,0.0005122888,0.0002728556,0.0003839835,0.0002507521,0.0002842304],"domain_scores_gemma":[0.9948577,0.000302532,0.0001277682,0.004395238,0.0001930455,0.0001236872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003093981,0.00465647,0.1128934,0.00009988537,0.00108741,0.00004634794,0.08726721,0.02268573,0.05749501,0.355792,0.1420829,0.2155842],"study_design_scores_gemma":[0.005650753,0.0004890713,0.06816094,0.0003506796,0.0001414142,0.0001750638,0.0003061169,0.2532131,0.0188511,0.001062267,0.6477823,0.003817095],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.500511,0.001159416,0.2999357,0.1823653,0.0002069292,0.00116206,0.00001673337,0.0008457326,0.01379721],"genre_scores_gemma":[0.9084525,0.0003940962,0.08239065,0.008335596,0.00004273931,0.00006492113,0.00001766601,0.00001139733,0.00029046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5056994,"threshold_uncertainty_score":0.999347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3174042897","doi":"10.1109/lcomm.2021.3091807","title":"Coverage Characterization of STAR-RIS Networks: NOMA and OMA","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":211,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Resource allocation; Noma; Maximization; Convex optimization; Star (game theory); Transmission (telecommunications); Optimization problem; Constraint (computer-aided design); Regular polygon; Decoding methods; Range (aeronautics); Algorithm; Telecommunications link; Mathematics; Telecommunications; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01389661999900465,"gpt":0.2224621619787833,"spread":0.2085655419797787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006225371,0.0001113402,0.0001637221,0.00008508496,0.0001056974,0.00002296704,0.0006075429,0.00006793033,0.000008868515],"category_scores_gemma":[0.00003041438,0.0001369192,0.00003155017,0.0003331593,0.0001902223,0.0002103812,0.0002301661,0.0002274792,0.000003882108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004327402,"about_ca_system_score_gemma":0.000008874543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003895858,"about_ca_topic_score_gemma":0.00001357371,"domain_scores_codex":[0.9993542,0.00006616715,0.0002725803,0.0001084205,0.00007046439,0.0001281138],"domain_scores_gemma":[0.997583,0.0001552123,0.00007971605,0.00208943,0.00006724628,0.00002536289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002660956,0.00004557319,0.001099944,0.00003891543,0.00006087956,0.000001917482,0.0002586537,0.02405587,0.944894,0.001356224,0.0003056655,0.02787969],"study_design_scores_gemma":[0.001299691,0.00004438819,0.0564334,0.0003420412,0.00006786233,0.00005195423,0.0004963937,0.4685818,0.4081978,0.0007853367,0.06254473,0.00115461],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7280868,0.001509023,0.2661605,0.003333042,0.00009513339,0.0001187479,0.00002779748,0.0004271254,0.0002418553],"genre_scores_gemma":[0.9770163,0.009883506,0.0125491,0.0003170994,0.000009494542,0.00004381388,0.0001410009,0.00002717834,0.00001252782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5366963,"threshold_uncertainty_score":0.5583405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147861990","doi":"10.1109/lcomm.2004.839612","title":"Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Turbo code; PEG ratio; Block code; Block (permutation group theory); Construct (python library); Simple (philosophy); Mathematics; Decoding methods; Telecommunications; Combinatorics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01934133079425129,"gpt":0.2719253126176138,"spread":0.2525839818233625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318635,0.0001742232,0.0002225453,0.0002324313,0.0002677841,0.00008264431,0.003199165,0.00007967734,0.000001801929],"category_scores_gemma":[0.00009380833,0.0001835651,0.0001046924,0.000640803,0.0005976945,0.000490222,0.0004640355,0.0003093724,0.000008650662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457189,"about_ca_system_score_gemma":0.0001039761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001793861,"about_ca_topic_score_gemma":0.00003283288,"domain_scores_codex":[0.998665,0.0001689092,0.0004058431,0.0003050109,0.0002094875,0.0002457055],"domain_scores_gemma":[0.9961009,0.0001528491,0.0003605841,0.003051466,0.0002714916,0.00006273466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001495824,0.0004693885,0.002025941,0.00008577254,0.0001247535,0.000008438587,0.003394273,0.0001746256,0.8309382,0.1315212,0.001512101,0.02973044],"study_design_scores_gemma":[0.001309963,0.0002578823,0.002085607,0.0004687011,0.00006673548,0.0002623136,0.0002200055,0.01262552,0.9579555,0.02244155,0.00139682,0.0009093805],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570888,0.0003841711,0.8198659,0.02007348,0.0004515593,0.0005204047,0.000005814079,0.001012383,0.0005974773],"genre_scores_gemma":[0.5858073,0.00003567968,0.4136227,0.0004302443,0.00001837252,0.00006541564,0.000004469692,0.0000115986,0.000004252754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4287184,"threshold_uncertainty_score":0.7485569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133071357","doi":"10.1109/lcomm.2006.1576565","title":"Rateless coding over fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Fountain code; Channel state information; Transmitter; Robustness (evolution); Coding (social sciences); Forward error correction; Computer network; Channel (broadcasting); Decoding methods; Binary erasure channel; Algorithm; Theoretical computer science; Channel capacity; Telecommunications; Block code; Wireless; Concatenated error correction code; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03528169430475773,"gpt":0.2894447272929726,"spread":0.2541630329882149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632458,0.0001434963,0.0001420801,0.0002076546,0.0004104698,0.0002408884,0.003353394,0.00004975351,0.000003499796],"category_scores_gemma":[0.00002295342,0.0001604166,0.00007107216,0.0005501718,0.0001025696,0.0005222591,0.0005168981,0.0002832072,0.00004117729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236076,"about_ca_system_score_gemma":0.00002118278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003288103,"about_ca_topic_score_gemma":0.00005906543,"domain_scores_codex":[0.9988384,0.0001634833,0.0002679985,0.0002663209,0.0001795662,0.0002842438],"domain_scores_gemma":[0.9967752,0.0002884808,0.0001391294,0.002699069,0.0000603048,0.0000378505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004256498,0.000275345,0.005099367,0.00003349346,0.00004728134,0.00002645171,0.002782321,0.003824314,0.7097234,0.1447831,0.1159782,0.01742257],"study_design_scores_gemma":[0.001286685,0.00009613397,0.009716863,0.000570688,0.00005269468,0.0001836529,0.0001277079,0.5323104,0.3460633,0.01482836,0.09204841,0.002715074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1096467,0.0001190565,0.8730026,0.01142291,0.0006418226,0.0001995811,0.000001351726,0.001298273,0.003667626],"genre_scores_gemma":[0.9090421,0.00002212399,0.08899754,0.001692136,0.00008059919,0.00005549318,0.000004871734,0.00001681995,0.00008833203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7993954,"threshold_uncertainty_score":0.6541601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161495911","doi":"10.1109/lcomm.2007.060662","title":"</title> </titles> <publication_date> <year>0</year> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi>10.1109/LCOM.2007.357451</doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[</title> </titles> <publication_date> <year>0</year> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi> </doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[</title> </titles> <publication_date> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi> </doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[Asymptotic performance of collaborative spectrum sensing under correlated log-normal shadowing","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Upper and lower bounds; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02611023167110787,"gpt":0.2478318772943094,"spread":0.2217216456232015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","metaepi_narrow","metaepi_broad","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.07139081,0.0622389,0.05448491,0.04655543,0.03967984,0.06304285,0.0933397,0.03558512,0.07287544],"category_scores_gemma":[0.03209949,0.06877214,0.0337951,0.08566998,0.03601801,0.07838408,0.05233673,0.04953969,0.1201113],"about_ca_system_candidate":true,"about_ca_system_consensus":true,"about_ca_system_score_codex":0.03883043,"about_ca_system_score_gemma":0.02557895,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00126696,"about_ca_topic_score_gemma":0.0234589,"domain_scores_codex":[0.7393298,0.03384021,0.06315077,0.05258113,0.05482571,0.05627241],"domain_scores_gemma":[0.7771631,0.02602029,0.05152983,0.06830385,0.03586892,0.04111401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.01296484,0.02487384,0.003977989,0.006676331,0.02379213,0.009310788,0.009943168,0.009360798,0.2449026,0.03154562,0.6043829,0.01826895],"study_design_scores_gemma":[0.05277955,0.007194728,0.009163121,0.01411874,0.01899671,0.01674804,0.002534316,0.04295374,0.01103492,0.003038911,0.7658836,0.05555358],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.2741071,0.09946334,0.02612964,0.05932097,0.06358832,0.07615184,0.09771515,0.04519325,0.2583304],"genre_scores_gemma":[0.5501056,0.06712969,0.0291001,0.02240233,0.04320452,0.01791123,0.1042991,0.02853151,0.1373159],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2759986,"threshold_uncertainty_score":0.9943604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116690606","doi":"10.1109/lcomm.2004.835306","title":"Error Rate Performance of Coded Free-Space Optical Links Over Strong Turbulence Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Fading; Bit error rate; Turbulence; Free-space optical communication; Pairwise error probability; Coding gain; Word error rate; Code rate; Computer science; Algorithm; Probability of error; Coding (social sciences); Mathematics; Optical communication; Telecommunications; Physics; Decoding methods; Statistics; Optics; Mathematical analysis; Speech recognition; Meteorology","retraction":null,"screen_n_in":null,"score":{"opus":0.02645264710275825,"gpt":0.2539638878593999,"spread":0.2275112407566416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000218163,0.0002111195,0.0002662374,0.0001635476,0.000156385,0.000038854,0.00308693,0.0002339218,0.00001176584],"category_scores_gemma":[0.0001130962,0.0002274431,0.00007173938,0.0004086862,0.0006827806,0.0002952818,0.0004860616,0.001067164,0.00005170124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001539341,"about_ca_system_score_gemma":0.00002454971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002261245,"about_ca_topic_score_gemma":0.00001674018,"domain_scores_codex":[0.99885,0.0000584399,0.000426876,0.0001656237,0.0001786289,0.0003203648],"domain_scores_gemma":[0.9951868,0.0002943112,0.00008959656,0.004287708,0.00007315858,0.00006842628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002626946,0.0002725184,0.0004026634,0.0001808063,0.0001768443,0.000002326334,0.0008916349,0.6868552,0.2650045,0.04002021,0.00192476,0.00424228],"study_design_scores_gemma":[0.002428442,0.0001776779,0.004635711,0.0006323387,0.00007860918,0.00001319191,0.0004006227,0.4699624,0.5144464,0.001110807,0.004882426,0.001231431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9677986,0.0007626559,0.01361669,0.0153332,0.0001922122,0.000276155,0.00002296976,0.0008420171,0.001155536],"genre_scores_gemma":[0.9608164,0.001404109,0.03736904,0.0002294422,0.00001738324,0.00009057342,0.00001867492,0.00004096529,0.00001337657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2494418,"threshold_uncertainty_score":0.9274859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106022791","doi":"10.1109/lcomm.2010.05.100202","title":"Performance of PPM on terrestrial FSO links with turbulence and pointing errors","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Pulse-position modulation; Modulation (music); Keying; Turbulence; Computer science; Free-space optical communication; On-off keying; Range (aeronautics); Probability of error; Optical communication; Position (finance); Atmospheric turbulence; Electronic engineering; Algorithm; Bit error rate; Telecommunications; Quadrature amplitude modulation; Physics; Pulse (music); Pulse-amplitude modulation; Optics; Decoding methods; Acoustics; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.01447081168171092,"gpt":0.2261004577897625,"spread":0.2116296461080516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001313224,0.000124225,0.0001445072,0.0001231148,0.0001287684,0.00002403882,0.001105838,0.0001237309,0.000004318983],"category_scores_gemma":[0.00005341279,0.0001138069,0.00002242135,0.0002042983,0.0005604163,0.0001359227,0.0001465235,0.001059002,0.000009023457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001622681,"about_ca_system_score_gemma":0.000008715321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215253,"about_ca_topic_score_gemma":0.0000291845,"domain_scores_codex":[0.9993827,0.00002297686,0.0002303351,0.0001056891,0.0001075639,0.0001507144],"domain_scores_gemma":[0.9975379,0.000253501,0.0000673708,0.002081614,0.0000260063,0.00003358138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009717173,0.0002563014,0.02726705,0.0001960148,0.0001499403,0.000001997907,0.00142845,0.02120348,0.8125134,0.004970669,0.00140385,0.1305117],"study_design_scores_gemma":[0.002080035,0.0004219046,0.03997564,0.00074784,0.00007263506,0.00004071288,0.0004770794,0.6644407,0.2808675,0.000116061,0.009490728,0.001269116],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9933836,0.00008079145,0.0002341975,0.004270249,0.00009897041,0.000130934,0.000002858611,0.0003423997,0.001455935],"genre_scores_gemma":[0.9676499,0.0004407493,0.03170849,0.0001204983,0.00001473493,0.00003427857,0.000004655747,0.00002189184,0.000004802738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6432372,"threshold_uncertainty_score":0.4640911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131239166","doi":"10.1109/lcomm.2006.060570","title":"Stochastic decoding of LDPC codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Berlekamp–Welch algorithm; Algorithm; Factor graph; List decoding; Sequential decoding; Code (set theory); Throughput; Theoretical computer science; Concatenated error correction code; Error floor; Block code; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.02927228328082015,"gpt":0.2840308639770852,"spread":0.2547585806962651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901674,0.00009920775,0.0001386957,0.0001785184,0.0001705569,0.00005089707,0.002882055,0.00003371193,0.000001681585],"category_scores_gemma":[0.00004727788,0.000109059,0.00006216306,0.0004119822,0.0001546331,0.0002411938,0.0003665892,0.0001709048,0.00001344657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005782632,"about_ca_system_score_gemma":0.00002589434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003241508,"about_ca_topic_score_gemma":0.0001282658,"domain_scores_codex":[0.9990972,0.000117765,0.0002906402,0.0001709835,0.0001540002,0.0001694008],"domain_scores_gemma":[0.9967557,0.000450228,0.0001727716,0.002515784,0.00008115445,0.00002441062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006079799,0.0004375806,0.004067803,0.00004437299,0.00005448608,0.000004997129,0.001867491,0.008934187,0.7647808,0.1568555,0.03898406,0.02396261],"study_design_scores_gemma":[0.001203226,0.0002007886,0.01367919,0.0007383364,0.0001036249,0.0001514422,0.0001787322,0.6786799,0.2629587,0.032672,0.00739638,0.00203774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06137629,0.0001420964,0.9312075,0.005090683,0.0001486377,0.0001247367,0.000001916168,0.0004608367,0.001447256],"genre_scores_gemma":[0.7457871,0.000005877932,0.2537833,0.0003551316,0.00001629723,0.0000235766,0.000002552825,0.000007828023,0.00001830333],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6844108,"threshold_uncertainty_score":0.5355622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200892586","doi":"10.1109/lcomm.2021.3114594","title":"Intelligent Reflecting Surface-Aided Indoor Visible Light Communication Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visible light communication; Computer science; Transmitter; Orientation (vector space); Maximization; Communications system; Optimization problem; Iterative method; Mathematical optimization; Algorithm; Telecommunications; Mathematics; Electrical engineering; Light-emitting diode; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05005451499320319,"gpt":0.2946502120312418,"spread":0.2445956970380386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004298215,0.0002719484,0.0003436751,0.0001773359,0.000501499,0.0002746241,0.00294448,0.0001904095,0.00002331619],"category_scores_gemma":[0.0002019498,0.0003176321,0.0001125556,0.0009967105,0.0002373741,0.0003407398,0.0007613417,0.0009623024,0.0002264506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003515758,"about_ca_system_score_gemma":0.00004191763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006195203,"about_ca_topic_score_gemma":0.00007754911,"domain_scores_codex":[0.9980071,0.0004020692,0.0007325325,0.0002598187,0.000212885,0.0003856417],"domain_scores_gemma":[0.9915597,0.0007015226,0.0001349727,0.007260824,0.0002513866,0.00009161803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000725523,0.0003598782,0.002059557,0.0001701561,0.0004817956,0.0000069606,0.002013526,0.08629256,0.8088748,0.06631385,0.02011462,0.01330508],"study_design_scores_gemma":[0.0008704789,0.00003806963,0.0004879971,0.0007876113,0.0001069597,0.00006639412,0.003547705,0.2254232,0.5026216,0.001862344,0.2625356,0.001652052],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.583914,0.09812256,0.1416148,0.1092968,0.002020554,0.001889624,0.0000727327,0.01204306,0.0510258],"genre_scores_gemma":[0.938471,0.008448225,0.05232005,0.0003108956,0.00002193533,0.0001351465,0.0001058166,0.00007763987,0.0001093592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3545569,"threshold_uncertainty_score":0.9999276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166203438","doi":"10.1109/lcomm.2005.02003","title":"Accurate simple closed-form approximations to rayleigh sum distributions and densities","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Simple (philosophy); Argument (complex analysis); Range (aeronautics); Mathematics; Closed-form expression; Expression (computer science); Rayleigh distribution; Random variable; Rayleigh scattering; Applied mathematics; Probability density function; Distribution (mathematics); Approximations of π; Statistical physics; Mathematical analysis; Computer science; Statistics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0337097687263119,"gpt":0.2603652421811814,"spread":0.2266554734548695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001324673,0.0001389019,0.0001261932,0.0001378455,0.0003799968,0.00009830156,0.0003436026,0.00004280851,0.00001931655],"category_scores_gemma":[0.00002625764,0.0001537377,0.00004323156,0.0002060175,0.00007688161,0.0002675392,0.0000954075,0.0001854821,0.00009155463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053614,"about_ca_system_score_gemma":0.00001080951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001858092,"about_ca_topic_score_gemma":0.0001438997,"domain_scores_codex":[0.9992393,0.00003843049,0.000283325,0.0001257411,0.00009264548,0.0002205864],"domain_scores_gemma":[0.9988269,0.000103685,0.00003129322,0.0008665585,0.00006220146,0.0001093204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001410687,0.0001912692,0.0003760618,0.0001394233,0.00028474,0.000001778524,0.009365642,0.2415358,0.5998028,0.007054038,0.08670896,0.05452539],"study_design_scores_gemma":[0.0005717373,0.00002036824,0.001344036,0.00005791469,0.00007980711,0.0000233995,0.0004927164,0.8289202,0.04474593,0.0006032902,0.1223806,0.0007600412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3732536,0.0002026391,0.6147977,0.01037495,0.00006844011,0.0002498113,0.00009249146,0.0002939743,0.0006664178],"genre_scores_gemma":[0.9666932,0.000206519,0.03128269,0.001406838,0.00006100159,0.0001163768,0.0001772061,0.00002432296,0.00003185492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5934396,"threshold_uncertainty_score":0.626924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150494733","doi":"10.1109/lcomm.2004.825728","title":"On Construction of Rate-Compatible Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Low-density parity-check code; Mathematics; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.02667592626354847,"gpt":0.2780708074728517,"spread":0.2513948812093032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004408894,0.0001421797,0.0002077942,0.0001987681,0.0002664419,0.00006206088,0.002173986,0.00006241162,0.000002128175],"category_scores_gemma":[0.0001047741,0.0001550988,0.00008065102,0.0005067338,0.0003352665,0.000300455,0.0002913405,0.0003514077,0.00003511686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451008,"about_ca_system_score_gemma":0.00006843944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004156678,"about_ca_topic_score_gemma":0.0001431631,"domain_scores_codex":[0.9987984,0.0002425098,0.0003287923,0.0002551288,0.0001894871,0.0001856685],"domain_scores_gemma":[0.9961852,0.0003777365,0.0002404628,0.003006325,0.0001402782,0.00004992462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003452712,0.0009255164,0.005352415,0.00008036241,0.000100959,0.000008953057,0.003735368,0.00534877,0.4622182,0.5069918,0.006000445,0.009202725],"study_design_scores_gemma":[0.001001931,0.0002171091,0.00917176,0.0004919808,0.00003198911,0.00006224983,0.0001234287,0.008992659,0.9170201,0.06164758,0.0005383539,0.0007008643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5683506,0.00002168058,0.4209811,0.008937588,0.00027355,0.0001806589,0.000002623963,0.0004627035,0.0007894853],"genre_scores_gemma":[0.775834,0.00002826197,0.2228776,0.001213153,0.00001051606,0.00001904729,0.000004410802,0.000008626393,0.000004431776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4548019,"threshold_uncertainty_score":0.6324746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171470636","doi":"10.1109/lcomm.2005.1431159","title":"An efficient generalized sphere decoder for rank-deficient MIMO systems","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Colorado Boulder","keywords":"MIMO; Decoding methods; Mathematics; Metric (unit); Rank (graph theory); Factorization; Topology (electrical circuits); Algorithm; Constant (computer programming); Channel (broadcasting); Constellation; Control theory (sociology); Applied mathematics; Combinatorics; Telecommunications; Computer science; Statistics; Beamforming","retraction":null,"screen_n_in":null,"score":{"opus":0.02588018842045876,"gpt":0.2917234236327531,"spread":0.2658432352122944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002729754,0.0002262085,0.0002430198,0.0001367381,0.000325385,0.00009107385,0.001905082,0.00008933511,0.00001101292],"category_scores_gemma":[0.00001499476,0.0002525536,0.0001021139,0.0002312454,0.0001299845,0.0001879685,0.00008400028,0.0002427564,0.00002692231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000268435,"about_ca_system_score_gemma":0.00001509033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003130705,"about_ca_topic_score_gemma":0.00005370389,"domain_scores_codex":[0.9987087,0.0001390831,0.0004845238,0.0002081308,0.0001368942,0.0003226844],"domain_scores_gemma":[0.9954973,0.0002069012,0.0000951148,0.003990415,0.0001121771,0.00009813332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005029131,0.0001067711,0.00001800731,0.00002459522,0.0000295208,7.678867e-8,0.000305957,0.890974,0.08923634,0.006297807,0.004903177,0.008098668],"study_design_scores_gemma":[0.0004641518,0.00001360425,0.00002979818,0.00003948578,0.0000210009,0.000003097668,0.00007449555,0.8422235,0.01123668,0.00003807233,0.145534,0.0003221464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1126337,0.003609985,0.8779832,0.002214197,0.0002256853,0.0009882695,0.000059584,0.001626925,0.0006584669],"genre_scores_gemma":[0.7713526,0.0004198827,0.2265481,0.0005177,0.00006908871,0.000890861,0.0001054951,0.00007499128,0.00002123088],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6587189,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096999262","doi":"10.1109/lcomm.2004.825725","title":"Reduced ICI in OFDM Systems Using the “Better Than” Raised-Cosine Pulse","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Raised-cosine filter; Pulse shaping; Carrier frequency offset; Frequency offset; Offset (computer science); Pulse (music); Interference (communication); Discrete cosine transform; Computer science; Telecommunications; Multiplexing; Electronic engineering; Power (physics); Bandwidth (computing); Physics; Engineering; Channel (broadcasting); Low-pass filter","retraction":null,"screen_n_in":null,"score":{"opus":0.04476392765290198,"gpt":0.2773448304333038,"spread":0.2325809027804018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002387225,0.0001766964,0.0001750362,0.0001978368,0.0002077235,0.00008510524,0.001073923,0.00007059809,0.00001215743],"category_scores_gemma":[0.00002292724,0.0001619099,0.0000660903,0.0005182271,0.0001904308,0.0002258494,0.00007798591,0.0004787902,0.00004675432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004036433,"about_ca_system_score_gemma":0.0000253427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003401635,"about_ca_topic_score_gemma":0.00003773112,"domain_scores_codex":[0.9988843,0.0001303919,0.0003902145,0.0001469711,0.0001619025,0.0002861702],"domain_scores_gemma":[0.9976781,0.0001052467,0.00006556482,0.002070344,0.00003389828,0.00004682053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003219181,0.00004152403,0.0002450736,0.00002557621,0.0000456961,0.000003338356,0.0009537007,0.5463591,0.4489842,0.0002127363,0.00294637,0.0001794202],"study_design_scores_gemma":[0.0111246,0.00009647494,0.02748491,0.004088367,0.0004083837,0.001359063,0.005924034,0.5815362,0.2122676,0.001192416,0.1489247,0.005593195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9755964,0.0008448947,0.004653065,0.01563777,0.0009644848,0.0004174089,0.000009540121,0.0002351615,0.00164127],"genre_scores_gemma":[0.9962869,0.00009422699,0.002573801,0.0006799222,0.0001581403,0.0001225786,0.0000179971,0.00004881469,0.00001757236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2367166,"threshold_uncertainty_score":0.6602492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131499054","doi":"10.1109/4234.824751","title":"Comparison of four SNR estimators for QPSK modulations","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences; Queen's University","funders":"","keywords":"Phase-shift keying; Estimator; Signal-to-noise ratio (imaging); Keying; Statistics; Computer science; Algorithm; Mathematics; Bit error rate; Telecommunications; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.0643241708514943,"gpt":0.3480600403440812,"spread":0.2837358694925869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104775,0.0001406041,0.000239312,0.0001336163,0.0001925797,0.00001658676,0.001224721,0.0000627984,0.00003722522],"category_scores_gemma":[0.0000221494,0.0001705396,0.00009172634,0.000269912,0.0001790477,0.0001927392,0.00004518583,0.0002006442,0.00002048919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007180576,"about_ca_system_score_gemma":0.000009474493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001148952,"about_ca_topic_score_gemma":0.00001770428,"domain_scores_codex":[0.9990996,0.00005259781,0.0004704441,0.0001060601,0.0001005779,0.0001706808],"domain_scores_gemma":[0.9969969,0.0003689904,0.00008200391,0.002438378,0.00006914036,0.00004461541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001225252,0.0002114689,0.002303679,0.0001001062,0.0001173654,1.306119e-7,0.001167139,0.7553586,0.09688994,0.00455853,0.02061757,0.1186632],"study_design_scores_gemma":[0.0004096713,0.00002948484,0.001894061,0.00009697548,0.00004639908,0.000002934101,0.00007009067,0.8767727,0.04651061,0.001385473,0.07235571,0.000425862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088396,0.0008306357,0.7808556,0.003387767,0.0001056657,0.0008656093,0.00008342609,0.001361022,0.003670728],"genre_scores_gemma":[0.7634566,0.0002590724,0.2357682,0.0001101472,0.00001172222,0.0002692004,0.00005758923,0.00003797541,0.00002950799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.554617,"threshold_uncertainty_score":0.6954403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136379375","doi":"10.1109/lcomm.2006.1638618","title":"Impact of receive diversity on the performance of amplify-and-forward relaying under APS and IPS power constraints","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Terminal (telecommunication); Power (physics); Diversity gain; Mode (computer interface); Diversity combining; Scaling; Telecommunications; Topology (electrical circuits); Mathematics; Fading; Physics; Decoding methods; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04540599425230116,"gpt":0.2777678915224783,"spread":0.2323618972701772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021995,0.0001021079,0.0001427047,0.0000866572,0.0005886517,0.00003694147,0.001329573,0.00003365102,0.000008729843],"category_scores_gemma":[0.00002372493,0.0000782541,0.00005173367,0.0002690684,0.0006949754,0.0001953478,0.0009721632,0.0002475908,0.000002538331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004626354,"about_ca_system_score_gemma":0.00002591665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006008074,"about_ca_topic_score_gemma":0.00001929789,"domain_scores_codex":[0.9991314,0.0002601256,0.0002234906,0.0001359345,0.0001278389,0.0001212438],"domain_scores_gemma":[0.9974487,0.0007023183,0.0001760155,0.00154418,0.00009813557,0.00003068326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009015024,0.0007190445,0.3764029,0.00005281198,0.0005260051,0.000001492364,0.0156332,0.007164476,0.1070825,0.4376961,0.01158097,0.04305033],"study_design_scores_gemma":[0.0009304851,0.0002712779,0.9649056,0.0002670783,0.00003873056,0.000021106,0.0003255506,0.02913731,0.002296739,0.0007324222,0.0006319954,0.0004417022],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848417,0.0002488771,0.006928055,0.006376903,0.00003132256,0.0001481243,0.000005935351,0.0000240208,0.001395076],"genre_scores_gemma":[0.9961494,0.0007426364,0.002482252,0.0005971981,0.000004504388,0.000005627981,0.000003135502,0.000004298764,0.00001095663],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5885027,"threshold_uncertainty_score":0.4527493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139699600","doi":"10.1109/lcomm.2004.837657","title":"Highly Accurate Simple Closed-Form Approximations to Lognormal Sum Distributions and Densities","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Log-normal distribution; Mathematics; Random variable; Applied mathematics; Simple (philosophy); Probability distribution; Closed-form expression; Distribution (mathematics); Statistical physics; Statistics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0315488462967829,"gpt":0.25211255857736,"spread":0.2205637122805771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001184532,0.000145565,0.0001289338,0.0001444443,0.0004122173,0.00009955263,0.0003487343,0.00004734826,0.000006305999],"category_scores_gemma":[0.00002550299,0.0001612177,0.00004436831,0.0002328113,0.00009644319,0.0002710092,0.0001050346,0.0002001599,0.00004789062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001290449,"about_ca_system_score_gemma":0.00001915292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000059722,"about_ca_topic_score_gemma":0.0001694573,"domain_scores_codex":[0.9992245,0.000029099,0.0002816971,0.0001280991,0.00009733064,0.0002393074],"domain_scores_gemma":[0.9989115,0.00006969162,0.00003261495,0.0008054439,0.0000662537,0.0001144999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001334202,0.0001654586,0.0002999346,0.0001407564,0.0002260087,0.000004624662,0.007126002,0.4944165,0.4612886,0.01536871,0.01113309,0.009816976],"study_design_scores_gemma":[0.004444635,0.0001847972,0.008780435,0.0004052259,0.0004124565,0.0001842455,0.002884376,0.600427,0.2869228,0.013843,0.0777142,0.003796818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4055696,0.0001025051,0.5873657,0.006071495,0.0000799008,0.0001977754,0.00008416414,0.0002345383,0.0002942715],"genre_scores_gemma":[0.9755145,0.0001537304,0.02283815,0.001090421,0.00003565701,0.0001092886,0.0002240638,0.00002388958,0.000010336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5699448,"threshold_uncertainty_score":0.6574269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163291063","doi":"10.1109/lcomm.2007.070065","title":"Performance Analysis of Decode-and-Forward Relaying with Selection Combining","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Selection (genetic algorithm); Relay; Outage probability; Diversity combining; Maximal-ratio combining; Signal-to-noise ratio (imaging); Expression (computer science); Antenna diversity; Cooperative diversity; Performance improvement; Algorithm; Telecommunications; Decoding methods; Fading; Wireless; Artificial intelligence; Power (physics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03319653540750594,"gpt":0.2830231413289397,"spread":0.2498266059214337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348817,0.0001085164,0.0002032715,0.0004962832,0.0004795829,0.00005871711,0.001348995,0.00003244444,0.000003298529],"category_scores_gemma":[0.00001920858,0.0001033585,0.00005289288,0.002427343,0.0001655866,0.0003959137,0.0003151216,0.0002383755,0.000002513774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000577781,"about_ca_system_score_gemma":0.00002440556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001561907,"about_ca_topic_score_gemma":0.0002537679,"domain_scores_codex":[0.9990073,0.0001336234,0.0003263516,0.0001880733,0.0001605275,0.0001840727],"domain_scores_gemma":[0.9975939,0.0004080434,0.0001959913,0.001586395,0.0001579444,0.00005767326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007026634,0.0003382362,0.5320838,0.00004293487,0.00215143,0.000002248537,0.01242444,0.02803727,0.08789971,0.0511343,0.0006529235,0.2851624],"study_design_scores_gemma":[0.0004285421,0.00008412274,0.1838335,0.0000792342,0.0002458751,0.00001254769,0.0001092487,0.8092628,0.003616536,0.00001283541,0.002008289,0.0003065084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5339061,0.0001779563,0.4628903,0.001815219,0.00002743019,0.00008121746,3.840167e-7,0.00007454943,0.001026842],"genre_scores_gemma":[0.9193729,0.0007408258,0.07916945,0.0006709873,0.000005804538,0.00001108455,0.000006209202,0.000006803949,0.00001591144],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7812255,"threshold_uncertainty_score":0.4214836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750544224","doi":"10.1109/lcomm.2017.2740305","title":"Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Berlekamp–Welch algorithm; Algorithm; Polar; Latency (audio); Arithmetic; Concatenated error correction code; Telecommunications; Block code; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0542195442835175,"gpt":0.3318252000715529,"spread":0.2776056557880354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144752,0.0001129255,0.0001949647,0.0001933179,0.0005365907,0.0002012352,0.00299754,0.00005119974,0.000001427733],"category_scores_gemma":[0.0002691293,0.0001289236,0.0000521761,0.000159837,0.0002617481,0.0009127675,0.0005148686,0.0001511636,0.000002102439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005233262,"about_ca_system_score_gemma":0.00005110519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008150893,"about_ca_topic_score_gemma":0.0002702028,"domain_scores_codex":[0.9989088,0.0001086194,0.0004378594,0.0002320523,0.0001748228,0.000137885],"domain_scores_gemma":[0.995321,0.0003414627,0.0009433668,0.003192792,0.0001532094,0.00004821967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005979035,0.00005711585,0.05661721,0.00006736277,0.00003915851,5.335526e-7,0.004086836,0.0001879994,0.8462846,0.008321307,0.001046162,0.08328568],"study_design_scores_gemma":[0.0007661801,0.00006150219,0.1149456,0.000868523,0.00007628842,0.00001792577,0.0003291309,0.2474891,0.6301877,0.0038888,0.0006701212,0.0006991779],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985078,0.0002313392,0.695285,0.005141917,0.0001702193,0.0001587668,0.00000442752,0.0001042652,0.0003962304],"genre_scores_gemma":[0.8514653,0.0001832185,0.1482001,0.00008328118,0.00001717737,0.000008769618,0.000003623154,0.000009237982,0.00002930271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5529575,"threshold_uncertainty_score":0.5570225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890391580","doi":"10.1109/lcomm.2018.2871442","title":"Deep-Learning-Based Channel Estimation for Wireless Energy Transfer","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel state information; Channel (broadcasting); Transmitter; Autoencoder; Energy (signal processing); Deep learning; Wireless; Mean squared error; Scheme (mathematics); Artificial intelligence; Algorithm; Telecommunications; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01763809022054219,"gpt":0.234619636200592,"spread":0.2169815459800498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000158884,0.0001826767,0.0001593855,0.0001256286,0.0003512326,0.00005405073,0.0007289193,0.0001064245,0.0000075738],"category_scores_gemma":[0.00002502491,0.000216579,0.00007882133,0.0002605375,0.0002297811,0.0001323971,0.00002181362,0.0002172424,0.00001546133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008663264,"about_ca_system_score_gemma":0.00001234719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002946346,"about_ca_topic_score_gemma":0.0002038542,"domain_scores_codex":[0.9990767,0.00008929662,0.0002647958,0.000165053,0.0001084654,0.0002956654],"domain_scores_gemma":[0.9983739,0.0004142518,0.00003100474,0.001020394,0.0000936572,0.00006684927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006397861,0.00002317804,0.00001588514,0.00002603228,0.00003473826,2.528171e-7,0.0001903587,0.9788693,0.007582872,0.0008980565,0.001899352,0.01045356],"study_design_scores_gemma":[0.0003289698,0.00003123968,0.00005577096,0.00006670982,0.00002434436,0.000001504307,0.000009546431,0.9785576,0.009944928,0.00005375507,0.01068955,0.000236121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02084919,0.000160093,0.9758362,0.001459366,0.0003931854,0.0001277076,0.000004185555,0.0007243713,0.0004457776],"genre_scores_gemma":[0.978686,0.00006490255,0.01948724,0.0009431161,0.000215811,0.0003454944,0.0001388157,0.00008727657,0.00003130916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9578369,"threshold_uncertainty_score":0.8831836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072100797","doi":"10.1109/lcomm.2013.021213.121633","title":"Increasing the Throughput of Polar Decoders","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Throughput; Decoding methods; Computer science; Algorithm; Polar; Sequential decoding; Error detection and correction; Telecommunications; Wireless; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.03240705621641109,"gpt":0.2830047920305757,"spread":0.2505977358141646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276391,0.0001006296,0.0001150128,0.00009022461,0.0003025023,0.0001066413,0.004763519,0.00003498587,0.000005343904],"category_scores_gemma":[0.0001224241,0.00008021966,0.00007026523,0.0004302812,0.0002726009,0.0005165646,0.0006167039,0.0002596235,0.00004863954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004836024,"about_ca_system_score_gemma":0.00003117192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230308,"about_ca_topic_score_gemma":0.0000786061,"domain_scores_codex":[0.9988329,0.0003997929,0.000262612,0.0001570669,0.0001668769,0.0001807634],"domain_scores_gemma":[0.9949432,0.0008108054,0.000173796,0.003928918,0.0001114543,0.00003180355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005483642,0.0003375402,0.03041721,0.00004025685,0.0001707755,0.000002029563,0.01593684,0.0003274723,0.7090913,0.04912522,0.1069217,0.08762419],"study_design_scores_gemma":[0.00187179,0.0003955623,0.1362838,0.0009468641,0.0001809826,0.0007015371,0.003043295,0.4754778,0.2312523,0.05692336,0.08908021,0.003842446],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3306759,0.0003207686,0.5845153,0.08044262,0.0002403458,0.0004411426,0.000001259572,0.0005412106,0.002821475],"genre_scores_gemma":[0.7550795,0.00003803184,0.2417114,0.003094342,0.00001155825,0.00004752975,9.932187e-7,0.00000844613,0.000008212854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.477839,"threshold_uncertainty_score":0.8851883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985009561","doi":"10.1109/4234.864189","title":"Impact of the beat noise on the performance of 2-D optical CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Beat (acoustics); Computer science; Spread spectrum; Noise (video); Telecommunications; Noise measurement; Bit error rate; Speech recognition; Code division multiple access; Acoustics; Electronic engineering; Algorithm; Physics; Noise reduction; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01527324171479927,"gpt":0.2243418110542265,"spread":0.2090685693394272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000220189,0.00009300962,0.000129359,0.00003465721,0.0001188038,0.0000123207,0.001080607,0.0000345653,0.00002502391],"category_scores_gemma":[0.000006839497,0.00005321089,0.000132667,0.0002191906,0.0002234933,0.00004901388,0.00002400527,0.0001958004,0.00002543028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003447524,"about_ca_system_score_gemma":0.000007473148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003981568,"about_ca_topic_score_gemma":0.000001753247,"domain_scores_codex":[0.9993398,0.0001457949,0.0002415792,0.00005258986,0.0001039863,0.0001162492],"domain_scores_gemma":[0.9977553,0.0002351202,0.00004416665,0.00192318,0.00002079351,0.00002137268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000419259,0.0001877842,0.01449913,0.0001835267,0.0004125493,2.470904e-7,0.002118607,0.6540667,0.3026365,0.01674641,0.00643403,0.002672566],"study_design_scores_gemma":[0.002280154,0.0006782127,0.2600969,0.003315295,0.0004035456,0.00009035996,0.0008724565,0.5958143,0.115314,0.0002745045,0.01918738,0.001672859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9938605,0.0001965979,0.00002820022,0.0005124524,0.0001243892,0.0002049654,0.0000162885,0.0000336851,0.005022874],"genre_scores_gemma":[0.9997241,0.00009082881,0.00002038281,0.00005670359,0.00001890661,0.00003629737,0.000001969872,0.00001344392,0.00003738028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2455977,"threshold_uncertainty_score":0.2169877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107283447","doi":"10.1109/lcomm.2005.11014","title":"Distance-based-decoding of block turbo codes","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Algorithm; Decoding methods; Sequence (biology); Computational complexity theory; Computation; Computer science; Mathematics; Multiplexing; Mathematical optimization; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02422769666727629,"gpt":0.2555217081489631,"spread":0.2312940114816869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009257376,0.0001000843,0.0001247283,0.0001081524,0.0000906253,0.00001634323,0.0006575882,0.00003507753,0.00002303197],"category_scores_gemma":[0.00001503613,0.0001165248,0.00006024265,0.0001970473,0.0001629395,0.0001105083,0.00002938684,0.0001785906,0.00004097413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152575,"about_ca_system_score_gemma":0.00001008975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008336845,"about_ca_topic_score_gemma":0.00002612982,"domain_scores_codex":[0.999377,0.00003756666,0.0002581497,0.00008079982,0.0001032894,0.0001432548],"domain_scores_gemma":[0.9984635,0.0001345946,0.00005054293,0.001280773,0.00003154754,0.00003906567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005211985,0.0000963704,0.001369309,0.00007287675,0.00009260734,5.473566e-7,0.0005820012,0.5500737,0.3891013,0.0007506682,0.04777648,0.01007894],"study_design_scores_gemma":[0.0006444433,0.00001505499,0.001216251,0.0002039289,0.00006576415,0.00001337229,0.000136687,0.2739728,0.3357605,0.00006318352,0.3872819,0.000626168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9169486,0.002633636,0.03833219,0.02433765,0.0008322826,0.000354929,0.00005818941,0.001021243,0.01548134],"genre_scores_gemma":[0.9747672,0.000132216,0.02458115,0.0003438991,0.00007540917,0.00003482548,0.000009944042,0.00002448274,0.00003089162],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3395054,"threshold_uncertainty_score":0.4751743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118387281","doi":"10.1109/4234.957373","title":"Average level crossing rate and average fade duration of selection diversity","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Fade; Fading; Level crossing; Rayleigh fading; Envelope (radar); Diversity combining; Nakagami distribution; Selection (genetic algorithm); Telecommunications; Mathematics; Statistics; Fading distribution; Diversity gain; Computer science; Diversity scheme; Diversity (politics); Algorithm; Channel (broadcasting); Engineering; Radar; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04312279255857666,"gpt":0.2687448413554378,"spread":0.2256220487968612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002028244,0.0001283825,0.0001468616,0.0001522798,0.0006664711,0.00005432435,0.0005637299,0.00006395904,0.000009799302],"category_scores_gemma":[0.00002633605,0.0001588222,0.00003763414,0.0003019845,0.0002455564,0.0004592082,0.0002712383,0.0002691307,0.00000452265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001190273,"about_ca_system_score_gemma":0.000009314354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008463193,"about_ca_topic_score_gemma":0.00008040359,"domain_scores_codex":[0.9992359,0.0001228954,0.0002904379,0.0001148496,0.000093678,0.0001422573],"domain_scores_gemma":[0.9986354,0.0001582869,0.0001065383,0.0009914712,0.00007042784,0.00003795387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001494846,0.00005912389,0.006768729,0.00005012072,0.00005935802,0.000001205787,0.002127785,0.05652224,0.9179571,0.0008633602,0.0008160694,0.01475998],"study_design_scores_gemma":[0.001474488,0.00006175938,0.1087411,0.0002822272,0.00007004503,0.00007298995,0.0002254896,0.4213897,0.4475153,0.001525243,0.01742359,0.001218094],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5124221,0.0002024614,0.4854362,0.0007694284,0.0000445264,0.0001633806,0.00001110506,0.0003843594,0.0005664967],"genre_scores_gemma":[0.9736271,0.001690367,0.02437076,0.0001941882,0.00001345828,0.00002281747,0.00002621532,0.00002258619,0.00003250956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4704418,"threshold_uncertainty_score":0.647658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993479987","doi":"10.1109/lcomm.2013.100713.131727","title":"Blind Synchronization in Diffusion-Based Molecular Communication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Calgary","funders":"","keywords":"Molecular communication; Synchronization (alternating current); Computer science; Channel (broadcasting); Overhead (engineering); Algorithm; Upper and lower bounds; Communications system; Throughput; Diffusion; Computer network; Telecommunications; Transmitter; Mathematics; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01226211930837026,"gpt":0.222581318205993,"spread":0.2103191988976228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002254225,0.000208622,0.0001938021,0.0003340202,0.0001798646,0.0001206278,0.001712637,0.0001289754,0.0001048325],"category_scores_gemma":[0.00003030149,0.0002459156,0.00007528017,0.0007549032,0.0001564714,0.0002389255,0.0001567115,0.000470105,0.0002149302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001760142,"about_ca_system_score_gemma":0.00002280585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001416345,"about_ca_topic_score_gemma":0.00008017485,"domain_scores_codex":[0.998575,0.0003418669,0.000458624,0.0001641945,0.000176175,0.0002840818],"domain_scores_gemma":[0.9959204,0.0002119441,0.00007925653,0.003610886,0.00009041653,0.00008709617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001170087,0.0004211908,0.001943205,0.00007876881,0.00008539735,0.000003756469,0.0009076527,0.7413969,0.2130929,0.001832051,0.01375263,0.02647383],"study_design_scores_gemma":[0.0009767667,0.00000910086,0.0012051,0.0001306151,0.0000141412,0.000002305977,0.00004488154,0.9886706,0.003226174,0.0002073332,0.005136492,0.0003764763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5896913,0.005744058,0.3700041,0.02423128,0.0003935709,0.002045362,0.000007421395,0.0009778419,0.006904997],"genre_scores_gemma":[0.9844438,0.0007920333,0.01194826,0.001954994,0.00001474604,0.0005369713,0.0002329956,0.0000601165,0.00001608391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3947525,"threshold_uncertainty_score":0.9999993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2244101296","doi":"10.1109/lcomm.2015.2496940","title":"A Hybrid WiFi/Magnetic Matching/PDR Approach for Indoor Navigation With Smartphone Sensors","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Dead reckoning; Real-time computing; Pedestrian; Matching (statistics); Mobile device; Computer vision; Dependency (UML); Embedded system; Artificial intelligence; Simulation; Global Positioning System; Telecommunications; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02653959777492149,"gpt":0.2326477760405807,"spread":0.2061081782656592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001841057,0.000181758,0.0001762884,0.0001904942,0.0001622385,0.0000673982,0.0006587272,0.00006959926,0.000002037409],"category_scores_gemma":[0.00002527452,0.0001737367,0.00004694414,0.0003341388,0.0002413312,0.0001875108,0.00004977506,0.0002408467,0.00001868482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123777,"about_ca_system_score_gemma":0.00002127601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000028861,"about_ca_topic_score_gemma":0.000006881626,"domain_scores_codex":[0.9991457,0.0000441573,0.0002482867,0.0001615316,0.0001573469,0.0002430207],"domain_scores_gemma":[0.9984862,0.00008120707,0.00005768249,0.00119851,0.0001075774,0.00006886385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001348166,0.0003572372,0.003965809,0.000475283,0.000335548,0.00001013639,0.008135558,0.8423743,0.0418322,0.005571828,0.08330292,0.01350441],"study_design_scores_gemma":[0.007018073,0.0004430886,0.001668658,0.0003038878,0.0003132445,0.0002078814,0.00451997,0.8472834,0.08464307,0.002581771,0.04851817,0.002498764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5819084,0.0002464623,0.4134147,0.001017422,0.0001468465,0.0006114477,0.00003934762,0.001082849,0.001532545],"genre_scores_gemma":[0.9328018,0.00002810593,0.06609762,0.0002442026,0.00003745517,0.0003625345,0.0003015967,0.00005633419,0.00007028812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3508934,"threshold_uncertainty_score":0.7084777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2728954613","doi":"10.1109/lcomm.2017.2720583","title":"Closed-Form BER Expressions of QPSK Constellation for Uplink Non-Orthogonal Multiple Access","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Noma; Telecommunications link; Bit error rate; Phase-shift keying; Computer science; Constellation; Additive white Gaussian noise; Expression (computer science); Channel capacity; Channel (broadcasting); Closed-form expression; Algorithm; Mathematics; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06396600704195661,"gpt":0.3334174410482522,"spread":0.2694514340062956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001467256,0.000177571,0.0002473082,0.0001620928,0.0009203408,0.00008984173,0.003890227,0.0001276196,0.00001019171],"category_scores_gemma":[0.0001572647,0.0001933251,0.0001129762,0.0001065837,0.0005911278,0.0006389748,0.0006031769,0.0003069591,0.000008941993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006416714,"about_ca_system_score_gemma":0.0000192631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001452741,"about_ca_topic_score_gemma":0.00003555755,"domain_scores_codex":[0.9990398,0.00002293073,0.0004447435,0.0001583603,0.0001126253,0.0002214895],"domain_scores_gemma":[0.9935074,0.0006417371,0.000310019,0.005375743,0.0001212805,0.00004383286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004169357,0.0002176668,0.02209179,0.0002599652,0.0002674386,6.337071e-7,0.0007753986,0.143755,0.6921113,0.005978367,0.01142411,0.1230767],"study_design_scores_gemma":[0.002826042,0.00004286062,0.03989569,0.0004980664,0.00008741784,0.000004990411,0.0002670914,0.5306088,0.3734727,0.005109089,0.0460345,0.001152835],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.35886,0.0004461081,0.6259348,0.008384938,0.0004200258,0.001236056,0.0001658387,0.0007956184,0.003756551],"genre_scores_gemma":[0.9323052,0.0006672578,0.06654592,0.00009268055,0.00002184048,0.0002185284,0.00008883005,0.00004220969,0.00001753414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5734452,"threshold_uncertainty_score":0.7883568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404479890","doi":"10.1109/lcomm.2024.3501956","title":"Dynamic Offloading in Mobile Edge Computing With Traffic-Aware Network Slicing and Adaptive TD3 Strategy","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Science and Engineering Research Council","keywords":"Computer science; Mobile edge computing; Computer network; Slicing; Enhanced Data Rates for GSM Evolution; Distributed computing; Server; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02155304477782811,"gpt":0.2675211696061849,"spread":0.2459681248283568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004732264,0.0002081597,0.0002209439,0.0002280946,0.0004445805,0.000440753,0.001289358,0.00005645618,4.192246e-7],"category_scores_gemma":[0.000004329224,0.0002027634,0.00004433688,0.00101656,0.0001490794,0.0004603689,0.0004475476,0.0005662562,0.00001177548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001508481,"about_ca_system_score_gemma":0.00007836373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005424363,"about_ca_topic_score_gemma":0.00009755487,"domain_scores_codex":[0.9984618,0.0001883308,0.0003236863,0.0004310768,0.0001452566,0.0004498134],"domain_scores_gemma":[0.9981724,0.0005770501,0.00007664604,0.001065226,0.00003793,0.00007074184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000131837,0.0001059043,0.001197778,0.0001340988,0.0001387898,0.0001101864,0.01671181,0.5764325,0.001864267,0.002546822,0.005580314,0.3951643],"study_design_scores_gemma":[0.0001659852,0.00005787401,0.001050353,0.0005666963,0.00001038668,0.00004800969,0.000191232,0.9962935,0.00001687357,0.00006314024,0.001276332,0.0002596093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6081724,0.002974592,0.3839735,0.002246418,0.001426546,0.0003578676,5.776971e-7,0.0004776581,0.0003704684],"genre_scores_gemma":[0.9649523,0.00006748385,0.0342625,0.0004359838,0.000216947,0.00002180961,0.000006009423,0.00002464755,0.00001225369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.419861,"threshold_uncertainty_score":0.826845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896806510","doi":"10.1109/lcomm.2018.2876869","title":"Outage Performance of UAV-Assisted Relaying Systems With RF Energy Harvesting","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Department of Education of Guangdong Province; Southeast University; National Natural Science Foundation of China","keywords":"Rician fading; Computer science; Fading; Energy harvesting; Rayleigh fading; Outage probability; Monte Carlo method; Weibull fading; Energy (signal processing); Channel (broadcasting); Shadow mapping; Wireless; Communications system; Electronic engineering; Telecommunications; Statistics; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01926496840409326,"gpt":0.2101015709879745,"spread":0.1908366025838812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001054695,0.0001057145,0.0001240309,0.0001079909,0.0002205935,0.00003892747,0.0004757161,0.00004121046,0.000003956],"category_scores_gemma":[0.000005641594,0.0001040868,0.00002105763,0.0003940857,0.0001715462,0.0001913407,0.00003766937,0.0001031531,0.00001129583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005649461,"about_ca_system_score_gemma":0.00001162249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001484069,"about_ca_topic_score_gemma":0.00006259463,"domain_scores_codex":[0.9993612,0.00002963846,0.0002684215,0.0001015588,0.00009875702,0.0001404203],"domain_scores_gemma":[0.9985141,0.00006865546,0.0000948743,0.001182532,0.0001057223,0.0000341089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002284207,0.0001214932,0.01058151,0.0002663667,0.0002284462,9.356426e-7,0.001724558,0.7054088,0.2599738,0.002791467,0.003598687,0.0152811],"study_design_scores_gemma":[0.0002954094,0.00005051327,0.004425958,0.0002266941,0.00004335655,0.00001716938,0.0001400056,0.9741129,0.006630945,0.000001826234,0.01377667,0.0002785092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8125767,0.0002872263,0.1779043,0.0004082995,0.0001614592,0.0001874838,0.00001036213,0.0003577873,0.008106437],"genre_scores_gemma":[0.9787042,0.0001248952,0.02079912,0.0000901046,0.0000478406,0.00008998143,0.00003057798,0.00003235209,0.00008097199],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2687041,"threshold_uncertainty_score":0.4244534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142456386","doi":"10.1109/lcomm.2006.1576558","title":"Power delay profile and noise variance estimation for OFDM","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Cyclic prefix; Estimator; Orthogonal frequency-division multiplexing; Algorithm; Minimum mean square error; Computer science; Channel (broadcasting); Mathematics; Noise (video); Mean squared error; Heuristic; Noise power; Variance (accounting); Statistics; Power (physics); Telecommunications; Mathematical optimization; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01148120537839955,"gpt":0.2559305854097148,"spread":0.2444493800313152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001173993,0.0001281134,0.0001224542,0.00009319335,0.0001995083,0.00004062442,0.0005982351,0.00005615482,0.000005646871],"category_scores_gemma":[0.00001973501,0.0001508487,0.00003367908,0.0001522683,0.0001312489,0.0002756032,0.00007021516,0.000156584,0.00001076044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007481062,"about_ca_system_score_gemma":0.000007047218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000164359,"about_ca_topic_score_gemma":0.00001330975,"domain_scores_codex":[0.999365,0.00003806703,0.0002562591,0.000117104,0.00006712613,0.0001563932],"domain_scores_gemma":[0.9980693,0.000228656,0.00006211599,0.001554629,0.0000570475,0.00002822528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002362534,0.0002369149,0.0005582874,0.0002102646,0.0000955067,0.000001142594,0.0007043665,0.1558974,0.6523656,0.06018049,0.08971287,0.0400136],"study_design_scores_gemma":[0.0008373029,0.00003876935,0.003346005,0.0001376238,0.00004025482,0.00001955747,0.00004105275,0.8369067,0.05975241,0.006866205,0.0911978,0.0008163644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02426329,0.0008023041,0.9676271,0.0032014,0.00006857021,0.0006039735,0.00003966555,0.0008755275,0.002518137],"genre_scores_gemma":[0.6515343,0.0001394869,0.3474936,0.000208713,0.00001171892,0.0004751451,0.00007397342,0.0000307411,0.00003227036],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6810093,"threshold_uncertainty_score":0.6151432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046842299","doi":"10.1109/lcomm.2012.082012.121066","title":"All-Optical Amplify-and-Forward Relaying System for Atmospheric Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; Ciena (Canada)","funders":"","keywords":"Relay; Computer science; Channel state information; Channel (broadcasting); Transmission (telecommunications); Signal-to-noise ratio (imaging); Free-space optical communication; Noise (video); Amplifier; Topology (electrical circuits); Electronic engineering; Outage probability; Telecommunications; Optical communication; Physics; Wireless; Fading; Electrical engineering; Bandwidth (computing); Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03665492067292079,"gpt":0.2646080133560589,"spread":0.2279530926831381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217527,0.0001976211,0.0002433567,0.00004167715,0.0002537847,0.00007067326,0.001206382,0.0001614671,0.000002650515],"category_scores_gemma":[0.00008320947,0.0002087718,0.00007339112,0.000211455,0.0002616963,0.0002867369,0.0002834563,0.0004108893,0.00007010263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001844565,"about_ca_system_score_gemma":0.000005285468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006996232,"about_ca_topic_score_gemma":0.000001650757,"domain_scores_codex":[0.9988856,0.00005588977,0.0003560398,0.0001331965,0.0001121041,0.0004571994],"domain_scores_gemma":[0.996849,0.0007067452,0.00005414616,0.002225254,0.00004018507,0.0001246721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000576012,0.0005994067,0.005494637,0.001709701,0.001613481,0.000002446731,0.005210432,0.02322122,0.2329419,0.545303,0.04028323,0.1435629],"study_design_scores_gemma":[0.002420264,0.0001126594,0.002958051,0.0005473778,0.0004409252,0.0001295808,0.004618345,0.5117831,0.04491762,0.0006256181,0.4285653,0.002881221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4964561,0.01279607,0.4433643,0.02956857,0.001836992,0.001876747,0.0000455479,0.007808688,0.006247013],"genre_scores_gemma":[0.8856726,0.0006592558,0.1126456,0.0003580801,0.00005739129,0.0005161155,0.0000236918,0.00005720085,0.00001001615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5446774,"threshold_uncertainty_score":0.8513469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081405700","doi":"10.1109/lcomm.2020.3019437","title":"Distributed Intelligence: A Verification for Multi-Agent DRL-Based Multibeam Satellite Resource Allocation","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Resource management (computing); Reinforcement learning; Schedule; Scheduling (production processes); Distributed computing; Bandwidth (computing); Bandwidth allocation; Computer network; Communications satellite; Computational complexity theory; Broadband; Satellite; Telecommunications; Artificial intelligence; Mathematical optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1267076156387152,"gpt":0.3064243155205307,"spread":0.1797166998818154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003953253,0.0002995343,0.0002875727,0.0001429879,0.0003071492,0.0001232289,0.002079494,0.0001369438,0.000008821126],"category_scores_gemma":[0.0001748088,0.0003552994,0.000161831,0.0007084815,0.0001860101,0.0001944134,0.00009233774,0.0003497526,0.0001947769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002845667,"about_ca_system_score_gemma":0.00003506754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001645616,"about_ca_topic_score_gemma":0.0000175544,"domain_scores_codex":[0.9980279,0.0002709254,0.0008022349,0.0003394822,0.0002259265,0.0003335872],"domain_scores_gemma":[0.9958496,0.000526929,0.000187453,0.003045244,0.0001963233,0.0001944159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001491559,0.0005408055,0.001491808,0.000844622,0.0004199556,0.000001678595,0.01114647,0.3265797,0.539625,0.001521159,0.01418635,0.1034933],"study_design_scores_gemma":[0.0004424522,0.00002099154,0.0006114687,0.00005934702,0.00003469672,0.000001154367,0.0003813854,0.5893538,0.02145492,0.000005371897,0.3872791,0.0003553524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005258467,0.003399093,0.9684393,0.01949438,0.0002166737,0.001633597,0.0001942168,0.001192347,0.0001719004],"genre_scores_gemma":[0.9225193,0.0009381078,0.07094289,0.002527242,0.00008620565,0.0008995971,0.001974548,0.0001009148,0.00001124059],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9172608,"threshold_uncertainty_score":0.9998899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066331953","doi":"10.1109/lcomm.2011.100611.111690","title":"Performance Analysis of Space Shift Keying with Amplify and Forward Relaying","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"University of Tabuk","keywords":"Transmitter; Relay; Computer science; Antenna (radio); Topology (electrical circuits); Monte Carlo method; Algorithm; Keying; Upper and lower bounds; Expression (computer science); Telecommunications; Detector; Electronic engineering; Mathematics; Statistics; Physics; Power (physics); Engineering; Channel (broadcasting); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03183447438235305,"gpt":0.229880463709379,"spread":0.198045989327026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001116117,0.0001285501,0.0002299966,0.0004046442,0.0001501357,0.00001154368,0.0009359107,0.00005793988,0.000005400216],"category_scores_gemma":[0.00001405073,0.0001273314,0.00003834433,0.0008648892,0.0003516225,0.0002427789,0.000168864,0.0002956614,0.000002998337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000402056,"about_ca_system_score_gemma":0.000004957114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004025715,"about_ca_topic_score_gemma":0.00007582225,"domain_scores_codex":[0.99937,0.00003235705,0.000239067,0.0001157559,0.00008737671,0.0001554525],"domain_scores_gemma":[0.9973312,0.0001556929,0.00009991139,0.002351854,0.00003175833,0.00002957284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00006439925,0.0001897046,0.3987239,0.0003511611,0.004534369,0.000003024353,0.02540811,0.4237286,0.08310185,0.01236463,0.0003586012,0.05117163],"study_design_scores_gemma":[0.001051172,0.0001395706,0.4735232,0.0003869822,0.001499517,0.00001353396,0.003195682,0.4546064,0.06058517,0.0003617944,0.003100097,0.00153689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8911039,0.0005655247,0.1056613,0.0005195788,0.00001741474,0.0001199749,0.00000685547,0.0004499834,0.001555481],"genre_scores_gemma":[0.9042783,0.001760794,0.09381999,0.0000520058,0.000001679111,0.0000506706,0.00001115949,0.00002241959,0.000003001792],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07479925,"threshold_uncertainty_score":0.5192423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123330494","doi":"10.1109/lcomm.2003.822499","title":"Improving Belief Propagation on Graphs With Cycles","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Belief propagation; Factor graph; Multiplicative function; Decoding methods; Computer science; Algorithm; Reliability (semiconductor); Offset (computer science); Random variable; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02229873940237453,"gpt":0.2611080439434295,"spread":0.2388093045410549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002329212,0.000141246,0.0001027794,0.0002170263,0.0003879826,0.000137558,0.002357282,0.00003863142,4.397702e-7],"category_scores_gemma":[0.00003220309,0.0001275122,0.00004275636,0.0005340705,0.000142032,0.0004536303,0.0002122039,0.0003091339,0.00002772042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001447033,"about_ca_system_score_gemma":0.0000567011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002369181,"about_ca_topic_score_gemma":0.0001495569,"domain_scores_codex":[0.9990095,0.00009321491,0.0001870742,0.0002803099,0.0002252809,0.0002046075],"domain_scores_gemma":[0.9967306,0.0001168421,0.0001517857,0.00287714,0.00007675595,0.00004693744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003420102,0.0009592978,0.002373316,0.00005889422,0.00009281364,0.00002812667,0.007159437,0.008296469,0.4942489,0.3215764,0.002265655,0.1629065],"study_design_scores_gemma":[0.004450567,0.002388975,0.02056103,0.001928852,0.0001253135,0.0003984353,0.0004192519,0.05459465,0.8637539,0.04232391,0.005004081,0.004051046],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160232,0.00003827712,0.8115985,0.02546448,0.0001270606,0.0003553176,9.515745e-7,0.001218587,0.0009648085],"genre_scores_gemma":[0.7353005,0.00001164545,0.2623764,0.00219205,0.00001178912,0.00008505536,0.000003050765,0.00001358508,0.000005964112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5750685,"threshold_uncertainty_score":0.5199797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911232490","doi":"10.1109/lcomm.2019.2896929","title":"Collaborative Distributed Q-Learning for RACH Congestion Minimization in Cellular IoT Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Aloha; Random access; Scheme (mathematics); Channel (broadcasting); Network congestion; Minification; Throughput; Distributed computing; Wireless; Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.0106045916615336,"gpt":0.2416567007877305,"spread":0.2310521091261969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002078236,0.0001214408,0.0001573507,0.00007830754,0.0001078327,0.00005206291,0.0003253886,0.00009957295,0.00001307986],"category_scores_gemma":[0.0000207618,0.0001417383,0.0000353067,0.0004497423,0.00003640894,0.00009331199,0.00002704063,0.0002983329,0.00001614549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001105702,"about_ca_system_score_gemma":0.0000120983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006648182,"about_ca_topic_score_gemma":0.00002277281,"domain_scores_codex":[0.9992222,0.0001404121,0.000249733,0.0001206076,0.00006202706,0.0002050492],"domain_scores_gemma":[0.998939,0.0003420183,0.00006331488,0.0005546595,0.0000708122,0.00003015172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001432731,0.0000148039,0.00227562,0.0000216454,0.0000164996,2.253229e-7,0.0001780842,0.9881338,0.004396759,0.0001577601,0.003839299,0.0009511778],"study_design_scores_gemma":[0.0006075979,0.00002269181,0.001356413,0.00007605741,0.000009597866,3.637824e-7,0.00006734909,0.9563645,0.000485893,0.00002231362,0.04081097,0.000176313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2013233,0.0008892278,0.7800005,0.003787835,0.0006830783,0.01215297,0.00003569435,0.0004575746,0.0006698219],"genre_scores_gemma":[0.9925293,0.00008696121,0.003989263,0.0002084977,0.00007146689,0.002462846,0.0005890318,0.00003420763,0.00002837144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7912061,"threshold_uncertainty_score":0.5779921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256228233","doi":"10.1109/lcomm.2016.2621746","title":"Expansion Model for the Controller Placement Problem in Software Defined Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Software-defined networking; Software deployment; Key (lock); Controller (irrigation); Software; Face (sociological concept); Plan (archaeology); Control (management); Network architecture","retraction":null,"screen_n_in":null,"score":{"opus":0.03695164461709374,"gpt":0.2590996700586773,"spread":0.2221480254415835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401573,0.0001620241,0.0001772471,0.0000817871,0.0003731809,0.00009223631,0.002560795,0.00006669039,0.000001890996],"category_scores_gemma":[0.00006419879,0.00009702997,0.00009924177,0.0002857893,0.0001133893,0.0002616605,0.0003768621,0.0001637999,0.00001017342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001007745,"about_ca_system_score_gemma":0.00004529398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002381864,"about_ca_topic_score_gemma":0.00009528881,"domain_scores_codex":[0.9987123,0.0001182624,0.0003526809,0.0002882767,0.0001577524,0.0003707271],"domain_scores_gemma":[0.995154,0.002403421,0.0001289103,0.00218717,0.00007503764,0.0000514923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007684731,0.0001804635,0.001418346,0.000009347956,0.00006724038,8.435884e-7,0.0008625464,0.776482,0.001425915,0.01706062,0.06925786,0.133158],"study_design_scores_gemma":[0.001461743,0.0000225612,0.0003288095,0.00007753766,0.00001104261,0.000001715419,0.000007429669,0.9922519,0.00001993778,0.001719057,0.003923474,0.0001748386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008340637,0.0006524086,0.9442289,0.0531663,0.0001548929,0.0007725845,0.00000542769,0.0001639257,0.00002151903],"genre_scores_gemma":[0.7267849,0.000495937,0.2629019,0.008284349,0.00005898316,0.001314439,0.000006150154,0.00002423041,0.0001290874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7259509,"threshold_uncertainty_score":0.4758637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112488846","doi":"10.1109/lcomm.2003.821332","title":"Exact bit error rate analysis of TH-PPM UWB systems in the presence of multiple-access interference","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Bit error rate; Interference (communication); Pulse-position modulation; Computer science; Time-hopping; Binary number; Algorithm; Ultra-wideband; Probability of error; Modulation (music); Bit (key); Electronic engineering; Telecommunications; Decoding methods; Pulse (music); Mathematics; Pulse-amplitude modulation; Computer network; Physics; Channel (broadcasting); Detector; Arithmetic; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.046964423970874,"gpt":0.2906716196120993,"spread":0.2437071956412253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006074848,0.0001451713,0.0003457398,0.0006525697,0.00007844865,0.00003432894,0.004179317,0.00007918714,0.000008058932],"category_scores_gemma":[0.0002434901,0.0001270481,0.0001040197,0.002358569,0.0003490373,0.0001883011,0.0001405611,0.0003884423,0.000003703893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005405715,"about_ca_system_score_gemma":0.00001803213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006791701,"about_ca_topic_score_gemma":0.001207945,"domain_scores_codex":[0.9983242,0.0006303497,0.0006049723,0.0001347213,0.0001181553,0.0001875738],"domain_scores_gemma":[0.9935632,0.001611217,0.0001790922,0.004545087,0.0000810421,0.00002034183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000157498,0.000469721,0.09813244,0.0001897068,0.00139542,0.000001830251,0.005877479,0.5241162,0.3591749,0.007769114,0.001603973,0.001253398],"study_design_scores_gemma":[0.001509069,0.00009447768,0.1401089,0.0006544495,0.001333211,0.00002086602,0.00614177,0.7792081,0.05820082,0.0003171091,0.01118926,0.001221991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9754834,0.001721528,0.01896901,0.001675729,0.0001050453,0.0004475497,0.00003562607,0.0001237269,0.001438422],"genre_scores_gemma":[0.9977278,0.0006411429,0.001281655,0.00009096894,0.000002063312,0.0002145717,0.00002054743,0.00001557601,0.000005713991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3009741,"threshold_uncertainty_score":0.776628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115286596","doi":"10.1109/lcomm.2008.080209","title":"IEEE 802.11a Throughput Performance with Hidden Nodes","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Throughput; Distributed coordination function; Hidden node problem; Node (physics); Wireless network; Wireless; Wireless lan; IEEE 802.11; Distributed computing; Telecommunications; Wi-Fi array; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04997164319064543,"gpt":0.2623967111148769,"spread":0.2124250679242315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001770493,0.0001842425,0.0001881541,0.00008015872,0.0008036213,0.000113201,0.003641319,0.00005444001,0.000006342772],"category_scores_gemma":[0.000003453927,0.0001576629,0.00005707764,0.0005208062,0.0003639171,0.00077368,0.0002640542,0.0003431942,0.0001292778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005453029,"about_ca_system_score_gemma":0.00007654206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000577232,"about_ca_topic_score_gemma":0.00002094159,"domain_scores_codex":[0.9987149,0.0001402201,0.0002494075,0.0002943608,0.0002649915,0.0003361359],"domain_scores_gemma":[0.9960149,0.0001726724,0.0001334842,0.00351753,0.00008132491,0.00008011318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002082833,0.001875909,0.1201235,0.0003019201,0.000697733,0.0002225098,0.02562509,0.0457639,0.0335526,0.03040005,0.4689695,0.2722591],"study_design_scores_gemma":[0.004678974,0.0007946841,0.09145423,0.0009896259,0.00007646378,0.001237291,0.000108578,0.4653671,0.02212564,0.0005664623,0.4089537,0.003647204],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4778471,0.0003471108,0.4734931,0.03725114,0.0004102435,0.003385,0.000005399685,0.0007141681,0.006546783],"genre_scores_gemma":[0.8884238,0.0003276647,0.1055095,0.004117265,0.0001109704,0.001340502,0.000004936856,0.0000199758,0.0001453368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4196033,"threshold_uncertainty_score":0.6766538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108170890","doi":"10.1109/4234.996038","title":"Generalized moment estimators for the Nakagami fading parameter","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Moment (physics); Nakagami distribution; Mathematics; Fading; Applied mathematics; Integer (computer science); Estimation theory; Statistics; Mathematical optimization; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05782479819659659,"gpt":0.2860994234128695,"spread":0.2282746252162729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001498378,0.000164255,0.0001510447,0.00009512238,0.0003963814,0.00005880532,0.001708216,0.00004911739,0.00002243181],"category_scores_gemma":[0.00003532045,0.0001450393,0.000102184,0.0002123504,0.000177233,0.0001652647,0.0001153769,0.0002489054,0.00003141797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001309309,"about_ca_system_score_gemma":0.000002302949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009900742,"about_ca_topic_score_gemma":0.000007843422,"domain_scores_codex":[0.9991729,0.0000663062,0.0003026736,0.0001187425,0.0001057186,0.0002336581],"domain_scores_gemma":[0.9959625,0.0008951724,0.00006321072,0.002996163,0.00004007062,0.00004286178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000108798,0.0002181606,0.0003236982,0.0001133682,0.0005579441,0.000001186873,0.003630631,0.3712638,0.1452652,0.02012559,0.2610767,0.1974128],"study_design_scores_gemma":[0.0002772825,0.00000856311,0.00004665937,0.00002930577,0.00003265501,0.000003951136,0.0000357344,0.7738162,0.01041912,0.0003790828,0.2146854,0.0002660751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01920051,0.003455076,0.9578594,0.01655843,0.0002324515,0.0008838651,0.00002058907,0.001244465,0.000545221],"genre_scores_gemma":[0.774188,0.002835071,0.2199095,0.001461944,0.00003068711,0.001429538,0.00001764591,0.00006129033,0.00006628858],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7549875,"threshold_uncertainty_score":0.591453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135509084","doi":"10.1109/lcomm.2021.3064596","title":"Ordinary Differential Equation-Based CNN for Channel Extrapolation Over RIS-Assisted Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Ordinary differential equation; Ode; Computer science; Channel (broadcasting); Convergence (economics); Extrapolation; Convolutional neural network; Partial differential equation; Wireless; Set (abstract data type); Algorithm; Scheme (mathematics); Cellular neural network; Differential equation; Artificial neural network; Artificial intelligence; Applied mathematics; Mathematics; Telecommunications; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05261102504792083,"gpt":0.2814156825316446,"spread":0.2288046574837238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001828942,0.0002765422,0.0002866355,0.0002607941,0.0006194101,0.0001025788,0.001763853,0.0001593496,0.00003556385],"category_scores_gemma":[0.0001498808,0.0003419156,0.0001686104,0.0006184311,0.0002748175,0.0003787443,0.0002332095,0.0004713068,0.00002229672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000279336,"about_ca_system_score_gemma":0.00005195534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001604338,"about_ca_topic_score_gemma":0.00008009483,"domain_scores_codex":[0.9984243,0.0002270395,0.0005714762,0.0002603767,0.0001991742,0.0003176238],"domain_scores_gemma":[0.9934727,0.001080221,0.0001836763,0.004956927,0.0002459383,0.00006052969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007444045,0.0008136341,0.0006704461,0.0003204658,0.0004470044,0.000003182599,0.0007878481,0.3473894,0.5334591,0.01421738,0.02003487,0.08178224],"study_design_scores_gemma":[0.001768156,0.00002696699,0.004802921,0.0001778104,0.00008036057,0.000006786723,0.0002537957,0.9235196,0.04977551,0.002403914,0.01644778,0.000736359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04217496,0.002128326,0.9426875,0.009870453,0.0002846069,0.0006263762,0.00008702243,0.001594939,0.0005458688],"genre_scores_gemma":[0.8979787,0.000915874,0.09831981,0.0004584247,0.00003108865,0.0008144763,0.001365637,0.00007939889,0.00003657381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8558038,"threshold_uncertainty_score":0.9999033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}