{"meta":{"query_hash":"65fb48c233b2","filters":{"venue":"IEEE Signal Processing Letters"},"cohort_total":157,"direct_labels_cover":0,"predictions_cover":157,"exported":157,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/65fb48c233b2","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Signal+Processing+Letters"},"results":[{"id":"W1550510559","doi":"10.1109/lsp.2015.2447279","title":"An Implicit Contour Morphing Framework Applied to Computer-Aided Severe Weather Forecasting","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environment and Climate Change Canada","funders":"","keywords":"Morphing; Computer science; Artificial intelligence; Representation (politics); Computer vision; Matching (statistics); Active contour model; Pattern recognition (psychology); Image (mathematics); Mathematics; Image segmentation","score_opus":0.038967805837775205,"score_gpt":0.28749968803431003,"score_spread":0.24853188219653483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550510559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056548286,0.000030037885,0.93977195,0.002352356,0.00033323668,0.00021629717,0.0000010207369,0.00045572774,0.0002910913],"genre_scores_gemma":[0.5721629,9.909312e-8,0.41205046,0.015322277,0.00041630544,0.000011791188,9.1687457e-7,0.000027470722,0.000007768086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763626,0.00005786593,0.00036408953,0.0007751385,0.0005191259,0.0006474978],"domain_scores_gemma":[0.99863476,0.00009852036,0.0001901731,0.00045912407,0.0001431017,0.00047432582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044849096,0.00031246472,0.0003113355,0.00018376169,0.0003141253,0.0008088948,0.0011081938,0.00007499961,0.0000053709578],"category_scores_gemma":[0.000024419625,0.0002988209,0.000057234425,0.0005631123,0.000048295984,0.0013124999,0.00016435469,0.00038708653,0.00005372331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032166343,0.000069169946,0.00024276336,0.00003747655,0.000015112467,0.0000743679,0.0057295975,0.08452445,0.13214983,0.00047647062,0.0025696508,0.77407897],"study_design_scores_gemma":[0.00069597154,0.00013861428,0.00011935161,0.00037017078,0.000009226237,0.000108605134,0.00027871836,0.98643756,0.005626379,0.004393257,0.0010632558,0.00075890176],"about_ca_topic_score_codex":0.000017012775,"about_ca_topic_score_gemma":8.904732e-7,"teacher_disagreement_score":0.9019131,"about_ca_system_score_codex":0.0001172853,"about_ca_system_score_gemma":0.00009268591,"threshold_uncertainty_score":0.9999464},"labels":[],"label_agreement":null},{"id":"W1644173899","doi":"10.1109/lsp.2015.2487369","title":"A Patch-Structure Representation Method for Quality Assessment of Contrast Changed Images","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":426,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Contrast (vision); Artificial intelligence; Computer science; Image quality; Representation (politics); Quality (philosophy); Pattern recognition (psychology); Computer vision; Perception; Feature (linguistics); Image (mathematics)","score_opus":0.11060641191341014,"score_gpt":0.4258384142188925,"score_spread":0.3152320023054824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644173899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014039694,0.00007834989,0.97799313,0.007058817,0.00023897359,0.00038557517,0.000028109127,0.00008785777,0.000089489244],"genre_scores_gemma":[0.6421089,6.325378e-7,0.35606936,0.0015647636,0.00017700909,0.0000402641,0.000011422957,0.000010770529,0.000016877422],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99762875,0.00042633968,0.000517926,0.0004875486,0.0006193868,0.00032005072],"domain_scores_gemma":[0.9983722,0.00027208892,0.000491075,0.00034272662,0.00040733552,0.00011455913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015419638,0.00019004523,0.00036848107,0.000111511305,0.0001221538,0.00024786196,0.00052919873,0.000064229505,0.000003408335],"category_scores_gemma":[0.000050422743,0.0001727878,0.000106272986,0.0003112759,0.00007138118,0.0008899,0.00006252936,0.00015891953,6.8520944e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008237656,0.0001601314,0.001044369,0.0005247266,0.00008373125,0.00002071292,0.0043706754,0.001826448,0.7915007,0.0009927776,0.006398945,0.19299443],"study_design_scores_gemma":[0.004639355,0.00041440723,0.0040945783,0.00026497664,0.00009744119,0.000040833915,0.0010044682,0.30104518,0.67674124,0.00995408,0.00082,0.00088339666],"about_ca_topic_score_codex":0.0001998647,"about_ca_topic_score_gemma":0.000008400884,"teacher_disagreement_score":0.6280692,"about_ca_system_score_codex":0.00010112092,"about_ca_system_score_gemma":0.0002703302,"threshold_uncertainty_score":0.7046082},"labels":[],"label_agreement":null},{"id":"W1851080149","doi":"10.1109/lsp.2015.2461026","title":"Robust Texture Classification by Aggregating Pixel-Based LBP Statistics","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Local binary patterns; Discriminative model; Artificial intelligence; Histogram; Pixel; Pattern recognition (psychology); Robustness (evolution); Contextual image classification; Image texture; Computer science; Mathematics; Computer vision; Image segmentation; Image (mathematics)","score_opus":0.05884349942968492,"score_gpt":0.26493486036786246,"score_spread":0.20609136093817754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851080149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070662104,0.00018304486,0.99199545,0.0059713493,0.00013441879,0.00015525111,0.0000118119815,0.0005403361,0.00030169825],"genre_scores_gemma":[0.8061612,0.0000020678985,0.18901275,0.0044503585,0.0001350746,0.000031194246,0.000035396417,0.000025552477,0.00014637997],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810785,0.0001044574,0.00035132197,0.00049125217,0.00060554344,0.00033956443],"domain_scores_gemma":[0.9987186,0.000081787555,0.00035309762,0.00033027568,0.00033762516,0.00017858234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004715043,0.00021732996,0.00017324646,0.000113784976,0.00022878192,0.0005488906,0.0007544598,0.000099100434,0.0000049951445],"category_scores_gemma":[0.00006423642,0.00020256288,0.00004158471,0.00056786224,0.00014588937,0.0006771689,0.000033513214,0.00028595224,0.000038550945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141871815,0.000086466855,0.000101272955,0.000082330545,0.0000076225,0.000009961137,0.00034965065,0.00031648192,0.5395025,0.000460459,0.06764278,0.39142627],"study_design_scores_gemma":[0.00048395808,0.00009540127,0.0001026962,0.0001453271,0.000017184906,0.000012502227,0.00006532951,0.82029223,0.16856465,0.0009774321,0.008710249,0.0005330531],"about_ca_topic_score_codex":0.000007731585,"about_ca_topic_score_gemma":5.805094e-7,"teacher_disagreement_score":0.81997573,"about_ca_system_score_codex":0.00015931092,"about_ca_system_score_gemma":0.00027616366,"threshold_uncertainty_score":0.8260274},"labels":[],"label_agreement":null},{"id":"W1966102612","doi":"10.1109/lsp.2011.2177086","title":"Compressed Sensing With Nonlinear Analog Mapping in a Noisy Environment","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Compressed sensing; Computer science; Nonlinear system; Nonlinear distortion; Distortion (music); SIGNAL (programming language); Noise (video); Noise measurement; Signal reconstruction; Analog signal; Signal-to-noise ratio (imaging); Channel (broadcasting); Algorithm; Signal processing; Artificial intelligence; Noise reduction; Digital signal processing; Telecommunications; Bandwidth (computing); Image (mathematics)","score_opus":0.02492894682055673,"score_gpt":0.18574376289286823,"score_spread":0.1608148160723115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966102612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5465783,0.00012897902,0.45147994,0.0000723915,0.000050159415,0.00014900757,0.0000015011472,0.0005073441,0.0010324267],"genre_scores_gemma":[0.92370516,0.0000069883217,0.07557146,0.0005598775,0.00008653076,0.000005039007,0.00000323827,0.000057945294,0.0000037814493],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00002986814,0.00025708167,0.00028418712,0.00020785905,0.00038955058],"domain_scores_gemma":[0.99964213,0.000020653386,0.00006233581,0.00019190833,0.000017964727,0.00006498309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009455761,0.00025659753,0.00024889785,0.00021794211,0.00007295247,0.000051331306,0.00015504601,0.00006994144,0.000014847556],"category_scores_gemma":[0.0000012155654,0.0002435007,0.000038663835,0.00020525338,0.000102537815,0.00018383273,0.000019365018,0.00030040555,0.000011385258],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051020033,0.00006353664,0.0015401444,0.000115644616,0.00006132052,0.00058820227,0.0026864174,0.06571863,0.89290494,0.0000024260646,0.00045984355,0.035807885],"study_design_scores_gemma":[0.0007260175,0.00006634253,0.0026767545,0.0010946151,0.00003759146,0.000089898596,0.0001799774,0.6220217,0.37118858,0.00011362588,0.0009282114,0.00087671494],"about_ca_topic_score_codex":0.00006196352,"about_ca_topic_score_gemma":0.00000819944,"teacher_disagreement_score":0.556303,"about_ca_system_score_codex":0.000077112,"about_ca_system_score_gemma":0.00001368028,"threshold_uncertainty_score":0.99296707},"labels":[],"label_agreement":null},{"id":"W1970225942","doi":"10.1109/lsp.2013.2260823","title":"An Approximate ML Estimator for the Location Parameter of the Generalized Gaussian Distribution With <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$p=5$</tex></formula>","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Mathematics; Estimation theory; Applied mathematics; Gaussian; Notation; Distribution (mathematics); Statistics; Combinatorics; Algorithm; Discrete mathematics; Mathematical analysis; Arithmetic; Physics","score_opus":0.0176814643939917,"score_gpt":0.2643202399608761,"score_spread":0.2466387755668844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970225942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13480763,0.00023651231,0.8592655,0.0035262343,0.000384258,0.0014870728,0.00003243147,0.00020372221,0.0000566253],"genre_scores_gemma":[0.8486055,0.000005259086,0.14809091,0.0023455806,0.00033055033,0.00031244013,0.000105231615,0.00008145233,0.00012305196],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995355,0.00036362896,0.0010575996,0.0010003739,0.001187796,0.0010355812],"domain_scores_gemma":[0.99612534,0.000519381,0.0009908116,0.0012162715,0.000918719,0.00022949101],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015274094,0.00068588415,0.00063583825,0.0001935395,0.0013236945,0.001247773,0.0018827774,0.00024244947,0.000015118499],"category_scores_gemma":[0.00016280875,0.0004245557,0.0002836056,0.0012169981,0.00046251653,0.0027431468,0.0001325609,0.00040985458,0.00002148079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043203952,0.00036537866,0.00014499288,0.0006771842,0.00020605893,0.000012024318,0.0023931826,0.062549144,0.76960826,0.006384437,0.003799312,0.15342799],"study_design_scores_gemma":[0.0019792847,0.00028350402,0.0016922962,0.0003429365,0.00017679375,0.00005700703,0.000026434223,0.9176811,0.07282436,0.0028540252,0.001372023,0.000710258],"about_ca_topic_score_codex":0.00005130428,"about_ca_topic_score_gemma":0.000016058826,"teacher_disagreement_score":0.8551319,"about_ca_system_score_codex":0.00021962795,"about_ca_system_score_gemma":0.0003836104,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W1972011722","doi":"10.1109/lsp.2010.2092427","title":"Performance Analysis of Relay Selection With Feedback Delay and Channel Estimation Errors","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Channel state information; Computer science; Relay channel; Selection (genetic algorithm); Channel (broadcasting); Bit error rate; Cooperative diversity; Control theory (sociology); Telecommunications; Fading; Wireless; Artificial intelligence; Power (physics)","score_opus":0.016057965101815973,"score_gpt":0.24338001800869338,"score_spread":0.2273220529068774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972011722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57093495,0.000021058886,0.4283428,0.0005604248,0.000024644485,0.000039323968,1.5630586e-7,0.000036561254,0.000040067927],"genre_scores_gemma":[0.9730106,0.000013217331,0.026559701,0.00036604184,0.00002110146,0.000007583955,0.0000022369964,0.000006025673,0.0000134766415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992619,0.00003893203,0.00017146705,0.00021997129,0.00017286211,0.0001348739],"domain_scores_gemma":[0.9994421,0.000040349878,0.00016042864,0.00017819236,0.00013534559,0.000043612134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025601193,0.00010320752,0.00014655113,0.0002551787,0.000247856,0.00010075694,0.00027121048,0.000035528996,0.000004900237],"category_scores_gemma":[0.0000060934462,0.00008730172,0.000025574485,0.0013421455,0.00009449319,0.0006161488,0.000035341236,0.00021367529,0.000001230389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000386018,0.00005851359,0.010387817,0.0000705486,0.00019486947,0.0000016704081,0.003565324,0.45503724,0.27087006,0.00014493975,0.00014882053,0.25948158],"study_design_scores_gemma":[0.00012988043,0.00004256391,0.013630071,0.000040435465,0.00006500636,0.000009103604,0.000006884637,0.9791645,0.0067676455,0.0000036088356,0.000024697552,0.000115625415],"about_ca_topic_score_codex":0.00000533412,"about_ca_topic_score_gemma":0.000043371503,"teacher_disagreement_score":0.52412724,"about_ca_system_score_codex":0.00001540474,"about_ca_system_score_gemma":0.000037363174,"threshold_uncertainty_score":0.3560061},"labels":[],"label_agreement":null},{"id":"W1981028967","doi":"10.1109/lsp.2015.2426654","title":"Compressed Sensing with Non-Gaussian Noise and Partial Support Information","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gaussian noise; Computer science; Noise (video); Compressed sensing; Gaussian; Noise measurement; Artificial intelligence; Noise reduction; Physics; Image (mathematics)","score_opus":0.01373653777517439,"score_gpt":0.20786002746354335,"score_spread":0.19412348968836896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981028967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43033662,0.00003254339,0.56688124,0.00032870515,0.00012291415,0.0001489291,0.0000023671303,0.0006935706,0.0014531395],"genre_scores_gemma":[0.9915444,0.0000016411399,0.0072911107,0.00097444037,0.00014106357,0.000003670129,0.000010259751,0.000029673301,0.000003687172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991382,0.000015128526,0.00020411218,0.00013566426,0.00023776003,0.00026915676],"domain_scores_gemma":[0.99958825,0.0000129144955,0.00006464813,0.00012240633,0.00007539807,0.000136411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010018112,0.00019641974,0.00018000885,0.00009052509,0.00008735073,0.00022134479,0.00008036557,0.00006074482,0.0000023574135],"category_scores_gemma":[0.0000029261696,0.00017519678,0.000019116418,0.00013141603,0.00009210933,0.0007518099,0.000014990428,0.00017851486,0.00001104473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031836718,0.000037744183,0.00093373255,0.00039898205,0.00013716739,0.00026384764,0.008782258,0.22551157,0.512541,0.000012767944,0.05563029,0.19543228],"study_design_scores_gemma":[0.0010375538,0.00012233054,0.00034357034,0.0003521764,0.000058904385,0.00016690276,0.00020799546,0.7559606,0.23642741,0.000051136765,0.0046658237,0.0006056063],"about_ca_topic_score_codex":0.000022789847,"about_ca_topic_score_gemma":0.000001565,"teacher_disagreement_score":0.56120783,"about_ca_system_score_codex":0.000038311755,"about_ca_system_score_gemma":0.000038825252,"threshold_uncertainty_score":0.7144317},"labels":[],"label_agreement":null},{"id":"W1981093646","doi":"10.1109/lsp.2010.2096466","title":"Joint Relay Selection and Power Allocation for Two-Way Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Relay; Maximization; Transceiver; Selection (genetic algorithm); Computer science; Transmitter power output; Relay channel; Signal-to-noise ratio (imaging); Power (physics); Channel (broadcasting); Mathematical optimization; Joint (building); Control theory (sociology); Mathematics; Topology (electrical circuits); Telecommunications; Wireless; Transmitter; Engineering","score_opus":0.022019181504354182,"score_gpt":0.2610998891457004,"score_spread":0.23908070764134626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981093646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11028167,0.00017546928,0.8829154,0.005809604,0.0003539736,0.00020382457,2.1068611e-7,0.00015448351,0.000105399784],"genre_scores_gemma":[0.96034175,0.000015772945,0.03621256,0.0030864868,0.00021966535,0.00004778605,0.000002885895,0.000016656299,0.00005642441],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989062,0.000073787385,0.00024350922,0.0003711946,0.00014559846,0.00025970957],"domain_scores_gemma":[0.9992406,0.00010011191,0.00014650353,0.00024940431,0.00018183255,0.000081541315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059455924,0.00015160596,0.00013291604,0.00009753829,0.00055644946,0.00037965336,0.00035369387,0.00007138895,0.000008139936],"category_scores_gemma":[0.000026844522,0.00014545968,0.000042503372,0.00033663635,0.000067058834,0.0006106315,0.000067461115,0.00041537848,0.0000039192123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018152565,0.000040651714,0.00014969829,0.000020335925,0.000017063103,0.0000011743708,0.0009906687,0.030605873,0.748997,0.0027130311,0.0040184837,0.2124279],"study_design_scores_gemma":[0.00041286388,0.00005377464,0.0005647971,0.00005705141,0.000008562259,0.000023878636,0.0000063201524,0.98535126,0.009957409,0.000087195476,0.003234955,0.00024194531],"about_ca_topic_score_codex":0.0000032364014,"about_ca_topic_score_gemma":0.00002788181,"teacher_disagreement_score":0.95474535,"about_ca_system_score_codex":0.00003468819,"about_ca_system_score_gemma":0.000046562556,"threshold_uncertainty_score":0.59316736},"labels":[],"label_agreement":null},{"id":"W1983890061","doi":"10.1109/lsp.2012.2235430","title":"Decentralized Conditional Posterior Cramér–Rao Lower Bound for Nonlinear Distributed Estimation","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Estimator; Computer science; Upper and lower bounds; Algorithm; Representation (politics); Mathematics; Mathematical optimization; Statistics","score_opus":0.020006486035621746,"score_gpt":0.2711232236546598,"score_spread":0.2511167376190381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983890061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08897523,0.00013753402,0.90700614,0.0022426664,0.0009894851,0.00021964508,0.00017431196,0.00024462474,0.000010354178],"genre_scores_gemma":[0.8479694,0.0000016390273,0.1472613,0.0035478277,0.0005602944,0.000034687488,0.0005882041,0.000022666803,0.000013980467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821115,0.000052481817,0.00035494435,0.00036703498,0.0003758272,0.00063856086],"domain_scores_gemma":[0.9990452,0.00018426399,0.00019869077,0.00024728538,0.0001325673,0.00019201949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031562708,0.00022045786,0.00020321066,0.00007759251,0.0004423704,0.0005355775,0.0004759181,0.00009651059,0.000035570843],"category_scores_gemma":[0.0000361032,0.000209338,0.00009888522,0.00025424958,0.000105581224,0.001390748,0.00004985221,0.00017233058,0.000041344836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008113542,0.0016235501,0.0023223376,0.000733172,0.00022876656,0.00008540494,0.0023811667,0.0797574,0.2439081,0.0024237006,0.28540504,0.38032],"study_design_scores_gemma":[0.0016287871,0.00009566331,0.0012858278,0.00019484751,0.000052083913,0.00011705669,0.000015077412,0.95357513,0.010974178,0.0009284007,0.030399447,0.0007335127],"about_ca_topic_score_codex":0.0000040982077,"about_ca_topic_score_gemma":4.0368096e-7,"teacher_disagreement_score":0.87381774,"about_ca_system_score_codex":0.000069117974,"about_ca_system_score_gemma":0.0000643627,"threshold_uncertainty_score":0.85365564},"labels":[],"label_agreement":null},{"id":"W1984640775","doi":"10.1109/lsp.2007.896162","title":"Two Novel Channel-Augmentation Schemes for MIMO Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Computer science; Fading; Channel (broadcasting); Scheme (mathematics); Antenna (radio); Distributed antenna system; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications","score_opus":0.025598043320981836,"score_gpt":0.2888996111643366,"score_spread":0.2633015678433548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984640775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025954327,0.000568193,0.97174597,0.0001451154,0.00018848642,0.0003461795,0.000006409561,0.0008688692,0.00017647457],"genre_scores_gemma":[0.9532582,0.000008301375,0.04592773,0.00036611705,0.00021719099,0.00012534799,0.000018593173,0.000062025,0.00001646909],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990764,0.0000073591455,0.0003008954,0.00016370411,0.00015891615,0.00029271934],"domain_scores_gemma":[0.9995227,0.000086954555,0.000091414,0.00017212407,0.00007484118,0.000051968535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027624946,0.0001644169,0.00014856896,0.00014403208,0.00013076387,0.0000728967,0.00022401828,0.000053348795,0.0000014102384],"category_scores_gemma":[0.0000063433954,0.0001822847,0.00004197964,0.00017834427,0.00004712488,0.00035128082,0.000011066334,0.00014299479,0.0000036314475],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015677704,0.000016712984,0.000009829942,0.00028366654,0.000017189943,9.253452e-7,0.0002033111,0.078331225,0.8936072,0.000112925416,0.00066005025,0.026741287],"study_design_scores_gemma":[0.000716817,0.000024138537,0.000020156669,0.0003048819,0.000018160812,0.000009196186,0.00019377854,0.2897941,0.7038308,0.00012569183,0.004552596,0.00040970708],"about_ca_topic_score_codex":0.000006354862,"about_ca_topic_score_gemma":0.0000019128938,"teacher_disagreement_score":0.9273039,"about_ca_system_score_codex":0.0001283509,"about_ca_system_score_gemma":0.000010390982,"threshold_uncertainty_score":0.7433354},"labels":[],"label_agreement":null},{"id":"W1991456552","doi":"10.1109/lsp.2013.2280394","title":"A Blind AM/PM Estimation Method for Power Amplifier Linearization","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Communications Research Centre Canada","funders":"","keywords":"Linearization; Amplifier; Adjacent channel power ratio; Control theory (sociology); Nonlinear distortion; Phase distortion; Amplitude; Power (physics); SIGNAL (programming language); Distortion (music); Function (biology); Mathematics; Phase (matter); Nonlinear system; Computer science; Predistortion; Telecommunications; Physics; Bandwidth (computing); Optics; Artificial intelligence","score_opus":0.01800534508840123,"score_gpt":0.2737738232214601,"score_spread":0.25576847813305886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991456552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007359018,0.00007967652,0.9904281,0.000444431,0.0003155828,0.00066554354,0.0000064871774,0.00048267242,0.00021848363],"genre_scores_gemma":[0.5609736,9.3580746e-7,0.43715915,0.0012111833,0.00020197062,0.00024717327,0.00002766338,0.000097697666,0.000080627084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987159,0.00002873315,0.00033673746,0.0003048107,0.00021469561,0.0003991622],"domain_scores_gemma":[0.99936616,0.00014741864,0.0000862391,0.00016995915,0.00013237807,0.00009786758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019323637,0.00025298513,0.00021102096,0.00016307516,0.0001359533,0.00022625696,0.00016767769,0.000112774644,0.00008128113],"category_scores_gemma":[0.000029534955,0.00026195194,0.0000675007,0.00027828073,0.000039833623,0.00079020153,0.0000085104,0.00019703704,0.0000984701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019351142,0.000014334138,0.000009767434,0.00015396446,0.000026587972,0.0000011281669,0.0004648504,0.50757855,0.4109638,0.000020881063,0.008455173,0.07229158],"study_design_scores_gemma":[0.00060305884,0.000032879158,0.00006480636,0.00007675325,0.0000273478,0.000007702911,0.000025940337,0.9469421,0.04858485,0.0015546344,0.0016914852,0.00038847083],"about_ca_topic_score_codex":0.00000587096,"about_ca_topic_score_gemma":3.5454917e-7,"teacher_disagreement_score":0.55361456,"about_ca_system_score_codex":0.000088765904,"about_ca_system_score_gemma":0.000025610625,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W2001936727","doi":"10.1109/lsp.2007.905088","title":"Combining Gaussianized/Non-Gaussianized Features to Improve Speaker Diarization of Telephone Conversations","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Speaker diarisation; Viterbi algorithm; Computer science; Cluster analysis; Speech recognition; Mixture model; Pattern recognition (psychology); Segmentation; Bayesian information criterion; Mel-frequency cepstrum; Feature (linguistics); Artificial intelligence; Speaker recognition; Word error rate; Test set; Hierarchical clustering; Feature extraction; Hidden Markov model","score_opus":0.010488642288494734,"score_gpt":0.23965041366761372,"score_spread":0.22916177137911897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001936727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07256859,0.000021293286,0.9216519,0.0032738557,0.00038555107,0.00027334955,0.0000040080195,0.00016166846,0.0016597651],"genre_scores_gemma":[0.91225696,0.0000012501418,0.083100595,0.0043457127,0.00014769482,0.000011379708,0.00000515405,0.000023084547,0.00010819014],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812037,0.000054620083,0.00046471818,0.00045995973,0.00048368998,0.00041661656],"domain_scores_gemma":[0.9988885,0.00019308146,0.00027641997,0.00027214887,0.00018009852,0.00018976595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241198,0.00021856424,0.00028779224,0.00038700807,0.00021693266,0.00022728983,0.0005059643,0.00009817316,0.000045787507],"category_scores_gemma":[0.000070157585,0.000208924,0.000092272676,0.0009615098,0.000089284156,0.00055742863,0.00005454964,0.00019611846,0.00005793147],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044736116,0.00007033194,0.00016027904,0.00004851119,0.000027197475,0.000025529594,0.0018675878,0.00007026279,0.83629894,0.00014988371,0.001683875,0.15955287],"study_design_scores_gemma":[0.001241973,0.0000972802,0.0076345378,0.00023106243,0.00003649126,0.00002974124,0.00024265361,0.0089566875,0.98028386,0.00033838415,0.00040223054,0.0005051284],"about_ca_topic_score_codex":0.000038235263,"about_ca_topic_score_gemma":0.000008248983,"teacher_disagreement_score":0.83968836,"about_ca_system_score_codex":0.00007137498,"about_ca_system_score_gemma":0.00010277847,"threshold_uncertainty_score":0.85196733},"labels":[],"label_agreement":null},{"id":"W2002330609","doi":"10.1109/lsp.2005.843775","title":"Ramanujan sums and discrete Fourier transforms","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Arithmetic function; Mathematics; Ramanujan's sum; Discrete Fourier transform (general); Computation; Fourier transform; Discrete mathematics; Integer (computer science); Fourier analysis; Algebra over a field; Algorithm; Fractional Fourier transform; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.0066716420776136015,"score_gpt":0.23015481363450868,"score_spread":0.22348317155689507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002330609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695475,0.0006898172,0.02507386,0.0041937395,0.000023280169,0.000060151237,0.0000042270817,0.000017118076,0.00039030533],"genre_scores_gemma":[0.9938393,0.00004046133,0.00095522637,0.004399481,0.0004252687,0.000008157126,0.000025255536,0.00001734378,0.00028948847],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991604,0.000015661106,0.00015151026,0.00029510187,0.0001351595,0.00024214703],"domain_scores_gemma":[0.9997275,0.00000405549,0.00004868894,0.00010864647,0.000024138113,0.00008700038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099572746,0.00014639416,0.00011901787,0.0000401512,0.00012751226,0.000075210315,0.00010776337,0.000074600066,0.000017993592],"category_scores_gemma":[0.0000040508044,0.000118016214,0.000074863114,0.000077176475,0.0001460979,0.000022730414,0.000013437409,0.000091824004,0.0000076315755],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038120404,0.000013038056,0.0004314688,0.000022349426,0.000029144396,0.000004998669,0.00009511351,0.0003902971,0.90366936,0.0000019972392,0.0008385356,0.0944656],"study_design_scores_gemma":[0.00084691145,0.00018843394,0.00073406607,0.00006472019,0.000118742595,0.000054617507,0.000117118565,0.005963645,0.9448163,0.000122523,0.046273682,0.00069922616],"about_ca_topic_score_codex":0.000016085096,"about_ca_topic_score_gemma":0.000018820228,"teacher_disagreement_score":0.09376638,"about_ca_system_score_codex":0.0000092002165,"about_ca_system_score_gemma":0.000023791556,"threshold_uncertainty_score":0.48125616},"labels":[],"label_agreement":null},{"id":"W2002428115","doi":"10.1109/lsp.2010.2090869","title":"A Testbed and Methodology for Comparing Live Video Frame Rate Control Methods","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Testbed; Computer science; Frame (networking); Real-time computing; Frame rate; Control (management); Mobile telephony; Simple (philosophy); Computer vision; Artificial intelligence; Computer network; Mobile radio","score_opus":0.08701103915539984,"score_gpt":0.3555977499668551,"score_spread":0.26858671081145524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002428115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08779417,0.00019531346,0.9042286,0.006510393,0.00042355972,0.00021652783,0.0000010358807,0.0006013394,0.00002904959],"genre_scores_gemma":[0.54353756,0.0000012861892,0.45341024,0.0028936963,0.00007277096,0.00006348354,2.4119902e-7,0.000010802757,0.000009898578],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815595,0.00032850876,0.0003128875,0.00061830593,0.00013423212,0.00045012057],"domain_scores_gemma":[0.9971058,0.002052261,0.00023967172,0.0003675795,0.0001182828,0.000116420815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018336328,0.00023596427,0.0004302691,0.00019291921,0.00037359676,0.00039644766,0.0009258361,0.00016709673,0.000003653686],"category_scores_gemma":[0.00058887457,0.0002019603,0.00007736085,0.00022620136,0.00025486137,0.00040802424,0.00014493076,0.00057148945,0.000004024624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002585028,0.000014676625,0.00019372725,0.000045895016,0.000018745837,0.000004584954,0.0003595642,0.00018405728,0.77808213,0.0007149812,0.00059490994,0.2197609],"study_design_scores_gemma":[0.001724643,0.00018506148,0.00061183475,0.00015509792,0.000055174118,0.000081631144,0.000100561774,0.66895634,0.2885076,0.036602974,0.002362818,0.00065626105],"about_ca_topic_score_codex":0.000016037655,"about_ca_topic_score_gemma":0.0000027882181,"teacher_disagreement_score":0.6687723,"about_ca_system_score_codex":0.000015603913,"about_ca_system_score_gemma":0.00006640666,"threshold_uncertainty_score":0.8235702},"labels":[],"label_agreement":null},{"id":"W2004118907","doi":"10.1109/lsp.2010.2081977","title":"Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Space–time block code; Coding gain; Diversity gain; Algorithm; Block code; Transmitter; Constellation diagram; k-nearest neighbors algorithm; Decoding methods; Coding (social sciences); Computer science; Constellation; Mathematics; Topology (electrical circuits); Telecommunications; Fading; Bit error rate; Combinatorics; Statistics; Artificial intelligence; Physics","score_opus":0.007424528874151641,"score_gpt":0.2213551860971476,"score_spread":0.21393065722299595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004118907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6302128,0.00004401423,0.3644479,0.002891581,0.000072131385,0.0002981453,0.000016320015,0.0013728435,0.0006442839],"genre_scores_gemma":[0.9645164,0.0000034962918,0.034364432,0.0007078693,0.00014596862,0.00008417911,0.00001352133,0.00010191883,0.00006221077],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988182,0.000029675646,0.00023404913,0.00024309897,0.00030325327,0.0003717337],"domain_scores_gemma":[0.99909854,0.00015012592,0.00011255118,0.00044537536,0.00010736729,0.00008602458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015927597,0.00029379613,0.00022406627,0.000060995386,0.00028433115,0.00016913806,0.00054312765,0.00010092276,0.00006400622],"category_scores_gemma":[0.0000107842625,0.0002202979,0.00005073138,0.0003409065,0.00030204988,0.00033466163,0.000034576584,0.0008343256,0.00005604203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023956702,0.000040411476,0.0001982157,0.000041615498,0.00003271318,0.0000055109585,0.0002513446,0.041012228,0.95138496,0.000039337196,0.0022785333,0.0046911705],"study_design_scores_gemma":[0.0011631037,0.00008126668,0.0015252756,0.00036369608,0.00008489054,0.00023564349,0.000100941084,0.50332856,0.48097944,0.00012074599,0.010562826,0.001453586],"about_ca_topic_score_codex":0.000019514871,"about_ca_topic_score_gemma":0.000024756186,"teacher_disagreement_score":0.47040552,"about_ca_system_score_codex":0.0000393648,"about_ca_system_score_gemma":0.000040659514,"threshold_uncertainty_score":0.89834875},"labels":[],"label_agreement":null},{"id":"W2004626593","doi":"10.1109/lsp.2014.2361459","title":"Complex-Valued Gaussian Sum Filter for Nonlinear Filtering of Non-Gaussian/Non-Circular Noise","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gaussian; Gaussian filter; Gaussian noise; Mathematics; Gaussian random field; Algorithm; Gauss sum; Adaptive filter; Noise (video); Gaussian process; Filter (signal processing); Computer science; Pattern recognition (psychology); Artificial intelligence; Discrete mathematics; Computer vision; Physics; Image (mathematics)","score_opus":0.02411567965468811,"score_gpt":0.2585075381105583,"score_spread":0.2343918584558702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004626593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029434681,0.000031306903,0.96769536,0.0015023986,0.00058915414,0.00029456816,0.00003510165,0.00017917991,0.00023825304],"genre_scores_gemma":[0.76262355,0.0000013307563,0.23379591,0.0027781662,0.00064701214,0.000027602278,0.000046677473,0.00004722279,0.000032491997],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972269,0.0000864513,0.0006555646,0.00079670985,0.000519054,0.0007153396],"domain_scores_gemma":[0.9983575,0.00017575633,0.00038698077,0.00073401415,0.0001472648,0.00019852156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062427996,0.00037597073,0.0005083251,0.0002136306,0.00037982085,0.000354112,0.0013408487,0.0001393196,0.0000243201],"category_scores_gemma":[0.000028877485,0.00035012103,0.00021545905,0.00040887317,0.00017983511,0.00061309023,0.00014774982,0.00029903988,0.000024251522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009031529,0.00018410671,0.00034120952,0.000944536,0.00006751063,0.000030431851,0.0012067035,0.027040672,0.86105895,0.000137319,0.021997891,0.086900346],"study_design_scores_gemma":[0.0010146518,0.00012675977,0.0007999592,0.00042978075,0.00003152057,0.000023572697,0.000016157226,0.9544786,0.034508158,0.00015370134,0.007878043,0.00053910364],"about_ca_topic_score_codex":0.000026309173,"about_ca_topic_score_gemma":0.0000015402825,"teacher_disagreement_score":0.9274379,"about_ca_system_score_codex":0.000038389568,"about_ca_system_score_gemma":0.00006742164,"threshold_uncertainty_score":0.9998951},"labels":[],"label_agreement":null},{"id":"W2010985693","doi":"10.1109/lsp.2013.2244882","title":"Selection Combining for Differential Amplify-and-Forward Relaying Over Rayleigh-Fading Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal-ratio combining; Rayleigh fading; Fading; Selection (genetic algorithm); Channel (broadcasting); Bit error rate; Algorithm; Differential (mechanical device); Channel state information; Computer science; Signal-to-noise ratio (imaging); Mathematics; Telecommunications; Statistics; Topology (electrical circuits); Wireless; Engineering; Artificial intelligence; Combinatorics","score_opus":0.0307345730189498,"score_gpt":0.26614186653302313,"score_spread":0.23540729351407333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010985693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23058842,0.00009802849,0.76675624,0.0017898179,0.00026454456,0.0002660154,3.165149e-7,0.00017451121,0.00006207843],"genre_scores_gemma":[0.9872776,0.000018408473,0.009994591,0.0022596186,0.0002462663,0.00012148822,0.0000035534993,0.0000221393,0.000056295914],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865705,0.000088293295,0.00027670318,0.00040301183,0.00019346167,0.00038149825],"domain_scores_gemma":[0.9992566,0.00018741068,0.00015815746,0.00017946908,0.00011951727,0.00009885711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024607877,0.00019648428,0.0002040741,0.00014820269,0.00082687417,0.0008782284,0.00046376736,0.000067694215,0.00002570156],"category_scores_gemma":[0.000018204426,0.00018950556,0.000058295638,0.00030603082,0.000059423208,0.0010681527,0.00012620263,0.0002692607,0.000010320643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018113255,0.000049903614,0.00061805267,0.00010395321,0.000051703602,0.0000011617954,0.003031067,0.00238096,0.71853507,0.0020313922,0.005243321,0.2679353],"study_design_scores_gemma":[0.00081234524,0.00007214661,0.00078619405,0.00021278973,0.000017084341,0.0000125775605,0.000028291646,0.98419535,0.011741899,0.0007219766,0.00096349313,0.00043587253],"about_ca_topic_score_codex":0.000007866325,"about_ca_topic_score_gemma":0.0000011655114,"teacher_disagreement_score":0.9818144,"about_ca_system_score_codex":0.000064226,"about_ca_system_score_gemma":0.00003081901,"threshold_uncertainty_score":0.8468777},"labels":[],"label_agreement":null},{"id":"W2014316832","doi":"10.1109/lsp.2007.913136","title":"New Design of Robust $H_{\\infty}$ Filters for 2-D Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Filtering theory; Mathematics; Applied mathematics; Matrix (chemical analysis); Matrix algebra; Linear matrix inequality; Computer science; Algorithm; Control theory (sociology); Mathematical optimization; Artificial intelligence; Eigenvalues and eigenvectors; Control (management)","score_opus":0.04310504232231796,"score_gpt":0.2107964113959364,"score_spread":0.16769136907361845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014316832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022214975,0.0011561541,0.974991,0.00016649217,0.00055591605,0.00055290567,0.000009115827,0.00022980425,0.00012363221],"genre_scores_gemma":[0.9908794,0.0000056137287,0.008218978,0.00018016166,0.00049329153,0.00007998063,0.0000032465496,0.0000531377,0.000086160435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985947,0.00004298789,0.00047380957,0.00023678428,0.00027680185,0.00037490996],"domain_scores_gemma":[0.99929035,0.00022527421,0.000113126844,0.00017986562,0.00008088002,0.000110531684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026192702,0.0002312748,0.00040021844,0.000110612214,0.00012017177,0.000048994832,0.00024839304,0.00009594152,0.000008856388],"category_scores_gemma":[0.000016181088,0.00022776294,0.00011700354,0.00018340963,0.00007581307,0.00024281582,0.0000053544522,0.00012363029,0.000006507315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000648957,0.0000094854495,0.000072755334,0.0005658139,0.00005387186,0.0000064798337,0.0006332681,0.8472734,0.13159296,0.0000056763342,0.016533721,0.003187683],"study_design_scores_gemma":[0.0019674147,0.0001614049,0.00009725506,0.0005662285,0.00007909458,0.00006678021,0.00025522136,0.9762788,0.017418625,0.00004097,0.0024049776,0.0006632619],"about_ca_topic_score_codex":0.0000626607,"about_ca_topic_score_gemma":9.2750724e-7,"teacher_disagreement_score":0.96866447,"about_ca_system_score_codex":0.00009022715,"about_ca_system_score_gemma":0.00009806221,"threshold_uncertainty_score":0.9287903},"labels":[],"label_agreement":null},{"id":"W2018214963","doi":"10.1109/lsp.2013.2281597","title":"Deterministic Construction of Real-Valued Ternary Sensing Matrices Using Optical Orthogonal Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Golomb coding; Hadamard transform; Normalization (sociology); Binary number; Algorithm; Matrix (chemical analysis); Hadamard matrix; Computer science; Complex Hadamard matrix; Ternary operation; Sparse matrix; Mathematics; Theoretical computer science; Arithmetic; Image (mathematics); Image processing; Image compression; Artificial intelligence","score_opus":0.01800034238972296,"score_gpt":0.2396329377314017,"score_spread":0.22163259534167876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018214963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837782,0.00007568331,0.2151053,0.000031156607,0.00019072134,0.00011626639,0.0000023365335,0.00038696695,0.00031335562],"genre_scores_gemma":[0.91172785,0.000009462166,0.08785869,0.00010765955,0.00024298784,0.0000024693493,0.0000026947635,0.00004645822,0.0000017592794],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987527,0.00003669047,0.00039925874,0.00022970501,0.00026539553,0.00031624222],"domain_scores_gemma":[0.99946785,0.00006557147,0.00013509179,0.0001474104,0.00010846807,0.00007559681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008616505,0.00023275433,0.00029968636,0.00018409411,0.00010978737,0.0001184449,0.00013003814,0.00009970777,0.000013497161],"category_scores_gemma":[0.0000073142596,0.00023447153,0.00007466281,0.0001922609,0.00024407695,0.00030444987,0.000022132861,0.00020194541,0.0000064235505],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001151986,0.000009399968,0.00032049057,0.00012845742,0.000033713957,0.000038628124,0.000090843365,0.015703063,0.94760764,0.000011739235,0.00023205388,0.035812434],"study_design_scores_gemma":[0.00015338295,0.000029048035,0.0004921115,0.0005253306,0.00007266245,0.00025890197,0.00006082226,0.7276682,0.2699922,0.0004162153,0.000009932472,0.00032118682],"about_ca_topic_score_codex":0.000070133276,"about_ca_topic_score_gemma":9.473586e-7,"teacher_disagreement_score":0.71196514,"about_ca_system_score_codex":0.000058106358,"about_ca_system_score_gemma":0.000033861437,"threshold_uncertainty_score":0.9561472},"labels":[],"label_agreement":null},{"id":"W2020513142","doi":"10.1109/lsp.2007.913625","title":"A New Model for Image Segmentation","year":2008,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Image segmentation; Segmentation; Computer science; Scale-space segmentation; Artificial intelligence; Segmentation-based object categorization; Image (mathematics); Computer vision; Set (abstract data type); Pattern recognition (psychology); Variable (mathematics); Mathematics","score_opus":0.03619138375877132,"score_gpt":0.2935405548139096,"score_spread":0.2573491710551383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020513142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016083802,0.000025772502,0.99497473,0.0025619832,0.0000709328,0.00027894508,0.0000014325109,0.0004148821,0.0000629139],"genre_scores_gemma":[0.06710316,0.0000027946387,0.923253,0.009145204,0.00012530385,0.00005854288,0.0000046226296,0.000015594496,0.00029175525],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877656,0.00002275012,0.00024060857,0.00033812015,0.00036510476,0.00025683583],"domain_scores_gemma":[0.9994594,0.000044964298,0.00012403939,0.00015870335,0.00007966299,0.00013326971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015840327,0.0001332528,0.00012132121,0.00010521358,0.00021419155,0.00014767899,0.00046322707,0.000037571557,0.000011284321],"category_scores_gemma":[0.000014168399,0.00013005057,0.00005772819,0.00020718735,0.000071912895,0.0012500476,0.000029354915,0.00009826038,0.0000140951515],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007459884,0.000019456951,0.0000060524358,0.00004009576,0.000005192779,0.000014936413,0.0015003856,0.0006859695,0.7370626,0.000020995485,0.069765694,0.19087121],"study_design_scores_gemma":[0.0003847535,0.000029561195,0.000008420112,0.000027705495,0.000005214479,0.000024678433,0.000006996576,0.6164803,0.38204592,0.00079756574,0.000030639014,0.00015822818],"about_ca_topic_score_codex":0.000008572201,"about_ca_topic_score_gemma":3.30775e-7,"teacher_disagreement_score":0.61579436,"about_ca_system_score_codex":0.000060580813,"about_ca_system_score_gemma":0.00019320232,"threshold_uncertainty_score":0.53033084},"labels":[],"label_agreement":null},{"id":"W2022215515","doi":"10.1109/lsp.2007.898329","title":"On Crosstalk Cancellation and Equalization With Multiple Loudspeakers for 3-D Sound Reproduction","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Loudspeaker; Crosstalk; Binaural recording; Acoustics; Reverberation; Computer science; Equalization (audio); Impulse (physics); Impulse response; Directional sound; Sound recording and reproduction; Speech recognition; Physics; Mathematics; Telecommunications; Electronic engineering; Engineering; Decoding methods","score_opus":0.018706615015836137,"score_gpt":0.2603135747922342,"score_spread":0.24160695977639807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022215515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35019997,0.0000762506,0.6486131,0.00069130055,0.00011071948,0.00015604582,6.252468e-7,0.000105694206,0.000046315203],"genre_scores_gemma":[0.9525603,0.0000010851325,0.045714732,0.001395218,0.00025664933,0.000010037119,0.0000049775645,0.000019478304,0.00003753869],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856764,0.000015620994,0.00021627895,0.0005853614,0.00028419812,0.00033090758],"domain_scores_gemma":[0.99931514,0.00011619328,0.00020966196,0.0001713277,0.000115437186,0.00007223604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053911936,0.00016220288,0.0001219226,0.00012924906,0.00045324865,0.00043787542,0.00015105915,0.000049083126,9.821599e-7],"category_scores_gemma":[0.0000365641,0.00014335381,0.000023130706,0.0003501724,0.000096649026,0.00076354493,0.000013028698,0.000097408854,0.0000014734248],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045008562,0.000067355,0.0027587914,0.0003118381,0.000023306948,0.000017370705,0.002479975,0.027320659,0.54216,0.00018439631,0.0008352603,0.423391],"study_design_scores_gemma":[0.0019967142,0.0003951844,0.0017494156,0.0003331698,0.00002485795,0.00006476946,0.0001335055,0.05643078,0.9336131,0.0037451743,0.0008357052,0.00067760213],"about_ca_topic_score_codex":0.000010309734,"about_ca_topic_score_gemma":0.000022571903,"teacher_disagreement_score":0.60289836,"about_ca_system_score_codex":0.00008262189,"about_ca_system_score_gemma":0.000055898337,"threshold_uncertainty_score":0.5845799},"labels":[],"label_agreement":null},{"id":"W2022401652","doi":"10.1109/lsp.2012.2205142","title":"Tractable Bound for Spherical Section Property in the Presence of Side-Information","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Semidefinite programming; Relaxation (psychology); Upper and lower bounds; Compressed sensing; Semidefinite embedding; Linear programming; Constraint (computer-aided design); Dual (grammatical number); Property (philosophy); Mathematics; Computer science; Algorithm; Mathematical optimization; Computational complexity theory; Combinatorics; Quadratically constrained quadratic program; Quadratic programming; Mathematical analysis; Geometry","score_opus":0.021915080156452174,"score_gpt":0.23723496350879497,"score_spread":0.2153198833523428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022401652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589653,0.00014276129,0.43880916,0.00028037652,0.00023390283,0.0003713033,0.0000017942949,0.00018015574,0.0010152418],"genre_scores_gemma":[0.99672717,0.000002105402,0.002677101,0.0003535285,0.00018266425,0.00003956648,0.0000024219753,0.00001040467,0.000005057067],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939436,0.000021475475,0.00018658018,0.00005383986,0.0001382922,0.0002054396],"domain_scores_gemma":[0.99976236,0.000055866603,0.00005182725,0.00007784076,0.00003375157,0.000018329336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022399645,0.00008610331,0.000095941825,0.000043220414,0.000054305376,0.00005562252,0.00010763448,0.000044688273,0.0000021513913],"category_scores_gemma":[0.000012597337,0.000055375946,0.0000301392,0.00014344265,0.00003499453,0.00085713295,0.00000421482,0.00012454441,0.0000012207454],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005124131,0.000055990444,0.0004457575,0.00029944238,0.000013417953,9.2184854e-7,0.003937678,0.044056773,0.86754245,0.00000949207,0.017680489,0.06590637],"study_design_scores_gemma":[0.00045916802,0.000091519505,0.0020861824,0.00037821103,0.000038128313,0.000037833368,0.00053041795,0.3300993,0.64769113,0.00024652766,0.017931307,0.0004102471],"about_ca_topic_score_codex":0.000037727033,"about_ca_topic_score_gemma":0.0000020793009,"teacher_disagreement_score":0.43776184,"about_ca_system_score_codex":0.000031867494,"about_ca_system_score_gemma":0.000011184476,"threshold_uncertainty_score":0.22581655},"labels":[],"label_agreement":null},{"id":"W2024165348","doi":"10.1109/lsp.2010.2102017","title":"Relay Selection in Dual-Hop Vehicular Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Rayleigh fading; Channel (broadcasting); Algorithm; Artificial intelligence; Fading; Computer network; Physics","score_opus":0.016658020982744527,"score_gpt":0.25113018062649,"score_spread":0.2344721596437455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024165348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32110783,0.00017336689,0.67400825,0.0039545894,0.00027548568,0.00010022016,6.538381e-8,0.00016910775,0.00021106904],"genre_scores_gemma":[0.9872453,0.000021422287,0.009029054,0.003400159,0.00023202528,0.000019320982,0.0000011245154,0.000012855903,0.000038688624],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880755,0.00012380828,0.00024053181,0.00033431593,0.00019126768,0.0003025407],"domain_scores_gemma":[0.9994508,0.00007069487,0.00009674484,0.00023381236,0.000080607526,0.00006736057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261423,0.00014308513,0.00013178193,0.00014525774,0.0002819129,0.00029463042,0.00044730815,0.00008337385,0.00001626161],"category_scores_gemma":[0.000015483449,0.00014192399,0.00004038657,0.00085315556,0.000062561754,0.0005923013,0.00008926687,0.00077793986,0.000016128046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009631962,0.00006982034,0.0014731927,0.00001419675,0.000009298922,0.00003607247,0.0009469327,0.13238044,0.664246,0.0008603765,0.0028033722,0.19715066],"study_design_scores_gemma":[0.00024917346,0.000017526847,0.0020060693,0.0000619125,0.0000028023944,0.00003460573,0.0000047231774,0.99045825,0.004099755,0.000046289526,0.002793743,0.00022514339],"about_ca_topic_score_codex":0.0000059604245,"about_ca_topic_score_gemma":0.00006561045,"teacher_disagreement_score":0.8580778,"about_ca_system_score_codex":0.00004457994,"about_ca_system_score_gemma":0.00005917557,"threshold_uncertainty_score":0.5787492},"labels":[],"label_agreement":null},{"id":"W2025445694","doi":"10.1109/lsp.2010.2091405","title":"Wideband Spectrum Sensing for Cognitive Radios With Correlated Subband Occupancy","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Wideband; Cognitive radio; Estimator; Detector; Statistic; Algorithm; Energy (signal processing); Maximum a posteriori estimation; Mathematics; Binary number; Statistics; Computer science; Telecommunications; Wireless; Electronic engineering; Engineering; Maximum likelihood","score_opus":0.009559461532204896,"score_gpt":0.22465536200219627,"score_spread":0.21509590046999139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025445694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33170915,0.000072293595,0.665317,0.0017030631,0.00042720526,0.0003355005,0.000003544313,0.0002065387,0.00022570373],"genre_scores_gemma":[0.97847253,0.0000021901033,0.01821855,0.002534639,0.0006675634,0.0000066339194,0.0000079587035,0.000051850944,0.00003806439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766827,0.000054906617,0.0003220557,0.0008047202,0.0003653953,0.00078468496],"domain_scores_gemma":[0.9986987,0.00042202746,0.00024789918,0.00023739823,0.00020553637,0.00018843275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032344664,0.00038053296,0.00037332697,0.00019799023,0.00063538406,0.00067716185,0.00032103938,0.000119620345,0.0000070209967],"category_scores_gemma":[0.000031370888,0.00033042984,0.00010822654,0.00060817035,0.00025822688,0.0007313524,0.000032183987,0.0006452602,0.000008068872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008116379,0.00014886392,0.0021809908,0.00016733412,0.00025658146,0.00079563993,0.0028193246,0.0009855047,0.4580619,0.00037933985,0.0022389803,0.53115386],"study_design_scores_gemma":[0.0058774482,0.0006141291,0.0021429835,0.0012964832,0.00024974518,0.001875493,0.00011431202,0.82885367,0.15423813,0.0018088637,0.0008918509,0.0020368795],"about_ca_topic_score_codex":0.000022973893,"about_ca_topic_score_gemma":0.00007143965,"teacher_disagreement_score":0.82786816,"about_ca_system_score_codex":0.00004725003,"about_ca_system_score_gemma":0.00017589913,"threshold_uncertainty_score":0.99991477},"labels":[],"label_agreement":null},{"id":"W2033400894","doi":"10.1109/lsp.2003.811586","title":"Multiwavelets denoising using neighboring coefficients","year":2003,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":171,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Noise reduction; Thresholding; Wavelet; Pattern recognition (psychology); Artificial intelligence; Video denoising; Computer science; Extension (predicate logic); Term (time); Image denoising; Wavelet transform; Mathematics; Step detection; Algorithm; Computer vision; Image (mathematics)","score_opus":0.03591050733372826,"score_gpt":0.28826437517229503,"score_spread":0.2523538678385668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033400894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17047739,0.00025339078,0.82777524,0.00015295073,0.00056544086,0.00012219,4.8632785e-7,0.00022311101,0.00042977385],"genre_scores_gemma":[0.74663836,9.655784e-7,0.25092998,0.0022181135,0.00013179764,0.0000034698417,4.5830066e-7,0.00003525372,0.000041619933],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99699295,0.00033613836,0.00044588087,0.0007487777,0.00065241614,0.000823844],"domain_scores_gemma":[0.9988774,0.00014771488,0.00022491817,0.0004142549,0.00015055218,0.00018517276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010181911,0.0003478412,0.00031584257,0.0002999435,0.00069566385,0.0008720154,0.00080301653,0.00009651328,0.00001140859],"category_scores_gemma":[0.00007348706,0.00034836517,0.00012329723,0.000918551,0.000117522184,0.0011771518,0.000071525035,0.00035923976,0.000031272066],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001059435,0.00006371288,0.00019798055,0.000060044582,0.000016423783,0.0001915167,0.0007602592,0.01643611,0.89472276,0.00023313504,0.00012538394,0.087182075],"study_design_scores_gemma":[0.0017123279,0.000055293305,0.00021026678,0.00043403334,0.000045480894,0.0002921378,0.000046517984,0.4617149,0.5321056,0.00073379016,0.0015390269,0.0011105803],"about_ca_topic_score_codex":0.000020602729,"about_ca_topic_score_gemma":3.344492e-7,"teacher_disagreement_score":0.5768453,"about_ca_system_score_codex":0.00016309631,"about_ca_system_score_gemma":0.00018009121,"threshold_uncertainty_score":0.9998968},"labels":[],"label_agreement":null},{"id":"W2039911522","doi":"10.1109/lsp.2014.2378773","title":"Slow Adaptive Power Control and Outage Avoidance in Composite Fading Wireless Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Fading; Computer science; Fading distribution; Power control; Transmitter power output; Phase-shift keying; Wireless; Electronic engineering; Channel state information; Power (physics); Control theory (sociology); Telecommunications; Bit error rate; Channel (broadcasting); Engineering; Transmitter; Rayleigh fading; Physics; Control (management)","score_opus":0.016468949652246496,"score_gpt":0.24837610074508942,"score_spread":0.23190715109284293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039911522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26272666,0.00021583524,0.7324092,0.004102482,0.000092985865,0.00017811837,8.1767786e-7,0.000098969176,0.00017494832],"genre_scores_gemma":[0.9918472,0.0000067134893,0.004849073,0.0031294322,0.000089910354,0.000027020878,7.7794607e-7,0.000022828779,0.000027045186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997767,0.00041174996,0.00031609827,0.0005216478,0.00043594357,0.000547559],"domain_scores_gemma":[0.99875116,0.0004217911,0.00016061787,0.00043421157,0.000097076605,0.00013512625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935688,0.00021809957,0.00030488666,0.00023445342,0.0002819721,0.0005075348,0.00120176,0.00007698868,0.0000017509005],"category_scores_gemma":[0.000014847326,0.00021837365,0.000039957828,0.00050644577,0.00021385206,0.0008551468,0.00018139812,0.00054902665,0.000013037544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002424171,0.00022893083,0.0043151425,0.00020622594,0.00006829732,0.00010592757,0.010903332,0.13196905,0.5065296,0.0025443805,0.0011875868,0.34169906],"study_design_scores_gemma":[0.00087196485,0.00006161033,0.0015797985,0.00029571474,0.0000026534512,0.000011707694,0.000030375664,0.99429953,0.0021765227,0.0002439853,0.00013743271,0.00028869844],"about_ca_topic_score_codex":0.000025064655,"about_ca_topic_score_gemma":0.000005318687,"teacher_disagreement_score":0.8623305,"about_ca_system_score_codex":0.000083137806,"about_ca_system_score_gemma":0.000044057662,"threshold_uncertainty_score":0.8905019},"labels":[],"label_agreement":null},{"id":"W2043089841","doi":"10.1109/lsp.2015.2396650","title":"Compressive Sensing Time Reversal MIMO Radar: Joint Direction and Doppler Frequency Estimation","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Microwave Imaging and Scattering Analysis","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; York University","funders":"","keywords":"MIMO; Clutter; Doppler effect; Computer science; Multipath propagation; Radar; Compressed sensing; Algorithm; Joint (building); Monte Carlo method; Acoustics; Control theory (sociology); Telecommunications; Physics; Mathematics; Engineering; Statistics; Artificial intelligence; Beamforming","score_opus":0.014592450303728532,"score_gpt":0.2070477329729977,"score_spread":0.19245528266926917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043089841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5793031,0.0006271674,0.4171039,0.0012079879,0.0002649336,0.00009888696,0.0000052680443,0.00058396737,0.0008047916],"genre_scores_gemma":[0.9776632,0.00000383845,0.021667948,0.00036893948,0.0001758859,0.0000021626395,0.000015330163,0.000041207066,0.000061486564],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989888,0.0000480147,0.00024736958,0.00025166606,0.00021103353,0.000253095],"domain_scores_gemma":[0.9996034,0.000022673205,0.00007483124,0.00011797786,0.000059794493,0.000121306395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022248733,0.0002045215,0.00023074131,0.0001640069,0.000126515,0.00019796427,0.00006146098,0.00005540668,0.0000102928225],"category_scores_gemma":[0.000013765684,0.00021124426,0.000047285877,0.0001834105,0.00008004833,0.00032028102,0.000012156204,0.00020714298,0.000051635336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052545997,0.0000055450505,0.000057496993,0.000102059326,0.000045642297,0.000022392016,0.00078280957,0.06251133,0.8877837,2.2925289e-7,0.01909942,0.029584121],"study_design_scores_gemma":[0.0003612841,0.000014297366,0.00015500253,0.00027803733,0.0000983073,0.00015587284,0.00004403575,0.9476153,0.050525866,0.00011017026,0.0002521036,0.00038971033],"about_ca_topic_score_codex":0.000075588854,"about_ca_topic_score_gemma":0.0000016717692,"teacher_disagreement_score":0.885104,"about_ca_system_score_codex":0.00012556821,"about_ca_system_score_gemma":0.000021040249,"threshold_uncertainty_score":0.8614291},"labels":[],"label_agreement":null},{"id":"W2044943815","doi":"10.1109/lsp.2012.2221711","title":"Afriat's Test for Detecting Malicious Agents","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Construct (python library); Set (abstract data type); Test (biology); Artificial intelligence; Mathematical optimization; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.025365773182734093,"score_gpt":0.25587131966948873,"score_spread":0.23050554648675464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044943815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025129559,0.00012739396,0.97216094,0.00090354646,0.0009763607,0.00018379671,0.0000059015665,0.00034287845,0.00016960912],"genre_scores_gemma":[0.9682666,8.5533526e-7,0.027441178,0.003114308,0.0010563211,0.000036484947,0.0000026560563,0.000023747998,0.00005781597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998422,0.000032217173,0.00025715513,0.00032910032,0.00027080256,0.0006886714],"domain_scores_gemma":[0.9991832,0.00017828612,0.00016899759,0.0002070348,0.00008202061,0.00018050888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037839182,0.00019171445,0.00016276688,0.00009537284,0.00042533327,0.000411816,0.0004377845,0.00007278805,0.000007804403],"category_scores_gemma":[0.000040274706,0.00018553498,0.000097582,0.0003990881,0.000039048984,0.0008390653,0.00004465977,0.00017256451,0.00003287202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028696484,0.00027678057,0.0011142967,0.00015646701,0.00005258792,0.000021768898,0.0014649885,0.0071695996,0.12133304,0.000110227425,0.023235142,0.8450364],"study_design_scores_gemma":[0.0013582599,0.00021557877,0.0011248238,0.00015221788,0.00005372278,0.0001707162,0.000110754554,0.8981686,0.065661475,0.00037428693,0.031490754,0.0011187741],"about_ca_topic_score_codex":0.0000065663817,"about_ca_topic_score_gemma":6.5387155e-7,"teacher_disagreement_score":0.9447198,"about_ca_system_score_codex":0.00006806046,"about_ca_system_score_gemma":0.000024758443,"threshold_uncertainty_score":0.7565897},"labels":[],"label_agreement":null},{"id":"W2045069106","doi":"10.1109/lsp.2010.2097590","title":"Mean Square Error Estimation in Thresholding","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Holland Bloorview Kids Rehabilitation Hospital; University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Mean squared error; Thresholding; Computer science; Probabilistic logic; Algorithm; Mathematics; Statistics; Mean square; Pattern recognition (psychology); Artificial intelligence; Image (mathematics)","score_opus":0.025875996023772743,"score_gpt":0.2967279493003013,"score_spread":0.27085195327652856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045069106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26703402,0.000033765846,0.7302103,0.0018582464,0.00036576108,0.00008608782,2.9541724e-7,0.00014653365,0.0002650039],"genre_scores_gemma":[0.7968679,2.2159972e-7,0.20056507,0.0024059233,0.00011317778,0.000009389075,0.000001047521,0.00001529416,0.000021943337],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983742,0.0000941513,0.0002993293,0.00045037002,0.00038050607,0.00040139002],"domain_scores_gemma":[0.9993381,0.000102999016,0.00012285609,0.00029261084,0.00006187278,0.000081554645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091910077,0.00018693776,0.00018427,0.00027921554,0.0002050662,0.0005072779,0.00070970255,0.000084898915,0.0000128932725],"category_scores_gemma":[0.00003692534,0.00017952881,0.000057718953,0.00059078145,0.00007944661,0.0013102205,0.000055327913,0.0005342553,0.000028722403],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001245292,0.00003584592,0.00030393066,0.000055140787,0.0000035563917,0.00009792329,0.0018908677,0.006780416,0.71648675,0.0002974428,0.00039138758,0.27364427],"study_design_scores_gemma":[0.00083667814,0.000041605686,0.0016731163,0.00021698652,0.000009295837,0.00007375394,0.0000309678,0.83899593,0.1529024,0.004427064,0.0002738564,0.000518366],"about_ca_topic_score_codex":0.00003226941,"about_ca_topic_score_gemma":0.000014889093,"teacher_disagreement_score":0.8322155,"about_ca_system_score_codex":0.000039557384,"about_ca_system_score_gemma":0.00007986565,"threshold_uncertainty_score":0.7320972},"labels":[],"label_agreement":null},{"id":"W2052628454","doi":"10.1109/97.855449","title":"GMDF for noise reduction and echo cancellation","year":2000,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Echo (communications protocol); Noise reduction; Reduction (mathematics); Microphone; Noise (video); Frequency domain; Telephony; Algorithm; Speech enhancement; Computer science; Computation; Block (permutation group theory); Signal-to-noise ratio (imaging); Return loss; Speech recognition; Telecommunications; Mathematics; Artificial intelligence; Antenna (radio); Computer network","score_opus":0.012919708862018786,"score_gpt":0.23510887816552795,"score_spread":0.22218916930350915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052628454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33710515,0.000353454,0.6570073,0.004566253,0.00016914241,0.00017321929,0.0000011199065,0.00019210546,0.00043227113],"genre_scores_gemma":[0.9416565,0.000011060583,0.055955958,0.0017002219,0.00039034843,0.000020395219,0.0000019878137,0.0000139140375,0.0002496302],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897367,0.00001703174,0.00017265008,0.0003905792,0.00017351279,0.00027257437],"domain_scores_gemma":[0.9996512,0.000022240109,0.00008586632,0.00011705032,0.000051459254,0.00007216128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016468704,0.00013189913,0.00011507841,0.000076785516,0.00033346514,0.0003775422,0.00020937958,0.000046836958,0.00001338378],"category_scores_gemma":[0.0000039561237,0.00012968793,0.00003225214,0.00023523165,0.000059671907,0.00091930793,0.00000999807,0.00009377188,0.000008764735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015594853,0.000008824688,0.00002821825,0.000053423464,0.0000031947377,0.000001712546,0.00040628426,0.0013493784,0.31677464,0.0000031644995,0.0011836246,0.68017197],"study_design_scores_gemma":[0.0010383192,0.000108986664,0.00034174757,0.0002841506,0.000027094105,0.00011751161,0.000040366085,0.102131374,0.88620037,0.0026208058,0.0064627053,0.00062659354],"about_ca_topic_score_codex":0.000008688642,"about_ca_topic_score_gemma":8.446518e-7,"teacher_disagreement_score":0.67954534,"about_ca_system_score_codex":0.000043262935,"about_ca_system_score_gemma":0.00006275633,"threshold_uncertainty_score":0.52885205},"labels":[],"label_agreement":null},{"id":"W2054040518","doi":"10.1109/97.889636","title":"Wavelet speech enhancement based on the Teager energy operator","year":2001,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Energy operator; Speech enhancement; Wavelet; Speech recognition; Energy (signal processing); Computer science; Noise (video); A priori and a posteriori; Artificial intelligence; Pattern recognition (psychology); Noise measurement; Wavelet transform; Noise reduction; Mathematics; Statistics","score_opus":0.015494806076616208,"score_gpt":0.22468159980515479,"score_spread":0.20918679372853857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054040518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06252097,0.00009960493,0.9049305,0.029038932,0.0002777685,0.00011222224,8.543742e-7,0.00020533358,0.0028138226],"genre_scores_gemma":[0.8881803,0.000003972725,0.018113287,0.09296055,0.00037838475,0.000034247616,0.0000013603011,0.000025053998,0.00030282937],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976701,0.00009851775,0.00030049292,0.00061343773,0.0007145907,0.0006028363],"domain_scores_gemma":[0.99903953,0.00012430003,0.00015465832,0.0004624606,0.00009533469,0.00012373755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004590565,0.0002953041,0.00019702203,0.00013957509,0.0005820969,0.0008272921,0.0011634987,0.00006259501,0.00012697148],"category_scores_gemma":[0.000019999703,0.00020281643,0.00008676652,0.0006859229,0.0001084642,0.00052999705,0.0000606541,0.0002688213,0.00008011402],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026563215,0.000115756266,0.000052325715,0.000024359126,0.000013341031,0.00019537879,0.00018567947,0.0010928091,0.5174167,0.0000782535,0.011753272,0.46904552],"study_design_scores_gemma":[0.0003613874,0.000091008886,0.00003831231,0.00019797281,0.000007988145,0.00003033539,0.000015940297,0.09952317,0.8876404,0.0001973874,0.0115008745,0.0003951978],"about_ca_topic_score_codex":0.000011022796,"about_ca_topic_score_gemma":0.0000017267282,"teacher_disagreement_score":0.8868172,"about_ca_system_score_codex":0.00009442612,"about_ca_system_score_gemma":0.00018268792,"threshold_uncertainty_score":0.8270614},"labels":[],"label_agreement":null},{"id":"W2056426543","doi":"10.1109/lsp.2013.2295919","title":"Optimal Non-regenerative Linear MIMO Relay for Orthogonal Space Time Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Relay; Computer science; Block code; Node (physics); Algorithm; Transmission (telecommunications); Constraint (computer-aided design); Decoding methods; Mathematical optimization; Power (physics); Mathematics; Telecommunications; Beamforming; Engineering","score_opus":0.023744280591426612,"score_gpt":0.26893856541071093,"score_spread":0.24519428481928432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056426543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046428554,0.00013570789,0.94309455,0.009568772,0.00012724593,0.00020370877,0.0000025558716,0.00014208768,0.00029678797],"genre_scores_gemma":[0.8141506,0.000007400551,0.18056567,0.004313326,0.0004369998,0.000051014995,0.000009759319,0.000023582514,0.00044170336],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851763,0.00015237057,0.00026636297,0.0004585014,0.0002430638,0.00036206387],"domain_scores_gemma":[0.9989065,0.00022369236,0.00016301076,0.0003670243,0.00023013818,0.000109662375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834239,0.00022411527,0.00024116399,0.000097562326,0.00057633844,0.00029198942,0.0008802178,0.00006298912,0.000014818638],"category_scores_gemma":[0.000035691563,0.00020704052,0.000093259834,0.0003329038,0.00012295044,0.000499385,0.00012183223,0.0002329155,0.00006311093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055092372,0.00009160884,0.000046318793,0.000057630383,0.000050961953,0.000004662617,0.0022194702,0.10973497,0.7543721,0.0023317484,0.021180533,0.10985486],"study_design_scores_gemma":[0.00042480568,0.00009394643,0.0000542713,0.0000976403,0.000009563775,0.0000066386197,0.000006143832,0.95955634,0.030755712,0.00003813933,0.008658775,0.0002980199],"about_ca_topic_score_codex":0.0000011270469,"about_ca_topic_score_gemma":0.0000021484364,"teacher_disagreement_score":0.8498214,"about_ca_system_score_codex":0.000045317367,"about_ca_system_score_gemma":0.00009896835,"threshold_uncertainty_score":0.84428674},"labels":[],"label_agreement":null},{"id":"W2058687912","doi":"10.1109/lsp.2012.2194142","title":"Time-Frequency Analysis via Ramanujan Sums","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Time–frequency analysis; Kernel (algebra); Signal processing; Algorithm; Ramanujan's sum; Mathematics; Computer science; Discrete mathematics; Digital signal processing; Pure mathematics","score_opus":0.007960043356324654,"score_gpt":0.23251962637157922,"score_spread":0.22455958301525455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058687912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94931656,0.00097573275,0.048482005,0.00054580544,0.00006450556,0.00006454491,0.000005848242,0.0000517664,0.0004932491],"genre_scores_gemma":[0.9951692,0.000008974882,0.0007880324,0.0029337567,0.0006321009,0.000012546052,0.00011752083,0.000031872816,0.0003059792],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998593,0.00006046447,0.00025221525,0.00035590242,0.00024048924,0.00049793406],"domain_scores_gemma":[0.9993498,0.000009180031,0.00013999052,0.00026348143,0.00006492813,0.00017262562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024998176,0.00022042949,0.00024315558,0.00016614221,0.00016292879,0.00006079591,0.00024356697,0.000121148645,0.000102374455],"category_scores_gemma":[0.00001145819,0.00019799937,0.00028574103,0.00058565283,0.00016887957,0.00003437656,0.000031920234,0.000121705416,0.00013197749],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017782413,0.0000572638,0.008830362,0.00001617786,0.0003636861,0.0000049176942,0.00007290709,0.00078417565,0.9819217,8.6533913e-7,0.0013109405,0.0066192686],"study_design_scores_gemma":[0.0006279883,0.0001941077,0.007293984,0.000040635332,0.002492496,0.000045891025,0.00010205733,0.0074140993,0.9744382,0.000111773516,0.0057055,0.0015332974],"about_ca_topic_score_codex":0.000059507605,"about_ca_topic_score_gemma":0.0000070687843,"teacher_disagreement_score":0.04769397,"about_ca_system_score_codex":0.000025450949,"about_ca_system_score_gemma":0.000032198466,"threshold_uncertainty_score":0.807418},"labels":[],"label_agreement":null},{"id":"W2064878266","doi":"10.1109/lsp.2013.2262939","title":"Sum-Rate Maximization for Active Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Maximization; Channel (broadcasting); Mathematical optimization; Power (physics); Computer science; Power gain; Signal-to-noise ratio (imaging); Mathematics; Telecommunications; Physics; Amplifier; Bandwidth (computing)","score_opus":0.012454201381007416,"score_gpt":0.20368526409614515,"score_spread":0.19123106271513773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064878266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28986424,0.00007677978,0.7077871,0.0004847877,0.0005892732,0.00028833543,0.0000033909625,0.0006099257,0.0002961669],"genre_scores_gemma":[0.9937105,0.0000040677064,0.004222978,0.0009141211,0.0007050113,0.00023940275,0.00002068015,0.00009295232,0.000090295805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.000022259585,0.00020497244,0.00022299877,0.00011664069,0.00039524402],"domain_scores_gemma":[0.99956185,0.0001051217,0.00006425131,0.00010387225,0.000089647256,0.000075283606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010060213,0.00020287547,0.00016291226,0.00008526715,0.00013169454,0.00018976485,0.00016229485,0.0000946167,0.000026900836],"category_scores_gemma":[0.000013739147,0.00021117029,0.000047835445,0.00018869208,0.00004871725,0.00053664244,0.000008583813,0.00016895524,0.000029500985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005491295,0.0000061149995,0.000018401097,0.00012157305,0.000020188978,0.0000013803419,0.00015881563,0.8321593,0.12469693,0.000006912885,0.0062840367,0.03652089],"study_design_scores_gemma":[0.00028131073,0.00001765434,0.0001869434,0.00017165794,0.00001667646,0.000003051933,0.000019046238,0.9378082,0.06031752,0.0002574447,0.0005922407,0.0003282167],"about_ca_topic_score_codex":0.000013157516,"about_ca_topic_score_gemma":0.0000016322691,"teacher_disagreement_score":0.7038463,"about_ca_system_score_codex":0.000073881056,"about_ca_system_score_gemma":0.000014257603,"threshold_uncertainty_score":0.86112744},"labels":[],"label_agreement":null},{"id":"W2068355928","doi":"10.1109/lsp.2007.896176","title":"Receive Antenna Selection Based on Union-Bound Minimization Using Convex Optimization","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transmitter; Mathematical optimization; MIMO; Antenna (radio); Selection (genetic algorithm); Convex optimization; Computer science; Optimization problem; Computational complexity theory; Minification; Algorithm; Mathematics; Upper and lower bounds; Interior point method; Regular polygon; Telecommunications; Beamforming","score_opus":0.01640996327632522,"score_gpt":0.25594514161115084,"score_spread":0.23953517833482563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068355928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01846495,0.00004428392,0.9797778,0.00017389619,0.00014396431,0.00019428557,0.0000022875406,0.0009555876,0.00024291073],"genre_scores_gemma":[0.8816661,0.0000110302135,0.11749696,0.000589658,0.000120253164,0.000010067975,0.000029902623,0.00007050411,0.0000055271803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988647,0.00005928851,0.00032734036,0.000223506,0.0002470046,0.00027814554],"domain_scores_gemma":[0.9994163,0.00009922365,0.00013360515,0.00017741756,0.00011310949,0.000060328864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030352353,0.00020932422,0.00015735191,0.00033879455,0.00023697605,0.000084386375,0.0001672102,0.00011535968,0.000022653016],"category_scores_gemma":[0.000013932492,0.00024258782,0.00003739155,0.00049574726,0.000075170195,0.00042311073,0.000007361101,0.0002542115,0.0000039623123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020693453,0.000013712481,0.000091630565,0.00004013299,0.000005428355,0.0000015747208,0.000070345224,0.8170838,0.17361644,0.0000042869374,0.00011899245,0.008932963],"study_design_scores_gemma":[0.00019596687,0.00002532756,0.00005400929,0.00017811747,0.000011582547,0.000003979379,0.000022504848,0.8846378,0.11450918,0.000020165884,0.00010468872,0.0002367198],"about_ca_topic_score_codex":0.000011875155,"about_ca_topic_score_gemma":0.0000036981078,"teacher_disagreement_score":0.86320114,"about_ca_system_score_codex":0.0004531709,"about_ca_system_score_gemma":0.000040649255,"threshold_uncertainty_score":0.9892444},"labels":[],"label_agreement":null},{"id":"W2068403421","doi":"10.1109/lsp.2014.2372333","title":"No-Reference Quality Assessment of Contrast-Distorted Images Based on Natural Scene Statistics","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":340,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scene statistics; Contrast (vision); Artificial intelligence; Computer science; Image quality; Support vector machine; Distortion (music); Mean opinion score; Entropy (arrow of time); Pattern recognition (psychology); Quality Score; Quality (philosophy); Regression; Computer vision; Statistics; Image (mathematics); Mathematics; Perception; Metric (unit)","score_opus":0.03557197115822961,"score_gpt":0.3340860052783217,"score_spread":0.2985140341200921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068403421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007599418,0.000017901239,0.98945206,0.00139345,0.0003313618,0.0001564127,0.000031242966,0.000119109725,0.00089903554],"genre_scores_gemma":[0.8499739,5.4329263e-7,0.14361133,0.0062335823,0.00009282956,0.000012223092,0.000020108451,0.000013664666,0.00004182443],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970114,0.00047582478,0.00060606445,0.00054836145,0.0009400809,0.00041826197],"domain_scores_gemma":[0.99799067,0.00052946014,0.00048443428,0.00048308756,0.00040225146,0.000110120476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011266946,0.00027308284,0.0004058776,0.0001323205,0.00019568198,0.00027276238,0.00077599724,0.0000583457,0.000018174254],"category_scores_gemma":[0.00008462527,0.00024621576,0.00007335198,0.00024678043,0.00018784803,0.00047684295,0.00005125002,0.0003796812,0.000014462408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118117445,0.0008076947,0.0020326916,0.0011624744,0.00006858481,0.000036601807,0.0002714519,0.006198265,0.76189893,0.005360265,0.009819296,0.21222562],"study_design_scores_gemma":[0.00132626,0.00033838538,0.025171645,0.00030840054,0.00002816509,0.0000020437096,0.000012251281,0.9357303,0.03555056,0.0003964455,0.0005487192,0.0005868428],"about_ca_topic_score_codex":0.00010051986,"about_ca_topic_score_gemma":0.0000046770865,"teacher_disagreement_score":0.929532,"about_ca_system_score_codex":0.00013163092,"about_ca_system_score_gemma":0.00028817248,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W2074905719","doi":"10.1109/lsp.2015.2407196","title":"Structure-Induced Complex Kalman Filter for Decentralized Sequential Bayesian Estimation","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Kalman filter; Computer science; Overhead (engineering); Computation; Filter (signal processing); Covariance; Algorithm; Artificial intelligence; Mathematics; Statistics; Computer vision","score_opus":0.0630893052736087,"score_gpt":0.29759018526909914,"score_spread":0.23450087999549044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074905719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047537208,0.00002940511,0.94871193,0.0022511417,0.000842955,0.00025591205,0.000019329476,0.000310836,0.00004127398],"genre_scores_gemma":[0.7836977,2.947237e-7,0.21343084,0.0024420081,0.0003120871,0.000012084165,0.00007503252,0.00002186171,0.000008052433],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980607,0.00009100441,0.0003595019,0.0005328333,0.0004516936,0.00050425035],"domain_scores_gemma":[0.9990071,0.000076407625,0.00020229499,0.0003374614,0.00015243048,0.00022427885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026751088,0.00024253366,0.00023489853,0.000115792245,0.0002908513,0.00058771105,0.00074158364,0.00010055434,0.000021895612],"category_scores_gemma":[0.00002734504,0.00022579718,0.00007900797,0.00027553044,0.00006031662,0.0007925518,0.000060085782,0.00018846281,0.000010854154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002106394,0.00010085343,0.0001878084,0.00017912996,0.00006251365,0.00005684875,0.0025718568,0.11264881,0.45883945,0.0008729071,0.12007396,0.30419523],"study_design_scores_gemma":[0.0012405692,0.000068873866,0.000109661036,0.000068717134,0.000021566104,0.000041147137,0.00001446471,0.97266114,0.02037297,0.0024558415,0.0025571336,0.00038794498],"about_ca_topic_score_codex":0.000021947608,"about_ca_topic_score_gemma":0.0000043312834,"teacher_disagreement_score":0.8600123,"about_ca_system_score_codex":0.000082253784,"about_ca_system_score_gemma":0.00011157439,"threshold_uncertainty_score":0.92077416},"labels":[],"label_agreement":null},{"id":"W2085825224","doi":"10.1109/lsp.2012.2190280","title":"Simultaneous Feature and Model Selection for Continuous Hidden Markov Models","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Hidden Markov model; Feature selection; Artificial intelligence; Markov model; Pattern recognition (psychology); Model selection; Selection (genetic algorithm); Maximum-entropy Markov model; Feature (linguistics); Markov process; Data modeling; Markov chain; Machine learning; Variable-order Markov model; Mathematics; Statistics","score_opus":0.017139816809225668,"score_gpt":0.2578869165525539,"score_spread":0.24074709974332825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085825224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01000152,0.00059511233,0.98649025,0.002110869,0.00016102454,0.0002850577,0.0000036488404,0.00017866929,0.00017384897],"genre_scores_gemma":[0.4980132,0.0000025853067,0.49930692,0.0022595811,0.00020668616,0.000022123659,9.4135856e-7,0.00001731013,0.00017065318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856365,0.00006353409,0.00017657725,0.00042231602,0.00021715285,0.00055678026],"domain_scores_gemma":[0.99930197,0.00015098069,0.0001197842,0.00015425823,0.00010193483,0.0001710849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045247647,0.00023251936,0.0002425508,0.0000953525,0.00027455232,0.000266529,0.0003105311,0.00013505171,6.68931e-7],"category_scores_gemma":[0.000015459716,0.0002087698,0.00006645268,0.00018190268,0.00005253816,0.0011813003,0.0000425102,0.0002256112,9.870448e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056431905,0.000059040754,0.000035002427,0.0001604815,0.000027222737,0.000004151256,0.0019913574,0.010755955,0.114225656,0.0025560048,0.0056969086,0.8644318],"study_design_scores_gemma":[0.00030273647,0.000035980673,0.0000031693362,0.000040840172,0.000025069086,0.00006318814,0.000004477784,0.98169374,0.004246459,0.013124624,0.0001744082,0.00028529504],"about_ca_topic_score_codex":0.000004501204,"about_ca_topic_score_gemma":7.658583e-7,"teacher_disagreement_score":0.9709378,"about_ca_system_score_codex":0.000045320947,"about_ca_system_score_gemma":0.00005358182,"threshold_uncertainty_score":0.8513385},"labels":[],"label_agreement":null},{"id":"W2087364536","doi":"10.1109/lsp.2014.2362932","title":"Constant Modulus Blind Adaptive Beamforming Based on Unscented Kalman Filtering","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kalman filter; Constant (computer programming); Algorithm; Beamforming; Control theory (sociology); Noise (video); Extended Kalman filter; Adaptive filter; Covariance matrix; Covariance; Mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.022403969720660527,"score_gpt":0.24993786564012105,"score_spread":0.22753389591946052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087364536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823484,0.000008638276,0.9758937,0.0027912757,0.0001428248,0.00020104428,0.0000015483268,0.0006251645,0.0015123464],"genre_scores_gemma":[0.8945866,2.862896e-7,0.09134289,0.013907306,0.000094495364,0.000023243692,0.0000028274667,0.000023454384,0.000018854396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981039,0.00014435708,0.00032090614,0.0005345598,0.00049786305,0.00039839916],"domain_scores_gemma":[0.99909186,0.00011459299,0.00022085628,0.00036035274,0.00009714245,0.00011520512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953068,0.00025253705,0.00021861588,0.000297923,0.00028331776,0.00036893145,0.00065707054,0.000077054094,0.000006304204],"category_scores_gemma":[0.00002163575,0.00024320683,0.00007674408,0.00041282052,0.000108850174,0.00066711515,0.000053138792,0.00032512605,0.000019793204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003195196,0.0003347787,0.00014396434,0.0001664172,0.000044537974,0.00006879195,0.0034447715,0.16576493,0.5385188,0.0071546948,0.0038669982,0.28017184],"study_design_scores_gemma":[0.0005464898,0.00017974249,0.000030710096,0.00025402327,0.000005816317,0.000006720419,0.000012678823,0.89965385,0.097774856,0.00043989622,0.0007842994,0.0003109168],"about_ca_topic_score_codex":0.000012842806,"about_ca_topic_score_gemma":0.0000023646103,"teacher_disagreement_score":0.8845508,"about_ca_system_score_codex":0.00009283016,"about_ca_system_score_gemma":0.000095500014,"threshold_uncertainty_score":0.99176866},"labels":[],"label_agreement":null},{"id":"W2088550858","doi":"10.1109/lsp.2007.905096","title":"Optimal Soft Slicer Design for MMSE-DFE","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université Laval","funders":"","keywords":"Equalizer; Noise (video); Mean squared error; Computer science; Optimal design; Gaussian; Gaussian noise; Minimum mean square error; Control theory (sociology); Algorithm; Electronic engineering; Engineering; Mathematics; Artificial intelligence; Statistics; Telecommunications","score_opus":0.026195379593097517,"score_gpt":0.27298755300769906,"score_spread":0.24679217341460155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088550858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014879088,0.00032958292,0.98253864,0.00026908296,0.000084680556,0.00032285065,0.0000025867548,0.0013815068,0.00019197901],"genre_scores_gemma":[0.68374914,0.0000066630096,0.3152034,0.0007250022,0.00014373478,0.00007225425,0.0000041144303,0.00007533113,0.000020369982],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988729,0.00001742411,0.00030757024,0.00020171588,0.00017031262,0.0004301214],"domain_scores_gemma":[0.99930626,0.00022761476,0.0000721576,0.00024251414,0.000071815666,0.000079653975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042827678,0.00020987168,0.00017732472,0.00014259468,0.00016266102,0.00006616475,0.00036980034,0.00009294395,0.000009923725],"category_scores_gemma":[0.000014081005,0.0002286481,0.0000637053,0.00019730107,0.00008116157,0.0003425368,0.000016788304,0.00024082189,0.000011244619],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003633629,0.0000147221945,0.000009266023,0.00011332411,0.00001660246,0.0000039231304,0.00026308594,0.3320669,0.552422,0.000013258281,0.0046461998,0.110394426],"study_design_scores_gemma":[0.00036227822,0.00004505494,0.00003312296,0.00013230898,0.00002040469,0.000011059687,0.00005300099,0.2416135,0.7490201,0.0002463449,0.007955899,0.00050690875],"about_ca_topic_score_codex":0.0000015595978,"about_ca_topic_score_gemma":7.130589e-7,"teacher_disagreement_score":0.66887003,"about_ca_system_score_codex":0.000116251365,"about_ca_system_score_gemma":0.000019752553,"threshold_uncertainty_score":0.9323999},"labels":[],"label_agreement":null},{"id":"W2092305139","doi":"10.1109/lsp.2014.2381458","title":"FSITM: A Feature Similarity Index For Tone-Mapped Images","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Pattern recognition (psychology); Feature (linguistics); Similarity (geometry); Feature extraction; Range (aeronautics); Image (mathematics)","score_opus":0.01226481585074939,"score_gpt":0.2747091463863644,"score_spread":0.262444330535615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092305139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053447904,0.00006565,0.9807022,0.012104644,0.00018970657,0.00034993445,0.0000028429308,0.000747052,0.0004931805],"genre_scores_gemma":[0.7962143,0.0000011278878,0.1951944,0.007850838,0.00038849658,0.000094982985,0.0000038730823,0.000026380378,0.000225646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982268,0.00006912941,0.00021619408,0.000595389,0.00038136798,0.0005111034],"domain_scores_gemma":[0.99910057,0.00010106745,0.0001749737,0.000394702,0.0001439547,0.00008471265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005276925,0.0002584962,0.00023921454,0.00014956594,0.00030182122,0.0005277337,0.0010391452,0.00010553156,0.0000040081813],"category_scores_gemma":[0.000028753928,0.00024604824,0.000098133474,0.0003168275,0.00010745752,0.0010742783,0.000103428785,0.00028757725,0.000008957196],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045641482,0.00008972939,0.0002276836,0.0003135406,0.000024209769,0.000027972656,0.00050593726,0.00015929055,0.6389408,0.00022535743,0.11800532,0.24143451],"study_design_scores_gemma":[0.0011745369,0.00020845217,0.00039511846,0.00026579504,0.0000260211,0.00003644967,0.00001134057,0.13539606,0.8291466,0.0035636732,0.028891876,0.00088406046],"about_ca_topic_score_codex":0.000006921854,"about_ca_topic_score_gemma":0.0000011467264,"teacher_disagreement_score":0.7908695,"about_ca_system_score_codex":0.00006592385,"about_ca_system_score_gemma":0.000060188802,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W2096084339","doi":"10.1109/lsp.2010.2051574","title":"A Template Matching Procedure for Automatic Target Recognition in Synthetic Aperture Sonar Imagery","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Sonar; Synthetic aperture sonar; Artificial intelligence; Computer science; Computer vision; Pattern recognition (psychology); Template matching; Automatic target recognition; Matching (statistics); Shadow (psychology); Synthetic aperture radar; Receiver operating characteristic; Image (mathematics); Mathematics","score_opus":0.02077882598449221,"score_gpt":0.2480856596607653,"score_spread":0.22730683367627308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096084339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8978611,0.000049543272,0.09802515,0.0028023527,0.00018610912,0.0006153299,0.00009487634,0.00013839659,0.00022713377],"genre_scores_gemma":[0.95337534,0.0000017976477,0.044577483,0.0016693046,0.00020518589,0.000023712437,0.00010124531,0.000019277264,0.000026669062],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819493,0.000058595568,0.0003108575,0.00042580368,0.0003910331,0.00061875023],"domain_scores_gemma":[0.9991791,0.00041765708,0.0001027622,0.00010912259,0.000063578205,0.0001277496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307217,0.00021397827,0.00021711852,0.0002907375,0.0002736414,0.0003232192,0.00023158886,0.00012856393,0.00044582764],"category_scores_gemma":[0.00006473692,0.00018340374,0.00006034637,0.00029367674,0.00012702179,0.00052771205,0.0000076219662,0.0006129857,0.000119943674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017616877,0.00009788774,0.00883341,0.0023316501,0.000033541746,0.00022885438,0.0022490206,0.032880742,0.67981684,2.7667636e-7,0.0020012138,0.27135038],"study_design_scores_gemma":[0.00053659553,0.00007358438,0.0031757737,0.00039237353,0.000020561216,0.00016876867,0.00012977936,0.9857835,0.0057151797,0.0031547188,0.000369078,0.00048007924],"about_ca_topic_score_codex":0.00017761828,"about_ca_topic_score_gemma":0.00033835278,"teacher_disagreement_score":0.9529028,"about_ca_system_score_codex":0.000012886946,"about_ca_system_score_gemma":0.00015504136,"threshold_uncertainty_score":0.74789876},"labels":[],"label_agreement":null},{"id":"W2097993571","doi":"10.1109/lsp.2004.833486","title":"Subsampling Matrices for Wavelet Decompositions on Body Centered Cubic Lattices","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Wavelet; Lattice (music); Filter bank; Upsampling; Matrix (chemical analysis); Filter (signal processing); Algorithm; Applied mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.036516394162294456,"score_gpt":0.3082803783564526,"score_spread":0.27176398419415815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097993571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08914737,0.0001665211,0.9050354,0.0046505453,0.000364819,0.00023644292,0.0000063340485,0.00025735982,0.00013521475],"genre_scores_gemma":[0.7029949,0.0000031834375,0.29116955,0.0054398566,0.0003065602,0.000030571955,0.0000066952166,0.000027205433,0.000021469306],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980367,0.00008055257,0.0003550162,0.0005938964,0.00037107605,0.0005627958],"domain_scores_gemma":[0.9989805,0.00028478267,0.00020502116,0.00028931868,0.00011788298,0.00012249169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047759697,0.00026766455,0.000256386,0.00027424557,0.0006434817,0.0008384949,0.00082616514,0.00007221871,0.0000040884665],"category_scores_gemma":[0.000021143198,0.00025132124,0.00015188342,0.0004473358,0.0000742431,0.0009201945,0.000044953224,0.00022378768,0.000031003485],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014848495,0.00028639997,0.000029436358,0.00028759785,0.000060742666,0.00010614132,0.0013248782,0.015800543,0.90659404,0.0016850596,0.001153551,0.07252315],"study_design_scores_gemma":[0.0067709885,0.00087973237,0.0006266645,0.0017799486,0.00016634275,0.00020139616,0.00006983945,0.11722645,0.8415226,0.025979357,0.00282159,0.0019551234],"about_ca_topic_score_codex":0.000017986411,"about_ca_topic_score_gemma":0.0000012891041,"teacher_disagreement_score":0.61386585,"about_ca_system_score_codex":0.00010967689,"about_ca_system_score_gemma":0.00010279286,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W2098010864","doi":"10.1109/lsp.2004.831721","title":"Maximal Gap of a Sampling Set for the Exact Iterative Reconstruction Algorithm in Shift Invariant Spaces","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bandlimiting; Invariant (physics); Nyquist–Shannon sampling theorem; Nyquist rate; Algorithm; Mathematics; Sampling (signal processing); Nonuniform sampling; Iterative method; Signal reconstruction; Filter (signal processing); Computer science; Signal processing; Fourier transform; Digital signal processing; Mathematical analysis; Computer vision","score_opus":0.10290560255561343,"score_gpt":0.3516640625095064,"score_spread":0.24875845995389295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098010864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09251581,0.00006509758,0.9052173,0.0017018806,0.000048168076,0.00033798456,0.00001407135,0.000022056336,0.00007763756],"genre_scores_gemma":[0.6216191,0.0000032428154,0.37802202,0.00019318801,0.00009011034,0.000048541675,0.0000019065776,0.000017764354,0.000004123252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986492,0.00007391748,0.0005375543,0.0002402959,0.00024190525,0.00025712847],"domain_scores_gemma":[0.99865556,0.0008605067,0.0002538407,0.00012652624,0.000063419226,0.000040135506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011449982,0.00018259071,0.0003864681,0.00012700423,0.00014547037,0.000104529245,0.00016373946,0.00006633957,0.00002825119],"category_scores_gemma":[0.00008916672,0.00011889658,0.00015437228,0.00029346516,0.00014038863,0.00022465379,0.000009670393,0.00020121827,9.5181514e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065284176,0.0011210771,0.00044705416,0.00753939,0.0011363586,0.00005511199,0.04761882,0.017804993,0.16591074,0.06637842,0.00019262158,0.69114256],"study_design_scores_gemma":[0.0017461997,0.00013174722,0.000098446915,0.0014275616,0.00032475617,0.000052407944,0.001262357,0.060756743,0.044272967,0.88945144,0.000044298995,0.00043109996],"about_ca_topic_score_codex":0.000046743433,"about_ca_topic_score_gemma":0.000038101924,"teacher_disagreement_score":0.82307297,"about_ca_system_score_codex":0.000050155224,"about_ca_system_score_gemma":0.000061616294,"threshold_uncertainty_score":0.48484617},"labels":[],"label_agreement":null},{"id":"W2098087097","doi":"10.1109/lsp.2002.804133","title":"Natural gradient learning neural networks for adaptive inversion of Hammerstein systems","year":2002,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gradient descent; Backpropagation; Adaptive filter; Artificial neural network; Kernel adaptive filter; Computer science; Multilayer perceptron; Nonlinear system; Activation function; Adaptive system; Inversion (geology); Perceptron; Algorithm; Adaptive algorithm; Adaptive learning; Filter (signal processing); Control theory (sociology); Artificial intelligence; Filter design","score_opus":0.02519008230801976,"score_gpt":0.2214355908204638,"score_spread":0.19624550851244404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098087097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054485064,0.00095888996,0.9417531,0.0019129518,0.00042402098,0.00031639336,9.1041267e-7,0.000113221206,0.00003547046],"genre_scores_gemma":[0.9962157,0.000005064465,0.002691082,0.00070535275,0.00024765907,0.000040267707,0.0000023904722,0.000014240315,0.000078264056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987504,0.000055390105,0.0002675015,0.00036079696,0.00021788328,0.00034801176],"domain_scores_gemma":[0.9993107,0.00011970138,0.00025363153,0.00015311483,0.00008798531,0.000074892705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012738207,0.00015938793,0.0001924749,0.00007940601,0.00031072728,0.00014107484,0.00045774775,0.000046693538,0.000001369495],"category_scores_gemma":[0.000003922841,0.00014256859,0.000096719596,0.0003923179,0.00007976569,0.00040221782,0.00004631157,0.00025913518,0.0000021761884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021102622,0.000041570464,0.000052695603,0.00007202748,0.000020872874,0.0000063719917,0.00046211126,0.87015903,0.027608756,0.00057248975,0.0075502624,0.09343269],"study_design_scores_gemma":[0.00025471262,0.00008859162,0.00001260387,0.000081147955,0.000011302083,0.000008435621,0.000033219614,0.99811035,0.00079227926,0.00003022513,0.00041138992,0.00016572324],"about_ca_topic_score_codex":0.00001408197,"about_ca_topic_score_gemma":7.1051267e-7,"teacher_disagreement_score":0.9417306,"about_ca_system_score_codex":0.00003980756,"about_ca_system_score_gemma":0.000006764886,"threshold_uncertainty_score":0.58137786},"labels":[],"label_agreement":null},{"id":"W2099508202","doi":"10.1109/lsp.2011.2109711","title":"Minimizing the Effect of Sampling Jitters in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sampling (signal processing); Wireless sensor network; Discretization; Computer science; Invariant (physics); Algorithm; Jitter; Synchronization (alternating current); Mathematical optimization; Control theory (sociology); Filter (signal processing); Mathematics; Artificial intelligence; Computer vision; Channel (broadcasting); Telecommunications; Computer network; Mathematical analysis","score_opus":0.022081012154578642,"score_gpt":0.2285486826656723,"score_spread":0.20646767051109366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099508202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49569386,0.000094956646,0.5033576,0.00024976468,0.00027305912,0.00013007973,1.9406868e-7,0.00008542668,0.00011504643],"genre_scores_gemma":[0.9874143,0.000004597634,0.011337723,0.001021476,0.00015975375,0.000020760546,8.8826886e-7,0.000034672208,0.0000058050023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974903,0.00033622995,0.0005170028,0.000564082,0.0004142514,0.00067814457],"domain_scores_gemma":[0.9984938,0.00056259707,0.00034005078,0.0004748283,0.00004744555,0.00008130005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089034496,0.00031808252,0.0003935777,0.00020839866,0.00019773019,0.00012859136,0.0012797981,0.00011593247,0.0000034285101],"category_scores_gemma":[0.000013542271,0.00023456183,0.00012759796,0.00091706106,0.00024719688,0.00036498715,0.00012185261,0.0004907143,0.0000034229363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010373621,0.000047439014,0.0065116617,0.00012075276,0.000033243752,0.00008336716,0.0024558133,0.8598029,0.05613539,0.00008302144,0.00014344061,0.074479245],"study_design_scores_gemma":[0.00064792304,0.0001315396,0.0017740584,0.00055164244,0.000023396102,0.000029494346,0.000047334834,0.9410388,0.055311374,0.000012121566,0.00002065867,0.00041168102],"about_ca_topic_score_codex":0.000071024486,"about_ca_topic_score_gemma":0.0000069589587,"teacher_disagreement_score":0.4920199,"about_ca_system_score_codex":0.000061909086,"about_ca_system_score_gemma":0.000028409937,"threshold_uncertainty_score":0.9565154},"labels":[],"label_agreement":null},{"id":"W2101773947","doi":"10.1109/lsp.2005.849497","title":"A novel chaos-based high-resolution imaging technique and its application to through-the-wall imaging","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Microwave Imaging and Scattering Analysis","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Radar imaging; Computer science; Image resolution; Radar; Modulation (music); Noise (video); Signal-to-noise ratio (imaging); Resolution (logic); Doppler effect; Medical imaging; Artificial intelligence; Physics; Image (mathematics); Telecommunications; Acoustics","score_opus":0.007447983199257703,"score_gpt":0.21970498307951536,"score_spread":0.21225699988025765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101773947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04279621,0.00059574645,0.9382592,0.017465794,0.000043756867,0.00026132184,0.0000053059457,0.00050965365,0.000063035346],"genre_scores_gemma":[0.97618383,0.0000036551248,0.016626632,0.006715156,0.00023970036,0.00014806949,0.000008659161,0.00006332184,0.000010980225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867857,0.00002312995,0.000288594,0.00038259145,0.00021714266,0.00040998444],"domain_scores_gemma":[0.9995533,0.00003363096,0.00006988038,0.00020721526,0.000055627435,0.000080333644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002745586,0.00026138776,0.00019026748,0.00018405644,0.00027301747,0.00019441156,0.00022876906,0.000034092143,0.000005781365],"category_scores_gemma":[0.000006367893,0.0002465507,0.00005778564,0.00037865463,0.00006205264,0.0003312602,0.000021983433,0.00025765965,0.000027721893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004466668,0.000010620515,0.000051115883,0.000077895995,0.000010277399,0.0000016253504,0.00026441927,0.19172174,0.7811341,0.0000036028086,0.0008586241,0.025861472],"study_design_scores_gemma":[0.00020459389,0.0000033880358,0.0001084431,0.00015136808,0.000045932695,0.000031094864,0.000017826635,0.7978987,0.19789891,0.00001793253,0.0033035295,0.0003182605],"about_ca_topic_score_codex":0.00012180649,"about_ca_topic_score_gemma":0.000008913085,"teacher_disagreement_score":0.93338764,"about_ca_system_score_codex":0.00015489958,"about_ca_system_score_gemma":0.000018249426,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W2102842504","doi":"10.1109/lsp.2004.827917","title":"Exact Fractional-Order Differentiators for Polynomial Signals","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Control Systems Design","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Differentiator; Mathematics; Fractional calculus; Polynomial; Integer (computer science); Applied mathematics; Impulse response; Impulse (physics); Mathematical analysis; Computer science; Bandwidth (computing)","score_opus":0.011040532937078962,"score_gpt":0.2291901033403009,"score_spread":0.21814957040322194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102842504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087766685,0.00035002085,0.9097133,0.00048197364,0.00063543045,0.00040347697,0.000013601497,0.0005062138,0.00012926097],"genre_scores_gemma":[0.99324495,0.0000021097235,0.0045462344,0.00082211493,0.001050673,0.00016994886,0.000009871427,0.00011368998,0.000040409457],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848336,0.000020329606,0.00037613284,0.00032183534,0.0002849648,0.00051338726],"domain_scores_gemma":[0.9994474,0.0001105493,0.000103129736,0.00014431028,0.00007531893,0.000119273194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012170913,0.00031474826,0.00031596018,0.00015132823,0.00018750523,0.00012454436,0.00019554932,0.00011427074,0.000027843853],"category_scores_gemma":[0.000015113885,0.00032087846,0.00012652477,0.00020264342,0.00005241224,0.00046234223,0.0000067082187,0.00023076526,0.000038971142],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004013736,0.00001871185,0.000021812839,0.0001326897,0.000062002546,0.0000064065557,0.00010184866,0.46208122,0.5298922,0.000008580704,0.0017891068,0.005845262],"study_design_scores_gemma":[0.01920004,0.00045200062,0.0011898394,0.0015730897,0.0005215183,0.00017266822,0.00027693875,0.3205456,0.61824775,0.0045319214,0.028015748,0.0052728807],"about_ca_topic_score_codex":0.000009875868,"about_ca_topic_score_gemma":0.0000023116866,"teacher_disagreement_score":0.90547824,"about_ca_system_score_codex":0.00026928648,"about_ca_system_score_gemma":0.0000616437,"threshold_uncertainty_score":0.9999243},"labels":[],"label_agreement":null},{"id":"W2102868031","doi":"10.1109/lsp.2005.851259","title":"Concurrent data transmission through analog speech channel using data hiding","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Decoding methods; Data transmission; Speech coding; Information hiding; Bit error rate; Transmission (telecommunications); Speech recognition; Embedding; Voice activity detection; Channel (broadcasting); Set (abstract data type); SIGNAL (programming language); Speech processing; Computer hardware; Computer network; Artificial intelligence; Algorithm; Telecommunications","score_opus":0.11715877038861656,"score_gpt":0.3357297328575816,"score_spread":0.21857096246896507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102868031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045642033,0.0008800659,0.99079853,0.0027441508,0.00018852967,0.00017018194,0.00002816624,0.0005508586,0.000075330805],"genre_scores_gemma":[0.6347944,0.00003638035,0.3627559,0.001934592,0.00038331043,0.0000026135083,0.00006680128,0.000022322634,0.0000036405704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730456,0.00009253185,0.00041650195,0.0011354603,0.0004866029,0.00056432607],"domain_scores_gemma":[0.9981005,0.000053746266,0.00022751685,0.0014613916,0.000052603846,0.00010422515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056789856,0.00030718502,0.0002725813,0.00016222156,0.00049268693,0.00040096158,0.0044223606,0.0000883691,0.0000038705202],"category_scores_gemma":[0.0000058340643,0.00027909127,0.000052921463,0.0005852538,0.00013913434,0.0056525054,0.00068057975,0.00036393813,0.0000037916946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008827889,0.000076118195,0.000031418913,0.00010996416,0.00002472243,0.00006304475,0.0008282437,0.0018456844,0.10917236,0.000053581847,0.0035485474,0.88423747],"study_design_scores_gemma":[0.00030897895,0.000029174373,0.0000090823505,0.0005458456,0.00003478069,0.000100891055,0.000014380616,0.9086228,0.06538455,0.00088118855,0.023518726,0.00054959446],"about_ca_topic_score_codex":0.000022042434,"about_ca_topic_score_gemma":0.0000016035102,"teacher_disagreement_score":0.90677714,"about_ca_system_score_codex":0.000056740755,"about_ca_system_score_gemma":0.00008337236,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W2103636088","doi":"10.1109/lsp.2003.813679","title":"Speech probability distribution","year":2003,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":298,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decorrelation; Generalized gamma distribution; Distribution (mathematics); Marginal distribution; Mathematics; Generalized integer gamma distribution; Speech processing; Speech recognition; Probability distribution; Multivariate statistics; Gaussian; Gamma distribution; Multivariate normal distribution; Joint probability distribution; Discrete cosine transform; Computer science; Random variable; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.018041832663961418,"score_gpt":0.23248197373314894,"score_spread":0.21444014106918752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103636088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.167688,0.00014093002,0.8288153,0.001867329,0.00021623295,0.00012622755,0.000001733291,0.0003115462,0.0008327315],"genre_scores_gemma":[0.9194753,0.0000010289074,0.07819356,0.0021523996,0.000105770196,0.000013787587,0.000003409973,0.00001276179,0.00004196817],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980541,0.00009933966,0.00029008838,0.00059129647,0.00043786655,0.0005273426],"domain_scores_gemma":[0.9992315,0.000044188495,0.00015364825,0.00031820475,0.000116873,0.0001355525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005768498,0.00021648516,0.00018337693,0.000058234735,0.00036714756,0.00052765926,0.0005813432,0.0000702182,0.000017115843],"category_scores_gemma":[0.00006231927,0.00020053673,0.00007622961,0.00065203645,0.00011521953,0.0010759123,0.000034300843,0.00024727243,0.000055681692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013448427,0.00019375369,0.0018609177,0.0002396395,0.00001845279,0.000100393656,0.00041054064,0.00071857544,0.48086068,0.00088877574,0.0053306194,0.5093642],"study_design_scores_gemma":[0.00043962133,0.00004855947,0.00058659294,0.0001232565,0.000012233427,0.00014161,0.0000139193235,0.003454244,0.97700614,0.011319867,0.0063025346,0.00055141095],"about_ca_topic_score_codex":0.000003947673,"about_ca_topic_score_gemma":9.25834e-7,"teacher_disagreement_score":0.7517873,"about_ca_system_score_codex":0.00012723738,"about_ca_system_score_gemma":0.00018557397,"threshold_uncertainty_score":0.81776506},"labels":[],"label_agreement":null},{"id":"W2105476049","doi":"10.1109/lsp.2010.2043152","title":"A Widely Linear Distortionless Filter for Single-Channel Noise Reduction","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Noise reduction; Distortion (music); Filter (signal processing); Computer science; Speech recognition; Noise (video); Reduction (mathematics); Noise measurement; Speech enhancement; Signal-to-noise ratio (imaging); Algorithm; Short-time Fourier transform; Mathematics; Fourier transform; Artificial intelligence; Telecommunications; Fourier analysis; Amplifier; Computer vision; Bandwidth (computing)","score_opus":0.026199003219751712,"score_gpt":0.24661025636581593,"score_spread":0.22041125314606422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105476049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16913822,0.000051995925,0.82444197,0.004503531,0.0012365769,0.0001943951,0.0000034598238,0.0003082048,0.000121664525],"genre_scores_gemma":[0.89376503,4.8720005e-7,0.102677874,0.0021257137,0.0012331299,0.000055665394,0.00000691999,0.00003395516,0.000101226695],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812895,0.000023011196,0.00034720072,0.0006434081,0.00034895507,0.00050848705],"domain_scores_gemma":[0.999028,0.000051050574,0.00025131588,0.00030501405,0.00021291598,0.00015167314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116174,0.00025284634,0.00020948595,0.00016889203,0.0004886792,0.0004896212,0.0006539142,0.00011234134,0.000006809018],"category_scores_gemma":[0.00003939535,0.00024219378,0.00011996286,0.00037520708,0.00013898138,0.0014071115,0.00004753635,0.0003469073,0.000019514902],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022686756,0.000065692926,0.000016549633,0.0000848591,0.0000073986657,0.0000075818316,0.00041198588,0.0005740469,0.9184802,0.000011235947,0.0018710358,0.07844674],"study_design_scores_gemma":[0.00054429716,0.000085188265,0.000043927692,0.00013226781,0.000021657703,0.00015039506,0.000026477437,0.03793261,0.95718855,0.0012317006,0.002143287,0.0004996495],"about_ca_topic_score_codex":0.0000068406935,"about_ca_topic_score_gemma":0.000003608856,"teacher_disagreement_score":0.7246268,"about_ca_system_score_codex":0.00006007662,"about_ca_system_score_gemma":0.000117764095,"threshold_uncertainty_score":0.9876376},"labels":[],"label_agreement":null},{"id":"W2106188774","doi":"10.1109/lsp.2011.2110644","title":"Performance Analysis of Joint User Scheduling and Antenna Selection Over MIMO Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Rayleigh fading; MIMO; Computer science; Fading; Scheduling (production processes); Block code; 3G MIMO; Coding (social sciences); Electronic engineering; Telecommunications; Algorithm; Mathematical optimization; Decoding methods; Mathematics; Engineering; Channel (broadcasting); Statistics","score_opus":0.017963922635838483,"score_gpt":0.20701836204880925,"score_spread":0.18905443941297076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106188774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526669,0.00008270748,0.44702592,0.000005552622,0.000058887592,0.000042093958,5.779425e-7,0.00008841903,0.000028925419],"genre_scores_gemma":[0.98461866,0.000043208143,0.015118839,0.000081272425,0.00008400174,0.000007857181,0.0000038961216,0.000036898087,0.000005361956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991377,0.000013255045,0.00026800067,0.00020057416,0.0001386677,0.00024181456],"domain_scores_gemma":[0.9997064,0.000013575896,0.000108885724,0.000069938156,0.000055350818,0.000045832745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011133579,0.00016176826,0.00025551667,0.00037741286,0.0000931984,0.000028542485,0.000062544816,0.000060565224,0.00001878097],"category_scores_gemma":[0.0000034595332,0.00017167868,0.000050412407,0.0008983047,0.000050323695,0.0005304823,0.000009812789,0.0001463937,8.7279693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010499641,0.0000062115732,0.005428013,0.00011410645,0.0001235045,9.318171e-7,0.00067166245,0.7922639,0.19790444,0.0000010662433,0.000007656909,0.0034679875],"study_design_scores_gemma":[0.00012956579,0.000015338623,0.005423875,0.00014506404,0.00018088598,0.0000023723921,0.000022739478,0.95518196,0.03870778,0.0000038281255,0.0000031075097,0.0001834845],"about_ca_topic_score_codex":0.00000680675,"about_ca_topic_score_gemma":0.0000017667697,"teacher_disagreement_score":0.43195176,"about_ca_system_score_codex":0.000048342175,"about_ca_system_score_gemma":0.0000072623875,"threshold_uncertainty_score":0.70008534},"labels":[],"label_agreement":null},{"id":"W2107363208","doi":"10.1109/lsp.2004.842286","title":"Optimal step size of the adaptive multichannel LMS algorithm for blind SIMO identification","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Algorithm; Computer science; Adaptive filter; System identification; Adaptive system; Norm (philosophy); Least mean squares filter; Computational complexity theory; Adaptive algorithm; Control theory (sociology); Mathematics; Artificial intelligence; Data modeling","score_opus":0.023243235674970608,"score_gpt":0.2721660751831672,"score_spread":0.2489228395081966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107363208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02025714,0.000040990242,0.97452694,0.004411886,0.000113996284,0.00046917106,0.000006937612,0.00014547292,0.0000274477],"genre_scores_gemma":[0.61845434,4.996989e-7,0.37961638,0.0016759922,0.000119776916,0.000051478382,8.9854217e-7,0.000011513661,0.00006912674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998598,0.00008330198,0.00037310662,0.00035377988,0.00036639988,0.00022545322],"domain_scores_gemma":[0.9988703,0.00018494776,0.000367243,0.0002965622,0.00023833664,0.00004262336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052873406,0.00015029039,0.00015161069,0.0000813412,0.00020573732,0.00019517391,0.000833324,0.000071440125,0.000002294776],"category_scores_gemma":[0.00003029614,0.00012224144,0.00010385982,0.00033354768,0.0001212584,0.00078039826,0.000060908922,0.000158956,0.0000045119423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044971748,0.00018548762,0.000007901472,0.000049773287,0.000038141094,9.729209e-7,0.0053108186,0.04200837,0.2754182,0.00036292936,0.0035143464,0.6730581],"study_design_scores_gemma":[0.00036446733,0.000038602942,0.000064727006,0.000041470343,0.000011093156,0.0000025936865,0.000046797453,0.7444052,0.25442803,0.00013269637,0.00033336852,0.0001309431],"about_ca_topic_score_codex":0.00000685717,"about_ca_topic_score_gemma":0.0000021036099,"teacher_disagreement_score":0.70239687,"about_ca_system_score_codex":0.000054143984,"about_ca_system_score_gemma":0.00009342777,"threshold_uncertainty_score":0.49848616},"labels":[],"label_agreement":null},{"id":"W2107815709","doi":"10.1109/lsp.2009.2026207","title":"A New Iterative Joint Detection and Decoding Algorithm for V-BLAST Architecture","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Detector; Computational complexity theory; Variable (mathematics); Reduction (mathematics); Joint (building); List decoding; Iterative method; Theoretical computer science; Mathematics; Telecommunications; Engineering; Concatenated error correction code","score_opus":0.012303446691002674,"score_gpt":0.240217113792134,"score_spread":0.22791366710113134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107815709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007520777,0.00032126304,0.9906647,0.00058156054,0.000039036742,0.00021829725,0.0000026976118,0.0005942522,0.00005738306],"genre_scores_gemma":[0.63134974,0.000011020003,0.36793858,0.00052159204,0.00012254817,0.000023949362,0.0000020939763,0.000023302407,0.000007149796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993515,0.00001400415,0.00017950556,0.00017030358,0.000086644424,0.00019804983],"domain_scores_gemma":[0.99970216,0.00003948913,0.000053097494,0.00010972262,0.000031128195,0.00006439796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066882065,0.0001641176,0.00014751645,0.00012779294,0.00014855636,0.00009840278,0.00010038812,0.00005542833,0.0000018564895],"category_scores_gemma":[0.000005741345,0.00016932024,0.000036601617,0.00013058167,0.000027455415,0.0002501579,0.000007938159,0.00021785838,6.7963464e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033355584,0.000002100215,3.3129595e-7,0.000018595165,0.0000040913706,5.5697814e-7,0.00028396831,0.0056054825,0.38349792,0.0000030258188,0.00011437944,0.61046624],"study_design_scores_gemma":[0.00030833617,0.000080466845,0.000045098855,0.00019280601,0.00001196398,0.00002331086,0.000026730233,0.39537555,0.60023314,0.0026817378,0.0007327256,0.00028814864],"about_ca_topic_score_codex":0.0000016179962,"about_ca_topic_score_gemma":0.000002125177,"teacher_disagreement_score":0.623829,"about_ca_system_score_codex":0.00006600875,"about_ca_system_score_gemma":0.000012873189,"threshold_uncertainty_score":0.6904679},"labels":[],"label_agreement":null},{"id":"W2109018632","doi":"10.1109/lsp.2009.2030856","title":"Adaptive Noise Variance Estimation in BayesShrink","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Variance (accounting); Noise (video); Computer science; Autocorrelation; Noise measurement; Residual; Statistics; Noise reduction; Image denoising; Pattern recognition (psychology); Estimation; Algorithm; Gradient noise; Artificial intelligence; Mathematics; Image (mathematics); Noise floor","score_opus":0.019474039657864314,"score_gpt":0.27247710685081483,"score_spread":0.2530030671929505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109018632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010230894,0.00013554221,0.9846853,0.0038047228,0.0001537959,0.00011938502,3.6151573e-7,0.00016782265,0.0007021595],"genre_scores_gemma":[0.7074929,9.612055e-7,0.2865313,0.0058559296,0.00007307781,0.0000055177084,6.076635e-7,0.000007669216,0.00003204024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829185,0.00016318138,0.00030523227,0.00048010112,0.00035526624,0.00040434647],"domain_scores_gemma":[0.9993834,0.00009019382,0.0001360908,0.00024860594,0.00006565566,0.00007605286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000621535,0.00019867142,0.00021361643,0.0002249609,0.00014984547,0.0003495919,0.0006397526,0.00006644202,0.000004381129],"category_scores_gemma":[0.000025338477,0.0001973448,0.000051989075,0.0007364111,0.00005100266,0.0014704128,0.00002680037,0.0002872837,0.000029856552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004972063,0.00007576509,0.000028942517,0.000020098436,0.0000044238263,0.00019439802,0.0010660007,0.0385707,0.1960139,0.00059672195,0.0005836107,0.76279575],"study_design_scores_gemma":[0.00079899037,0.00011473151,0.003065518,0.00024311911,0.0000073402734,0.000036652826,0.000008152991,0.9570131,0.02699916,0.011246674,0.00007013024,0.00039648643],"about_ca_topic_score_codex":0.000015201954,"about_ca_topic_score_gemma":7.3295087e-7,"teacher_disagreement_score":0.91844237,"about_ca_system_score_codex":0.00008777908,"about_ca_system_score_gemma":0.00009353139,"threshold_uncertainty_score":0.8047487},"labels":[],"label_agreement":null},{"id":"W2109753595","doi":"10.1109/lsp.2010.2048940","title":"Self-Organizing Maps for Topic Trend Discovery","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Mitacs","keywords":"Latent Dirichlet allocation; Computer science; Topic model; Visualization; Dimensionality reduction; Data mining; Information retrieval; Set (abstract data type); Data visualization; Process (computing); Latent semantic analysis; Curse of dimensionality; Artificial intelligence; Machine learning","score_opus":0.01012035866637828,"score_gpt":0.25203025302561993,"score_spread":0.24190989435924165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109753595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053148005,0.00003709009,0.94326615,0.002344093,0.00022556561,0.0001433171,0.0000020744305,0.00067933445,0.00015434872],"genre_scores_gemma":[0.6660002,0.00000102881,0.33184752,0.0017259719,0.0002903719,0.000028863582,0.000003062072,0.000020013244,0.00008298265],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860483,0.000019406638,0.00025012827,0.0004999079,0.00024805524,0.00037769697],"domain_scores_gemma":[0.99925977,0.00008865373,0.0001610828,0.0003653646,0.00005454966,0.000070554626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021146804,0.00019689847,0.00020392865,0.00016666725,0.00026048426,0.00053151813,0.0008711763,0.00007259452,0.0000029303349],"category_scores_gemma":[0.00001591536,0.00018258556,0.0001084179,0.00040787188,0.000060139493,0.001759152,0.000074305375,0.0002756022,0.000005600524],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038041542,0.000045524124,0.00016137496,0.000075358774,0.000022297692,0.0000111540185,0.0004644052,0.000049252892,0.91510624,0.0015916142,0.0018072262,0.08066173],"study_design_scores_gemma":[0.00064286427,0.00009838337,0.00016692792,0.00008837896,0.00007847898,0.000044848934,0.000029551373,0.043949377,0.9122382,0.017262822,0.024397869,0.001002314],"about_ca_topic_score_codex":0.000003235865,"about_ca_topic_score_gemma":0.000009506071,"teacher_disagreement_score":0.6128522,"about_ca_system_score_codex":0.00004390914,"about_ca_system_score_gemma":0.000054679735,"threshold_uncertainty_score":0.7445623},"labels":[],"label_agreement":null},{"id":"W2110429185","doi":"10.1109/lsp.2004.824054","title":"Competitive Splitting for Codebook Initialization","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Codebook; Initialization; Linde–Buzo–Gray algorithm; Vector quantization; Computer science; Code (set theory); Algorithm; Scheme (mathematics); Code word; Quantization (signal processing); Artificial intelligence; Pattern recognition (psychology); Mathematics; Decoding methods","score_opus":0.022905612856052852,"score_gpt":0.2849617544417169,"score_spread":0.26205614158566404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110429185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088053773,0.00004243375,0.99590045,0.0016756178,0.00012538915,0.00031031828,0.000007812495,0.000626482,0.00043093436],"genre_scores_gemma":[0.5558692,0.0000013275065,0.438872,0.005004839,0.00014134264,0.000068864254,0.000013093312,0.000019202871,0.000010070641],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987167,0.000030723513,0.00026614006,0.00043676345,0.0002503642,0.0002993007],"domain_scores_gemma":[0.9992683,0.00009375758,0.00019540297,0.00023812302,0.00013882754,0.000065621316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001929106,0.00016515542,0.00015847497,0.00011704225,0.00029739083,0.00023299646,0.00065222854,0.000048521564,0.0000024712813],"category_scores_gemma":[0.000026236328,0.00016378106,0.00004952338,0.00022148978,0.00008523061,0.0012057357,0.00008804383,0.0001248575,0.000007798672],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048324848,0.00015748278,0.000019965079,0.0002450556,0.000019369869,0.000040989962,0.001599732,0.013436096,0.65753496,0.10683762,0.002323294,0.21773714],"study_design_scores_gemma":[0.0014398034,0.00019875911,0.000039210558,0.0009530728,0.000015397878,0.000040211627,0.000052753287,0.04704998,0.8802497,0.056712948,0.012489293,0.00075889594],"about_ca_topic_score_codex":0.0000044920007,"about_ca_topic_score_gemma":8.3714815e-7,"teacher_disagreement_score":0.5570285,"about_ca_system_score_codex":0.00009539297,"about_ca_system_score_gemma":0.00009558343,"threshold_uncertainty_score":0.66787976},"labels":[],"label_agreement":null},{"id":"W2110440191","doi":"10.1109/lsp.2005.845604","title":"Nonintrusive speech quality evaluation using an adaptive neurofuzzy inference system","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Oticon Fonden","keywords":"Adaptive neuro fuzzy inference system; Inference; Computer science; Fuzzy inference system; Quality (philosophy); Speech recognition; Standard error; Correlation; Standard system; Artificial intelligence; Pattern recognition (psychology); Data mining; Machine learning; Fuzzy logic; Fuzzy control system; Statistics; Mathematics; Engineering","score_opus":0.08097163783514222,"score_gpt":0.33252862390904736,"score_spread":0.25155698607390514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110440191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.879558,0.00022592518,0.118542485,0.00016913227,0.000145702,0.00020561961,0.000007254897,0.00033340525,0.00081244874],"genre_scores_gemma":[0.98748904,0.000002967833,0.011816888,0.00030341683,0.00031543168,0.000021229167,0.000010067545,0.000037900427,0.000003075632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857265,0.00019030196,0.0003657633,0.00023756477,0.0003636279,0.0002701234],"domain_scores_gemma":[0.9991781,0.0000681127,0.00011418196,0.0003520015,0.00019598452,0.000091611764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605917,0.00019885441,0.00019048502,0.00012244863,0.00020648411,0.0001230285,0.0003127105,0.00006509532,0.000014454956],"category_scores_gemma":[0.000017887653,0.00021137242,0.000044681536,0.00025667212,0.000059472775,0.00072009873,0.000024605937,0.00027646864,0.000025520967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019100784,0.00004155767,0.0000912579,0.00009479584,0.000018829294,0.0000038590506,0.0007316753,0.68109846,0.23318174,0.00003983641,0.00008731348,0.08459158],"study_design_scores_gemma":[0.0002509876,0.00002148212,0.0004767982,0.00015071011,0.00004327133,0.000012997191,0.00015793202,0.9803789,0.018098192,0.00002129362,0.000114880815,0.0002725345],"about_ca_topic_score_codex":0.000053301752,"about_ca_topic_score_gemma":0.000022758963,"teacher_disagreement_score":0.29928046,"about_ca_system_score_codex":0.00033807266,"about_ca_system_score_gemma":0.00009069107,"threshold_uncertainty_score":0.8619517},"labels":[],"label_agreement":null},{"id":"W2113242314","doi":"10.1109/lsp.2009.2016486","title":"Near-Optimum Pilot and Data Symbols Power Allocation for MIMO Spatial Multiplexing System With Zero-Forcing Receiver","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NovAtel (Canada)","funders":"","keywords":"MIMO; Channel (broadcasting); Fading; Phase-shift keying; Algorithm; Computer science; Spatial multiplexing; Minimum mean square error; Multiplexing; Signal-to-noise ratio (imaging); Quadrature amplitude modulation; Mathematics; Bit error rate; Electronic engineering; Control theory (sociology); Telecommunications; Statistics; Engineering; Estimator","score_opus":0.022508672688732006,"score_gpt":0.24420718359586885,"score_spread":0.22169851090713685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113242314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0351741,0.00019272692,0.9630878,0.0001744509,0.00016508347,0.0006413813,0.000021639893,0.0004687809,0.000074020085],"genre_scores_gemma":[0.94168836,0.0000021602536,0.057732474,0.00021001566,0.00017209059,0.000031497795,0.00008115564,0.000073121875,0.000009148022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986306,0.000023563965,0.00033878826,0.00045794607,0.00018745703,0.0003616645],"domain_scores_gemma":[0.9993222,0.000060686893,0.00013652575,0.00030314535,0.00009452694,0.00008290975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023116864,0.0002798696,0.00026839765,0.00008953488,0.0002589425,0.0002400348,0.0002259474,0.00006829532,0.0000012569178],"category_scores_gemma":[0.000015336702,0.0002636688,0.000018720844,0.00016483598,0.000050584254,0.0010063457,0.00001569766,0.00014948065,0.0000025782786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008618672,0.0000103714765,0.000052939326,0.0004164114,0.000023769497,0.0000048272323,0.00046232896,0.8384413,0.15265721,0.000005256043,0.00029633965,0.0075430456],"study_design_scores_gemma":[0.0009397476,0.00014208451,0.00011162641,0.00089183997,0.000035342495,0.00003052609,0.00011985245,0.9933828,0.0038795404,0.000005429933,0.000083292725,0.00037789895],"about_ca_topic_score_codex":0.000023827093,"about_ca_topic_score_gemma":0.0000073405367,"teacher_disagreement_score":0.9065142,"about_ca_system_score_codex":0.00014079054,"about_ca_system_score_gemma":0.000031226034,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2113988735","doi":"10.1109/97.855448","title":"Moment-based fast discrete sine transforms","year":2000,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Sine; Adder; Modular design; Computer science; Moment (physics); Discrete sine transform; Algorithm; Sequence (biology); Mathematics; Topology (electrical circuits); Applied mathematics; Arithmetic; Mathematical analysis; Physics; Fourier transform; Telecommunications","score_opus":0.01573902928794182,"score_gpt":0.24535829382182922,"score_spread":0.2296192645338874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113988735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053240493,0.000019683332,0.93881243,0.005692971,0.000069718364,0.00015070662,0.0000064191554,0.00021067279,0.0017969194],"genre_scores_gemma":[0.9830758,9.393395e-7,0.007947858,0.008553311,0.00008456517,0.000020354106,0.000016419683,0.000016863178,0.0002838991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856246,0.00002744561,0.0002665023,0.00036787553,0.0003901242,0.00038559193],"domain_scores_gemma":[0.9996084,0.000018391223,0.000057923677,0.00018341524,0.000026944606,0.0001049374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012226621,0.00018691977,0.0001349585,0.00010327025,0.0001604631,0.0006462795,0.0005049665,0.000027857994,0.000118294105],"category_scores_gemma":[6.654857e-7,0.00016153824,0.000072600014,0.0003693944,0.00006128309,0.0017140636,0.0000084132125,0.00009829692,0.000095558724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025320553,0.000045414894,0.000040680665,0.00004283832,0.0000092075925,0.000019744311,0.00048635073,0.0021164771,0.10812039,0.000059820937,0.0018260224,0.88720775],"study_design_scores_gemma":[0.004433579,0.00074659014,0.0012883677,0.00042874928,0.000051385847,0.000054482945,0.00006717542,0.5543361,0.4011783,0.0015090468,0.03398573,0.0019205343],"about_ca_topic_score_codex":0.000009712592,"about_ca_topic_score_gemma":0.0000010097136,"teacher_disagreement_score":0.9308646,"about_ca_system_score_codex":0.00004824873,"about_ca_system_score_gemma":0.000058332207,"threshold_uncertainty_score":0.65873384},"labels":[],"label_agreement":null},{"id":"W2116096293","doi":"10.1109/lsp.2003.821661","title":"Quadtree-Based Multiregion Multiquality Image Coding","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quadtree; Computer science; JPEG 2000; JPEG; Context-adaptive binary arithmetic coding; Artificial intelligence; Computer vision; Image compression; Coding (social sciences); Data compression; Coding tree unit; Image resolution; Pixel; Fidelity; Image processing; Algorithm; Decoding methods; Image (mathematics); Mathematics","score_opus":0.027739680469587417,"score_gpt":0.29771743022956054,"score_spread":0.26997774975997313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116096293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013296899,0.000041500552,0.9798013,0.0051440406,0.00012711546,0.0002092969,0.0000048119723,0.001319632,0.000055414126],"genre_scores_gemma":[0.59331864,0.000001046337,0.40345156,0.0031140237,0.00006348545,0.000024439454,0.000004742542,0.000018173263,0.0000039116653],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977853,0.000104465566,0.00039018327,0.000725214,0.000516747,0.00047812832],"domain_scores_gemma":[0.998729,0.0001121943,0.000280183,0.0006180741,0.000115061725,0.0001455136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031091872,0.00028700812,0.00024407098,0.00019066856,0.00035256526,0.0003470558,0.0012424432,0.00008194638,0.0000045897027],"category_scores_gemma":[0.00003760989,0.0002718681,0.00009365956,0.00044812867,0.00018646459,0.0018609936,0.00013377615,0.00033255242,0.000031885756],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022065693,0.000116707655,0.00004408892,0.0001008656,0.0000047716553,0.00011838863,0.00033906387,0.0044119465,0.9092506,0.00038724378,0.00093965867,0.08426456],"study_design_scores_gemma":[0.0012049603,0.00005099423,0.00016230787,0.0005239891,0.000007510892,0.000023342505,0.000016439375,0.11595458,0.87828314,0.0024381478,0.00071212155,0.0006224504],"about_ca_topic_score_codex":0.000057780017,"about_ca_topic_score_gemma":0.000002884417,"teacher_disagreement_score":0.58002174,"about_ca_system_score_codex":0.00018509805,"about_ca_system_score_gemma":0.00013020054,"threshold_uncertainty_score":0.99997336},"labels":[],"label_agreement":null},{"id":"W2116394319","doi":"10.1109/lsp.2004.842263","title":"Approximate ML detection for MIMO systems using multistage sphere decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Quadrature amplitude modulation; MIMO; Decoding methods; Constellation diagram; Algorithm; Signal-to-noise ratio (imaging); Computer science; Constellation; Generalization; QAM; SIGNAL (programming language); Mathematics; Telecommunications; Bit error rate; Physics; Channel (broadcasting)","score_opus":0.025362257043798294,"score_gpt":0.26590775703555997,"score_spread":0.24054549999176167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116394319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114610106,0.0006770094,0.8829609,0.000047723468,0.00012928015,0.00036891413,0.0000061730625,0.0011307574,0.00006910467],"genre_scores_gemma":[0.86302763,0.000011930832,0.13637672,0.0001119527,0.00024708954,0.00011837239,0.000004367509,0.00008980044,0.00001210793],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891543,0.000025723044,0.00034977696,0.00022319802,0.00014534079,0.0003405458],"domain_scores_gemma":[0.9994652,0.0000629329,0.00012251243,0.00023009049,0.00006204989,0.00005721532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017268502,0.00021939698,0.00020772725,0.000111563226,0.0002579428,0.00014629787,0.00024126549,0.000093335715,0.0000033615988],"category_scores_gemma":[0.000008325372,0.00024884654,0.000060608607,0.00017123543,0.000047663074,0.0005769915,0.000016424285,0.00021266863,0.0000038390576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061207793,0.0000060257416,0.000006611651,0.0002732057,0.000008619629,6.711875e-7,0.000093997376,0.36218035,0.54775155,0.0000045127545,0.00006592155,0.0896024],"study_design_scores_gemma":[0.00017289369,0.000006779414,0.0000022422817,0.00018263634,0.000011969718,0.000010030799,0.000048784732,0.7169792,0.2809604,0.000015390513,0.0013865225,0.00022314873],"about_ca_topic_score_codex":0.000010797607,"about_ca_topic_score_gemma":0.0000074289355,"teacher_disagreement_score":0.74841756,"about_ca_system_score_codex":0.00030910174,"about_ca_system_score_gemma":0.000012679566,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W2119544044","doi":"10.1109/lsp.2002.805312","title":"A new NLMS algorithm for slow noise magnitude variation","year":2002,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Control Systems and Identification","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Magnitude (astronomy); Algorithm; Noise (video); Bounding overwatch; A priori and a posteriori; Ellipsoid; Computer science; Noise measurement; Set (abstract data type); Variation (astronomy); Mathematics; Artificial intelligence; Noise reduction; Image (mathematics)","score_opus":0.0121263314737242,"score_gpt":0.19745691652166175,"score_spread":0.18533058504793756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119544044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053719855,0.00047169797,0.9924163,0.0005393339,0.0004959393,0.0002791721,0.000006284576,0.00026099724,0.00015828291],"genre_scores_gemma":[0.9776338,0.0000049779155,0.01993042,0.00037250062,0.0012598947,0.0000808336,0.000009634974,0.000051378338,0.0006565961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.000010562873,0.00023391216,0.00018332168,0.00015866499,0.00022100359],"domain_scores_gemma":[0.99970114,0.000024915906,0.000058204547,0.00010056856,0.000047847385,0.000067341614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010658577,0.00013420361,0.0001349017,0.00008697173,0.00009629801,0.00019559203,0.00010511271,0.000056062287,0.000045337652],"category_scores_gemma":[0.0000052201503,0.00014230362,0.000060661165,0.00013484333,0.000008376903,0.00030920442,0.0000029917403,0.0000819995,0.000061947205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026293687,0.000010811997,0.000006371758,0.00010616835,0.000021837932,0.000001516246,0.00044052643,0.010136449,0.34661174,0.0000027063295,0.03239891,0.61026037],"study_design_scores_gemma":[0.00064470083,0.00001534277,0.000299022,0.00006609413,0.00003757945,0.000004984928,0.000008229041,0.98934275,0.0034063337,0.00006350856,0.005891623,0.00021983529],"about_ca_topic_score_codex":0.00003491879,"about_ca_topic_score_gemma":0.0000029770342,"teacher_disagreement_score":0.9792063,"about_ca_system_score_codex":0.000068345566,"about_ca_system_score_gemma":0.000009023609,"threshold_uncertainty_score":0.5802973},"labels":[],"label_agreement":null},{"id":"W2124479510","doi":"10.1109/lsp.2006.874462","title":"Linear Dynamic Models With Mixture of Experts Architecture for Recognition of Speech Under Additive Noise Conditions","year":2006,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Speech recognition; Feature (linguistics); Noise (video); Pattern recognition (psychology); Dynamic Bayesian network; Speech processing; Kalman filter; Mixture model; Linear predictive coding; Speech enhancement; Bayesian probability; Artificial intelligence; Noise reduction","score_opus":0.014179992862331516,"score_gpt":0.24019827539021027,"score_spread":0.22601828252787876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124479510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16332327,0.000099724755,0.834323,0.0017287625,0.00004423783,0.00022539792,0.00007744059,0.000072654824,0.00010554733],"genre_scores_gemma":[0.7905832,0.0000010881514,0.20823877,0.00092166517,0.00011708298,0.00003335914,0.000062517225,0.00002172747,0.000020601788],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861157,0.000031884858,0.0003221256,0.00039911357,0.00033390382,0.00030138274],"domain_scores_gemma":[0.9989841,0.000110652865,0.00036640328,0.00017106338,0.0003166684,0.000051123963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105726576,0.00021272678,0.00026669368,0.0002048785,0.00015775669,0.00006750946,0.00032755124,0.00008418402,0.000005110114],"category_scores_gemma":[0.00000618734,0.00017879433,0.00009011145,0.00041174702,0.00019460382,0.00060586445,0.000020130754,0.00014259211,8.328211e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094517745,0.00011548523,0.000008306071,0.00029564393,0.000034454293,0.000013437802,0.0005856698,0.06401968,0.8375289,0.00003585422,0.0009403071,0.096327774],"study_design_scores_gemma":[0.00088397943,0.00016768862,0.000053323292,0.00074205484,0.00004320939,0.00005959435,0.00008318858,0.07433293,0.9006733,0.022575695,0.00003769801,0.00034737622],"about_ca_topic_score_codex":0.000016528253,"about_ca_topic_score_gemma":0.000015801914,"teacher_disagreement_score":0.6272599,"about_ca_system_score_codex":0.000038890452,"about_ca_system_score_gemma":0.00014702942,"threshold_uncertainty_score":0.72910213},"labels":[],"label_agreement":null},{"id":"W2124541692","doi":"10.1109/lsp.2010.2047958","title":"OFDM Transmission for Time-Based Range Estimation","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cramér–Rao bound; Orthogonal frequency-division multiplexing; Upper and lower bounds; Estimator; Maximum likelihood; Transmission (telecommunications); Channel (broadcasting); Algorithm; Estimation theory; Statistics; Range (aeronautics); Signal-to-noise ratio (imaging); Mathematics; Computer science; Telecommunications; Engineering","score_opus":0.006878368925534709,"score_gpt":0.21307243780885174,"score_spread":0.20619406888331704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124541692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07726176,0.000035956255,0.92052627,0.0007230581,0.00015782393,0.00019058638,0.0000049352097,0.000979773,0.00011984021],"genre_scores_gemma":[0.9697221,5.7315833e-7,0.029557247,0.00050319347,0.000091564696,0.000045796463,0.000019147852,0.00004060534,0.000019797199],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993534,0.000005571536,0.00016509376,0.00013973341,0.00012724554,0.00020892473],"domain_scores_gemma":[0.9997592,0.000042276115,0.000031037027,0.00009177,0.000039630733,0.00003609246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109094704,0.00013721087,0.000117432624,0.000118826174,0.00012392155,0.000065506625,0.0001354953,0.00012239932,0.000044125],"category_scores_gemma":[0.00001112168,0.00012979403,0.00005398947,0.00014761848,0.00005750197,0.00016443567,0.0000020155017,0.00017699113,0.000020875477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015229401,0.000008630772,0.000018245357,0.000212304,0.0000044933918,0.0000012081294,0.00007361937,0.12663355,0.712385,0.0000080558175,0.0029579967,0.15768166],"study_design_scores_gemma":[0.00032679905,0.0000119250535,0.000020617594,0.00003877194,0.000011321174,0.0000011776746,0.0000027262377,0.6662185,0.33136064,0.00011196518,0.0017621564,0.00013337185],"about_ca_topic_score_codex":0.0000010964063,"about_ca_topic_score_gemma":4.6153815e-7,"teacher_disagreement_score":0.8924603,"about_ca_system_score_codex":0.000021514059,"about_ca_system_score_gemma":0.000020051059,"threshold_uncertainty_score":0.5292847},"labels":[],"label_agreement":null},{"id":"W2127670824","doi":"10.1109/lsp.2004.824062","title":"Design of Optimal Camera Apertures Adapted to Display Devices Over Arbitrary Sampling Lattices","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cathode ray tube; Computer vision; Computer science; Aperture (computer memory); Sampling (signal processing); Artificial intelligence; Lattice (music); Computer graphics (images); Physics","score_opus":0.039213536791458524,"score_gpt":0.2974968647435631,"score_spread":0.2582833279521046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127670824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12902075,0.00041663478,0.8683133,0.0017050165,0.00017001622,0.00018614935,0.0000017024676,0.00014141026,0.00004501105],"genre_scores_gemma":[0.5312443,0.000001167302,0.461371,0.007231674,0.00011457433,0.0000088895895,8.8740893e-7,0.000019993875,0.0000075561093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976657,0.00016187015,0.00044730134,0.00060633477,0.00059599185,0.00052277587],"domain_scores_gemma":[0.9988016,0.00036176527,0.00023554637,0.00031750705,0.000117217394,0.00016640438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006468996,0.00031321787,0.00036926323,0.00026966262,0.00026479122,0.0005803268,0.0009527239,0.000088474655,0.000008151076],"category_scores_gemma":[0.000039724382,0.00027630336,0.000098399614,0.0006905516,0.00010924145,0.0011606235,0.00009608998,0.00028522,0.000012544498],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082854334,0.00006368049,0.0000327776,0.000104622726,0.00003620001,0.00007157045,0.002276333,0.31586906,0.65310264,0.00016031117,0.00013810156,0.028061822],"study_design_scores_gemma":[0.0037554104,0.00088983803,0.0023808083,0.0026267432,0.00019645768,0.00019365075,0.00014930946,0.34358615,0.638997,0.0030934676,0.0015528962,0.0025782592],"about_ca_topic_score_codex":0.000072857954,"about_ca_topic_score_gemma":0.0000010379383,"teacher_disagreement_score":0.4069423,"about_ca_system_score_codex":0.00006161458,"about_ca_system_score_gemma":0.0002056433,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2129688096","doi":"10.1109/lsp.2011.2140396","title":"Enhanced Seam Carving via Integration of Energy Gradient Functionals","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Michigan State University","keywords":"Seam carving; Retargeting; Maxima and minima; Computer science; Energy (signal processing); Carving; Artificial intelligence; Computer vision; Process (computing); Image (mathematics); Pattern recognition (psychology); Mathematics; Engineering; Statistics","score_opus":0.033064214020486586,"score_gpt":0.24607507287474523,"score_spread":0.21301085885425863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129688096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1430483,0.000025542984,0.8556161,0.00013589732,0.00042768996,0.000040552302,3.3434415e-7,0.0001045478,0.0006010277],"genre_scores_gemma":[0.99356675,0.0000015362117,0.0053320345,0.0009479196,0.0000766993,0.00001517976,0.0000017888268,0.00000855808,0.000049514303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988456,0.00006222039,0.000290354,0.00030317536,0.0003089033,0.00018975444],"domain_scores_gemma":[0.99943376,0.000015968059,0.00020189326,0.00014858227,0.00014302817,0.0000567709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018862057,0.00012616832,0.0001300722,0.00017995377,0.00013839775,0.00005460975,0.0002842911,0.000044852368,0.000027607322],"category_scores_gemma":[0.000005656599,0.00011532421,0.00007846978,0.00040357903,0.000055339475,0.00063786306,0.000027053626,0.00009119032,0.000009510678],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012422731,0.000055942335,0.000031055893,0.000019274326,0.000009000325,0.0000017901407,0.00094454037,0.00017874535,0.8524025,0.00067139795,0.00010399836,0.14556932],"study_design_scores_gemma":[0.00019094953,0.00012859923,0.001434979,0.00008801663,0.000010654621,0.000012862505,0.00005041731,0.060800582,0.9356111,0.001401451,0.00006892607,0.00020144308],"about_ca_topic_score_codex":0.00007682011,"about_ca_topic_score_gemma":0.000009590154,"teacher_disagreement_score":0.85051847,"about_ca_system_score_codex":0.000046634963,"about_ca_system_score_gemma":0.000032288568,"threshold_uncertainty_score":0.47027847},"labels":[],"label_agreement":null},{"id":"W2130071862","doi":"10.1109/lsp.2008.2009656","title":"Message From the New Editor-In-Chief","year":2008,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Academic Writing and Publishing","field":"Arts and Humanities","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Editor in chief; Management","score_opus":0.02734552893838506,"score_gpt":0.21913824626788342,"score_spread":0.19179271732949835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130071862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87678736,0.0022438231,0.0018187807,0.0773896,0.006036846,0.00023729308,0.000048001915,0.00042137832,0.035016943],"genre_scores_gemma":[0.94208616,0.000007347465,0.00007696601,0.0138243735,0.042032864,0.0000053663503,0.0000094479,0.000026273461,0.0019312087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987778,0.00006098484,0.0002518197,0.00025150448,0.00033420735,0.0003237041],"domain_scores_gemma":[0.99943036,0.0002424039,0.00011086312,0.000117008785,0.00003114934,0.0000682335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025014786,0.00015938994,0.00015673394,0.000050848103,0.0006672744,0.00042428102,0.0004063025,0.000064116386,0.0004206497],"category_scores_gemma":[0.000031703865,0.000114153096,0.00005934646,0.00005711811,0.00027443765,0.0005522886,0.000023047776,0.0006304872,0.00004471984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011474758,0.0000125000715,0.00071378774,0.000010279446,0.000007894338,0.00002659988,0.035722185,0.000088592285,0.0017133671,0.00017429996,0.95653594,0.004983075],"study_design_scores_gemma":[0.00057953305,0.000018215995,0.00080065196,0.00034851642,0.000024518355,0.000011612351,0.0028071671,0.00051211024,0.00044679389,0.0013542888,0.9926659,0.00043067674],"about_ca_topic_score_codex":0.0018917451,"about_ca_topic_score_gemma":0.00015172974,"teacher_disagreement_score":0.06529881,"about_ca_system_score_codex":0.000032889995,"about_ca_system_score_gemma":0.00010280651,"threshold_uncertainty_score":0.5132203},"labels":[],"label_agreement":null},{"id":"W2134724842","doi":"10.1109/lsp.2004.842289","title":"A note on \"Split vector-radix-2/8 2-D Fast Fourier Transform\"","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Control Systems and Identification","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Radix (gastropod); Fast Fourier transform; Algorithm; Signal processing; Computer science; Fourier transform; Mathematics; Electronic circuit; Arithmetic; Discrete mathematics; Digital signal processing; Electrical engineering; Engineering; Mathematical analysis; Computer hardware","score_opus":0.00816124069315376,"score_gpt":0.20891596752542543,"score_spread":0.20075472683227166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134724842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5212857,0.00065097277,0.4604412,0.010161341,0.00096859765,0.000604109,0.00001949457,0.0010064272,0.0048621558],"genre_scores_gemma":[0.9974832,0.0000029041867,0.00050357735,0.0006988686,0.0010066477,0.000039607115,0.000005163617,0.00005048713,0.00020957411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998889,0.00001606152,0.00028416322,0.00023072961,0.0002670328,0.00031297666],"domain_scores_gemma":[0.99966764,0.000023731296,0.000043407257,0.00015692275,0.000027758697,0.00008055281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001465647,0.00019428546,0.00017820316,0.00011310272,0.000118032025,0.00016499839,0.00014350646,0.00007153636,0.000039625913],"category_scores_gemma":[0.0000029739595,0.000191121,0.00008444584,0.00015192611,0.000027319376,0.00032963097,0.000002308724,0.00020802289,0.00019724057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021327094,0.000020537815,0.000009164129,0.00012974153,0.000022616035,0.000004991767,0.00082530966,0.056004617,0.4582856,0.000015123232,0.0058438815,0.47881708],"study_design_scores_gemma":[0.001343448,0.000056603094,0.0010750132,0.00041342073,0.00006511125,0.00002169863,0.000040778963,0.8416147,0.06227782,0.000047557103,0.09222958,0.0008142697],"about_ca_topic_score_codex":0.000013253425,"about_ca_topic_score_gemma":0.000017434031,"teacher_disagreement_score":0.7856101,"about_ca_system_score_codex":0.00014695982,"about_ca_system_score_gemma":0.00001677116,"threshold_uncertainty_score":0.7793688},"labels":[],"label_agreement":null},{"id":"W2135090566","doi":"10.1109/lsp.2006.871715","title":"Improved structured least squares for the application of unitary ESPRIT to cross arrays","year":2006,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Unitary state; Algorithm; Least-squares function approximation; Minification; Rotational invariance; Total least squares; Set (abstract data type); Unitary transformation; Non-linear least squares; Mathematics; Computer science; Mathematical optimization; Estimation theory; Statistics; Physics","score_opus":0.010858717955748885,"score_gpt":0.27006486049824974,"score_spread":0.25920614254250085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135090566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035349905,0.000032109205,0.96211183,0.0017467173,0.00009051755,0.00046526396,0.000008090535,0.00016673049,0.000028806797],"genre_scores_gemma":[0.86232,1.50839e-7,0.1370013,0.00047610377,0.000082550374,0.000098098506,0.0000030308993,0.000011374268,0.000007369783],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989982,0.000022022434,0.00032694582,0.00025747152,0.00022868367,0.00016667183],"domain_scores_gemma":[0.999048,0.0001281246,0.00026028973,0.00027886615,0.0002560745,0.000028670065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021535842,0.00011991637,0.00013999741,0.00011539234,0.00016663766,0.00012213488,0.0006692313,0.000042726693,0.0000010452324],"category_scores_gemma":[0.000020841875,0.00009719502,0.00006061084,0.00043221182,0.000113041824,0.00036396546,0.00003432757,0.00007476332,6.97576e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023417162,0.000023099188,0.00013843057,0.000115312694,0.0000072501753,1.4023665e-7,0.0002102751,0.029961728,0.8629345,0.00074083376,0.00066931034,0.10517567],"study_design_scores_gemma":[0.00015170123,0.00005386436,0.0012421599,0.000040086412,0.000009253571,0.0000021970852,0.000009492973,0.3531042,0.6424837,0.0024710689,0.00030481128,0.00012745307],"about_ca_topic_score_codex":0.0001935555,"about_ca_topic_score_gemma":0.00001245344,"teacher_disagreement_score":0.8269701,"about_ca_system_score_codex":0.000034500263,"about_ca_system_score_gemma":0.00005646244,"threshold_uncertainty_score":0.3963498},"labels":[],"label_agreement":null},{"id":"W2141019968","doi":"10.1109/lsp.2013.2285284","title":"LED Backlight Adjustment for Backward-Compatible Stereoscopic Display","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Optical Imaging Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Backlight; Stereoscopy; Liquid-crystal display; Computer science; Computer vision; Image quality; Artificial intelligence; SIGNAL (programming language); Display device; Stereo display; Modulation (music); Computer graphics (images); Image (mathematics); Acoustics; Physics","score_opus":0.011491927451348536,"score_gpt":0.2338641614197815,"score_spread":0.22237223396843298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141019968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27264845,0.000544331,0.7223477,0.001651739,0.00039818257,0.0006106633,0.000006305707,0.0014928288,0.00029985202],"genre_scores_gemma":[0.90256256,0.0000087068265,0.095941536,0.0008402649,0.00016125082,0.0003242119,0.0000074904224,0.000076670956,0.0000772969],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870014,0.00000901784,0.00028117828,0.00029391854,0.00017381992,0.0005419463],"domain_scores_gemma":[0.9995017,0.000086440974,0.000050280127,0.00022151825,0.00005869056,0.00008133855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000052559084,0.00027693357,0.00026260916,0.00011187529,0.000102447455,0.00013805166,0.0003130357,0.00007928682,0.0000506457],"category_scores_gemma":[0.000014041043,0.0002492863,0.00006697657,0.00017664686,0.00012404777,0.0005533158,0.00002769479,0.0002208123,0.00015126473],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012969366,0.00004909169,0.00023183257,0.0009908939,0.00007408185,0.0000057159314,0.0001858987,0.04520562,0.78561276,0.00009416625,0.032185588,0.13535137],"study_design_scores_gemma":[0.0017675245,0.00014617914,0.0010612241,0.00070593896,0.000092627684,0.000012885446,0.00014645234,0.59353006,0.39124063,0.0038505902,0.0060966993,0.0013492117],"about_ca_topic_score_codex":0.0000041012786,"about_ca_topic_score_gemma":8.5403025e-7,"teacher_disagreement_score":0.6299141,"about_ca_system_score_codex":0.00011957736,"about_ca_system_score_gemma":0.000012792509,"threshold_uncertainty_score":0.99999595},"labels":[],"label_agreement":null},{"id":"W2142162273","doi":"10.1109/lsp.2009.2016460","title":"Detection for OFDM Systems With Channel Estimation Errors Using Variational Inference","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Orthogonal frequency-division multiplexing; Channel (broadcasting); Computer science; Algorithm; Inference; Channel state information; Monte Carlo method; Impulse (physics); Mathematics; Artificial intelligence; Telecommunications; Statistics; Wireless","score_opus":0.023215834574185207,"score_gpt":0.26723691973974906,"score_spread":0.24402108516556384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142162273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036520228,0.00008242973,0.96224445,0.00011907341,0.00006698272,0.0003009767,0.000003559525,0.00063449895,0.000027776898],"genre_scores_gemma":[0.9232808,0.0000023053803,0.07638196,0.00014528533,0.000077921235,0.00006961329,0.000010978238,0.00002890191,0.0000022296856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992448,0.00001809026,0.00022263115,0.00015385676,0.00017141155,0.00018921167],"domain_scores_gemma":[0.99955136,0.000054972294,0.000115375784,0.00013716766,0.00010539171,0.000035766392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011530131,0.00015609532,0.00013812548,0.00014111029,0.00018145084,0.00008732723,0.00014069375,0.00006288998,7.193484e-7],"category_scores_gemma":[0.000010567797,0.00015788204,0.000023205284,0.00021853807,0.000030621562,0.00056629075,0.0000039761026,0.00014026511,9.380344e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012629826,0.000007402619,0.000002906934,0.00007800492,0.0000063670054,3.3529915e-7,0.000108343156,0.80743986,0.17222737,0.00002738691,0.0000130105445,0.020076394],"study_design_scores_gemma":[0.0001698229,0.000044590637,0.00007349734,0.00021242417,0.000014531951,0.000009120451,0.00001787789,0.95429623,0.044500273,0.00044291784,0.000021262184,0.00019743056],"about_ca_topic_score_codex":0.0000064023875,"about_ca_topic_score_gemma":0.0000012644781,"teacher_disagreement_score":0.8867606,"about_ca_system_score_codex":0.00016484201,"about_ca_system_score_gemma":0.000025458414,"threshold_uncertainty_score":0.6438243},"labels":[],"label_agreement":null},{"id":"W2143309866","doi":"10.1109/97.988716","title":"Robust array interpolation using second-order cone programming","year":2002,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interpolation (computer graphics); Robustness (evolution); Mathematical optimization; Second-order cone programming; Computer science; Multivariate interpolation; Convex optimization; Algorithm; Stairstep interpolation; Mathematics; Bilinear interpolation; Nearest-neighbor interpolation; Regular polygon; Artificial intelligence; Computer vision; Geometry","score_opus":0.04750596592998896,"score_gpt":0.2604011387072404,"score_spread":0.21289517277725145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143309866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028038934,0.00006679893,0.96994233,0.0005459571,0.00020073495,0.00017659696,6.9930974e-7,0.00047435777,0.0005535998],"genre_scores_gemma":[0.61191785,3.5495594e-7,0.3874908,0.00047796476,0.00005838954,0.0000099707595,7.2148123e-7,0.000013837164,0.000030112691],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985992,0.000058547826,0.00038968748,0.0003587617,0.00032778247,0.00026606806],"domain_scores_gemma":[0.9991421,0.000050209146,0.00033559368,0.00021741686,0.00019264828,0.00006202635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025335007,0.00017320334,0.00019082565,0.00025464487,0.00017223261,0.00028921486,0.00042663177,0.000064591935,0.0000772042],"category_scores_gemma":[0.000024878174,0.00018076762,0.00005716094,0.0007191909,0.00011032312,0.0014201015,0.000033279084,0.00017735986,0.00001090707],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048910415,0.00009062317,0.00021935943,0.00017495829,0.000021346126,0.0000065462646,0.0016763734,0.005736986,0.727703,0.00009751074,0.0011225464,0.26314592],"study_design_scores_gemma":[0.00017283595,0.00004609965,0.00004239621,0.00026088292,0.000011363188,0.000033242017,0.000018909901,0.8358731,0.16251475,0.00018974688,0.0005630379,0.00027363867],"about_ca_topic_score_codex":0.000017667284,"about_ca_topic_score_gemma":0.000001667354,"teacher_disagreement_score":0.8301361,"about_ca_system_score_codex":0.000071998904,"about_ca_system_score_gemma":0.000034706492,"threshold_uncertainty_score":0.73714894},"labels":[],"label_agreement":null},{"id":"W2145296449","doi":"10.1109/lsp.2009.2016449","title":"Proportional Fair Multiuser Scheduling in LTE","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":249,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Scheduling (production processes); Maximum throughput scheduling; Proportionally fair; Fairness measure; Throughput; Computer network; Mathematical optimization; Round-robin scheduling; Real-time computing; Fair-share scheduling; Distributed computing; Mathematics; Telecommunications; Quality of service; Wireless","score_opus":0.008065413057944063,"score_gpt":0.21871355088665861,"score_spread":0.21064813782871455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145296449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34948376,0.00017230338,0.64918274,0.00042733364,0.00010394456,0.000120455465,7.0994014e-7,0.0003506367,0.00015812462],"genre_scores_gemma":[0.96024626,0.000007747381,0.03863633,0.0007979979,0.00024360705,0.000012740522,0.000009917054,0.00003537875,0.000009985755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.000013132008,0.00028332978,0.00021761328,0.00020682559,0.00033235183],"domain_scores_gemma":[0.99976283,0.000016214579,0.000053297317,0.00008235012,0.00003256944,0.000052750474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009458774,0.00017626036,0.00015352559,0.00014578662,0.00006692105,0.000052831296,0.00011230802,0.0000684232,0.000012042471],"category_scores_gemma":[0.0000057600537,0.00019153312,0.00003189396,0.00035786332,0.000031976044,0.0004999571,0.0000044565054,0.00026750955,0.000012653833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008944564,0.000015792442,0.00028803776,0.000029913906,0.0000032083428,0.000017170318,0.00011653709,0.88017553,0.08472091,0.000007389348,0.00012265333,0.034493938],"study_design_scores_gemma":[0.00034299874,0.00001148237,0.0012562618,0.00017332977,0.000004489006,0.0000058552428,0.000013477793,0.98943794,0.00824967,0.00015129834,0.00008858913,0.0002646233],"about_ca_topic_score_codex":0.00000102739,"about_ca_topic_score_gemma":0.0000016793412,"teacher_disagreement_score":0.61076254,"about_ca_system_score_codex":0.00011776923,"about_ca_system_score_gemma":0.000020545025,"threshold_uncertainty_score":0.78104943},"labels":[],"label_agreement":null},{"id":"W2145313093","doi":"10.1109/lsp.2009.2026119","title":"Robust Affine Invariant Region-Based Shape Descriptors: The ICA Zernike Moment Shape Descriptor and the Whitening Zernike Moment Shape Descriptor","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Zernike polynomials; Affine transformation; Artificial intelligence; Invariant (physics); Pattern recognition (psychology); Moment (physics); Mathematics; Velocity Moments; Feature extraction; Shape analysis (program analysis); Computer vision; Image retrieval; Computer science; Image (mathematics); Geometry; Wavefront; Optics; Physics","score_opus":0.03754018332489837,"score_gpt":0.22499904654516623,"score_spread":0.18745886322026786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145313093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030513715,0.0011499064,0.87258667,0.09356646,0.0003434099,0.0009925374,0.0000040168056,0.0006648791,0.00017843109],"genre_scores_gemma":[0.953704,0.000043702148,0.016387442,0.028988963,0.0004341837,0.00016548121,0.0000070204646,0.000049724393,0.00021945998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556607,0.0003993872,0.00085773953,0.0011215723,0.0011399409,0.0009152946],"domain_scores_gemma":[0.9977802,0.00023315813,0.00059964834,0.0008148192,0.0003130383,0.00025910314],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014277421,0.0006441472,0.0005346302,0.00025657352,0.0012924785,0.0020837665,0.0021111662,0.00016506322,0.00004869639],"category_scores_gemma":[0.00006395969,0.00040011783,0.00022591041,0.0010297286,0.0006750763,0.0011759755,0.00018077529,0.000712392,0.000018709829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000603704,0.0005061885,0.0003376943,0.0002204424,0.00013242554,0.00015696426,0.0049055857,0.00087023014,0.4246081,0.0029583967,0.027338985,0.53736126],"study_design_scores_gemma":[0.0022592936,0.00036203818,0.0012626125,0.00062912493,0.00012398766,0.00011841809,0.00024230132,0.9442904,0.040065162,0.00073727383,0.008856772,0.001052624],"about_ca_topic_score_codex":0.000038045142,"about_ca_topic_score_gemma":0.0000022592394,"teacher_disagreement_score":0.9434202,"about_ca_system_score_codex":0.0003135584,"about_ca_system_score_gemma":0.00026175182,"threshold_uncertainty_score":0.9998451},"labels":[],"label_agreement":null},{"id":"W2145473440","doi":"10.1109/lsp.2009.2036879","title":"Motion Vector Outlier Rejection Cascade for Global Motion Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Outlier; Cascade; Computer science; Artificial intelligence; Motion vector; Anomaly detection; Motion estimation; Noise (video); Pattern recognition (psychology); Computer vision; Image (mathematics); Engineering","score_opus":0.01720391461006942,"score_gpt":0.2899850123693512,"score_spread":0.2727810977592818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145473440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074632154,0.000041130585,0.9848535,0.0066400915,0.00038993542,0.00021490849,0.0000013815505,0.00031975706,0.000076074066],"genre_scores_gemma":[0.83596456,6.656829e-7,0.16019326,0.0036049348,0.00018896731,0.000010236587,0.000005950201,0.0000073221704,0.000024083902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.000033660282,0.00023494755,0.0004138161,0.00027176016,0.0002847832],"domain_scores_gemma":[0.9994953,0.00002057968,0.00016078052,0.00015603575,0.0000989439,0.00006835103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001955021,0.00015488788,0.00012337405,0.00008636272,0.00030068101,0.00029220327,0.00023887485,0.000052099625,0.0000016680117],"category_scores_gemma":[0.00002976933,0.00015400206,0.00006572182,0.00036695536,0.000026144142,0.0017178413,0.000012093878,0.0001073015,0.000011623974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013055835,0.000031740383,0.000020755006,0.00001973041,0.0000022561667,0.0000020798304,0.00014476763,0.01609536,0.061862472,0.0002597073,0.00065237377,0.9208957],"study_design_scores_gemma":[0.00040322368,0.000075969496,0.0021593473,0.00007212273,0.000008832676,0.00002567515,0.000008490118,0.97598684,0.01677523,0.003999071,0.0002813408,0.00020387571],"about_ca_topic_score_codex":0.0000032701373,"about_ca_topic_score_gemma":3.988463e-7,"teacher_disagreement_score":0.95989144,"about_ca_system_score_codex":0.00020284222,"about_ca_system_score_gemma":0.000028985341,"threshold_uncertainty_score":0.62800217},"labels":[],"label_agreement":null},{"id":"W2148197013","doi":"10.1109/lsp.2003.819855","title":"A Fast Adaptive Algorithm for MMSE Receivers in DS-CDMA Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Concordia University","funders":"","keywords":"Code division multiple access; Computer science; Algorithm; Single antenna interference cancellation; Minimum mean square error; Interference (communication); Convergence (economics); Iterative method; Overhead (engineering); Base station; Least mean squares filter; Adaptive filter; Filter (signal processing); Multiuser detection; Adaptive algorithm; Mathematics; Channel (broadcasting); Telecommunications; Decoding methods; Statistics","score_opus":0.033853186115505564,"score_gpt":0.2775606841244963,"score_spread":0.24370749800899075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148197013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056907292,0.00034608404,0.98909587,0.003847091,0.00020166612,0.00052414346,0.000004124712,0.00015080001,0.00013947999],"genre_scores_gemma":[0.8853251,0.000011858339,0.11336052,0.0008469129,0.00017521299,0.00020612193,0.0000037833463,0.000026914317,0.000043607342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792373,0.00014312462,0.0003463463,0.0005098477,0.000493536,0.0005834373],"domain_scores_gemma":[0.99887437,0.00018969235,0.00016122132,0.00047135568,0.00018132976,0.00012205271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006119712,0.00019951919,0.00024193099,0.0002971834,0.00026108685,0.00044750192,0.0016157061,0.000088033965,0.0000012198369],"category_scores_gemma":[0.000012981101,0.00020135754,0.00006739016,0.00088432204,0.0001481726,0.00089248514,0.00013003721,0.00039107606,0.000019277728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034269888,0.0001259155,0.000026856413,0.00007194472,0.00002626294,0.00005591521,0.0024033636,0.41911387,0.009204976,0.0005733333,0.0012858242,0.56707746],"study_design_scores_gemma":[0.0011926512,0.00009119515,0.00007302657,0.00042195842,0.000003677185,0.000018129618,0.00017486472,0.9953547,0.0014857936,0.00036121643,0.00051846827,0.00030429952],"about_ca_topic_score_codex":0.00015066481,"about_ca_topic_score_gemma":0.00001473996,"teacher_disagreement_score":0.8796343,"about_ca_system_score_codex":0.00039831072,"about_ca_system_score_gemma":0.00027504851,"threshold_uncertainty_score":0.8211122},"labels":[],"label_agreement":null},{"id":"W2148310803","doi":"10.1109/lsp.2009.2036654","title":"KPAC: A Kernel-Based Parametric Active Contour Method for Fast Image Segmentation","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Active contour model; Artificial intelligence; Kernel (algebra); Computer vision; Computer science; Image segmentation; Parametric statistics; Segmentation; Scale-space segmentation; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.020273126132299764,"score_gpt":0.32887448648951567,"score_spread":0.3086013603572159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148310803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014198887,0.000027571565,0.99267346,0.004579705,0.000102874685,0.0006408784,0.000006777292,0.00047485784,0.0000740051],"genre_scores_gemma":[0.15834253,7.173872e-7,0.820832,0.020549592,0.00011484095,0.000104610495,0.000012689598,0.000016011818,0.00002701109],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979291,0.00016252528,0.0003762296,0.00057756994,0.000540132,0.0004144386],"domain_scores_gemma":[0.998728,0.0003432946,0.00032857817,0.0002295171,0.00021274992,0.0001578679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058638887,0.00024033425,0.00025622293,0.0003492523,0.00020834224,0.00046435444,0.0006079637,0.00007600451,0.000016013539],"category_scores_gemma":[0.000099370845,0.0002297045,0.00011184913,0.000790408,0.000083741696,0.0012180046,0.000018538045,0.00020743642,0.000010514388],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026391112,0.000056198853,0.000002968935,0.000034462202,0.000007228024,0.000009349203,0.00026950237,0.00016716054,0.47938025,0.0000074425607,0.0027999931,0.51723903],"study_design_scores_gemma":[0.0008839215,0.0002120818,0.00012062285,0.00007357721,0.000021764354,0.000006334281,0.000046169636,0.18523069,0.8125022,0.00060259306,0.0000334598,0.00026658096],"about_ca_topic_score_codex":0.000012470533,"about_ca_topic_score_gemma":4.285083e-7,"teacher_disagreement_score":0.5169725,"about_ca_system_score_codex":0.00017273238,"about_ca_system_score_gemma":0.00014421718,"threshold_uncertainty_score":0.9367078},"labels":[],"label_agreement":null},{"id":"W2152487627","doi":"10.1109/lsp.2005.847859","title":"Analytically derived TOA-DOA distributions of uplink/downlink wireless-cellular multipaths arisen from scatterers with an inverted-parabolic spatial distribution around the mobile","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telecommunications link; Omnidirectional antenna; Azimuth; Base station; Computer science; Physics; Telecommunications; Antenna (radio); Optics","score_opus":0.013164368132865307,"score_gpt":0.22122602214297002,"score_spread":0.2080616540101047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152487627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4957886,0.00007972055,0.503424,0.00029414357,0.00004191476,0.0001754444,0.00008318009,0.00010657438,0.0000064138594],"genre_scores_gemma":[0.99526244,0.000011129637,0.0031086188,0.00042752002,0.0003920079,0.00005812976,0.00068753323,0.00004982397,0.0000028161285],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825704,0.00006615781,0.0005258434,0.0003819751,0.00035423983,0.00041474355],"domain_scores_gemma":[0.99914974,0.000065308304,0.00015983454,0.00031707244,0.00014840458,0.00015961965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001846094,0.00032344245,0.00032350913,0.00007422466,0.00026722357,0.00015411408,0.00030582963,0.00012386111,0.00003288721],"category_scores_gemma":[0.000007865883,0.00025522988,0.00009744867,0.00027939127,0.0002482502,0.00039830958,0.00002200124,0.00040371448,0.000015582473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051403676,0.00007503742,0.00022992122,0.000045386092,0.000077168945,0.0000041638696,0.00046852743,0.2406856,0.7235231,0.0000020131392,0.00010580306,0.034731872],"study_design_scores_gemma":[0.0004932184,0.000047816975,0.0002642164,0.00009515644,0.00010999678,0.0000033636666,0.000096489166,0.74326664,0.25523785,0.000024957119,0.0000833752,0.00027694457],"about_ca_topic_score_codex":0.00016281664,"about_ca_topic_score_gemma":0.00006970826,"teacher_disagreement_score":0.502581,"about_ca_system_score_codex":0.00015962122,"about_ca_system_score_gemma":0.00006883391,"threshold_uncertainty_score":0.99999},"labels":[],"label_agreement":null},{"id":"W2153200902","doi":"10.1109/lsp.2011.2106119","title":"Robust Recursive Least-Squares Adaptive-Filtering Algorithm for Impulsive-Noise Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Recursive least squares filter; Algorithm; Adaptive filter; A priori and a posteriori; Computer science; Noise (video); Signal processing; Mathematics; Artificial intelligence; Digital signal processing","score_opus":0.044550366222394215,"score_gpt":0.2249580311770806,"score_spread":0.18040766495468638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153200902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011633514,0.00022092037,0.9862752,0.0000296344,0.0002562827,0.0004994442,0.000058169957,0.00076977717,0.0002570372],"genre_scores_gemma":[0.5040956,0.00001555191,0.49485293,0.00024533574,0.00029359688,0.000263273,0.000012736669,0.00017362625,0.00004731604],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981734,0.000027633307,0.0003669857,0.0005089146,0.0002470048,0.000676028],"domain_scores_gemma":[0.9993916,0.000047406156,0.00013294886,0.00024398768,0.00004066727,0.00014339236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012677093,0.0004577153,0.00033705423,0.00018424228,0.0001911748,0.000054802505,0.00039465335,0.00011942861,0.00003267848],"category_scores_gemma":[0.0000076763645,0.0005024601,0.00013024766,0.00014386242,0.00017037759,0.00066482613,0.000050609644,0.0003083032,0.000020475098],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007905218,0.000055139466,0.000023865561,0.00015487606,0.00009336533,0.00005321612,0.001088435,0.03352164,0.6517876,0.000019977913,0.0010057329,0.31211713],"study_design_scores_gemma":[0.0008814722,0.00037731914,0.00036146908,0.0006367554,0.00008724085,0.00004265739,0.00022618752,0.22865896,0.76360106,0.00142029,0.0022643392,0.0014422458],"about_ca_topic_score_codex":0.000009180845,"about_ca_topic_score_gemma":7.9477087e-7,"teacher_disagreement_score":0.49246213,"about_ca_system_score_codex":0.00023951229,"about_ca_system_score_gemma":0.0000151896475,"threshold_uncertainty_score":0.9997427},"labels":[],"label_agreement":null},{"id":"W2153435651","doi":"10.1109/lsp.2005.847886","title":"A simplified clipping and filtering technique for PAR reduction in OFDM systems","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":245,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Clipping (morphology); Fast Fourier transform; Algorithm; Computer science; Iterative method; Reduction (mathematics); Noise (video); Orthogonal frequency-division multiplexing; Mathematics; Telecommunications; Artificial intelligence; Channel (broadcasting)","score_opus":0.01683630079010304,"score_gpt":0.24054252699816017,"score_spread":0.22370622620805714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153435651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54937696,0.00045711815,0.448016,0.00050897885,0.00043550908,0.000626152,0.000004111472,0.00041191632,0.00016328535],"genre_scores_gemma":[0.9921014,0.000008791776,0.006705137,0.000085863816,0.0006765843,0.00035192145,0.0000027100446,0.00005096718,0.0000166578],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989918,0.000018912657,0.00032790354,0.00024318902,0.00011016054,0.00030804507],"domain_scores_gemma":[0.9997381,0.000028122568,0.00006051074,0.00009495949,0.000024764844,0.000053558717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024796647,0.00017250369,0.00018879127,0.00022199945,0.00009865387,0.00010644354,0.00008849564,0.00008994861,0.0000022724826],"category_scores_gemma":[0.000008050251,0.00019723561,0.00003106904,0.00018127005,0.000050241997,0.00038433727,0.000008555477,0.00019512723,0.0000021146152],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010737854,0.0000058014566,0.000025582212,0.00039780608,0.000007992482,0.0000014392324,0.00027352298,0.16476257,0.8243494,0.0000030354963,0.00071041123,0.009451727],"study_design_scores_gemma":[0.00089377456,0.00004249525,0.00019850695,0.001220586,0.000029480374,0.00031208817,0.0003251344,0.3630214,0.6270214,0.00008911247,0.0060669035,0.00077915523],"about_ca_topic_score_codex":0.00000781898,"about_ca_topic_score_gemma":9.569126e-7,"teacher_disagreement_score":0.44272444,"about_ca_system_score_codex":0.00016318378,"about_ca_system_score_gemma":0.000013715992,"threshold_uncertainty_score":0.80430347},"labels":[],"label_agreement":null},{"id":"W2154465879","doi":"10.1109/97.911475","title":"On alias-component matrices of discrete-time linear periodically time-varying systems","year":2001,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Control Systems and Identification","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Alias; Fourier series; Discrete Fourier transform (general); Control theory (sociology); Component (thermodynamics); Discrete-time Fourier transform; Discrete time and continuous time; Mathematics; Fourier transform; Linear system; Series (stratigraphy); Discrete Fourier series; Matrix (chemical analysis); Applied mathematics; Computer science; Mathematical analysis; Fourier analysis; Fractional Fourier transform; Physics; Materials science; Statistics","score_opus":0.007800231753352081,"score_gpt":0.20796301496409428,"score_spread":0.20016278321074218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154465879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549411,0.0009880596,0.04182634,0.0003508894,0.00037641515,0.0003208216,0.0000117513655,0.00033796794,0.00084665336],"genre_scores_gemma":[0.9991189,0.00000854124,0.00012487883,0.00008626193,0.0003555991,0.000023604747,0.000013418788,0.000046473568,0.00022229034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985499,0.000043306532,0.0004989069,0.00024040569,0.0003892421,0.00027825538],"domain_scores_gemma":[0.99947065,0.00005924778,0.00015594737,0.000178816,0.000058021866,0.000077336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024365005,0.00020613836,0.00032389167,0.00016620259,0.00011689847,0.00016918808,0.00020400489,0.0000751114,0.000046775847],"category_scores_gemma":[0.000008435131,0.00019139076,0.00008969629,0.00022088266,0.000044397726,0.0002303692,0.000009350127,0.00015079525,0.00021541101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003260533,0.000021796162,0.000050677874,0.00035589948,0.000038645187,0.000012863525,0.00017284039,0.16717881,0.82742006,0.00000328402,0.0020104279,0.002702095],"study_design_scores_gemma":[0.000485951,0.000047197882,0.000247744,0.00078746927,0.00005292472,0.000024695864,0.000020575038,0.9897741,0.006634552,0.0000073493275,0.0015629117,0.00035450963],"about_ca_topic_score_codex":0.000064244734,"about_ca_topic_score_gemma":4.1031817e-7,"teacher_disagreement_score":0.8225953,"about_ca_system_score_codex":0.00007873914,"about_ca_system_score_gemma":0.000017314507,"threshold_uncertainty_score":0.7804689},"labels":[],"label_agreement":null},{"id":"W2155213659","doi":"10.1109/lsp.2006.884038","title":"Time Delay Estimation via Minimum Entropy","year":2007,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multilateration; Computer science; Algorithm; Reverberation; Entropy (arrow of time); Additive white Gaussian noise; Gaussian; Speech recognition; White noise; Mathematics; Telecommunications; Acoustics","score_opus":0.008847824756960781,"score_gpt":0.2346610019047672,"score_spread":0.22581317714780644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155213659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14319465,0.000121114506,0.8538158,0.0019337257,0.00019195098,0.00008725709,3.5199758e-7,0.00033954278,0.00031560467],"genre_scores_gemma":[0.82232285,4.7440193e-7,0.17230572,0.004981521,0.00027770747,0.0000039059264,0.000002933011,0.000020428493,0.00008447359],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979805,0.00003094591,0.0003669406,0.00049036386,0.0005121585,0.0006191318],"domain_scores_gemma":[0.9991957,0.00008580268,0.0002245432,0.00023678478,0.00009308472,0.00016407059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005988018,0.00023098287,0.00018957868,0.00021321008,0.00033112182,0.00042379953,0.0006923579,0.00008018998,0.000022459762],"category_scores_gemma":[0.00001671772,0.00022104624,0.00007077041,0.00057936856,0.00011508609,0.0012905297,0.000053087013,0.00021720867,0.0002822924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012534272,0.00002904365,0.000035472334,0.000032976914,0.000007490949,0.00008493343,0.00040511478,0.0013710331,0.6389084,0.000005948435,0.0014147114,0.35769236],"study_design_scores_gemma":[0.00042238663,0.000056966346,0.00015351018,0.00013237573,0.000014987475,0.00014376054,0.0000110940455,0.31810158,0.6791296,0.0008401362,0.0005458945,0.00044774526],"about_ca_topic_score_codex":0.0000034624313,"about_ca_topic_score_gemma":5.442751e-7,"teacher_disagreement_score":0.6815101,"about_ca_system_score_codex":0.0000937101,"about_ca_system_score_gemma":0.000087370245,"threshold_uncertainty_score":0.9014004},"labels":[],"label_agreement":null},{"id":"W2156333708","doi":"10.1109/lsp.2009.2018225","title":"Generalized Bayesian Estimators of the Spectral Amplitude for Speech Enhancement","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Speech enhancement; Bayesian probability; Wiener filter; Mathematics; Noise (video); Computer science; Algorithm; Filter (signal processing); Speech recognition; Statistics; Artificial intelligence","score_opus":0.015077704216672452,"score_gpt":0.25900691157439654,"score_spread":0.24392920735772408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156333708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18672925,0.00012803044,0.80562115,0.0068756174,0.00021006014,0.0002374584,0.0000011341529,0.000082795064,0.000114486764],"genre_scores_gemma":[0.7424581,9.856201e-7,0.2521809,0.005135726,0.00016281844,0.0000109955035,7.7985794e-7,0.000010391936,0.00003928765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821454,0.000035496807,0.00038082735,0.00043637204,0.00044222575,0.00049052597],"domain_scores_gemma":[0.9991635,0.00003860223,0.00029393905,0.00033187706,0.00008852513,0.00008352199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002917388,0.00022096459,0.00025134138,0.00008866713,0.00030291404,0.00027204544,0.0010696606,0.000051123592,0.0000068135437],"category_scores_gemma":[0.000017224334,0.00016424872,0.00015573765,0.00044736709,0.00009404819,0.00044868817,0.00003771463,0.0001433741,0.0000024525384],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019480261,0.00006389411,0.00012504308,0.00006975551,0.000012102545,0.0000049217515,0.0003206705,0.00071222795,0.8338566,0.0001802351,0.001394462,0.1632406],"study_design_scores_gemma":[0.0004955558,0.00008293514,0.00038757522,0.0001622398,0.0000166825,0.000017534609,0.000006108562,0.014839425,0.97882354,0.004690655,0.00023804074,0.00023967892],"about_ca_topic_score_codex":0.00000492811,"about_ca_topic_score_gemma":0.0000010279539,"teacher_disagreement_score":0.55572885,"about_ca_system_score_codex":0.00006666303,"about_ca_system_score_gemma":0.0001534303,"threshold_uncertainty_score":0.6697869},"labels":[],"label_agreement":null},{"id":"W2158370950","doi":"10.1109/lsp.2009.2036875","title":"Filtering, Sampling, and Reconstruction With Time-Varying Bandwidths","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Signal reconstruction; Sampling (signal processing); Algorithm; Artificial intelligence; Signal processing; Computer vision; Filter (signal processing); Telecommunications; Radar","score_opus":0.042576538966375255,"score_gpt":0.306846019093904,"score_spread":0.26426948012752877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158370950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3200703,0.000048788937,0.67716354,0.0009722512,0.00002368136,0.00011846019,0.0000011734387,0.000116666924,0.0014851455],"genre_scores_gemma":[0.6552833,0.000004067261,0.34362623,0.0008074177,0.00012508921,0.000006533193,0.0000013954507,0.000023314267,0.00012271867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988602,0.00004577624,0.00030579334,0.0002945513,0.00023316064,0.00026055894],"domain_scores_gemma":[0.99945307,0.00015202597,0.00013606958,0.00012380554,0.000043459044,0.000091587535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004074543,0.00020038913,0.00032324146,0.00009713725,0.00020318203,0.00014999342,0.00009067856,0.00005596482,0.00010881114],"category_scores_gemma":[0.000023246053,0.00014611127,0.000060410282,0.00017703378,0.00008926816,0.0002476741,0.000005404925,0.00017878346,0.000005412972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011065543,0.00012237686,0.00017264605,0.0006857971,0.00011221534,0.000024173163,0.0010302324,0.00017806287,0.31731743,0.00068202766,0.0003222774,0.67924213],"study_design_scores_gemma":[0.005810215,0.0014017798,0.0012655627,0.007372851,0.0020952018,0.0023179383,0.00029957504,0.17192867,0.19626744,0.605402,0.0015995753,0.004239208],"about_ca_topic_score_codex":0.0000024324713,"about_ca_topic_score_gemma":6.556935e-7,"teacher_disagreement_score":0.67500293,"about_ca_system_score_codex":0.000018836881,"about_ca_system_score_gemma":0.000017165492,"threshold_uncertainty_score":0.5958244},"labels":[],"label_agreement":null},{"id":"W2158386631","doi":"10.1109/lsp.2008.2008482","title":"A Robust Adaptive Dimension Reduction Technique With Application to Array Processing","year":2008,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robustness (evolution); Orthogonality; Algorithm; Computer science; Preprocessor; Adaptive filter; Dimension (graph theory); Matrix (chemical analysis); Reduction (mathematics); Signal processing; Noise reduction; Dimensionality reduction; Mathematics; Digital signal processing; Artificial intelligence; Computer hardware","score_opus":0.022742001599102276,"score_gpt":0.2385570505773691,"score_spread":0.2158150489782668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158386631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019472443,0.000021873195,0.97777325,0.0009981372,0.000045141882,0.0006596532,6.1718276e-7,0.0007751046,0.00025378822],"genre_scores_gemma":[0.5986897,6.973918e-7,0.40077174,0.00025624354,0.00004673245,0.00020598329,0.0000012119816,0.000017420429,0.00001032269],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826777,0.000054972188,0.00034051627,0.000573605,0.0005081502,0.0002550055],"domain_scores_gemma":[0.99887747,0.000022016136,0.00035045922,0.00029424424,0.00035875736,0.0000970571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002710734,0.00021830692,0.00021884328,0.00035522468,0.00034361694,0.00008382694,0.0004327714,0.00007448327,0.0000012836102],"category_scores_gemma":[0.000010112045,0.00019915432,0.000039345,0.0012720542,0.00015354216,0.0012144531,0.000033158525,0.00019336859,0.0000070288365],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000446105,0.00006262967,0.000031817992,0.00006194392,0.000005670444,0.000004748191,0.0011394285,0.013546253,0.90230554,0.00005704265,0.0004113936,0.08232893],"study_design_scores_gemma":[0.00013324669,0.00021506714,0.00015770251,0.00043529028,0.000010515283,0.0002451987,0.000028378621,0.042618167,0.9554592,0.00028377151,0.00009257383,0.0003209314],"about_ca_topic_score_codex":0.000036951318,"about_ca_topic_score_gemma":0.0000010469872,"teacher_disagreement_score":0.5792172,"about_ca_system_score_codex":0.00014352454,"about_ca_system_score_gemma":0.00017577996,"threshold_uncertainty_score":0.81212777},"labels":[],"label_agreement":null},{"id":"W2159693415","doi":"10.1109/lsp.2003.817852","title":"Adaptive beamforming with sidelobe control: a second-order cone programming approach","year":2003,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Adaptive beamformer; Beamforming; Second-order cone programming; Minimum-variance unbiased estimator; Control theory (sociology); Cone (formal languages); Computer science; Mathematics; Convex optimization; Mathematical optimization; Regular polygon; Algorithm; Control (management); Telecommunications; Statistics","score_opus":0.014256741831875482,"score_gpt":0.22759183949744605,"score_spread":0.21333509766557057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159693415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076156664,0.00006321951,0.98898536,0.00020869428,0.000059307735,0.00042071787,0.0000012672035,0.00048732918,0.0021584544],"genre_scores_gemma":[0.5639712,1.8195504e-7,0.4352356,0.0006705657,0.000018272329,0.0000664907,7.232377e-7,0.000016915137,0.000020054067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998166,0.00009726685,0.00038479912,0.00048635478,0.00046741005,0.00039817166],"domain_scores_gemma":[0.998877,0.00009041034,0.00038241205,0.0002528269,0.00030214514,0.00009522027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004866942,0.00025247532,0.00031562627,0.00021040719,0.00020870668,0.00023398879,0.00043541103,0.0000688912,0.000007795089],"category_scores_gemma":[0.000031385152,0.00022031521,0.000057841582,0.0008255095,0.0001959726,0.0012264999,0.00002187326,0.00023589566,0.0000030675328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026089477,0.0008994343,0.0011473512,0.0011356659,0.0004265787,0.00009305041,0.0076867524,0.046958707,0.2065954,0.016096083,0.0014663169,0.7172338],"study_design_scores_gemma":[0.0035441432,0.0009860588,0.00016649177,0.0009102346,0.00012353202,0.0004719215,0.0004994688,0.5991449,0.38612813,0.0024938146,0.0036241028,0.0019072437],"about_ca_topic_score_codex":0.000018704446,"about_ca_topic_score_gemma":0.0000023068342,"teacher_disagreement_score":0.7153265,"about_ca_system_score_codex":0.000071750874,"about_ca_system_score_gemma":0.00021913991,"threshold_uncertainty_score":0.8984193},"labels":[],"label_agreement":null},{"id":"W2161770374","doi":"10.1109/lsp.2005.860544","title":"A novel radius-adjusted approach for blind adaptive equalization","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Quadrature amplitude modulation; QAM; Algorithm; Blind equalization; Adaptive equalizer; Weighting; Constellation diagram; Mean squared error; Equalization (audio); Constellation; Computer science; Mathematics; Convergence (economics); RADIUS; Control theory (sociology); Bit error rate; Statistics; Decoding methods; Artificial intelligence","score_opus":0.06706403537024434,"score_gpt":0.289431842851911,"score_spread":0.22236780748166662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161770374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018221546,0.00005757207,0.9933517,0.0032267,0.000046933746,0.0004933538,0.0000033237259,0.0005396653,0.00045860303],"genre_scores_gemma":[0.5035128,5.154609e-7,0.49005535,0.006078946,0.00018468435,0.00008706573,0.000009714297,0.000017665661,0.000053283682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984803,0.00005877058,0.00031906852,0.0004915843,0.00033811547,0.00031216815],"domain_scores_gemma":[0.9992316,0.00007247312,0.00022596079,0.00022291022,0.00017016109,0.00007689804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083781,0.0001955331,0.00017952174,0.00022034699,0.00021575364,0.00035976525,0.00058723195,0.000097930184,0.0000023179516],"category_scores_gemma":[0.000015659527,0.00019415125,0.00007544212,0.0004978594,0.00006464994,0.0012449484,0.000037974267,0.0001641753,0.0000053503854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017695646,0.0004959281,0.000010741348,0.00014234513,0.000054444557,0.000002045397,0.008711279,0.11369246,0.58672196,0.014042026,0.0113463625,0.26460344],"study_design_scores_gemma":[0.000907649,0.00007550819,0.000012825541,0.00003476553,0.00001214914,0.000013343169,0.000033728058,0.9352698,0.06139836,0.00024896732,0.0016960455,0.00029691556],"about_ca_topic_score_codex":0.0000056713893,"about_ca_topic_score_gemma":0.0000014723748,"teacher_disagreement_score":0.8215773,"about_ca_system_score_codex":0.00008855452,"about_ca_system_score_gemma":0.00011436022,"threshold_uncertainty_score":0.7917258},"labels":[],"label_agreement":null},{"id":"W2165644958","doi":"10.1109/lsp.2009.2017477","title":"Snake Validation: A PCA-Based Outlier Detection Method","year":2009,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Initialization; Principal component analysis; Artificial intelligence; Outlier; Pattern recognition (psychology); Anomaly detection; Computer science; Object detection; Computer vision; Object (grammar); Image (mathematics)","score_opus":0.015075720332213735,"score_gpt":0.26648741657391545,"score_spread":0.25141169624170173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165644958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097238915,0.00008898663,0.9860981,0.0016841207,0.00006783671,0.00015594698,0.0000022662114,0.0014573999,0.00072144234],"genre_scores_gemma":[0.8840686,0.0000012169854,0.11338132,0.0022255746,0.0002013796,0.00005409289,0.0000074836057,0.000036386293,0.000023916858],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989894,0.000023997156,0.00024660025,0.00025320437,0.00020552656,0.00028123974],"domain_scores_gemma":[0.9996105,0.000025144342,0.00006443403,0.00016890066,0.00006585533,0.00006518697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021009623,0.00020180269,0.00015266523,0.0001435731,0.00021468918,0.00020122713,0.00018126835,0.00008562581,0.000020464859],"category_scores_gemma":[0.0000052520486,0.000209046,0.000066177694,0.00040133056,0.000032932763,0.0002778443,0.0000040185723,0.0002455387,0.00002136178],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000560885,0.000019935442,0.000003895438,0.00005695012,0.0000045884126,0.0000028466895,0.00006426488,0.03220024,0.6108118,0.0000054615252,0.0012402826,0.35558408],"study_design_scores_gemma":[0.00018802332,0.000026833946,0.000058619233,0.000068883695,0.000027842387,0.000010694115,0.0000061652386,0.30648544,0.6888447,0.00064614165,0.0033510383,0.00028564272],"about_ca_topic_score_codex":0.0000024716844,"about_ca_topic_score_gemma":4.0970244e-7,"teacher_disagreement_score":0.8743447,"about_ca_system_score_codex":0.00008322009,"about_ca_system_score_gemma":0.000026247208,"threshold_uncertainty_score":0.85246485},"labels":[],"label_agreement":null},{"id":"W2166218055","doi":"10.1109/lsp.2010.2042520","title":"On the Global Output SNR of the Parameterized Frequency-Domain Multichannel Noise Reduction Wiener Filter","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Wiener filter; Filter (signal processing); Metric (unit); Mathematics; Reduction (mathematics); Noise reduction; Algorithm; Parameterized complexity; Distortion (music); Noise (video); Signal-to-noise ratio (imaging); Computer science; Control theory (sociology); Speech recognition; Telecommunications; Statistics; Artificial intelligence; Amplifier; Engineering","score_opus":0.015608696853521037,"score_gpt":0.22788214736407178,"score_spread":0.21227345051055074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166218055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8228685,0.000025901165,0.16143277,0.0140192285,0.0010722193,0.00019543043,0.000004007201,0.00008743758,0.00029447727],"genre_scores_gemma":[0.95533043,3.769133e-7,0.03944833,0.0048951246,0.00026120397,0.000023820094,6.342838e-7,0.000015083885,0.000024994253],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803877,0.00012688655,0.0003427939,0.00048514284,0.000579034,0.00042734895],"domain_scores_gemma":[0.99876904,0.00009904877,0.00034759537,0.00059176347,0.00011296345,0.00007958462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048199302,0.00025149705,0.00020147047,0.00005795084,0.00045695945,0.00034324513,0.0014163543,0.00009646273,0.000013155565],"category_scores_gemma":[0.00008237796,0.00014463773,0.00014329591,0.0005989572,0.00038540576,0.00054472854,0.00009818206,0.00046943023,0.00001678102],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022213406,0.000056486075,0.00013463541,0.00002980746,0.00001460861,0.0000054207,0.0008054884,0.0003529419,0.98031783,0.00036805787,0.00085146487,0.01704104],"study_design_scores_gemma":[0.00080081157,0.00008361467,0.0010089236,0.00033024978,0.000029802117,0.00010815722,0.00010334082,0.009078658,0.95117706,0.03657887,0.00019427508,0.0005062468],"about_ca_topic_score_codex":0.00002518533,"about_ca_topic_score_gemma":0.0000040921573,"teacher_disagreement_score":0.1324619,"about_ca_system_score_codex":0.000054053864,"about_ca_system_score_gemma":0.00013924515,"threshold_uncertainty_score":0.58981556},"labels":[],"label_agreement":null},{"id":"W2167012018","doi":"10.1109/lsp.2005.861598","title":"Nonintrusive speech quality estimation using Gaussian mixture models","year":2006,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mixture model; Computer science; Consistency (knowledge bases); Speech recognition; Pattern recognition (psychology); Gaussian; Quality (philosophy); Estimation theory; Artificial intelligence; Expectation–maximization algorithm; Speech processing; Algorithm; Mathematics; Statistics; Maximum likelihood","score_opus":0.025695192229035557,"score_gpt":0.2754719879494821,"score_spread":0.24977679572044653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167012018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21384129,0.00018199842,0.78258383,0.002033456,0.00018013472,0.00012094978,0.0000020837006,0.00029616826,0.00076005503],"genre_scores_gemma":[0.68739295,4.693544e-7,0.31021154,0.0019981333,0.00032742074,0.000005112108,0.0000042074093,0.000022617685,0.00003751958],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734294,0.000098645534,0.0005214634,0.00071322545,0.0006919135,0.00063181395],"domain_scores_gemma":[0.9989295,0.000055510824,0.00040000537,0.00034223398,0.00015691905,0.00011585765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004482956,0.00033472068,0.00031076453,0.00021337593,0.0005591863,0.0009545854,0.00076084834,0.00012996634,0.000008028459],"category_scores_gemma":[0.000012137589,0.00032069287,0.00010686179,0.0007351314,0.00012847652,0.0025116676,0.000075850934,0.00032940644,0.00001988179],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017270428,0.000066267065,0.00021897319,0.00018215217,0.00001420279,0.00011024473,0.00050698884,0.20559233,0.6349539,0.0003715109,0.0010662399,0.15689991],"study_design_scores_gemma":[0.00036740597,0.00001720482,0.00025270454,0.00022165535,0.000018035247,0.00010591209,0.00001839534,0.6851981,0.29879776,0.014436421,0.00004187706,0.00052453805],"about_ca_topic_score_codex":0.00018215943,"about_ca_topic_score_gemma":0.000009573195,"teacher_disagreement_score":0.47960576,"about_ca_system_score_codex":0.00017391733,"about_ca_system_score_gemma":0.00022245618,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W2167583366","doi":"10.1109/lsp.2010.2046191","title":"Blind Unique Identification of MIMO Channels Using Signal Designs and High-Order Moments","year":2010,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"MIMO; Channel (broadcasting); Mathematics; Phase-shift keying; Fading; Algorithm; Transmission (telecommunications); SIGNAL (programming language); Diophantine equation; Closed-form expression; Control theory (sociology); Applied mathematics; Topology (electrical circuits); Computer science; Telecommunications; Bit error rate; Mathematical analysis; Discrete mathematics; Combinatorics","score_opus":0.026768261866324018,"score_gpt":0.2734679694600586,"score_spread":0.24669970759373455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167583366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48161343,0.00006528366,0.5178387,0.0000827111,0.00007438328,0.0001355259,0.0000034052507,0.00017540454,0.00001113434],"genre_scores_gemma":[0.9593203,0.000018070235,0.04037882,0.000105079795,0.000074347794,0.000031892327,0.000008024572,0.000056104014,0.0000073711244],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891335,0.000038506612,0.00041535773,0.00021239219,0.00019700496,0.0002233888],"domain_scores_gemma":[0.9993033,0.000055544548,0.00018442226,0.0002612093,0.00013181295,0.00006374456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496918,0.00019365418,0.00020078405,0.00022454122,0.00012794358,0.0000786978,0.00027708014,0.00011614611,0.000012442389],"category_scores_gemma":[0.000009849906,0.00021635903,0.000027233862,0.00031682523,0.00017392641,0.00048997963,0.000030438849,0.00036106934,0.0000016553532],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007974274,0.000019007468,0.00006050799,0.00011928889,0.000015082812,0.000001104219,0.00023033022,0.03944933,0.94645333,0.000027567929,0.000037836722,0.01357861],"study_design_scores_gemma":[0.00021821966,0.00001163329,0.00009443358,0.000090969676,0.000017386832,0.0000062663735,0.000021092605,0.16580497,0.83293164,0.0005492486,0.000042444717,0.00021169944],"about_ca_topic_score_codex":0.000014830243,"about_ca_topic_score_gemma":0.0000016794395,"teacher_disagreement_score":0.47770688,"about_ca_system_score_codex":0.00004081636,"about_ca_system_score_gemma":0.000027226602,"threshold_uncertainty_score":0.88228655},"labels":[],"label_agreement":null},{"id":"W2168134888","doi":"10.1109/lsp.2008.917801","title":"A Windowed Eigenspectrum Method for Multivariate sEMG Classification During Reaching Movements","year":2008,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Muscle activation and electromyography studies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pattern recognition (psychology); Univariate; Support vector machine; Feature extraction; Artificial intelligence; Multivariate statistics; Computer science; Classifier (UML); Covariance; Eigenvalues and eigenvectors; Feature vector; Speech recognition; Machine learning; Mathematics; Statistics","score_opus":0.029171371936648656,"score_gpt":0.2592598645913635,"score_spread":0.23008849265471487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168134888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46754342,0.00006538573,0.53109133,0.00026872824,0.00011964017,0.00024430803,0.0000037228438,0.00039462338,0.0002688254],"genre_scores_gemma":[0.98238397,0.000012236241,0.016738035,0.0004330434,0.0002138185,0.00011843579,0.000009074235,0.00005517408,0.00003621772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879026,0.00003165698,0.0002835829,0.00028521742,0.00019860167,0.00041065508],"domain_scores_gemma":[0.99962455,0.00006198205,0.000090179965,0.000118927455,0.00004616068,0.000058182573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488914,0.00021831159,0.00020457825,0.00020219423,0.0005425819,0.000047803278,0.00012321628,0.0000572514,0.0000047465883],"category_scores_gemma":[0.000011650838,0.00022766758,0.00009719487,0.00028242604,0.000034840312,0.00029401117,0.000008094005,0.0001938025,0.0000014994399],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035221787,0.000025511683,0.0003937225,0.00014830372,0.00010160807,0.0000035647085,0.0013424692,0.0065556825,0.9742662,0.000008156518,0.00044537976,0.016674234],"study_design_scores_gemma":[0.0027653216,0.00007154289,0.10446553,0.0002193777,0.0000696521,0.000036443278,0.00027234573,0.35325053,0.5363006,0.0002345539,0.0012315512,0.0010825313],"about_ca_topic_score_codex":0.000014657326,"about_ca_topic_score_gemma":0.0000015172075,"teacher_disagreement_score":0.51484054,"about_ca_system_score_codex":0.00013332789,"about_ca_system_score_gemma":0.000015564134,"threshold_uncertainty_score":0.92840147},"labels":[],"label_agreement":null},{"id":"W2168375507","doi":"10.1109/lsp.2011.2152393","title":"Joint DOD and DOA Estimation for MIMO Array With Velocity Receive Sensors","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"MIMO; Direction of arrival; Joint (building); Computer science; Sensor array; Constraint (computer-aided design); Algorithm; Pairing; Key (lock); Mathematics; Telecommunications; Engineering; Channel (broadcasting); Antenna (radio); Physics","score_opus":0.032979630456559494,"score_gpt":0.2480927040236721,"score_spread":0.2151130735671126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168375507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07704622,0.000010861432,0.9214452,0.00063548196,0.0000644375,0.00025336642,0.0000017115206,0.00026267505,0.00028003266],"genre_scores_gemma":[0.53363156,5.612135e-7,0.4660488,0.00025968446,0.000015742298,0.000028025257,7.857558e-7,0.000008699409,0.0000061482515],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989996,0.000035910016,0.00024549544,0.00032438867,0.00021531034,0.00017931669],"domain_scores_gemma":[0.99927825,0.000057572674,0.00026838406,0.00016122629,0.00017589369,0.00005868701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910314,0.00014584379,0.00017576355,0.00014734182,0.00015161639,0.000101041485,0.00020655035,0.000047549882,0.00000284378],"category_scores_gemma":[0.000029510124,0.0001263801,0.000032612545,0.00025085072,0.00014637996,0.0007991704,0.000016168435,0.00009244785,0.0000017055031],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018128895,0.00017583116,0.0003232348,0.00088852627,0.00007737833,0.0000116090105,0.013457125,0.0037112175,0.4313105,0.0012106664,0.002071467,0.54658115],"study_design_scores_gemma":[0.0003122992,0.00021003542,0.0009326924,0.00028279182,0.000021857282,0.000029717106,0.000027935974,0.18159312,0.8118108,0.004463932,0.00004212637,0.00027270257],"about_ca_topic_score_codex":0.000034941557,"about_ca_topic_score_gemma":0.000001516851,"teacher_disagreement_score":0.54630846,"about_ca_system_score_codex":0.00003815758,"about_ca_system_score_gemma":0.00005954439,"threshold_uncertainty_score":0.5153631},"labels":[],"label_agreement":null},{"id":"W2407561938","doi":"10.1109/lsp.2015.2438008","title":"Median Filtering Forensics Based on Convolutional Neural Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; National Science Foundation","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Pooling; Image (mathematics); Pattern recognition (psychology); Filter (signal processing); Median filter; Residual; Computer vision; Image processing; Algorithm","score_opus":0.026587484609427624,"score_gpt":0.2257852914226731,"score_spread":0.19919780681324548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407561938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018708678,0.000020458183,0.9741956,0.0039214254,0.0021470038,0.00011420913,0.0000016664062,0.00033322172,0.0005577479],"genre_scores_gemma":[0.97723687,8.3507125e-8,0.013892688,0.008185061,0.00062715635,0.0000167621,0.0000071995405,0.000022141225,0.000012058267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981369,0.000048138034,0.0002414537,0.00043357335,0.0006871921,0.0004527598],"domain_scores_gemma":[0.9991267,0.0001062456,0.00012938792,0.00025659884,0.00010833017,0.00027274457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028342658,0.00021640486,0.00017178785,0.00016072013,0.00012128043,0.00039423766,0.00049801025,0.0000698335,0.0000024342194],"category_scores_gemma":[0.000046287907,0.00020773028,0.00006734312,0.00042193005,0.00016322405,0.0008974693,0.000052104053,0.0002718543,0.000022786977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053047585,0.000045576486,0.0001161037,0.00002553958,0.000009576118,0.000113846836,0.00026032425,0.6151883,0.0018963304,0.00013640693,0.00961211,0.37254283],"study_design_scores_gemma":[0.00045377793,0.00014399091,0.000097589495,0.000068535046,0.000004818299,0.000029571042,0.000007933323,0.99586546,0.0021084936,0.0006269502,0.00034859846,0.00024424985],"about_ca_topic_score_codex":0.000007152374,"about_ca_topic_score_gemma":0.0000030094927,"teacher_disagreement_score":0.9603029,"about_ca_system_score_codex":0.00015096487,"about_ca_system_score_gemma":0.00012120768,"threshold_uncertainty_score":0.8470995},"labels":[],"label_agreement":null},{"id":"W2420110223","doi":"10.1109/lsp.2016.2572666","title":"Fold-based Kolmogorov–Smirnov Modulation Classifier","year":2016,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Rail Traffic Control and Safety; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Classifier (UML); Computer science; Pattern recognition (psychology); Robustness (evolution); Artificial intelligence; Speech recognition; Phase-shift keying; Machine learning; Algorithm; Bit error rate; Decoding methods","score_opus":0.02862253564090129,"score_gpt":0.24333215340247819,"score_spread":0.2147096177615769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2420110223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072289236,0.000019821384,0.9068348,0.01966308,0.00029983075,0.00019332243,0.0000024789476,0.00046408377,0.00023336543],"genre_scores_gemma":[0.9778569,5.451974e-7,0.018688615,0.0029334233,0.00027551607,0.000051587147,0.0000037787936,0.000034417324,0.00015522943],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748194,0.00013859374,0.0004538194,0.0007576562,0.00071051414,0.00045749737],"domain_scores_gemma":[0.9985762,0.00020246718,0.00034364662,0.0005150574,0.00021721753,0.00014538839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036957228,0.00027405214,0.00020888892,0.00029031414,0.00027592218,0.00031872012,0.00077639107,0.00012103711,0.000035570967],"category_scores_gemma":[0.000029086124,0.00021094928,0.00010271566,0.00059468724,0.00013816652,0.0016877259,0.000040364786,0.00014069723,0.00016777174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014687869,0.000044280172,0.0009266633,0.000024635223,0.000007959101,0.0000064535348,0.000091659516,0.0045807925,0.7337713,0.0006071875,0.0012798825,0.2586445],"study_design_scores_gemma":[0.0011967513,0.00006770626,0.02054593,0.00029644818,0.000014808013,0.000009463861,0.000005954939,0.8341608,0.13939321,0.002124389,0.0014884908,0.0006960665],"about_ca_topic_score_codex":0.0000067075193,"about_ca_topic_score_gemma":0.0000016709268,"teacher_disagreement_score":0.90556765,"about_ca_system_score_codex":0.00024628235,"about_ca_system_score_gemma":0.00017740266,"threshold_uncertainty_score":0.86022615},"labels":[],"label_agreement":null},{"id":"W2474721870","doi":"10.1109/lsp.2016.2584780","title":"Low-Complexity Design of Noninteger Fractionally Spaced Adaptive Equalizers for Coherent Optical Receivers","year":2016,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Optical Network Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Adaptive equalizer; Equalization (audio); Decoupling (probability); Equalizer; Computer science; Distortion (music); Sampling (signal processing); Channel (broadcasting); Algorithm; Computational complexity theory; Joint (building); Electronic engineering; Control theory (sociology); Telecommunications; Bandwidth (computing); Artificial intelligence; Engineering","score_opus":0.047880550093600274,"score_gpt":0.2523412639975562,"score_spread":0.20446071390395593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474721870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07777037,0.00004375009,0.9195532,0.0014221395,0.00019605628,0.0003613924,0.000015232433,0.00047583206,0.00016198866],"genre_scores_gemma":[0.87749046,0.0000064961796,0.122104436,0.00016375429,0.000102224694,0.00006103406,0.0000016967656,0.000049250255,0.000020656697],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985969,0.000029760638,0.00033349384,0.00029381088,0.00028996772,0.0004560581],"domain_scores_gemma":[0.99894935,0.0005917726,0.000095831,0.00015585688,0.00012465488,0.000082536775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022121324,0.00025115002,0.00031362675,0.000117572345,0.000073779134,0.000031640247,0.0002628164,0.00015446705,0.000047441652],"category_scores_gemma":[0.00006931631,0.0001943498,0.000102917176,0.00018225987,0.0004893445,0.0002572553,0.000020346937,0.00020119401,0.00002015698],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003730057,0.000056809407,0.000023543824,0.00019727596,0.00011298115,0.000008025626,0.00007984544,0.14651713,0.79380673,0.0010014981,0.0068931966,0.050929967],"study_design_scores_gemma":[0.0025304526,0.0005843824,0.00025502738,0.0014579862,0.0001428313,0.000012787528,0.0002265262,0.36314654,0.6237148,0.0062753772,0.0004430055,0.0012102823],"about_ca_topic_score_codex":0.0000020469502,"about_ca_topic_score_gemma":0.0000010523554,"teacher_disagreement_score":0.7997201,"about_ca_system_score_codex":0.00020964483,"about_ca_system_score_gemma":0.000046022626,"threshold_uncertainty_score":0.79253554},"labels":[],"label_agreement":null},{"id":"W2588196171","doi":"10.1109/lsp.2017.2669333","title":"Light-Field Image Super-Resolution Using Convolutional Neural Network","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; Ministère de l'Éducation, du Loisir et du Sport Québec","keywords":"Convolutional neural network; Image resolution; Computer science; Light field; Artificial intelligence; Angular resolution (graph drawing); Computer vision; Field (mathematics); Image quality; Sample (material); Artificial neural network; Resolution (logic); Image (mathematics); Mathematics; Physics","score_opus":0.027469422306649876,"score_gpt":0.2939887329418525,"score_spread":0.2665193106352026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588196171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032858837,0.00017160435,0.9526138,0.012937579,0.0007982442,0.00008617634,5.705239e-7,0.00016174838,0.00037146275],"genre_scores_gemma":[0.85779,0.0000014770685,0.13486692,0.0065471614,0.00074421626,0.0000036870883,7.744562e-7,0.000016378955,0.00002938229],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827015,0.000049961367,0.00025730467,0.0004849405,0.00038229657,0.00055531855],"domain_scores_gemma":[0.99899423,0.00005011485,0.0002472392,0.00047702817,0.00010968145,0.0001217113],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024307818,0.00020464038,0.00018073653,0.000074097836,0.0017565858,0.0010960853,0.0010869111,0.000054166718,0.000014209124],"category_scores_gemma":[0.000038893526,0.0001981501,0.00008712722,0.00013054152,0.00011469328,0.002982649,0.00020481508,0.00029798818,0.000024967443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031602474,0.000038466515,0.0010007947,0.00004298252,0.000014116685,0.00010676036,0.00025071495,0.020434543,0.8489284,0.0003828605,0.011410682,0.11735809],"study_design_scores_gemma":[0.00032772496,0.000026371685,0.00080681173,0.00014250017,0.000008154493,0.00005663802,0.000007187873,0.9855566,0.010683065,0.0007707335,0.0013125242,0.0003016852],"about_ca_topic_score_codex":0.000026526754,"about_ca_topic_score_gemma":0.0000013842346,"teacher_disagreement_score":0.96512204,"about_ca_system_score_codex":0.0000698709,"about_ca_system_score_gemma":0.00008125628,"threshold_uncertainty_score":0.9999409},"labels":[],"label_agreement":null},{"id":"W2590427356","doi":"10.1109/lsp.2017.2674960","title":"Unsupervized Image Clustering With SIFT-Based Soft-Matching Affinity Propagation","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Scale-invariant feature transform; Pattern recognition (psychology); Artificial intelligence; Cluster analysis; Affinity propagation; Matching (statistics); Similarity (geometry); Computer science; Feature extraction; Image (mathematics); Set (abstract data type); Mathematics; Computer vision; Correlation clustering; Canopy clustering algorithm","score_opus":0.02159910978089052,"score_gpt":0.2776652470225455,"score_spread":0.256066137241655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590427356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04109785,0.00002642759,0.9549856,0.0027584992,0.000081825034,0.00024593063,0.0000012357041,0.0006110567,0.00019158243],"genre_scores_gemma":[0.73195785,9.953112e-7,0.26633278,0.0015500734,0.00009657029,0.000022410093,0.0000016061447,0.000025216948,0.000012512455],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99825287,0.0000599655,0.00026222863,0.000556144,0.00044796334,0.00042080408],"domain_scores_gemma":[0.9986129,0.00006610696,0.00038379245,0.00066919794,0.00016792108,0.00010009522],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003895317,0.00026986576,0.00024702246,0.00011407267,0.0011619572,0.001619024,0.0012770549,0.000059748676,0.000003831364],"category_scores_gemma":[0.000045882687,0.0002240102,0.00006342054,0.0001743758,0.00021158358,0.0035996283,0.00013749556,0.0003185916,0.000010933867],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000913533,0.000049872353,0.00013156458,0.00021641921,0.00001081161,0.0001265375,0.0003872701,0.0019535222,0.7788218,0.00001947948,0.000107305474,0.21808402],"study_design_scores_gemma":[0.0011248159,0.00017611099,0.0005509344,0.00071802177,0.00002131324,0.00003339684,0.000023970077,0.2778798,0.7176092,0.0010110062,0.00016193827,0.00068945816],"about_ca_topic_score_codex":0.00003405993,"about_ca_topic_score_gemma":0.0000071108666,"teacher_disagreement_score":0.69086,"about_ca_system_score_codex":0.00007727544,"about_ca_system_score_gemma":0.0001344989,"threshold_uncertainty_score":0.99941736},"labels":[],"label_agreement":null},{"id":"W2593553812","doi":"10.1109/lsp.2017.2679208","title":"Adaptive Metric Learning and Probe-Specific Reranking for Person Reidentification","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Metric (unit); Computer science; Artificial intelligence; Machine learning","score_opus":0.07155596924491908,"score_gpt":0.3122934657408728,"score_spread":0.24073749649595372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593553812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023137635,0.00076398614,0.97305286,0.002257201,0.00027842278,0.00021473435,5.909297e-7,0.0001327832,0.00016181098],"genre_scores_gemma":[0.8485111,0.000014453806,0.15093328,0.00020745088,0.00021870948,0.00003226991,0.0000011275843,0.000017070774,0.00006452906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854195,0.00010896392,0.00018908728,0.0005801053,0.0002716048,0.00030828392],"domain_scores_gemma":[0.9989012,0.00020824658,0.00038813514,0.00030109534,0.00014429439,0.000057014593],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013739291,0.00015982156,0.00019921374,0.0001867462,0.0015370791,0.0018621725,0.00058761745,0.00005740549,0.0000011380635],"category_scores_gemma":[0.000113884365,0.00015636356,0.000062235864,0.00018928539,0.00011038983,0.0012023173,0.000044937493,0.00022609328,0.0000038398284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032560638,0.000016595579,0.0022699225,0.00011555879,0.000020647207,0.000011031278,0.0014428345,0.00035697984,0.11883138,0.000493106,0.00025872706,0.87615067],"study_design_scores_gemma":[0.005336814,0.0008456527,0.11134685,0.0024232059,0.00014634173,0.00019920937,0.0007841587,0.6991191,0.14455675,0.011089675,0.020511,0.0036412876],"about_ca_topic_score_codex":0.000013407381,"about_ca_topic_score_gemma":0.0000013526632,"teacher_disagreement_score":0.87250936,"about_ca_system_score_codex":0.00004299928,"about_ca_system_score_gemma":0.00004194865,"threshold_uncertainty_score":0.9997628},"labels":[],"label_agreement":null},{"id":"W2596774547","doi":"10.1109/lsp.2017.2682857","title":"Track-to-Track Association by Coherent Point Drift","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Track (disk drive); Expectation–maximization algorithm; Probabilistic logic; Computer science; Centroid; Point (geometry); Gaussian; Algorithm; Artificial intelligence; Maximization; Association (psychology); Computer vision; Maximum likelihood; Mathematics; Mathematical optimization; Statistics","score_opus":0.0147413015517044,"score_gpt":0.25258489859027616,"score_spread":0.23784359703857177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596774547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13852222,0.00012056758,0.82957584,0.028373567,0.0016923838,0.00026127108,0.000024085031,0.00051632896,0.00091374654],"genre_scores_gemma":[0.97997457,0.00000509094,0.011109775,0.007971716,0.00050008553,0.000017704882,0.000011212142,0.000026709266,0.00038314876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976195,0.000080126396,0.00035841088,0.00066433544,0.00069025945,0.0005873392],"domain_scores_gemma":[0.99830437,0.00011176504,0.0004960198,0.0007441173,0.00012617456,0.00021753699],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061411096,0.00024662437,0.00024748454,0.000079598605,0.0010632053,0.0020790275,0.0017174715,0.00013137085,0.000027950226],"category_scores_gemma":[0.00007725544,0.00023562057,0.00008944344,0.00014291726,0.00005757542,0.0012491937,0.00014174529,0.00039344112,0.00020361204],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019125473,0.0001167193,0.0023494726,0.000039341197,0.000030783453,0.00004171127,0.0008301425,0.0019821348,0.13497446,0.00006469299,0.6807866,0.1787648],"study_design_scores_gemma":[0.0054326723,0.00066072587,0.036609493,0.0020613684,0.0001922651,0.000118602045,0.00015609461,0.32073125,0.23420496,0.0025986456,0.39139375,0.0058401558],"about_ca_topic_score_codex":0.00005322973,"about_ca_topic_score_gemma":0.000006420236,"teacher_disagreement_score":0.84145236,"about_ca_system_score_codex":0.00013967596,"about_ca_system_score_gemma":0.000049721064,"threshold_uncertainty_score":0.9989569},"labels":[],"label_agreement":null},{"id":"W2717930533","doi":"10.1109/lsp.2017.2717946","title":"Saliency-Guided Just Noticeable Distortion Estimation Using the Normalized Laplacian Pyramid","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Just-noticeable difference; Artificial intelligence; Human visual system model; Distortion (music); Computer science; Computer vision; Pixel; Pattern recognition (psychology); Salient; Laplace operator; Pyramid (geometry); Image (mathematics); Mathematics","score_opus":0.06411927875584555,"score_gpt":0.33055633263450857,"score_spread":0.266437053878663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2717930533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016755,0.000014374502,0.69449395,0.002616842,0.00068491773,0.00013265373,6.327396e-7,0.00014797712,0.00023315221],"genre_scores_gemma":[0.9903104,0.000001038525,0.00786905,0.0015212547,0.00018289284,0.0000124906865,0.000002271804,0.000015382006,0.000085253174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983213,0.00009185132,0.0003439886,0.00040026937,0.00049338926,0.00034922053],"domain_scores_gemma":[0.9987449,0.000023922576,0.00049912994,0.00054002187,0.000115691524,0.00007631952],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005589674,0.00018751969,0.00015613587,0.000102096135,0.002541871,0.0015612886,0.0010039335,0.00006627959,0.000010442233],"category_scores_gemma":[0.000045948716,0.00014751371,0.00009040265,0.00020519775,0.00020001933,0.0023328816,0.00008606024,0.0002025679,0.000035558038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059169262,0.00018640983,0.0013600157,0.00024620327,0.000044821863,0.00004506638,0.0046640937,0.09046435,0.7298859,0.0009771916,0.002134583,0.16993222],"study_design_scores_gemma":[0.00039531436,0.00003224008,0.0021131844,0.00009455721,0.000030461846,0.00004155648,0.00005756938,0.9739419,0.02249842,0.00033391482,0.00019780276,0.00026304516],"about_ca_topic_score_codex":0.0001802636,"about_ca_topic_score_gemma":0.000012630221,"teacher_disagreement_score":0.88347757,"about_ca_system_score_codex":0.00012995877,"about_ca_system_score_gemma":0.00007613347,"threshold_uncertainty_score":0.9994752},"labels":[],"label_agreement":null},{"id":"W2735133106","doi":"10.1109/lsp.2017.2724848","title":"Adaptive Kalman Filtering by Covariance Sampling","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kalman filter; Covariance; Covariance intersection; Noise (video); Computer science; White noise; Noise measurement; Gaussian noise; Covariance matrix; Algorithm; A priori and a posteriori; Estimation of covariance matrices; Artificial intelligence; Extended Kalman filter; Mathematics; Control theory (sociology); Pattern recognition (psychology); Statistics; Noise reduction","score_opus":0.04286700277901982,"score_gpt":0.27418640448470183,"score_spread":0.231319401705682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735133106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011085149,0.00017295126,0.98487806,0.0023225772,0.000707992,0.00007963522,0.000010904938,0.00027406303,0.00046863843],"genre_scores_gemma":[0.88293594,0.000006032095,0.11408949,0.0024674423,0.0003931632,0.000009384587,0.0000048358743,0.000022410448,0.000071313465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982023,0.000041469666,0.0002613673,0.0006355588,0.00036092647,0.0004983827],"domain_scores_gemma":[0.99860847,0.00008386739,0.00032907134,0.0007882759,0.000064211614,0.00012612937],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030034533,0.0002280613,0.00020835438,0.00005675569,0.0015578087,0.0015824254,0.001965077,0.000077362245,0.000013133579],"category_scores_gemma":[0.000023756471,0.00022545469,0.00006205517,0.00010072904,0.00017090524,0.0014948269,0.00022151029,0.00034089084,0.0000421157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053014417,0.000083226376,0.00044378452,0.00008797861,0.000047176523,0.0001552064,0.0010539124,0.020719778,0.40032682,0.0006774238,0.07037418,0.5059775],"study_design_scores_gemma":[0.0016172841,0.00016559302,0.0022143547,0.0014120798,0.000040416922,0.00014193078,0.00006141815,0.894275,0.053021856,0.0021068659,0.042755537,0.0021876493],"about_ca_topic_score_codex":0.000048785638,"about_ca_topic_score_gemma":0.0000016610383,"teacher_disagreement_score":0.87355524,"about_ca_system_score_codex":0.000039425642,"about_ca_system_score_gemma":0.000037973117,"threshold_uncertainty_score":0.99974203},"labels":[],"label_agreement":null},{"id":"W2742523248","doi":"10.1109/lsp.2017.2735806","title":"Distributed Alamouti Relay Beamforming Scheme in Multiuser Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Beamforming; Computer science; Relay channel; Signal-to-noise ratio (imaging); Transmitter power output; Optimization problem; Mathematical optimization; Power (physics); Algorithm; Mathematics; Telecommunications; Transmitter","score_opus":0.033820565308053864,"score_gpt":0.2824159891927094,"score_spread":0.24859542388465553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742523248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08991805,0.00039207004,0.902359,0.0064551285,0.00026859975,0.00016203677,0.0000010117085,0.00016524475,0.00027887477],"genre_scores_gemma":[0.97229815,0.000053083415,0.025435299,0.0019430985,0.00015391718,0.00002535997,0.000006977735,0.000019729232,0.00006438334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982422,0.00011085203,0.00039315823,0.000483056,0.00026305794,0.00050766126],"domain_scores_gemma":[0.99836105,0.000099897814,0.00032799135,0.0010003624,0.00010031584,0.00011039759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064492796,0.00023360766,0.00024080505,0.00011321061,0.0012133808,0.0009640925,0.0021868425,0.0001008236,0.000008405385],"category_scores_gemma":[0.000067729234,0.00022718645,0.00007077868,0.0003096959,0.00017061821,0.0015555971,0.0004199017,0.00061817875,0.000016762437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008514589,0.00031725876,0.03679551,0.0001050711,0.00008093153,0.00024959823,0.004450619,0.2646826,0.10854636,0.001889972,0.0109830415,0.57181394],"study_design_scores_gemma":[0.000644912,0.000016582442,0.00764876,0.00035250364,0.000004675619,0.000009900103,0.000014145104,0.98641926,0.0013650354,0.000027458089,0.0031200568,0.0003767344],"about_ca_topic_score_codex":0.000016154963,"about_ca_topic_score_gemma":0.000036955484,"teacher_disagreement_score":0.8823801,"about_ca_system_score_codex":0.00012639655,"about_ca_system_score_gemma":0.00006665576,"threshold_uncertainty_score":0.9332467},"labels":[],"label_agreement":null},{"id":"W2745204051","doi":"10.1109/lsp.2017.2738027","title":"Flexible Multiple Base Station Association and Activation for Downlink Heterogeneous Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Base station; Telecommunications link; Computer science; Transmitter power output; Proximal Gradient Methods; Cellular network; Computer network; Heterogeneous network; Wireless; Association (psychology); Power (physics); Joint (building); Wireless network; Projection (relational algebra); Real-time computing; Gradient descent; Algorithm; Telecommunications; Transmitter; Engineering; Artificial neural network; Artificial intelligence","score_opus":0.015927957549117643,"score_gpt":0.24072992777952568,"score_spread":0.22480197023040804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745204051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06580676,0.00005981934,0.9330624,0.00029369575,0.00020395736,0.00032489552,0.000008382062,0.00021663807,0.00002345667],"genre_scores_gemma":[0.9894325,0.000007985409,0.009845861,0.00022341707,0.00028402713,0.000075462376,0.00004789279,0.000045269986,0.000037567344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992614,0.000015005699,0.00019967632,0.00019046392,0.0001083157,0.00022514969],"domain_scores_gemma":[0.999407,0.00010190248,0.00023325603,0.0001250071,0.000088815046,0.00004405513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017189977,0.00013899237,0.00013249132,0.000058818114,0.0004266887,0.00027139077,0.0000843898,0.000095262076,0.0000015869747],"category_scores_gemma":[0.00006732694,0.00015658658,0.000027648684,0.000040927178,0.000019784997,0.0007820227,0.000006941015,0.00009717044,0.0000013732548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018932076,0.000004754515,0.0007499016,0.00011390885,0.000016443508,4.9850723e-7,0.000109395034,0.8889428,0.08744741,0.0000013020187,0.0004001539,0.022194495],"study_design_scores_gemma":[0.00056313915,0.000015058866,0.00032737243,0.000091929396,0.000016611828,0.0000013941946,0.000008928283,0.95369077,0.04487932,0.000036118883,0.00019001863,0.00017931321],"about_ca_topic_score_codex":0.000012743882,"about_ca_topic_score_gemma":0.000007427526,"teacher_disagreement_score":0.92362577,"about_ca_system_score_codex":0.00020000308,"about_ca_system_score_gemma":0.0000098400515,"threshold_uncertainty_score":0.6385415},"labels":[],"label_agreement":null},{"id":"W2765165617","doi":"10.1109/lsp.2017.2765895","title":"State Identification of Duffing Oscillator Based on Extreme Learning Machine","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Duffing equation; Lyapunov exponent; Extreme learning machine; Chaotic; Convergence (economics); Control theory (sociology); Computer science; Rate of convergence; Algorithm; Computation; Feature (linguistics); Mathematics; Artificial intelligence; Nonlinear system; Key (lock); Artificial neural network; Physics","score_opus":0.021196774641656677,"score_gpt":0.25702056061501566,"score_spread":0.23582378597335898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765165617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25243828,0.00002845255,0.74334615,0.0034140083,0.00020498196,0.00006694904,0.0000011324761,0.00015352732,0.0003465032],"genre_scores_gemma":[0.99521565,8.830609e-7,0.0037571667,0.0007199418,0.000080003636,0.000004686981,0.0000019084566,0.000018624847,0.00020111086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983941,0.00010759363,0.00033037286,0.0004273676,0.00045958045,0.0002809993],"domain_scores_gemma":[0.99855775,0.0000785693,0.0006841701,0.0005292653,0.0000790762,0.00007118506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007809816,0.00016873782,0.00018487664,0.00016744253,0.0008483459,0.0006542226,0.0009850103,0.000037323927,0.0000070793126],"category_scores_gemma":[0.00011404761,0.00015849578,0.000069240494,0.00012808868,0.000093608585,0.00054956134,0.00006320903,0.00028093273,0.000024287674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040411316,0.000073796684,0.00986145,0.00017552519,0.00001357273,0.000024057379,0.0007956445,0.2598456,0.3271703,0.000050409824,0.00029342587,0.40165576],"study_design_scores_gemma":[0.00036044378,0.000057568242,0.010371071,0.00016281418,0.000006659308,0.0000024964668,0.000003553041,0.9679365,0.020286914,0.00008618471,0.0005196005,0.00020619288],"about_ca_topic_score_codex":0.000071394454,"about_ca_topic_score_gemma":0.0000019928864,"teacher_disagreement_score":0.7427774,"about_ca_system_score_codex":0.000034215333,"about_ca_system_score_gemma":0.000060954248,"threshold_uncertainty_score":0.6524877},"labels":[],"label_agreement":null},{"id":"W2770340319","doi":"10.1109/lsp.2018.2801836","title":"Feedback Acquisition and Reconstruction of Spectrum-Sparse Signals by Predictive Level Comparisons","year":2018,"lang":"en","type":"preprint","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Iran National Science Foundation; Sharif University of Technology","keywords":"Algorithm; Sliding window protocol; Compressed sensing; Computer science; Sign (mathematics); Signal reconstruction; Encoding (memory); SIGNAL (programming language); Binary number; Scheme (mathematics); Sequence (biology); Window (computing); Mathematics; Artificial intelligence; Signal processing; Telecommunications","score_opus":0.02852711670992096,"score_gpt":0.240023447183673,"score_spread":0.21149633047375205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770340319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5495202,0.0014172592,0.4469375,0.00019745514,0.00048666904,0.00031653576,0.00014679349,0.0005965195,0.0003810857],"genre_scores_gemma":[0.99187,0.00012885696,0.007200849,0.00019475831,0.00045608406,0.000026432814,0.000035510482,0.000079288046,0.000008263794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982244,0.000070918395,0.00053757045,0.0005173939,0.00030653775,0.00034321245],"domain_scores_gemma":[0.9991013,0.000053114476,0.00034946896,0.0002685721,0.00013474651,0.000092796334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017513179,0.00045228057,0.0005823915,0.00023428795,0.00011918104,0.00014216192,0.0002432977,0.00034721347,0.00002872554],"category_scores_gemma":[0.000004831569,0.00050065946,0.00010443404,0.00014184008,0.0004309074,0.00021298073,0.00009587088,0.0006376095,0.0000046985847],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010140606,0.000049410224,0.00037497387,0.0006417535,0.0002725249,0.00000903819,0.0005185168,0.041624174,0.8628067,0.0000015520554,0.07081059,0.022789367],"study_design_scores_gemma":[0.000324697,0.00010762564,0.00063595356,0.0040249396,0.00018614563,0.000059077753,0.00006599306,0.21823102,0.77397627,0.0015615341,0.000110740475,0.00071598025],"about_ca_topic_score_codex":0.000049457107,"about_ca_topic_score_gemma":0.0000026631812,"teacher_disagreement_score":0.4423498,"about_ca_system_score_codex":0.0001210951,"about_ca_system_score_gemma":0.00004842237,"threshold_uncertainty_score":0.9997445},"labels":[],"label_agreement":null},{"id":"W2787836236","doi":"10.1109/lsp.2018.2802780","title":"Is Self-Interference in Full-Duplex Communications a Foe or a Friend?","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Telecommunications link; Base station; Maximization; Transmission (telecommunications); Iterative method; Convex optimization","score_opus":0.03871680295729976,"score_gpt":0.2793275456708534,"score_spread":0.24061074271355362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787836236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94435203,0.0004790873,0.047637824,0.005085012,0.00020662854,0.0003358862,0.000020591284,0.0010527532,0.00083017244],"genre_scores_gemma":[0.9796178,0.000054576092,0.01853861,0.0014048818,0.00012735967,0.00013020763,0.0000102907825,0.00007048927,0.000045825],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847734,0.00008067939,0.00047338594,0.00029590804,0.00019921635,0.00047348355],"domain_scores_gemma":[0.99840164,0.00015089061,0.00008937047,0.0011395763,0.00011596321,0.000102535225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019286244,0.00027742353,0.00025746727,0.00026035027,0.00029448213,0.00016831487,0.0015038594,0.000109255285,0.00014756691],"category_scores_gemma":[0.000021464331,0.00027562177,0.000060571383,0.000810091,0.00033302745,0.00042943662,0.00014671088,0.00053573604,0.00020043769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015865717,0.0004894088,0.0010128203,0.00064838165,0.00020150446,0.00003239504,0.0419382,0.072076656,0.805889,0.00013207702,0.029228441,0.04819247],"study_design_scores_gemma":[0.00045931278,0.000063726286,0.00030224692,0.00037880644,0.000024323115,0.000026972506,0.00029450707,0.98424834,0.008585495,0.000009197866,0.005171884,0.00043515977],"about_ca_topic_score_codex":0.000055726436,"about_ca_topic_score_gemma":0.00035648193,"teacher_disagreement_score":0.9121717,"about_ca_system_score_codex":0.00020786334,"about_ca_system_score_gemma":0.000089996414,"threshold_uncertainty_score":0.9999696},"labels":[],"label_agreement":null},{"id":"W2789151399","doi":"10.1109/lsp.2018.2799699","title":"AUV-Aided Joint Localization and Time Synchronization for Underwater Acoustic Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"Synchronization (alternating current); Computer science; Underwater; Scalability; Wireless sensor network; Real-time computing; Underwater acoustic communication; Nonlinear system; Network packet; Measure (data warehouse); Range (aeronautics); Underwater acoustics; Control theory (sociology); Telecommunications; Artificial intelligence; Engineering; Computer network; Geology","score_opus":0.010317258986930072,"score_gpt":0.2051855735355893,"score_spread":0.19486831454865924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789151399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01346582,0.00009459158,0.98466456,0.0002260488,0.00018311135,0.00023478462,0.0000025646336,0.0010700712,0.000058465244],"genre_scores_gemma":[0.99608517,0.000008169408,0.00252375,0.00085905293,0.00036615643,0.000022265445,0.00001864764,0.000074361546,0.000042458403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991369,0.000014465274,0.00023230813,0.00021279082,0.000111060195,0.00029243965],"domain_scores_gemma":[0.9996786,0.000029515177,0.000051335777,0.00009153505,0.00010985843,0.00003912684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010677646,0.00017693195,0.00015845869,0.00012215023,0.00022667718,0.0001341262,0.000075009164,0.00013681401,0.000021969472],"category_scores_gemma":[0.000017137627,0.00017013443,0.000027267171,0.00021245665,0.00016910616,0.00020743911,0.000012385151,0.00008910493,0.000019714666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015080115,0.000006745851,0.000053936263,0.00024339175,0.000023291477,0.0000021177693,0.00023535932,0.8652595,0.11240752,0.000009937683,0.0061675347,0.015575545],"study_design_scores_gemma":[0.0002794789,0.000043281623,0.000017207069,0.00009764669,0.000033641234,0.0000075781386,0.00003187727,0.9491439,0.049675453,0.00013829305,0.00031185496,0.00021980878],"about_ca_topic_score_codex":0.0000018377316,"about_ca_topic_score_gemma":0.0000016137777,"teacher_disagreement_score":0.98261935,"about_ca_system_score_codex":0.0000798795,"about_ca_system_score_gemma":0.000012928636,"threshold_uncertainty_score":0.6937881},"labels":[],"label_agreement":null},{"id":"W2794968288","doi":"10.1109/lsp.2018.2820642","title":"Design of Optimal Fixed-Rate Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bivariate analysis; Mathematics; Mathematical optimization; Statistics","score_opus":0.034463296486246735,"score_gpt":0.27913818301015164,"score_spread":0.2446748865239049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794968288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01445662,0.00020691045,0.98367554,0.0004981137,0.00019042345,0.00045368224,0.000016742715,0.00049059675,0.000011374513],"genre_scores_gemma":[0.56997097,0.0000030824112,0.42900133,0.0008180686,0.00012881267,0.00003629987,0.000004727361,0.000027894142,0.00000883749],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99754137,0.00021111575,0.00053928106,0.0007105145,0.00044115208,0.00055658753],"domain_scores_gemma":[0.99792373,0.0004483547,0.00054118596,0.0005700529,0.0003975731,0.00011908786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381364,0.00030374687,0.0003677418,0.0006280798,0.00034362622,0.0003092263,0.0016411227,0.00011601541,0.00000596431],"category_scores_gemma":[0.00012525757,0.00027730933,0.00009611179,0.0016030861,0.00025267544,0.0014216626,0.00017166515,0.00020323752,0.0000103118655],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007289389,0.00006259976,0.000046345478,0.00008521195,0.000029998215,0.000010347679,0.00029799732,0.0024892315,0.9750778,0.00035023186,0.001687506,0.019789828],"study_design_scores_gemma":[0.0006275981,0.00042883278,0.0001644647,0.00023722858,0.00003340182,0.000015097463,0.000011624001,0.3885033,0.6071143,0.0017627189,0.00060760375,0.00049381575],"about_ca_topic_score_codex":0.000025492198,"about_ca_topic_score_gemma":1.5264791e-7,"teacher_disagreement_score":0.55551434,"about_ca_system_score_codex":0.000050064173,"about_ca_system_score_gemma":0.00015879629,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W2797506564","doi":"10.1109/lsp.2018.2825951","title":"Performance Analysis of Distributed Wireless Sensor Networks for Gaussian Source Estimation in the Presence of Impulsive Noise","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Minimum mean square error; Estimator; Gaussian noise; Fading; Computer science; Rayleigh fading; Mean squared error; Algorithm; Additive white Gaussian noise; Fusion center; Gaussian; Wireless sensor network; Noise power; Noise (video); Channel (broadcasting); Wireless; Mathematics; Statistics; Telecommunications; Power (physics); Cognitive radio; Computer network; Artificial intelligence; Physics","score_opus":0.010275055437021027,"score_gpt":0.23939041556771382,"score_spread":0.22911536013069278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797506564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29100654,0.0000143677435,0.70835227,0.00033487251,0.0000781974,0.00016372705,0.000015571948,0.000025875579,0.000008588354],"genre_scores_gemma":[0.9923998,0.0000022178306,0.007116264,0.00032863335,0.00009324751,0.00002134789,0.000026599217,0.000007778861,0.0000040934265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984854,0.00009299656,0.00045247914,0.00032299163,0.000334925,0.00031120316],"domain_scores_gemma":[0.9987284,0.00023912608,0.0004395942,0.00030419973,0.00024491898,0.000043749904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047559978,0.00015438281,0.00029909422,0.0002254708,0.00017663208,0.00010941518,0.00062513293,0.00006863906,0.000002111058],"category_scores_gemma":[0.000022085651,0.00011978031,0.00011987262,0.0024289843,0.00023659552,0.00035439574,0.000032733198,0.00014118386,5.601842e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006186552,0.00005559291,0.0007576958,0.000056722885,0.00007972064,0.0000017091515,0.0009117644,0.9083799,0.0044927406,0.000017763738,0.0002631796,0.084921315],"study_design_scores_gemma":[0.00025103282,0.00010979845,0.004419849,0.0000821502,0.000099143595,0.0000038314183,0.00007832711,0.99008334,0.004690594,0.000013979656,0.000033304485,0.0001346519],"about_ca_topic_score_codex":0.000031683245,"about_ca_topic_score_gemma":0.000008073584,"teacher_disagreement_score":0.7013933,"about_ca_system_score_codex":0.000032077456,"about_ca_system_score_gemma":0.00003522125,"threshold_uncertainty_score":0.4884499},"labels":[],"label_agreement":null},{"id":"W2801303905","doi":"10.1109/lsp.2018.2835763","title":"Distributed Nonlinear System Identification in <inline-formula> <tex-math notation=\"LaTeX\">$\\alpha$ </tex-math> </inline-formula>-Stable Noise","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Logarithm; Noise (video); Nonlinear system; Algorithm; Mathematics; Identification (biology); Alpha (finance); Computer science; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.013335097991907725,"score_gpt":0.24143877596425697,"score_spread":0.22810367797234926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801303905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893771,0.00039415024,0.5052472,0.0003302036,0.0007097285,0.00095519784,0.0003856818,0.0024325924,0.0001681481],"genre_scores_gemma":[0.9613338,0.00004340566,0.03548326,0.0003524784,0.0012130243,0.00030281578,0.000715886,0.00038948093,0.00016582382],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99343926,0.0001347777,0.002157722,0.001387777,0.0012321305,0.001648336],"domain_scores_gemma":[0.9967933,0.00019959996,0.0008057792,0.0010553157,0.00077488605,0.0003711167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00109672,0.0012412065,0.0011386571,0.0008313493,0.0006302472,0.000605966,0.0011713103,0.00052240165,0.000022681357],"category_scores_gemma":[0.00015712218,0.0013042398,0.00028684488,0.0017274435,0.00038206318,0.0024560222,0.00017412986,0.0008836419,0.00031226935],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014233596,0.00017591506,0.000104768245,0.0014578792,0.00011427809,0.00012403377,0.000812058,0.058711752,0.928512,0.0008400327,0.0015751417,0.007429838],"study_design_scores_gemma":[0.0013474668,0.00015837897,0.0010887632,0.0020510168,0.0001297321,0.000093354036,0.00006405654,0.8171392,0.16507986,0.00026246984,0.010935146,0.0016505261],"about_ca_topic_score_codex":0.000026584834,"about_ca_topic_score_gemma":0.000063172585,"teacher_disagreement_score":0.7634321,"about_ca_system_score_codex":0.0015325005,"about_ca_system_score_gemma":0.00019383404,"threshold_uncertainty_score":0.9989407},"labels":[],"label_agreement":null},{"id":"W2810926963","doi":"10.1109/lsp.2018.2849683","title":"Accurate Analytical BER Performance for ZF Receivers Under Imperfect Channel in Low-SNR Region for Large Receiving Antennas","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Channel (broadcasting); Bit error rate; Computer science; Signal-to-noise ratio (imaging); Maximal-ratio combining; Algorithm; Imperfect; Electronic engineering; Mathematics; Telecommunications; Control theory (sociology); Fading; Engineering","score_opus":0.021452274387306586,"score_gpt":0.2578889145882516,"score_spread":0.236436640200945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810926963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1741485,0.000061250874,0.8242678,0.00030099275,0.00039795737,0.0005618047,0.000007784585,0.00019361675,0.00006030784],"genre_scores_gemma":[0.9956056,0.00001612906,0.0029375532,0.0005411105,0.0005799816,0.00013627342,0.000018779687,0.000101932565,0.00006265962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983901,0.000024237908,0.00039725413,0.0003935464,0.00013020038,0.00066466606],"domain_scores_gemma":[0.99938446,0.00011374067,0.00011472086,0.0001549602,0.0001554699,0.000076617456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034606742,0.0002742374,0.0003050615,0.00024066173,0.00021997803,0.00008314617,0.00017287981,0.00013805256,0.000004218569],"category_scores_gemma":[0.00004200027,0.00028468808,0.00007955121,0.00040738835,0.000066333865,0.0007957743,0.000012670033,0.00018119306,0.00000729414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027639326,0.00004818355,0.0002889271,0.0014602147,0.00005602816,0.000005721922,0.0013125621,0.9478734,0.04100043,0.000014916504,0.0028372293,0.0048259743],"study_design_scores_gemma":[0.0010996506,0.00010744151,0.00015823364,0.0008059645,0.00002575087,0.000010146422,0.00012993821,0.9892331,0.0078426385,0.00004080991,0.00016554561,0.00038077426],"about_ca_topic_score_codex":0.0000030526228,"about_ca_topic_score_gemma":0.000013622913,"teacher_disagreement_score":0.8214571,"about_ca_system_score_codex":0.0002703736,"about_ca_system_score_gemma":0.000035069235,"threshold_uncertainty_score":0.99996054},"labels":[],"label_agreement":null},{"id":"W2888468122","doi":"10.1109/lsp.2018.2865829","title":"Wasserstein-Distance-Based Gaussian Mixture Reduction","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Reduction (mathematics); Divergence (linguistics); Mixture model; Computer science; Algorithm; Kullback–Leibler divergence; Exponential function; Moment (physics); Matching (statistics); Artificial intelligence; Mathematics; Pattern recognition (psychology); Statistics; Physics; Geometry","score_opus":0.018433903355717676,"score_gpt":0.2669182976932998,"score_spread":0.2484843943375821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888468122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146587845,0.00013503923,0.9768966,0.0059090257,0.00087673566,0.00011497129,9.392357e-7,0.00034378658,0.0010641135],"genre_scores_gemma":[0.8407284,5.4346964e-7,0.15277788,0.0052220654,0.00103681,0.00000942784,0.0000021100348,0.000025156083,0.00019761386],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99783677,0.0001988745,0.00029976072,0.00064813276,0.0004990295,0.0005174198],"domain_scores_gemma":[0.99900746,0.00004701256,0.00018775981,0.00043608967,0.00018655896,0.00013511973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058790355,0.00026077437,0.00022108578,0.0002077718,0.00053280353,0.000620862,0.00082352286,0.00010219356,0.000022903256],"category_scores_gemma":[0.000016138083,0.00023776658,0.00010334582,0.0007975702,0.0002834881,0.0009411975,0.00003487948,0.00028643382,0.00007546745],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007426494,0.000047145135,0.00002342738,0.00007139628,0.0000135757555,0.0000664114,0.0007099571,0.00037666876,0.8708862,0.00017272645,0.010974654,0.116583586],"study_design_scores_gemma":[0.0013597382,0.00028137074,0.0001685964,0.00040583953,0.000039070175,0.00011596698,0.00004290505,0.121167056,0.8630024,0.0021076705,0.010424973,0.00088439445],"about_ca_topic_score_codex":0.000012577253,"about_ca_topic_score_gemma":0.0000017525315,"teacher_disagreement_score":0.8260696,"about_ca_system_score_codex":0.00010171917,"about_ca_system_score_gemma":0.00017060044,"threshold_uncertainty_score":0.9695839},"labels":[],"label_agreement":null},{"id":"W2896389278","doi":"10.1109/lsp.2018.2875348","title":"Image Reconstruction Combined With Interference Removal Using a Mixed-Domain Proximal Operator","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Photoacoustic and Ultrasonic Imaging","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interference (communication); Iterative reconstruction; Distortion (music); Computer science; Smoothness; Algorithm; Imaging phantom; Domain (mathematical analysis); Computer vision; Artificial intelligence; Channel (broadcasting); Mathematics; Optics; Physics; Telecommunications","score_opus":0.009598046691337611,"score_gpt":0.21124909750160098,"score_spread":0.20165105081026335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896389278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5992513,0.000019346584,0.39965615,0.00006829995,0.00026737922,0.00011223468,0.0000039932693,0.00022129246,0.0004000343],"genre_scores_gemma":[0.9113886,6.318591e-7,0.08781659,0.000351145,0.0003643312,0.000010171628,0.0000017666091,0.000058300502,0.0000084688545],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875855,0.000031810836,0.00025280824,0.00030788756,0.00019854862,0.00045039327],"domain_scores_gemma":[0.99957603,0.000022190805,0.00006603686,0.00013944203,0.000104695886,0.00009162433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016718455,0.0002627017,0.0002225217,0.00011624473,0.00023267388,0.00021056161,0.00017804452,0.00005587087,0.00004373354],"category_scores_gemma":[0.000007812004,0.00023567199,0.000035200697,0.00027404787,0.00037501805,0.0005779942,0.000014083845,0.00028543104,0.000015037608],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010499573,0.000012352304,0.000067780726,0.00012788159,0.00003111429,0.000074131574,0.0005111431,0.0010489565,0.98536617,0.0000020516904,0.00025991345,0.012393525],"study_design_scores_gemma":[0.0010415498,0.00016664274,0.000072197385,0.000866535,0.000060030976,0.0017530672,0.00042403,0.76392764,0.23093589,0.00006403621,0.000075246964,0.00061313965],"about_ca_topic_score_codex":0.000010323878,"about_ca_topic_score_gemma":0.0000037271202,"teacher_disagreement_score":0.76287866,"about_ca_system_score_codex":0.00015754254,"about_ca_system_score_gemma":0.00008862608,"threshold_uncertainty_score":0.96104246},"labels":[],"label_agreement":null},{"id":"W2912581987","doi":"10.1109/lsp.2019.2895749","title":"Medical Image Fusion via Convolutional Sparsity Based Morphological Component Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":305,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Component (thermodynamics); Sparse approximation; Image fusion; Convolutional neural network; Image (mathematics); Computer vision; Component analysis; Representation (politics); Pixel","score_opus":0.007747057653277735,"score_gpt":0.22586037780437043,"score_spread":0.2181133201510927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912581987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3636671,0.000049103448,0.63486946,0.00045660575,0.0000927065,0.00011503205,0.0000070269452,0.0005850602,0.00015786922],"genre_scores_gemma":[0.97143704,0.0000036290521,0.026289064,0.002062762,0.00009556103,0.000014320823,0.000052975673,0.000031011128,0.00001362047],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807787,0.000058827805,0.00034199224,0.00038001544,0.0007590505,0.0003822415],"domain_scores_gemma":[0.99936825,0.00009327746,0.00007889219,0.00021172558,0.00007418834,0.00017365135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029848242,0.00025199904,0.00036770958,0.00027500253,0.00011190463,0.000049446007,0.00032227222,0.0001502324,0.0019543555],"category_scores_gemma":[0.00001486923,0.00023611718,0.00017323821,0.00055640447,0.00017887942,0.00024539907,0.000047756836,0.0004512199,0.00015413735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028886572,0.000054122684,0.0017263697,0.00008204889,0.000056052406,0.0001288056,0.000018324821,0.04157112,0.9486531,0.0000014209511,0.0023634743,0.005316276],"study_design_scores_gemma":[0.00043681727,0.000031491472,0.004393434,0.000070370574,0.000092179565,0.000024574138,0.0000053906765,0.9151044,0.07900741,0.000059078793,0.00038373994,0.00039110982],"about_ca_topic_score_codex":0.000010657239,"about_ca_topic_score_gemma":0.0000013676649,"teacher_disagreement_score":0.8735333,"about_ca_system_score_codex":0.00014705303,"about_ca_system_score_gemma":0.000035187855,"threshold_uncertainty_score":0.998958},"labels":[],"label_agreement":null},{"id":"W2922019075","doi":"10.1109/lsp.2019.2921446","title":"Convolutional Analysis Operator Learning: Dependence on Training Data","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institute of Biomedical Imaging and Bioengineering; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; W. M. Keck Foundation","keywords":"Operator (biology); Filter (signal processing); Training (meteorology); Training set; Pattern recognition (psychology); Convolutional neural network; Series (stratigraphy); Upper and lower bounds","score_opus":0.04774172891518412,"score_gpt":0.2748918543182899,"score_spread":0.22715012540310575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922019075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026815582,0.000030017292,0.9709954,0.0011358472,0.00015313286,0.00014376442,0.0000046818736,0.0004009869,0.00032056635],"genre_scores_gemma":[0.9280846,7.8976905e-7,0.06925391,0.0024534287,0.000067139255,0.00001073517,0.000029801564,0.00001409255,0.00008548273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978717,0.00008271309,0.0002692126,0.00081549486,0.0006218945,0.00033900124],"domain_scores_gemma":[0.99887085,0.00014515639,0.00017368737,0.00061259733,0.000102347665,0.00009534915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004919922,0.00018894486,0.00023841979,0.0003801032,0.00018461491,0.00036128183,0.0017178794,0.0000591751,0.000057206475],"category_scores_gemma":[0.00004883956,0.00018443879,0.000062565254,0.0011708656,0.0000697743,0.0009847521,0.0001676804,0.0003051919,0.000075810414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003679211,0.000119935765,0.0056348173,0.00005847638,0.00034804206,0.00004196541,0.0023339102,0.89698744,0.049090717,0.005165089,0.0024358856,0.03774695],"study_design_scores_gemma":[0.00019849307,0.00007168149,0.00043217812,0.00005634919,0.000046724614,0.000009037656,0.00003436992,0.99705344,0.0015086043,0.000106074905,0.00021377442,0.00026928395],"about_ca_topic_score_codex":0.0000074209547,"about_ca_topic_score_gemma":6.3373545e-7,"teacher_disagreement_score":0.9017415,"about_ca_system_score_codex":0.0000668703,"about_ca_system_score_gemma":0.000151486,"threshold_uncertainty_score":0.75211954},"labels":[],"label_agreement":null},{"id":"W2941547246","doi":"10.1109/lsp.2019.2910403","title":"Single Image Dehazing with a Generic Model-Agnostic Convolutional Neural Network","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Image (mathematics); Artificial intelligence; Atmosphere (unit); Simple (philosophy); Artificial neural network; Plug and play; Computer vision; Pattern recognition (psychology)","score_opus":0.014948161483332039,"score_gpt":0.2192740983239218,"score_spread":0.20432593684058978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941547246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16619492,0.00011905405,0.831643,0.000834332,0.00014182976,0.00022474724,7.6161416e-7,0.00049285934,0.0003484932],"genre_scores_gemma":[0.7469522,6.474576e-7,0.24850096,0.004270042,0.00016153634,0.000027120352,0.0000027474293,0.000026432683,0.000058361577],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979436,0.000053425643,0.0002576281,0.00059195544,0.00052142766,0.00063197163],"domain_scores_gemma":[0.9992176,0.00006727316,0.0001871196,0.00032395788,0.000121130215,0.00008288575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020970523,0.00026600918,0.00021806844,0.00010382171,0.00021228618,0.0004229896,0.0007430056,0.000048451708,0.000013347339],"category_scores_gemma":[0.0000055140845,0.00024083458,0.000054690925,0.0005299818,0.00012888221,0.0015312383,0.000109237335,0.0002466574,0.000046376033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020617272,0.00004652871,0.00029425297,0.000058112833,0.000012913467,0.000045396784,0.00015713288,0.26881757,0.71689546,0.00007502639,0.0037465123,0.009830464],"study_design_scores_gemma":[0.00029872762,0.0001333361,0.00009390974,0.00017495846,0.000012934653,0.00006114664,0.0000026416908,0.964392,0.034056373,0.00030542782,0.00007984754,0.0003886822],"about_ca_topic_score_codex":0.000005465887,"about_ca_topic_score_gemma":0.0000010242537,"teacher_disagreement_score":0.69557446,"about_ca_system_score_codex":0.00012813087,"about_ca_system_score_gemma":0.00012315436,"threshold_uncertainty_score":0.9820949},"labels":[],"label_agreement":null},{"id":"W2965510792","doi":"10.1109/lsp.2019.2931150","title":"An Improved Stationarity Test Based on Surrogates","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Test (biology); Algorithm; Machine learning; Data mining; Artificial intelligence","score_opus":0.01111671907144038,"score_gpt":0.2569364101170627,"score_spread":0.24581969104562232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965510792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14653984,0.0000043981004,0.8473857,0.0046742265,0.00008458943,0.00021962513,0.0000034903178,0.0006352013,0.00045295493],"genre_scores_gemma":[0.94028765,1.253992e-7,0.045355618,0.014243883,0.000045176905,0.000017011262,0.000008351594,0.00001534487,0.00002683689],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.000092609895,0.00019478328,0.00044244304,0.00033938032,0.00023397041],"domain_scores_gemma":[0.99911183,0.0002037491,0.0001341928,0.00036198116,0.000110071946,0.000078198434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004306917,0.00015690656,0.00012777028,0.00015417645,0.00012382967,0.00046209907,0.0006040263,0.00005817821,0.00001854483],"category_scores_gemma":[0.00001642596,0.00014964298,0.0000399213,0.0003009849,0.000043118904,0.0010359894,0.000016971591,0.0002115255,0.000055058452],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027446133,0.00035587972,0.0049083196,0.000074994714,0.00000558028,0.000006696686,0.0010355717,0.019552505,0.94119877,0.0004554864,0.0011650205,0.031213725],"study_design_scores_gemma":[0.00029267388,0.0002734475,0.0017835255,0.00004361644,0.0000022554464,0.0000014863514,0.000010713263,0.90242255,0.09431863,0.00042799284,0.00018778439,0.00023531745],"about_ca_topic_score_codex":0.000015288404,"about_ca_topic_score_gemma":0.0000024927724,"teacher_disagreement_score":0.8828701,"about_ca_system_score_codex":0.00004968805,"about_ca_system_score_gemma":0.00013969348,"threshold_uncertainty_score":0.61022633},"labels":[],"label_agreement":null},{"id":"W2980241036","doi":"10.1109/lsp.2019.2945683","title":"Joint Design of Measurement Matrix and Sparse Support Recovery Method via Deep Auto-Encoder","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Encoder; Thresholding; Joint (building); Artificial intelligence; Sparse matrix; Computational complexity theory; Matrix (chemical analysis); Compressed sensing; Algorithm; Computation; Signal processing; Pattern recognition (psychology); Computer engineering; Computer hardware; Digital signal processing; Image (mathematics)","score_opus":0.03331377140293759,"score_gpt":0.24344556806698547,"score_spread":0.21013179666404788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980241036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03534437,0.00047015847,0.96306646,0.00011145436,0.00018718527,0.00026949408,0.0000012512915,0.00036545616,0.00018415973],"genre_scores_gemma":[0.882069,0.000014735679,0.11745545,0.00031319848,0.00006377749,0.000010372335,0.0000011966158,0.000054404147,0.000017883684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985618,0.0000794567,0.00036354188,0.00028557333,0.00040199567,0.00030761154],"domain_scores_gemma":[0.9994519,0.000046744084,0.00011918769,0.00020730833,0.000106521125,0.000068339155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006090328,0.00024506406,0.0003562817,0.00017095415,0.000047202884,0.00006212696,0.0001349161,0.000094727366,0.000042268144],"category_scores_gemma":[0.000007868156,0.00024018361,0.00006903003,0.0001410223,0.000046288023,0.00023540824,0.000023603243,0.000207557,0.000015768423],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908755,0.000013002632,0.000031344243,0.00015827584,0.000049675717,0.000012475521,0.00016976544,0.13189201,0.83754325,0.0000018252035,0.0016346176,0.028468847],"study_design_scores_gemma":[0.00028588154,0.000109705106,0.00014270618,0.0003433607,0.00006653488,0.00004982537,0.000024347079,0.48671982,0.5112321,0.00044588008,0.00021133985,0.00036848453],"about_ca_topic_score_codex":0.000014819164,"about_ca_topic_score_gemma":6.681515e-7,"teacher_disagreement_score":0.8467246,"about_ca_system_score_codex":0.00008386043,"about_ca_system_score_gemma":0.000039109116,"threshold_uncertainty_score":0.97944033},"labels":[],"label_agreement":null},{"id":"W3028989134","doi":"10.1109/lsp.2020.3043990","title":"Multi-Volumetric Refocusing of Light Fields","year":2020,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Finite impulse response; Filter (signal processing); Computer science; Reduction (mathematics); Filter design; Algorithm; Planar; Light field; Computer vision; Artificial intelligence; Mathematics; Geometry","score_opus":0.03168523418857924,"score_gpt":0.27214027951357944,"score_spread":0.2404550453250002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028989134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007578756,0.0002813314,0.9783386,0.013342754,0.000118693904,0.000055880526,3.418194e-7,0.00014136145,0.0001423078],"genre_scores_gemma":[0.7581096,0.0000020978723,0.23179765,0.009979642,0.00008634844,0.0000013278046,2.0773282e-7,0.000009635047,0.00001343173],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883056,0.00003274083,0.00026540214,0.00035050363,0.000281454,0.00023936149],"domain_scores_gemma":[0.9994529,0.000033771135,0.00016391762,0.00016719179,0.00007164043,0.000110607376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010473614,0.0001285965,0.00017927651,0.0001346202,0.00011638741,0.00011667205,0.00059557654,0.000035788835,0.0000077541545],"category_scores_gemma":[0.000038226277,0.00011826659,0.00006293474,0.0009544555,0.000042943248,0.0007502819,0.00009128588,0.00020337362,0.00001683072],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067251076,0.00002549636,0.00013795745,0.00008399571,0.000005871703,0.0000252817,0.0012298296,0.0013043253,0.6671295,0.000011011015,0.0013785727,0.32866144],"study_design_scores_gemma":[0.00048428847,0.00006020008,0.00017503124,0.00013793288,0.000007314281,0.00000881153,0.000036007244,0.7896266,0.20674571,0.000051711435,0.0023894962,0.0002768937],"about_ca_topic_score_codex":0.0000041905723,"about_ca_topic_score_gemma":1.5735837e-7,"teacher_disagreement_score":0.78832227,"about_ca_system_score_codex":0.000020059235,"about_ca_system_score_gemma":0.000042626354,"threshold_uncertainty_score":0.48227715},"labels":[],"label_agreement":null},{"id":"W3091528227","doi":"10.1109/lsp.2020.3028006","title":"A Complete Discriminative Tensor Representation Learning for Two-Dimensional Correlation Analysis","year":2020,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Discriminative model; Representation (politics); Tensor (intrinsic definition); Pattern recognition (psychology); Canonical correlation; Correlation; Linear discriminant analysis","score_opus":0.0880582341947177,"score_gpt":0.34963411800444544,"score_spread":0.26157588380972774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091528227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17831762,0.000008179261,0.8114948,0.009507514,0.000023002627,0.00034988427,0.00002418574,0.00016964928,0.00010511983],"genre_scores_gemma":[0.9673291,1.0817787e-7,0.029430816,0.0027038718,0.0001718104,0.00009441498,0.00017636559,0.000026736867,0.00006677114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873805,0.0000845564,0.00034295904,0.00037436193,0.0002730193,0.00018706427],"domain_scores_gemma":[0.99889094,0.0004363679,0.00030285263,0.00008950401,0.00018497212,0.00009534319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012911107,0.00015249991,0.00026154149,0.00012740737,0.0003831046,0.00009402438,0.00010877379,0.000036371228,0.000054415865],"category_scores_gemma":[0.000086645756,0.00014836856,0.00018154024,0.0006175749,0.00006881476,0.00019601597,0.000014549032,0.0001838503,0.000020475072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021859338,0.0001364982,0.0012351621,0.00017350286,0.00044458214,0.0000063397197,0.005168354,0.3929358,0.5812436,0.0017825686,0.008436671,0.008218356],"study_design_scores_gemma":[0.0008453026,0.00005419326,0.00092405046,0.000034938093,0.0007855797,0.000003801922,0.00029991995,0.9888692,0.003958422,0.0036935585,0.00026191096,0.00026912612],"about_ca_topic_score_codex":0.0000066609473,"about_ca_topic_score_gemma":0.0000017267031,"teacher_disagreement_score":0.7890115,"about_ca_system_score_codex":0.000040415525,"about_ca_system_score_gemma":0.00001949384,"threshold_uncertainty_score":0.60502946},"labels":[],"label_agreement":null},{"id":"W3114119488","doi":"10.1109/lsp.2020.3044775","title":"Time Difference of Arrival Estimation Based on a Kronecker Product Decomposition","year":2020,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Key Research and Development Program of China Stem Cell and Translational Research","keywords":"Multilateration; Impulse response; Reverberation; Kronecker delta; Computer science; Impulse (physics); Kronecker product; Algorithm; Beamforming; Finite impulse response; Mathematics; Acoustics; Telecommunications","score_opus":0.015761752964955664,"score_gpt":0.24258083818544635,"score_spread":0.22681908522049068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114119488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19529249,0.00002991274,0.7939579,0.010294678,0.000052186682,0.0001166734,0.0000015413327,0.00013586828,0.000118746175],"genre_scores_gemma":[0.89814043,1.9292925e-7,0.095854506,0.00585463,0.00012057608,0.000006925402,0.0000048496054,0.0000131167335,0.0000047819412],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984252,0.000057842833,0.0002832374,0.00049768836,0.00047715893,0.00025888922],"domain_scores_gemma":[0.9993223,0.000054728465,0.00024083396,0.00018867628,0.00008164007,0.00011179811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014859225,0.00018960824,0.00021220183,0.00010494851,0.0001427367,0.00018437883,0.0004984802,0.000035716323,0.000013542031],"category_scores_gemma":[0.00003462316,0.00017504668,0.0000592828,0.00047587295,0.000091657814,0.00049448473,0.00002973046,0.00017346509,0.000052498133],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003996615,0.000050656156,0.000055901273,0.0001283014,0.0000046413625,0.000010134755,0.00038835141,0.05113801,0.7814484,0.0000021468645,0.00030277317,0.16643073],"study_design_scores_gemma":[0.00020642651,0.00008975081,0.00022978257,0.00017191716,0.0000067956926,0.0000029097957,0.0000017929395,0.5716787,0.42741007,0.00005452546,0.000010479802,0.00013685062],"about_ca_topic_score_codex":0.0000012293285,"about_ca_topic_score_gemma":5.2465797e-8,"teacher_disagreement_score":0.70284796,"about_ca_system_score_codex":0.000036816735,"about_ca_system_score_gemma":0.00012470521,"threshold_uncertainty_score":0.7138196},"labels":[],"label_agreement":null},{"id":"W3118245404","doi":"10.1109/lsp.2021.3050052","title":"The Property of Frequency Shift in 2D-FRFT Domain With Application to Image Encryption","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Robustness (evolution); Frequency domain; Property (philosophy); Encryption; Image (mathematics); Time–frequency analysis; Fourier transform; Fractional Fourier transform","score_opus":0.007729995923466527,"score_gpt":0.22571469002082523,"score_spread":0.2179846940973587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118245404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118970305,0.000074114556,0.8695548,0.010749998,0.00005441979,0.00032417808,0.000001439833,0.00007710227,0.00019362538],"genre_scores_gemma":[0.92239064,0.0000024814833,0.0755883,0.0017931099,0.00007956433,0.00010719051,0.000004139437,0.000019155203,0.000015404856],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979932,0.0001576307,0.0003918655,0.00055298174,0.0005471253,0.0003572481],"domain_scores_gemma":[0.99896324,0.00009666168,0.00020642088,0.0004458737,0.0002051041,0.00008268559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060886616,0.00019226549,0.0001856069,0.0001365122,0.00020299005,0.00028649808,0.00065470365,0.000048399943,0.0000046849345],"category_scores_gemma":[0.000026405427,0.00012375136,0.00004656365,0.0011732898,0.0001436597,0.00086645107,0.00006578184,0.00023763071,0.000024064324],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035696976,0.000059153415,0.00019986836,0.00007458835,0.000005690888,0.00003534769,0.0010777737,0.0015103867,0.95421666,0.00038707303,0.00016332726,0.04223441],"study_design_scores_gemma":[0.0025891466,0.0005423296,0.01273674,0.0014092019,0.000042328364,0.00014209704,0.00043070974,0.076083496,0.88150775,0.021494811,0.0015166547,0.0015047457],"about_ca_topic_score_codex":0.000100035635,"about_ca_topic_score_gemma":0.00009379675,"teacher_disagreement_score":0.80342036,"about_ca_system_score_codex":0.0001608114,"about_ca_system_score_gemma":0.00028568407,"threshold_uncertainty_score":0.50464344},"labels":[],"label_agreement":null},{"id":"W3127483027","doi":"10.1109/lsp.2021.3055748","title":"Robust Minimum Error Entropy Based Cubature Information Filter With Non-Gaussian Measurement Noise","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Outlier; Entropy (arrow of time); Gaussian; Linearization; Entropy estimation; Algorithm; Mathematics; Gaussian noise; Computer science; Filter (signal processing); Noise measurement; Mathematical optimization; Statistics; Artificial intelligence; Noise reduction; Nonlinear system; Estimator","score_opus":0.02402433614496674,"score_gpt":0.2108463214194965,"score_spread":0.18682198527452976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127483027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009575807,0.00007246373,0.9801257,0.009064525,0.00055859465,0.00013981303,0.0000072781895,0.00020934112,0.0002464409],"genre_scores_gemma":[0.88433915,0.0000013615094,0.09960933,0.01566512,0.0002672165,0.000020924104,0.000052109324,0.000020038795,0.000024748864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997582,0.00008150764,0.00035968816,0.00046349087,0.0010308424,0.000482451],"domain_scores_gemma":[0.9987097,0.000039191273,0.00022734763,0.00049160933,0.00036941544,0.00016276463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030789853,0.00027989937,0.00022090084,0.00013702098,0.0003340487,0.00087742525,0.00059354305,0.00010574556,0.000043053362],"category_scores_gemma":[0.000016644226,0.00022825529,0.000074408454,0.0005874023,0.00006950489,0.001582335,0.000059420086,0.00039552726,0.00004654955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028356648,0.00036194446,0.0009191644,0.0007056682,0.000112419126,0.000625405,0.0032445623,0.514899,0.1742675,0.00012564407,0.20249464,0.10196049],"study_design_scores_gemma":[0.0019847834,0.00012328698,0.0012800193,0.0010023008,0.00005548471,0.00009079199,0.000104358056,0.9308003,0.045073114,0.000031837695,0.018564058,0.000889648],"about_ca_topic_score_codex":0.000007799221,"about_ca_topic_score_gemma":0.0000049163605,"teacher_disagreement_score":0.8805164,"about_ca_system_score_codex":0.00009541414,"about_ca_system_score_gemma":0.00030461123,"threshold_uncertainty_score":0.93079805},"labels":[],"label_agreement":null},{"id":"W3150116240","doi":"10.1109/lsp.2021.3106239","title":"Cyclic Defense GAN Against Speech Adversarial Attacks","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adversarial system; Spectrogram; Generative grammar; SIGNAL (programming language); Key (lock); Signal processing","score_opus":0.015164131035845817,"score_gpt":0.25572130532070914,"score_spread":0.2405571742848633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150116240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121591516,0.00012971647,0.8688764,0.0050221574,0.0012267872,0.00011367237,0.0000016358869,0.0004794347,0.002558697],"genre_scores_gemma":[0.9112926,0.000003950716,0.07796832,0.00945492,0.0010551095,0.000008590409,0.000010141921,0.000050317252,0.00015601428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677813,0.00027501973,0.00045197518,0.00097590714,0.0007753795,0.0007435825],"domain_scores_gemma":[0.99856544,0.00018224014,0.00026867996,0.0006030624,0.00017847505,0.00020211811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047357113,0.00037031563,0.00036240462,0.0001735935,0.00054270535,0.0006441548,0.0011464249,0.00014939647,0.000039333125],"category_scores_gemma":[0.00012798485,0.00039556756,0.00017829548,0.00092198054,0.0001510446,0.0011160248,0.00023588618,0.0007738049,0.00012933326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056485103,0.00014732368,0.0015308708,0.00016322343,0.000095353666,0.0034471236,0.002303311,0.19824071,0.37615368,0.00033790764,0.006225826,0.4112982],"study_design_scores_gemma":[0.0048526055,0.00013944987,0.0014685376,0.0007938053,0.00014994813,0.00082244625,0.0002863843,0.80316365,0.16241708,0.001622895,0.021015493,0.0032677003],"about_ca_topic_score_codex":0.000017382677,"about_ca_topic_score_gemma":0.0000053519107,"teacher_disagreement_score":0.79090804,"about_ca_system_score_codex":0.00015898606,"about_ca_system_score_gemma":0.00035387478,"threshold_uncertainty_score":0.9998496},"labels":[],"label_agreement":null},{"id":"W3162075735","doi":"10.1109/lsp.2021.3078696","title":"Elimination of Undetectable Attacks on Natural Gas Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nova Scotia Department of Energy","keywords":"SCADA; Countermeasure; Computer science; Computer security; Natural gas; Operator (biology); Network topology; Electric power system; Cyber-attack; Pipeline (software); Smart grid; Vulnerability (computing); Power (physics); Computer network; Engineering; Electrical engineering","score_opus":0.007100903156426877,"score_gpt":0.20588332959926917,"score_spread":0.19878242644284227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162075735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9353304,0.0013452224,0.06056505,0.0006625016,0.0009889081,0.00006874693,0.0000016876631,0.00017231859,0.00086516596],"genre_scores_gemma":[0.9988785,0.00002002597,0.0002542181,0.0005243265,0.0002611728,0.000003588459,0.0000052761807,0.000018798279,0.00003414416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992294,0.000021900341,0.00016321678,0.00015768933,0.000205324,0.00022251628],"domain_scores_gemma":[0.99972063,0.00005710699,0.000037397567,0.00009485814,0.000054244952,0.00003576594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000791109,0.00011645859,0.00013006282,0.000058838166,0.00007791352,0.000043929875,0.000103735685,0.00006252496,0.000023191402],"category_scores_gemma":[0.000009361048,0.000115166404,0.000047798505,0.0002731763,0.000053147087,0.00015048946,0.000008612808,0.00026718355,0.000006042347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120447185,0.0000167144,0.000040409628,0.00015380606,0.000013404022,0.000025315201,0.00020676365,0.6627818,0.31480166,0.000009416499,0.0022012158,0.019737508],"study_design_scores_gemma":[0.00021596432,0.000026245078,0.0005036271,0.00028829358,0.000015713125,0.000017357332,0.000069358866,0.5929536,0.40525672,0.000030994677,0.0004132337,0.00020887698],"about_ca_topic_score_codex":0.0000019855486,"about_ca_topic_score_gemma":0.0000036846845,"teacher_disagreement_score":0.09045506,"about_ca_system_score_codex":0.000043997607,"about_ca_system_score_gemma":0.000021374304,"threshold_uncertainty_score":0.46963495},"labels":[],"label_agreement":null},{"id":"W3193636205","doi":"10.1109/lsp.2021.3104503","title":"Sparse Bayesian Learning Using Generalized Double Pareto Prior for DOA Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Guangzhou Municipal Science and Technology Bureau; National Natural Science Foundation of China; Ministry of Natural Resources","keywords":"Hyperparameter; Prior probability; Convergence (economics); Computer science; Bayesian probability; Algorithm; Pareto principle; Bayesian inference; Direction of arrival; Hyperparameter optimization; Mathematical optimization; Artificial intelligence; Pattern recognition (psychology); Mathematics; Support vector machine","score_opus":0.037807666731298525,"score_gpt":0.30254015479877117,"score_spread":0.2647324880674726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193636205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05396175,0.000053849024,0.94418883,0.00087596965,0.00019849245,0.00022891226,0.000001017456,0.0003985252,0.000092627735],"genre_scores_gemma":[0.51190394,8.097771e-7,0.4876703,0.00029914142,0.000054166692,0.0000272743,0.0000050048743,0.000016351729,0.000023017394],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845916,0.00007794186,0.0004108738,0.00043240693,0.00033890863,0.00028071026],"domain_scores_gemma":[0.9989779,0.00008260968,0.00034825396,0.00022094735,0.00029954294,0.00007072627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037450754,0.00017688233,0.00024603461,0.00017025445,0.00031911168,0.0003556538,0.00033135043,0.00007078788,0.00000890419],"category_scores_gemma":[0.00005447631,0.00019343282,0.000098510616,0.000559871,0.000058466896,0.0010245527,0.000050509447,0.00014402613,0.0000023439063],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000392501,0.000055802022,0.00014855163,0.00031451468,0.000025292302,0.000013850515,0.00071537105,0.2228307,0.62290055,0.0009068272,0.00041125107,0.15163803],"study_design_scores_gemma":[0.0003566789,0.000020783014,0.000021947017,0.00014984139,0.000015621883,0.000018423792,0.000009833517,0.6342287,0.36401063,0.0008702479,0.00013990245,0.00015736741],"about_ca_topic_score_codex":0.000027634698,"about_ca_topic_score_gemma":0.000001961903,"teacher_disagreement_score":0.4579422,"about_ca_system_score_codex":0.00010139179,"about_ca_system_score_gemma":0.00023832184,"threshold_uncertainty_score":0.7887961},"labels":[],"label_agreement":null},{"id":"W3217472497","doi":"10.1109/lsp.2021.3130504","title":"Uncertainty Estimation via Monte Carlo Dropout in CNN-Based mmWave MIMO Localization","year":2021,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Monte Carlo method; MIMO; Convolutional neural network; Expectation propagation; Algorithm; Bayesian inference; Inference; Bayesian probability; Artificial intelligence; Beamforming; Mathematics; Telecommunications; Statistics","score_opus":0.00826032944837046,"score_gpt":0.21246265854265614,"score_spread":0.20420232909428568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217472497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10125784,0.0002306631,0.89690655,0.0005219198,0.0001923341,0.000116281124,0.0000037008697,0.00064246444,0.00012826634],"genre_scores_gemma":[0.9964642,0.0000046229484,0.0022537538,0.0011071113,0.000053232336,0.000025004387,0.00003484752,0.0000435617,0.000013684751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880594,0.0000385737,0.00033571557,0.0002625889,0.00024806208,0.00030912552],"domain_scores_gemma":[0.9996035,0.00003768617,0.000058676276,0.00015859131,0.00010149706,0.00004006378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011596842,0.00020661035,0.00020123331,0.00021393642,0.00010386632,0.000106004016,0.00013022526,0.00014691084,0.000026827787],"category_scores_gemma":[0.00003470422,0.00022541922,0.000051204835,0.0006774438,0.00007779766,0.00023008118,0.000010331443,0.00022118946,0.000015954818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007383481,0.000015637921,0.00062692974,0.00019230632,0.0000073967894,0.00004672533,0.00022496832,0.93903524,0.021980885,0.0000062786776,0.0005202785,0.037335984],"study_design_scores_gemma":[0.00036872644,0.000009098877,0.00008840695,0.00016388569,0.000012751053,0.000004496259,0.000082926614,0.89548004,0.10325132,0.00012263755,0.00017705714,0.00023865805],"about_ca_topic_score_codex":0.00004578188,"about_ca_topic_score_gemma":0.00004932949,"teacher_disagreement_score":0.89520633,"about_ca_system_score_codex":0.00023759836,"about_ca_system_score_gemma":0.00006891143,"threshold_uncertainty_score":0.9192329},"labels":[],"label_agreement":null},{"id":"W4213363428","doi":"10.1109/lsp.2022.3152108","title":"Joint Parameter and Time-Delay Estimation for a Class of Nonlinear Time-Series Models","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Nonlinear system; Autoregressive model; Computer science; Series (stratigraphy); Estimation theory; Time series; Nonlinear autoregressive exogenous model; Algorithm; Identification (biology); Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Machine learning; Statistics; Control (management)","score_opus":0.012151931040424058,"score_gpt":0.20838485608667626,"score_spread":0.1962329250462522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213363428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38504827,0.00028364474,0.6125359,0.0006711454,0.00023376325,0.0005480947,0.000059108002,0.00035018282,0.0002699191],"genre_scores_gemma":[0.99393046,5.969264e-7,0.0054366835,0.00027147692,0.00006455204,0.00013563731,0.000009076668,0.00003508045,0.00011644272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926597,0.000026847272,0.00024862273,0.00014190323,0.00016377626,0.00015285856],"domain_scores_gemma":[0.99975795,0.000040573526,0.00007017596,0.00007114349,0.000026417838,0.000033769116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017173865,0.00011738073,0.00019630311,0.00009085933,0.0001281726,0.00004600887,0.00006177889,0.000031644595,0.00001928027],"category_scores_gemma":[0.000005693484,0.00012163894,0.00005323782,0.0000990949,0.00003503883,0.00022164262,0.000010546776,0.000109714885,0.000004212879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043699896,0.000007746909,9.887876e-7,0.00015790404,0.000023487439,0.0000013267645,0.0002522751,0.67903024,0.3096494,0.000002554614,0.0010121586,0.009818239],"study_design_scores_gemma":[0.00036635442,0.00007877631,0.0000014624293,0.00003140306,0.000018158362,0.000024022791,0.000032486692,0.98764855,0.0108107105,0.00015879348,0.000693242,0.00013605278],"about_ca_topic_score_codex":0.0000043535542,"about_ca_topic_score_gemma":2.534732e-7,"teacher_disagreement_score":0.6088822,"about_ca_system_score_codex":0.000045699406,"about_ca_system_score_gemma":0.000014364422,"threshold_uncertainty_score":0.4960292},"labels":[],"label_agreement":null},{"id":"W4213366994","doi":"10.1109/lsp.2022.3150258","title":"CNN-RNN and Data Augmentation Using Deep Convolutional Generative Adversarial Network for Environmental Sound Classification","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Music and Audio Processing","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Kids Brain Health Network","keywords":"Computer science; Artificial intelligence; Deep learning; Convolutional neural network; Recurrent neural network; Normalization (sociology); Transfer of learning; Feature extraction; Pattern recognition (psychology); Generative adversarial network; Feature (linguistics); Feature learning; Machine learning; Spectrogram; Generative grammar; Artificial neural network","score_opus":0.07475645323796545,"score_gpt":0.28630029939790425,"score_spread":0.2115438461599388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213366994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06995725,0.0003278333,0.92754954,0.0013788992,0.00044165057,0.00024199653,0.000037544563,0.00004877119,0.000016498036],"genre_scores_gemma":[0.8919743,0.0000016980281,0.10255973,0.0044003553,0.00077181566,0.000045364748,0.00021230865,0.000016385406,0.000018044582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827623,0.00010388209,0.0002654631,0.0006699229,0.00037844313,0.00030607052],"domain_scores_gemma":[0.99933046,0.000078651414,0.00028076366,0.00022860258,0.000019340925,0.000062197774],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000492412,0.00016272055,0.00013984063,0.000062405226,0.0016283897,0.00031808674,0.00057014346,0.000033530465,0.000023333438],"category_scores_gemma":[0.0000056755102,0.00018205188,0.000029877465,0.00017972774,0.00014036206,0.001200603,0.0002717354,0.00013186534,0.0000012967117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017914806,0.00014236044,0.0013434774,0.000112891306,0.00009693112,0.000012312648,0.0029301252,0.37392348,0.44608566,0.00081314496,0.009769082,0.16459139],"study_design_scores_gemma":[0.00065859006,0.000038202354,0.00032269498,0.000014236052,0.00003354566,0.000025417148,0.00017030086,0.9958134,0.0004506659,0.0012379744,0.0009981397,0.00023679418],"about_ca_topic_score_codex":0.0000052957944,"about_ca_topic_score_gemma":0.0000012328181,"teacher_disagreement_score":0.8249898,"about_ca_system_score_codex":0.00021336407,"about_ca_system_score_gemma":0.00012905986,"threshold_uncertainty_score":0.99967134},"labels":[],"label_agreement":null},{"id":"W4226453938","doi":"10.1109/lsp.2022.3164328","title":"A Low-Complexity Modified ThiNet Algorithm for Pruning Convolutional Neural Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pruning; Convolutional neural network; Computer science; Algorithm; Reduction (mathematics); Layer (electronics); Computational complexity theory; Norm (philosophy); Time complexity; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.036402694225251206,"score_gpt":0.26769570597848535,"score_spread":0.23129301175323413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226453938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045229727,0.00013301331,0.9897553,0.004278887,0.0003703493,0.00050330284,0.000020895754,0.00038819137,0.000027140171],"genre_scores_gemma":[0.8227643,5.1101046e-7,0.16795908,0.008172404,0.00045932404,0.0005343006,0.00004086579,0.00002976493,0.00003947296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786156,0.00009470517,0.00033676202,0.0006693218,0.00044848458,0.0005891562],"domain_scores_gemma":[0.9990471,0.00018861296,0.0002527892,0.00031030734,0.00008707196,0.000114107206],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00028692448,0.00023345288,0.00020931909,0.00009965121,0.0015046194,0.00018600484,0.0011448788,0.000036172314,0.000011106039],"category_scores_gemma":[0.0000051314137,0.00025694593,0.00010458225,0.0006701214,0.00016107698,0.0005855094,0.00025719276,0.00047843324,0.0000018747058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014600232,0.000052662217,0.0000065158624,0.000016347463,0.0000073057768,0.00000794067,0.0001281966,0.85309696,0.0046562687,0.0014257247,0.0024060663,0.13818142],"study_design_scores_gemma":[0.00044921186,0.000053577194,0.000051408362,0.000009464889,0.000008645298,0.00004607898,0.000010700458,0.9941445,0.0003024421,0.004072916,0.0005511861,0.00029987405],"about_ca_topic_score_codex":0.000006147031,"about_ca_topic_score_gemma":7.774498e-7,"teacher_disagreement_score":0.8217962,"about_ca_system_score_codex":0.00015743866,"about_ca_system_score_gemma":0.00007332747,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W4241047385","doi":"10.1109/lsp.2017.2755418","title":"IEEE Signal Processing Society Editorial Board","year":2017,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Rey Juan Carlos; Universidade Estadual de Campinas; Yonsei University; Institut national de recherche en informatique et en automatique (INRIA); McGill University; RWTH Aachen University; Johns Hopkins University; École Polytechnique Fédérale de Lausanne; University of Maryland, Baltimore County","keywords":"Signal processing; Computer science; Multidimensional signal processing; Telecommunications; Digital signal processing; Computer hardware","score_opus":0.031050193691480252,"score_gpt":0.26163352691553576,"score_spread":0.2305833332240555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241047385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074994594,0.00027581502,0.88620335,0.008992706,0.027045848,0.00045339874,0.0000030394062,0.0013136455,0.0007175927],"genre_scores_gemma":[0.96900123,0.0000024746514,0.0070546377,0.0019939954,0.021748554,0.000040344556,0.0000010401403,0.00003903626,0.000118707125],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99651474,0.00007974905,0.00048032074,0.0009373772,0.0011489571,0.0008388305],"domain_scores_gemma":[0.9979903,0.000048285034,0.0006995738,0.00082202174,0.00027541077,0.00016438472],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009359531,0.00041050086,0.00040502017,0.00011738888,0.0023146626,0.0015748113,0.0026512926,0.0003791957,0.0000065131385],"category_scores_gemma":[0.000027759581,0.00038788264,0.00022597692,0.00021314666,0.0004901092,0.0020106256,0.00006853275,0.00074389257,0.00006789522],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028060615,0.00007253552,0.0007031193,0.00019832524,0.000051386516,0.00004168662,0.0009835638,0.00022165957,0.78287005,0.000029766868,0.13066831,0.08413154],"study_design_scores_gemma":[0.00474763,0.00036287887,0.001495251,0.0019268781,0.00019058397,0.00015956741,0.0002702414,0.10317205,0.81853896,0.0016441651,0.06431174,0.0031800722],"about_ca_topic_score_codex":0.000042134634,"about_ca_topic_score_gemma":0.0000038417866,"teacher_disagreement_score":0.8940066,"about_ca_system_score_codex":0.00014728344,"about_ca_system_score_gemma":0.00027715118,"threshold_uncertainty_score":0.9998573},"labels":[],"label_agreement":null},{"id":"W4285304111","doi":"10.1109/lsp.2022.3179168","title":"Nonlinear Orthogonal NMF on the Stiefel Manifold With Graph-Based Total Variation Regularization","year":2022,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regularization (linguistics); Stiefel manifold; Mathematics; Algorithm; Nonlinear system; Orthogonality; Uniqueness; Computer science; Mathematical optimization; Artificial intelligence; Applied mathematics; Pattern recognition (psychology)","score_opus":0.011461955004172316,"score_gpt":0.1860767770625264,"score_spread":0.17461482205835407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285304111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4548151,0.00001672437,0.5408574,0.0031469413,0.00022861951,0.00028380132,0.000013659291,0.00037778818,0.00026001356],"genre_scores_gemma":[0.9942855,2.9723526e-7,0.003874439,0.0014248743,0.00019309856,0.000029921393,0.00007269543,0.000072721254,0.000046416717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985573,0.00009761007,0.0002259251,0.00028178454,0.0005933223,0.00024401525],"domain_scores_gemma":[0.9994715,0.000082804756,0.000118098964,0.00022317785,0.00006376918,0.00004068864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028005324,0.00020223521,0.000120070275,0.00016418275,0.00046638356,0.00015232353,0.00016558183,0.000041317257,0.000035459678],"category_scores_gemma":[0.000011223887,0.00016808958,0.000047573223,0.00053827866,0.000055391494,0.00017469883,0.00001045864,0.00039326717,0.000009324238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005502616,0.000039957282,0.000028670853,0.000041124353,0.00001974468,0.000013008364,0.00018270464,0.7028312,0.2933901,0.000058184767,0.00076885265,0.0025714207],"study_design_scores_gemma":[0.00037500955,0.00010607503,0.0013703612,0.00006344416,0.00003824423,0.000025509988,0.000045798333,0.9778388,0.019510353,0.00006967494,0.00027434403,0.00028236676],"about_ca_topic_score_codex":0.0000037537845,"about_ca_topic_score_gemma":9.594102e-7,"teacher_disagreement_score":0.53947043,"about_ca_system_score_codex":0.0001814518,"about_ca_system_score_gemma":0.000067754285,"threshold_uncertainty_score":0.68544936},"labels":[],"label_agreement":null},{"id":"W4320005477","doi":"10.1109/lsp.2023.3242808","title":"Off-Grid DOA Estimation for Noncircular Signals via Block Sparse Representation Using Extended Transformed Nested Array","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Block (permutation group theory); Computer science; Grid; Representation (politics); Algorithm; Interpolation (computer graphics); Direction of arrival; SIGNAL (programming language); Displacement (psychology); Computer vision; Mathematics; Antenna (radio); Telecommunications; Motion (physics)","score_opus":0.04545425219593095,"score_gpt":0.318474727682301,"score_spread":0.27302047548637004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320005477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10356185,0.00002551141,0.89363366,0.000707567,0.00030443745,0.00082533294,0.000005554581,0.0009091113,0.000026967158],"genre_scores_gemma":[0.80926627,0.0000026896926,0.19004439,0.00036233952,0.00011732288,0.00013717481,0.000025756459,0.00003575188,0.000008291124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762404,0.00010571556,0.00068607286,0.00057177234,0.00061605347,0.00039637592],"domain_scores_gemma":[0.9985764,0.00023010885,0.00046439553,0.00032044016,0.00031484518,0.00009378576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007000616,0.0002517246,0.00033705268,0.00053136615,0.0002914926,0.0002406878,0.00049123744,0.00010426236,0.000004608056],"category_scores_gemma":[0.00007969838,0.0002689648,0.00015778509,0.0015713007,0.00010410511,0.0015831261,0.000020457805,0.0001305121,0.000009499363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002146482,0.000037976577,0.000017659728,0.00027434554,0.000019362345,0.0000057258285,0.0006235242,0.1196228,0.7985046,0.000020151216,0.00023559757,0.08061678],"study_design_scores_gemma":[0.00024255257,0.00003475585,0.00010848975,0.0002953998,0.000025251187,0.000016624717,0.00001103097,0.5523139,0.44578502,0.00097154564,0.000013936642,0.00018146675],"about_ca_topic_score_codex":0.000029285586,"about_ca_topic_score_gemma":0.0000015413232,"teacher_disagreement_score":0.70570445,"about_ca_system_score_codex":0.000110841574,"about_ca_system_score_gemma":0.00018239129,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W4382119870","doi":"10.1109/lsp.2023.3289438","title":"Global Optimization of Long-Term Average Proportional Fair Throughput via Convex Reformulation","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Maximization; Term (time); Mathematics; Regular polygon; Mathematical optimization; Convex function; Convex optimization; Proportionally fair; Combinatorics; Throughput; Optimization problem; Discrete mathematics; Algorithm; Applied mathematics; Computer science","score_opus":0.010719856417022302,"score_gpt":0.23783938757357084,"score_spread":0.22711953115654854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382119870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12575322,0.000052856845,0.87285143,0.00010687519,0.00023515048,0.00021134161,0.000009202403,0.00065763114,0.00012227635],"genre_scores_gemma":[0.9888201,0.000022506985,0.010466386,0.00011460296,0.00022168875,0.000023174187,0.0002654093,0.000052214516,0.00001395838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986226,0.000021065825,0.00042986663,0.0002489244,0.0003716949,0.00030583414],"domain_scores_gemma":[0.9995131,0.000020459953,0.00017181455,0.00012831163,0.00011247844,0.000053865308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001140197,0.00020730584,0.00021505922,0.000118003634,0.00011040046,0.000040919072,0.00013111321,0.00010389,0.00003301858],"category_scores_gemma":[0.0000056373165,0.00021979427,0.000055849414,0.00087718986,0.000076708035,0.00068225333,0.000017659067,0.00011162017,0.000014338297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019278914,0.000012256389,0.0028107623,0.00023297535,0.00002247537,0.000013069394,0.00008858959,0.9720532,0.0084840795,0.000008485444,0.00023350395,0.01602137],"study_design_scores_gemma":[0.00031813007,0.000016801125,0.0049348967,0.00013928895,0.000016445938,0.000010298887,0.0000047853036,0.99070054,0.0035286718,0.00009191506,0.000005727607,0.0002324714],"about_ca_topic_score_codex":0.000002102975,"about_ca_topic_score_gemma":0.0000016309839,"teacher_disagreement_score":0.86306685,"about_ca_system_score_codex":0.00020542047,"about_ca_system_score_gemma":0.00003302475,"threshold_uncertainty_score":0.896295},"labels":[],"label_agreement":null},{"id":"W4384916830","doi":"10.1109/lsp.2023.3296913","title":"Effective Online Portfolio Selection for the Long-Short Market Using Mirror Gradient Descent","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Regret; Portfolio; Mathematical optimization; Computer science; Stochastic gradient descent; Gradient descent; Online algorithm; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.14173142515177545,"score_gpt":0.43425186841988433,"score_spread":0.2925204432681089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384916830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39208078,0.00009256342,0.605163,0.0009989428,0.00046022265,0.0010360219,0.000026746848,0.00013040882,0.000011336258],"genre_scores_gemma":[0.9938596,0.000007528801,0.003797202,0.0007512799,0.0005321826,0.00018219661,0.0000117213895,0.000060559538,0.0007977235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579287,0.00022716264,0.0005573338,0.0007771747,0.0018555486,0.0007899091],"domain_scores_gemma":[0.99666786,0.0021252197,0.00021211967,0.0002898875,0.00056022644,0.00014466858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003276737,0.00026408004,0.00031352878,0.0006471909,0.001142155,0.000625181,0.0007108415,0.00008054781,0.00007413707],"category_scores_gemma":[0.0006560532,0.00017318141,0.00019746266,0.0033058326,0.00023410852,0.00050677446,0.00008961453,0.00038077845,0.00002962152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005975925,0.0001756804,0.0046212957,0.00010077367,0.000120902216,0.000080857986,0.00069946324,0.07633201,0.07930995,0.0000010547162,0.039101627,0.7988588],"study_design_scores_gemma":[0.00051956065,0.00014132338,0.022434518,0.00010898524,0.00005363048,0.000057658584,0.00049283414,0.95820296,0.014826722,0.00075198454,0.0020617128,0.0003480865],"about_ca_topic_score_codex":0.000037432023,"about_ca_topic_score_gemma":0.00007240757,"teacher_disagreement_score":0.881871,"about_ca_system_score_codex":0.00029872477,"about_ca_system_score_gemma":0.00014447057,"threshold_uncertainty_score":0.8784649},"labels":[],"label_agreement":null},{"id":"W4385223333","doi":"10.1109/lsp.2023.3298282","title":"Bounded Projection Matrix Approximation With Applications to Community Detection","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Relaxation (psychology); Convergence (economics); Dykstra's projection algorithm; Mathematical optimization; Constraint (computer-aided design); Approximation algorithm; Projection (relational algebra); Symmetric matrix; Mathematics; Matrix (chemical analysis); Matrix decomposition; Differentiable function; Algorithm; Computer science; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.025277830251501224,"score_gpt":0.2632764646525136,"score_spread":0.23799863440101238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385223333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36686993,0.000005849844,0.63024306,0.00011603826,0.0000383955,0.00032864633,0.0000012115761,0.0022110029,0.00018586141],"genre_scores_gemma":[0.99382573,0.0000014856658,0.005493817,0.0001988114,0.00012303558,0.00028364145,0.0000129660175,0.000043813383,0.000016694656],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992966,0.00004195387,0.00014257111,0.0001403168,0.00017107533,0.00020747968],"domain_scores_gemma":[0.99965316,0.000026475942,0.000039774568,0.0001745642,0.00006127183,0.000044776792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015618805,0.00013891305,0.0001060096,0.0002587999,0.00037714388,0.0001340736,0.000121123725,0.00005207378,0.0000013501111],"category_scores_gemma":[0.00000276447,0.00013652335,0.00002369297,0.0008779515,0.00003437459,0.00025674776,0.000012674095,0.0002682133,0.00004220972],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020511117,0.0000144290125,0.00001342164,0.00010125707,0.000015488211,0.0000019059523,0.0005998834,0.04710478,0.87933224,0.0000074082395,0.0009621835,0.07182651],"study_design_scores_gemma":[0.0002338984,0.00012020862,0.00050302176,0.0002226582,0.000037894228,0.000031738586,0.00032896333,0.25108525,0.7443336,0.0007305682,0.0019139874,0.00045815745],"about_ca_topic_score_codex":0.000045105346,"about_ca_topic_score_gemma":0.000022997383,"teacher_disagreement_score":0.6269558,"about_ca_system_score_codex":0.0000964861,"about_ca_system_score_gemma":0.000013023697,"threshold_uncertainty_score":0.55672604},"labels":[],"label_agreement":null},{"id":"W4385322990","doi":"10.1109/lsp.2023.3299531","title":"Deadline-Aware Coded Computation Across Homogeneous Workers","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Scheduling (production processes); Distributed computing; Matrix multiplication; Computation; Task (project management); Homogeneous; Task analysis; Greedy algorithm; Parallel computing; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.024702789652454128,"score_gpt":0.2870562913998942,"score_spread":0.26235350174744004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385322990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20262547,0.00006768809,0.79388195,0.0020254164,0.00047232944,0.00013331405,0.000018985846,0.0007323583,0.000042465042],"genre_scores_gemma":[0.99551755,0.00000132338,0.0025660477,0.0015013977,0.00021770335,0.00002753566,0.00003298612,0.000023677294,0.00011174868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979284,0.00006434139,0.00035987192,0.00055012695,0.00048304058,0.00061423116],"domain_scores_gemma":[0.9992532,0.00007127076,0.00018404477,0.00023789637,0.00013083954,0.00012272705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036942674,0.00022174309,0.0002348818,0.00009601701,0.0004518898,0.0006410052,0.0006965165,0.000082218656,0.0000019158213],"category_scores_gemma":[0.000007188461,0.00021692198,0.00008790947,0.0012917506,0.00008444044,0.0005166873,0.00007830192,0.00018908374,0.00020537437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040822033,0.00008961198,0.001985066,0.0003852856,0.000070395625,0.0008698949,0.0045558256,0.36826873,0.08005652,0.000047143392,0.07552073,0.46810997],"study_design_scores_gemma":[0.00057872874,0.000035056033,0.001584954,0.00026105726,0.0000070028586,0.0000660145,0.00018409935,0.99157465,0.0029637462,0.0001353571,0.002129648,0.00047970068],"about_ca_topic_score_codex":0.000034926637,"about_ca_topic_score_gemma":0.000006106635,"teacher_disagreement_score":0.7928921,"about_ca_system_score_codex":0.000067081,"about_ca_system_score_gemma":0.00008177809,"threshold_uncertainty_score":0.88458216},"labels":[],"label_agreement":null},{"id":"W4385973788","doi":"10.1109/lsp.2023.3306619","title":"Dimensionality Reduction of Room Acoustic Impulse Responses and Applications to System Identification","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Dimensionality reduction; Impulse response; Computer science; Microphone; Impulse (physics); Signal processing; Curse of dimensionality; Reduction (mathematics); Finite impulse response; Acoustics; Dynamic mode decomposition; Speech recognition; Loudspeaker; Digital signal processing; Algorithm; Physics; Artificial intelligence; Mathematics","score_opus":0.02152141471839079,"score_gpt":0.27598023164084284,"score_spread":0.25445881692245204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385973788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38938093,0.00006959249,0.60840684,0.0016060388,0.00009903293,0.00017021412,0.0000033303334,0.00025129964,0.000012721282],"genre_scores_gemma":[0.9922511,0.000001805439,0.0072762147,0.00020716593,0.0001301407,0.00006702435,0.0000037279829,0.00001100097,0.00005180756],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986366,0.000061795574,0.00032465823,0.00043164773,0.00032926077,0.00021606308],"domain_scores_gemma":[0.9992441,0.000076406395,0.0001942789,0.00024758422,0.00014562199,0.0000920401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005751395,0.00011594856,0.00014439388,0.0002728952,0.0003280628,0.00019976156,0.00030236423,0.000039343933,5.7422193e-7],"category_scores_gemma":[0.000024367135,0.00011490871,0.000029585211,0.0011391328,0.000059035505,0.0004705852,0.00006659519,0.00008296549,0.000026325513],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014578573,0.000012256465,0.000057284422,0.00024888213,0.000005314968,0.0000032346995,0.00027751547,0.0027628767,0.93163854,0.00004285901,0.00043986514,0.06449679],"study_design_scores_gemma":[0.00025221234,0.000047083016,0.0068423515,0.0004642682,0.0000352025,0.00009806056,0.00040453934,0.031411305,0.9591773,0.0007352516,0.00017210892,0.00036031837],"about_ca_topic_score_codex":0.0000075316366,"about_ca_topic_score_gemma":4.4724476e-7,"teacher_disagreement_score":0.60287017,"about_ca_system_score_codex":0.00005701424,"about_ca_system_score_gemma":0.00008194732,"threshold_uncertainty_score":0.46858412},"labels":[],"label_agreement":null},{"id":"W4386609311","doi":"10.1109/lsp.2023.3313515","title":"Rhythm Modeling for Voice Conversion","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Speech recognition; Rhythm; Computer science; Prosody; Speech processing; Artificial intelligence; Pattern recognition (psychology); Acoustics","score_opus":0.04954250797524673,"score_gpt":0.2673340634600034,"score_spread":0.21779155548475665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386609311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059802987,0.00001922065,0.933506,0.005571658,0.00030181927,0.00012547825,0.000002413588,0.0005231567,0.00014725782],"genre_scores_gemma":[0.9466329,0.0000038500225,0.046900712,0.0060219304,0.0002461676,0.00004084858,0.0000052163136,0.000020294288,0.0001280593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889284,0.000026267544,0.00017073672,0.00034554597,0.00024811813,0.00031648384],"domain_scores_gemma":[0.99951434,0.00012641044,0.00006119779,0.00013836639,0.000087292094,0.000072408606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031721743,0.000117991694,0.00012208869,0.00017936624,0.00026917146,0.00022130148,0.0003369691,0.000046871486,0.000008134726],"category_scores_gemma":[0.000021638889,0.000114774055,0.00008121091,0.00044575168,0.000026038015,0.00050139305,0.000035129942,0.00008460719,0.00024869211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036025285,0.000038359005,0.000022872768,0.00030387397,0.000030791423,0.00008219927,0.0010468714,0.015533942,0.1917007,0.00011119472,0.027513577,0.7635796],"study_design_scores_gemma":[0.0002358388,0.000014649532,0.0000060990737,0.00006697581,0.000006470396,0.000014257766,0.00003644538,0.973832,0.023712704,0.00056865107,0.0013352676,0.00017063643],"about_ca_topic_score_codex":0.0000046183386,"about_ca_topic_score_gemma":3.4585534e-7,"teacher_disagreement_score":0.9582981,"about_ca_system_score_codex":0.00003113027,"about_ca_system_score_gemma":0.00004622604,"threshold_uncertainty_score":0.468035},"labels":[],"label_agreement":null},{"id":"W4387805473","doi":"10.1109/lsp.2023.3326387","title":"DPAN: A Deep Light-Weight Attention-Based Image Super Resolution Network Using Multi-Dimensional Filter Design Technique","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Feature (linguistics); Residual; Block (permutation group theory); Filter (signal processing); Computer vision; Feature extraction; Image resolution; Pattern recognition (psychology); Filter bank; Algorithm; Mathematics","score_opus":0.03529100183999435,"score_gpt":0.2791157664602518,"score_spread":0.24382476462025748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387805473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018070797,0.00019868158,0.99192065,0.0023359803,0.00026075522,0.0006613697,0.0000026756582,0.0028001175,0.000012681226],"genre_scores_gemma":[0.07033981,0.0000020259838,0.9260767,0.0028838909,0.00032196337,0.0002272623,0.00001474154,0.00009465789,0.000038955503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604434,0.00031814305,0.0006297962,0.0011328247,0.0007697353,0.0011051904],"domain_scores_gemma":[0.99834526,0.00020238987,0.00035382403,0.0005939818,0.0003553412,0.00014921119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011324353,0.000516208,0.00038791884,0.00058656285,0.0009482044,0.00058895483,0.0011419144,0.00020438134,0.000010469497],"category_scores_gemma":[0.000054792603,0.0005085297,0.0001729041,0.0022301623,0.000245312,0.0021515426,0.00023058307,0.0005376851,0.00005696283],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035466648,0.00006953947,0.00006667102,0.00010854359,0.000014615678,0.00016784482,0.00013025638,0.031232564,0.9596681,0.000011406603,0.005138977,0.0033560016],"study_design_scores_gemma":[0.00040037723,0.000050564337,0.000066665445,0.0005701987,0.000023400551,0.00005404676,0.0000038466023,0.8618291,0.13500454,0.001114281,0.0002802587,0.00060269533],"about_ca_topic_score_codex":0.000013989784,"about_ca_topic_score_gemma":0.0000011145988,"teacher_disagreement_score":0.83059657,"about_ca_system_score_codex":0.00027066088,"about_ca_system_score_gemma":0.00033455985,"threshold_uncertainty_score":0.9997366},"labels":[],"label_agreement":null},{"id":"W4389473849","doi":"10.1109/lsp.2023.3341001","title":"Population Monte Carlo With Normalizing Flow","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Huawei Technologies (Canada)","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Monte Carlo method; Algorithm; Mathematical optimization; Sampling (signal processing); Importance sampling; Inference; Rejection sampling; Population; Markov chain; Hybrid Monte Carlo; Mathematics; Machine learning; Artificial intelligence; Statistics; Bayesian probability","score_opus":0.01798211009639149,"score_gpt":0.2484016818867318,"score_spread":0.2304195717903403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389473849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060805548,0.00005204593,0.9360762,0.0022287574,0.0001613924,0.00008874608,8.3454074e-7,0.00044176567,0.0001446709],"genre_scores_gemma":[0.68443453,0.000001172722,0.31355292,0.0017858347,0.0001427217,0.000011042008,0.0000016312084,0.000016788315,0.000053386866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864197,0.00007329164,0.00017703691,0.0003922183,0.000342085,0.00037340968],"domain_scores_gemma":[0.9995165,0.000036863985,0.00009404524,0.0002219801,0.00004790289,0.00008274888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037936645,0.00016293317,0.00016354785,0.0001671076,0.00024296589,0.00029158918,0.00039668576,0.00004783315,0.0000016681618],"category_scores_gemma":[0.000004396778,0.00013298214,0.000044234363,0.00076615403,0.00003093443,0.00081520726,0.000041952033,0.00016574573,0.000017532117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025439005,0.000020515006,0.0010981754,0.00014984286,0.000027825134,0.00021118521,0.0025768292,0.049276955,0.041516192,0.00050452974,0.0045622215,0.9000303],"study_design_scores_gemma":[0.00028438462,0.000041944342,0.001955631,0.00016101243,0.000013004502,0.00003523935,0.0000085878155,0.99271727,0.0028301796,0.0013226139,0.00028616862,0.00034398213],"about_ca_topic_score_codex":0.00006193057,"about_ca_topic_score_gemma":0.0000061109586,"teacher_disagreement_score":0.9434403,"about_ca_system_score_codex":0.00003484245,"about_ca_system_score_gemma":0.000037253638,"threshold_uncertainty_score":0.54228544},"labels":[],"label_agreement":null},{"id":"W4391547749","doi":"10.1109/lsp.2024.3362189","title":"Distributed Multi-Sensor Control for Multi-Target Tracking With a Sparsity-Promoting Objective Function","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Guidance and Control Systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Aeronautical Science Foundation of China; China Scholarship Council","keywords":"Computer science; Function (biology); Tracking (education); Wireless sensor network; Control (management); Artificial intelligence; Computer network","score_opus":0.019667890643759463,"score_gpt":0.22993317530850768,"score_spread":0.21026528466474823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391547749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105927594,0.0010080267,0.8908713,0.00020041481,0.0004587371,0.0006075572,0.000074006595,0.00084283797,0.000009549291],"genre_scores_gemma":[0.99545527,7.873807e-7,0.0034083652,0.0002705503,0.00052974885,0.00019348218,0.00002614987,0.00009557665,0.000020099682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852765,0.00002864779,0.00031285803,0.00041051154,0.00020897949,0.0005113363],"domain_scores_gemma":[0.99954134,0.00009519546,0.00006875781,0.00010545881,0.00010700702,0.00008221943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002617266,0.0003093353,0.00033047266,0.0001229424,0.00022024184,0.00035030788,0.000119219316,0.000096029486,0.0000035640032],"category_scores_gemma":[0.000015177929,0.0002714101,0.00011796962,0.00027276512,0.00004556366,0.00046813214,0.000004307704,0.0002915211,0.000014018377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019277917,0.000049062186,0.0009959758,0.0014946196,0.0004083155,0.000074754855,0.001496834,0.20449704,0.77113056,0.0000033987099,0.00040992853,0.019246724],"study_design_scores_gemma":[0.002034061,0.00008786212,0.00080193474,0.0007832741,0.000154216,0.000023932482,0.00021126945,0.9807124,0.014249822,0.000008702951,0.0005348742,0.00039763798],"about_ca_topic_score_codex":0.00001556093,"about_ca_topic_score_gemma":0.0000133785525,"teacher_disagreement_score":0.8895276,"about_ca_system_score_codex":0.00015866042,"about_ca_system_score_gemma":0.000040774143,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W4396941596","doi":"10.1109/lsp.2024.3401612","title":"Palette-Based Color Harmonization via Color Naming","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"European Regional Development Fund; Agencia Estatal de Investigación; Canada First Research Excellence Fund; Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; European Commission; National Natural Science Foundation of China; Natural Science Basic Research Program of Shaanxi Province; Centres de Recerca de Catalunya","keywords":"Palette (painting); Computer science; Artificial intelligence; Computer vision; Harmonization; Computer graphics (images); Dither; Art; Noise shaping; Aesthetics","score_opus":0.016106683512057275,"score_gpt":0.2493979203937832,"score_spread":0.23329123688172593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396941596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006519734,0.00029638974,0.9778301,0.01335898,0.00028426028,0.0001872666,0.0000016238896,0.0013839656,0.00013765499],"genre_scores_gemma":[0.957829,0.0000025099985,0.034873664,0.006928896,0.00018057729,0.00004880241,0.0000067924575,0.000025233765,0.00010452666],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984509,0.00006341197,0.0002772328,0.0005046337,0.0004006999,0.0003031592],"domain_scores_gemma":[0.9994158,0.0000969923,0.000095511365,0.00020486502,0.0001139497,0.0000728788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032141732,0.00018773109,0.00014370431,0.00021168191,0.00024342572,0.0009322673,0.0005483765,0.0000778704,0.000013251498],"category_scores_gemma":[0.000012565935,0.00017168465,0.000074453805,0.00093804806,0.000103157916,0.0008308854,0.000032824413,0.00022297117,0.00007698345],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063796906,0.00002331911,0.00001635369,0.00016758555,0.00000776083,0.00005334339,0.00017088705,0.00014699386,0.83774555,0.00022014602,0.0022011553,0.15924053],"study_design_scores_gemma":[0.000080995385,0.000036475776,0.000048200578,0.00015294756,0.000010062231,0.000009970347,0.0000036163283,0.54818267,0.44743028,0.00018539428,0.003663303,0.0001961027],"about_ca_topic_score_codex":0.000004377719,"about_ca_topic_score_gemma":3.7792995e-7,"teacher_disagreement_score":0.95130926,"about_ca_system_score_codex":0.00012828056,"about_ca_system_score_gemma":0.00016456249,"threshold_uncertainty_score":0.89898753},"labels":[],"label_agreement":null},{"id":"W4399311019","doi":"10.1109/lsp.2024.3408676","title":"Multi-Level Information Aggregation Based Graph Attention Networks Towards Fake Speech Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Computer science; Graph; Attention network; Voice activity detection; Graph theory; Speech recognition; Artificial intelligence; Theoretical computer science; Speech processing; Mathematics","score_opus":0.020140919160847304,"score_gpt":0.2324139981366507,"score_spread":0.2122730789758034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399311019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04465783,0.000067136985,0.9504967,0.000919288,0.0025983783,0.00025505683,0.0000035634696,0.000918649,0.00008342087],"genre_scores_gemma":[0.9741941,0.0000019343538,0.024140595,0.0012820198,0.00027877977,0.00003175012,0.000025213958,0.000021217993,0.000024369247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981636,0.00005527804,0.0004149878,0.00041065252,0.0005950122,0.00036049171],"domain_scores_gemma":[0.9993054,0.000045373516,0.00017043385,0.00021690744,0.00016437228,0.00009746081],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043533504,0.00024396925,0.00014655797,0.000576488,0.00020733754,0.0016977594,0.00032789988,0.00012939167,0.0000031705065],"category_scores_gemma":[0.000030551953,0.00024024803,0.00012764054,0.0013000217,0.00007887605,0.005744523,0.00003437028,0.00032123973,0.00008184426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001004861,0.000019892108,0.000009034089,0.00012253615,0.000012325392,0.000013842067,0.00018195866,0.010202508,0.026201826,0.000013137104,0.00027031032,0.9629426],"study_design_scores_gemma":[0.00030751782,0.00006843111,0.0010815714,0.0003388874,0.000018991142,0.00004585531,0.000014270983,0.9586152,0.038466968,0.00018081485,0.0005688948,0.00029258637],"about_ca_topic_score_codex":0.000028566968,"about_ca_topic_score_gemma":0.000014052445,"teacher_disagreement_score":0.96265,"about_ca_system_score_codex":0.00020362374,"about_ca_system_score_gemma":0.00010040616,"threshold_uncertainty_score":0.99933857},"labels":[],"label_agreement":null},{"id":"W4399346132","doi":"10.1109/lsp.2024.3409188","title":"Using Maximum Weighted Likelihood to Derive Lehmer and Hölder Families of Means","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Maximum likelihood; Mathematics; Computer science; Maximum likelihood sequence estimation; Algorithm; Pattern recognition (psychology); Statistics; Artificial intelligence","score_opus":0.0894265735484612,"score_gpt":0.38724993797452417,"score_spread":0.29782336442606294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399346132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12895954,0.00029532495,0.86942595,0.0008209682,0.000109149674,0.00015363401,0.000019295165,0.000076747,0.00013940388],"genre_scores_gemma":[0.4197519,0.0000035673945,0.579377,0.00071814324,0.00008607788,0.000007364397,6.0773255e-7,0.00003687689,0.00001849111],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987434,0.000056682595,0.0003150993,0.0003413245,0.00024167896,0.00030182567],"domain_scores_gemma":[0.99926895,0.00037927972,0.00006320334,0.000105814564,0.00007232756,0.00011040572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022660814,0.00019445577,0.00029787462,0.00014180831,0.000094687304,0.00007259011,0.00008951538,0.00005733083,0.000014452712],"category_scores_gemma":[0.00005717412,0.00016315728,0.000048850387,0.00023731527,0.00013140484,0.00018394846,0.000032842712,0.00016755276,0.0000025138327],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043421616,0.00004301632,0.000011781228,0.001558079,0.000071400595,0.00005828859,0.003647394,0.0004733882,0.78003633,0.0028773134,0.0009177785,0.21026179],"study_design_scores_gemma":[0.00040182413,0.00012349014,0.000015405478,0.0019884286,0.00029289484,0.000045739784,0.0006276852,0.14077856,0.08431825,0.77002,0.00073147187,0.0006562759],"about_ca_topic_score_codex":0.00001172373,"about_ca_topic_score_gemma":0.000002215426,"teacher_disagreement_score":0.76714265,"about_ca_system_score_codex":0.000034883895,"about_ca_system_score_gemma":0.000051265637,"threshold_uncertainty_score":0.6653361},"labels":[],"label_agreement":null},{"id":"W4400275345","doi":"10.1109/lsp.2024.3422789","title":"A Closed-Form DOA Estimator Using Spherical Microphone Arrays in the Presence of Interference","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Interference (communication); Estimator; Computer science; Microphone array; Microphone; Speech recognition; Algorithm; Acoustics; Mathematics; Telecommunications; Statistics; Physics","score_opus":0.024995788870860434,"score_gpt":0.2704060608574142,"score_spread":0.24541027198655377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400275345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25361478,0.0006740835,0.7434533,0.0017584551,0.00022772008,0.00010506151,0.000001030013,0.00009034215,0.00007519199],"genre_scores_gemma":[0.82646483,0.000003040837,0.17231157,0.0010643677,0.00012501609,0.00000902643,3.946023e-7,0.000014909001,0.00000682309],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808526,0.00007555583,0.00041778182,0.00051652273,0.00045510766,0.00044979114],"domain_scores_gemma":[0.999278,0.00018887286,0.0001327529,0.00028386322,0.000055449877,0.000061068415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004852263,0.00022602353,0.00024158324,0.00015697554,0.00014820514,0.0007109107,0.0013130134,0.00006265772,0.0000075147436],"category_scores_gemma":[0.000029391807,0.00016257836,0.000081359285,0.0012899261,0.0002240593,0.000987297,0.00009912059,0.00043067778,0.000012152742],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012168302,0.00005343906,0.00011646701,0.00036331924,0.0000086904965,0.00016719077,0.003588854,0.0023080928,0.9238302,0.000018195942,0.00041069905,0.06912265],"study_design_scores_gemma":[0.00022115553,0.00006870537,0.00013482115,0.0019357728,0.000016546766,0.0001848321,0.00020608306,0.3168429,0.67838305,0.0014975694,0.00014548941,0.00036302343],"about_ca_topic_score_codex":0.00004306079,"about_ca_topic_score_gemma":0.0000027215988,"teacher_disagreement_score":0.57285005,"about_ca_system_score_codex":0.00007449528,"about_ca_system_score_gemma":0.0002775793,"threshold_uncertainty_score":0.68553287},"labels":[],"label_agreement":null},{"id":"W4401325927","doi":"10.1109/lsp.2024.3438089","title":"Cross-Terms and Spectral Leakage Minimization in Time-Frequency Distribution","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Leakage (economics); Minification; Computer science; Time–frequency analysis; Spectral leakage; Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.00886271731325808,"score_gpt":0.2457083375972374,"score_spread":0.23684562028397932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401325927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48676488,0.00058016484,0.5100728,0.0019344101,0.00015715863,0.00007682876,0.0000039939364,0.00025535212,0.00015439278],"genre_scores_gemma":[0.98978406,0.000006185785,0.009187602,0.0006981463,0.0001965273,0.000008274319,0.000015367388,0.000015958318,0.00008788278],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985311,0.000033762768,0.00026086695,0.00052022206,0.00028992194,0.00036414742],"domain_scores_gemma":[0.99967426,0.00004207934,0.000060507467,0.00012297966,0.00002688999,0.000073261566],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002666447,0.00017482555,0.00014108689,0.00014724146,0.00016257807,0.0018761414,0.00036301807,0.000067772824,0.000014255836],"category_scores_gemma":[0.000013949853,0.00016529139,0.00003647934,0.0006419134,0.00011854863,0.0017741445,0.000045033554,0.00022636678,0.000034238124],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015631305,0.000055436933,0.010566848,0.0005080704,0.000013727557,0.0004975454,0.0012639201,0.0010483238,0.68727213,0.00015352257,0.0012387099,0.2973661],"study_design_scores_gemma":[0.0012140414,0.00015937953,0.026104674,0.0023064604,0.000032518914,0.00042278165,0.000019637124,0.39673677,0.56147164,0.009246837,0.0008229281,0.0014623092],"about_ca_topic_score_codex":0.0000077451305,"about_ca_topic_score_gemma":0.0000013933553,"teacher_disagreement_score":0.50301915,"about_ca_system_score_codex":0.000104963496,"about_ca_system_score_gemma":0.00008059236,"threshold_uncertainty_score":0.99916},"labels":[],"label_agreement":null},{"id":"W4402673192","doi":"10.1109/lsp.2024.3465894","title":"On the Design of Robust Differential Beamformers From the Beampattern Error Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Control Systems and Identification","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Perspective (graphical); Differential (mechanical device); Computer science; Speech recognition; Robustness (evolution); Algorithm; Mathematics; Control theory (sociology); Artificial intelligence; Engineering","score_opus":0.02543186294234063,"score_gpt":0.22056232214651714,"score_spread":0.19513045920417652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402673192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34813616,0.00067111896,0.646681,0.0033147223,0.0006730036,0.00028394003,0.000020720885,0.00013671129,0.00008264799],"genre_scores_gemma":[0.99913955,0.0000031600998,0.000044771867,0.00029522442,0.00041084454,0.000039679682,0.0000040094055,0.000033911976,0.000028836033],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911815,0.000058583464,0.00020980425,0.00019392441,0.0002491546,0.00017040901],"domain_scores_gemma":[0.99942833,0.0003108277,0.000045147273,0.00015649265,0.000036367193,0.000022862583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017852422,0.00015209417,0.00013407417,0.000050979048,0.0001264094,0.00024477477,0.00022981629,0.000040401294,0.000063772284],"category_scores_gemma":[0.00001056265,0.00008736723,0.000083581224,0.00014808173,0.0000702998,0.00013941615,0.0000074456248,0.00023329684,0.000028154425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003482893,0.000018278486,0.000017365648,0.00010779054,0.00022050504,0.00000419,0.0062179263,0.25890592,0.70655066,0.00015214033,0.019658312,0.008112084],"study_design_scores_gemma":[0.00026970034,0.000040427556,0.0008740908,0.0008055365,0.0001533711,0.000003323443,0.0016708889,0.9765,0.018362392,0.0006834993,0.00032386792,0.00031291772],"about_ca_topic_score_codex":0.00018241293,"about_ca_topic_score_gemma":0.000009925305,"teacher_disagreement_score":0.7175941,"about_ca_system_score_codex":0.00009811921,"about_ca_system_score_gemma":0.000021603057,"threshold_uncertainty_score":0.35627323},"labels":[],"label_agreement":null},{"id":"W4404627646","doi":"10.1109/lsp.2024.3504374","title":"Quaternion Vector Quantized Variational Autoencoder","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Autoencoder; Vector quantization; Mathematics; Artificial intelligence; Computer science; Algorithm; Algebra over a field; Computer vision; Pure mathematics; Artificial neural network","score_opus":0.02606726353628276,"score_gpt":0.2893311814787559,"score_spread":0.26326391794247317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404627646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034846433,0.0005121028,0.9863328,0.0072769397,0.0013061436,0.00009217576,0.0000018577878,0.00069861975,0.0002947254],"genre_scores_gemma":[0.7195748,0.0000026420041,0.27505827,0.0042416556,0.00069374155,0.00001803739,0.0000047540784,0.000034322024,0.00037177873],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997947,0.00019705603,0.00031430568,0.00059389014,0.0005588021,0.00038897363],"domain_scores_gemma":[0.99932325,0.00021679299,0.00007099084,0.00022270915,0.00007745617,0.00008882681],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008312927,0.00021840876,0.00019181924,0.0002382492,0.00022843904,0.0014208141,0.00062200904,0.00007247947,0.0000412047],"category_scores_gemma":[0.000019835865,0.0001916423,0.00011609614,0.00060338393,0.00006322167,0.0012777844,0.00005398484,0.0002922491,0.00021469683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040431805,0.00005693279,0.000026725182,0.00027974197,0.00006415156,0.00042398353,0.0020885218,0.006512285,0.750772,0.0055168513,0.011951713,0.22226669],"study_design_scores_gemma":[0.00033867452,0.00003672221,0.00025874595,0.00022970753,0.000019155375,0.00007600391,0.0000038579656,0.977827,0.014193149,0.0033340051,0.0033472558,0.00033572793],"about_ca_topic_score_codex":0.000023356539,"about_ca_topic_score_gemma":4.614741e-7,"teacher_disagreement_score":0.9713147,"about_ca_system_score_codex":0.000080727834,"about_ca_system_score_gemma":0.00021357815,"threshold_uncertainty_score":0.9996158},"labels":[],"label_agreement":null},{"id":"W4405178880","doi":"10.1109/lsp.2024.3512377","title":"Noise-Robust Hearing Aid Voice Control","year":2024,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministerio de Ciencia e Innovación","keywords":"Speech recognition; Hearing aid; Computer science; Noise (video); Noise measurement; Background noise; Audiology; Noise reduction; Artificial intelligence; Telecommunications; Medicine","score_opus":0.020783622579834536,"score_gpt":0.2405038727380894,"score_spread":0.21972025015825486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405178880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03149406,0.0019414817,0.953025,0.01083725,0.000752247,0.00012113049,0.0000018112974,0.001066806,0.0007602246],"genre_scores_gemma":[0.9568856,0.0000035407932,0.032399606,0.009744209,0.0007661132,0.000018748638,0.0000010915165,0.000040492585,0.00014062387],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976662,0.000051451207,0.0003336987,0.0007677581,0.00051890226,0.00066202576],"domain_scores_gemma":[0.9992745,0.00012369448,0.0000873214,0.00027362868,0.00007283914,0.00016804066],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043195015,0.00028953317,0.0002490371,0.00025006576,0.00037363337,0.0021205593,0.00086006674,0.00008087601,0.0000144785845],"category_scores_gemma":[0.000015903066,0.00026496698,0.00011965146,0.00080847857,0.00010379055,0.0018539099,0.00006715138,0.0004601389,0.00025471768],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015222745,0.000033794284,0.00021259382,0.0004918757,0.00004616608,0.0004132358,0.0007997998,0.009761079,0.68883896,0.000075876604,0.0070959427,0.29221547],"study_design_scores_gemma":[0.0012777959,0.000112884474,0.00033971132,0.0021273051,0.00008148425,0.0004183133,0.0000508662,0.6067241,0.370994,0.001859463,0.014588573,0.0014255052],"about_ca_topic_score_codex":0.0000127309295,"about_ca_topic_score_gemma":0.0000012842006,"teacher_disagreement_score":0.9253915,"about_ca_system_score_codex":0.00010084811,"about_ca_system_score_gemma":0.00022241785,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4407268455","doi":"10.1109/lsp.2025.3539908","title":"Deep Unrolled Graph Laplacian Regularization for Robust Time-of-Flight Depth Denoising","year":2025,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shanghai Rising-Star Program; National Natural Science Foundation of China","keywords":"Regularization (linguistics); Noise reduction; Laplacian matrix; Laplace operator; Artificial intelligence; Computer science; Image denoising; Graph; Algorithm; Mathematics; Theoretical computer science; Mathematical analysis","score_opus":0.009894748165495307,"score_gpt":0.24054630816262212,"score_spread":0.23065155999712683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407268455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042152606,0.000059922924,0.9553167,0.0011793417,0.000078757366,0.0002629112,0.000003061746,0.0001567376,0.0007899238],"genre_scores_gemma":[0.8928597,2.8232685e-7,0.10649577,0.00033027507,0.000087654385,0.000018288005,0.000019963145,0.00002554835,0.00016253535],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893737,0.000022316914,0.00030035363,0.00030568958,0.0001308527,0.0003034411],"domain_scores_gemma":[0.9993753,0.00012269647,0.00018448988,0.00016914475,0.00011791926,0.000030449644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103007,0.00018627952,0.00026884844,0.00018109224,0.0002479668,0.00007526072,0.00020344948,0.00007289483,0.000008035457],"category_scores_gemma":[0.000020867257,0.0001791245,0.00010612468,0.0004893986,0.0001770567,0.00018567087,0.000030260491,0.00014632067,0.0000029909684],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024604693,0.00016080457,0.0032958472,0.00024618363,0.00021912731,0.00000346995,0.00023956539,0.15804574,0.54036665,0.0062730955,0.0015138083,0.2893897],"study_design_scores_gemma":[0.0022396094,0.000087557455,0.00035626374,0.0007891845,0.00026570112,0.0000012363039,0.00023566686,0.23686765,0.67243946,0.085497074,0.00048561537,0.00073500664],"about_ca_topic_score_codex":0.0000043622135,"about_ca_topic_score_gemma":9.971133e-7,"teacher_disagreement_score":0.85070705,"about_ca_system_score_codex":0.000035452245,"about_ca_system_score_gemma":0.00004457383,"threshold_uncertainty_score":0.7304485},"labels":[],"label_agreement":null},{"id":"W4408280461","doi":"10.1109/lsp.2025.3549699","title":"Power Transformed Density Ridge Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Ridge; Estimation; Computer science; Geology; Engineering; Paleontology","score_opus":0.004983895998184281,"score_gpt":0.21283465996534404,"score_spread":0.20785076396715976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408280461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48280555,0.00011818897,0.512779,0.00068365753,0.000579195,0.00013199891,0.000001839394,0.000515661,0.0023849006],"genre_scores_gemma":[0.9986116,8.3588213e-7,0.00017496964,0.0010579478,0.00004823625,0.000020495545,0.0000020237337,0.000015085778,0.00006876569],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993473,0.000016131893,0.00018964047,0.0001313991,0.00012851742,0.00018695768],"domain_scores_gemma":[0.99982643,0.00001917364,0.00001988857,0.00007489352,0.00002323603,0.00003637453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009881238,0.00012457164,0.00013621015,0.00011514423,0.00010689556,0.00008683426,0.00007943394,0.000060373954,0.0000140408165],"category_scores_gemma":[0.000004002166,0.00012504375,0.000052915657,0.00021888188,0.000025324829,0.00017620497,0.0000019522183,0.00014446798,0.000031385916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002993741,0.000012638192,0.00006522682,0.00030444766,0.000050035756,0.000008616599,0.0004366351,0.100530624,0.8103668,0.000014766675,0.0062070885,0.081973195],"study_design_scores_gemma":[0.000686659,0.000014168036,0.0006431862,0.00020641588,0.000028021697,0.000009597561,0.00006354493,0.8911358,0.10310256,0.000077201315,0.0037677335,0.0002651132],"about_ca_topic_score_codex":0.0000075821226,"about_ca_topic_score_gemma":0.000003848307,"teacher_disagreement_score":0.7906052,"about_ca_system_score_codex":0.00008014548,"about_ca_system_score_gemma":0.00001919205,"threshold_uncertainty_score":0.5099136},"labels":[],"label_agreement":null},{"id":"W4409426286","doi":"10.1109/lsp.2025.3560596","title":"MPPCAD: Minimum Power Pattern Constrained Adaptive Differential Beamforming","year":2025,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Adaptive beamformer; Computer science; Beamforming; Differential (mechanical device); Power (physics); Control theory (sociology); Mathematical optimization; Mathematics; Artificial intelligence; Telecommunications; Engineering; Physics","score_opus":0.009608227606586922,"score_gpt":0.23720435940746276,"score_spread":0.22759613180087584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409426286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10151348,0.00018376074,0.89472824,0.000493256,0.00018102759,0.00017501235,0.000008217891,0.0009954645,0.0017215076],"genre_scores_gemma":[0.99200475,0.000009846674,0.0065790415,0.001202591,0.000052361058,0.000059465925,0.000008387089,0.000045920515,0.00003762858],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988757,0.000029697327,0.00034065873,0.00023399413,0.00017604847,0.00034395274],"domain_scores_gemma":[0.9994677,0.00008164365,0.000074138174,0.0002670944,0.000054757264,0.000054697583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007075343,0.00025916105,0.00024463603,0.00021360129,0.00016056286,0.000081405,0.00039135088,0.00009908695,0.000037296224],"category_scores_gemma":[0.00000608094,0.00027638156,0.000074302705,0.00024934753,0.00016616637,0.0003000723,0.0000470831,0.00038758334,0.0000088996185],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002338112,0.000036454447,0.00008823523,0.00016999716,0.00008020753,0.00001068285,0.0005619182,0.009776919,0.7776333,0.00009040919,0.0027933533,0.20873511],"study_design_scores_gemma":[0.0013526878,0.00007811856,0.00033207613,0.0016200134,0.00008856753,0.0000159909,0.00048453227,0.33277398,0.6575058,0.0011485239,0.003248638,0.0013510785],"about_ca_topic_score_codex":0.000004589634,"about_ca_topic_score_gemma":0.0000018740045,"teacher_disagreement_score":0.8904913,"about_ca_system_score_codex":0.00012115458,"about_ca_system_score_gemma":0.000033307057,"threshold_uncertainty_score":0.9999688},"labels":[],"label_agreement":null},{"id":"W4411799602","doi":"10.1109/lsp.2025.3584670","title":"A Novel Evaluation Criterion for Density Clustering via Circular Information Granules","year":2025,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Mathematics; Computer science; Pattern recognition (psychology); Probability density function; Data mining; Artificial intelligence; Statistics","score_opus":0.02650558789289352,"score_gpt":0.2806127953078521,"score_spread":0.25410720741495857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411799602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018020581,0.000052355972,0.97443014,0.0063819806,0.0002712383,0.0003939105,0.0000011561375,0.00038596053,0.00006265076],"genre_scores_gemma":[0.9461767,0.0000010253041,0.051092636,0.002562795,0.000026128071,0.00012080792,0.000009442943,0.0000039095917,0.0000065319523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989865,0.000021510788,0.00027651357,0.00023595351,0.0002855113,0.00019404375],"domain_scores_gemma":[0.99931955,0.000042596854,0.00015886739,0.00022534333,0.0002324989,0.000021122345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047808696,0.00012212686,0.00011294101,0.000283639,0.00029921273,0.0005014114,0.00044405332,0.0000693069,0.0000014084246],"category_scores_gemma":[0.000045090335,0.00012298964,0.00005339298,0.00037651922,0.000052207044,0.0019518386,0.00006133848,0.00008784825,0.00000573365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011342001,0.000019532825,0.000045165478,0.00017166109,0.000009879662,1.9515109e-7,0.0002918941,0.0014048006,0.31641328,0.0008562005,0.00066378183,0.6801123],"study_design_scores_gemma":[0.00062271056,0.000018943538,0.0013466867,0.00010962753,0.000024381416,0.000004513353,0.00005000258,0.93421453,0.056209628,0.0060892534,0.0011195246,0.00019018103],"about_ca_topic_score_codex":0.000009232575,"about_ca_topic_score_gemma":0.0000015723277,"teacher_disagreement_score":0.93280977,"about_ca_system_score_codex":0.00012690185,"about_ca_system_score_gemma":0.00008104613,"threshold_uncertainty_score":0.5015372},"labels":[],"label_agreement":null},{"id":"W7104970165","doi":"10.1109/lsp.2025.3632232","title":"A Nonparametric Variable Forgetting Factor Recursive Least-Squares Algorithm","year":2025,"lang":"","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Variable (mathematics); Forgetting; Factor (programming language); Context (archaeology); Set (abstract data type); Nonparametric statistics; Control (management); Tracking (education)","score_opus":0.012670208707881658,"score_gpt":0.2554817576752817,"score_spread":0.24281154896740004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104970165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007048493,0.003188993,0.98381126,0.0007056772,0.00140412,0.0008656602,0.00012641374,0.001535924,0.001313469],"genre_scores_gemma":[0.56494814,0.00005777147,0.43194598,0.0015486479,0.00064081897,0.00015439779,0.000014795659,0.00022944291,0.00045999364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508995,0.00014515068,0.0011573139,0.0012806897,0.0006663926,0.001660511],"domain_scores_gemma":[0.9978829,0.00050867884,0.0004420508,0.00058385805,0.0003600456,0.00022244222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004071931,0.0011115564,0.0009995606,0.001341921,0.0006708861,0.0006199161,0.0009803246,0.0004548264,0.00010339543],"category_scores_gemma":[0.00020444723,0.0013103356,0.00027925833,0.0029330836,0.0003237107,0.001297346,0.00019531386,0.0016229426,0.000048647882],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007127785,0.00012247347,0.00008055459,0.002058119,0.00033515433,0.000099607,0.00069954223,0.051822398,0.3247526,0.00017426649,0.0040243543,0.6157597],"study_design_scores_gemma":[0.0017268822,0.00035245946,0.00028589385,0.011001959,0.00045160565,0.00005261717,0.00036034698,0.5770401,0.38001522,0.008045002,0.017176788,0.0034911365],"about_ca_topic_score_codex":0.000053244767,"about_ca_topic_score_gemma":8.052859e-7,"teacher_disagreement_score":0.6122685,"about_ca_system_score_codex":0.0011044921,"about_ca_system_score_gemma":0.0003028934,"threshold_uncertainty_score":0.9989346},"labels":[],"label_agreement":null}]}