{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jeyadeepan Jeganathan","is_ca":true},{"name":"Ali Ghrayeb","is_ca":true},{"name":"Leszek Szczeciński","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344416,0.001183737,0.001201274,0.001026151,0.0004704567,0.001553199,0.001061284,0.001564829,0.002523931],"category_scores_gemma":[0.009468793,0.0006571587,0.0005822659,0.001268906,0.001652286,0.00207503,0.001675209,0.001245799,0.0008642104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959173,"about_ca_system_score_gemma":0.001795182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001505879,"about_ca_topic_score_gemma":0.001374237,"domain_scores_codex":[0.9972548,0.0008074416,0.0001065865,0.0003866359,0.001113546,0.0003308975],"domain_scores_gemma":[0.9967443,0.002073798,0.0002676972,0.0002722517,0.0005835443,0.00005841456],"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.0002420992,0.00008818736,0.001557747,0.0004535576,0.0001358756,0.0003330849,0.0001791426,0.4306083,0.02604807,0.4696357,0.003854613,0.06686354],"study_design_scores_gemma":[0.00001981504,0.00006626749,0.0003967474,0.00005218825,0.00002496832,0.0004058257,0.0000288071,0.9200805,0.00590827,0.07084025,0.002140234,0.00003612831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01844038,0.003293254,0.9652528,0.0008523627,0.00009780474,0.00005483692,0.000141856,0.0002327105,0.01163396],"genre_scores_gemma":[0.7946136,0.004503778,0.1941052,0.0007033888,0.0006288887,0.0001576808,0.0003467116,0.0001178658,0.004822873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002523931,"threshold_uncertainty_score":0.01421487,"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","authors":[{"name":"Salama Ikki","is_ca":true},{"name":"Mohamed H. Ahmed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648956,0.0008996397,0.0008425624,0.000701785,0.0004860125,0.0009267299,0.0005067927,0.0008496852,0.0005770783],"category_scores_gemma":[0.009592476,0.0002700985,0.0003089707,0.0008335487,0.001182279,0.001056914,0.0008622701,0.0005022187,0.0002052381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391813,"about_ca_system_score_gemma":0.0005725932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002281168,"about_ca_topic_score_gemma":0.001232997,"domain_scores_codex":[0.9988555,0.0004964,0.00003351024,0.000094143,0.0003580665,0.0001624912],"domain_scores_gemma":[0.9934429,0.004856151,0.0006069815,0.0003076857,0.0007078224,0.00007853458],"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.00008389246,0.00001585435,0.00131038,0.00004876186,0.00003300705,0.0001554636,0.0001198421,0.97241,0.005596424,0.01415889,0.0001453397,0.005922121],"study_design_scores_gemma":[0.000004706716,0.00006855534,0.0005282658,0.000009604466,0.00001484278,0.00009361561,0.00003347388,0.9935867,0.001694239,0.003833965,0.0001207697,0.00001139965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.590802,0.002545964,0.3973567,0.0004347806,0.00003414984,0.00003690345,0.00009561187,0.0002699542,0.00842405],"genre_scores_gemma":[0.9952062,0.0004101779,0.003807959,0.0000263052,0.00002109641,0.00001628386,0.00001737269,0.00001163023,0.0004830068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002281168,"threshold_uncertainty_score":0.01009834,"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","authors":[{"name":"Jiaqi Xu","is_ca":false},{"name":"Yuanwei Liu","is_ca":false},{"name":"Xidong Mu","is_ca":false},{"name":"Octavia A. Dobre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001389829,0.0003680152,0.0003046473,0.0002381556,0.0001525519,0.0004631829,0.0005617577,0.0002944169,0.001121032],"category_scores_gemma":[0.0002642434,0.0001641138,0.0003966572,0.0003146947,0.0003311324,0.000566517,0.0005020895,0.0003297045,0.0005264005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002411744,"about_ca_system_score_gemma":0.0002436404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003018127,"about_ca_topic_score_gemma":0.0003697394,"domain_scores_codex":[0.9997846,0.00003199498,0.000008734053,0.00003909037,0.00009178879,0.00004385984],"domain_scores_gemma":[0.9997386,0.00006180416,0.00006268531,0.00007348559,0.00004355558,0.00001984397],"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.0004699309,0.0001378968,0.00394653,0.0004081441,0.0001053994,0.001035939,0.0003260538,0.2291401,0.4973086,0.07317406,0.003427427,0.1905199],"study_design_scores_gemma":[0.00004170936,0.001012887,0.002342317,0.00002589438,0.00007476026,0.001893509,0.0002043057,0.803638,0.15266,0.0124993,0.02553764,0.00006974167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3798592,0.001024988,0.5765873,0.0002409235,0.0001667392,0.00005415703,0.0001217328,0.001584641,0.04036037],"genre_scores_gemma":[0.9311768,0.0003019865,0.06370762,0.00008483701,0.00003320611,0.00002357909,0.00009136757,0.00004103287,0.004539535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001121032,"threshold_uncertainty_score":0.003750265,"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","authors":[{"name":"Hlaing Minn","is_ca":true},{"name":"Mao Zeng","is_ca":true},{"name":"V.K. Bhargava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821563,0.0005592896,0.0004817746,0.0005614632,0.0002663235,0.0005896554,0.0004225933,0.000790224,0.0011671],"category_scores_gemma":[0.003951077,0.0002756226,0.0002875759,0.001063947,0.000447771,0.0009442928,0.0005012206,0.0008595077,0.0005595427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003341811,"about_ca_system_score_gemma":0.0003274791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001189849,"about_ca_topic_score_gemma":0.0009328098,"domain_scores_codex":[0.9994887,0.0001565827,0.00002603902,0.00006840561,0.0002313139,0.00002893571],"domain_scores_gemma":[0.999167,0.0005470885,0.00005280687,0.00006221926,0.0001596851,0.00001130371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002125427,0.00003607421,0.0006910834,0.0003536681,0.0000605777,0.0002369693,0.0001243733,0.3188061,0.02309572,0.0569755,0.003998195,0.5954091],"study_design_scores_gemma":[0.00001952957,0.00008741311,0.0004642053,0.00005056064,0.00002231607,0.0002326861,0.00001512953,0.9672569,0.008094448,0.01421126,0.009513504,0.00003216372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00366551,0.002871175,0.9921766,0.00008976817,0.000133376,0.00001302342,0.0000188955,0.00009533062,0.0009363636],"genre_scores_gemma":[0.2934675,0.01906158,0.6766104,0.000303839,0.001981547,0.0001469028,0.0002894293,0.000129959,0.008008798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001189849,"threshold_uncertainty_score":0.003904283,"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","authors":[{"name":"Amin Alamdar-Yazdi","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064586,0.0007134189,0.0006582123,0.0005419563,0.0004883419,0.0009037564,0.00101648,0.0005206284,0.004024907],"category_scores_gemma":[0.001558627,0.0002956539,0.0004989547,0.0005651246,0.0005087136,0.0008871285,0.0008868364,0.001495623,0.0034789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004492599,"about_ca_system_score_gemma":0.001852763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070561,"about_ca_topic_score_gemma":0.004076391,"domain_scores_codex":[0.9994055,0.00007543015,0.00003308947,0.00007044904,0.0003657884,0.00004975563],"domain_scores_gemma":[0.9993144,0.000134292,0.00004589571,0.0001816388,0.0002885067,0.00003521811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007531113,0.0001067855,0.0006270917,0.0005268406,0.00008822923,0.0007581007,0.000188923,0.1185872,0.3030799,0.1617576,0.01295993,0.4005663],"study_design_scores_gemma":[0.0001589245,0.0003078239,0.0004833145,0.00008351642,0.0001071341,0.001938127,0.00005101242,0.6633887,0.2192892,0.04206871,0.07195946,0.0001640988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004932541,0.0001978071,0.987484,0.000122155,0.0001551323,0.0001073945,0.0002245785,0.0008659079,0.005910379],"genre_scores_gemma":[0.1486066,0.00108315,0.8304265,0.0003916879,0.0002034105,0.0002576625,0.001161543,0.000234246,0.01763529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004024907,"threshold_uncertainty_score":0.01346463,"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","authors":[{"name":"Harilaos G. Sandalidis","is_ca":false},{"name":"Theodoros A. Tsiftsis","is_ca":false},{"name":"George K. Karagiannidis","is_ca":false},{"name":"Murat Uysal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008930955,0.000796061,0.000572153,0.0005019804,0.000517092,0.0005961898,0.0002549333,0.0007752506,0.0008900071],"category_scores_gemma":[0.003994983,0.0001545708,0.000193791,0.0005702953,0.0007690298,0.000919456,0.0006393635,0.0003323463,0.0001650384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005721233,"about_ca_system_score_gemma":0.0004857486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003082112,"about_ca_topic_score_gemma":0.002901601,"domain_scores_codex":[0.9993556,0.0001629521,0.00002984291,0.0000628011,0.0002315238,0.000157264],"domain_scores_gemma":[0.9973441,0.001683846,0.0003907747,0.0001353792,0.0003694988,0.00007639844],"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.0006762841,0.00009277378,0.01250572,0.0001635852,0.00009364687,0.0004806499,0.0001789256,0.9070753,0.05998408,0.005485267,0.0002967198,0.01296699],"study_design_scores_gemma":[0.000035958,0.0003237093,0.01011188,0.00002667077,0.00004826497,0.0003679375,0.0001177434,0.961455,0.02553456,0.001667907,0.0002568279,0.00005342913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9792402,0.00045384,0.01801253,0.0001159282,0.00001779903,0.000008537641,0.00009983747,0.0001273951,0.001923999],"genre_scores_gemma":[0.9984133,0.000117314,0.001091248,0.00001352832,0.000006067749,0.000002793576,0.00002907909,0.000007437922,0.0003192577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003082112,"threshold_uncertainty_score":0.006128371,"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","authors":[{"name":"Yahong Rosa Zheng","is_ca":true},{"name":"Chengshan Xiao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009346214,0.000668783,0.0007735677,0.0005387705,0.0002760513,0.0007310277,0.001707707,0.001011522,0.001957153],"category_scores_gemma":[0.003444827,0.0004055678,0.0008150078,0.0006498936,0.0004908761,0.001512897,0.0007135046,0.001429921,0.0007718362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007660643,"about_ca_system_score_gemma":0.0008478101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002399602,"about_ca_topic_score_gemma":0.001653287,"domain_scores_codex":[0.9992706,0.0002444787,0.00003895089,0.00008778121,0.0002867968,0.00007129596],"domain_scores_gemma":[0.9988399,0.0005728613,0.0001063142,0.0001789591,0.0002605809,0.00004143573],"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.00004380657,0.00001573889,0.000285282,0.00002399497,0.00001445468,0.00006398807,0.00004722785,0.9509206,0.00220931,0.03952049,0.000401728,0.006453315],"study_design_scores_gemma":[0.000004099246,0.00001112616,0.00002505937,0.000001984823,0.000002849697,0.00001310696,0.000001696282,0.9963098,0.0003530791,0.002795719,0.000477217,0.000004137326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01645044,0.0001732847,0.979665,0.0001237057,0.00004678515,0.00005456911,0.0001220627,0.0002719418,0.003092257],"genre_scores_gemma":[0.7676737,0.001020367,0.2175841,0.0001829225,0.0001207349,0.0004687602,0.0006070675,0.0002059764,0.01213635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002399602,"threshold_uncertainty_score":0.006547332,"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","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"Jeremiah Hu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002504209,0.001569289,0.001219789,0.00102914,0.0005786102,0.00203298,0.001253135,0.001589727,0.005458894],"category_scores_gemma":[0.01242819,0.0004493253,0.0005055472,0.001370262,0.001689089,0.002114689,0.00115117,0.001484,0.001634941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594037,"about_ca_system_score_gemma":0.001237985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001808544,"about_ca_topic_score_gemma":0.002493023,"domain_scores_codex":[0.9988304,0.0002822169,0.00006484096,0.000171792,0.0005124749,0.0001382522],"domain_scores_gemma":[0.9932607,0.004908661,0.0005820988,0.0002508214,0.0009243609,0.00007335922],"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.0001341469,0.00009627734,0.001192718,0.0007454417,0.00009479916,0.0007170135,0.0005534137,0.638403,0.01080301,0.2774331,0.007713872,0.06211315],"study_design_scores_gemma":[0.00002947823,0.0001106791,0.0008956087,0.000151301,0.00006374497,0.0009880464,0.0001638297,0.904797,0.003387414,0.08343144,0.005911077,0.00007050826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01374557,0.002520617,0.9703798,0.0005477319,0.0001289436,0.00008974244,0.0004347028,0.0002766599,0.01187623],"genre_scores_gemma":[0.7348889,0.009915953,0.2355333,0.000693864,0.0004914638,0.000510508,0.001275965,0.0002253158,0.01646482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005458894,"threshold_uncertainty_score":0.01826179,"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","authors":[{"name":"Xin Liu","is_ca":false},{"name":"Yuhua Xu","is_ca":false},{"name":"Luliang Jia","is_ca":false},{"name":"Qihui Wu","is_ca":false},{"name":"Alagan Anpalagan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006274724,0.0007013411,0.0008331847,0.0002989607,0.0002839307,0.0005470928,0.0009281982,0.0009881661,0.000848508],"category_scores_gemma":[0.00177132,0.0003413769,0.0003078382,0.0002391468,0.0008507598,0.0008613413,0.0007969235,0.001182186,0.0001105104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006325195,"about_ca_system_score_gemma":0.0007931155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004025429,"about_ca_topic_score_gemma":0.00273145,"domain_scores_codex":[0.9997978,0.00006009891,0.000008669289,0.00004096311,0.0000452798,0.00004719612],"domain_scores_gemma":[0.9993178,0.0003930805,0.00009562392,0.00003430067,0.0001166171,0.00004254124],"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.0000333202,0.00002900646,0.0003954431,0.0000279461,0.00002331673,0.00004433519,0.00003348879,0.9758951,0.001456205,0.00620735,0.0002736694,0.01558071],"study_design_scores_gemma":[0.000002143577,0.000008801147,0.00001993421,0.000001408815,0.000002133291,0.000003145009,0.0000015509,0.9987413,0.00009706115,0.001067985,0.00005313721,0.000001340281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03915238,0.0003769088,0.9570278,0.0003637174,0.00003990786,0.0000226925,0.0000155154,0.0001934208,0.002807672],"genre_scores_gemma":[0.9604143,0.0001916843,0.03720227,0.0001466366,0.00003746151,0.00004249344,0.00002012884,0.00002168987,0.001923314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004025429,"threshold_uncertainty_score":0.00800401,"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","authors":[{"name":"Afrim Sallahi","is_ca":true},{"name":"Marc St‐Hilaire","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001672525,0.001846399,0.001638095,0.0009231257,0.0006875284,0.00229154,0.002069891,0.002453545,0.006126087],"category_scores_gemma":[0.004202094,0.001059288,0.001204001,0.0009952807,0.001403722,0.002246448,0.00136134,0.002755507,0.0006273324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002773011,"about_ca_system_score_gemma":0.002744048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00894885,"about_ca_topic_score_gemma":0.00729236,"domain_scores_codex":[0.9987851,0.0004085993,0.00004944414,0.000260085,0.0002817007,0.000215177],"domain_scores_gemma":[0.9983028,0.001134975,0.000159505,0.00005476668,0.0002572193,0.00009078135],"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.00002223232,0.00002134606,0.0001085988,0.00005673146,0.00001379813,0.00004271103,0.00002319609,0.958454,0.0002742652,0.03763297,0.0007570455,0.002593065],"study_design_scores_gemma":[0.00001085402,0.00001125516,0.00002623116,0.000006513382,0.000004240057,0.00000619107,0.000009616392,0.9873262,0.00007255383,0.01195132,0.0005713433,0.000003617117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007728984,0.000460327,0.9831926,0.0006735661,0.00009818787,0.00007415413,0.0002014239,0.0001130711,0.007457643],"genre_scores_gemma":[0.6792238,0.002107657,0.2948804,0.0005422542,0.0002545555,0.0009798816,0.0008214935,0.0002512349,0.02093869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00894885,"threshold_uncertainty_score":0.02049375,"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","authors":[{"name":"Zhaolin Wang","is_ca":false},{"name":"Yuanwei Liu","is_ca":false},{"name":"Xidong Mu","is_ca":false},{"name":"Zhiguo Ding","is_ca":false},{"name":"Octavia A. Dobre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009310361,0.001329786,0.0009273739,0.0004532769,0.0005614568,0.001166771,0.001386634,0.000891002,0.001510458],"category_scores_gemma":[0.00177198,0.0003722145,0.0004853186,0.0007705365,0.000876238,0.00130322,0.001796834,0.001201634,0.0005232872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000463922,"about_ca_system_score_gemma":0.001254755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133776,"about_ca_topic_score_gemma":0.002526622,"domain_scores_codex":[0.9988633,0.0004164654,0.0000292673,0.0001964959,0.0003222218,0.0001722155],"domain_scores_gemma":[0.9991325,0.000351435,0.0001314826,0.0001246197,0.0001990312,0.0000609361],"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.0002911758,0.0001513,0.0009960855,0.0003992522,0.0001477144,0.0007150708,0.0001899718,0.6545919,0.03479954,0.1566699,0.005089751,0.1459583],"study_design_scores_gemma":[0.000009176543,0.0001012457,0.0001182477,0.00001142183,0.00001541058,0.0001622743,0.00002441838,0.9852909,0.002422152,0.009464682,0.00236449,0.00001565165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007547303,0.000466296,0.9871022,0.0001720517,0.00009511826,0.00003219646,0.00004506371,0.0001182371,0.004421478],"genre_scores_gemma":[0.7392769,0.0008829866,0.2498124,0.0003408979,0.0002175609,0.0001848448,0.000122331,0.00003909829,0.009122793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001510458,"threshold_uncertainty_score":0.005053043,"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","authors":[{"name":"Yiyi Zhao","is_ca":true},{"name":"Raviraj Adve","is_ca":true},{"name":"Teng Joon Lim","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977769,0.001261073,0.001574964,0.0009918478,0.000974905,0.002243401,0.001266858,0.001758897,0.001726729],"category_scores_gemma":[0.02380668,0.0007715785,0.0005357351,0.001793495,0.003505482,0.00339756,0.002417172,0.002178386,0.0005882066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002057125,"about_ca_system_score_gemma":0.001052823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001484864,"about_ca_topic_score_gemma":0.0008172305,"domain_scores_codex":[0.9962877,0.001128464,0.0001539482,0.0003717999,0.001427848,0.0006303231],"domain_scores_gemma":[0.9806947,0.01532217,0.001382735,0.001248124,0.001078307,0.0002738984],"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.0003714708,0.00009758762,0.002530418,0.000359899,0.00006683105,0.001097663,0.0007955817,0.6756257,0.007977698,0.2724942,0.005064706,0.03351829],"study_design_scores_gemma":[0.00005027035,0.00009792366,0.001202309,0.00007600853,0.0000534193,0.000693694,0.0001557168,0.7724955,0.003951242,0.2193198,0.001842872,0.00006129402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392628,0.0033509,0.8247712,0.002373009,0.0001527881,0.00004884641,0.0004669109,0.0008760882,0.02869734],"genre_scores_gemma":[0.983083,0.001450932,0.01252364,0.0002749077,0.0003013166,0.00006787519,0.0001555965,0.00009898195,0.002043871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003977769,"threshold_uncertainty_score":0.02103674,"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","authors":[{"name":"Chenyu Wu","is_ca":false},{"name":"Yuanwei Liu","is_ca":false},{"name":"Xidong Mu","is_ca":false},{"name":"Xuemai Gu","is_ca":false},{"name":"Octavia A. Dobre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008509965,0.0009807266,0.0007499761,0.0008704715,0.0003924789,0.001194531,0.0009295173,0.0006788753,0.001296246],"category_scores_gemma":[0.004085612,0.0003610429,0.0004927351,0.001126817,0.0008759584,0.001224155,0.001254229,0.0007225237,0.0002393295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008434915,"about_ca_system_score_gemma":0.0005904158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001978971,"about_ca_topic_score_gemma":0.001707155,"domain_scores_codex":[0.9990705,0.0003822617,0.00002865356,0.0001199339,0.0002199535,0.0001786452],"domain_scores_gemma":[0.9974676,0.001629836,0.0003300121,0.0001716517,0.0003088303,0.00009209823],"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.0002303732,0.00004352499,0.00263892,0.0001578115,0.00005763578,0.0004366793,0.0001677598,0.9046205,0.009053703,0.05604384,0.0012903,0.02525897],"study_design_scores_gemma":[0.000003082151,0.00003367139,0.0004101935,0.000005904152,0.000007378762,0.00009818975,0.00004333064,0.9930069,0.0007577978,0.00528155,0.0003448514,0.000007080849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1874187,0.001691529,0.7858123,0.0004266212,0.00006257546,0.00006563321,0.0003304716,0.0002098303,0.02398228],"genre_scores_gemma":[0.9740467,0.0006325093,0.02349069,0.00009798042,0.00006035822,0.00006388093,0.0001555853,0.0000258903,0.001426344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001978971,"threshold_uncertainty_score":0.006120026,"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","authors":[{"name":"Hua Xiao","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124257,0.0003935152,0.0003993062,0.0004919366,0.000353055,0.000312775,0.0005450947,0.0004967464,0.0008475609],"category_scores_gemma":[0.001493932,0.0001608464,0.0002879509,0.0006551656,0.0005709082,0.0007288373,0.001034366,0.0008898086,0.0003482762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002473727,"about_ca_system_score_gemma":0.00048482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006397579,"about_ca_topic_score_gemma":0.0007857318,"domain_scores_codex":[0.9997528,0.00005813043,0.00001440711,0.00003565125,0.0001014231,0.00003750467],"domain_scores_gemma":[0.9993665,0.0001900971,0.0000622286,0.0002282199,0.0001160595,0.00003699349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004705912,0.0001576273,0.002240945,0.0003244205,0.00004797869,0.0006048691,0.0003573064,0.2670764,0.1495878,0.175714,0.005279663,0.3981384],"study_design_scores_gemma":[0.00007715913,0.0001851661,0.0006507043,0.00002565265,0.00002738002,0.0006006876,0.00003832896,0.8522188,0.08892177,0.04019374,0.0170085,0.00005204185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08495028,0.0002794437,0.9066623,0.0002404959,0.00007206495,0.0001051933,0.0001794847,0.0009326186,0.006578029],"genre_scores_gemma":[0.4283963,0.0003637793,0.5664622,0.0001200324,0.00002590143,0.0001259786,0.0004191176,0.0001188419,0.003967733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008475609,"threshold_uncertainty_score":0.002835333,"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","authors":[{"name":"Jeff Castura","is_ca":true},{"name":"Yongyi Mao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009681549,0.0004765358,0.0004951792,0.0004483773,0.0004776483,0.0009179329,0.001220767,0.0007938119,0.001187258],"category_scores_gemma":[0.003143313,0.0001730356,0.0003848825,0.0005435945,0.001097295,0.001389061,0.0006508082,0.0009954172,0.000352933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006690695,"about_ca_system_score_gemma":0.000678796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222959,"about_ca_topic_score_gemma":0.001375449,"domain_scores_codex":[0.9994363,0.0002266604,0.00001779759,0.00004675889,0.0001760072,0.0000965038],"domain_scores_gemma":[0.9987882,0.000558241,0.0001202768,0.0002774983,0.000218531,0.00003736404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009633959,0.00002886813,0.0002457,0.00008880332,0.00002674279,0.0003091838,0.0001689405,0.4603592,0.009203664,0.49027,0.001301168,0.03790154],"study_design_scores_gemma":[0.00002509862,0.00007248246,0.00008086457,0.00002901484,0.00001527078,0.0001785342,0.00002018135,0.8889669,0.003901735,0.1019883,0.004691972,0.000029638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02181893,0.0005170229,0.9723278,0.0002803779,0.00007546282,0.00004866915,0.00004257071,0.0002836374,0.004605609],"genre_scores_gemma":[0.7834409,0.0009981643,0.2117366,0.0001812212,0.0001171135,0.0001407249,0.00005415826,0.00005803285,0.003272945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00222959,"threshold_uncertainty_score":0.005120158,"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","authors":[{"name":"Amir Ghasemi","is_ca":true},{"name":"E.S. Sousa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000643797,0.000913032,0.0009428216,0.001280044,0.0009781375,0.006402656,0.001190829,0.001619989,0.7997265],"category_scores_gemma":[0.001960205,0.0005067241,0.0007688833,0.002205085,0.0007433256,0.004358581,0.001544547,0.001859216,0.8489174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127397,"about_ca_system_score_gemma":0.001604733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005596359,"about_ca_topic_score_gemma":0.006811689,"domain_scores_codex":[0.9997014,0.00002789719,0.00002397106,0.00006604617,0.0001307878,0.00004995497],"domain_scores_gemma":[0.9987119,0.0001164172,0.00003575642,0.0001620817,0.0006698613,0.0003039882],"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.00004408143,0.00003672027,0.000206975,0.0001862847,0.000005839543,0.00004477224,0.00006075236,0.00009405096,0.001302256,0.001916996,0.9030401,0.09306116],"study_design_scores_gemma":[0.000008622213,0.00001554113,0.0003528388,0.0000830102,0.000006257503,0.00005074287,0.0001084216,0.0001741784,0.0005299685,0.0007231159,0.9979396,0.000007649463],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001026104,0.00120526,0.008265787,0.004019192,0.008586792,0.0003307007,0.006195088,0.006031103,0.96434],"genre_scores_gemma":[0.002838005,0.001824358,0.002522741,0.0007509559,0.0004224635,0.00008260212,0.002862184,0.001991395,0.9867051],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2002735,"threshold_uncertainty_score":0.2856658,"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","authors":[{"name":"Murat Uysal","is_ca":true},{"name":"S.M. Navidpour","is_ca":true},{"name":"Jonathan Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849673,0.0008625769,0.0004376276,0.0004734958,0.0004358374,0.0007999396,0.0004417106,0.0008155397,0.001048369],"category_scores_gemma":[0.008286864,0.0001909337,0.0002158002,0.0005342061,0.0009865288,0.0009974958,0.001093283,0.0005641109,0.0002093762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007586443,"about_ca_system_score_gemma":0.0007473101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002259845,"about_ca_topic_score_gemma":0.001842609,"domain_scores_codex":[0.9990982,0.0002177694,0.00004000398,0.00006757231,0.0003736471,0.0002028031],"domain_scores_gemma":[0.9907328,0.006667924,0.0007604311,0.0004065507,0.001289619,0.0001426141],"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.0008029765,0.00006896548,0.002684877,0.0001457492,0.00004866415,0.0001988215,0.0001361487,0.9260146,0.03481058,0.016187,0.000402189,0.01849933],"study_design_scores_gemma":[0.00002608334,0.0002637092,0.001345334,0.00003084601,0.00002399333,0.0001213998,0.00004867075,0.9643669,0.02974543,0.003728244,0.0002568561,0.00004263517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8497217,0.0007613118,0.141893,0.0003004213,0.00006354659,0.00003150994,0.0002168504,0.0002624788,0.006749291],"genre_scores_gemma":[0.9957723,0.0001483867,0.003379177,0.00003138869,0.00001040824,0.00001277214,0.00005078297,0.00001013219,0.0005846004],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002259845,"threshold_uncertainty_score":0.009782076,"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","authors":[{"name":"Wilfried Gappmair","is_ca":false},{"name":"Steve Hranilovic","is_ca":true},{"name":"Erich Leitgeb","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287489,0.0006429955,0.0004911873,0.0004803513,0.0006535514,0.0006089879,0.0003613223,0.0008449015,0.001183285],"category_scores_gemma":[0.005081823,0.0001182379,0.0001560852,0.0006547468,0.0008590697,0.001016403,0.000978358,0.0003426426,0.0001574448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004998411,"about_ca_system_score_gemma":0.0005042049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002202951,"about_ca_topic_score_gemma":0.002140582,"domain_scores_codex":[0.9993572,0.0001805931,0.0000238428,0.00006466558,0.0001952964,0.0001784473],"domain_scores_gemma":[0.9973132,0.001695461,0.0003352512,0.0001659984,0.0004014938,0.00008860732],"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.002977476,0.0002089198,0.03438144,0.0003773468,0.000136169,0.001776152,0.0005373748,0.7332128,0.1407626,0.0123952,0.0009863758,0.07224823],"study_design_scores_gemma":[0.00008818449,0.001713587,0.01842788,0.00005755692,0.00006875009,0.00143222,0.0004481973,0.897444,0.0739342,0.005436214,0.0008441827,0.0001050347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844851,0.0003797314,0.01179612,0.000179283,0.00002139968,0.000009013517,0.00007177029,0.0001180203,0.00293955],"genre_scores_gemma":[0.9988771,0.00006955033,0.0006933914,0.00001765559,0.000006520493,0.000002618352,0.00002209659,0.000004422248,0.0003065952],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002202951,"threshold_uncertainty_score":0.004382849,"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","authors":[{"name":"S. Sharifi Tehrani","is_ca":true},{"name":"Warren J. Gross","is_ca":true},{"name":"Shie Mannor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276216,0.0005485344,0.0007666511,0.000695408,0.0006335585,0.0008513454,0.0006291539,0.0007389174,0.001012019],"category_scores_gemma":[0.006525315,0.0003239654,0.0005337417,0.0008370417,0.00083648,0.0006061208,0.001047043,0.001041514,0.0007166035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008481959,"about_ca_system_score_gemma":0.001773348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002001142,"about_ca_topic_score_gemma":0.002262899,"domain_scores_codex":[0.9978808,0.0005820406,0.00009608979,0.0002108902,0.001087503,0.0001427046],"domain_scores_gemma":[0.9979131,0.0009910809,0.0001630891,0.0003562251,0.0005118588,0.00006458414],"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.0001638372,0.000041978,0.0007283117,0.0001834921,0.00007868031,0.0002402582,0.0001928749,0.5577887,0.03150052,0.2704169,0.002667063,0.1359973],"study_design_scores_gemma":[0.00001465555,0.00002553566,0.000116776,0.00001979187,0.000007450782,0.0001118397,0.000006824544,0.942885,0.01286189,0.04064655,0.003284684,0.00001903564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009122904,0.0001123417,0.9869112,0.0000928693,0.00003463703,0.00003065143,0.00008433764,0.0004063438,0.00320464],"genre_scores_gemma":[0.4845614,0.0007114657,0.5062662,0.0002739578,0.0001294037,0.0002416898,0.0006181917,0.0002650801,0.006932685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002001142,"threshold_uncertainty_score":0.00615406,"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","authors":[{"name":"Sylvester Aboagye","is_ca":true},{"name":"Telex M. N. Ngatched","is_ca":true},{"name":"Octavia A. Dobre","is_ca":true},{"name":"Alain R. Ndjiongue","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002151399,0.0003611491,0.0004106876,0.0001825373,0.0002259536,0.0005660825,0.0006324113,0.000405463,0.000999425],"category_scores_gemma":[0.0004225836,0.0001506249,0.0002618718,0.0002265408,0.0003023905,0.0005333842,0.0005267888,0.0004476912,0.0004224867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003253589,"about_ca_system_score_gemma":0.0004553374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127583,"about_ca_topic_score_gemma":0.001577208,"domain_scores_codex":[0.9996531,0.00008354786,0.000008635732,0.00005378404,0.0001462504,0.00005479658],"domain_scores_gemma":[0.9997684,0.00005985075,0.00005543647,0.00004047828,0.00006379147,0.0000120664],"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.000245765,0.00009202481,0.001793418,0.0001312282,0.00004933189,0.0002273981,0.0002158844,0.6716532,0.1396907,0.01581225,0.001783976,0.1683049],"study_design_scores_gemma":[0.00000738695,0.0001272976,0.0002319011,0.000004923816,0.000009974165,0.00006706874,0.00002878698,0.9810065,0.01546807,0.0009122949,0.002124671,0.0000112268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07772585,0.0002497211,0.9118871,0.0001108104,0.0000317589,0.00002216657,0.00002437174,0.0008017262,0.009146444],"genre_scores_gemma":[0.9233162,0.000122782,0.07343541,0.00003889469,0.00001663638,0.00001946768,0.00002847508,0.0000274748,0.002994578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001127583,"threshold_uncertainty_score":0.003343403,"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","authors":[{"name":"Jeremiah Hu","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906066,0.00159102,0.001634266,0.001686898,0.0008170751,0.003311494,0.002052868,0.001734554,0.005301317],"category_scores_gemma":[0.01772611,0.0008418089,0.0009570637,0.001684066,0.001614848,0.005359327,0.001804551,0.002849548,0.005588708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626565,"about_ca_system_score_gemma":0.001442613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066312,"about_ca_topic_score_gemma":0.002135681,"domain_scores_codex":[0.9972294,0.0006907898,0.0001325046,0.0002352958,0.001465989,0.0002459758],"domain_scores_gemma":[0.9940696,0.003351125,0.0003260155,0.0007375987,0.001428097,0.00008767161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008027562,0.00007082833,0.0004566874,0.0003353298,0.00003440116,0.0002589553,0.000301978,0.6136596,0.00453736,0.3053638,0.00706139,0.0678394],"study_design_scores_gemma":[0.000009261277,0.00001742839,0.0001046955,0.00006322926,0.000009321026,0.0001658689,0.00004888379,0.9201884,0.001845658,0.07231382,0.005205469,0.00002793609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003783067,0.001269903,0.9853858,0.0001810923,0.0001142383,0.00004752007,0.000126601,0.0004740639,0.008617672],"genre_scores_gemma":[0.3851681,0.01119235,0.5730091,0.0006997338,0.000688774,0.0007038207,0.001029704,0.001023878,0.02648458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005301317,"threshold_uncertainty_score":0.01773471,"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","authors":[{"name":"M Yazdani","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729816,0.0004038255,0.0003595066,0.0006883948,0.0005537721,0.0006175705,0.0005928077,0.0004601815,0.0008647651],"category_scores_gemma":[0.001980936,0.0002791609,0.0004982385,0.0004403357,0.0009222395,0.0006436917,0.001133368,0.0008709954,0.0004468208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003744317,"about_ca_system_score_gemma":0.0006341938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003214408,"about_ca_topic_score_gemma":0.0002596187,"domain_scores_codex":[0.999472,0.0001594374,0.00002220573,0.0000576772,0.0002232799,0.00006544995],"domain_scores_gemma":[0.999363,0.0002356026,0.00007862482,0.0001828441,0.0001013704,0.0000385429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001028675,0.00004367965,0.0007507018,0.000164558,0.000016043,0.0004364513,0.0002912903,0.06959845,0.03285781,0.8434036,0.0008583579,0.05147619],"study_design_scores_gemma":[0.00008225667,0.0003040539,0.0004922118,0.0001034061,0.00003324601,0.0008384608,0.00008101591,0.5149485,0.07756577,0.3815002,0.02396256,0.00008836684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04522646,0.0003098069,0.9482121,0.0001151706,0.0000414142,0.00008138255,0.00006781983,0.0002071109,0.005738732],"genre_scores_gemma":[0.5047185,0.000753061,0.4908448,0.0001142191,0.00006505816,0.0002122671,0.0002520207,0.0001016707,0.00293849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008729816,"threshold_uncertainty_score":0.004616857,"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","authors":[{"name":"Tao Cui","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783133,0.0008471733,0.0008486895,0.0003520697,0.000294601,0.0008070316,0.0005466859,0.0007810154,0.002303897],"category_scores_gemma":[0.001686931,0.0002708469,0.0004539789,0.0006605932,0.0005375686,0.0007006981,0.001148514,0.0007189428,0.001461425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005381271,"about_ca_system_score_gemma":0.001156182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293919,"about_ca_topic_score_gemma":0.002220858,"domain_scores_codex":[0.9994436,0.0001719821,0.00003578883,0.00005910121,0.0002377354,0.00005188645],"domain_scores_gemma":[0.9994041,0.0002351187,0.00004394168,0.0001263961,0.0001554834,0.00003492937],"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.0001703001,0.00003798272,0.0004532731,0.0001990532,0.00006806573,0.0004382812,0.0001884702,0.5805838,0.03627818,0.157658,0.006446975,0.2174776],"study_design_scores_gemma":[0.00002003635,0.00004855592,0.00006073237,0.00001225126,0.000008901673,0.0001869194,0.00001336975,0.9660599,0.008506309,0.02074418,0.004323353,0.00001552753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005230088,0.0001513205,0.9926844,0.00008450495,0.00002447463,0.00001950235,0.00006715089,0.0002141711,0.001524465],"genre_scores_gemma":[0.2469003,0.0005999685,0.7469084,0.0001766628,0.00009160567,0.00008852464,0.0005152443,0.0001145723,0.004604762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002303897,"threshold_uncertainty_score":0.007707298,"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","authors":[{"name":"Peng Hui Tan","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339107,0.000310041,0.0003570974,0.000306411,0.0001596065,0.0003925687,0.0003123623,0.0003488637,0.001267729],"category_scores_gemma":[0.001640915,0.0001161756,0.0001946863,0.0004380406,0.0003090886,0.0004482525,0.0002098533,0.0004465822,0.0002531144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001698995,"about_ca_system_score_gemma":0.0002233086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003104382,"about_ca_topic_score_gemma":0.0003242086,"domain_scores_codex":[0.9997637,0.00005975704,0.000009995093,0.00002864977,0.0001038228,0.00003410092],"domain_scores_gemma":[0.9995572,0.0002261374,0.0000435884,0.00005560689,0.00009974068,0.00001764555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001731775,0.0001688409,0.001849931,0.0005084354,0.000145454,0.0006541808,0.0003331845,0.04619743,0.55067,0.01822077,0.002082366,0.3774376],"study_design_scores_gemma":[0.0001692642,0.002386122,0.005875171,0.00005773464,0.000271624,0.001951951,0.0001192425,0.4064505,0.565667,0.005192861,0.01178369,0.00007482799],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5562944,0.002616276,0.4233958,0.0004919991,0.0002960741,0.00007607173,0.00009929301,0.001067146,0.01566295],"genre_scores_gemma":[0.9344974,0.0007240546,0.06263354,0.0001071558,0.0001103416,0.00001595909,0.00009666914,0.00004117691,0.001773805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001267729,"threshold_uncertainty_score":0.00424099,"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","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"A.S. Toms","is_ca":true},{"name":"D.R. Pauluzzi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007962835,0.001150691,0.001316406,0.002272077,0.0003044545,0.001143683,0.0008157176,0.001472943,0.0009398758],"category_scores_gemma":[0.03947341,0.0005213137,0.0007046622,0.0007967284,0.0007145321,0.001967935,0.0007626775,0.0006473362,0.000470683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006666899,"about_ca_system_score_gemma":0.0004105905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004777163,"about_ca_topic_score_gemma":0.0005023544,"domain_scores_codex":[0.9966618,0.001596475,0.0002788864,0.0002643852,0.0009805881,0.0002180381],"domain_scores_gemma":[0.9733071,0.0203659,0.001455501,0.001229278,0.003453068,0.0001891182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006093471,0.0004329687,0.04128243,0.0008200744,0.0009764221,0.0002662886,0.0002789621,0.2581074,0.06908685,0.0161156,0.001299604,0.60524],"study_design_scores_gemma":[0.0003102233,0.002388457,0.01871937,0.000131207,0.0005753349,0.0007675467,0.0001424045,0.8300874,0.1381716,0.00489058,0.003558648,0.0002572328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2006261,0.00247691,0.7929273,0.0002237156,0.0001290541,0.0001054101,0.0001236343,0.001224056,0.002163751],"genre_scores_gemma":[0.7688331,0.001119933,0.2281987,0.0001446437,0.0001133742,0.0001280431,0.000358537,0.0001436021,0.0009601746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007962835,"threshold_uncertainty_score":0.04211199,"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","authors":[{"name":"H. Mheidat","is_ca":true},{"name":"Murat Uysal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984039,0.00123123,0.001150766,0.0003682158,0.0004776842,0.001345034,0.0005648798,0.001107902,0.00112076],"category_scores_gemma":[0.01686954,0.0003146629,0.0003445684,0.0004782817,0.001495093,0.001729194,0.001378058,0.0008722769,0.0002641066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006495186,"about_ca_system_score_gemma":0.0007046913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006861816,"about_ca_topic_score_gemma":0.0005596651,"domain_scores_codex":[0.9969952,0.001381575,0.00008747656,0.0002384704,0.0008487694,0.0004486031],"domain_scores_gemma":[0.9810244,0.01548857,0.001305398,0.0007650355,0.001209253,0.0002074255],"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.0006920856,0.00007483581,0.00351126,0.0001561744,0.00009455986,0.0006770031,0.0002108438,0.9253189,0.03412564,0.01770253,0.0002714121,0.01716473],"study_design_scores_gemma":[0.00007061511,0.0006622549,0.00245406,0.00003257212,0.00008404855,0.000678016,0.0001782457,0.9579591,0.02791269,0.009547904,0.0003749015,0.00004564344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.815355,0.001132753,0.1631501,0.0006860187,0.00003853154,0.00003327123,0.000179314,0.0002300083,0.019195],"genre_scores_gemma":[0.9967334,0.0002516593,0.002496519,0.00004432765,0.00002596274,0.00001175774,0.00002432284,0.00001400381,0.0003979252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002984039,"threshold_uncertainty_score":0.01578128,"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","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"F. Rajwani","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578826,0.0008735238,0.00087847,0.0009649806,0.0005111941,0.001579238,0.001449278,0.001172956,0.002589327],"category_scores_gemma":[0.009981582,0.0005190399,0.0006080663,0.001262474,0.000838513,0.003592061,0.001072001,0.00184158,0.001976958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107178,"about_ca_system_score_gemma":0.0008334075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002968966,"about_ca_topic_score_gemma":0.002981697,"domain_scores_codex":[0.9988168,0.0002970004,0.00005454545,0.0001052717,0.000626618,0.00009970883],"domain_scores_gemma":[0.9972017,0.001445878,0.0001916745,0.0004308985,0.0006704596,0.00005945472],"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.00005000804,0.00004400691,0.0008304776,0.000123129,0.00002622783,0.0001790469,0.0001950019,0.7724213,0.00305427,0.1565253,0.003673207,0.06287806],"study_design_scores_gemma":[0.000003561936,0.000006825204,0.0001007631,0.00001529928,0.000003572318,0.00009247963,0.00002415466,0.9722055,0.0007480784,0.02425301,0.002535349,0.00001142981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00440023,0.0004138068,0.990867,0.0001144842,0.00006114831,0.00002121284,0.00005785322,0.0002806111,0.003783579],"genre_scores_gemma":[0.3993341,0.003998145,0.581399,0.0003624456,0.000239251,0.0002618757,0.0005324644,0.0004917097,0.01338094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002968966,"threshold_uncertainty_score":0.008662105,"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","authors":[{"name":"Jeremiah Hu","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002575703,0.001710664,0.001282211,0.00112665,0.0007016791,0.001546884,0.0008724973,0.001407031,0.001755487],"category_scores_gemma":[0.01009603,0.0004463045,0.0005173452,0.001558281,0.001323395,0.001305193,0.001216888,0.0006976092,0.0006729208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00218404,"about_ca_system_score_gemma":0.001139211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003658494,"about_ca_topic_score_gemma":0.002478048,"domain_scores_codex":[0.9967352,0.001176302,0.0001047051,0.0002617491,0.001215827,0.0005062504],"domain_scores_gemma":[0.9903654,0.006889852,0.0007816318,0.0004497978,0.001395345,0.0001178423],"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.0004934237,0.00005039424,0.00277438,0.0001821932,0.0001257269,0.0004143363,0.0002354212,0.9212539,0.01452745,0.03406304,0.0008597001,0.02501997],"study_design_scores_gemma":[0.00002146705,0.0002224853,0.00118281,0.00002245396,0.0000678716,0.00032341,0.00004797063,0.9853511,0.00523261,0.006871901,0.0006221074,0.00003375316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3315047,0.005010128,0.6128821,0.001172236,0.00008793123,0.0001267673,0.0004822985,0.0009321995,0.04780154],"genre_scores_gemma":[0.985607,0.001118728,0.01093542,0.00006132766,0.00007475796,0.00004347244,0.0001362073,0.00004842357,0.001974623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003658494,"threshold_uncertainty_score":0.01584637,"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","authors":[{"name":"Muhammad Hanif","is_ca":true},{"name":"Masoud Ardakani","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005854992,0.0007517425,0.000446747,0.0006299549,0.0007039637,0.000921758,0.0007048774,0.0005702668,0.002426486],"category_scores_gemma":[0.003029962,0.0003143831,0.0003083513,0.0003904918,0.0007904713,0.001429156,0.00101057,0.0008838835,0.001243295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004849025,"about_ca_system_score_gemma":0.001675566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480043,"about_ca_topic_score_gemma":0.003156833,"domain_scores_codex":[0.9996308,0.00006793408,0.00003083997,0.00004260257,0.0001637849,0.00006401011],"domain_scores_gemma":[0.9983969,0.0004869996,0.0001519884,0.000325268,0.0005700777,0.00006866678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001211624,0.0002122752,0.003123742,0.0004143945,0.00008009224,0.0007590755,0.000610709,0.09945518,0.411512,0.1050782,0.002712205,0.3748306],"study_design_scores_gemma":[0.00008637858,0.0003633859,0.0005637256,0.00006197496,0.00005316644,0.0009163364,0.0001250742,0.4024084,0.5640481,0.01961438,0.01168609,0.00007304183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1273107,0.0004043401,0.8577114,0.0002844658,0.0001926197,0.0001466795,0.00009598712,0.001092231,0.01276158],"genre_scores_gemma":[0.5446912,0.000581103,0.4433029,0.0001995908,0.00006636458,0.0001135973,0.0002466891,0.0001541749,0.0106444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002426486,"threshold_uncertainty_score":0.008117378,"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","authors":[{"name":"Jae‐Mo Kang","is_ca":true},{"name":"Chang-Jae Chun","is_ca":true},{"name":"Il‐Min Kim","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000683534,0.0006338466,0.000587176,0.0002914456,0.0002655623,0.0004851907,0.001071206,0.0008518958,0.001446784],"category_scores_gemma":[0.001898799,0.0003280143,0.0004406829,0.0004516185,0.0007378715,0.001404459,0.001045345,0.0017092,0.0003783822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007212654,"about_ca_system_score_gemma":0.0009072103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003095719,"about_ca_topic_score_gemma":0.003664412,"domain_scores_codex":[0.9997441,0.00005924021,0.00001277957,0.00005468936,0.00007976569,0.00004944317],"domain_scores_gemma":[0.9994494,0.0003029706,0.00005886305,0.00006949323,0.00009816045,0.0000210362],"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.0000692545,0.00007725337,0.000386215,0.00006507491,0.0000424908,0.00004701249,0.00004118004,0.8820949,0.009679996,0.01793805,0.001172048,0.08838648],"study_design_scores_gemma":[0.000001551667,0.000006106861,0.00002337572,0.000001601863,0.000001756598,0.000005453114,0.000001239641,0.9969778,0.001075063,0.001762851,0.0001407805,0.000002394354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005259478,0.0001412856,0.9935817,0.00008652711,0.00002098914,0.000009147851,0.00001784883,0.0002209745,0.0006620769],"genre_scores_gemma":[0.7313027,0.0005730223,0.2623173,0.0002835154,0.00008396612,0.0001003604,0.0001686449,0.00009816737,0.005072278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003095719,"threshold_uncertainty_score":0.006155372,"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","authors":[{"name":"Gabi Sarkis","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613697,0.0006770597,0.000545254,0.0007770568,0.00048366,0.000975983,0.0006332914,0.000556625,0.005056612],"category_scores_gemma":[0.004988689,0.0002509948,0.0002340617,0.0006989018,0.0006489105,0.001376466,0.0006820738,0.0007638992,0.001717184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009414092,"about_ca_system_score_gemma":0.001427951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611906,"about_ca_topic_score_gemma":0.002201156,"domain_scores_codex":[0.9988542,0.0002257264,0.00006271376,0.0001215025,0.0005910693,0.0001448301],"domain_scores_gemma":[0.9966732,0.001507523,0.0001898682,0.0004880847,0.001064564,0.00007670305],"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.001913281,0.0001610349,0.004076974,0.0003745609,0.0001060938,0.000583698,0.0002573838,0.155388,0.5057895,0.04131484,0.006470132,0.2835645],"study_design_scores_gemma":[0.00008714176,0.000354806,0.001667837,0.00004083606,0.00006767256,0.0009293312,0.0000590173,0.4392343,0.5375884,0.007486468,0.01242469,0.00005959499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.307039,0.001170389,0.6523424,0.0009725309,0.0002968403,0.0002139048,0.0003714149,0.004709356,0.03288414],"genre_scores_gemma":[0.8435181,0.0005777707,0.1435969,0.0002961615,0.0001359889,0.0001024666,0.0004590733,0.0001372614,0.01117635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005056612,"threshold_uncertainty_score":0.0169161,"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","authors":[{"name":"L. Tancevski","is_ca":true},{"name":"Leslie A. Rusch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573919,0.0006541263,0.0006752171,0.0006261443,0.0006661723,0.001125189,0.000266259,0.001125568,0.0006823484],"category_scores_gemma":[0.01446787,0.0003239691,0.0001638033,0.0006366228,0.0008213053,0.001068851,0.0006884768,0.0004374491,0.0002807367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006223486,"about_ca_system_score_gemma":0.0006072385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247296,"about_ca_topic_score_gemma":0.0007157414,"domain_scores_codex":[0.9975285,0.0007606798,0.00008337253,0.0002361722,0.001011859,0.0003794394],"domain_scores_gemma":[0.9875021,0.01000408,0.0006859095,0.0005731576,0.0009790227,0.0002556448],"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.003255917,0.0002863986,0.02408281,0.0002252118,0.0001760922,0.001355579,0.0003634811,0.7029922,0.215236,0.008784037,0.0005271726,0.04271504],"study_design_scores_gemma":[0.0001381362,0.001769975,0.02083613,0.00005689334,0.0001146756,0.001190685,0.0001402139,0.8280777,0.1414735,0.005231007,0.0008196945,0.0001513099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9709292,0.0005267155,0.02465881,0.0001908358,0.00003904492,0.00001356993,0.00006965902,0.0002263073,0.003345925],"genre_scores_gemma":[0.9986721,0.00007781293,0.00102997,0.00002439744,0.0000155473,0.000002802758,0.00002144935,0.00001743773,0.0001383272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001573919,"threshold_uncertainty_score":0.008323789,"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)","authors":[{"name":"A. Alavi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006349873,0.0004097752,0.000551683,0.0004519635,0.0002685125,0.0005151817,0.0005326188,0.000646609,0.00128452],"category_scores_gemma":[0.005283651,0.0002399169,0.0002572776,0.0005982373,0.0004727668,0.0008722059,0.0007846102,0.0004845365,0.0008990933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004510003,"about_ca_system_score_gemma":0.001359286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00167504,"about_ca_topic_score_gemma":0.002599621,"domain_scores_codex":[0.9991597,0.0002707584,0.00004520191,0.00006693278,0.0003903968,0.00006692524],"domain_scores_gemma":[0.9985735,0.000714343,0.0001084455,0.0002227979,0.0003482642,0.00003255674],"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.0003196326,0.00004615903,0.001008204,0.000200573,0.00005487369,0.0001829816,0.0001571356,0.465874,0.03559039,0.09303404,0.002520397,0.4010116],"study_design_scores_gemma":[0.0000145568,0.00006295641,0.0002176451,0.00001358827,0.00000691161,0.0001063306,0.000007551567,0.9655348,0.0164001,0.01556711,0.00205592,0.00001239721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02917174,0.0004466386,0.9659673,0.0001412941,0.00005727993,0.00003493453,0.00009151289,0.0004123675,0.003676927],"genre_scores_gemma":[0.5691004,0.0007135722,0.4227801,0.0001133748,0.0000604757,0.00008120444,0.000378956,0.0001044843,0.006667476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00167504,"threshold_uncertainty_score":0.004297137,"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","authors":[{"name":"Xiaofei Dong","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102748,0.0003900833,0.0004134361,0.001008054,0.0002710083,0.0009142578,0.0002823015,0.000440138,0.001417604],"category_scores_gemma":[0.009022429,0.0002269263,0.0003096466,0.0007960207,0.0006525074,0.0009361695,0.0003729229,0.0005067081,0.0003839548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006335995,"about_ca_system_score_gemma":0.0004048414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005878211,"about_ca_topic_score_gemma":0.0002986384,"domain_scores_codex":[0.999471,0.00006142377,0.00002748196,0.0001094241,0.0002326647,0.00009794646],"domain_scores_gemma":[0.9959524,0.002384314,0.0005329319,0.0003301261,0.0006304542,0.0001698057],"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.001460671,0.00009521087,0.02908445,0.0004028128,0.0002042719,0.0009978907,0.0005224932,0.6363496,0.1304388,0.07185861,0.001414908,0.1271702],"study_design_scores_gemma":[0.00003641256,0.0005203857,0.04737996,0.00008039866,0.000125104,0.00324923,0.00009829309,0.8549764,0.05098305,0.03942955,0.002957216,0.0001641384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6521357,0.001527078,0.3348915,0.0001542349,0.00005363523,0.000032646,0.0007279197,0.0006642389,0.00981301],"genre_scores_gemma":[0.9886541,0.0004341848,0.00954485,0.00002339481,0.00003315969,0.00001923588,0.0003028592,0.0000628351,0.0009254252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001417604,"threshold_uncertainty_score":0.005433917,"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","authors":[{"name":"Hoda ShahMohammadian","is_ca":true},{"name":"Geoffrey G. Messier","is_ca":true},{"name":"Sebastian Magierowski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008371024,0.0003178471,0.0005005195,0.0003603742,0.000370519,0.0005006493,0.0005037056,0.0008056762,0.000590015],"category_scores_gemma":[0.002957965,0.0002281701,0.0002224717,0.0004435838,0.0009009114,0.001120519,0.0008574267,0.0006953888,0.0001893352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006175466,"about_ca_system_score_gemma":0.0006473606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009038101,"about_ca_topic_score_gemma":0.0006204773,"domain_scores_codex":[0.9995239,0.0001289597,0.00002145286,0.0001109981,0.0001767954,0.00003793409],"domain_scores_gemma":[0.9989074,0.0006777602,0.0001949553,0.00007436229,0.0001155343,0.00003003843],"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.0006540295,0.00007361708,0.001271612,0.0003537568,0.00006436728,0.0002583586,0.0003416117,0.6037033,0.1476179,0.1633167,0.001539109,0.08080566],"study_design_scores_gemma":[0.00003560558,0.00005832922,0.0002141197,0.000009995048,0.000008232758,0.00006717372,0.00001559385,0.9628932,0.0190276,0.01636058,0.001278867,0.00003068468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04833427,0.0005044904,0.948576,0.0002448684,0.00007730732,0.00003085084,0.00005268243,0.000264193,0.00191526],"genre_scores_gemma":[0.8542979,0.0007745259,0.1409711,0.0001202223,0.00005053207,0.00007679948,0.00006845399,0.00005112422,0.003589402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009038101,"threshold_uncertainty_score":0.00448066,"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","authors":[{"name":"You Li","is_ca":false},{"name":"Yuan Zhuang","is_ca":false},{"name":"Haiyu Lan","is_ca":true},{"name":"Qifan Zhou","is_ca":true},{"name":"Xiaoji Niu","is_ca":false},{"name":"Naser El‐Sheimy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003823703,0.0007636022,0.0006613107,0.000969637,0.0002653681,0.0004200141,0.0009891842,0.0005093982,0.000734365],"category_scores_gemma":[0.0009681678,0.0003187195,0.000469364,0.0006794442,0.0001554321,0.0006394857,0.0006891238,0.0002763175,0.0006174316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000202179,"about_ca_system_score_gemma":0.0003067109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001930192,"about_ca_topic_score_gemma":0.002930721,"domain_scores_codex":[0.999514,0.00007633703,0.00003036843,0.0001150047,0.0002072019,0.00005713096],"domain_scores_gemma":[0.9997159,0.00004471192,0.00004742523,0.0000577803,0.0001177153,0.00001648343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003258898,0.0000884887,0.005080588,0.0002295691,0.0001028249,0.0002150644,0.000129377,0.02199393,0.08978947,0.001584219,0.001246393,0.8792143],"study_design_scores_gemma":[0.0001070595,0.001014208,0.01268896,0.00006032693,0.0002230455,0.002775152,0.0001628799,0.8545957,0.1100976,0.002120402,0.01602831,0.000126369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0307351,0.0003472893,0.9660329,0.0000372797,0.00006325037,0.00005047374,0.00005056021,0.001461925,0.001221361],"genre_scores_gemma":[0.4674515,0.0002482588,0.5295368,0.00008408092,0.00005276684,0.00007162247,0.0001724153,0.0000628937,0.002319644],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001930192,"threshold_uncertainty_score":0.003837883,"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","authors":[{"name":"Xiaolu Wang","is_ca":true},{"name":"Fabrice Labeau","is_ca":true},{"name":"Lin Mei","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068124,0.001280859,0.00091488,0.001271055,0.0006568315,0.001698154,0.0009644566,0.001268665,0.01194897],"category_scores_gemma":[0.008057203,0.0003517941,0.0006284482,0.001158987,0.0008801512,0.00198505,0.0008427945,0.001293978,0.00416275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208235,"about_ca_system_score_gemma":0.0009714062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177959,"about_ca_topic_score_gemma":0.00166451,"domain_scores_codex":[0.9988525,0.0003343907,0.00006381337,0.0001023359,0.0005518399,0.00009514132],"domain_scores_gemma":[0.9962775,0.001705839,0.0004252736,0.0002878862,0.001269416,0.00003403708],"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.0001530097,0.000140889,0.0008856533,0.001117463,0.00005937503,0.0005067646,0.0005256927,0.7003961,0.0191928,0.1765595,0.01362689,0.08683588],"study_design_scores_gemma":[0.00001660746,0.00008895823,0.0005850931,0.0001794078,0.00002481745,0.000459117,0.0001002919,0.9362616,0.006379402,0.04829028,0.00755964,0.00005489387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01400504,0.003258552,0.952019,0.0006478545,0.000266729,0.0001250277,0.00066763,0.0007157888,0.02829428],"genre_scores_gemma":[0.5389808,0.01010358,0.4200649,0.0008575734,0.0004053921,0.0005628146,0.001471403,0.0008083801,0.0267452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01194897,"threshold_uncertainty_score":0.03997332,"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","authors":[{"name":"Amin Mohajer","is_ca":true},{"name":"Javad Hajipour","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003161281,0.0006247662,0.0005589502,0.0002044751,0.0003673426,0.0005485772,0.0007108559,0.0003782286,0.0008970393],"category_scores_gemma":[0.0007875822,0.0002094964,0.0002427193,0.0002232088,0.0004902137,0.000716862,0.0007019476,0.0005599679,0.00008911899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006422392,"about_ca_system_score_gemma":0.0008464907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006106594,"about_ca_topic_score_gemma":0.007406936,"domain_scores_codex":[0.9998293,0.00003330757,0.000006017097,0.00004133982,0.00003084012,0.00005923023],"domain_scores_gemma":[0.9997821,0.00009329058,0.00002353722,0.00002173311,0.00003905894,0.00004029688],"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.0001308864,0.00004569541,0.0009998084,0.0000342534,0.00002081058,0.0001466297,0.00006533515,0.9533538,0.00520635,0.007532642,0.0009286357,0.03153518],"study_design_scores_gemma":[0.000001964102,0.00001015006,0.00005314762,0.000001161609,0.000002059356,0.000007000433,0.000005687741,0.9984988,0.0003085284,0.00102822,0.00008164552,0.000001738336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357211,0.0004527965,0.8582697,0.0002618399,0.00007710093,0.00004710991,0.00004954102,0.0003831738,0.004737654],"genre_scores_gemma":[0.9791965,0.00007111891,0.01992056,0.00005574383,0.00001156301,0.00001604175,0.00002062693,0.00002173038,0.0006861616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006106594,"threshold_uncertainty_score":0.01214206,"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","authors":[{"name":"Liang Yang","is_ca":false},{"name":"Jianchao Chen","is_ca":false},{"name":"Mazen O. Hasna","is_ca":false},{"name":"Hong‐Chuan Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948453,0.0005893976,0.0005934374,0.000354592,0.0004659678,0.0006082325,0.0004184196,0.0005775589,0.0006514924],"category_scores_gemma":[0.002552417,0.0001535177,0.0002086872,0.0005245811,0.0005670938,0.0005869046,0.0006033265,0.0003018663,0.000193777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007315703,"about_ca_system_score_gemma":0.0004531693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002956331,"about_ca_topic_score_gemma":0.001917335,"domain_scores_codex":[0.9993438,0.0002691962,0.00004923116,0.00007180093,0.0001316173,0.0001342889],"domain_scores_gemma":[0.9972887,0.001766123,0.0003357308,0.0001731839,0.0003722017,0.0000640103],"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.0004572679,0.00005466676,0.004758669,0.0001522801,0.00007359275,0.0005499282,0.0002029639,0.9583097,0.0147261,0.005347545,0.0006286995,0.01473856],"study_design_scores_gemma":[0.00001489505,0.0002085209,0.001676582,0.00001137456,0.00003506526,0.0002548541,0.00009079256,0.9929309,0.003151024,0.001361929,0.0002439126,0.00002013344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.865438,0.002150076,0.1247632,0.0004148694,0.00005297727,0.00003694306,0.0002293334,0.0002747042,0.006639695],"genre_scores_gemma":[0.9985237,0.0001568848,0.001051864,0.00001195116,0.000006654534,0.000005468825,0.00003061077,0.000003584566,0.0002093435],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002956331,"threshold_uncertainty_score":0.00587827,"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","authors":[{"name":"Tao Cui","is_ca":true},{"name":"Chintha Tellambura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223866,0.0004120886,0.0003550864,0.0003288133,0.0001934239,0.0004802554,0.0003567135,0.0003577953,0.0004576964],"category_scores_gemma":[0.003977214,0.0002467414,0.0001867156,0.000417718,0.0002636213,0.0008041008,0.0004097629,0.0004317198,0.000283546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003797184,"about_ca_system_score_gemma":0.0005453881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006506692,"about_ca_topic_score_gemma":0.0006891008,"domain_scores_codex":[0.9996593,0.0001124307,0.00001353686,0.00005832973,0.0001314814,0.00002490005],"domain_scores_gemma":[0.9994836,0.0003062829,0.00005492555,0.00005696139,0.0000851884,0.00001298821],"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.0002883212,0.0000444982,0.001813651,0.0001245766,0.00005575271,0.0001386536,0.00007305988,0.4759451,0.04012916,0.0638864,0.001360386,0.4161405],"study_design_scores_gemma":[0.0000064774,0.00002089605,0.000293064,0.000007453714,0.000005856807,0.00006577645,0.000004368644,0.9824827,0.008732815,0.00727102,0.001099526,0.00001016308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007854449,0.0002159286,0.9914303,0.00003408431,0.00001388935,0.000005681526,0.00001750329,0.00008639601,0.0003418572],"genre_scores_gemma":[0.5326368,0.0009177575,0.4637922,0.00008120749,0.0001101459,0.00007238687,0.0002393874,0.0000955225,0.002054507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0006506692,"threshold_uncertainty_score":0.002762675,"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","authors":[{"name":"Mohammadreza A. Kashani","is_ca":false},{"name":"Mohammad M. Rad","is_ca":true},{"name":"Majid Safari","is_ca":true},{"name":"Murat Uysal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004485182,0.0005985168,0.0004813971,0.0002013656,0.0005901853,0.0006347567,0.0005154317,0.0006140252,0.0007739419],"category_scores_gemma":[0.001054423,0.0001754795,0.0002498985,0.000252397,0.0005885112,0.000842919,0.0005525287,0.0003284286,0.0001794924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004141311,"about_ca_system_score_gemma":0.0004027913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001124831,"about_ca_topic_score_gemma":0.002061837,"domain_scores_codex":[0.999757,0.00006945153,0.000008571478,0.00003907435,0.00008700745,0.00003893664],"domain_scores_gemma":[0.999221,0.0004428845,0.0001493959,0.00005653059,0.0001036053,0.000026629],"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.001258288,0.0003293201,0.007906627,0.0006356877,0.0002265469,0.001912481,0.0006971072,0.5034129,0.3496788,0.07169109,0.001161477,0.06108962],"study_design_scores_gemma":[0.00004305108,0.0004651069,0.001022359,0.00001223995,0.00007617313,0.0004925134,0.0000916742,0.9597669,0.03101275,0.006011987,0.0009645054,0.00004081833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8309012,0.0008705796,0.1616351,0.0002451128,0.00003968998,0.00004361396,0.0001152473,0.0001256674,0.006023837],"genre_scores_gemma":[0.9872307,0.00015297,0.01148677,0.0000164455,0.00001052058,0.000007415146,0.00001458489,0.000003399217,0.001077261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001124831,"threshold_uncertainty_score":0.003004789,"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","authors":[{"name":"Xianglai Liao","is_ca":false},{"name":"Xin Hu","is_ca":false},{"name":"Zhijun Liu","is_ca":false},{"name":"Shijun Ma","is_ca":false},{"name":"Lexi Xu","is_ca":false},{"name":"Xiuhua Li","is_ca":false},{"name":"Weidong Wang","is_ca":false},{"name":"Fadhel M. Ghannouchi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697918,0.0004767832,0.0006350266,0.0003810577,0.0007003329,0.001144849,0.001431885,0.0008442341,0.003220683],"category_scores_gemma":[0.008089964,0.0002700568,0.0006166524,0.0002861859,0.0013907,0.001517294,0.001839783,0.001672952,0.0003487095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307995,"about_ca_system_score_gemma":0.001947508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005671441,"about_ca_topic_score_gemma":0.002788071,"domain_scores_codex":[0.9989852,0.0002473792,0.00004870336,0.0002488785,0.0003225917,0.0001471219],"domain_scores_gemma":[0.9968237,0.00146029,0.0003673942,0.0003983831,0.000727828,0.0002224052],"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.0001313333,0.00009592583,0.001712614,0.0001068627,0.00004326702,0.0001623379,0.0001467053,0.7914838,0.003316133,0.1529037,0.002065322,0.04783209],"study_design_scores_gemma":[0.000009442257,0.00001995935,0.00007975726,0.000003529087,0.000003512011,0.00001064807,0.000006829496,0.9897256,0.0002764634,0.009553728,0.0003072409,0.000003141369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01833154,0.0001236991,0.9728846,0.0005978983,0.00006085659,0.00005748389,0.00002937113,0.0002794452,0.007635121],"genre_scores_gemma":[0.9086251,0.0001208949,0.08826888,0.0002093451,0.00004080523,0.0001354218,0.00004620708,0.00006325036,0.002490043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005671441,"threshold_uncertainty_score":0.0142681,"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","authors":[{"name":"Raed Mesleh","is_ca":false},{"name":"Salama Ikki","is_ca":true},{"name":"Mohammed M. Alwakeel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002318292,0.001614575,0.001235846,0.001017549,0.0006931644,0.001727698,0.0009080293,0.001321854,0.002368392],"category_scores_gemma":[0.007867679,0.0005195591,0.0005172776,0.001078448,0.001319645,0.001823291,0.00153782,0.0007901163,0.0006896757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003016,"about_ca_system_score_gemma":0.001332765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003465047,"about_ca_topic_score_gemma":0.002083487,"domain_scores_codex":[0.9974902,0.000895575,0.0000913651,0.0002492601,0.0008339151,0.0004397595],"domain_scores_gemma":[0.9942243,0.003783768,0.0006496654,0.0003207644,0.0009228871,0.00009872153],"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.0005354565,0.00004669317,0.001595227,0.0001991599,0.00009191542,0.000415316,0.0001643314,0.9056155,0.01484014,0.05903323,0.0008821482,0.01658079],"study_design_scores_gemma":[0.0000142575,0.0001168023,0.000289256,0.00001336742,0.00002630349,0.0001755293,0.00002966038,0.9900372,0.002726134,0.006117944,0.0004316056,0.00002198378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2762856,0.005781771,0.6891063,0.001257659,0.0001596759,0.0001136802,0.0003464695,0.0006381995,0.02631057],"genre_scores_gemma":[0.9871413,0.001099063,0.009386621,0.00005663444,0.00005670875,0.00004039564,0.00007696342,0.00003221416,0.002110147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003465047,"threshold_uncertainty_score":0.01453292,"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","authors":[{"name":"M Yazdani","is_ca":true},{"name":"Saied Hemati","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831518,0.001059264,0.001095091,0.001486917,0.0005635429,0.001171757,0.001602452,0.001347301,0.001200652],"category_scores_gemma":[0.01688208,0.0006568609,0.0005144454,0.001563611,0.001162394,0.003160049,0.001975455,0.001399828,0.0004345176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009453902,"about_ca_system_score_gemma":0.001157468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006826079,"about_ca_topic_score_gemma":0.0048608,"domain_scores_codex":[0.9986607,0.0005704973,0.00006039555,0.0001980091,0.000353736,0.0001566942],"domain_scores_gemma":[0.9900287,0.007414618,0.0004507866,0.0008794573,0.001062854,0.0001634686],"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.000210103,0.00004462094,0.001062643,0.0001185293,0.00006771889,0.00009306952,0.0001626209,0.8294926,0.00275006,0.04208177,0.002254423,0.1216618],"study_design_scores_gemma":[0.00001174382,0.00001549083,0.00006342554,0.000005474106,0.000007962642,0.00001186955,0.000006343386,0.9783546,0.0007800338,0.02036589,0.0003715977,0.000005579651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03179466,0.0004694843,0.9647919,0.0004205979,0.00005459741,0.00002906765,0.00006052535,0.0006898075,0.001689433],"genre_scores_gemma":[0.6695341,0.001045727,0.3250683,0.000378344,0.0001692565,0.0001297162,0.0003020335,0.0001871465,0.003185416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006826079,"threshold_uncertainty_score":0.01357269,"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","authors":[{"name":"Shree Krishna Sharma","is_ca":true},{"name":"Xianbin Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496021,0.0006188281,0.001177263,0.0003460187,0.0006788811,0.000696517,0.001483489,0.0008548631,0.001135029],"category_scores_gemma":[0.00570555,0.0003046891,0.0003376263,0.0005217124,0.001379532,0.001057959,0.001269788,0.0009842569,0.0001388004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009972664,"about_ca_system_score_gemma":0.001304905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966135,"about_ca_topic_score_gemma":0.001886496,"domain_scores_codex":[0.9990855,0.0003123772,0.0000352514,0.0001714835,0.0002055863,0.0001897501],"domain_scores_gemma":[0.994915,0.003696895,0.0003917134,0.0002201496,0.0005752491,0.0002009507],"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.0001551951,0.0001098745,0.000671225,0.00005010731,0.00002693884,0.0000719097,0.00007901857,0.9552199,0.002148196,0.01176134,0.0006767546,0.02902965],"study_design_scores_gemma":[0.000006533751,0.00002158824,0.00003732259,0.000001318706,0.000002314072,0.000006646245,0.000004691029,0.9972008,0.0001978642,0.0024588,0.0000594647,0.000002606701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03348449,0.0002284084,0.9645631,0.0001839119,0.0000364263,0.00004347037,0.00001275656,0.0001360536,0.001311356],"genre_scores_gemma":[0.9622783,0.0001147594,0.03640585,0.0001171649,0.00003264577,0.00006291628,0.00001726366,0.00001759091,0.0009533915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002966135,"threshold_uncertainty_score":0.01320034,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001803528,0.001472537,0.001274476,0.0007465858,0.0007945793,0.001802019,0.002137024,0.002097015,0.007600638],"category_scores_gemma":[0.004124979,0.0007271306,0.001143779,0.001091009,0.001614584,0.003418644,0.002206202,0.003629319,0.0007069532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002491374,"about_ca_system_score_gemma":0.001602398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007894695,"about_ca_topic_score_gemma":0.007123213,"domain_scores_codex":[0.9987452,0.0004567983,0.00005166293,0.0002509069,0.0002815501,0.0002137977],"domain_scores_gemma":[0.9980677,0.001370953,0.0001463855,0.0000857529,0.0001903081,0.0001388704],"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.00005121685,0.00004461066,0.0001924909,0.00009671466,0.00001523017,0.0001686282,0.00011061,0.8675783,0.0008176129,0.1188731,0.003141778,0.008909704],"study_design_scores_gemma":[0.00001218439,0.00001841346,0.0000386961,0.00001078833,0.000004957202,0.00002234696,0.00002352633,0.9642963,0.000105921,0.03411711,0.001343665,0.000006165397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0191934,0.0007427421,0.960418,0.001473201,0.0001110542,0.0001192593,0.0002895076,0.0001954315,0.01745741],"genre_scores_gemma":[0.738898,0.002442655,0.2155964,0.0006518012,0.0003436579,0.0008289612,0.0008948116,0.00032416,0.0400195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007894695,"threshold_uncertainty_score":0.02542669,"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","authors":[{"name":"Bo Hu","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002808359,0.0007437982,0.0009512917,0.001121533,0.0003606175,0.0009067917,0.001256509,0.001011748,0.001101516],"category_scores_gemma":[0.01387035,0.0003905488,0.0003874975,0.0008463218,0.001018331,0.002104785,0.0009565464,0.0007726373,0.0003732409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009467242,"about_ca_system_score_gemma":0.0006685099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001346502,"about_ca_topic_score_gemma":0.0008370421,"domain_scores_codex":[0.9975237,0.0007202287,0.0001074804,0.0001689623,0.001297076,0.000182446],"domain_scores_gemma":[0.9935812,0.004132873,0.0003951821,0.0008932291,0.0009494402,0.00004815547],"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.000240155,0.0000302501,0.001059564,0.000167748,0.00006718655,0.0002201177,0.0001719979,0.8904068,0.01144328,0.04122714,0.0003459932,0.05461976],"study_design_scores_gemma":[0.000003629267,0.00002319078,0.0002052015,0.000007191283,0.00000622948,0.0001060828,0.000007666258,0.9928161,0.002473957,0.004208826,0.000132916,0.000008980381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03960446,0.0008294929,0.9568887,0.00008403067,0.00003175377,0.00001977981,0.00004798615,0.0003733557,0.002120371],"genre_scores_gemma":[0.8936524,0.0007958062,0.1038017,0.0000684,0.00005363358,0.00005365931,0.00008259637,0.00006779642,0.001423961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002808359,"threshold_uncertainty_score":0.01485223,"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","authors":[{"name":"Özgür Ekici","is_ca":true},{"name":"Abbas Yongaçoğlu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002598969,0.001140457,0.0007517114,0.0009466458,0.001242542,0.001623078,0.001041981,0.001275571,0.001307161],"category_scores_gemma":[0.009416165,0.000363098,0.0003232401,0.001180565,0.00176379,0.001812477,0.001043406,0.001023856,0.0004106287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002116209,"about_ca_system_score_gemma":0.001281112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008022767,"about_ca_topic_score_gemma":0.003342146,"domain_scores_codex":[0.9975781,0.0005629334,0.000126003,0.0003307908,0.0007606501,0.0006415513],"domain_scores_gemma":[0.9932365,0.003390676,0.0005692238,0.0008895331,0.001748797,0.0001652495],"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.001596775,0.0005148771,0.01066967,0.0002837459,0.0001327607,0.0006145953,0.0006454268,0.823593,0.04759318,0.02558461,0.004071687,0.08469972],"study_design_scores_gemma":[0.00002761346,0.0003687311,0.002956311,0.00002537915,0.00005028432,0.0002185272,0.000101887,0.9711583,0.0203871,0.003968686,0.0006916882,0.00004550064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8677306,0.001927798,0.1052808,0.000838658,0.0002560012,0.00008426267,0.0003529113,0.002248026,0.02128106],"genre_scores_gemma":[0.9960948,0.0001853618,0.002509101,0.00003002146,0.00002137617,0.00002095216,0.0000800725,0.00002733673,0.001030976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008022767,"threshold_uncertainty_score":0.01595211,"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","authors":[{"name":"Julian Cheng","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906684,0.000922012,0.0009997407,0.00116293,0.0002394678,0.0009233641,0.0008534738,0.0006888756,0.001659198],"category_scores_gemma":[0.01283321,0.0002638167,0.0004799039,0.001391934,0.0005472002,0.001955291,0.0008458651,0.001035669,0.0005665364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005465775,"about_ca_system_score_gemma":0.0007350893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007623487,"about_ca_topic_score_gemma":0.0008749856,"domain_scores_codex":[0.9990374,0.0004222284,0.00004771786,0.0001069535,0.0003042119,0.00008157256],"domain_scores_gemma":[0.9962063,0.00227903,0.0004816316,0.0005057773,0.0004720377,0.00005514294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002776217,0.00004313048,0.002488981,0.0003938929,0.0001973251,0.0001374818,0.0001168806,0.5053846,0.01662929,0.1592898,0.004239589,0.3108014],"study_design_scores_gemma":[0.00002937693,0.00006474421,0.001234432,0.0000493025,0.00006084604,0.0002346915,0.00002265944,0.9343926,0.006210062,0.0525721,0.005072079,0.00005706632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006122173,0.0007739306,0.9919639,0.00006128195,0.00003748564,0.00001721619,0.00006598431,0.0002174406,0.000740695],"genre_scores_gemma":[0.3611121,0.003660825,0.6306258,0.00014286,0.0004002616,0.0001658998,0.000620256,0.0001498046,0.003122154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001906684,"threshold_uncertainty_score":0.01008362,"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","authors":[{"name":"Meng Xu","is_ca":false},{"name":"Shun Zhang","is_ca":false},{"name":"Caijun Zhong","is_ca":false},{"name":"Jianpeng Ma","is_ca":false},{"name":"Octavia A. Dobre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001810029,0.0004095151,0.0002794059,0.0001537235,0.0001421152,0.0002608832,0.0006691696,0.000410633,0.001564437],"category_scores_gemma":[0.0004824814,0.0001758777,0.0003206411,0.0002044198,0.0002814045,0.0006109466,0.0004646064,0.0006529587,0.0002271336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006473659,"about_ca_system_score_gemma":0.0005460458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004928255,"about_ca_topic_score_gemma":0.005757615,"domain_scores_codex":[0.9999241,0.000009288862,0.00000371939,0.00001908616,0.00002730024,0.00001650549],"domain_scores_gemma":[0.9998989,0.00003666356,0.00001297466,0.0000117977,0.00003159388,0.000008079542],"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.00007578629,0.0000380639,0.000899495,0.00007907487,0.00003075239,0.0001459834,0.00004733562,0.9055887,0.02309566,0.0178491,0.001433472,0.05071652],"study_design_scores_gemma":[9.23095e-7,0.000005291143,0.00002830408,0.000001542912,0.000001849768,0.000007006545,0.000001154172,0.9982058,0.0009481116,0.0005713858,0.000227107,0.000001579296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0513173,0.0004838302,0.9386969,0.0002692874,0.0001345552,0.00003021941,0.0001124667,0.0006644135,0.008291087],"genre_scores_gemma":[0.8730208,0.0004248176,0.1171892,0.000197457,0.00003877014,0.00006180155,0.0001927924,0.00005867816,0.008815644],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004928255,"threshold_uncertainty_score":0.009799123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}