{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":49,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":49,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"69cdc10ee4ab","filters":{"venue":"IET Signal Processing"}},"results":[{"id":"W2132315948","doi":"10.1049/iet-spr.2013.0354","title":"Time–frequency‐based instantaneous frequency estimation of sparse signals from incomplete set of samples","year":2014,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Department of National Defence","funders":"","keywords":"Time–frequency analysis; Algorithm; SIGNAL (programming language); Mathematics; Instantaneous phase; Signal reconstruction; Bilinear interpolation; Fourier transform; Set (abstract data type); Computer science; Spectral density estimation; Pattern recognition (psychology); Signal processing; Artificial intelligence; Statistics; Digital signal processing; Telecommunications; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02559073078830124,"gpt":0.2414025410910759,"spread":0.2158118103027746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001929572,0.0002438836,0.0004478583,0.0001636761,0.00006436188,0.00003441322,0.000250595,0.0001270727,0.0001156972],"category_scores_gemma":[0.00005810865,0.0002479483,0.00008091564,0.0002466102,0.0001430168,0.0002058827,0.00002011148,0.0001581312,0.000009884593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004229786,"about_ca_system_score_gemma":0.00006502318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000182035,"about_ca_topic_score_gemma":0.00000897582,"domain_scores_codex":[0.9985752,0.00007008108,0.0005674084,0.000232956,0.0003168769,0.0002374837],"domain_scores_gemma":[0.9990082,0.0002433597,0.0002548538,0.0002619877,0.0001688597,0.00006272308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000213341,0.0000269873,0.0001579914,0.0001962502,0.00003525377,0.000009408756,0.0003116541,0.1546324,0.8018255,0.00008057475,0.0001503857,0.0425523],"study_design_scores_gemma":[0.0001801899,0.00008188136,0.0001090576,0.0006852721,0.00003980667,0.000005037209,0.00002027591,0.6041979,0.3820545,0.01237936,0.00003479637,0.0002119363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5705445,0.0005024967,0.4258563,0.00001994981,0.0000425665,0.0001657604,0.0001109217,0.000508382,0.002249111],"genre_scores_gemma":[0.9291756,0.000003741769,0.07057048,0.00003877834,0.00007140081,0.000006141994,0.00008504131,0.00004663537,0.000002161022],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4495655,"threshold_uncertainty_score":0.9999973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163906842","doi":"10.1049/iet-spr.2009.0082","title":"Focusing inverse synthetic aperture radar images with higher-order motion error using the adaptive joint-time–frequency algorithm optimised with the genetic algorithm and the particle swarm optimisation algorithm – comparison and results","year":2010,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced SAR Imaging Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Department of National Defence","funders":"","keywords":"Algorithm; Inverse synthetic aperture radar; Particle swarm optimization; Computer science; Synthetic aperture radar; Focus (optics); Genetic algorithm; Search algorithm; Radar; Radar imaging; Computer vision; Optics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01498215826125679,"gpt":0.2366985705253991,"spread":0.2217164122641423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006427556,0.0004395788,0.0003681388,0.0000569419,0.0008539312,0.0003924106,0.0002383227,0.0001216592,0.000007705939],"category_scores_gemma":[0.00004663123,0.0002301342,0.00003910056,0.000404696,0.001163914,0.000633678,0.00007520321,0.0008025599,0.000001256349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007395176,"about_ca_system_score_gemma":0.00006661715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008039194,"about_ca_topic_score_gemma":0.000008574151,"domain_scores_codex":[0.9980471,0.0001618407,0.0004240479,0.0004782667,0.0004287817,0.0004599613],"domain_scores_gemma":[0.9986722,0.0003394585,0.0002726956,0.0003708895,0.0002447073,0.0001000692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002557579,0.00007565468,0.0000310966,0.00009886506,0.0001722087,0.0000378843,0.005932151,0.1079158,0.05867518,0.00002137234,0.0001304819,0.8266535],"study_design_scores_gemma":[0.0015294,0.00009320626,0.000114401,0.0002005179,0.0001954605,0.0001982416,0.0008794524,0.9758681,0.01997662,0.0004701052,0.00009180355,0.0003826638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01749635,0.001254879,0.978305,0.001535187,0.00005107549,0.0008224053,0.00002401841,0.0004130182,0.00009803426],"genre_scores_gemma":[0.343381,0.0000212999,0.6562198,0.0001091963,0.0001213623,0.00004510366,0.000005949834,0.00007915512,0.00001709042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8679523,"threshold_uncertainty_score":0.93846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029176866","doi":"10.1049/iet-spr.2012.0192","title":"Compressive sensing‐based speech enhancement in non‐sparse noisy environments","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Noise (video); Compressed sensing; Algorithm; Sparse approximation; Constraint (computer-aided design); Gaussian noise; Upper and lower bounds; Noise measurement; Additive white Gaussian noise; Speech recognition; White noise; Artificial intelligence; Mathematics; Noise reduction; Image (mathematics); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0131991910672514,"gpt":0.233351223647061,"spread":0.2201520325798096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002666856,0.0003217412,0.0003180743,0.0002100984,0.0002510878,0.0006088433,0.0007090957,0.000108771,0.000137829],"category_scores_gemma":[0.00001635287,0.0003061021,0.00006487734,0.0005212124,0.0001006912,0.001422619,0.0002126227,0.0003166681,0.0003452172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001445559,"about_ca_system_score_gemma":0.0001617859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000768942,"about_ca_topic_score_gemma":0.000008238443,"domain_scores_codex":[0.997466,0.00006383297,0.0004656598,0.0007189623,0.0005788735,0.0007067107],"domain_scores_gemma":[0.9990434,0.00006315119,0.0002771313,0.000360712,0.00007328345,0.0001823047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001103999,0.0002067921,0.0007485726,0.0000958157,0.000008989712,0.0001067274,0.0006358342,0.001199477,0.3162705,0.00000387991,0.0004442444,0.6802681],"study_design_scores_gemma":[0.0008551744,0.00007598152,0.001478808,0.0004503768,0.000006569463,0.00001753111,0.00006883359,0.2820224,0.7129318,0.001174526,0.000473874,0.0004441094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1693196,0.0002697237,0.8270984,0.0006743911,0.0001108528,0.0003793644,6.818155e-7,0.00009958626,0.002047383],"genre_scores_gemma":[0.8603352,0.000003803914,0.138109,0.001200035,0.00008174333,0.00002333114,0.000004742833,0.00002192906,0.0002202637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6910156,"threshold_uncertainty_score":0.9999391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994048562","doi":"10.1049/iet-spr.2011.0234","title":"Electroencephalogram signals classification for sleep-state decision – a Riemannian geometry approach","year":2012,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Metric (unit); Weighting; Pattern recognition (psychology); Artificial intelligence; Electroencephalography; Spectral density; Mathematics; Computer science; Feature (linguistics); SIGNAL (programming language); Statistics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.0543687326056482,"gpt":0.3159394438925244,"spread":0.2615707112868763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006814949,0.0002632545,0.0002632537,0.0002307366,0.000447001,0.0003541063,0.0004652105,0.0001056273,0.00002080733],"category_scores_gemma":[0.0001932477,0.000222216,0.0001160964,0.000672665,0.0001313687,0.001055671,0.000065792,0.0002467831,0.00002324896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006547933,"about_ca_system_score_gemma":0.0000526023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002327588,"about_ca_topic_score_gemma":3.300606e-7,"domain_scores_codex":[0.9975984,0.0001022363,0.0004190494,0.0006016474,0.0004453191,0.0008333842],"domain_scores_gemma":[0.9987444,0.0004740891,0.0002642437,0.0001995562,0.0001140597,0.0002036958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000141764,0.0003543564,0.0006553274,0.0001424045,0.000007760239,0.000001465891,0.001026405,0.0007831876,0.6289065,0.0002138351,0.0007552304,0.3670118],"study_design_scores_gemma":[0.0008410836,0.0004408963,0.001610897,0.0001710805,0.00004223139,0.0001128904,0.0002518867,0.3948142,0.5898819,0.004645432,0.006494998,0.000692477],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3409752,0.0004270084,0.6570272,0.0001202177,0.0001487538,0.0004053492,0.000009473373,0.0001712963,0.0007155025],"genre_scores_gemma":[0.9770504,0.000006945086,0.02154677,0.0007068123,0.0003665542,0.0001086522,0.000009492158,0.00004122601,0.0001631274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6360753,"threshold_uncertainty_score":0.9061705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107676201","doi":"10.1049/iet-spr.2010.0262","title":"Signal denoising using neighbouring dual-tree complex wavelet coefficients","year":2012,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Noise reduction; Wavelet; Complex wavelet transform; Preprocessor; Pattern recognition (psychology); Artificial intelligence; Video denoising; Computer science; Non-local means; SIGNAL (programming language); Wavelet transform; Invariant (physics); Image denoising; Step detection; Signal processing; Noise (video); Algorithm; Mathematics; Discrete wavelet transform; Image (mathematics); Computer vision; Digital signal processing","retraction":null,"screen_n_in":null,"score":{"opus":0.06308379760794391,"gpt":0.3162354115593237,"spread":0.2531516139513798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001524992,0.0004882171,0.0005048937,0.000360879,0.001150566,0.00111173,0.0009418458,0.0001714317,0.0001584104],"category_scores_gemma":[0.00005707946,0.0004771085,0.0001771233,0.001107626,0.0001633976,0.00292963,0.0005377851,0.0004835383,0.00007490839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002007435,"about_ca_system_score_gemma":0.0002330967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003838981,"about_ca_topic_score_gemma":0.00000100069,"domain_scores_codex":[0.9957044,0.0003807858,0.0006802903,0.0007136335,0.001013019,0.001507858],"domain_scores_gemma":[0.9981984,0.0002457655,0.0003718094,0.0004658964,0.0002835824,0.0004345361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004834252,0.0002988411,0.000858474,0.0001701192,0.00004166312,0.0001144029,0.00291209,0.002220296,0.4025152,0.0008104901,0.0002021049,0.5898079],"study_design_scores_gemma":[0.001766836,0.0001317252,0.004172854,0.000586964,0.00009804413,0.0008013468,0.0002169346,0.8961626,0.08962923,0.002120533,0.002787038,0.001525936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05031899,0.001089231,0.9442545,0.0001037533,0.0003492272,0.0001891572,0.000002665832,0.0003605944,0.003331874],"genre_scores_gemma":[0.7272521,0.000001751237,0.2713679,0.0005433598,0.0006499796,0.00000409462,0.000004514596,0.00004944091,0.0001268358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8939422,"threshold_uncertainty_score":0.9999252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090348733","doi":"10.1049/iet-spr.2009.0050","title":"Signal detection performance in Rayleigh fading environments with a moving antenna","year":2010,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Multipath propagation; Antenna (radio); Computer science; Rayleigh fading; Decorrelation; Antenna diversity; Fading; Narrowband; Diversity gain; Omnidirectional antenna; Electronic engineering; Acoustics; Telecommunications; Physics; Algorithm; Engineering; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.01484430547172742,"gpt":0.2428669381012609,"spread":0.2280226326295335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364354,0.0001623946,0.0001500441,0.0002253626,0.00037267,0.0003325758,0.001050596,0.00008911421,0.00001890185],"category_scores_gemma":[0.00001054412,0.0001451071,0.00002354536,0.0007359586,0.0001146382,0.001574816,0.0003027088,0.0008715617,0.00001962599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009043996,"about_ca_system_score_gemma":0.0001050383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001567849,"about_ca_topic_score_gemma":0.00005251052,"domain_scores_codex":[0.9982921,0.00008511626,0.000254285,0.0004035294,0.0005104982,0.000454473],"domain_scores_gemma":[0.9992195,0.0000950143,0.0001249249,0.0004129803,0.00004796792,0.00009957475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000446138,0.00009221066,0.0179552,0.00005165225,0.000006742884,0.00001700363,0.001065477,0.00725657,0.3430558,0.00005140807,0.000001577489,0.6304017],"study_design_scores_gemma":[0.0003718996,0.00008100916,0.0154809,0.0001616152,0.000001831977,0.00003980792,0.00004050797,0.9552446,0.02808386,0.0001179859,0.0001648099,0.0002111665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5213798,0.00007280014,0.4778932,0.0000727175,0.00002576602,0.0001161203,1.24148e-7,0.00006444197,0.0003750262],"genre_scores_gemma":[0.9850584,0.00001624324,0.01469583,0.00004937798,0.00006672441,0.00004161257,9.609608e-7,0.00001956801,0.00005123296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.947988,"threshold_uncertainty_score":0.5917298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491512592","doi":"10.1049/iet-spr.2010.0367","title":"Robust equalisation for inter symbol interference communication channels","year":2012,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; University of Victoria","funders":"","keywords":"Equaliser; Channel (broadcasting); Computer science; Constraint (computer-aided design); Intersymbol interference; Interference (communication); Communications system; Symbol (formal); Transmission (telecommunications); Bit error rate; Algorithm; Nyquist ISI criterion; Stability (learning theory); Control theory (sociology); Mathematics; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07592863168739125,"gpt":0.2993637370544824,"spread":0.2234351053670911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003145025,0.0001399445,0.0001381748,0.00008726947,0.0001380301,0.00007017495,0.0003507019,0.00008261566,0.00002522273],"category_scores_gemma":[0.00002837722,0.0001481433,0.00003662049,0.0001321979,0.00004754371,0.001014209,0.00006965481,0.0001875372,0.00001015957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012206,"about_ca_system_score_gemma":0.00001011265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002230959,"about_ca_topic_score_gemma":0.000001393836,"domain_scores_codex":[0.9992608,0.00003911345,0.0002719389,0.00009818965,0.00008238883,0.0002475669],"domain_scores_gemma":[0.9993169,0.0001200459,0.00008597808,0.0003040224,0.0001171117,0.00005591735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005303028,0.0001573683,0.0005328503,0.0009571209,0.00005102363,1.40775e-7,0.0133631,0.04354665,0.06314617,0.004517858,0.002424194,0.8712505],"study_design_scores_gemma":[0.0004026978,0.00005976027,0.00009588533,0.0009170847,0.000030951,0.000007539657,0.001245209,0.748293,0.2350918,0.008094445,0.005086315,0.0006752853],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005885304,0.001707295,0.990199,0.00008813696,0.00007011223,0.000263398,0.000004024627,0.0007247991,0.001057885],"genre_scores_gemma":[0.9496257,0.00006355978,0.04977315,0.0000620699,0.00009670763,0.0002475878,0.00004800732,0.00004552377,0.00003764742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9437404,"threshold_uncertainty_score":0.6041108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048464858","doi":"10.1049/iet-spr.2011.0260","title":"Source enumeration in large arrays using moments of eigenvalues and relatively few samples","year":2012,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Estimator; Mathematics; Linear subspace; Probability density function; Subspace topology; Gaussian; Noise (video); Applied mathematics; Algorithm; Covariance matrix; Gaussian noise; Enumeration; Statistics; Computer science; Mathematical analysis; Combinatorics; Artificial intelligence; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04890445795822267,"gpt":0.3086555141329302,"spread":0.2597510561747076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000754021,0.0001015785,0.0001445106,0.0001554918,0.0001342514,0.0001007924,0.0001477987,0.00006349474,0.000004328603],"category_scores_gemma":[0.00002641918,0.0001001834,0.00001933728,0.0003068821,0.00004545268,0.001642704,0.00008706462,0.0001176228,0.000001040846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003413021,"about_ca_system_score_gemma":0.0000570636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002864102,"about_ca_topic_score_gemma":0.000003352107,"domain_scores_codex":[0.999011,0.000114919,0.0002591862,0.0001793953,0.0002142461,0.0002212325],"domain_scores_gemma":[0.9995567,0.00004788205,0.0001875472,0.00009521871,0.00006277495,0.00004984383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005624069,0.0008519932,0.3548969,0.0004994659,0.00004853964,0.000002723993,0.1649151,0.003238733,0.2507662,0.04570249,0.00008583871,0.1789359],"study_design_scores_gemma":[0.0009555632,0.0001488205,0.04564049,0.0006478183,0.00002295737,0.00002102348,0.001156483,0.6322508,0.2925562,0.02521383,0.0006993868,0.0006865398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3381478,0.000435385,0.6610997,0.00004843761,0.00001281895,0.00007746494,7.931949e-7,0.00005218122,0.0001253075],"genre_scores_gemma":[0.8934603,0.000005835869,0.1063858,0.00009212431,0.00002738739,0.000004401045,0.00000169156,0.000007926172,0.00001460203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6290121,"threshold_uncertainty_score":0.4085358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2595113344","doi":"10.1049/iet-spr.2016.0569","title":"Level crossing speech sampling and its sparsity promoting reconstruction using an iterative method with adaptive thresholding","year":2017,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Queen's University","funders":"Sharif University of Technology","keywords":"Thresholding; Computer science; Algorithm; Signal reconstruction; Iterative method; Iterative reconstruction; Gradient descent; Sampling (signal processing); Redundancy (engineering); Compressed sensing; Artificial intelligence; Mathematics; Computer vision; Signal processing; Image (mathematics); Artificial neural network; Filter (signal processing)","retraction":null,"screen_n_in":null,"score":{"opus":0.1668564807749183,"gpt":0.3582954119918468,"spread":0.1914389312169285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001235087,0.0003960823,0.0004195608,0.0001850223,0.006423632,0.00739306,0.0007766231,0.0001415792,0.000004814335],"category_scores_gemma":[0.0001001684,0.0003548288,0.00004752066,0.0002843547,0.0002618231,0.00953362,0.0003848089,0.0004854629,0.000001310925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223509,"about_ca_system_score_gemma":0.0004614017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006414553,"about_ca_topic_score_gemma":0.0000304362,"domain_scores_codex":[0.9972943,0.000119664,0.0003878102,0.001090916,0.0004434693,0.0006638535],"domain_scores_gemma":[0.9979344,0.0000840343,0.0008675851,0.0003961199,0.0004804327,0.0002374241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005839199,0.00004860404,0.004332385,0.0001462949,0.00003067645,0.00006086522,0.005346118,0.001041158,0.1691862,0.0001137593,3.885245e-7,0.8196352],"study_design_scores_gemma":[0.0005353694,0.0001455208,0.001757009,0.001561185,0.00003469858,0.001059229,0.0004535519,0.5778233,0.4124475,0.003638501,0.00000488368,0.0005392624],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4278524,0.0002423001,0.5713191,0.00007821408,0.00005380841,0.0001469861,0.000002491612,0.0001180051,0.0001866407],"genre_scores_gemma":[0.5363258,0.000001230156,0.4634329,0.00004776845,0.0001561593,0.000002849115,6.993379e-7,0.00002037579,0.00001227182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8190958,"threshold_uncertainty_score":0.9998904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037094860","doi":"10.1049/iet-spr.2014.0120","title":"Instantaneous fundamental frequency estimation of non‐stationary periodic signals using non‐linear recursive filters","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Harmonics; Fundamental frequency; SIGNAL (programming language); Kalman filter; Control theory (sociology); Extended Kalman filter; Computer science; Harmonic; Algorithm; Instantaneous phase; Mathematics; Filter (signal processing); Acoustics; Artificial intelligence; Engineering; Computer vision; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03527213459739383,"gpt":0.2965130527574068,"spread":0.261240918160013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004341411,0.000265533,0.0003224856,0.0002451283,0.0003214533,0.0002751349,0.0005840918,0.0001022605,0.00002250124],"category_scores_gemma":[0.00006903364,0.0002646763,0.00007679524,0.0007783111,0.0001691425,0.002023349,0.0001282388,0.0002079887,0.00001872017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002206888,"about_ca_system_score_gemma":0.001113935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003970086,"about_ca_topic_score_gemma":0.000001433726,"domain_scores_codex":[0.997775,0.00005934749,0.000563911,0.0004934941,0.0006920713,0.0004161418],"domain_scores_gemma":[0.9985349,0.00006599662,0.0005287208,0.0002203432,0.0004349678,0.0002151091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001367935,0.000243361,0.001906472,0.0005883616,0.00005777599,0.0003541218,0.01621666,0.1114993,0.515721,0.00006036898,0.000176805,0.3530389],"study_design_scores_gemma":[0.0007769369,0.0003096802,0.0001338634,0.0007058413,0.00002892211,0.0002869352,0.001076894,0.7694975,0.2211141,0.005614433,0.00001815819,0.0004367519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3545758,0.0004217013,0.6439376,0.0001198489,0.0001126152,0.0001536557,0.000007463524,0.00006349603,0.0006078147],"genre_scores_gemma":[0.6906428,0.00000231266,0.30906,0.000150286,0.00008984919,0.000005735645,0.0000125331,0.00001768094,0.00001877585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6579982,"threshold_uncertainty_score":0.9999806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294780743","doi":"10.1049/iet-spr.2015.0360","title":"Unbiased, optimal, and in‐betweens: the trade‐off in discrete finite impulse response filtering","year":2016,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Royal Academy of Engineering","keywords":"Finite impulse response; Kalman filter; Mathematics; Robustness (evolution); Mean squared error; Gaussian; Algorithm; Control theory (sociology); Applied mathematics; Statistics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01933617042685448,"gpt":0.2571215455330577,"spread":0.2377853751062032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065769,0.0001812299,0.0001898808,0.0001484632,0.0001829515,0.0003225211,0.0005939566,0.00008260263,0.00001285749],"category_scores_gemma":[0.0001285389,0.0001080253,0.00003307349,0.000486953,0.0001332471,0.0008439983,0.0002538104,0.0002568723,0.000006257661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003490382,"about_ca_system_score_gemma":0.00006545219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001357752,"about_ca_topic_score_gemma":0.00001246142,"domain_scores_codex":[0.9982529,0.0002499372,0.0003561675,0.0004762569,0.0002359973,0.0004287538],"domain_scores_gemma":[0.9983099,0.001156866,0.000103504,0.0003289864,0.00001890273,0.00008186951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007474709,0.000065666,0.005144082,0.00006134371,0.000008817068,0.0002942592,0.004492831,0.01012249,0.02622708,0.0001535188,0.0005592544,0.9521232],"study_design_scores_gemma":[0.00439629,0.0004185052,0.09776475,0.004600577,0.00001987921,0.0002053113,0.0007076732,0.8639412,0.00904854,0.003126628,0.01420013,0.001570533],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.587563,0.001164928,0.4061252,0.004657808,0.0001082821,0.00016699,0.00001360538,0.0001251388,0.00007501936],"genre_scores_gemma":[0.9918587,0.00006826867,0.00760667,0.0003135262,0.00008106818,0.000008853795,0.000001469528,0.00001480536,0.00004659364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9505526,"threshold_uncertainty_score":0.4405143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088652862","doi":"10.1049/iet-spr.2008.0203","title":"Least square identification of alias components of linear periodically time-varying systems and optimal training signal design","year":2010,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Control theory (sociology); Finite impulse response; Oversampling; Infinite impulse response; Mathematics; Algorithm; Computer science; Digital filter; Filter (signal processing); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03735958056389142,"gpt":0.2624396709400343,"spread":0.2250800903761429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003991257,0.0002034955,0.0003405451,0.0001369943,0.0001147393,0.00005960693,0.0001886297,0.000125096,0.00001893027],"category_scores_gemma":[0.00003050269,0.0002168921,0.0000431842,0.0001553859,0.0001781121,0.0003788464,0.0000422071,0.0002974976,0.000002494857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002299242,"about_ca_system_score_gemma":0.00003810067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006109143,"about_ca_topic_score_gemma":1.740238e-7,"domain_scores_codex":[0.9986466,0.00003853777,0.0005727321,0.0002324245,0.0002779911,0.0002317489],"domain_scores_gemma":[0.9993084,0.00007914726,0.0002332329,0.0001334985,0.0001675001,0.00007820326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003492778,0.00001969297,0.00005595365,0.0005401049,0.00001808572,0.000003199389,0.0009291993,0.09973826,0.8890355,0.00001938752,0.000005664258,0.009600068],"study_design_scores_gemma":[0.0002064931,0.00006734795,0.0002558865,0.000518901,0.0000221875,0.00002818929,0.0001320448,0.7694632,0.2290072,0.00006282814,0.00003190624,0.0002038091],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3271699,0.0002207187,0.6720576,0.000004411907,0.00004274802,0.0001903918,0.00001668996,0.0002301569,0.00006746444],"genre_scores_gemma":[0.9173682,0.000004241282,0.08245502,0.000002192203,0.00007169802,0.00001908969,0.00001342794,0.00005059077,0.00001550673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.669725,"threshold_uncertainty_score":0.8844602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888712767","doi":"10.1049/iet-spr.2018.5245","title":"Classification of Doppler radar reflections as preprocessing for breathing rate monitoring","year":2018,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Doppler effect; Preprocessor; Computer science; Doppler radar; Radar; Breathing; Remote sensing; Artificial intelligence; Geology; Medicine; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04493451933324615,"gpt":0.3194929309296497,"spread":0.2745584115964035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004593062,0.0002712037,0.0002765472,0.0002183127,0.0004856218,0.0001778591,0.0002350832,0.0001512813,0.00001717145],"category_scores_gemma":[0.0001015588,0.0002938335,0.0000906917,0.0005791709,0.0001350461,0.000894899,0.00003741056,0.0002252287,0.00001741052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001898725,"about_ca_system_score_gemma":0.0001145867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779983,"about_ca_topic_score_gemma":0.000002495898,"domain_scores_codex":[0.9983509,0.00003207538,0.0005053557,0.0003997592,0.0002639628,0.000448017],"domain_scores_gemma":[0.9988731,0.0001543017,0.0001870866,0.0002205197,0.0004561584,0.0001087946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003876813,0.00002295219,0.00116138,0.0005714427,0.00003458436,0.000001567929,0.00125025,0.0005638979,0.9685355,0.00004771703,0.00005159766,0.02772038],"study_design_scores_gemma":[0.0003754293,0.0001126065,0.0006456494,0.000825026,0.00005606214,0.00002580145,0.0006478538,0.006500517,0.9869648,0.003126886,0.0003678288,0.0003516054],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4693102,0.001005671,0.5188029,0.00005022979,0.0009424904,0.0005077717,0.00001038631,0.0008004144,0.008569838],"genre_scores_gemma":[0.9699011,0.00001248333,0.02807523,0.000009912425,0.00171728,0.00009150783,0.0000059133,0.0001055541,0.00008105864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5005908,"threshold_uncertainty_score":0.9999514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2289179757","doi":"10.1049/iet-spr.2014.0148","title":"Modified coherence‐based dictionary learning method for speech enhancement","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Langley Research Center","keywords":"Computer science; Sparse approximation; Coherence (philosophical gambling strategy); K-SVD; Speech recognition; Noise (video); Speech enhancement; Artificial intelligence; Context (archaeology); Pattern recognition (psychology); Energy (signal processing); Noise reduction; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0637031942681851,"gpt":0.3303900956719341,"spread":0.266686901403749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123328,0.0002290463,0.000250222,0.0001394107,0.0004479176,0.0004798004,0.0006015237,0.00009572688,0.00001488621],"category_scores_gemma":[0.0001023863,0.0002142822,0.00008068496,0.0005062636,0.00004297946,0.0009089024,0.0001074413,0.0002504234,0.00001990262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011781,"about_ca_system_score_gemma":0.0006411056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113484,"about_ca_topic_score_gemma":0.000001069123,"domain_scores_codex":[0.9979531,0.00009256004,0.0003417883,0.0005937152,0.0005265794,0.0004923143],"domain_scores_gemma":[0.998751,0.000153337,0.000250234,0.0001912528,0.0004296724,0.0002245267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000737881,0.0001131279,0.0001303745,0.0001372067,0.00001515228,0.00001490899,0.0006341108,0.01839823,0.03893933,0.0001225278,0.0009449779,0.9404762],"study_design_scores_gemma":[0.0008771948,0.0002534084,0.00001117695,0.000139118,0.0000136371,0.00001798719,0.0001043972,0.6773112,0.3100613,0.007634817,0.003278829,0.0002969248],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002035801,0.0006147144,0.9925401,0.0006858992,0.0001727336,0.0002553494,0.000001099984,0.0003434963,0.003350873],"genre_scores_gemma":[0.4424323,8.272493e-7,0.5564316,0.0004664468,0.000165814,0.00006376024,0.000008844396,0.00001626742,0.0004141511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9401793,"threshold_uncertainty_score":0.8738173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3126051646","doi":"10.1049/sil2.12011","title":"Robust Wiener filter‐based time gating method for detection of shallowly buried objects","year":2021,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Geophysical Methods and Applications","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant false alarm rate; Clutter; Wiener filter; Computer science; Gating; Filter (signal processing); Detector; Artificial intelligence; Object detection; Pattern recognition (psychology); Computer vision; Matched filter; Algorithm; Radar; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02873601252571304,"gpt":0.2744822630936334,"spread":0.2457462505679204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204467,0.0001200204,0.000197004,0.00003702012,0.0001043257,0.00004184864,0.00007254759,0.00006592756,0.00003001056],"category_scores_gemma":[0.00006495854,0.0001233223,0.00008463686,0.000324429,0.00001675004,0.0001029554,0.00001338224,0.0001053604,0.000004122532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002139972,"about_ca_system_score_gemma":0.00004518987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004023917,"about_ca_topic_score_gemma":0.000001514901,"domain_scores_codex":[0.9992344,0.00003698455,0.0002260599,0.0001988984,0.0001150983,0.000188564],"domain_scores_gemma":[0.9993637,0.0002482703,0.00006701761,0.0001096707,0.0001619081,0.00004942406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005118504,0.00002159715,0.000001573823,0.0002665689,0.00001003051,4.937483e-7,0.00007230133,0.06993619,0.8200083,0.00001723665,0.00001027487,0.1096503],"study_design_scores_gemma":[0.0001405409,0.00001602234,0.00004366136,0.00006870736,0.00002199367,0.000001043328,0.00002861216,0.5197958,0.4787379,0.0009535316,0.0001061018,0.00008603548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02327528,0.0001248711,0.9755455,0.00004484998,0.0000304085,0.0001341834,0.00001028894,0.000134106,0.0007004843],"genre_scores_gemma":[0.6131434,2.807355e-7,0.3865829,0.00002842538,0.0001114493,0.00005796216,0.000009160532,0.00002371404,0.00004268449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5898682,"threshold_uncertainty_score":0.5028938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2330995436","doi":"10.1049/iet-spr.2015.0279","title":"Iteratively reweighted correlation analysis method for robust parameter identification of multiple‐input multiple‐output discrete‐time systems","year":2016,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Identification (biology); Estimation theory; Mathematics; Pattern recognition (psychology); Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01765295537833075,"gpt":0.2467568258936353,"spread":0.2291038705153046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008640977,0.0002385522,0.00050594,0.0003859147,0.0001486599,0.0002115975,0.0001675797,0.0001596712,0.00001294784],"category_scores_gemma":[0.000258976,0.0001831669,0.0002286692,0.0005984036,0.00003556431,0.0007256166,0.00001402313,0.00007646835,0.00001677104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265591,"about_ca_system_score_gemma":0.00002527779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000045014,"about_ca_topic_score_gemma":0.00001529374,"domain_scores_codex":[0.9978278,0.0001381633,0.001063267,0.0004073877,0.0003018848,0.0002614976],"domain_scores_gemma":[0.9978687,0.0007690894,0.0005334907,0.0002687401,0.0004878201,0.00007213992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009707256,0.00003842499,0.003058699,0.0004958435,0.0005437986,4.712179e-7,0.0007023086,0.2877256,0.643014,0.000033382,0.0002292267,0.06406114],"study_design_scores_gemma":[0.000797931,0.00002431525,0.005450857,0.000238994,0.0004347406,0.00000165763,0.00005840058,0.9808347,0.01166895,0.00006819071,0.0001693713,0.0002519207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02688326,0.0005494746,0.9712019,0.00003882629,0.0001973313,0.00075878,0.0001413544,0.0001883374,0.00004072162],"genre_scores_gemma":[0.9870631,0.000005494349,0.01162506,0.000003158483,0.0001518319,0.0002236379,0.0001290945,0.00004777252,0.0007508849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9601798,"threshold_uncertainty_score":0.746933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027471805","doi":"10.1049/iet-spr.2012.0315","title":"Modified student's <i>t</i> ‐hidden Markov model for pattern recognition and classification","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hidden Markov model; Computer science; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Markov model; Markov chain; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04534824788077283,"gpt":0.2844448863382583,"spread":0.2390966384574855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002397246,0.0001200585,0.0001125214,0.00005971827,0.000222195,0.0005521536,0.000261528,0.00005566399,0.00000630217],"category_scores_gemma":[0.00001165904,0.0001088339,0.00002916909,0.0001054358,0.00002438791,0.0007813555,0.00006964413,0.0001270317,0.00002171414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629627,"about_ca_system_score_gemma":0.00003538271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001985429,"about_ca_topic_score_gemma":0.000001214753,"domain_scores_codex":[0.9990216,0.00003575572,0.0001859434,0.0003571856,0.0001901995,0.0002092401],"domain_scores_gemma":[0.9994789,0.00005410509,0.0001207795,0.0001244777,0.0001480462,0.00007368953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002383631,0.00003076427,0.0001874727,0.00005600872,0.000004001857,3.198307e-7,0.0007733562,0.0002818186,0.001560804,0.00001654083,0.0002403754,0.9968461],"study_design_scores_gemma":[0.0003162748,0.00003961293,0.001414161,0.00005049819,0.000007208399,0.000004458091,0.00004773419,0.9900727,0.0001125172,0.007760601,0.00001843697,0.0001558428],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05854886,0.00008252242,0.9396197,0.0008386461,0.00003933757,0.0002619406,0.000002954525,0.0001376386,0.0004684305],"genre_scores_gemma":[0.924599,0.00000439708,0.07451831,0.0004015389,0.00009817907,0.0001146976,0.00001429142,0.00001232137,0.0002372945],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9966903,"threshold_uncertainty_score":0.5324429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798445441","doi":"10.1049/iet-spr.2018.5076","title":"Block sparse multi‐lead ECG compression exploiting between‐lead collaboration","year":2018,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; Queen's University","funders":"","keywords":"Kernel (algebra); Computer science; Compression ratio; Wavelet; Estimator; Algorithm; Block (permutation group theory); Compression (physics); Compressed sensing; Discrete cosine transform; Pattern recognition (psychology); Gaussian; Daubechies wavelet; Artificial intelligence; Mathematics; Wavelet transform; Discrete wavelet transform; Statistics; Image (mathematics); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05522897924781725,"gpt":0.3275315428156317,"spread":0.2723025635678145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006217695,0.000231721,0.000250424,0.0001922932,0.0006043222,0.0007796935,0.0006765417,0.0001555616,0.00001237873],"category_scores_gemma":[0.00005547549,0.000225366,0.00004720894,0.0008485042,0.0001301058,0.001923441,0.0002259084,0.0002646115,0.00009137371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006470676,"about_ca_system_score_gemma":0.0002149161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351845,"about_ca_topic_score_gemma":0.00001246577,"domain_scores_codex":[0.9979504,0.0001742064,0.0004583501,0.000559137,0.0004908971,0.0003669562],"domain_scores_gemma":[0.9985169,0.00009563279,0.000349542,0.0003361779,0.0005947628,0.0001069453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004582342,0.0003275531,0.004582341,0.0001757503,0.00003272776,0.00002166952,0.01896748,0.0005217177,0.2407982,0.0012349,0.004966492,0.7283253],"study_design_scores_gemma":[0.0004813774,0.0002105934,0.0005145734,0.0003779657,0.00001231617,0.000009563384,0.0003463772,0.6248396,0.3689083,0.001528127,0.002340535,0.0004306182],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07378044,0.0001137928,0.9227867,0.0006695961,0.00009681158,0.0002459468,0.00000286004,0.0009302673,0.001373578],"genre_scores_gemma":[0.7536656,0.000002100076,0.2454791,0.0004205618,0.0002672655,0.00001902184,0.000007592098,0.00002049625,0.0001182267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7278947,"threshold_uncertainty_score":0.9190157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2799621666","doi":"10.1049/iet-spr.2017.0512","title":"Efficient blind source extraction of noisy mixture utilising a class of parallel linear predictor filters","year":2018,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Class (philosophy); Blind signal separation; Extraction (chemistry); Pattern recognition (psychology); Linear prediction; Artificial intelligence; Speech recognition; Algorithm; Chromatography; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02264070401114699,"gpt":0.2959059034246326,"spread":0.2732651994134856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560096,0.0001651739,0.0002364653,0.000209983,0.0001403603,0.00008292672,0.0004976192,0.0001490284,0.00001665541],"category_scores_gemma":[0.00004654663,0.0001531148,0.00008417499,0.0005672658,0.0002134744,0.0003541805,0.00011412,0.0002230331,0.000004662154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003159569,"about_ca_system_score_gemma":0.000191863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161563,"about_ca_topic_score_gemma":0.000002168437,"domain_scores_codex":[0.9983048,0.00009697198,0.0004888572,0.0003628825,0.0005138056,0.0002327074],"domain_scores_gemma":[0.9985664,0.00008945761,0.0005149863,0.0002976734,0.0004575013,0.00007395091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001625952,0.001696618,0.0008905797,0.001107741,0.0001312532,0.00001414432,0.05311283,0.09667304,0.665935,0.002902789,0.002245294,0.1736647],"study_design_scores_gemma":[0.0007204413,0.0002698693,0.0001793572,0.0002545227,0.00001392884,0.00001434488,0.0001142299,0.856919,0.1401458,0.0003694812,0.0008361027,0.0001628815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2002152,0.0001018571,0.7983926,0.0001842578,0.00006673345,0.0002000169,0.000002040157,0.0001742959,0.0006629955],"genre_scores_gemma":[0.8904224,0.000001518222,0.1092135,0.0001342869,0.0001283202,0.000008247471,0.000002288465,0.00001461568,0.00007484431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.760246,"threshold_uncertainty_score":0.6243841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344475046","doi":"10.1049/iet-spr.2015.0175","title":"Error‐free computation of 8‐point discrete cosine transform based on the Loeffler factorisation and algebraic integers","year":2016,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Virtual Materials Group (Canada); University of Calgary","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Discrete cosine transform; Algorithm; Gate array; Algebraic number; Computer science; Floating point; Factorization; Very-large-scale integration; Mathematics; Field-programmable gate array; Computer hardware; Artificial intelligence; Image (mathematics); Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.03235538358563826,"gpt":0.2714689809968635,"spread":0.2391135974112252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862419,0.0001164137,0.0001038973,0.00008212717,0.000093518,0.0001686468,0.000248446,0.00002945772,0.00001477205],"category_scores_gemma":[0.00002641848,0.00006469165,0.00003118175,0.0001843305,0.00007766569,0.00108073,0.00002890967,0.0000544119,0.000003202633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000391853,"about_ca_system_score_gemma":0.00005739432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007028009,"about_ca_topic_score_gemma":0.000001995299,"domain_scores_codex":[0.9990469,0.00005181839,0.0002429029,0.0002125953,0.0003005364,0.0001452016],"domain_scores_gemma":[0.9994335,0.0001732058,0.0001369109,0.0001343216,0.00007893773,0.00004317077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007888862,0.00005769158,0.0003232498,0.00009933246,0.0000134182,0.00000127517,0.002111197,0.0002307211,0.02730362,0.005922854,0.0004970009,0.9633607],"study_design_scores_gemma":[0.002658794,0.001084511,0.006305444,0.001143274,0.00002588287,0.000007440539,0.0003091538,0.7415141,0.1589279,0.08727861,0.0002424507,0.000502392],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637046,0.00001425702,0.9777063,0.004595781,0.0000376474,0.0002053907,0.000008827249,0.00004809813,0.001013281],"genre_scores_gemma":[0.9974221,9.978401e-7,0.002164598,0.0003533714,0.00001940546,0.000009344923,0.000005955508,0.000008014375,0.0000162112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9810516,"threshold_uncertainty_score":0.2638049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313563682","doi":"10.1049/sil2.12183","title":"A robust feedforward hybrid active noise control system with online secondary‐path modelling","year":2023,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Japan Society for the Promotion of Science; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Feed forward; Computer science; Active noise control; Control theory (sociology); Narrowband; Decoupling (probability); Finite impulse response; Band-pass filter; Electronic engineering; Noise reduction; Engineering; Algorithm; Telecommunications; Artificial intelligence; Control engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02249684898627345,"gpt":0.218333121769473,"spread":0.1958362727831995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000148599,0.0003576977,0.0004034759,0.000206919,0.0001819605,0.00009492964,0.0002295808,0.00007600176,0.0000102621],"category_scores_gemma":[0.000005682492,0.000328709,0.00006492814,0.0004312293,0.00006096271,0.0005962233,0.00004282883,0.0004620213,0.00002295954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002452625,"about_ca_system_score_gemma":0.00007561082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009861201,"about_ca_topic_score_gemma":0.000003381758,"domain_scores_codex":[0.9984387,0.00002299712,0.0003134228,0.0003878015,0.000299997,0.0005370703],"domain_scores_gemma":[0.9993721,0.00006060166,0.0001029006,0.0001934649,0.0001470224,0.0001239735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009572843,0.00001484565,0.00001582327,0.0006051332,0.00005174777,0.0001216297,0.0001982921,0.9747834,0.007783079,0.00003828554,0.00007770942,0.01621432],"study_design_scores_gemma":[0.0006068987,0.00008757855,0.00005114366,0.001058549,0.00003540353,0.00005903684,0.0003756946,0.9854287,0.01147871,0.0001598317,0.0002342615,0.0004241872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07916734,0.0001764258,0.914959,0.00002132759,0.00005171492,0.0003197748,0.0001741396,0.004367756,0.000762512],"genre_scores_gemma":[0.9602313,0.00001117087,0.03919227,0.00002550002,0.0001885813,0.00008311031,0.00005581282,0.0001540386,0.00005819258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.881064,"threshold_uncertainty_score":0.9999165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2738794741","doi":"10.1049/iet-spr.2017.0074","title":"Transformed cubature quadrature Kalman filter","year":2017,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Quadrature (astronomy); Kalman filter; Algorithm; Filter (signal processing); Covariance; Mathematics; Extended Kalman filter; Transformation (genetics); Computer science; Applied mathematics; Control theory (sociology); Statistics; Artificial intelligence; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.02186514333046006,"gpt":0.2708588575557888,"spread":0.2489937142253288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000245677,0.0002167665,0.0002038846,0.00005927871,0.001426402,0.001773138,0.001901121,0.0002067082,0.00006679028],"category_scores_gemma":[0.00002590325,0.0001763837,0.00008982064,0.0001244413,0.0001064079,0.001790297,0.0001685949,0.0005297123,0.00004729623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001681889,"about_ca_system_score_gemma":0.00008355181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001107692,"about_ca_topic_score_gemma":0.000009621506,"domain_scores_codex":[0.9984025,0.00003432627,0.0002291973,0.0005125171,0.0003822176,0.0004392471],"domain_scores_gemma":[0.998687,0.0000429802,0.0001927825,0.0008236124,0.0001077938,0.0001458178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005074884,0.0001142752,0.0008062309,0.0001671318,0.00002549952,0.0001818805,0.002666577,0.0004242717,0.007257181,0.004914303,0.03750349,0.9458884],"study_design_scores_gemma":[0.00367872,0.0003928236,0.01824656,0.002120396,0.0000929934,0.0004584739,0.00026517,0.4333471,0.03432063,0.03788874,0.4659128,0.003275633],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006933445,0.001288861,0.9646704,0.004558288,0.0009660122,0.0001963308,0.0000175617,0.0005860372,0.02078311],"genre_scores_gemma":[0.9731136,0.00001811335,0.02498592,0.0006821078,0.0004899105,0.00000711441,0.00001334725,0.00001888402,0.0006709947],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9661801,"threshold_uncertainty_score":0.9998736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3217581544","doi":"10.1049/sil2.12080","title":"BCI‐control and monitoring system for smart home automation using wavelet classifiers","year":2021,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Brain–computer interface; Computer science; Electroencephalography; Artificial intelligence; Wavelet; Pattern recognition (psychology); Feature extraction; Data acquisition; Interface (matter); Signal processing; Speech recognition; Digital signal processing; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.04484829437629914,"gpt":0.2873429248155279,"spread":0.2424946304392287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094307,0.0001528191,0.0002073023,0.00007132687,0.0004155278,0.0004556326,0.0001149935,0.00007489596,0.00000197064],"category_scores_gemma":[0.0000627847,0.0001452575,0.00005036143,0.0001876574,0.00005300363,0.0005062952,0.00004180286,0.0001195831,0.000002279597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008408142,"about_ca_system_score_gemma":0.0001137655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003539619,"about_ca_topic_score_gemma":3.828204e-7,"domain_scores_codex":[0.9987177,0.00008280022,0.0002554801,0.0004296254,0.0002173948,0.0002970455],"domain_scores_gemma":[0.9993637,0.0002306253,0.0001400786,0.00009238601,0.00009650918,0.00007673804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003012581,0.00001823592,0.0005240912,0.0005958445,0.000007263609,0.00002647865,0.0004308128,0.0005784237,0.9678111,0.00008642667,0.00001853758,0.02987264],"study_design_scores_gemma":[0.0005896532,0.00003628623,0.0002836918,0.0005335659,0.00002468543,0.0001233187,0.0004042261,0.4642508,0.5332773,0.0001676539,0.0001372275,0.0001715193],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8165994,0.0003067529,0.1819505,0.0001531223,0.0004623873,0.0001771953,0.00001076967,0.0001766113,0.0001631768],"genre_scores_gemma":[0.9944003,0.000002020727,0.005065398,0.0001193874,0.0003084576,0.00001355546,0.000001116209,0.00002295635,0.00006675658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4636724,"threshold_uncertainty_score":0.5923431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963378461","doi":"10.1049/iet-spr.2018.5037","title":"Sharp sufficient condition of block signal recovery via <i>l</i> <sub>2</sub> / <i>l</i> <sub>1</sub> ‐minimisation","year":2019,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Minimisation (clinical trials); Signal recovery; Signal processing; Computer science; Mathematics; Minification; Algorithm; Mathematical optimization; Telecommunications; Statistics; Compressed sensing","retraction":null,"screen_n_in":null,"score":{"opus":0.008403849006667102,"gpt":0.2038306158277703,"spread":0.1954267668211032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002906804,0.0004209886,0.0004843322,0.0002655144,0.000141406,0.0001293448,0.0002516017,0.0002713718,0.00002679082],"category_scores_gemma":[0.00001430576,0.0004605241,0.0001790325,0.0004588706,0.00009261374,0.0005730581,0.00006999631,0.000405283,0.00009123843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001392455,"about_ca_system_score_gemma":0.00009900625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005923216,"about_ca_topic_score_gemma":0.000003285553,"domain_scores_codex":[0.9976639,0.00006457923,0.000679381,0.0004988512,0.0005695286,0.0005237592],"domain_scores_gemma":[0.9988446,0.000122968,0.0003122438,0.0003094983,0.0002892994,0.000121398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006110493,0.00008434668,0.00008835942,0.0002440977,0.00004118595,0.0000102694,0.0002352644,0.04280116,0.9131985,0.00001215404,0.001684775,0.04153879],"study_design_scores_gemma":[0.0003880968,0.0001872986,0.0002033516,0.0007016205,0.00006344273,0.00003670964,0.00006584174,0.1122129,0.8848032,0.0006900282,0.0001804316,0.0004670365],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9463788,0.0004916504,0.05021802,0.00003537535,0.0002610833,0.0004179644,0.00002750514,0.0007751372,0.001394478],"genre_scores_gemma":[0.9987002,0.0000650702,0.0005576187,0.0002305008,0.0002248544,0.00002556374,0.00008272125,0.0001069126,0.000006566063],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06941175,"threshold_uncertainty_score":0.9997846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041785516","doi":"10.1049/iet-spr.2009.0222","title":"Optimal look-up table-based data hiding","year":2011,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lookup table; Computer science; Robustness (evolution); Information hiding; Embedding; Algorithm; Distortion (music); Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07718592920681396,"gpt":0.2845162317126007,"spread":0.2073303025057867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004277099,0.000191543,0.0001686754,0.0001493274,0.0003369826,0.0002436961,0.002178803,0.00007677195,0.00001772869],"category_scores_gemma":[0.0000124814,0.0001738336,0.0000402511,0.0005128785,0.00009382371,0.002248432,0.0005261981,0.0002091483,0.000006747689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001791508,"about_ca_system_score_gemma":0.0001328428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001396554,"about_ca_topic_score_gemma":7.728251e-7,"domain_scores_codex":[0.9984357,0.0000445101,0.0002442419,0.0006058228,0.000262976,0.0004067749],"domain_scores_gemma":[0.998859,0.00003663191,0.0001510703,0.0007706524,0.000089371,0.00009327684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002110149,0.0003884205,0.004077988,0.0004548778,0.00005655909,0.0002873874,0.004109715,0.000884774,0.01964957,0.008096494,0.002581911,0.9592013],"study_design_scores_gemma":[0.0006666469,0.0002222684,0.0002076125,0.0005803365,0.00003222352,0.00005269003,0.00007824943,0.7035826,0.2701308,0.01778167,0.005721989,0.0009429003],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002306773,0.0003106168,0.9941354,0.00005953188,0.0001040921,0.0001005534,0.000005573243,0.0007891248,0.00218838],"genre_scores_gemma":[0.6113431,0.000002470623,0.3883946,0.0001630001,0.00004290087,0.000007442593,0.00000829564,0.00001168775,0.00002658212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9582584,"threshold_uncertainty_score":0.708873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3032977126","doi":"10.1049/iet-spr.2019.0245","title":"Learning‐based design of random measurement matrix for compressed sensing with inter‐column correlation using copula function","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Copula (linguistics); Computer science; Correlation; Pattern recognition (psychology); Compressed sensing; Random matrix; Artificial intelligence; Algorithm; Mathematics; Econometrics; Eigenvalues and eigenvectors; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05881248745552867,"gpt":0.2476509266920826,"spread":0.1888384392365539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002790281,0.0002132379,0.0003293646,0.00008911343,0.000154431,0.00008018045,0.0000762796,0.00008971592,0.000006161262],"category_scores_gemma":[0.00004195468,0.0002089601,0.0000658147,0.0002316246,0.00004378931,0.0001837502,0.00001227657,0.0002042206,7.925477e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008047828,"about_ca_system_score_gemma":0.00007869369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001063968,"about_ca_topic_score_gemma":0.000001133989,"domain_scores_codex":[0.9988062,0.00008222033,0.0003401844,0.0002279348,0.0003270445,0.0002164348],"domain_scores_gemma":[0.999164,0.00009211014,0.0001909722,0.00008275831,0.0004053895,0.00006473728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008416402,0.00001040484,0.00005306145,0.0002096293,0.00003803918,0.000002073861,0.000192173,0.7352862,0.2552738,0.000001066386,0.0001050545,0.007986769],"study_design_scores_gemma":[0.001462015,0.0003306814,0.00001084939,0.0007678077,0.0001435006,0.000004107762,0.00009182237,0.8661216,0.1306862,0.00006105223,0.0001096917,0.000210593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01132841,0.0003393926,0.9870697,0.00002637839,0.0000560873,0.0005621252,0.000001562258,0.0005720522,0.00004432977],"genre_scores_gemma":[0.9283716,0.000001469214,0.07140587,0.00004881818,0.00009090292,0.000007445592,0.000008939648,0.00006297185,0.000001994296],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9170431,"threshold_uncertainty_score":0.8521147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3010044096","doi":"10.1049/iet-spr.2019.0247","title":"Joint beamforming and admission control for cache‐enabled Cloud‐RAN with limited fronthaul capacity","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Population and Public Health; Engineering and Physical Sciences Research Council; King Saud University","keywords":"Computer science; C-RAN; Radio access network; Cache; Cloud computing; Telecommunications link; Beamforming; Admission control; Computer network; Power control; Integer programming; Quality of service; Optimization problem; Real-time computing; Power (physics); Base station; Telecommunications; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02005142212236383,"gpt":0.208525501369641,"spread":0.1884740792472771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001208813,0.0002213514,0.0003177346,0.00004717434,0.0001807122,0.00007852727,0.00006515078,0.00009675066,0.000008064641],"category_scores_gemma":[0.00006469199,0.0001924834,0.00003239472,0.0001603028,0.00003051412,0.0004511683,0.00001157234,0.0001647289,0.000001337049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006377331,"about_ca_system_score_gemma":0.00003740579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005946652,"about_ca_topic_score_gemma":0.00000389587,"domain_scores_codex":[0.999012,0.00001622135,0.0002855506,0.0002630993,0.0001276024,0.0002955254],"domain_scores_gemma":[0.9994608,0.0000527531,0.0001004665,0.00007315028,0.0001118681,0.0002010058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003069266,0.00001792217,0.0002106047,0.001709613,0.0000628045,0.000006467606,0.002803114,0.8371309,0.1436186,0.00002048282,0.0002022905,0.01391022],"study_design_scores_gemma":[0.002054913,0.0001458173,0.00001985201,0.0003486418,0.00005703243,0.00001348443,0.0003555473,0.9750742,0.02103941,0.00008832564,0.0005055149,0.0002972413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03231054,0.0006363245,0.9656629,0.0001613261,0.00004349078,0.0005834635,0.00001521847,0.0003782368,0.0002085067],"genre_scores_gemma":[0.960575,0.000005076638,0.03887647,0.0001447714,0.000240002,0.00005848342,0.00001464389,0.00006968599,0.00001581174],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9282645,"threshold_uncertainty_score":0.7849244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4200592094","doi":"10.1049/sil2.12091","title":"Underwater source localization using time difference of arrival and frequency difference of arrival measurements based on an improved invasive weed optimization algorithm","year":2021,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cramér–Rao bound; Algorithm; Computer science; Position (finance); Mean squared error; Time of arrival; Underwater; Noise (video); Gaussian; Gaussian noise; Upper and lower bounds; Mathematics; Control theory (sociology); Estimation theory; Artificial intelligence; Statistics; Physics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0212434612222408,"gpt":0.2251050302231163,"spread":0.2038615690008755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001212745,0.0002275053,0.0003051508,0.0001635968,0.0001151403,0.00006547129,0.000140987,0.0001694242,0.00003689007],"category_scores_gemma":[0.00007234547,0.0002214215,0.00003763166,0.0003634066,0.0001234028,0.0002095471,0.00003354505,0.0001323638,4.335876e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007440441,"about_ca_system_score_gemma":0.0001308036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002248774,"about_ca_topic_score_gemma":0.000004844138,"domain_scores_codex":[0.9986832,0.00006825966,0.000409618,0.0002845855,0.0003315317,0.0002228741],"domain_scores_gemma":[0.9991962,0.00004303062,0.000165151,0.0001745288,0.0003633042,0.00005780904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001169085,0.00004404776,0.001012509,0.0002475123,0.0000152026,0.000001403382,0.0002345338,0.6117644,0.3734578,0.000003276517,4.186544e-7,0.01320719],"study_design_scores_gemma":[0.0003462271,0.00006804147,0.0001572374,0.0002748795,0.00002949009,0.000002056654,0.0001253202,0.6426554,0.3559415,0.0002497624,2.124388e-7,0.0001498072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09448423,0.0001131401,0.9049444,0.000006702066,0.00003738952,0.0001570521,0.00001278453,0.0001632176,0.00008105407],"genre_scores_gemma":[0.9696331,0.000005532485,0.03019019,0.00003139942,0.00002361296,0.000007542504,0.00005948315,0.00003934821,0.000009801327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8751488,"threshold_uncertainty_score":0.9029305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2298435078","doi":"10.1049/iet-spr.2014.0300","title":"Parallel‐computing‐based implementation of fast algorithms for discrete Gabor transform","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Parallel algorithm; Algorithm; Inter-process communication; Parallel processing; Signal processing; Block (permutation group theory); Process (computing); Overhead (engineering); Distributed computing; Digital signal processing; Computer hardware; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05455321957734242,"gpt":0.3676689865429121,"spread":0.3131157669655697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089876,0.0001804951,0.0002619612,0.0001200806,0.0001574065,0.0002062532,0.0004834003,0.00005632325,0.000005728066],"category_scores_gemma":[0.00001702737,0.0001544224,0.0001113708,0.0003740967,0.00005375605,0.0007113303,0.00003972682,0.00009442509,0.000002046889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004324582,"about_ca_system_score_gemma":0.000418984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003699949,"about_ca_topic_score_gemma":0.000003634115,"domain_scores_codex":[0.9983813,0.00008547639,0.0004222994,0.0003485151,0.0004071926,0.0003552094],"domain_scores_gemma":[0.9990132,0.0001096648,0.0002165124,0.0001703914,0.0003631498,0.0001271043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007565208,0.00004243328,0.00005941201,0.0001714704,0.00001443045,0.000004928454,0.003165506,0.002173524,0.005320683,0.0003754064,0.0002345763,0.988362],"study_design_scores_gemma":[0.003736135,0.0005357034,0.0001717588,0.0001359692,0.00003644371,0.00001026425,0.0006309281,0.8643113,0.1186085,0.01055897,0.0009051831,0.0003588281],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001966833,0.0002494902,0.996402,0.0005440701,0.0001130475,0.0003189852,0.000009068529,0.00009849972,0.0002980048],"genre_scores_gemma":[0.5278366,5.031536e-7,0.4718562,0.0001571833,0.00008756288,0.00001218776,0.00000922777,0.00001206416,0.00002851242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9880031,"threshold_uncertainty_score":0.6297163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135360189","doi":"10.1049/iet-spr.2019.0587","title":"Design of <i>p</i> ‐norm linear phase FIR differentiators using adaptive modification rate artificial bee colony algorithm","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Differentiator; Finite impulse response; Algorithm; Linear phase; Norm (philosophy); Adaptive filter; Computer science; Mathematics; Mathematical optimization; Filter (signal processing)","retraction":null,"screen_n_in":null,"score":{"opus":0.1444829949938323,"gpt":0.3316646171062672,"spread":0.1871816221124349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002360312,0.0001843427,0.0002255723,0.00008414063,0.0001652248,0.0002494242,0.0003935637,0.00005316106,0.00001333717],"category_scores_gemma":[0.000017802,0.0001841756,0.00005584222,0.000573863,0.00005696647,0.001452854,0.0000871521,0.0001100078,0.00001071539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004350374,"about_ca_system_score_gemma":0.0002088028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007852126,"about_ca_topic_score_gemma":2.02964e-7,"domain_scores_codex":[0.9984166,0.0001174835,0.0004729218,0.000404982,0.0003256201,0.0002623655],"domain_scores_gemma":[0.99915,0.00007056214,0.0003440432,0.000108269,0.0001984007,0.0001287568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001389707,0.0002241619,0.00000679407,0.00005848972,0.00002696952,0.000008556932,0.00214499,0.005311073,0.6024207,0.000417138,0.0001228128,0.3891193],"study_design_scores_gemma":[0.0004431478,0.0003621815,0.00000959315,0.00003485741,0.00001906242,0.000002018386,0.00007686219,0.7704779,0.2270419,0.001350109,0.0000254378,0.0001569388],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01624989,0.00005296965,0.9829705,0.000191707,0.00004746021,0.0003191886,0.00001783324,0.0001023781,0.00004809248],"genre_scores_gemma":[0.8547019,0.000001632119,0.1448569,0.0003008438,0.00009238763,0.0000105045,0.00001461202,0.00001532074,0.000005931007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.838452,"threshold_uncertainty_score":0.7510465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3134920422","doi":"10.1049/iet-spr.2020.0316","title":"Compact S‐transform for analysing local spectrum","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Power Quality and Harmonics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computation; Interpolation (computer graphics); Series (stratigraphy); Spectrum (functional analysis); Fast Fourier transform; Plot (graphics); Fourier transform; Point (geometry); Algorithm; Discrete Fourier transform (general); Mathematics; Magnitude (astronomy); Computer science; Short-time Fourier transform; Mathematical analysis; Fourier analysis; Physics; Geometry; Artificial intelligence; Statistics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.04089034815527034,"gpt":0.2658374649650737,"spread":0.2249471168098034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001303858,0.0001514552,0.000225259,0.00003786464,0.0001273489,0.0001053686,0.0001319751,0.00006428084,0.00005358866],"category_scores_gemma":[0.000005487704,0.0001552634,0.0001045106,0.0002343,0.00004044663,0.0002590833,0.000006133469,0.0001924574,0.0000182032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005359005,"about_ca_system_score_gemma":0.00004170627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004337851,"about_ca_topic_score_gemma":0.000005164521,"domain_scores_codex":[0.9991164,0.000008533942,0.0002376226,0.0001680727,0.0001488148,0.0003205549],"domain_scores_gemma":[0.9997101,0.00003646373,0.0000276607,0.00005562792,0.00002299438,0.0001471692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002685169,0.00008199626,0.0001311189,0.003660825,0.0003107493,0.00003250898,0.009588853,0.5676731,0.03282321,0.0008372196,0.005347227,0.3792447],"study_design_scores_gemma":[0.0003651286,0.0000580199,0.00003091923,0.00006218046,0.00005358662,0.000003427151,0.0002602264,0.9411876,0.0439116,0.001782672,0.01203057,0.0002540518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005935378,0.000934452,0.987684,0.00171849,0.00004757959,0.0001251286,0.0000177921,0.0003943857,0.003142856],"genre_scores_gemma":[0.9983348,0.00000919021,0.0009168278,0.000451408,0.0002226367,0.00000299068,0.00001536218,0.00003573536,0.00001102038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9923995,"threshold_uncertainty_score":0.6331458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2259805550","doi":"10.1049/iet-spr.2013.0392","title":"Optimisation of multiple feature stream weights for distributed speech processing in mobile environments","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Discriminative model; Computer science; Speech recognition; Hidden Markov model; Word error rate; Mel-frequency cepstrum; Speech processing; Pattern recognition (psychology); Noise (video); Feature extraction; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02169400304218556,"gpt":0.2583754798393787,"spread":0.2366814767971931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494175,0.0002517189,0.0003235338,0.0001740801,0.0001621648,0.0002399643,0.000580223,0.0001567069,0.000002801421],"category_scores_gemma":[0.00009474912,0.0002317125,0.00006564282,0.0006121338,0.00007610537,0.001496299,0.0001167279,0.0001961652,0.000003224056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631607,"about_ca_system_score_gemma":0.0003045056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000792209,"about_ca_topic_score_gemma":0.000006770213,"domain_scores_codex":[0.9980593,0.0000408961,0.0004204339,0.0005485073,0.0004736715,0.0004571986],"domain_scores_gemma":[0.9990023,0.00007177074,0.000388092,0.0002187373,0.0001573183,0.0001617924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000115736,0.0004177537,0.005590632,0.0003498262,0.000009312313,0.00001683129,0.00261037,0.008545315,0.04073338,0.00001310338,0.0002367478,0.941361],"study_design_scores_gemma":[0.002931077,0.0003228011,0.0010098,0.00078409,0.00002283828,0.00002978756,0.0006819027,0.333689,0.6538183,0.004154497,0.001989436,0.0005664714],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2053636,0.002064088,0.7914725,0.0001846182,0.00007427476,0.0005537312,0.00002014859,0.0001093022,0.0001577213],"genre_scores_gemma":[0.8271569,0.00000474299,0.1724938,0.00004673323,0.00008350323,0.0000698431,0.0000549352,0.00001999134,0.00006951988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9407945,"threshold_uncertainty_score":0.9448961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158075440","doi":"10.1049/iet-spr.2012.0386","title":"Adaptive efficient sparse estimator achieving oracle properties","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Oracle; Penalty method; Estimator; Algorithm; Context (archaeology); Lasso (programming language); Mathematical optimization; Computer science; SIGNAL (programming language); Mean squared error; Function (biology); Signal reconstruction; Mathematics; Signal processing; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02499018661119706,"gpt":0.2120527107247888,"spread":0.1870625241135917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007910791,0.0002234525,0.0002042894,0.00008743973,0.0001917601,0.0002024062,0.0001722397,0.00007754667,0.00006659116],"category_scores_gemma":[0.00001242069,0.0001910688,0.00004889114,0.0001785467,0.0000737523,0.0002998745,0.00005507547,0.0002183973,0.0001408022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005521941,"about_ca_system_score_gemma":0.00003184937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003914896,"about_ca_topic_score_gemma":9.416938e-7,"domain_scores_codex":[0.998964,0.00002153308,0.0002266912,0.000221907,0.0002107916,0.0003551176],"domain_scores_gemma":[0.9995562,0.00002148622,0.00005031357,0.0001545333,0.0001276833,0.00008976951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002762701,0.0001020828,0.0002363833,0.0002066339,0.00005867549,0.00003133371,0.001277902,0.3731586,0.3370855,0.00009281848,0.00357018,0.2841522],"study_design_scores_gemma":[0.00009821061,0.00003624934,0.0003043865,0.0005013664,0.00001533983,0.00001673569,0.0002028259,0.8853124,0.1127368,0.0002610006,0.000222438,0.0002922848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7314637,0.00319849,0.2553551,0.00009752672,0.0001339234,0.0004870604,0.000001718092,0.002724463,0.006537963],"genre_scores_gemma":[0.9861236,0.000005671079,0.01354641,0.00005836103,0.0001091019,0.00004771735,0.000001232163,0.00006004081,0.00004790169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5121538,"threshold_uncertainty_score":0.7791561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1946870626","doi":"10.1049/iet-spr.2014.0347","title":"Incremental algorithm for finding principal curves","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Toronto Rehabilitation Institute","funders":"","keywords":"Algorithm; Dimensionality reduction; Principal component analysis; Data set; Set (abstract data type); Computer science; Representation (politics); Subspace topology; Principal (computer security); Curse of dimensionality; Sequence (biology); Mathematics; Pattern recognition (psychology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06069099336343595,"gpt":0.2922375499497396,"spread":0.2315465565863036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556765,0.0001323886,0.000180098,0.00007007913,0.0002530302,0.000297726,0.0004582823,0.00003786907,0.00001186721],"category_scores_gemma":[0.00003285205,0.0001182993,0.00007797147,0.0003379253,0.00003301694,0.0009068246,0.0001945894,0.00008898246,0.000009667093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005755943,"about_ca_system_score_gemma":0.0001451865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001482859,"about_ca_topic_score_gemma":0.000002485444,"domain_scores_codex":[0.9987437,0.00002270535,0.0002549887,0.0003226892,0.0003299116,0.000326059],"domain_scores_gemma":[0.9993627,0.00003563746,0.000156547,0.0001340594,0.0001729688,0.0001380642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004809341,0.00003444613,0.0001723967,0.00008577661,0.00001924489,0.000006180635,0.0006116594,0.000198298,0.0004841903,0.0003897295,0.001079194,0.9969141],"study_design_scores_gemma":[0.0003588629,0.0001226002,0.00004476001,0.0002209532,0.00002004711,0.0000210678,0.000187127,0.990944,0.002617029,0.001143946,0.004093211,0.0002264232],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002248245,0.001209781,0.9946332,0.0002624003,0.00008384799,0.0001315565,0.000003623195,0.0001202787,0.001307048],"genre_scores_gemma":[0.6470637,0.000004783067,0.3519816,0.0003664515,0.0002657426,0.000025053,0.000009860795,0.00001553386,0.0002673533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9966877,"threshold_uncertainty_score":0.4824107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W654790286","doi":"10.1049/iet-spr.2014.0173","title":"Mean angle of arrival, angular and Doppler spreads estimation in multiple‐input multiple‐output system","year":2015,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Estimator; Transmitter; Algorithm; Angle of arrival; MIMO; Direction of arrival; Mathematics; Gaussian; Rayleigh fading; Doppler effect; Computer science; Channel (broadcasting); Statistics; Control theory (sociology); Fading; Telecommunications; Physics; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.03512724157525543,"gpt":0.2685694669163852,"spread":0.2334422253411298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000785749,0.0001756452,0.0003224143,0.0003218285,0.00006577965,0.0001084237,0.0003697577,0.0001010643,0.000001162647],"category_scores_gemma":[0.0002191056,0.0001725224,0.00004033044,0.000598938,0.0001094503,0.001153953,0.0001372011,0.0001164597,0.000002395271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000102903,"about_ca_system_score_gemma":0.0001537636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002394553,"about_ca_topic_score_gemma":0.00002083702,"domain_scores_codex":[0.9983149,0.0001039909,0.0005547759,0.0003549602,0.0004664484,0.0002049182],"domain_scores_gemma":[0.9987351,0.0001420196,0.0003909635,0.0002674676,0.0003512149,0.0001132188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002181929,0.0007500685,0.05927733,0.004404977,0.00007467292,0.00005766733,0.02961823,0.05514958,0.07313593,0.009087007,0.0007737128,0.7674526],"study_design_scores_gemma":[0.0005515191,0.00009684932,0.001949218,0.0006240361,0.000009047059,0.00002940861,0.0002153433,0.9078103,0.08726633,0.001247188,0.00002585399,0.000174947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1565594,0.0003005359,0.8418555,0.00004825203,0.00007115198,0.0002789701,0.000003828107,0.0003076056,0.0005747981],"genre_scores_gemma":[0.7956179,0.000001235987,0.2043034,0.0000125852,0.00001761981,0.00001967113,0.000003638376,0.0000132991,0.00001063662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8526607,"threshold_uncertainty_score":0.7035257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021477173","doi":"10.1049/iet-spr.2019.0180","title":"Multiwindow discrete Gabor transform using parallel lattice structures","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Lattice (music); Gabor transform; Artificial intelligence; Gabor wavelet; Computer vision; Pattern recognition (psychology); Time–frequency analysis; Physics; Wavelet transform; Discrete wavelet transform; Acoustics; Wavelet","retraction":null,"screen_n_in":null,"score":{"opus":0.04766600184260269,"gpt":0.3129264739602221,"spread":0.2652604721176194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342394,0.0002824832,0.0003187773,0.00007308907,0.0004222826,0.000671047,0.000863777,0.0001043163,0.00003268378],"category_scores_gemma":[0.00004871067,0.000243447,0.0001218321,0.0006045111,0.00008576681,0.00150911,0.0001170701,0.0003576229,0.00001429603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003359281,"about_ca_system_score_gemma":0.0001969309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002283529,"about_ca_topic_score_gemma":8.661784e-7,"domain_scores_codex":[0.9979022,0.0001468236,0.0003694037,0.0005911484,0.0004859541,0.0005044805],"domain_scores_gemma":[0.9991655,0.0001026372,0.0001417353,0.0002084935,0.0001304485,0.0002511904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000275787,0.00005540832,0.0001277981,0.000525133,0.00006700991,0.000307387,0.01338577,0.01739348,0.2284073,0.003011717,0.000233784,0.7362095],"study_design_scores_gemma":[0.001192863,0.00011046,0.0001563647,0.0000977564,0.00004232247,0.0000549543,0.0001177453,0.941265,0.04437518,0.0108791,0.001194596,0.0005136449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006225322,0.0007933883,0.98966,0.001838125,0.00009194321,0.0001797573,0.000003518913,0.000264865,0.0009431324],"genre_scores_gemma":[0.5766842,0.000003024668,0.4214139,0.00162973,0.0002170117,0.000002894644,0.000001648596,0.00002039636,0.00002711223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238715,"threshold_uncertainty_score":0.9927481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943747788","doi":"10.1049/iet-spr.2018.5400","title":"Non‐linear Kalman filters comparison for generalised autoregressive conditional heteroscedastic clutter parameter estimation","year":2019,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Universidad Nacional de Cuyo; Universidad Nacional de La Plata; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Kalman filter; Autoregressive model; Heteroscedasticity; Invariant extended Kalman filter; Extended Kalman filter; Autoregressive conditional heteroskedasticity; Clutter; Mathematics; Computer science; Algorithm; Statistics; Econometrics; Radar","retraction":null,"screen_n_in":null,"score":{"opus":0.02513792227808843,"gpt":0.2920695900591675,"spread":0.2669316677810791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002018275,0.0002411899,0.0002957632,0.0001103879,0.0002844516,0.0005049803,0.0005434939,0.0001261806,0.00005975197],"category_scores_gemma":[0.00002724521,0.0002169921,0.0001082157,0.0001567717,0.00006627895,0.001212555,0.0001033407,0.0002200097,0.00008169291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004092041,"about_ca_system_score_gemma":0.00007291753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004549405,"about_ca_topic_score_gemma":6.675372e-7,"domain_scores_codex":[0.998131,0.00004405002,0.0004265983,0.000590956,0.0003903758,0.0004169851],"domain_scores_gemma":[0.9988128,0.0002870533,0.0002957865,0.0003164216,0.0001742502,0.0001136943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001962055,0.0003097473,0.004502429,0.0005251347,0.00008818555,0.00001917628,0.001760719,0.8554947,0.02038394,0.001998958,0.02777036,0.08695044],"study_design_scores_gemma":[0.0007810908,0.0001690664,0.0008742193,0.0001718728,0.00001871605,0.00001259825,0.00001458582,0.9907811,0.003740408,0.002252159,0.0008815833,0.0003025984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06940697,0.00006440908,0.9291779,0.00025938,0.0004631258,0.00035056,0.00003707361,0.0001748667,0.00006567731],"genre_scores_gemma":[0.777338,4.062678e-7,0.2212969,0.0006974797,0.0002007559,0.00004088587,0.0002605141,0.00002033688,0.0001447732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.707931,"threshold_uncertainty_score":0.8848681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081344000","doi":"10.1049/iet-spr.2011.0328","title":"Gaussian mixture model approximation of total spatial power spectral density for multiple incoherently distributed sources","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Gaussian; Spectral density; Covariance; Mixture model; Algorithm; Gaussian process; Mixture distribution; Probability density function; Mathematics; Computer science; Pattern recognition (psychology); Statistics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01184888878569443,"gpt":0.2396138188669634,"spread":0.2277649300812689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001736342,0.0001497431,0.0002271385,0.0001014155,0.0001219678,0.0001330666,0.0002937914,0.0001260777,0.00001228407],"category_scores_gemma":[0.0000752443,0.0001374148,0.00008493573,0.0002497819,0.00007359478,0.001011622,0.00007931042,0.0001288946,0.000001789662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004385609,"about_ca_system_score_gemma":0.0001079412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001381587,"about_ca_topic_score_gemma":0.000007810336,"domain_scores_codex":[0.9988104,0.00002980865,0.0003854058,0.0002741798,0.0002988873,0.0002012962],"domain_scores_gemma":[0.9989178,0.00006559003,0.0003839612,0.0001755937,0.0003937522,0.00006330568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002185396,0.001171124,0.006345944,0.001664173,0.000108446,0.000002109186,0.007532628,0.06665672,0.5630472,0.008021654,0.00167471,0.3435568],"study_design_scores_gemma":[0.0001855094,0.00007112045,0.001275979,0.00006861357,0.000006389117,0.000003142162,0.00002016182,0.7137063,0.2700077,0.01454163,0.000002147097,0.0001113372],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1750408,0.00001701539,0.8240705,0.0001195044,0.0000387445,0.0004040836,0.00001555728,0.000174527,0.0001193138],"genre_scores_gemma":[0.7801898,1.741963e-7,0.2196878,0.0000159036,0.00002336713,0.00004275061,0.00001856444,0.000009273907,0.00001240439],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6470495,"threshold_uncertainty_score":0.5603611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413061064","doi":"10.1049/sil2/7543401","title":"Automatic Epilepsy Seizure Classification Using EEG Signals Based on the CNN‐LSTM Model","year":2025,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Epilepsy; Electroencephalography; Computer science; Convolutional neural network; Artificial intelligence; Pattern recognition (psychology); Deep learning; Epileptic seizure; Gradient descent; Speech recognition; Artificial neural network; Neuroscience; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.07586318202429679,"gpt":0.3210713234522854,"spread":0.2452081414279886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901706,0.0002524334,0.0002206058,0.0001834384,0.0006849191,0.0004614545,0.0005742646,0.0001076475,0.00007904064],"category_scores_gemma":[0.0001865009,0.0001767611,0.00009273223,0.0006590143,0.000163743,0.0003174391,0.00006603607,0.0003569786,0.00002941495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008927746,"about_ca_system_score_gemma":0.0003389094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000329002,"about_ca_topic_score_gemma":4.877328e-7,"domain_scores_codex":[0.9979821,0.0002406916,0.0003933816,0.0005692083,0.0004505087,0.0003640918],"domain_scores_gemma":[0.9986033,0.0007146145,0.0002254995,0.0003098661,0.00008860732,0.0000580976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002939978,0.0001233407,0.00004611947,0.0001710785,0.000005098731,0.000005817776,0.0003640789,0.1538119,0.8242584,0.0009062974,0.001109526,0.01916895],"study_design_scores_gemma":[0.0001582197,0.0000322628,0.00006709399,0.0005659613,0.00001857926,0.000003187236,0.0000756495,0.7867569,0.2089841,0.003109001,0.00007570365,0.0001533956],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5630236,0.00007159377,0.426726,0.003769547,0.0001474793,0.0004154573,0.00000895429,0.0003071647,0.005530216],"genre_scores_gemma":[0.9901453,9.639122e-7,0.002251129,0.007164428,0.00005555028,0.00002616407,0.00000164731,0.00002438289,0.0003304827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.632945,"threshold_uncertainty_score":0.7208107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2338408058","doi":"10.1049/iet-spr.2015.0223","title":"Hierarchy precoder design for multi‐cell multiuser multiple‐input–multiple‐output wireless networks with interference alignment","year":2016,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Program for New Century Excellent Talents in University; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Precoding; Interference (communication); Base station; Zero-forcing precoding; Hierarchy; Transmitter power output; Interference alignment; Data stream mining; Key (lock); Data stream; Algorithm; MIMO; Transmitter; Telecommunications; Beamforming; Data mining; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02972702995818889,"gpt":0.2351097466068615,"spread":0.2053827166486726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000283772,0.0005180289,0.0004304515,0.0001352071,0.0002165202,0.0001248536,0.0003280675,0.0002175317,0.00001508464],"category_scores_gemma":[0.00004495183,0.0003761222,0.000078823,0.0002226552,0.0001002987,0.0008072748,0.00005236093,0.0002015151,0.00001263615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002691465,"about_ca_system_score_gemma":0.0000659629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006351073,"about_ca_topic_score_gemma":0.00002358396,"domain_scores_codex":[0.9977383,0.00007463431,0.0005749784,0.0006196453,0.0002298258,0.0007626215],"domain_scores_gemma":[0.99852,0.0005110297,0.0002079133,0.0002917748,0.0002718033,0.0001975008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002643215,0.00007794172,0.001163612,0.0003430753,0.00004733147,0.000004744558,0.0006843494,0.8947704,0.02801371,0.000001885584,0.0001685242,0.07446008],"study_design_scores_gemma":[0.003250201,0.0001410792,0.0000495528,0.001031327,0.00003622618,0.000008320011,0.000111471,0.9435609,0.05099349,0.00001482447,0.0001881882,0.0006144149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004659968,0.0006272066,0.9922998,0.00002296783,0.0001915478,0.001467178,0.00002282879,0.0006432706,0.00006522011],"genre_scores_gemma":[0.7721205,0.00003118065,0.2265616,0.00002913282,0.0001680854,0.0004689314,0.00001399708,0.0001722007,0.0004344285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7674605,"threshold_uncertainty_score":0.999869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058994495","doi":"10.1049/iet-spr.2010.0196","title":"Joint complex diversity coding and channel coding over space, time and frequency","year":2011,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Coding (social sciences); Space–time code; Coding gain; Joint (building); Variable-length code; Diversity scheme; Theoretical computer science; Mathematics; Block code; Fading; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05386931931262866,"gpt":0.2381931615353592,"spread":0.1843238422227306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001294795,0.0001537613,0.000183812,0.00009398215,0.0003539017,0.00004536017,0.0001295363,0.00006636869,0.00006122009],"category_scores_gemma":[0.000008843786,0.0001680931,0.0000185831,0.0001096518,0.0001109788,0.0004793971,0.0002714778,0.0001855459,0.000003909278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004464575,"about_ca_system_score_gemma":0.000006826592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003919204,"about_ca_topic_score_gemma":0.000004241528,"domain_scores_codex":[0.9993518,0.00001837326,0.000158002,0.0001682367,0.0001059304,0.0001976314],"domain_scores_gemma":[0.9996589,0.00002781929,0.00006219863,0.0001306186,0.00004230055,0.00007820371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004931351,0.0001091677,0.01154151,0.001517198,0.0001273923,0.00004564133,0.0198326,0.0007180182,0.8650049,0.003903079,0.001181355,0.09596984],"study_design_scores_gemma":[0.001202413,0.0001482913,0.04805587,0.001398701,0.00009299561,0.00008454914,0.000696625,0.7664318,0.1454228,0.03443436,0.000307533,0.001724085],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4639371,0.003329287,0.5062959,0.0001086021,0.00005598851,0.0004916306,0.00002872978,0.002547605,0.02320512],"genre_scores_gemma":[0.9798184,0.0001691696,0.01989461,0.00003752755,0.00002097742,0.000005146341,0.000004378305,0.0000273533,0.0000224275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7657138,"threshold_uncertainty_score":0.6854638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129052808","doi":"10.1049/sil2.12012","title":"On optimum multi‐input multi‐output radar signal design: Ambiguity function, manifold structure and duration‐bandwidth","year":2021,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Bandwidth (computing); Convex optimization; Mathematical optimization; Algorithm; Control theory (sociology); Regular polygon; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02201977373978155,"gpt":0.2281003762787936,"spread":0.206080602539012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000364235,0.0005506983,0.000515722,0.0001687014,0.0006899959,0.0006797639,0.000194844,0.0003142042,0.0001696786],"category_scores_gemma":[0.00004392184,0.0005286062,0.0001025915,0.0004739759,0.00007293049,0.0007518651,0.00005501057,0.0006038453,0.00001937058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001389658,"about_ca_system_score_gemma":0.0002095797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001727362,"about_ca_topic_score_gemma":0.00001963177,"domain_scores_codex":[0.997328,0.0001367788,0.0006950257,0.0006999415,0.0005510615,0.0005891492],"domain_scores_gemma":[0.998896,0.000117481,0.0001822864,0.000245527,0.0003042464,0.0002544841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000360509,0.0003298128,0.0009334268,0.00314458,0.0004297585,0.0005403671,0.002881679,0.3267518,0.358804,0.0002554859,0.003537869,0.3020308],"study_design_scores_gemma":[0.002545949,0.0002227579,0.001649068,0.0008987025,0.0001492712,0.0002769895,0.000460159,0.933872,0.05651095,0.001102307,0.001062088,0.001249744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04715666,0.005131334,0.9460641,0.00007237093,0.000375485,0.0003190042,0.00002982217,0.0005070565,0.0003441414],"genre_scores_gemma":[0.9680726,0.00001998581,0.03057944,0.000233909,0.0003951518,0.00001712441,0.00003971452,0.0001203718,0.0005217237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9209159,"threshold_uncertainty_score":0.9997165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133933847","doi":"10.1049/iet-spr.2010.0032","title":"Multirate recovery scheme for wide-band global navigation satellite system signals","year":2011,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"GNSS positioning and interference","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"GNSS applications; Galileo (satellite navigation); Computer science; Satellite system; Satellite; Focus (optics); SIGNAL (programming language); Orbit (dynamics); Scheme (mathematics); Remote sensing; Satellite navigation; Phase (matter); Amplitude; Real-time computing; Global Positioning System; Algorithm; Telecommunications; Physics; Geology; Mathematics; Aerospace engineering; Optics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02980593206957237,"gpt":0.2368320720285291,"spread":0.2070261399589567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001753813,0.000179052,0.0001761247,0.00003525292,0.0001396547,0.0001280659,0.0001247087,0.000105085,0.00001344446],"category_scores_gemma":[0.00001094706,0.0001799833,0.00006565855,0.0001441275,0.00003031781,0.0004478545,0.000008748802,0.0001042917,0.00004169863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001319982,"about_ca_system_score_gemma":0.00003212264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001640608,"about_ca_topic_score_gemma":0.000001484405,"domain_scores_codex":[0.9990583,0.00001819452,0.0002997619,0.0002159437,0.0001250504,0.0002827241],"domain_scores_gemma":[0.9995776,0.00003456893,0.00007722613,0.00009225003,0.0001437021,0.00007468792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009083226,0.0002740606,0.008628579,0.01288383,0.0004627936,0.00005004526,0.00634945,0.0228434,0.5774999,0.002048186,0.002336285,0.3657151],"study_design_scores_gemma":[0.001264163,0.0004426858,0.00201541,0.006496069,0.0001254423,0.00008090726,0.0007640067,0.4943907,0.4884537,0.003995127,0.0008028226,0.001168974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.363464,0.002249007,0.6021504,0.00001082609,0.0003850529,0.0003717983,0.0000515401,0.0009152002,0.03040216],"genre_scores_gemma":[0.9926052,0.00000685272,0.007104795,0.00002806974,0.00009840434,0.00004842089,0.00002903312,0.00002923509,0.00004996615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6291412,"threshold_uncertainty_score":0.7339507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4207075585","doi":"10.1049/sil2.12101","title":"Perfusion MRI in automatic classification of multiple sclerosis lesion subtypes","year":2022,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Lesion; Magnetic resonance imaging; Perfusion; Fluid-attenuated inversion recovery; Medicine; Segmentation; Multiple sclerosis; Pattern recognition (psychology); Hyperintensity; Artificial intelligence; Radiology; Computer science; Pathology","retraction":null,"screen_n_in":null,"score":{"opus":0.09418724323760255,"gpt":0.2799455117324607,"spread":0.1857582684948582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423625,0.00009944247,0.0001321415,0.0002247696,0.0004137706,0.0000396729,0.0002031097,0.0000373314,0.0002586084],"category_scores_gemma":[0.0001283824,0.0001027842,0.00004106488,0.0008501286,0.00007423645,0.0002373838,0.00006770703,0.0002248616,0.00001202504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001334477,"about_ca_system_score_gemma":0.00008766934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001799546,"about_ca_topic_score_gemma":0.000008219899,"domain_scores_codex":[0.9984424,0.0002562321,0.0003530318,0.0003475209,0.0004350548,0.0001658324],"domain_scores_gemma":[0.9993508,0.0001542965,0.0002793696,0.0001419863,0.00003670309,0.00003680192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003475147,0.0001432211,0.00152463,0.00005166822,2.830432e-7,8.742281e-7,0.0006030085,0.000678303,0.9108883,0.00007861289,0.0000474171,0.08594891],"study_design_scores_gemma":[0.000457508,0.00008690731,0.07268651,0.00008095636,0.000004888386,0.000009634925,0.001012345,0.5429037,0.3820617,0.0002793149,0.0002790782,0.0001375046],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9956069,0.00005174696,0.00275905,0.0005625417,0.00008669868,0.000220023,0.000005313002,0.0001107172,0.0005970233],"genre_scores_gemma":[0.9994504,0.00001060519,0.0002018024,0.0001401338,0.00001594098,0.00007304016,0.000004628312,0.00001706519,0.00008640971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5422253,"threshold_uncertainty_score":0.4191419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2551618634","doi":"10.1049/iet-spr.2016.0151","title":"Guest Editorial","year":2016,"lang":"en","type":"editorial","venue":"IET Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Provisioning; Software deployment; Wireless network; Heterogeneous network; Wireless; Mobile broadband; Cellular network; Interoperability; Radio resource management; Telecommunications; Distributed computing; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.005122501110519507,"gpt":0.239947220118216,"spread":0.2348247190076965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0002312495,0.0004863789,0.000491566,0.0001506601,0.00013006,0.0001750203,0.0003473536,0.001326465,0.00003522717],"category_scores_gemma":[0.0001739365,0.0004367401,0.00008821419,0.0001826592,0.00005099747,0.0005856546,0.00004620099,0.0007908967,0.0001860576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003465689,"about_ca_system_score_gemma":0.0002422968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003797014,"about_ca_topic_score_gemma":0.000003026616,"domain_scores_codex":[0.9977707,0.00002884973,0.0005191377,0.0004329294,0.0007677172,0.0004806439],"domain_scores_gemma":[0.9987473,0.0002518107,0.0001949194,0.0002443324,0.0004412055,0.0001204295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001394137,0.000006094715,3.546689e-7,0.0006053005,0.00002321583,0.000005576439,0.00005556436,0.006359778,0.0008198436,7.797599e-7,0.9881992,0.003910318],"study_design_scores_gemma":[0.0004274766,0.00002456583,2.776196e-8,0.001123825,0.00003663585,0.000001284617,0.000007477609,0.00210559,0.0005234201,0.0001081743,0.9950793,0.0005621611],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[3.231411e-7,0.001055461,0.1496034,0.000004275653,0.8453944,0.0001690963,0.0001014509,0.0008658213,0.002805794],"genre_scores_gemma":[0.0005179356,0.00007872949,0.0008623509,0.000002232494,0.9972059,0.0000596399,0.0002186997,0.0002631949,0.0007912894],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1518115,"threshold_uncertainty_score":0.99997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390966193","doi":"10.1049/2024/6666549","title":"MsDC‐DEQ‐Net: Deep Equilibrium Model (DEQ) with Multiscale Dilated Convolution for Image Compressive Sensing (CS)","year":2024,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block (permutation group theory); Algorithm; Residual; Compressed sensing; Iterative reconstruction; Iterative method; Sampling (signal processing); Convolution (computer science); Artificial intelligence; Computation; Artificial neural network; Mathematics; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01447177058378035,"gpt":0.242695486108969,"spread":0.2282237155251887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117301,0.000382426,0.0003466952,0.0001623475,0.0001813458,0.0004149799,0.0001599515,0.0001746589,0.000009326351],"category_scores_gemma":[0.000009803312,0.0003487572,0.0001019275,0.0002906967,0.0001350178,0.000678453,0.00005216973,0.0003438932,0.00001050279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011442,"about_ca_system_score_gemma":0.00007281731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001557027,"about_ca_topic_score_gemma":0.000008623009,"domain_scores_codex":[0.9983614,0.0000241058,0.0003392951,0.0004750734,0.0002583626,0.0005417719],"domain_scores_gemma":[0.999282,0.0001015335,0.00006907947,0.0002040143,0.0002329158,0.000110449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000898568,0.00002185709,0.000006785588,0.0005266417,0.00009219703,0.00009178968,0.0006751168,0.3206153,0.6399602,0.00004731157,0.001700541,0.03617237],"study_design_scores_gemma":[0.0003028699,0.00005417858,0.00000778875,0.001085482,0.00008673218,0.00006555072,0.00005282142,0.8110973,0.1848803,0.001705002,0.000255777,0.00040616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06718858,0.002835804,0.9250036,0.0000694968,0.0001339114,0.0004561032,0.0000273199,0.002712358,0.001572829],"genre_scores_gemma":[0.9397081,0.00001267761,0.05968963,0.00005565854,0.0002113094,0.00002284549,0.00005110486,0.0001571644,0.0000914937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8725196,"threshold_uncertainty_score":0.9998965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3165838274","doi":"10.1049/sil2.12046","title":"Sensor fusion with high‐order moments constraints using projection‐based neural network","year":2021,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Sensor fusion; Gaussian; Moment (physics); Computer science; Wireless sensor network; Fusion; Artificial neural network; Projection (relational algebra); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02525139603234954,"gpt":0.2572707327974981,"spread":0.2320193367651486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002487228,0.0002740544,0.0002647065,0.00008873116,0.000746877,0.000630774,0.0003698211,0.0001196254,0.000113446],"category_scores_gemma":[0.00001969122,0.0002352687,0.00005190592,0.001429839,0.0001440553,0.0006738981,0.0001750747,0.0003568351,0.00001024897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005783419,"about_ca_system_score_gemma":0.0004579846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002301188,"about_ca_topic_score_gemma":0.000005745119,"domain_scores_codex":[0.9975861,0.0001583084,0.0003438268,0.0007319807,0.0005822599,0.0005975695],"domain_scores_gemma":[0.9986696,0.00009985772,0.000218047,0.0003806961,0.0004834924,0.0001483073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001096197,0.0003186823,0.003894704,0.0001842686,0.00005378001,0.0007967591,0.0004509109,0.68871,0.01907651,0.0003954163,0.00122304,0.2847863],"study_design_scores_gemma":[0.0008433863,0.00008247681,0.0004392386,0.0004837868,0.00002748549,0.0002732445,0.00008586982,0.9919133,0.004492074,0.0002600151,0.0006795697,0.0004195814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07876498,0.0002638617,0.9192325,0.0003447861,0.0004901107,0.0001681197,0.00000682168,0.000354753,0.0003740569],"genre_scores_gemma":[0.7053977,0.000003101095,0.2934339,0.0006813298,0.0003446916,0.000005975741,0.00002751952,0.00002512111,0.00008071313],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6266327,"threshold_uncertainty_score":0.9593978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998992100","doi":"10.1049/iet-spr.2013.0019","title":"Application of the Mittag–Leffler expansion to sampling discontinuous signals","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sampling (signal processing); Computer science; Applied mathematics; Mathematics; Algorithm; Filter (signal processing); Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01076656400847545,"gpt":0.2259864580818911,"spread":0.2152198940734156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001509678,0.0001096222,0.0001508427,0.00005390943,0.00009611892,0.0001011565,0.00017763,0.00005154753,0.00002828265],"category_scores_gemma":[0.00001397534,0.00008151711,0.00005458376,0.0002429486,0.00001618281,0.0002984104,0.00002618342,0.00008042189,0.00005818793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003245966,"about_ca_system_score_gemma":0.00001405199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001371747,"about_ca_topic_score_gemma":0.00001109244,"domain_scores_codex":[0.9991378,0.00001831895,0.0003282378,0.0001577097,0.0001934437,0.0001645537],"domain_scores_gemma":[0.9995174,0.00002810523,0.00008937418,0.0001918405,0.0001243275,0.00004893584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001961522,0.000009477732,0.0003225671,0.0001028619,0.000006190635,2.787318e-8,0.0003635667,0.02097839,0.7738784,0.00001491392,0.0003150257,0.2040066],"study_design_scores_gemma":[0.0005970196,0.00004533608,0.05198164,0.0009232713,0.00006725579,0.000006178637,0.0008727738,0.7328213,0.2022827,0.002618165,0.007107207,0.0006771782],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4251957,0.0004631831,0.5726103,0.0002306289,0.0001188358,0.0007006851,0.000003033281,0.000113612,0.0005640785],"genre_scores_gemma":[0.9990385,0.000001483684,0.0004677099,0.0000360889,0.000134285,0.0001490113,0.000002876961,0.00002451853,0.0001455343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.711843,"threshold_uncertainty_score":0.3324171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388662267","doi":"10.1049/2023/6610762","title":"Preset Conditional Generative Adversarial Network for Massive MIMO Detection","year":2023,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; MIMO; Detector; Channel (broadcasting); Noise (video); SIGNAL (programming language); Detection theory; Artificial intelligence; Signal-to-noise ratio (imaging); Algorithm; Artificial neural network; Pattern recognition (psychology); Speech recognition; Telecommunications; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03912166990310937,"gpt":0.2836421454314026,"spread":0.2445204755282932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382052,0.0001586947,0.0001518184,0.0001395281,0.0006154059,0.000291757,0.0003549766,0.0001102152,0.00001765669],"category_scores_gemma":[0.00006012763,0.0001632736,0.00007625884,0.0008452607,0.00005963349,0.001008472,0.00007824833,0.0001279313,0.00006132181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009958034,"about_ca_system_score_gemma":0.0001927758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003859648,"about_ca_topic_score_gemma":0.000006292889,"domain_scores_codex":[0.9983651,0.00008870299,0.000296268,0.0004949128,0.0003960391,0.0003589478],"domain_scores_gemma":[0.9989104,0.0002724358,0.0002402239,0.0001644451,0.0003281735,0.00008436968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001555034,0.00007253532,0.000200925,0.000125818,0.00007145741,0.00001117898,0.001361085,0.6922075,0.09856018,0.02861335,0.01496057,0.1636599],"study_design_scores_gemma":[0.0004759533,0.00007671699,0.001552458,0.00003198383,0.00001004895,0.00000338209,0.00003842725,0.9284445,0.01495288,0.05268252,0.001535045,0.0001961035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003978152,0.00003837769,0.993338,0.001230227,0.0003786386,0.0004215755,0.00002592221,0.0004240577,0.0001650062],"genre_scores_gemma":[0.9713157,0.000001284985,0.02664353,0.0001824104,0.001214683,0.0002505552,0.0001720474,0.00001913572,0.0002006135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9673376,"threshold_uncertainty_score":0.6658103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}