{"meta":{"query_hash":"d5fc8012e5c0","filters":{"venue":"Signal Processing"},"cohort_total":111,"direct_labels_cover":0,"predictions_cover":111,"exported":111,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d5fc8012e5c0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Signal+Processing"},"results":[{"id":"W1521144119","doi":"10.5772/8529","title":"New Trends in Biologically-Inspired Audio Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Speech coding; Speech recognition; Codebook; Auditory masking; Coding (social sciences); Audio signal; Lossless compression; Neural coding; Masking (illustration); Data compression; Artificial intelligence; Mathematics","score_opus":0.03561951384583587,"score_gpt":0.2800878518970018,"score_spread":0.24446833805116594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521144119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015119897,0.0003246148,0.59619504,0.0006163824,0.00007248815,0.000098928096,0.0000014265248,0.0005865482,0.40208942],"genre_scores_gemma":[0.21260329,0.0000637614,0.4162701,0.0021404945,0.00071306055,0.000023206883,0.000053629432,0.00011533673,0.36801714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981941,0.000028201415,0.00047017622,0.0006743473,0.00033059102,0.00030256654],"domain_scores_gemma":[0.99903095,0.000052343785,0.00035711305,0.00034269146,0.00009026426,0.00012664721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004378577,0.00034775338,0.00040293153,0.00062215497,0.00012774197,0.00038739195,0.001002916,0.00065409363,0.00028316712],"category_scores_gemma":[0.000013091785,0.00031561643,0.00011694824,0.00020331136,0.00007299753,0.00047424214,0.0002633865,0.0010660733,0.00004230048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006551172,0.000010953369,0.000008500856,0.000020227522,0.0000062691624,0.000031917978,0.00042897326,0.0000066590364,0.0038858273,0.13171461,0.0005354744,0.863344],"study_design_scores_gemma":[0.0010405729,0.00048433334,0.0002692203,0.0017574915,0.000036956095,0.000094936484,0.000011068699,0.0130600035,0.016974766,0.6151342,0.3484426,0.0026938205],"about_ca_topic_score_codex":0.000012714273,"about_ca_topic_score_gemma":0.000038142138,"teacher_disagreement_score":0.86065024,"about_ca_system_score_codex":0.00007113302,"about_ca_system_score_gemma":0.00031314185,"threshold_uncertainty_score":0.9999296},"labels":[],"label_agreement":null},{"id":"W1963864898","doi":"10.1016/j.sigpro.2004.05.008","title":"A method of extraction of nonstationary sinusoids","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Nonlinear system; Uniqueness; Mathematical proof; Algorithm; Amplitude; Differential equation; Noise immunity; Software; Noise (video); Signal processing; Computer science; Control theory (sociology); Nonlinear dynamical systems; Mathematics; Mathematical analysis; Digital signal processing; Artificial intelligence; Physics","score_opus":0.010625686555681755,"score_gpt":0.2664970338967838,"score_spread":0.25587134734110206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963864898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07355444,0.0006564586,0.92397547,0.000015820211,0.000044969784,0.00007192385,0.0000029022494,0.000043913577,0.0016341296],"genre_scores_gemma":[0.9839227,0.0000028427949,0.0159979,0.0000017018177,0.000035680896,0.000005200847,0.0000035273206,0.000008533419,0.000021894684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954474,0.0000093007375,0.00022435733,0.000059483355,0.00010584903,0.000056287045],"domain_scores_gemma":[0.9997613,0.000018935172,0.00007614587,0.000044152726,0.0000853358,0.000014164115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014484941,0.000045906945,0.00009622507,0.00006998307,0.000021354175,0.000008977465,0.000033900928,0.000030255855,0.000012241765],"category_scores_gemma":[0.000005538838,0.000047031634,0.000027510318,0.00013682318,0.0000115532575,0.00019309651,0.0000027339956,0.0000408765,0.000002240131],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006129446,0.000016772286,0.00003970419,0.0002735387,0.000008814125,4.1162656e-7,0.00034610805,0.0736366,0.7878339,0.00021433922,0.000009675524,0.13761397],"study_design_scores_gemma":[0.0013061811,0.00008187861,0.009806528,0.00081371877,0.00007663531,0.000050512237,0.0008750512,0.2688972,0.7087774,0.008425023,0.00058383925,0.00030598041],"about_ca_topic_score_codex":0.000039040126,"about_ca_topic_score_gemma":0.000004675091,"teacher_disagreement_score":0.91036826,"about_ca_system_score_codex":0.000029359373,"about_ca_system_score_gemma":0.000034731638,"threshold_uncertainty_score":0.19178943},"labels":[],"label_agreement":null},{"id":"W1967568565","doi":"10.1016/j.sigpro.2004.10.005","title":"Aggregation of color and shape features for hybrid query generation in content based visual information retrieval","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Feature (linguistics); Content-based image retrieval; Precision and recall; Image retrieval; Ground truth; Segmentation; Pattern recognition (psychology); Visual Word; Fuzzy logic; Information retrieval; Content (measure theory); Computer vision; Data mining; Image (mathematics); Mathematics","score_opus":0.03160332932031044,"score_gpt":0.2723456777036463,"score_spread":0.24074234838333589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967568565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15863489,0.00018717274,0.84042805,0.00038735042,0.000018840403,0.00027203455,0.0000026005819,0.00005048334,0.000018576744],"genre_scores_gemma":[0.96846294,0.0000065447925,0.031269543,0.00018113716,0.000024847146,0.000017406019,0.000027839225,0.0000032252628,0.0000065377153],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929035,0.000019512634,0.00027275106,0.00013258631,0.00018172445,0.0001031057],"domain_scores_gemma":[0.99941534,0.000028772312,0.00019956233,0.000056173463,0.00027411978,0.00002600988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003247101,0.00007590783,0.000102588274,0.00014549172,0.000083569175,0.00014380082,0.00010451128,0.000045557354,0.0000010103148],"category_scores_gemma":[0.000074719734,0.000069433525,0.00002321743,0.00023704758,0.00003948442,0.0013342401,0.000019083387,0.000058918744,3.9656405e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015025734,0.000082357765,0.000116578805,0.00026150217,0.000003571803,9.3466946e-7,0.00046465083,0.0002941288,0.3302907,0.004387995,0.000019320283,0.663928],"study_design_scores_gemma":[0.00045958353,0.00012650629,0.00054204854,0.00007787337,0.000002470534,0.0000027735343,0.00003392258,0.37926266,0.6186649,0.0007398629,0.000021682912,0.00006571963],"about_ca_topic_score_codex":0.000009089806,"about_ca_topic_score_gemma":0.0000020460338,"teacher_disagreement_score":0.80982804,"about_ca_system_score_codex":0.00006636307,"about_ca_system_score_gemma":0.0001827949,"threshold_uncertainty_score":0.2831417},"labels":[],"label_agreement":null},{"id":"W1968598997","doi":"10.1016/j.sigpro.2007.05.001","title":"A novel efficient two-phase algorithm for training interpolation radial basis function networks","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Radial basis function; Interpolation (computer graphics); Algorithm; Basis (linear algebra); Radial basis function network; Computer science; Phase (matter); Function (biology); Basis function; Mathematics; Artificial intelligence; Artificial neural network; Physics; Mathematical analysis; Geometry","score_opus":0.03175908120931126,"score_gpt":0.3014459874021143,"score_spread":0.26968690619280306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968598997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015839456,0.00009474587,0.9822994,0.000027001412,0.00039177205,0.0002338614,0.000007736344,0.000055887544,0.0010501462],"genre_scores_gemma":[0.98367345,1.7430816e-7,0.013191763,0.00008493329,0.0028459392,0.000015980528,0.000067699206,0.00002500962,0.000095051946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989564,0.0000122599995,0.0002830529,0.0002673593,0.0001301735,0.0003507906],"domain_scores_gemma":[0.99953717,0.000060572635,0.00015301329,0.000059230115,0.00008314735,0.00010685539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037513825,0.00015240438,0.00014696443,0.000083657746,0.00031486963,0.00009528466,0.000060893828,0.0000472518,0.00011450575],"category_scores_gemma":[0.0000014734438,0.00014751779,0.00010714918,0.0001909379,0.000034146058,0.0001502787,0.000013489304,0.00018321519,0.0000018044615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014258487,0.00014951374,0.000012211216,0.0000053335293,0.000018024411,2.2397055e-7,0.00030233528,0.03313671,0.0038901502,0.00051947474,0.00005191683,0.96177155],"study_design_scores_gemma":[0.0018496043,0.00011432803,0.000011360865,0.000050983,0.0000398248,0.0000026310913,0.0007414664,0.9951235,0.001294812,0.00025730324,0.00034602097,0.0001681795],"about_ca_topic_score_codex":0.000012820602,"about_ca_topic_score_gemma":0.0000010107619,"teacher_disagreement_score":0.9691076,"about_ca_system_score_codex":0.000026756203,"about_ca_system_score_gemma":0.00004769038,"threshold_uncertainty_score":0.60156006},"labels":[],"label_agreement":null},{"id":"W1969025618","doi":"10.1016/j.sigpro.2007.08.011","title":"On approximation of smooth functions from samples of partial derivatives with application to phase unwrapping","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; Army Research Office; Multidisciplinary University Research Initiative; National Institutes of Health","keywords":"Subspace topology; Linear subspace; Mathematics; Bivariate analysis; Invariant (physics); Projection (relational algebra); Applied mathematics; Invariant subspace; Operator (biology); Deconvolution; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.04535854535043788,"score_gpt":0.30430499059565014,"score_spread":0.25894644524521226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969025618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.174423,0.0000135112505,0.824085,0.000058619407,0.000007744062,0.00014928359,0.0000016716543,0.000062600666,0.0011985834],"genre_scores_gemma":[0.9105524,2.071611e-7,0.0893649,0.0000362233,0.000022355445,0.000014312692,0.000003918105,0.000003964241,0.0000017378985],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991893,0.000015310945,0.0002371801,0.00019497353,0.00024708745,0.00011615663],"domain_scores_gemma":[0.99941486,0.00007545348,0.00015594393,0.00012868021,0.00018382508,0.00004125111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025336072,0.000078526384,0.00011664828,0.00011315092,0.000058951406,0.000033172597,0.00019326396,0.00002773607,0.000006423841],"category_scores_gemma":[0.000028889708,0.00006269288,0.000017957533,0.0003682818,0.000049500042,0.00031752785,0.000025894418,0.000057102807,0.0000014200388],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013626477,0.00020411726,0.00029783312,0.000034710356,0.000008423953,1.392916e-7,0.0008545885,0.0001050501,0.62880725,0.010663531,0.000007665843,0.35888046],"study_design_scores_gemma":[0.00025114056,0.0007363422,0.0012099723,0.0002983258,0.00000837028,1.653324e-7,0.00016473248,0.017451596,0.97331977,0.0064187767,0.000036341862,0.000104466475],"about_ca_topic_score_codex":0.00002197687,"about_ca_topic_score_gemma":0.000003961841,"teacher_disagreement_score":0.7361294,"about_ca_system_score_codex":0.000019983967,"about_ca_system_score_gemma":0.000038687707,"threshold_uncertainty_score":0.25565413},"labels":[],"label_agreement":null},{"id":"W1975836707","doi":"10.1016/j.sigpor.2006.04.009","title":"Perturbative corrections to stochastic resonant quantizers","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"stochastic dynamics and bifurcation","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Probability density function; Perturbation (astronomy); Limit (mathematics); Bounded function; Signal-to-noise ratio (imaging); Statistical physics; Function (biology); Noise (video); Applied mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics; Computer science","score_opus":0.008019037480059542,"score_gpt":0.24363851735773312,"score_spread":0.23561947987767357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975836707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03896218,0.000037076938,0.9525445,0.00015479412,0.00011638203,0.00015715878,0.000014940909,0.000039760038,0.0079731755],"genre_scores_gemma":[0.9967405,2.120239e-8,0.0014904251,0.00004554932,0.00053519034,0.000034063458,0.000031827232,0.000015356622,0.0011070321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925804,0.000011345904,0.00016195451,0.0002137439,0.00014508117,0.00020982903],"domain_scores_gemma":[0.9996473,0.000044691093,0.00007185875,0.00006731211,0.0001117529,0.000057039226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071253635,0.000115345174,0.00010634318,0.000076816876,0.00026321795,0.00008865459,0.00007759895,0.000020359697,0.0000780678],"category_scores_gemma":[0.0000047566386,0.00010314258,0.000043386863,0.0002664665,0.000030125146,0.000091541064,0.00002173276,0.00009324599,0.0000453854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001551952,0.00063779106,0.005800747,0.000045916135,0.00006787654,0.000002443209,0.002852699,0.103873156,0.027361276,0.102021776,0.004846185,0.75233495],"study_design_scores_gemma":[0.0008406703,0.00021118663,0.0074501857,0.00033604767,0.00009702848,0.0000033746026,0.0031365738,0.92385095,0.0011041148,0.060086895,0.0020396416,0.000843305],"about_ca_topic_score_codex":0.00034999975,"about_ca_topic_score_gemma":0.000010346583,"teacher_disagreement_score":0.95777833,"about_ca_system_score_codex":0.000035204986,"about_ca_system_score_gemma":0.00008590141,"threshold_uncertainty_score":0.42060322},"labels":[],"label_agreement":null},{"id":"W1979837465","doi":"10.1016/j.sigpro.2014.06.003","title":"A low-complexity variable forgetting factor constant modulus RLS algorithm for blind adaptive beamforming","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Department of Education of Zhejiang Province; National Natural Science Foundation of China","keywords":"Recursive least squares filter; Constant (computer programming); Adaptive beamformer; Beamforming; Algorithm; Mathematics; Computational complexity theory; Convexity; Mean squared error; Variable (mathematics); Adaptive filter; Control theory (sociology); Computer science; Mathematical optimization; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.03330700995063559,"score_gpt":0.26197600450083147,"score_spread":0.22866899455019588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979837465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031220978,0.00011554293,0.99334246,0.00000914945,0.00012302582,0.0005324035,0.00007912517,0.0012215782,0.0014546426],"genre_scores_gemma":[0.4615593,0.0000013133865,0.5380407,0.000025802276,0.00018213964,0.000080331905,0.000008924759,0.00006868758,0.0000328098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983109,0.00002321565,0.00040830087,0.00039197903,0.00021936889,0.00064619095],"domain_scores_gemma":[0.9992109,0.00017075382,0.00013656553,0.00017820994,0.00018901532,0.00011453698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003240675,0.0003470612,0.0003885843,0.00013252691,0.00031363158,0.00010135551,0.00024259843,0.00012829967,0.000015851312],"category_scores_gemma":[0.00007787283,0.00035839705,0.00008087022,0.0002303624,0.00011358266,0.00064283394,0.00007437775,0.00029018006,0.000002259927],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005309839,0.000040339615,0.000008440197,0.0005294469,0.000042797277,0.0000027696387,0.00033780845,0.00666824,0.08815311,0.00427092,0.00006813675,0.8998249],"study_design_scores_gemma":[0.0005127029,0.000113276175,0.0000064618653,0.00042984905,0.000017364053,0.00000903978,0.00006133721,0.8243322,0.1100029,0.063085645,0.0009776464,0.00045157492],"about_ca_topic_score_codex":0.0000058112896,"about_ca_topic_score_gemma":0.0000024324015,"teacher_disagreement_score":0.8993733,"about_ca_system_score_codex":0.00019146435,"about_ca_system_score_gemma":0.0000574234,"threshold_uncertainty_score":0.9998868},"labels":[],"label_agreement":null},{"id":"W1980550929","doi":"10.1016/j.sigpro.2014.08.030","title":"Whole-body humanoid robot imitation with pose similarity evaluation","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Humanoid robot; Imitation; Artificial intelligence; Similarity (geometry); Robot; Computer vision; Computer science; Metric (unit); Pose; Discriminative model; Motion (physics); Focus (optics); Motion capture; Human–robot interaction; Engineering; Psychology","score_opus":0.028771235658491393,"score_gpt":0.2759096306882519,"score_spread":0.24713839502976054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980550929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050674915,0.000049549075,0.94242525,0.0004942098,0.00007480148,0.00018072,5.3148324e-7,0.00018188283,0.0059181526],"genre_scores_gemma":[0.9878747,5.5408026e-7,0.011358309,0.00042687618,0.00019920278,0.000022811017,0.000024545752,0.000009859624,0.00008313971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.00013279349,0.00017976332,0.0003312976,0.00049038825,0.00018795425],"domain_scores_gemma":[0.99918866,0.000041040137,0.00015587306,0.00015433502,0.00039904338,0.00006106231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736972,0.00012142997,0.00010442857,0.00011640597,0.00038896315,0.00040226974,0.00020843284,0.000051971965,0.00004667115],"category_scores_gemma":[0.000026595546,0.00010552582,0.000027812555,0.00026231087,0.000034207522,0.0014350312,0.00003183267,0.00013947705,0.00007320915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021470098,0.00011393894,0.00013203951,0.000073456744,0.000011989556,0.000002400959,0.0009071674,0.0028900004,0.0614514,0.0012559089,0.00028569665,0.93285453],"study_design_scores_gemma":[0.00092802057,0.0002744145,0.006235648,0.00016511025,0.00004476568,0.00001730592,0.000070489776,0.9463234,0.02180459,0.02288693,0.0009155764,0.00033375272],"about_ca_topic_score_codex":0.0000043394166,"about_ca_topic_score_gemma":0.0000060035386,"teacher_disagreement_score":0.9434334,"about_ca_system_score_codex":0.000049988612,"about_ca_system_score_gemma":0.00013255634,"threshold_uncertainty_score":0.43032178},"labels":[],"label_agreement":null},{"id":"W1981622420","doi":"10.1016/j.sigpro.2005.08.007","title":"Decorrelating bootstrap equalizer for time-variation suppression of MIMO channel","year":2005,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"MIMO; Adaptive equalizer; Bit error rate; Channel (broadcasting); Equalizer; Computer science; Equalization (audio); Control theory (sociology); Decorrelation; Algorithm; Mathematics; Electronic engineering; Engineering; Telecommunications; Artificial intelligence","score_opus":0.023844071416772573,"score_gpt":0.2925714144759504,"score_spread":0.26872734305917784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981622420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007604023,0.00089866726,0.9890684,0.000049545717,0.00002287343,0.00021929793,0.000006682803,0.00047480612,0.0016557404],"genre_scores_gemma":[0.8932382,0.000015120474,0.10647523,0.000015928936,0.000074791154,0.000050431972,0.000018819608,0.000038814283,0.00007271164],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.000017900062,0.00033437752,0.00011750916,0.00011771435,0.00017040799],"domain_scores_gemma":[0.99947655,0.000110677036,0.0001289059,0.00014946304,0.00010177548,0.000032604574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018397793,0.00011773457,0.0001546604,0.00008821401,0.000098071294,0.000020605952,0.00016333113,0.00009084467,0.00003702963],"category_scores_gemma":[0.000030548825,0.00012387254,0.00004375372,0.00012573972,0.000023270355,0.0004390594,0.000027539141,0.000116776144,0.0000053064455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023145918,0.000036797628,0.00001949141,0.00035885218,0.000013769093,1.1504308e-7,0.0012943068,0.17897868,0.4450207,0.00025871492,0.00034200738,0.3736534],"study_design_scores_gemma":[0.0001805148,0.000018755101,0.00003623834,0.00022713938,0.000008595101,9.800631e-7,0.00003400383,0.73642594,0.26035556,0.001878041,0.000705316,0.00012890922],"about_ca_topic_score_codex":0.0000012764876,"about_ca_topic_score_gemma":6.7991675e-7,"teacher_disagreement_score":0.8856341,"about_ca_system_score_codex":0.000049105172,"about_ca_system_score_gemma":0.000018487044,"threshold_uncertainty_score":0.50513756},"labels":[],"label_agreement":null},{"id":"W1982312956","doi":"10.1016/j.sigpro.2012.06.021","title":"A multilevel structural technique for fingerprint representation and matching","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fingerprint (computing); Minutiae; Matching (statistics); Pattern recognition (psychology); Benchmark (surveying); Computer science; Fingerprint recognition; Artificial intelligence; Representation (politics); Feature (linguistics); Byte; Mathematics; Statistics","score_opus":0.046674102078890736,"score_gpt":0.3292503450890316,"score_spread":0.2825762430101409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982312956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028870532,0.0002602015,0.9703047,0.00014183168,0.000076631564,0.0002027346,0.0000012666617,0.00006790213,0.00007418324],"genre_scores_gemma":[0.7973707,8.577768e-7,0.20245552,0.000055000615,0.00004901599,0.000032205877,0.0000020313835,0.000003505833,0.000031208972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993879,0.000021170103,0.00013260082,0.0001781054,0.00011677644,0.0001634393],"domain_scores_gemma":[0.9996377,0.000054922766,0.00008260063,0.00009717089,0.00006994489,0.000057655525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003465358,0.000061806306,0.00006663052,0.00012836224,0.00020540698,0.00021224984,0.00015903346,0.00003928203,0.000003899283],"category_scores_gemma":[0.000033973236,0.000056402834,0.000020726618,0.0002628611,0.000022511884,0.00080535637,0.00007566812,0.00006402949,0.0000014625945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074657037,0.000026722995,0.0013739252,0.00016116309,0.000005709072,4.6027125e-7,0.0057405457,0.000009176257,0.104511075,0.0133596435,0.000055897803,0.87474823],"study_design_scores_gemma":[0.0008696287,0.000053431748,0.061357975,0.00015537775,0.000022192075,0.0001617036,0.0005324364,0.5049192,0.32095772,0.10859583,0.0016224362,0.0007520917],"about_ca_topic_score_codex":0.00001608705,"about_ca_topic_score_gemma":4.747273e-7,"teacher_disagreement_score":0.87399614,"about_ca_system_score_codex":0.000020361083,"about_ca_system_score_gemma":0.000026368594,"threshold_uncertainty_score":0.23000409},"labels":[],"label_agreement":null},{"id":"W1983760178","doi":"10.1016/j.sigpro.2003.06.001","title":"Complex Daubechies wavelets: properties and statistical image modelling","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wavelet; Context (archaeology); Representation (politics); Computer science; Artificial intelligence; Pattern recognition (psychology); Algorithm; Focus (optics); Wavelet transform; Mathematics","score_opus":0.08077974115554895,"score_gpt":0.28721952361052266,"score_spread":0.2064397824549737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983760178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003480975,0.0010541752,0.99129647,0.00015364407,0.00003496604,0.00009167191,0.000001282282,0.0001336422,0.003753144],"genre_scores_gemma":[0.51455104,0.0000063583484,0.48514557,0.00017399239,0.000021279588,0.000003473157,7.324036e-7,0.000009908258,0.00008766304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00021319055,0.00025242087,0.00041079786,0.0002846984,0.00036338752],"domain_scores_gemma":[0.9994284,0.000101308586,0.000067383626,0.00016638833,0.00013100843,0.00010553728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539292,0.0001810677,0.00021373149,0.00009096348,0.00042802616,0.0007598282,0.00026845143,0.00004804172,0.000021552605],"category_scores_gemma":[0.000062561485,0.00014814909,0.000025455862,0.00022483438,0.00019482708,0.00092117506,0.00008916896,0.000188058,0.000011301681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007564782,0.00017390012,0.000083520164,0.0007464673,0.000038656177,0.00022388941,0.005559152,0.002772512,0.2873688,0.09723607,0.0006138337,0.60510755],"study_design_scores_gemma":[0.0004306053,0.00006689433,0.00003860865,0.00010967942,0.000012667465,0.00011977984,0.00012549011,0.927095,0.02563829,0.044766173,0.0012560079,0.00034081328],"about_ca_topic_score_codex":0.000012219993,"about_ca_topic_score_gemma":4.184464e-7,"teacher_disagreement_score":0.9243225,"about_ca_system_score_codex":0.00002038354,"about_ca_system_score_gemma":0.00012136785,"threshold_uncertainty_score":0.7327041},"labels":[],"label_agreement":null},{"id":"W1983852521","doi":"10.1016/j.sigpro.2013.11.007","title":"Fast image enhancement in compressed wavelet domain","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wavelet; Artificial intelligence; Computer science; Computer vision; Compressed sensing; Wavelet transform; Stationary wavelet transform; Image quality; Noise (video); Image (mathematics); Wavelet packet decomposition; Mathematics; Algorithm","score_opus":0.014818736558259733,"score_gpt":0.2680393405517997,"score_spread":0.25322060399353996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983852521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024239566,0.00025875983,0.96583796,0.0005958509,0.00007019142,0.00021546737,3.1998493e-7,0.00009378967,0.008688123],"genre_scores_gemma":[0.5953071,0.0000018927625,0.40377855,0.00051393977,0.0000559193,0.00003244215,0.0000013922397,0.000010711703,0.00029806877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982357,0.00017484663,0.00034082017,0.00042925397,0.00034948555,0.00046991237],"domain_scores_gemma":[0.99932593,0.000077615034,0.00010820748,0.0002592877,0.0001350693,0.0000938717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057632936,0.00018286656,0.00022320861,0.00015911058,0.00015967026,0.00068578124,0.0007017195,0.000056277153,0.00016993473],"category_scores_gemma":[0.000015465172,0.00016375199,0.000045810404,0.0004961594,0.00007099258,0.0014828272,0.00019662616,0.00022431153,0.00019714152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008749998,0.00009531464,0.00003700539,0.000066850116,0.0000042299703,0.000046861147,0.001451912,0.000042134492,0.4881207,0.00046495465,0.00051706354,0.50914425],"study_design_scores_gemma":[0.0029840164,0.00022108112,0.0028505584,0.0005765659,0.000008376282,0.000050068225,0.00037306672,0.45668682,0.44252354,0.090894714,0.0017493601,0.001081822],"about_ca_topic_score_codex":0.000065376866,"about_ca_topic_score_gemma":0.0000019282577,"teacher_disagreement_score":0.5710675,"about_ca_system_score_codex":0.000057777725,"about_ca_system_score_gemma":0.00009777626,"threshold_uncertainty_score":0.6677612},"labels":[],"label_agreement":null},{"id":"W1985319438","doi":"10.1016/s0165-1684(00)00139-0","title":"Sensor array signal tracking using a data-driven window approach","year":2000,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Window (computing); Sensor array; SIGNAL (programming language); Computer science; Tracking (education); Real-time computing; Artificial intelligence","score_opus":0.06725814964956589,"score_gpt":0.3071153046183793,"score_spread":0.23985715496881344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985319438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014650257,0.00011705248,0.9779901,0.000045920635,0.000031468957,0.00019611462,0.000006390369,0.00052748545,0.00643519],"genre_scores_gemma":[0.57618296,0.0000015385492,0.42362934,0.00004866952,0.00007190102,0.00000423213,0.000007690066,0.000015070217,0.000038581067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997976,0.00010205764,0.00044902667,0.0006262512,0.0005182566,0.00032841464],"domain_scores_gemma":[0.99887824,0.00006367903,0.0002507712,0.00054158905,0.00017297316,0.00009274354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004965586,0.00020797964,0.00027661046,0.00018201658,0.00027919916,0.00037446863,0.0012499449,0.0000902358,0.00009603185],"category_scores_gemma":[0.000022976872,0.00020519375,0.000057878253,0.000761707,0.00011154195,0.0025898563,0.0001251936,0.00022100934,0.000011801864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017076673,0.00015692282,0.00019482322,0.00017659324,0.000022416789,0.000008230321,0.0011177986,0.018089877,0.0941791,0.00023905929,0.000051297586,0.8857468],"study_design_scores_gemma":[0.00016767907,0.000037756105,0.00010766434,0.00021059107,0.000019722707,0.00007916127,0.00004264398,0.9238605,0.07374302,0.0012113177,0.00024802808,0.00027193507],"about_ca_topic_score_codex":0.000037370402,"about_ca_topic_score_gemma":6.5659185e-7,"teacher_disagreement_score":0.9057706,"about_ca_system_score_codex":0.000057981382,"about_ca_system_score_gemma":0.00023899031,"threshold_uncertainty_score":0.8367558},"labels":[],"label_agreement":null},{"id":"W1988838366","doi":"10.1016/j.sigpro.2006.11.001","title":"On the adaptive linear estimators, using biased Cramér–Rao bound","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Estimator; Cramér–Rao bound; Mathematics; Algorithm; Computer science; Statistics; Applied mathematics","score_opus":0.03617379225947152,"score_gpt":0.2838124885625061,"score_spread":0.24763869630303462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988838366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032087613,0.000063736654,0.96355796,0.00018365905,0.00006130279,0.00016156062,0.0000015225172,0.00035010575,0.0035325577],"genre_scores_gemma":[0.82556355,3.1191706e-7,0.17420045,0.00012415319,0.000055498695,0.000008270655,9.552236e-7,0.000012678865,0.000034124205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987689,0.00006979142,0.0002891255,0.00027512608,0.0003912835,0.00020574778],"domain_scores_gemma":[0.9990402,0.0002277827,0.0002546063,0.000238293,0.00020407552,0.000035057066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038340912,0.00014829742,0.00014911756,0.00013848217,0.00034423443,0.00022645062,0.00047131345,0.000056898054,0.000013452576],"category_scores_gemma":[0.000073275376,0.000111979745,0.000054893215,0.00063441566,0.00012810864,0.0005808703,0.000077014374,0.00015499373,0.000009968877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012361466,0.0008343708,0.00058789714,0.0003131987,0.000063464846,0.000049433645,0.0016164675,0.10692758,0.09796018,0.42956042,0.0036124943,0.35835087],"study_design_scores_gemma":[0.00007680697,0.000064857384,0.00008379456,0.00021111575,0.0000064755172,0.000007731769,0.00001212853,0.82272345,0.117875926,0.058731765,0.00007292304,0.00013301196],"about_ca_topic_score_codex":0.00014542855,"about_ca_topic_score_gemma":0.000002663678,"teacher_disagreement_score":0.7934759,"about_ca_system_score_codex":0.00007007863,"about_ca_system_score_gemma":0.00020520928,"threshold_uncertainty_score":0.45664015},"labels":[],"label_agreement":null},{"id":"W1997332416","doi":"10.1016/j.sigpro.2008.01.014","title":"Extrapolated impulse response filter using coefficient-autocorrelation-matrix decomposition","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Finite impulse response; Stopband; Autocorrelation matrix; Mathematics; Algorithm; Passband; Impulse response; Infinite impulse response; Chebyshev filter; Autocorrelation; Low-pass filter; Ripple; Side lobe; Digital filter; Extrapolation; Elliptic filter; Filter (signal processing); Prototype filter; Computer science; Mathematical analysis; Statistics; Electronic engineering; Physics; Engineering; Band-pass filter; Telecommunications","score_opus":0.04048491393066182,"score_gpt":0.32463455237703004,"score_spread":0.2841496384463682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997332416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28318062,0.00008608042,0.7159674,0.00007413356,0.00007663395,0.00017956784,0.0000022877398,0.0001707814,0.00026247776],"genre_scores_gemma":[0.96450526,0.000001022388,0.035066735,0.00018231153,0.000046227025,0.00000771729,0.000014046813,0.000015648357,0.00016103352],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984504,0.00013156593,0.00036729837,0.00036713315,0.00035796035,0.0003256232],"domain_scores_gemma":[0.99928105,0.00010147438,0.00017145615,0.00018704528,0.00015502142,0.00010397892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031992584,0.00016859871,0.00013516,0.00024123804,0.0005109299,0.000365037,0.0003271472,0.000057696718,0.00003897574],"category_scores_gemma":[0.000019109546,0.00016902578,0.00006189832,0.00067559275,0.000054952543,0.0022763845,0.00008128082,0.000112809976,0.00003980648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077157567,0.00042426924,0.002196929,0.00009072323,0.000041916974,0.00026446304,0.008616061,0.029313637,0.74884444,0.0011489596,0.00097401283,0.20731302],"study_design_scores_gemma":[0.0005825452,0.0001477555,0.0024420023,0.00008573148,0.000008809366,0.00030211345,0.00004290894,0.9795747,0.015498595,0.00073166436,0.00029192583,0.00029127684],"about_ca_topic_score_codex":0.000009667024,"about_ca_topic_score_gemma":2.693313e-7,"teacher_disagreement_score":0.95026106,"about_ca_system_score_codex":0.00010462178,"about_ca_system_score_gemma":0.00023328229,"threshold_uncertainty_score":0.6892671},"labels":[],"label_agreement":null},{"id":"W1999008170","doi":"10.1016/j.sigpro.2010.06.018","title":"On the practical realization of higher-order filters with fractional stepping","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Control Systems Design","field":"Engineering","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Transfer function; Band-pass filter; Integer (computer science); Butterworth filter; Realization (probability); Filter (signal processing); Order (exchange); Fractional calculus; Prototype filter; Low-pass filter; Network synthesis filters; Spice; Operator (biology); Applied mathematics; Control theory (sociology); Topology (electrical circuits); Computer science; Electronic engineering; Combinatorics; Engineering","score_opus":0.012947749935186752,"score_gpt":0.25071757474780154,"score_spread":0.2377698248126148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999008170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013086243,0.00005148102,0.9781688,0.00025283257,0.0001431664,0.00018524136,0.0000018773925,0.00014651967,0.007963843],"genre_scores_gemma":[0.9960815,5.59587e-7,0.0035801188,0.0000690249,0.00013958813,0.000022284727,0.000002674027,0.000030028987,0.000074244235],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.000025497753,0.00016792087,0.00011689249,0.00025319736,0.00014376715],"domain_scores_gemma":[0.9993777,0.0002741406,0.00009034448,0.000110204666,0.000115547664,0.000032049655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014946073,0.000107271975,0.000110210174,0.000042530934,0.000090744084,0.00003732859,0.000069241534,0.000058768343,0.00010289698],"category_scores_gemma":[0.000052362004,0.000072029376,0.000016205744,0.0001922772,0.000052908348,0.00027447141,0.000005616369,0.00030854318,0.000006902966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026790096,0.0000790883,0.00022202695,0.0003647236,0.00013156368,0.00001722497,0.00050560007,0.39201152,0.51786166,0.061839473,0.0013520342,0.02534721],"study_design_scores_gemma":[0.0018016688,0.00033098218,0.0013446988,0.0009232267,0.00011214056,0.00011428716,0.00045105847,0.9291955,0.039099924,0.015242321,0.010499956,0.00088420353],"about_ca_topic_score_codex":0.0000035545752,"about_ca_topic_score_gemma":0.0000035029725,"teacher_disagreement_score":0.9829952,"about_ca_system_score_codex":0.000025075848,"about_ca_system_score_gemma":0.000049353668,"threshold_uncertainty_score":0.29372728},"labels":[],"label_agreement":null},{"id":"W1999575913","doi":"10.1016/j.sigpro.2013.06.026","title":"Integrated track initialization and maintenance in heavy clutter using probabilistic data association","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Initialization; Clutter; Computer science; Probabilistic logic; Track (disk drive); Data association; Algorithm; Track-before-detect; Joint (building); Artificial intelligence; Real-time computing; Radar; Engineering","score_opus":0.042737294454844775,"score_gpt":0.2687423709661339,"score_spread":0.22600507651128912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999575913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09150166,0.00022535148,0.90690416,0.0005542806,0.00014407,0.00025811116,0.000009668635,0.00013913999,0.00026357907],"genre_scores_gemma":[0.95375305,0.00000940139,0.045682177,0.00036467524,0.0000799613,0.000006745339,0.000055916855,0.000010905699,0.000037137423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985726,0.00011392214,0.0003204681,0.000468649,0.00022945416,0.00029490134],"domain_scores_gemma":[0.99917996,0.0001108659,0.00017625147,0.00029456476,0.00018230252,0.00005604319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053649844,0.00012577343,0.00015002725,0.00009474609,0.00014418589,0.0006281311,0.00047487672,0.00009814049,0.000023127332],"category_scores_gemma":[0.00017510491,0.0001113239,0.000010065781,0.000510806,0.00003565305,0.002126623,0.00023016463,0.00022070116,0.000010282207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004136957,0.0002983306,0.02785345,0.000383294,0.000023764214,0.000038935224,0.0030982955,0.014314124,0.0080683455,0.0015435317,0.008931984,0.9354046],"study_design_scores_gemma":[0.00022673063,0.000013678747,0.002246389,0.00025890954,0.000004803194,0.000012144884,0.00005378622,0.99270785,0.00011614193,0.003777107,0.0004268509,0.00015561537],"about_ca_topic_score_codex":0.00020860252,"about_ca_topic_score_gemma":0.000032600292,"teacher_disagreement_score":0.97839373,"about_ca_system_score_codex":0.00010741746,"about_ca_system_score_gemma":0.000093815404,"threshold_uncertainty_score":0.60570824},"labels":[],"label_agreement":null},{"id":"W2000798228","doi":"10.1016/j.sigpro.2007.12.014","title":"Estimation of the instantaneous amplitude and frequency of non-stationary short-time signals","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Electrical Measurement Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec","funders":"","keywords":"Amplitude; Instantaneous phase; Speech recognition; Time–frequency analysis; Acoustics; Computer science; Mathematics; Algorithm; Telecommunications; Physics; Optics","score_opus":0.015406427748663932,"score_gpt":0.24276644715568302,"score_spread":0.22736001940701908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000798228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187974,0.0010839739,0.4784748,0.000010877569,0.000009566085,0.00021339516,0.0000046590208,0.00014245402,0.001262863],"genre_scores_gemma":[0.9784349,0.000018749639,0.021495521,0.0000091341535,0.000009198121,0.000008402957,0.0000018331021,0.000016337379,0.0000058974833],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999293,0.000012786293,0.0002583521,0.00009295816,0.0002293692,0.000113488495],"domain_scores_gemma":[0.99971676,0.000047963615,0.00006007507,0.000074133735,0.00007764068,0.000023416764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007921835,0.000093351584,0.00014367723,0.00005607173,0.00006734194,0.000004888334,0.000090751615,0.00004261643,0.000008047984],"category_scores_gemma":[0.00002758916,0.0000762142,0.000023108492,0.00024996273,0.000088158005,0.00017413513,0.000013023235,0.000096540534,4.786094e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059354775,0.000019801817,0.0005918497,0.00020971702,0.000010825246,0.0000032518253,0.0002288339,0.033110682,0.8463566,0.00002301254,0.000021194151,0.1194183],"study_design_scores_gemma":[0.000106127765,0.00007563283,0.0031701038,0.00030955375,0.000020044052,0.000049011585,0.000012529404,0.3285,0.6609734,0.006610828,0.0000041038716,0.00016863899],"about_ca_topic_score_codex":0.00000305663,"about_ca_topic_score_gemma":4.268912e-7,"teacher_disagreement_score":0.4596375,"about_ca_system_score_codex":0.000038570543,"about_ca_system_score_gemma":0.000037719143,"threshold_uncertainty_score":0.3107925},"labels":[],"label_agreement":null},{"id":"W2002910452","doi":"10.1016/j.sigpro.2013.08.015","title":"Combined cubature Kalman and smooth variable structure filtering: A robust nonlinear estimation strategy","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ford Motor Company (Canada); McMaster University","funders":"","keywords":"Kalman filter; Robustness (evolution); Control theory (sociology); Nonlinear system; Mathematics; Gaussian; State variable; Algorithm; Computer science; Statistics; Artificial intelligence","score_opus":0.013241088544759801,"score_gpt":0.22237898423095623,"score_spread":0.20913789568619642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002910452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04503848,0.0003174903,0.95298696,0.00027095847,0.0001452988,0.00019570143,0.000010908597,0.00030512598,0.00072910683],"genre_scores_gemma":[0.6728747,0.0000033456759,0.32671857,0.00016542326,0.00010286866,0.000005093195,0.000037067784,0.000012772443,0.00008018103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987449,0.000038841023,0.00023351389,0.00042918246,0.00023758961,0.0003159912],"domain_scores_gemma":[0.99930406,0.000052284264,0.00012731894,0.0002569447,0.0001348716,0.00012454484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011204776,0.00019289584,0.00017401602,0.00007279596,0.00033446035,0.0010204689,0.00040692257,0.00014034458,0.00013904698],"category_scores_gemma":[0.000016870457,0.00016412392,0.000019168878,0.0003481693,0.000052390773,0.001290562,0.00016337699,0.00031584507,0.00001052423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025153873,0.000103529026,0.0004448974,0.0003799197,0.000023473009,0.00002175929,0.00089510425,0.28184682,0.021280656,0.0056293136,0.0050054896,0.6843439],"study_design_scores_gemma":[0.00027587972,0.0000705429,0.00074672495,0.00012345792,0.0000067331184,0.000022756802,0.00003701635,0.98977613,0.00047831,0.007787885,0.00045398055,0.00022060216],"about_ca_topic_score_codex":0.000040526567,"about_ca_topic_score_gemma":0.0000014646995,"teacher_disagreement_score":0.70792925,"about_ca_system_score_codex":0.000015713229,"about_ca_system_score_gemma":0.00007232958,"threshold_uncertainty_score":0.9840405},"labels":[],"label_agreement":null},{"id":"W2010243737","doi":"10.1016/j.sigpro.2008.05.006","title":"Low-cost modifications of Rao-Blackwellized particle filters for improved speech denoising","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle filter; Noise reduction; Speech recognition; Particle (ecology); Computer science; Artificial intelligence; Biology; Kalman filter","score_opus":0.0378160765145632,"score_gpt":0.27238952375904324,"score_spread":0.23457344724448004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010243737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11065552,0.00037603534,0.887666,0.00044668652,0.00005909223,0.00037824255,0.000004815703,0.00015580599,0.00025785042],"genre_scores_gemma":[0.8277017,0.000010874382,0.17180796,0.00019659946,0.000078028286,0.000040298524,0.000004423758,0.000019306719,0.00014083167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983492,0.000030717823,0.0004565064,0.00045785675,0.00022793208,0.00047778097],"domain_scores_gemma":[0.9987905,0.000119053824,0.00030569985,0.00031084113,0.00033886367,0.0001350105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124941,0.00018577377,0.00026687322,0.00010168888,0.00056067377,0.00017141247,0.0006404999,0.0000700468,0.000010221349],"category_scores_gemma":[0.00008359716,0.00017883019,0.00010913987,0.00063611695,0.00015200606,0.0010040519,0.00008401371,0.00012239264,0.000009475973],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046039408,0.00013042612,0.00014306074,0.0001562799,0.000012522031,0.0000052771798,0.0010765633,0.00041945375,0.63739204,0.00011268441,0.00018186308,0.36032376],"study_design_scores_gemma":[0.00076010666,0.000045641453,0.00009523427,0.00011414812,0.000011764015,0.000030841707,0.00006253597,0.1412329,0.85545814,0.001795962,0.00018314907,0.0002096138],"about_ca_topic_score_codex":0.000007139902,"about_ca_topic_score_gemma":0.0000018832849,"teacher_disagreement_score":0.71704614,"about_ca_system_score_codex":0.000047551624,"about_ca_system_score_gemma":0.0003384566,"threshold_uncertainty_score":0.72924834},"labels":[],"label_agreement":null},{"id":"W2012011201","doi":"10.1016/j.sigpro.2013.11.023","title":"A local fingerprinting approach for audio copy detection","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Music and Audio Processing","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Identification (biology); Scale-invariant feature transform; Artificial intelligence; Pattern recognition (psychology); Speech recognition; Representation (politics); Change detection; Audio signal processing; Spectrogram; Computer vision; Audio signal; Image (mathematics); Speech coding","score_opus":0.017282948304352886,"score_gpt":0.2316316978101526,"score_spread":0.2143487495057997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012011201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039766873,0.00024933286,0.99175274,0.00022601252,0.00006947435,0.0002934324,2.1047242e-7,0.0002887131,0.0031433965],"genre_scores_gemma":[0.7722088,5.1370506e-7,0.22687405,0.00051586796,0.00015071228,0.00011048894,0.0000011717888,0.000014992357,0.0001233766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851924,0.000025978621,0.0002700816,0.0005011137,0.00024068939,0.00044291606],"domain_scores_gemma":[0.9992782,0.000055857112,0.00018300606,0.00016861268,0.0002176264,0.000096724376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462872,0.00017477738,0.00018153299,0.000096690375,0.0005647375,0.00073160324,0.0004712101,0.00008701488,0.000017411541],"category_scores_gemma":[0.000027599974,0.00015812361,0.000072027055,0.0003899002,0.000080236365,0.0013553402,0.00013017311,0.00017575789,0.000023787743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003904616,0.000029015484,0.000042309704,0.0002204272,0.0000049367145,5.6419174e-7,0.00047347395,0.0008436294,0.017147865,0.00022263922,0.00020694178,0.98080426],"study_design_scores_gemma":[0.000261096,0.000044495206,0.00010307287,0.00008369203,0.0000068516015,0.00001993093,0.00013043084,0.9388098,0.055188663,0.0045145205,0.00058559515,0.00025183597],"about_ca_topic_score_codex":0.000019730378,"about_ca_topic_score_gemma":6.7075774e-7,"teacher_disagreement_score":0.98055243,"about_ca_system_score_codex":0.000055294877,"about_ca_system_score_gemma":0.0001267625,"threshold_uncertainty_score":0.70548666},"labels":[],"label_agreement":null},{"id":"W2012307835","doi":"10.1016/j.sigpro.2005.06.023","title":"Identification of acoustic MIMO systems: Challenges and opportunities","year":2005,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"MIMO; Identification (biology); Signal processing; Computer science; Impulse (physics); Impulse response; Channel (broadcasting); System identification; Acoustics; Speech recognition; Electronic engineering; Telecommunications; Engineering; Digital signal processing; Mathematics; Physics; Data mining","score_opus":0.05560432141391625,"score_gpt":0.263150511456428,"score_spread":0.20754619004251174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012307835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039906614,0.11485957,0.84032995,0.0019126801,0.00009548501,0.00013369568,0.0000015742581,0.00020905027,0.0025513612],"genre_scores_gemma":[0.99503213,0.0006124244,0.0040217396,0.000059625745,0.00010640698,0.0000066892576,4.924914e-7,0.0000073199412,0.00015317592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990645,0.00002938475,0.00029377954,0.00023546883,0.00020922693,0.00016763223],"domain_scores_gemma":[0.9993923,0.000037173908,0.00023097535,0.00013290142,0.00014663905,0.000060017912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003726374,0.000098203214,0.00014232776,0.00011047922,0.00012294532,0.00021039051,0.00026476668,0.000043207114,0.000001799411],"category_scores_gemma":[0.00001560617,0.00009082892,0.000017092743,0.00008741611,0.00006967114,0.0010838833,0.000065290435,0.00006497486,0.0000031995514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022054858,0.000022141961,0.000007572399,0.000496737,0.00000509293,0.0000028623867,0.0014248635,0.00032194768,0.05476703,0.00094561453,0.000017378814,0.94198656],"study_design_scores_gemma":[0.0007024903,0.00015539993,0.00071144715,0.001653694,0.00006180753,0.00022302021,0.004844562,0.51225066,0.4705129,0.005845215,0.0022506518,0.00078815955],"about_ca_topic_score_codex":0.000001101577,"about_ca_topic_score_gemma":0.0000010915647,"teacher_disagreement_score":0.9551255,"about_ca_system_score_codex":0.000016746726,"about_ca_system_score_gemma":0.00009746897,"threshold_uncertainty_score":0.3703896},"labels":[],"label_agreement":null},{"id":"W2017793876","doi":"10.1016/j.sigpro.2013.12.032","title":"Recursive hidden input estimation in nonlinear dynamic systems with varying amounts of a priori knowledge","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University; Microsoft Research","keywords":"A priori and a posteriori; Nonlinear system; Estimator; Computer science; Residual; Bayesian probability; Algorithm; Bayes estimator; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.005656454738410073,"score_gpt":0.22776831952580986,"score_spread":0.2221118647873998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017793876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6525496,0.0022502565,0.33450106,0.000015753125,0.00035666794,0.0006103391,0.000004709784,0.00037478798,0.009336786],"genre_scores_gemma":[0.99867266,0.0000022540191,0.0011453009,0.0000033031745,0.000057276917,0.000030615374,0.0000044574867,0.000032165248,0.000051940373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912673,0.00004886692,0.00032398244,0.00015560037,0.00015766844,0.00018712522],"domain_scores_gemma":[0.9996322,0.000044298653,0.00010111502,0.000093604154,0.000085690546,0.00004311523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024164213,0.00014139382,0.00025660777,0.00018133972,0.000046478788,0.000054655717,0.000091201364,0.000080420206,0.0000024501219],"category_scores_gemma":[0.000019327028,0.00012721763,0.000022632777,0.0003406891,0.00002400938,0.00022429273,0.000008660252,0.00015510642,0.000012616798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013678396,0.00008213208,0.000780678,0.0040863,0.000067146204,0.0000073094043,0.0046903687,0.62853765,0.04574986,0.00005694763,0.000014653259,0.3157902],"study_design_scores_gemma":[0.00064244965,0.00006561175,0.00013010237,0.0011475926,0.0000130972985,0.000014219937,0.00017061726,0.9962891,0.001219942,0.00004142609,0.000113683775,0.00015217117],"about_ca_topic_score_codex":0.000043630986,"about_ca_topic_score_gemma":0.000040439372,"teacher_disagreement_score":0.36775145,"about_ca_system_score_codex":0.00012458216,"about_ca_system_score_gemma":0.000045691562,"threshold_uncertainty_score":0.51877844},"labels":[],"label_agreement":null},{"id":"W2018204386","doi":"10.1016/s0165-1684(02)00382-1","title":"Computational load reduction of fast convergence algorithms for multichannel active noise control","year":2002,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; Convergence (economics); Reduction (mathematics); Recursive least squares filter; Active noise control; Adaptive filter; Computational complexity theory; Noise (video); Computer science; Noise reduction; Mathematics; Artificial intelligence","score_opus":0.024550406817236328,"score_gpt":0.25698718624358663,"score_spread":0.2324367794263503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018204386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074587846,0.00027994873,0.9913538,0.000018037357,0.00008345525,0.0002732886,0.00005339606,0.0003019364,0.00017735583],"genre_scores_gemma":[0.9043337,0.000005643962,0.095435366,0.0000073158876,0.00009339566,0.00005741653,0.0000059481144,0.000028007405,0.000033226657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992895,0.000008509232,0.00020822028,0.00016056118,0.00015934567,0.00017385828],"domain_scores_gemma":[0.9995056,0.000046829726,0.00008069636,0.000054859403,0.0002730312,0.000038994538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006094303,0.00013520733,0.00016961308,0.000059002294,0.00006765969,0.000012401386,0.00008495404,0.000051781226,0.00003147988],"category_scores_gemma":[0.000018554289,0.00014277415,0.000044987817,0.000110714274,0.000069827736,0.00030392196,0.000009782264,0.00009463365,0.000003463258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005905152,0.000051345003,0.0000073038573,0.00029231905,0.000040298317,0.0000013562001,0.0011629829,0.619017,0.1729119,0.00007184806,0.00013152674,0.20625308],"study_design_scores_gemma":[0.00043978923,0.00005552457,0.000038812945,0.00010932718,0.000012651584,0.000006524718,0.00010495016,0.90211046,0.09512455,0.0017771594,0.00007649234,0.00014374948],"about_ca_topic_score_codex":0.0000021187343,"about_ca_topic_score_gemma":1.7764128e-7,"teacher_disagreement_score":0.8968749,"about_ca_system_score_codex":0.000106033105,"about_ca_system_score_gemma":0.000015378664,"threshold_uncertainty_score":0.5822161},"labels":[],"label_agreement":null},{"id":"W2021090852","doi":"10.1016/s0165-1684(02)00479-6","title":"Dynamics in high-dimensional model gene networks","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria","funders":"","keywords":"Attractor; Ordinary differential equation; Boolean network; Product (mathematics); Binary number; Function (biology); Set (abstract data type); Gene regulatory network; Mathematics; Boolean function; Boolean model; Class (philosophy); Dynamical systems theory; Statistical physics; Differential equation; Computer science; Topology (electrical circuits); Biological system; Gene; Algorithm; Physics; Discrete mathematics; Biology; Mathematical analysis; Artificial intelligence; Combinatorics; Genetics","score_opus":0.006683575202701154,"score_gpt":0.21715248840478948,"score_spread":0.21046891320208833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021090852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7795766,0.0023636096,0.21739171,0.000040211366,0.000030127532,0.000068266454,0.000002138132,0.000011836225,0.0005154663],"genre_scores_gemma":[0.9926487,0.000018505969,0.006594409,0.00017368815,0.000101016616,0.000008575677,0.000095778574,0.00002904787,0.00033026573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.000059655133,0.00022302513,0.00036739293,0.00014697538,0.00031659153],"domain_scores_gemma":[0.9996024,0.0000043207892,0.0000784107,0.0001714426,0.00006762404,0.000075810036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024954812,0.00016071113,0.00015950146,0.00006108871,0.00009464555,0.000026381818,0.000112922644,0.00016373683,0.000015017928],"category_scores_gemma":[0.000010068543,0.00016392836,0.00006808229,0.00020722237,0.00005125384,0.000005295229,0.00004454721,0.00011680467,0.000002459931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021168666,0.00003852626,0.0028763425,0.000008117663,0.000019991912,0.000004551343,0.000005238397,0.95568246,0.037088774,0.00020336943,0.00007421987,0.003977247],"study_design_scores_gemma":[0.00031426875,0.000025745752,0.00019254691,0.000015671434,0.000022280668,0.000012347269,0.000014976765,0.9792275,0.01887469,0.001035542,0.000050104063,0.00021434261],"about_ca_topic_score_codex":0.0000058556775,"about_ca_topic_score_gemma":0.0000704834,"teacher_disagreement_score":0.21307208,"about_ca_system_score_codex":0.000060839528,"about_ca_system_score_gemma":0.00015716525,"threshold_uncertainty_score":0.66848046},"labels":[],"label_agreement":null},{"id":"W2030364295","doi":"10.1016/j.sigpro.2008.09.006","title":"Particle-method-based formulation of risk-sensitive filter","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Russian Science Foundation; Commonwealth Scholarship Commission","keywords":"Particle filter; Algorithm; Robustness (evolution); Gaussian; Parametric statistics; Probabilistic logic; Computer science; Benchmark (surveying); Nonlinear system; Range (aeronautics); Mathematical optimization; Mathematics; Filter (signal processing); Artificial intelligence; Engineering; Statistics","score_opus":0.029370305437797693,"score_gpt":0.27074250745106576,"score_spread":0.24137220201326806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030364295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10222131,0.0000988299,0.8971428,0.000055363224,0.000053013922,0.000052047475,0.0000052410714,0.00011115483,0.0002601857],"genre_scores_gemma":[0.77279854,0.0000032901044,0.22701378,0.000103836224,0.00005601607,0.0000017032193,0.0000053107274,0.0000063082584,0.000011198179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988715,0.00011437047,0.00026016936,0.00026481546,0.0002781222,0.00021099497],"domain_scores_gemma":[0.99902534,0.00030282655,0.00021445012,0.000216182,0.00018015441,0.000061055296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003358937,0.000102610364,0.00014575233,0.00005667422,0.00026866232,0.00004410395,0.00023007287,0.00005664755,0.000015356254],"category_scores_gemma":[0.000053164014,0.00009023764,0.000053842687,0.0003683058,0.000047334834,0.0004572926,0.000056270714,0.00014156377,0.000010755799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110359324,0.00020358671,0.012849831,0.000084407286,0.00001753689,0.00006335717,0.004424676,0.13509984,0.013377137,0.0024227116,0.0005818625,0.8307647],"study_design_scores_gemma":[0.00027878306,0.00003718551,0.006211436,0.00006171822,0.000006628246,0.000017018203,0.000019343937,0.9210533,0.07109152,0.0009466847,0.00015350539,0.00012287546],"about_ca_topic_score_codex":0.000021539274,"about_ca_topic_score_gemma":0.0000013532295,"teacher_disagreement_score":0.8306418,"about_ca_system_score_codex":0.0000132984605,"about_ca_system_score_gemma":0.00007369126,"threshold_uncertainty_score":0.36797842},"labels":[],"label_agreement":null},{"id":"W2036704249","doi":"10.1016/j.sigpro.2014.03.010","title":"Musical-noise-free blind speech extraction integrating microphone array and iterative spectral subtraction","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Core Research for Evolutional Science and Technology; Japan Society for the Promotion of Science","keywords":"Noise (video); Computer science; Speech recognition; Independent component analysis; Speech enhancement; Iterative method; Microphone; Noise measurement; Microphone array; Estimator; Acoustics; Algorithm; Mathematics; Artificial intelligence; Noise reduction; Physics; Telecommunications; Statistics","score_opus":0.013987905535478965,"score_gpt":0.2574314407150714,"score_spread":0.24344353517959244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036704249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21038224,0.00027947652,0.7852387,0.0006754647,0.00018075768,0.00011031884,7.036885e-7,0.00019259815,0.0029397376],"genre_scores_gemma":[0.7333679,0.000005438726,0.26574558,0.0002533878,0.00049626816,0.0000061468622,0.0000025671582,0.000016941938,0.00010573544],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809176,0.00009285926,0.00035810727,0.000676265,0.00034707307,0.00043395447],"domain_scores_gemma":[0.99895,0.00013118505,0.00030043948,0.00027583732,0.00018852478,0.00015398013],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005788173,0.00027011125,0.00025128998,0.00019246961,0.0005845893,0.0012551034,0.00044037023,0.00011793482,0.000023083658],"category_scores_gemma":[0.00015396364,0.00024165957,0.000056455858,0.0005460882,0.000103078724,0.0023250536,0.000096308846,0.0005046261,0.000019061681],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022494483,0.00003735255,0.00012736926,0.00004627215,0.0000049955734,0.000007583427,0.00080594287,0.000014471167,0.64158547,0.000054128548,0.00004902956,0.3572449],"study_design_scores_gemma":[0.0007595062,0.00014011606,0.000658168,0.00026453842,0.000015301457,0.00025186245,0.00023958608,0.01673818,0.9711057,0.0089857215,0.0004650375,0.00037627816],"about_ca_topic_score_codex":0.000020512914,"about_ca_topic_score_gemma":0.00001996448,"teacher_disagreement_score":0.5229857,"about_ca_system_score_codex":0.00007545383,"about_ca_system_score_gemma":0.00011367737,"threshold_uncertainty_score":0.99978167},"labels":[],"label_agreement":null},{"id":"W2038096646","doi":"10.1016/j.sigpro.2011.03.021","title":"Stochastic image denoising based on Markov-chain Monte Carlo sampling","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Noise reduction; Monte Carlo method; Mathematics; Algorithm; Artificial intelligence; Markov chain; Nonparametric statistics; Pattern recognition (psychology); Computer science; Mathematical optimization; Statistics","score_opus":0.04856850487225214,"score_gpt":0.28707334843333254,"score_spread":0.2385048435610804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038096646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057132575,0.00028867176,0.98878187,0.00010237819,0.00017852688,0.00017323603,0.0000015640751,0.00034077294,0.0044197356],"genre_scores_gemma":[0.633941,3.349225e-7,0.36523846,0.0005901566,0.00010180531,0.000009032837,6.2372203e-7,0.000030203973,0.00008835886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973988,0.00023713987,0.0004059148,0.000727073,0.0005688577,0.0006622013],"domain_scores_gemma":[0.9986252,0.00026871217,0.0002073457,0.00048228062,0.00022634544,0.00019007514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012983921,0.00033841762,0.00031630413,0.00032821568,0.00054212287,0.0005556747,0.00091946166,0.000106867956,0.00004477245],"category_scores_gemma":[0.00013772948,0.00031658207,0.00012783718,0.0006240726,0.00010862338,0.0009696758,0.00015972475,0.0004030923,0.000041905696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003751213,0.00032223132,0.00010256326,0.0002646478,0.000031454845,0.0003928437,0.005430746,0.01634415,0.071712136,0.00078953564,0.00014457849,0.90409],"study_design_scores_gemma":[0.00088182715,0.00023023017,0.0004417664,0.0005616651,0.0000293912,0.000037565413,0.00008985739,0.9729146,0.019183889,0.0049768984,0.0000383791,0.0006139811],"about_ca_topic_score_codex":0.000047384587,"about_ca_topic_score_gemma":0.0000024184897,"teacher_disagreement_score":0.9565704,"about_ca_system_score_codex":0.00009295731,"about_ca_system_score_gemma":0.00024335682,"threshold_uncertainty_score":0.99992865},"labels":[],"label_agreement":null},{"id":"W2038253873","doi":"10.1016/s0165-1684(02)00135-4","title":"Numerically stable fast convergence least-squares algorithms for multichannel active sound cancellation systems and sound deconvolution systems","year":2002,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; QR decomposition; Recursive least squares filter; Adaptive filter; System identification; Deconvolution; Computer science; Convergence (economics); Active noise control; Numerical stability; Mathematics; Numerical analysis; Filter (signal processing)","score_opus":0.040140263771435675,"score_gpt":0.2607476609620002,"score_spread":0.22060739719056452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038253873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018564897,0.0049913153,0.9747154,0.000005892519,0.00026825722,0.00064059993,0.000059584767,0.0005564333,0.00019762099],"genre_scores_gemma":[0.9894365,0.000053528343,0.009837623,0.000004689196,0.00021596535,0.00022559983,0.000012462273,0.00006471584,0.00014890714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987544,0.000025795724,0.0003166879,0.00032919028,0.00018584155,0.00038810977],"domain_scores_gemma":[0.99937093,0.00008872108,0.00013349185,0.0001060762,0.00020713446,0.0000936286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011983899,0.0002499524,0.0002778901,0.00009383882,0.00025187407,0.00017361726,0.000104452956,0.0001067705,0.000009701285],"category_scores_gemma":[0.000022539565,0.00026614853,0.00003164933,0.00015478888,0.00007737063,0.0006800634,0.00002515701,0.0001463648,0.0000051265106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007501084,0.00005200576,0.00032010855,0.0029849643,0.00009922641,0.0000064730807,0.0024356816,0.8832646,0.049529407,0.00041386273,0.00020290741,0.060615756],"study_design_scores_gemma":[0.0002617353,0.00007718201,0.000051229636,0.00027467977,0.000020877755,0.00001671986,0.0007932507,0.99412477,0.0029369055,0.0007445716,0.0003715661,0.000326532],"about_ca_topic_score_codex":0.000060851835,"about_ca_topic_score_gemma":0.000007087899,"teacher_disagreement_score":0.9708716,"about_ca_system_score_codex":0.000274586,"about_ca_system_score_gemma":0.000013552913,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W2041348998","doi":"10.1016/j.sigpro.2012.07.036","title":"Kalman filtering strategies utilizing the chattering effects of the smooth variable structure filter","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Control theory (sociology); Kalman filter; Robustness (evolution); Extended Kalman filter; Invariant extended Kalman filter; Unscented transform; Nonlinear system; Alpha beta filter; Fast Kalman filter; Computer science; Mathematics; Moving horizon estimation; Artificial intelligence; Physics","score_opus":0.0129132641325198,"score_gpt":0.22970879008407494,"score_spread":0.21679552595155513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041348998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18943465,0.0023493618,0.80314577,0.00027023754,0.0014958644,0.00029050178,0.0000063531224,0.00021311828,0.0027941389],"genre_scores_gemma":[0.9860235,0.00000439856,0.013331522,0.00025835074,0.0003312585,0.0000056516583,0.0000014704849,0.000015785317,0.00002806412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986256,0.00010703686,0.00024003022,0.00023950638,0.0003243663,0.0004634908],"domain_scores_gemma":[0.99901724,0.00019993757,0.00018560614,0.0004870671,0.000052811152,0.000057355195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029749123,0.00018026278,0.00016091438,0.00003856622,0.000538905,0.00038951566,0.0010903596,0.000072451534,0.000030691557],"category_scores_gemma":[0.000019439713,0.00010101049,0.000055514454,0.0004009652,0.00009504167,0.0011665605,0.0003819136,0.00032357086,0.0000021090798],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027028922,0.00013406086,0.0052269883,0.0020936925,0.00008353222,0.000010452243,0.020333093,0.020491742,0.6629094,0.034906268,0.001643397,0.25214037],"study_design_scores_gemma":[0.0016281909,0.00021029488,0.047250167,0.006454948,0.00020449718,0.00031709464,0.0042942967,0.34734914,0.53519297,0.028424703,0.026351918,0.0023217646],"about_ca_topic_score_codex":0.000017427117,"about_ca_topic_score_gemma":0.000001313162,"teacher_disagreement_score":0.79658884,"about_ca_system_score_codex":0.000017035694,"about_ca_system_score_gemma":0.000053922515,"threshold_uncertainty_score":0.41448757},"labels":[],"label_agreement":null},{"id":"W2044000385","doi":"10.1016/j.sigpro.2012.10.021","title":"Principles of minimum variance robust adaptive beamforming design","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":294,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robustness (evolution); Minimum-variance unbiased estimator; Beamforming; Adaptive beamformer; Computer science; Imperfect; Variance (accounting); Range (aeronautics); Electronic engineering; Engineering; Telecommunications; Mathematics; Statistics; Mean squared error","score_opus":0.07905418114954706,"score_gpt":0.2786842532869124,"score_spread":0.19963007213736533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044000385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012457254,0.00028558317,0.9936683,0.00002598906,0.00006546903,0.00014650518,7.568171e-7,0.0001761308,0.0043855384],"genre_scores_gemma":[0.52238876,0.0000012201832,0.47752038,0.000011782147,0.000024814208,0.000008717621,2.1358073e-7,0.000005616659,0.00003848604],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886775,0.000059324542,0.0003644915,0.00017828314,0.000294028,0.00023609486],"domain_scores_gemma":[0.99898684,0.00013531333,0.000411479,0.00017738169,0.00022373535,0.000065243345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729196,0.00011565125,0.00018361946,0.00013325474,0.000096334974,0.00004018606,0.00043514094,0.00005515981,0.000008681727],"category_scores_gemma":[0.000077302735,0.00010998765,0.000040637144,0.00047037585,0.00007862407,0.0017112587,0.000116809264,0.00008767646,0.0000030999288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007268867,0.0004925766,0.001238192,0.0006041207,0.0000540851,0.0000026574776,0.008636423,0.03265603,0.09782701,0.14333406,0.00008536444,0.7149968],"study_design_scores_gemma":[0.00011051105,0.00011397569,0.00038324573,0.00038192194,0.00001194269,0.000012281191,0.000070338545,0.44395643,0.5505788,0.0040305313,0.00016161737,0.00018841593],"about_ca_topic_score_codex":0.000009840627,"about_ca_topic_score_gemma":2.3663058e-7,"teacher_disagreement_score":0.7148084,"about_ca_system_score_codex":0.000039541283,"about_ca_system_score_gemma":0.0001607947,"threshold_uncertainty_score":0.44851664},"labels":[],"label_agreement":null},{"id":"W2045012981","doi":"10.1016/j.sigpro.2013.04.004","title":"A new constrained weighted least squares algorithm for TDOA-based localization","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"University of Chinese Academy of Sciences; City University of Hong Kong","keywords":"Mathematics; Multilateration; Linear least squares; Algorithm; Least-squares function approximation; Estimator; Non-linear least squares; Total least squares; Matrix (chemical analysis); Quadratic equation; Generalized least squares; Gaussian elimination; Gaussian; Mathematical optimization; Applied mathematics; Statistics; Estimation theory; Geometry","score_opus":0.008601640146762396,"score_gpt":0.21421704556929702,"score_spread":0.20561540542253462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045012981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003123022,0.00038033538,0.9965904,0.00010669828,0.00007811319,0.00038395173,0.000009083192,0.0012981676,0.0008409501],"genre_scores_gemma":[0.8999642,0.0000030299263,0.099478096,0.000142983,0.00012743333,0.00008300068,0.00006521535,0.00005064095,0.00008540493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914235,0.000008280913,0.00024338913,0.0001732282,0.00014302124,0.00028974176],"domain_scores_gemma":[0.9996004,0.00003722847,0.000046372163,0.000090178655,0.00015589163,0.00006992146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005448976,0.00017665837,0.00016222769,0.00014669815,0.00015054998,0.0001526748,0.00013101137,0.00014592221,0.00025506914],"category_scores_gemma":[0.000017226104,0.00016709446,0.000049920203,0.0003277357,0.00006091244,0.00023445953,0.000009630135,0.0000935436,0.00003206013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037408768,0.000010824673,0.000053887863,0.0001714964,0.000011822633,8.8905347e-7,0.00009158536,0.021068087,0.0016633254,0.00022075283,0.0030364974,0.9736671],"study_design_scores_gemma":[0.00060972566,0.00003973214,0.000013818957,0.00009144321,0.000014214756,0.0000021045573,0.00018202436,0.9463824,0.047707397,0.002607344,0.0021305527,0.00021921421],"about_ca_topic_score_codex":0.000019168048,"about_ca_topic_score_gemma":0.0000026516955,"teacher_disagreement_score":0.97344786,"about_ca_system_score_codex":0.00004842248,"about_ca_system_score_gemma":0.000099818266,"threshold_uncertainty_score":0.6813914},"labels":[],"label_agreement":null},{"id":"W2046575129","doi":"10.1016/s0165-1684(00)00276-0","title":"Parameter estimation of a target-directed dynamic system model with switching states","year":2001,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Else Kröner-Fresenius-Stiftung","keywords":"Control theory (sociology); Computer science; Estimation theory; Estimation; Mathematics; Algorithm; Engineering; Artificial intelligence; Control (management)","score_opus":0.011028273784722006,"score_gpt":0.23700117275607457,"score_spread":0.22597289897135256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046575129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073437214,0.00021251892,0.92544764,0.00005119945,0.000036732374,0.000095061296,0.0000027577867,0.00050247624,0.00021438804],"genre_scores_gemma":[0.62460226,0.0000026588575,0.37531805,0.000023498309,0.000009609311,0.00000487496,0.000010073978,0.000010556286,0.000018402337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986767,0.00004568365,0.0003129879,0.000347805,0.00034288518,0.00027390665],"domain_scores_gemma":[0.99920106,0.00009758083,0.00023502165,0.00025106652,0.00014786466,0.00006738688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023701269,0.00015739801,0.00021009475,0.000114169125,0.0001925416,0.00019673031,0.0003754319,0.000057716003,0.0000034970744],"category_scores_gemma":[0.0000126969935,0.00012274944,0.00003086847,0.00048788448,0.000031521817,0.0007613895,0.00006806053,0.00016119606,0.0000037859954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033002292,0.000032797714,0.00012742373,0.00014295375,0.0000095940595,0.000016493277,0.0006925221,0.88932455,0.0010555865,0.00032389196,0.000025339368,0.10821586],"study_design_scores_gemma":[0.00020850466,0.000045339006,0.000057492176,0.00050013425,0.0000105584,0.00005784634,0.00007894823,0.99597526,0.00067980814,0.0022098615,0.000009410071,0.0001668298],"about_ca_topic_score_codex":0.000019624405,"about_ca_topic_score_gemma":0.0000026104974,"teacher_disagreement_score":0.55116504,"about_ca_system_score_codex":0.000043569064,"about_ca_system_score_gemma":0.00008688323,"threshold_uncertainty_score":0.50055766},"labels":[],"label_agreement":null},{"id":"W2051382371","doi":"10.1016/j.sigpro.2007.03.003","title":"Fast RLS Fourier analyzers capable of accommodating frequency mismatch","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Recursive least squares filter; Algorithm; Fast Fourier transform; Sine; Fourier transform; Computer science; Noise (video); Discrete Fourier transform (general); Least mean squares filter; Spectrum analyzer; Fourier series; Fourier analysis; Control theory (sociology); Mathematics; Adaptive filter; Short-time Fourier transform; Artificial intelligence; Telecommunications","score_opus":0.013531319018850498,"score_gpt":0.25209235109095707,"score_spread":0.23856103207210658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051382371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351505,0.00042965074,0.85141134,0.000008799319,0.000039388273,0.000101209815,0.0000055608843,0.0005956661,0.012257897],"genre_scores_gemma":[0.79083747,0.0000037003704,0.20898108,0.000012733439,0.00006971611,0.0000049365253,0.0000040739824,0.000045642668,0.000040629053],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882853,0.000009604102,0.00038531207,0.00018085208,0.00021310756,0.0003826053],"domain_scores_gemma":[0.9994993,0.000051650357,0.00010809761,0.00016504042,0.00010238647,0.0000735026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431355,0.00018617451,0.0002337443,0.00015607462,0.00008559213,0.00002897306,0.00021382021,0.00008373163,0.000062106534],"category_scores_gemma":[0.000024170215,0.00019588512,0.000052168012,0.00035762397,0.000066977474,0.00042778847,0.000038929986,0.0002299778,0.0000042844667],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010999339,0.000022281745,0.0014330244,0.00047277403,0.00003274794,0.000020446349,0.00070607866,0.015309901,0.78128743,0.00026398027,0.00009696766,0.20034339],"study_design_scores_gemma":[0.0002483598,0.0000554155,0.0008269336,0.0006930054,0.000029085431,0.000018310599,0.000542224,0.06721036,0.92139363,0.008056043,0.000377867,0.0005487734],"about_ca_topic_score_codex":0.000018925142,"about_ca_topic_score_gemma":0.000007695036,"teacher_disagreement_score":0.655687,"about_ca_system_score_codex":0.00009252223,"about_ca_system_score_gemma":0.000025841078,"threshold_uncertainty_score":0.79879636},"labels":[],"label_agreement":null},{"id":"W2054697955","doi":"10.1016/j.sigpro.2011.02.014","title":"A Bayesian Lasso via reversible-jump MCMC","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lasso (programming language); Markov chain Monte Carlo; Bayesian probability; Prior probability; Bayesian inference; Gibbs sampling; Reversible-jump Markov chain Monte Carlo; Computer science; Algorithm; Model selection; Mathematics; Artificial intelligence","score_opus":0.1278538037782656,"score_gpt":0.3483625726101193,"score_spread":0.22050876883185372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054697955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019492141,0.000070210124,0.9401437,0.000033653225,0.000046320944,0.00009103836,0.0000036391953,0.00009930786,0.057562903],"genre_scores_gemma":[0.5387187,9.779832e-7,0.46081963,0.00009512972,0.000055771998,0.0000058849155,4.800836e-7,0.00001664786,0.00028680736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989418,0.00007825837,0.00025854015,0.00023096491,0.00020233804,0.00028814713],"domain_scores_gemma":[0.9992423,0.00026749383,0.000120645054,0.00014140838,0.00011214485,0.000116029805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004100897,0.00014112919,0.00021025106,0.00005553239,0.00014341086,0.000039328126,0.00017108017,0.00007908274,0.0015122306],"category_scores_gemma":[0.00035741404,0.00011831079,0.00004509631,0.00019560238,0.000082796236,0.00013190568,0.00004797312,0.00018337439,0.000055373424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119817036,0.00035657265,0.001849689,0.00107181,0.000048931037,0.00008467756,0.004562881,5.801583e-7,0.007884031,0.12033323,0.0022718105,0.861416],"study_design_scores_gemma":[0.00021274677,0.00009889947,0.00032451266,0.00022354459,0.00004613981,0.00001526267,0.00015281724,0.008612889,0.0067812935,0.9830184,0.00027763442,0.0002358515],"about_ca_topic_score_codex":0.000019759176,"about_ca_topic_score_gemma":0.000003226025,"teacher_disagreement_score":0.8626852,"about_ca_system_score_codex":0.000026092488,"about_ca_system_score_gemma":0.00006825355,"threshold_uncertainty_score":0.9994005},"labels":[],"label_agreement":null},{"id":"W2056489576","doi":"10.1016/j.sigpro.2011.02.018","title":"Optimum crossing-point estimation of a sampled analog signal with a periodic carrier","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Minimum mean square error; Maximum a posteriori estimation; Mathematics; Algorithm; Bayesian probability; Mean squared error; SIGNAL (programming language); Cramér–Rao bound; Sampling (signal processing); Statistics; Computer science; Filter (signal processing); Maximum likelihood","score_opus":0.028889270101780207,"score_gpt":0.26867675165923377,"score_spread":0.23978748155745355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056489576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05491,0.00009212153,0.9426219,0.00006449417,0.000011024006,0.00016454325,0.0000021437736,0.0002658127,0.0018679848],"genre_scores_gemma":[0.69291985,2.9524944e-7,0.30690232,0.000115725925,0.000013362696,0.000015508927,0.0000024445978,0.000010726035,0.000019747396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863845,0.00007458067,0.00033697742,0.00034813923,0.00035980035,0.00024202405],"domain_scores_gemma":[0.9990634,0.000031809344,0.0003026453,0.0002452978,0.0002698398,0.0000870596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045804944,0.00017075508,0.00022161803,0.00018855653,0.00028730408,0.0004010206,0.0004412956,0.00007532786,0.00006594728],"category_scores_gemma":[0.00001633428,0.00014120659,0.000050085877,0.00054067356,0.00026091098,0.001205356,0.00008591949,0.00016635125,0.0000033889673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054987054,0.0008022885,0.0038957368,0.0007178512,0.00013841485,0.00009613347,0.19347785,0.013876581,0.04648049,0.02641476,0.00029652484,0.7132535],"study_design_scores_gemma":[0.000663108,0.00078570907,0.0019575718,0.000379725,0.0000322433,0.000068007816,0.00032230545,0.84913695,0.12969269,0.016398432,0.00006956709,0.0004936727],"about_ca_topic_score_codex":0.00006356416,"about_ca_topic_score_gemma":0.000007676486,"teacher_disagreement_score":0.8352604,"about_ca_system_score_codex":0.000036692047,"about_ca_system_score_gemma":0.0005473787,"threshold_uncertainty_score":0.5758238},"labels":[],"label_agreement":null},{"id":"W2060606688","doi":"10.1016/j.sigpro.2014.12.022","title":"Spectrum sensing based on fractional lower order moments for cognitive radios in α-stable distributed noise","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"Nanjing Tech University; Nanjing University of Science and Technology; National Natural Science Foundation of China","keywords":"Rayleigh fading; Detector; Cognitive radio; Cauchy distribution; False alarm; Fading; Algorithm; Gaussian noise; Computer science; Gaussian; Detection theory; Additive white Gaussian noise; Signal-to-noise ratio (imaging); Noise (video); Mathematics; Electronic engineering; Statistics; Wireless; Telecommunications; White noise; Physics; Artificial intelligence; Engineering; Decoding methods","score_opus":0.011388341825624423,"score_gpt":0.2434723222563858,"score_spread":0.23208398043076137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060606688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015129729,0.000043522534,0.9820417,0.00091208785,0.00019447005,0.00032791877,0.000013005392,0.00010910245,0.0012284471],"genre_scores_gemma":[0.9867562,0.0000010139128,0.011868657,0.00094620796,0.00031450324,0.000008203972,0.000041369556,0.000027061036,0.000036768375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997943,0.00010389049,0.00030894123,0.0006393498,0.0003908604,0.0006140025],"domain_scores_gemma":[0.9987028,0.0006324903,0.0001648194,0.00015295862,0.00022871033,0.0001181789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051361445,0.00025978163,0.00029020643,0.00022636518,0.00037965164,0.0003591142,0.00018212211,0.0000885735,0.000019660316],"category_scores_gemma":[0.00015323468,0.0002589793,0.00007983976,0.0008158138,0.00007311511,0.0005136136,0.000045003093,0.0002919333,0.00000971999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016511321,0.0012704473,0.0032239747,0.00028000673,0.00009630252,0.00021009591,0.0007190258,0.16809693,0.0047811437,0.0038163906,0.0006937127,0.8151608],"study_design_scores_gemma":[0.0017223533,0.00019738408,0.0011684439,0.00049949705,0.000013516032,0.000012531006,0.000029815295,0.9894067,0.0022353863,0.003915191,0.00045982355,0.00033932753],"about_ca_topic_score_codex":0.0000131080105,"about_ca_topic_score_gemma":0.000019986828,"teacher_disagreement_score":0.97162646,"about_ca_system_score_codex":0.00018506973,"about_ca_system_score_gemma":0.00019825113,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W2062753093","doi":"10.1016/j.sigpro.2013.05.015","title":"Two-way cooperative communications with statistical channel knowledge","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Channel (broadcasting); Relay channel; Channel state information; Computer network; Transmitter power output; Probabilistic logic; Bandwidth (computing); Power (physics); Mathematical optimization; Electronic engineering; Engineering; Telecommunications; Wireless; Mathematics; Transmitter; Artificial intelligence","score_opus":0.05118604664809637,"score_gpt":0.31473776397565323,"score_spread":0.2635517173275569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062753093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005869875,0.0021022335,0.9660829,0.0018976827,0.000024632538,0.00027732918,0.0000015354691,0.00019220209,0.028834555],"genre_scores_gemma":[0.9291008,0.000077109995,0.06988742,0.00040199686,0.000041089104,0.0001179378,0.0000107671085,0.000013487982,0.0003494061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.00024493164,0.00023068723,0.00029597656,0.00016130468,0.00028068564],"domain_scores_gemma":[0.99814975,0.0002478846,0.0000868907,0.0007501163,0.0006292426,0.00013609361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023229602,0.0001677425,0.00017242267,0.00007947944,0.0007986654,0.00055785663,0.0014403067,0.000032734464,0.000116304895],"category_scores_gemma":[0.000018825283,0.00013113127,0.000019513103,0.00063736626,0.00024794828,0.000969965,0.00062502554,0.00030495084,0.00023411294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072898506,0.00027169287,0.00009969974,0.000028941666,0.00002995336,0.0000028691045,0.006023095,0.00026569783,0.0020850608,0.15215665,0.001850552,0.83717847],"study_design_scores_gemma":[0.00053879776,0.0001248946,0.00053958053,0.00016874853,0.000008272548,0.000018897377,0.00030127668,0.99181175,0.00068131124,0.0023841849,0.0030798456,0.00034242825],"about_ca_topic_score_codex":0.000011914853,"about_ca_topic_score_gemma":0.00005947928,"teacher_disagreement_score":0.99154603,"about_ca_system_score_codex":0.000051247815,"about_ca_system_score_gemma":0.00021112559,"threshold_uncertainty_score":0.61427695},"labels":[],"label_agreement":null},{"id":"W2070565404","doi":"10.1016/j.sigpro.2010.03.029","title":"A robust variable step-size affine projection algorithm","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"A priori and a posteriori; Adaptive filter; Algorithm; Norm (philosophy); Mathematics; Affine transformation; Robustness (evolution); Variable (mathematics); System identification; Constraint (computer-aided design); Computer science","score_opus":0.013905895978041026,"score_gpt":0.2252008830050497,"score_spread":0.21129498702700866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070565404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029033343,0.00007998002,0.987138,0.000011662087,0.00019926841,0.00018175301,0.000006366013,0.002018101,0.007461575],"genre_scores_gemma":[0.29899037,0.0000032341345,0.7001885,0.0000167821,0.00035350534,0.00005064505,0.0000041772782,0.00006150492,0.00033126448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913603,0.000008495241,0.00018419731,0.0002223174,0.00015197528,0.00029699638],"domain_scores_gemma":[0.9996362,0.000035040863,0.000042662632,0.0001384208,0.00008871903,0.00005901155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015459459,0.00018647226,0.00015186454,0.000075500786,0.00011984853,0.00008368111,0.00014606143,0.000114600254,0.00016499097],"category_scores_gemma":[0.000032254913,0.00018941275,0.000027383287,0.0003026321,0.000041612795,0.00046556498,0.00003883594,0.00047540313,0.000011836638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069981556,0.000025182679,0.000018556251,0.00013520937,0.00001125898,0.000006713731,0.000072967065,0.0062614186,0.48351404,0.0001573902,0.0003413149,0.50944895],"study_design_scores_gemma":[0.00028033735,0.000065647706,0.00012143872,0.00017792771,0.000017808135,0.000065873035,0.00004232124,0.8702386,0.10660625,0.0026713293,0.019219682,0.0004927834],"about_ca_topic_score_codex":0.000010308307,"about_ca_topic_score_gemma":0.000005165816,"teacher_disagreement_score":0.8639772,"about_ca_system_score_codex":0.000057297337,"about_ca_system_score_gemma":0.00003945762,"threshold_uncertainty_score":0.77240276},"labels":[],"label_agreement":null},{"id":"W2075123782","doi":"10.1016/j.sigpro.2014.10.005","title":"Consensus-based distributed dynamic sensor selection in decentralised sensor networks using the posterior Cramér–Rao lower bound","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Selection (genetic algorithm); Algorithm; Upper and lower bounds; Overhead (engineering); Sensor array; Mathematics; Artificial intelligence; Machine learning","score_opus":0.011860494421673813,"score_gpt":0.24854087187054114,"score_spread":0.23668037744886733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075123782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13447082,0.00011487313,0.8638109,0.0006074111,0.00035963958,0.00031465353,0.000011359249,0.0002695543,0.000040786144],"genre_scores_gemma":[0.9871699,0.000002759794,0.0118847415,0.0006636156,0.00018258314,0.0000106906255,0.000023491213,0.00003372716,0.000028448378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709195,0.00038219072,0.0005773259,0.00067621714,0.00042897995,0.00084332604],"domain_scores_gemma":[0.9986198,0.00027091344,0.00032927218,0.00030351843,0.00030233173,0.00017415526],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006555595,0.0003569753,0.00034247135,0.00014978705,0.0007138832,0.0010585942,0.00046283656,0.00020839383,0.000018675237],"category_scores_gemma":[0.00006829592,0.00029354796,0.00012473456,0.0015417126,0.00017643011,0.00030421076,0.00008587596,0.0005324569,0.0000072056228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001732275,0.00013469851,0.0004390284,0.000041920895,0.000021648506,0.000043884233,0.00008690385,0.926175,0.007041106,0.000037881655,0.00009728607,0.06570744],"study_design_scores_gemma":[0.00089195615,0.00010383705,0.0009415012,0.00014400524,0.00002254224,0.0001242766,0.000057964102,0.99566656,0.0007919305,0.00015690186,0.0007109311,0.00038760246],"about_ca_topic_score_codex":0.00006278001,"about_ca_topic_score_gemma":0.00006564621,"teacher_disagreement_score":0.8526991,"about_ca_system_score_codex":0.00027593097,"about_ca_system_score_gemma":0.00019866179,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2075565834","doi":"10.1016/j.sigpro.2012.02.019","title":"A generalized synchrosqueezing transform for enhancing signal time–frequency representation","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":218,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Instantaneous phase; Wavelet; Time–frequency analysis; SIGNAL (programming language); Time–frequency representation; Mathematics; Dimension (graph theory); Wavelet transform; Algorithm; Continuous wavelet transform; Computer science; Artificial intelligence; Discrete wavelet transform; Telecommunications","score_opus":0.015030894681959247,"score_gpt":0.2967754132005522,"score_spread":0.28174451851859295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075565834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11421205,0.0028134738,0.8743602,0.00007725369,0.000110875444,0.00090788805,0.000017714268,0.0017739148,0.005726619],"genre_scores_gemma":[0.958413,0.000019603152,0.040413715,0.00007262043,0.00051529944,0.00037171302,0.000048844366,0.00009412384,0.00005104791],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984781,0.000030100542,0.0004342652,0.00023156684,0.00023439375,0.00059156975],"domain_scores_gemma":[0.9994639,0.000118796444,0.000073218514,0.00012719314,0.00008266395,0.00013419043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004678706,0.00026039203,0.00028291272,0.00015479434,0.0001927696,0.00010535426,0.00016069235,0.00012926904,0.00019604508],"category_scores_gemma":[0.000030757445,0.00026746458,0.00011982012,0.00026027256,0.000029416138,0.0010233755,0.000013628948,0.00018565757,0.000020743411],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019401847,0.000057483103,0.0005530421,0.00067643606,0.00004064729,0.0000018436857,0.0013527446,0.0019477003,0.8141624,0.00016323628,0.0009648629,0.18006024],"study_design_scores_gemma":[0.00045848888,0.000048772796,0.000112650756,0.00027802703,0.00006475824,0.0000149183725,0.000051274077,0.14944066,0.8461073,0.0023016466,0.00066312467,0.0004584026],"about_ca_topic_score_codex":0.000023464798,"about_ca_topic_score_gemma":0.0000092720165,"teacher_disagreement_score":0.84420097,"about_ca_system_score_codex":0.0001566813,"about_ca_system_score_gemma":0.00003799163,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W2076402610","doi":"10.1016/j.sigpro.2014.05.003","title":"Perceptual-based DWPT-DCT framework for selective blind audio watermarking","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council; McGill University","keywords":"Digital watermarking; Watermark; Discrete cosine transform; Robustness (evolution); Speech recognition; Computer science; Quantization (signal processing); Audio signal; Embedding; Artificial intelligence; Mathematics; Computer vision; Speech coding; Image (mathematics)","score_opus":0.022204701872050578,"score_gpt":0.2859279917441289,"score_spread":0.2637232898720783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076402610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028892527,0.00009188243,0.9945898,0.0002526524,0.00010041177,0.0002996154,0.0000016447403,0.0007248584,0.0010498583],"genre_scores_gemma":[0.5908656,9.633997e-7,0.40842426,0.0004623973,0.00014810113,0.000059673053,0.0000033378394,0.000018331444,0.000017309872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998188,0.000098508346,0.00028497458,0.0006012607,0.00027724693,0.000549973],"domain_scores_gemma":[0.99888283,0.00030305775,0.00018529779,0.00031518858,0.00021309924,0.00010050474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579387,0.00026047337,0.0002596476,0.00022160166,0.0006455492,0.00037038213,0.0007808844,0.00016414773,0.0000036903016],"category_scores_gemma":[0.00006545155,0.00022788983,0.00014474447,0.000514236,0.000105802545,0.0007412222,0.000104486244,0.00031697613,0.000003781031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021722626,0.00013065767,0.0011521612,0.0003479264,0.000032421467,0.000006651267,0.0029057178,0.00068385457,0.009898653,0.022964627,0.00026479774,0.9613953],"study_design_scores_gemma":[0.0010655788,0.00056780194,0.0005554313,0.0009046891,0.000034535093,0.0000156318,0.000049355058,0.28294307,0.16862015,0.5363785,0.007875465,0.0009897975],"about_ca_topic_score_codex":0.0000022508545,"about_ca_topic_score_gemma":7.992615e-7,"teacher_disagreement_score":0.9604055,"about_ca_system_score_codex":0.000048256858,"about_ca_system_score_gemma":0.00008974994,"threshold_uncertainty_score":0.92930776},"labels":[],"label_agreement":null},{"id":"W2077495158","doi":"10.1016/j.sigpro.2011.09.007","title":"PHD filter based track-before-detect for MIMO radars","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; MIMO; Transmitter; Radar; Radar tracker; Filter (signal processing); Computer science; Observability; Control theory (sociology); Mathematics; Telecommunications; Artificial intelligence; Channel (broadcasting); Computer vision","score_opus":0.04864127345745488,"score_gpt":0.24861275215450557,"score_spread":0.19997147869705068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077495158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025394408,0.00025848675,0.994518,0.00012764722,0.00028256094,0.00019259471,0.0000112944,0.0003855027,0.0016844858],"genre_scores_gemma":[0.6688353,8.993024e-7,0.33032566,0.000519077,0.00016894027,0.00002152554,0.00000868517,0.000021035195,0.00009886714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840736,0.000043797492,0.0002971755,0.00052082434,0.00026437626,0.00046648775],"domain_scores_gemma":[0.9991248,0.0001004872,0.00014155907,0.00037363978,0.00013330046,0.00012616807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003779804,0.00020074558,0.00019285726,0.00010582622,0.00034761435,0.00022557625,0.0008264664,0.000107336964,0.00011336509],"category_scores_gemma":[0.000026703396,0.00017220018,0.00011193172,0.00030138515,0.00006820866,0.00064690644,0.000080069745,0.00018700837,0.000027606331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009687557,0.000146619,0.00016153409,0.000147646,0.000013580888,0.000027108546,0.0013078117,0.00029946095,0.0022327346,0.0009020631,0.0057628048,0.98890173],"study_design_scores_gemma":[0.001718485,0.00071343954,0.000842429,0.00038339535,0.000040650266,0.000042287607,0.00007225099,0.87602836,0.06977982,0.017271344,0.03221298,0.0008945711],"about_ca_topic_score_codex":0.000012020553,"about_ca_topic_score_gemma":0.000004609962,"teacher_disagreement_score":0.9880072,"about_ca_system_score_codex":0.000020866193,"about_ca_system_score_gemma":0.00011336777,"threshold_uncertainty_score":0.702212},"labels":[],"label_agreement":null},{"id":"W2077602786","doi":"10.1016/j.sigpro.2014.06.024","title":"Robustness of Double Random Phase Encoding spread-space spread-spectrum watermarking technique","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Watermark; Digital watermarking; Robustness (evolution); Computer vision; Computer science; Artificial intelligence; Barcode; Image processing; Digital image; Quantization (signal processing); Pattern recognition (psychology); Mathematics; Algorithm; Image (mathematics)","score_opus":0.016082217637836533,"score_gpt":0.27012422771787054,"score_spread":0.254042010080034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077602786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008496443,0.00017661901,0.98606676,0.00022595849,0.000116322255,0.00042873799,0.0000013283724,0.0007838086,0.0037040259],"genre_scores_gemma":[0.8515386,0.000013118093,0.14812464,0.000039392686,0.00013288533,0.00007410016,0.000003621046,0.000028122593,0.000045550372],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766505,0.00014031971,0.0005487462,0.00062711764,0.0004170634,0.00060169265],"domain_scores_gemma":[0.9986462,0.00013567404,0.00041932106,0.00053640886,0.00014121865,0.00012119506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011897149,0.0003419913,0.0004908674,0.0003899168,0.0003939535,0.00024917783,0.0011868954,0.00015570523,0.0000075740986],"category_scores_gemma":[0.000017046666,0.0002984523,0.00016328391,0.00074215105,0.00017315766,0.0014287274,0.00031604484,0.00034565027,0.0000010353828],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010989493,0.00061113987,0.0009382033,0.0013922076,0.00007482739,0.000055704622,0.002534167,0.009053001,0.6231817,0.03368359,0.00014889108,0.3272276],"study_design_scores_gemma":[0.0022802304,0.00020060253,0.000008524895,0.00078883365,0.00001934154,0.000054630396,0.000016883176,0.1352515,0.8469952,0.012861728,0.0010750567,0.00044747433],"about_ca_topic_score_codex":0.000016219898,"about_ca_topic_score_gemma":0.0000020735342,"teacher_disagreement_score":0.84304214,"about_ca_system_score_codex":0.000041709052,"about_ca_system_score_gemma":0.00006745607,"threshold_uncertainty_score":0.9999468},"labels":[],"label_agreement":null},{"id":"W2077709167","doi":"10.1016/j.sigpro.2007.11.006","title":"Experimental antenna array calibration with artificial neural networks","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Artificial neural network; Computer science; Perceptron; Calibration; Antenna (radio); Antenna array; Context (archaeology); Network topology; Algorithm; Electronic engineering; Artificial intelligence; Engineering; Mathematics; Telecommunications","score_opus":0.019065685617639164,"score_gpt":0.2754845854648529,"score_spread":0.2564188998472137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015612899,0.00013159306,0.98286307,0.00006708984,0.00007280049,0.000083229585,2.1915478e-7,0.00031715594,0.000851947],"genre_scores_gemma":[0.91723263,2.388701e-7,0.08256561,0.00008995719,0.000082240724,0.000004496717,0.0000019915694,0.000009165856,0.000013681453],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905425,0.00002477466,0.0002502027,0.00022733319,0.00025475523,0.00018866136],"domain_scores_gemma":[0.999511,0.000033266617,0.0001598204,0.00012204581,0.00011884977,0.00005503566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024058884,0.00010140497,0.00010585807,0.0000866546,0.00013417732,0.00015434012,0.00019920612,0.000046129528,0.000008698008],"category_scores_gemma":[0.0000075380253,0.00008927869,0.000025131165,0.0004309799,0.00006670273,0.0010138075,0.000031739186,0.000098968405,9.734728e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349592,0.00019790074,0.00054375036,0.000039129754,0.000009938243,0.000029916087,0.0011958313,0.004318931,0.64769334,0.005016682,0.00005649652,0.34079456],"study_design_scores_gemma":[0.000046899,0.000071091985,0.00009178994,0.00002984994,0.0000018394876,0.000018346362,0.000052248066,0.47472823,0.52430075,0.0005721217,0.000008062092,0.00007876277],"about_ca_topic_score_codex":0.0000076661145,"about_ca_topic_score_gemma":0.000002955462,"teacher_disagreement_score":0.90161973,"about_ca_system_score_codex":0.00003017038,"about_ca_system_score_gemma":0.00006423892,"threshold_uncertainty_score":0.36406794},"labels":[],"label_agreement":null},{"id":"W2077926306","doi":"10.1016/j.sigpro.2011.02.011","title":"The trinion Fourier transform of color images","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Western University; Princess Margaret Cancer Centre","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quaternion; RGB color model; Color space; Mathematics; Discrete Fourier transform (general); Fourier transform; Artificial intelligence; Representation (politics); Computer vision; Color image; Fourier analysis; Mathematical analysis; Computer science; Image processing; Short-time Fourier transform; Geometry; Image (mathematics)","score_opus":0.10636847112156295,"score_gpt":0.34754836198095745,"score_spread":0.2411798908593945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077926306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020748066,0.00054985285,0.8504466,0.00029048175,0.00003360939,0.00034863577,0.000004947353,0.00007282744,0.127505],"genre_scores_gemma":[0.8839603,0.000022443985,0.115292035,0.000014927298,0.000033204684,0.000019946001,4.7587815e-7,0.000018061352,0.00063858647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988497,0.00006559019,0.0004672643,0.00012945128,0.00027557215,0.00021243292],"domain_scores_gemma":[0.99910754,0.0004238536,0.0001532924,0.00014027461,0.00012082832,0.000054205146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013429543,0.00012199696,0.0002732307,0.000039906638,0.00021285929,0.000029990364,0.00019756767,0.000055020788,0.00023806936],"category_scores_gemma":[0.00009180289,0.00006611195,0.00016031828,0.00020385456,0.00015235142,0.00013298952,0.000011857048,0.000121318066,0.0000040787895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018420233,0.0003574923,0.000052773215,0.0011738325,0.00013994216,0.0000041677918,0.004330812,8.3954603e-7,0.0033200174,0.14891839,0.00015432615,0.8413632],"study_design_scores_gemma":[0.00030183326,0.00009382453,0.000043717668,0.00012392219,0.00017232174,0.000005116014,0.0005158345,0.0038214717,0.10124316,0.8929285,0.00061945576,0.00013088818],"about_ca_topic_score_codex":0.000006424556,"about_ca_topic_score_gemma":0.0000059115,"teacher_disagreement_score":0.8632122,"about_ca_system_score_codex":0.000008684311,"about_ca_system_score_gemma":0.00004310145,"threshold_uncertainty_score":0.2695967},"labels":[],"label_agreement":null},{"id":"W2078133453","doi":"10.1016/j.sigpro.2007.07.020","title":"Human visual system based adaptive digital image watermarking","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Watermark; Digital watermarking; Human visual system model; Computer vision; Artificial intelligence; Computer science; Image quality; Robustness (evolution); Masking (illustration); Digital image; Embedding; Visual masking; Discrete cosine transform; Image (mathematics); Brightness; Mathematics; Image processing; Visual perception","score_opus":0.01372581945362532,"score_gpt":0.27065289345611404,"score_spread":0.2569270740024887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078133453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146519495,0.000059175854,0.9757239,0.000020802236,0.000052248626,0.00013580098,0.00000158071,0.0012396873,0.008114838],"genre_scores_gemma":[0.91761017,8.936107e-8,0.0821532,0.000073781914,0.00010702961,0.000007555056,0.000004222879,0.000019991476,0.000023980458],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982651,0.000032564378,0.00035041763,0.0004569907,0.00036138442,0.00053356134],"domain_scores_gemma":[0.99930763,0.000044460325,0.00018127546,0.00021068752,0.00014041975,0.00011552341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005379053,0.00022993072,0.00019628837,0.00026896855,0.0005537351,0.0006664203,0.0006315878,0.00008294624,0.0000017817894],"category_scores_gemma":[0.000004054801,0.00020213383,0.00010036819,0.0004627765,0.00011230371,0.0020064649,0.00017085626,0.0002176358,0.000006217664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012836317,0.00027183478,0.002269152,0.00063477433,0.000041820764,0.00095397886,0.0016573775,0.00011970545,0.12583296,0.01239152,0.00009213677,0.8556064],"study_design_scores_gemma":[0.0013626049,0.00081871287,0.0022539357,0.0024461355,0.00003387457,0.00018918072,0.0007219517,0.3357439,0.63935924,0.013803552,0.0012581396,0.0020087694],"about_ca_topic_score_codex":0.0000036018394,"about_ca_topic_score_gemma":6.4422863e-7,"teacher_disagreement_score":0.9029582,"about_ca_system_score_codex":0.000085307605,"about_ca_system_score_gemma":0.000046588615,"threshold_uncertainty_score":0.8242779},"labels":[],"label_agreement":null},{"id":"W2079122741","doi":"10.1016/j.sigpro.2008.10.033","title":"An improved partial Haar dual adaptive filter for rapid identification of a sparse echo channel","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Echo (communications protocol); Haar; Dual (grammatical number); Adaptive filter; Filter (signal processing); Channel (broadcasting); Computer science; Identification (biology); Algorithm; Speech recognition; Mathematics; Artificial intelligence; Telecommunications; Computer vision; Computer network; Wavelet","score_opus":0.03919387691156592,"score_gpt":0.26403659841423077,"score_spread":0.22484272150266485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079122741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058005832,0.0001764881,0.94071937,0.0000075463277,0.00006529172,0.0003767277,0.000050595187,0.0005181799,0.00007994813],"genre_scores_gemma":[0.9550524,0.000010841211,0.04447328,0.000011695596,0.00019140397,0.00015095843,0.000024641937,0.00006010885,0.000024692521],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894935,0.000015025752,0.00037058486,0.00025971857,0.00013293527,0.00027237687],"domain_scores_gemma":[0.9994309,0.000028669523,0.00013583859,0.00017525879,0.00016406042,0.00006527511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015970418,0.0001871477,0.00021675481,0.00010425347,0.00012565994,0.00002163445,0.00014476273,0.00008767345,0.000010877213],"category_scores_gemma":[0.000019612591,0.000198766,0.000061246625,0.0001364604,0.000096182324,0.00061482866,0.00002049026,0.00012330241,0.0000020819396],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012943978,0.000056127596,0.000008479841,0.00015730133,0.000022093976,0.0000040967257,0.0011234224,0.013984369,0.95199263,0.00004312559,0.00007971576,0.03239918],"study_design_scores_gemma":[0.00021034273,0.0001723044,0.00013398693,0.000056983274,0.000011646279,0.000008442749,0.000060620197,0.43476883,0.56346583,0.0008518296,0.00008436281,0.00017484155],"about_ca_topic_score_codex":0.0000029016092,"about_ca_topic_score_gemma":0.0000011440151,"teacher_disagreement_score":0.89704657,"about_ca_system_score_codex":0.000052162482,"about_ca_system_score_gemma":0.00003642999,"threshold_uncertainty_score":0.81054425},"labels":[],"label_agreement":null},{"id":"W2079514273","doi":"10.1016/j.sigpro.2011.03.023","title":"A three-layer scheme for M-channel multiple description image coding","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coding (social sciences); Algorithm; Iterative reconstruction; Multiple description coding; Channel (broadcasting); Image (mathematics); Sub-band coding; Layer (electronics); Mathematics; Transform coding; Computer science; Decoding methods; Artificial intelligence; Pattern recognition (psychology); Discrete cosine transform; Telecommunications; Statistics","score_opus":0.106396677333911,"score_gpt":0.29739387616166235,"score_spread":0.19099719882775135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079514273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008225866,0.00016982111,0.9973825,0.000039810486,0.00007461515,0.00032329134,0.0000061204028,0.0006956154,0.0004856305],"genre_scores_gemma":[0.4649498,0.0000015041892,0.534823,0.00008073394,0.000041982166,0.00007099355,0.0000035768796,0.000013509052,0.000014911867],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987011,0.00001632152,0.00025375583,0.000474806,0.0002031755,0.00035083672],"domain_scores_gemma":[0.99913925,0.00005619872,0.00017507462,0.00032389557,0.00021791876,0.00008765473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028026185,0.00017184445,0.00015994406,0.000119444965,0.00031758787,0.00019392758,0.00075381977,0.00006938736,0.00001423568],"category_scores_gemma":[0.0000665533,0.00015807699,0.000056486006,0.00023393115,0.000054942768,0.0027609954,0.000307988,0.00014119125,0.000011966866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009054459,0.00016243897,0.00026190077,0.0002263738,0.000011952472,0.00001403523,0.0014374752,0.000010079215,0.7130385,0.0068386975,0.001743643,0.27616432],"study_design_scores_gemma":[0.00036432326,0.00008328603,0.00013952533,0.00020893346,0.000005089756,0.00001126513,0.00004139829,0.56262314,0.34457046,0.09123997,0.00042609652,0.00028650215],"about_ca_topic_score_codex":0.0000141884,"about_ca_topic_score_gemma":0.0000047737567,"teacher_disagreement_score":0.56261307,"about_ca_system_score_codex":0.000040946317,"about_ca_system_score_gemma":0.000057003122,"threshold_uncertainty_score":0.6446192},"labels":[],"label_agreement":null},{"id":"W2086156411","doi":"10.1016/j.sigpro.2009.03.007","title":"Curvelet based face recognition via dimension reduction","year":2009,"lang":"en","type":"article","venue":"Signal Processing","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of British Columbia","funders":"","keywords":"Curvelet; Contourlet; Wavelet; Artificial intelligence; Pattern recognition (psychology); Wavelet transform; Computer science; Face (sociological concept); Dimensionality reduction; Facial recognition system; Feature extraction; Dimension (graph theory); Feature (linguistics); Curse of dimensionality; Discrete wavelet transform; Computer vision; Mathematics","score_opus":0.023353600170004662,"score_gpt":0.25184882448830165,"score_spread":0.228495224318297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086156411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040546335,0.0001433829,0.956184,0.0015125007,0.00013615562,0.00013596653,0.0000010714298,0.00033820482,0.0010023589],"genre_scores_gemma":[0.9529319,0.0000037719099,0.046198077,0.0006761838,0.000099519544,0.000007034155,0.00002911206,0.000006854037,0.000047552854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.00007024084,0.00020900858,0.000380977,0.0002952621,0.00024129085],"domain_scores_gemma":[0.9994617,0.000018465713,0.00012884401,0.00015080374,0.00015630983,0.00008385175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024353548,0.0001379372,0.00011442932,0.00013300002,0.00028188026,0.00019295694,0.00020209824,0.000069931935,0.0000437163],"category_scores_gemma":[0.000012418808,0.00012743776,0.000047644604,0.00040538493,0.00002044674,0.0012439354,0.000024180697,0.00015890495,0.0001422607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015784817,0.00006111924,0.0000040358773,0.00001413629,9.930042e-7,0.0000035219928,0.00013812014,0.00017415843,0.16149552,0.000009130192,0.00055573846,0.83752775],"study_design_scores_gemma":[0.0006407571,0.00025151068,0.00037800055,0.00047247054,0.000012413971,0.00005044592,0.000075248885,0.5247173,0.45239,0.019991025,0.0005787594,0.00044208468],"about_ca_topic_score_codex":0.000005149198,"about_ca_topic_score_gemma":2.6931528e-7,"teacher_disagreement_score":0.9123856,"about_ca_system_score_codex":0.000036059744,"about_ca_system_score_gemma":0.00006443974,"threshold_uncertainty_score":0.5196761},"labels":[],"label_agreement":null},{"id":"W2086615926","doi":"10.1016/j.sigpro.2012.12.022","title":"Robust H∞ filtering for networked stochastic systems with randomly occurring sensor nonlinearities and packet dropouts","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Control theory (sociology); Network packet; Imperfect; Mathematics; Filter (signal processing); Filtering problem; Bounded function; Norm (philosophy); Exponential stability; Computer science; Filter design; Nonlinear system; Statistics; Artificial intelligence","score_opus":0.017128822959740393,"score_gpt":0.19453743961837194,"score_spread":0.17740861665863156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086615926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17738171,0.003574573,0.8169076,0.000041468877,0.00018642226,0.0011745958,0.000016086333,0.00037305793,0.00034448592],"genre_scores_gemma":[0.9973598,0.0000023368973,0.0017666413,0.000022665614,0.00044202703,0.00029594006,0.000005933085,0.000053828786,0.00005084445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.000026958342,0.0003269252,0.00025066704,0.00017049143,0.00042527152],"domain_scores_gemma":[0.999331,0.00024178188,0.0000683392,0.00011272496,0.00013773478,0.000108426764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022771355,0.00024632763,0.0003961931,0.00006464662,0.00020332314,0.000424238,0.000094207775,0.00008255367,0.0000092030905],"category_scores_gemma":[0.000017018523,0.00020350695,0.000041757197,0.0001028187,0.00007009492,0.0003872568,0.000016878508,0.0001431017,0.0000033455913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017902246,0.000012446109,0.00026982854,0.0022494001,0.00008340162,0.0000032142552,0.00091413246,0.97955143,0.0019376174,0.000020838084,0.00008579199,0.014692852],"study_design_scores_gemma":[0.0018364872,0.00007226305,0.000044791526,0.0008594823,0.000040318428,0.000031955286,0.0021179055,0.9944375,0.00006180658,0.000051114144,0.00014449758,0.0003018499],"about_ca_topic_score_codex":0.0000579549,"about_ca_topic_score_gemma":0.000010833921,"teacher_disagreement_score":0.81997806,"about_ca_system_score_codex":0.000046170597,"about_ca_system_score_gemma":0.000029740162,"threshold_uncertainty_score":0.82987726},"labels":[],"label_agreement":null},{"id":"W2089594082","doi":"10.1016/s0165-1684(03)00091-4","title":"Moment-based fast discrete Hartley transform","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"University of Hong Kong; National Natural Science Foundation of China","keywords":"Discrete Hartley transform; Mathematics; Computation; Moment (physics); Sequence (biology); Computational complexity theory; Modular design; Hartley transform; Algorithm; Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis; Fourier transform; Physics","score_opus":0.02330945482248602,"score_gpt":0.26721630421799203,"score_spread":0.243906849395506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089594082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089675095,0.000064427695,0.9723844,0.00037637926,0.000046425048,0.00012326917,0.0000026917073,0.00011447526,0.02599116],"genre_scores_gemma":[0.9751307,5.3461355e-7,0.023917219,0.0005086923,0.000017311966,0.0000151264285,0.0000071054574,0.000009576136,0.00039376313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998976,0.000029971252,0.0001917747,0.00025669197,0.00026802765,0.00027755546],"domain_scores_gemma":[0.99966896,0.000016093893,0.000055547804,0.00012473308,0.000047442114,0.000087247696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017283489,0.00012031623,0.00009225866,0.000077646546,0.000149332,0.0005538242,0.0002684572,0.000022795883,0.000057764813],"category_scores_gemma":[0.0000037532163,0.00010734735,0.000045377757,0.00030267693,0.000027130547,0.0014790235,0.000012805137,0.00006279938,0.000037657803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010671373,0.00007697131,0.00017117058,0.00008822173,0.000009317442,0.000011072989,0.00089223095,0.00017696337,0.017077267,0.018597828,0.0004978481,0.9623904],"study_design_scores_gemma":[0.0029026954,0.0006196743,0.00036433226,0.00027386207,0.00002790468,0.00003447358,0.00037937236,0.24094634,0.6543517,0.043830972,0.055083793,0.0011848741],"about_ca_topic_score_codex":0.0000022778681,"about_ca_topic_score_gemma":0.000001165414,"teacher_disagreement_score":0.9742339,"about_ca_system_score_codex":0.000034809294,"about_ca_system_score_gemma":0.00013771522,"threshold_uncertainty_score":0.5340539},"labels":[],"label_agreement":null},{"id":"W2091972047","doi":"10.1016/j.sigpro.2010.05.019","title":"Joint source-decoding in large scale sensor networks using Markov random field models","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Computer science; Markov process; Markov random field; Algorithm; Scalability; Joint (building); Markov chain; Quantization (signal processing); Vector quantization; Artificial intelligence; Mathematics; Machine learning; Statistics; Engineering","score_opus":0.016343662333652698,"score_gpt":0.2379779742394222,"score_spread":0.22163431190576952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091972047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045207493,0.00016035931,0.9529192,0.00014045712,0.00042362924,0.00014746144,0.0000013876746,0.00020242792,0.0007976035],"genre_scores_gemma":[0.9228311,0.0000054328407,0.0763205,0.00037820538,0.0003595059,0.0000059497993,0.0000021932196,0.000020619866,0.00007648754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980879,0.000056836212,0.00043002746,0.0005016041,0.00028984767,0.00063380605],"domain_scores_gemma":[0.9991833,0.00011147253,0.0001680166,0.00027000392,0.00011272781,0.00015447658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438752,0.00021524963,0.0002958238,0.00017086355,0.00038776774,0.0005648286,0.00036802958,0.0002043548,0.000045134253],"category_scores_gemma":[0.00002763901,0.00020743668,0.00010297897,0.00068171835,0.0000351179,0.00082443375,0.00018672594,0.0007739331,0.00000477475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007579433,0.00011916967,0.0003728177,0.00004053928,0.000011884658,0.000052009287,0.00072291517,0.59848064,0.0077364817,0.00019197894,0.00015322643,0.39204252],"study_design_scores_gemma":[0.00096787955,0.000022058044,0.000027493117,0.0000977071,0.000006157393,0.0000596913,0.00010412399,0.9954961,0.0017642647,0.0009801204,0.00020384081,0.0002705736],"about_ca_topic_score_codex":0.000035839894,"about_ca_topic_score_gemma":0.000048202808,"teacher_disagreement_score":0.8776236,"about_ca_system_score_codex":0.000038396385,"about_ca_system_score_gemma":0.000070726855,"threshold_uncertainty_score":0.8459022},"labels":[],"label_agreement":null},{"id":"W2093238275","doi":"10.1016/j.sigpro.2010.12.005","title":"Some empirical advances in matrix completion","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Minification; Mathematical optimization; Matrix norm; Convex optimization; Matrix (chemical analysis); Sampling (signal processing); Mathematics; Low-rank approximation; Algorithm; Norm (philosophy); Regular polygon; Optimization problem; Sparse matrix; Computer science","score_opus":0.017014906061336873,"score_gpt":0.2983029703516247,"score_spread":0.2812880642902878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093238275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9377146,0.0071886815,0.048009697,0.00013201489,0.0003131844,0.00015562987,0.0000018965059,0.0014994869,0.0049848272],"genre_scores_gemma":[0.9933857,0.000047850215,0.006238617,0.000052789805,0.0002371463,0.000005769268,0.0000027313984,0.000020115422,0.000009285766],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.0000090979465,0.00014556067,0.00012228393,0.000111010515,0.00018099311],"domain_scores_gemma":[0.9998215,0.000020509518,0.000021460393,0.00007666674,0.000025899855,0.000033979915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007622127,0.00010011361,0.000120357836,0.000095815994,0.00004627409,0.00004592461,0.00009338194,0.00006997134,0.000022354847],"category_scores_gemma":[0.000006412951,0.000097726785,0.0000221333,0.0001393977,0.000036801906,0.00038358857,0.00001627633,0.00030425013,0.000013084394],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023721284,0.000060634946,0.0057032336,0.0001520565,0.000005888542,0.000044290504,0.00039269254,0.011639676,0.74247676,0.0009535398,0.001013049,0.23753448],"study_design_scores_gemma":[0.00054949167,0.000061034756,0.006691337,0.00042762168,0.0000146677785,0.000064028995,0.0000982799,0.7059106,0.1978027,0.05224468,0.035346415,0.00078911934],"about_ca_topic_score_codex":0.000002955459,"about_ca_topic_score_gemma":0.000013801926,"teacher_disagreement_score":0.69427097,"about_ca_system_score_codex":0.000016625027,"about_ca_system_score_gemma":0.000013417482,"threshold_uncertainty_score":0.39851826},"labels":[],"label_agreement":null},{"id":"W2100344887","doi":"10.1016/j.sigpro.2013.05.003","title":"Oversampled perfect reconstruction DFT modulated filter banks for multi-carrier transceiver systems","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyphase system; Additive white Gaussian noise; Filter bank; Carrier frequency offset; Algorithm; Orthogonal frequency-division multiplexing; Electronic engineering; Transceiver; Mathematics; Parametric statistics; Computer science; Prototype filter; Topology (electrical circuits); Filter (signal processing); Filter design; Channel (broadcasting); Frequency offset; Telecommunications; Wireless; Engineering","score_opus":0.028981199299515176,"score_gpt":0.23962612420912896,"score_spread":0.21064492490961378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100344887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60344267,0.00093867397,0.3914158,0.000034861438,0.0012961997,0.0010703326,0.00004907099,0.00081030355,0.0009421148],"genre_scores_gemma":[0.9937462,0.000005037523,0.005291761,0.000013597833,0.00029424662,0.00021289045,0.000020023423,0.00006714396,0.00034906418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989346,0.000025484846,0.00030425767,0.00025606964,0.00014328676,0.0003363013],"domain_scores_gemma":[0.9995356,0.000033182292,0.00005690788,0.000115558396,0.00016272653,0.00009598773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010869488,0.00021164409,0.0002163585,0.000120770594,0.00016619306,0.0001760096,0.00010025949,0.00015616955,0.00036200724],"category_scores_gemma":[0.000014584029,0.00021005135,0.00009241537,0.00016207389,0.000053294505,0.00067759724,0.000005124903,0.0001823375,0.00005508978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035222773,0.00003272241,0.00038516257,0.0012310616,0.00016576955,0.0000011434406,0.0013130096,0.20308109,0.64657056,0.000022912036,0.0018256556,0.14533567],"study_design_scores_gemma":[0.00084737,0.00002675416,0.00047565246,0.000194832,0.000035266035,0.00003967953,0.00025231775,0.9807062,0.015840407,0.000062306135,0.0011973077,0.00032187792],"about_ca_topic_score_codex":0.000040056708,"about_ca_topic_score_gemma":0.0000010408053,"teacher_disagreement_score":0.77762514,"about_ca_system_score_codex":0.00011912449,"about_ca_system_score_gemma":0.000030502959,"threshold_uncertainty_score":0.8565646},"labels":[],"label_agreement":null},{"id":"W2107023572","doi":"10.1016/j.sigpro.2011.09.035","title":"ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Equalization (audio); Computer science; Channel (broadcasting); Viterbi algorithm; Algorithm; Adaptive equalizer; Maximum likelihood sequence estimation; Intersymbol interference; Sparse approximation; Sequence (biology); Estimation theory; Decoding methods; Telecommunications","score_opus":0.07973093308475858,"score_gpt":0.3067964404288097,"score_spread":0.22706550734405112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107023572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011986199,0.0000793624,0.98605585,0.00027666384,0.0000127839985,0.000323463,0.000001860384,0.00026408964,0.0009997105],"genre_scores_gemma":[0.9698425,0.0000056279778,0.02933073,0.0006808927,0.00001174733,0.00008426536,0.00001760731,0.000011211848,0.000015448062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879736,0.00009168748,0.0002632365,0.00040595117,0.00026364365,0.00017814862],"domain_scores_gemma":[0.99942935,0.00003681797,0.00019299416,0.00016608063,0.00011766798,0.000057090096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005614789,0.00013655939,0.00011402634,0.00020823412,0.000117380834,0.00013537785,0.00028513093,0.00009254512,0.0000045515276],"category_scores_gemma":[0.00003747746,0.00014000337,0.000013736421,0.00054897554,0.00003538124,0.0012167759,0.000039446153,0.0001293998,0.000010617732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101906706,0.000529867,0.00058490405,0.00043000458,0.000007830329,0.00001528388,0.017738333,0.025485864,0.19559783,0.09299872,0.0001609212,0.6663485],"study_design_scores_gemma":[0.00014479521,0.000075106494,0.00011756344,0.00011559821,0.0000021524243,0.0000024396818,0.000016889046,0.9024068,0.08174163,0.01521008,0.000017436534,0.0001495047],"about_ca_topic_score_codex":0.000034617602,"about_ca_topic_score_gemma":0.0000055368805,"teacher_disagreement_score":0.9578563,"about_ca_system_score_codex":0.000066677065,"about_ca_system_score_gemma":0.0001060222,"threshold_uncertainty_score":0.5709172},"labels":[],"label_agreement":null},{"id":"W2130302745","doi":"10.1016/j.sigpro.2012.11.012","title":"Outage-based design of robust Tomlinson–Harashima transceivers for the MISO downlink with QoS requirements","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of British Columbia","funders":"","keywords":"Telecommunications link; Probabilistic logic; Quality of service; Computer science; Transceiver; Mathematical optimization; Transmitter; Channel (broadcasting); Channel state information; Computer network; Mathematics; Wireless; Telecommunications","score_opus":0.03183494789118279,"score_gpt":0.23033139524182,"score_spread":0.1984964473506372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130302745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001367598,0.0004408509,0.9966757,0.00005881653,0.000057855344,0.0011028469,0.000007295956,0.00014503044,0.00014397131],"genre_scores_gemma":[0.9049115,0.000004726463,0.09469392,0.00003082632,0.00006923077,0.00018782528,0.000008897445,0.00005233368,0.000040738105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991249,0.000020172152,0.00027363855,0.0001715512,0.00016437855,0.0002453675],"domain_scores_gemma":[0.99940896,0.000116857096,0.00010342009,0.00013193292,0.00019352791,0.00004531127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015779967,0.00017298477,0.0001800593,0.00006104956,0.00012819015,0.000056469915,0.00016853157,0.000062056526,0.000038031783],"category_scores_gemma":[0.000011981559,0.0001235055,0.00004031941,0.00019148395,0.00005721644,0.00040777333,0.0000026417922,0.00008811181,0.000004457132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043532687,0.000013227685,0.00005424663,0.00038238105,0.00002861538,4.2225665e-7,0.00027022365,0.95622516,0.03043034,0.0000026817484,0.00009401562,0.012455154],"study_design_scores_gemma":[0.0009449841,0.00009039671,0.000035068424,0.00029295552,0.00005206737,0.000001135011,0.0002634019,0.9637584,0.034291077,0.000034007047,0.00005659308,0.0001799237],"about_ca_topic_score_codex":0.000008029426,"about_ca_topic_score_gemma":0.00000229354,"teacher_disagreement_score":0.9035439,"about_ca_system_score_codex":0.000060500057,"about_ca_system_score_gemma":0.00006098804,"threshold_uncertainty_score":0.5036408},"labels":[],"label_agreement":null},{"id":"W2152904516","doi":"10.1016/s0165-1684(03)00058-6","title":"On the geodesic paths approach to color image filtering","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geodesic; Filter (signal processing); Mathematics; Median filter; Noise reduction; Noise (video); Gaussian noise; Bilateral filter; Computer vision; Reduction (mathematics); Algorithm; Image (mathematics); Artificial intelligence; Computer science; Image processing","score_opus":0.03313710968084864,"score_gpt":0.27262792181480827,"score_spread":0.23949081213395962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152904516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006979941,0.00009436129,0.94425327,0.00034892972,0.000080000245,0.00019409433,4.930296e-7,0.000121846926,0.047927096],"genre_scores_gemma":[0.6602423,5.622941e-7,0.3370591,0.0021531703,0.0000467947,0.000031996122,3.5697875e-7,0.000016308744,0.00044935851],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982846,0.00028468767,0.00020166657,0.00044968494,0.000359446,0.00041990727],"domain_scores_gemma":[0.9991237,0.0002449144,0.00007244949,0.00035424923,0.00009922383,0.00010548709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012897219,0.00018446891,0.00016152461,0.00009388071,0.00049377483,0.0007392827,0.0007679358,0.00004585183,0.000022435976],"category_scores_gemma":[0.00016530378,0.00012599313,0.000060707353,0.00060787605,0.000051387757,0.00044911384,0.000108035165,0.00023206383,0.00008659631],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008849342,0.0003839479,0.000012180084,0.00019946841,0.00003157981,0.00010586007,0.0066049397,0.0052738274,0.46153867,0.16584086,0.00522464,0.3546955],"study_design_scores_gemma":[0.0012909516,0.00053013157,0.00014126365,0.00042968016,0.000031664138,0.00019767668,0.00046458672,0.38063335,0.50888056,0.09662148,0.009356894,0.0014217818],"about_ca_topic_score_codex":0.0000037397929,"about_ca_topic_score_gemma":1.2598439e-7,"teacher_disagreement_score":0.65326244,"about_ca_system_score_codex":0.00004292165,"about_ca_system_score_gemma":0.00011551148,"threshold_uncertainty_score":0.712892},"labels":[],"label_agreement":null},{"id":"W2154286128","doi":"10.1016/j.sigpro.2004.04.006","title":"A novel signal-processing strategy for hearing-aid design: neurocompensation","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Hearing Loss and Rehabilitation","field":"Neuroscience","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hearing aid; Signal processing; Computer science; Speech recognition; SIGNAL (programming language); Digital signal processing; Engineering; Computer hardware; Electrical engineering","score_opus":0.1288607306261344,"score_gpt":0.3317964600104142,"score_spread":0.20293572938427978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154286128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1513063,0.00009878765,0.84671,0.00046624313,0.000056754066,0.0006895419,0.0000043433206,0.00022965847,0.00043836806],"genre_scores_gemma":[0.9699232,0.0000019930467,0.029102912,0.000513119,0.00021945812,0.00008849933,0.0000034738182,0.00005909113,0.000088244895],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776787,0.000070055066,0.000459508,0.00072193856,0.0004305368,0.0005501067],"domain_scores_gemma":[0.99903804,0.00028838412,0.00021870452,0.00013096354,0.00017944063,0.00014445178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243847,0.00026447748,0.0002499835,0.00017157399,0.0008511324,0.00048243988,0.00023383246,0.00012713946,0.000017253391],"category_scores_gemma":[0.00017259996,0.00024455177,0.000096035976,0.0005116914,0.00016226416,0.0008869215,0.000040111947,0.00026180843,0.0000176678],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083965446,0.00013462537,0.000014987916,0.00026719907,0.000001372715,0.0000035913872,0.0006260157,0.07213552,0.8038884,0.00062387896,0.0000040836,0.12221635],"study_design_scores_gemma":[0.0037533098,0.0011873551,0.0023653274,0.0008900898,0.000049662456,0.0001209027,0.00044379485,0.28642315,0.67275774,0.030666543,0.0003989446,0.0009431843],"about_ca_topic_score_codex":0.000030194637,"about_ca_topic_score_gemma":0.0000015091547,"teacher_disagreement_score":0.8186169,"about_ca_system_score_codex":0.00013492376,"about_ca_system_score_gemma":0.0005528807,"threshold_uncertainty_score":0.9972532},"labels":[],"label_agreement":null},{"id":"W2164283738","doi":"10.1016/j.sigpro.2012.04.014","title":"A robust detector of known signal in non-Gaussian noise using threshold systems","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Gaussian noise; Probability density function; Noise (video); Detector; Value noise; Detection theory; Noise spectral density; Noise measurement; Additive white Gaussian noise; Robustness (evolution); Gradient noise; Matched filter; White noise; Mathematics; Algorithm; Gaussian; Noise floor; Computer science; Statistics; Noise reduction; Noise figure; Artificial intelligence; Physics; Telecommunications; Bandwidth (computing)","score_opus":0.03320405632123942,"score_gpt":0.2486538770088694,"score_spread":0.21544982068762997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164283738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07986338,0.0014363079,0.91719943,0.000016324908,0.00035555437,0.0001928718,0.00000417365,0.00009200169,0.00083993375],"genre_scores_gemma":[0.98848075,0.0000025919917,0.011088919,0.000027547501,0.00034038565,0.000009190496,0.000001686972,0.000018970333,0.000029951518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810874,0.000059709222,0.0004934627,0.00033183754,0.00040228374,0.00060395396],"domain_scores_gemma":[0.9991352,0.000043128086,0.00026942184,0.00023123594,0.00012795032,0.0001930752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005270961,0.00021231097,0.00031727477,0.00023874335,0.00016176888,0.00024236961,0.00043381847,0.00013157459,0.000017592272],"category_scores_gemma":[0.000007934823,0.00019435471,0.000074857264,0.0010858473,0.000063299696,0.0010898268,0.00012566384,0.0002684689,0.00000859516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010522448,0.00078250346,0.010295912,0.00085280195,0.00006483551,0.000075686075,0.0027399599,0.6707364,0.07490771,0.0011467728,0.00016985949,0.23812234],"study_design_scores_gemma":[0.00034721158,0.000051711962,0.0008272843,0.00033399145,0.000010181181,0.000049312162,0.00014240043,0.9932657,0.004551341,0.00006595073,0.00010160211,0.00025330877],"about_ca_topic_score_codex":0.00008578293,"about_ca_topic_score_gemma":0.000004836357,"teacher_disagreement_score":0.9086174,"about_ca_system_score_codex":0.00010700541,"about_ca_system_score_gemma":0.000114382085,"threshold_uncertainty_score":0.7925555},"labels":[],"label_agreement":null},{"id":"W2273269588","doi":"10.1016/j.sigpro.2016.01.016","title":"Rotation invariant HOG for object localization in web images","year":2016,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Invariant (physics); Histogram; Computer vision; Robustness (evolution); Histogram of oriented gradients; Rotation (mathematics); Computer science; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Mathematics; Feature extraction; Image (mathematics)","score_opus":0.018785604059985157,"score_gpt":0.2912272856869152,"score_spread":0.27244168162693005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273269588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034463845,0.00023659205,0.9982628,0.00044062783,0.000020729334,0.00022805885,0.0000017669217,0.00018601867,0.00027876126],"genre_scores_gemma":[0.8969045,0.000024862698,0.10268486,0.00021764028,0.000045957317,0.000042476036,0.0000015733802,0.00000969006,0.00006839452],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918413,0.000030116978,0.0001927487,0.00026604728,0.00013592413,0.00019100687],"domain_scores_gemma":[0.99952865,0.00009410003,0.000097507065,0.00010889209,0.0001408252,0.00003001399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965039,0.00009017282,0.00009962499,0.00012616259,0.000090833484,0.000118388925,0.00023536214,0.000041805004,0.000004183457],"category_scores_gemma":[0.000118099975,0.00006407108,0.000024649893,0.00037238773,0.00003048531,0.001695662,0.00004987976,0.00004133517,0.0000041670764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018438743,0.000021283995,0.00025370542,0.00004639269,0.0000012743067,0.000004091702,0.00015539576,0.000040329942,0.11290619,0.0015076736,0.00016732763,0.8848779],"study_design_scores_gemma":[0.0007939867,0.00017406738,0.00024006957,0.0005104165,0.000004075179,0.000007404818,0.00003064124,0.13579273,0.7684325,0.09210257,0.0016297942,0.00028174784],"about_ca_topic_score_codex":0.0000024929805,"about_ca_topic_score_gemma":0.0000033540773,"teacher_disagreement_score":0.8965599,"about_ca_system_score_codex":0.000057715206,"about_ca_system_score_gemma":0.0001226748,"threshold_uncertainty_score":0.26127428},"labels":[],"label_agreement":null},{"id":"W2363380895","doi":"","title":"A Group Target Data Association Algorithm Based On D-S evidence theory","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Measurement and Detection Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Association (psychology); Group (periodic table); Matching (statistics); Algorithm; Function (biology); Feature (linguistics); Composition (language); Object (grammar); Computer science; Association scheme; Assignment problem; Data association; Pattern recognition (psychology); Mathematics; Artificial intelligence; Mathematical optimization; Statistics; Combinatorics","score_opus":0.11050778456377704,"score_gpt":0.3000194647845649,"score_spread":0.1895116802207879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363380895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022612225,0.00075526314,0.9947568,0.000006591665,0.00016998735,0.00008453676,0.0000053498484,0.00034271562,0.0036525936],"genre_scores_gemma":[0.59046227,0.0000098734645,0.40904725,0.00012460056,0.0002028355,0.000014616753,0.000011986237,0.00003512059,0.000091441965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990439,0.00009439584,0.00015661064,0.00021160301,0.00029326085,0.00020024949],"domain_scores_gemma":[0.99946666,0.00015576805,0.00006464025,0.0002057745,0.000057736732,0.00004943903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015556777,0.00011911369,0.000108262226,0.00007383299,0.00010341134,0.00003560905,0.00019813392,0.00006686773,0.00016606002],"category_scores_gemma":[0.00019574496,0.000114394075,0.000023167413,0.00019878212,0.00001247334,0.00062055327,0.000020903573,0.00019161985,0.000021888729],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007092853,0.000043431926,0.0004198082,0.00013108143,0.00002069983,0.000004807316,0.00024622772,0.0052849366,0.014235476,0.000043711265,0.00023680714,0.97926205],"study_design_scores_gemma":[0.00026142033,0.00007629654,0.00039525665,0.00029135382,0.000031496464,8.396428e-7,0.000059919825,0.95492095,0.035270784,0.0072909254,0.0011362968,0.00026449372],"about_ca_topic_score_codex":0.0000013817238,"about_ca_topic_score_gemma":5.9950906e-7,"teacher_disagreement_score":0.9789976,"about_ca_system_score_codex":0.0001157366,"about_ca_system_score_gemma":0.000024769555,"threshold_uncertainty_score":0.4664855},"labels":[],"label_agreement":null},{"id":"W2377974534","doi":"","title":"An Improved Method of Ghost Correction Algorithm for EPI","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Algorithm; Homogeneity (statistics); Image quality; Echo-planar imaging; Imaging phantom; ENCODE; Reliability (semiconductor); Computer science; Degenerate energy levels; Artificial intelligence; Image (mathematics); Computer vision; Physics; Optics","score_opus":0.021481947656575247,"score_gpt":0.3987591442271921,"score_spread":0.37727719657061687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377974534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055509526,0.00008301146,0.99819136,0.00005508353,0.000026600772,0.00040925317,0.000004875005,0.00010536631,0.0005693797],"genre_scores_gemma":[0.22324723,0.000002366888,0.77626944,0.000096480355,0.0001395795,0.000033683948,0.000020319574,0.000015673942,0.00017524701],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941903,0.000005041327,0.00019981318,0.00015976025,0.000074170755,0.0001421689],"domain_scores_gemma":[0.9994531,0.00005346165,0.000121609046,0.00009434533,0.00021194332,0.00006554083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036215,0.0000702182,0.00014108497,0.000059514037,0.00008558508,0.0000063618395,0.00004033491,0.00006109239,0.000009607764],"category_scores_gemma":[0.000015223106,0.000062675055,0.00004113853,0.00016696077,0.000029933088,0.00009729479,0.0000061088126,0.00008537559,3.3714363e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037447793,0.00006303732,0.00001643289,0.000030326994,0.0000016478522,3.0395492e-7,0.000051484672,0.0000115139665,0.24620798,0.000030013907,0.000027451295,0.75352234],"study_design_scores_gemma":[0.00041209563,0.00044772628,0.00018165764,0.000087063505,0.000048616246,0.00003235149,0.00031003673,0.32650506,0.66749763,0.0019075762,0.0024815036,0.000088700974],"about_ca_topic_score_codex":0.000012727431,"about_ca_topic_score_gemma":0.0000018581939,"teacher_disagreement_score":0.75343364,"about_ca_system_score_codex":0.000031156986,"about_ca_system_score_gemma":0.00005433831,"threshold_uncertainty_score":0.25558147},"labels":[],"label_agreement":null},{"id":"W2380159924","doi":"","title":"The Moving Object Detection based on Local Hierarchical GMM","year":2009,"lang":"en","type":"article","venue":"Signal Processing","topic":"Remote Sensing and Land Use","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Mixture model; Artificial intelligence; Dispose pattern; Computer science; Pattern recognition (psychology); Block (permutation group theory); Object detection; Computer vision; Process (computing); Pixel; Mathematics","score_opus":0.008985493593931698,"score_gpt":0.21043760370581435,"score_spread":0.20145211011188266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380159924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7368258,0.0011833987,0.1828875,0.003034233,0.0004583084,0.00027964663,0.0000049363143,0.0004040854,0.07492206],"genre_scores_gemma":[0.9986927,0.000004121116,0.00029129483,0.0007349928,0.00020173931,4.855424e-8,0.000005433958,0.0000026126067,0.000067050285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904925,0.00008364562,0.00013130762,0.00019021878,0.00027075742,0.0002748024],"domain_scores_gemma":[0.999569,0.00018479001,0.000045989822,0.000092620125,0.000025218982,0.00008238709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003257413,0.00010446897,0.00008342259,0.000048382233,0.0007868213,0.00021363988,0.000104315935,0.00005549638,0.000041980522],"category_scores_gemma":[0.000032486307,0.000060660543,0.000043935917,0.000186845,0.00007401562,0.00009410419,0.0000016765297,0.0002611041,0.000039042156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010645394,0.000006143155,0.00042932978,0.0000040916857,0.0000011226143,0.000008970664,0.000044172746,0.023240633,0.00016762827,0.0000021015326,0.00001757581,0.97597176],"study_design_scores_gemma":[0.00015795826,0.00028076104,0.03906273,0.000055152505,0.0000056956114,0.000010694522,0.00006327819,0.9568363,0.0011633289,0.0010990357,0.0011510523,0.00011400318],"about_ca_topic_score_codex":0.00012507432,"about_ca_topic_score_gemma":0.00024837456,"teacher_disagreement_score":0.9758578,"about_ca_system_score_codex":0.0000068896234,"about_ca_system_score_gemma":0.00007045931,"threshold_uncertainty_score":0.60516727},"labels":[],"label_agreement":null},{"id":"W2406034201","doi":"10.1016/j.sigpro.2016.05.018","title":"A study on image denoising in contourlet domain using the alpha-stable family of distributions","year":2016,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Contourlet; Mathematics; Noise reduction; Maximum a posteriori estimation; Prior probability; Univariate; Pattern recognition (psychology); Artificial intelligence; Wavelet; Estimator; Noise (video); Bivariate analysis; Generalized normal distribution; Algorithm; Bayesian probability; Statistics; Image (mathematics); Computer science; Wavelet transform; Multivariate statistics; Normal distribution; Maximum likelihood","score_opus":0.045358107193626596,"score_gpt":0.3249399175778486,"score_spread":0.27958181038422203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406034201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35389787,0.00017214433,0.64510006,0.00020694577,0.00004276235,0.00018630404,0.000003963059,0.00003345644,0.00035652585],"genre_scores_gemma":[0.9599435,0.0000011843855,0.03982765,0.00011335661,0.000054326254,0.000009605075,3.9956754e-7,0.000013586172,0.00003643319],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977792,0.0004962993,0.00044622406,0.0004056122,0.000448355,0.000424291],"domain_scores_gemma":[0.99874365,0.00041484393,0.00021748933,0.00038723042,0.00017900269,0.000057789297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019177373,0.00018879562,0.00028072836,0.0001628147,0.00035450692,0.0002618616,0.00074210664,0.00004783301,0.0000051599545],"category_scores_gemma":[0.00010437421,0.00011057639,0.00006702641,0.0007802069,0.00015604374,0.00085741753,0.00018719466,0.00017846288,0.000004930571],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000712767,0.00036658012,0.0012918201,0.000025133188,0.000017889324,0.00012290078,0.0034693363,0.00008929774,0.9187098,0.0013275497,0.000041874384,0.07446651],"study_design_scores_gemma":[0.019379927,0.002383305,0.06393357,0.005776299,0.00020477515,0.00025711572,0.011715276,0.046394464,0.7180044,0.12811872,0.00097306934,0.0028590674],"about_ca_topic_score_codex":0.00008372504,"about_ca_topic_score_gemma":0.0000072511566,"teacher_disagreement_score":0.6060456,"about_ca_system_score_codex":0.00012709625,"about_ca_system_score_gemma":0.00020181606,"threshold_uncertainty_score":0.45091742},"labels":[],"label_agreement":null},{"id":"W2570372101","doi":"10.1016/j.sigpro.2017.01.001","title":"Gaussian filters for parameter and state estimation: A general review of theory and recent trends","year":2017,"lang":"en","type":"review","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; McMaster University","funders":"","keywords":"Computer science; Parametric statistics; Robustness (evolution); Gaussian; Gaussian noise; Kalman filter; Estimation theory; Nonlinear system; State (computer science); Noise (video); Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Control (management); Statistics","score_opus":0.08643494222221643,"score_gpt":0.3790179068213947,"score_spread":0.29258296459917826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570372101","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.5877052e-7,0.7428,0.2566403,0.000078064724,0.00008053071,0.0002114636,0.000037500522,0.000028059378,0.0001239182],"genre_scores_gemma":[0.0000040073105,0.9210735,0.07836174,0.00015335453,0.00006118883,0.000047021604,0.00007240695,0.000019915977,0.000206861],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982754,0.00019155204,0.0005815632,0.0005244334,0.00018682929,0.00024019384],"domain_scores_gemma":[0.9982016,0.0003643976,0.000810124,0.00043371704,0.000090856294,0.00009931793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986619,0.00029027427,0.0010132713,0.00012803527,0.0002480993,0.00033487406,0.0005112397,0.00014128113,0.000014632853],"category_scores_gemma":[0.00012418692,0.00021110507,0.00012524602,0.00016468593,0.00012743023,0.0003682607,0.00019334684,0.00025276758,7.2432675e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037349942,0.000007366472,1.5342859e-7,0.0524777,0.000019778483,0.0000026743494,0.000047696376,0.0000025108016,1.0346142e-7,0.00028973166,0.0008113395,0.9463372],"study_design_scores_gemma":[0.00012796484,0.00005896494,0.0000012473612,0.11470616,0.00021834149,0.00007298713,0.0000010087011,0.009138136,0.0000015002726,0.0024967063,0.8728696,0.0003073809],"about_ca_topic_score_codex":0.0000014223913,"about_ca_topic_score_gemma":2.9807012e-7,"teacher_disagreement_score":0.94602984,"about_ca_system_score_codex":0.000017878509,"about_ca_system_score_gemma":0.00013995665,"threshold_uncertainty_score":0.8608615},"labels":[],"label_agreement":null},{"id":"W2617877636","doi":"10.1016/j.sigpro.2017.05.019","title":"A projection matrix design method for MSE reduction in adaptive compressive sensing","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"China Postdoctoral Science Foundation","keywords":"Compressed sensing; Matrix (chemical analysis); Projection (relational algebra); Algorithm; SIGNAL (programming language); Sparse matrix; Mean squared error; Mathematics; Mathematical optimization; Dykstra's projection algorithm; Reduction (mathematics); Signal reconstruction; Optimization problem; Signal processing; Computer science; Statistics","score_opus":0.05996828308211537,"score_gpt":0.33565830647334516,"score_spread":0.2756900233912298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617877636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006520798,0.00032837447,0.9909241,0.000038866965,0.00013733291,0.000603077,0.0000020845318,0.00047523904,0.0009701141],"genre_scores_gemma":[0.67588097,0.000006223446,0.32383737,0.0000059700365,0.00017391243,0.000025173325,0.0000019022805,0.0000368935,0.000031575404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990112,0.00006303357,0.00023465675,0.00027739024,0.00012632294,0.00028739905],"domain_scores_gemma":[0.9993854,0.00006317928,0.00016000177,0.0002061917,0.00014627051,0.000038942253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340472,0.00019448335,0.00023860448,0.00017326913,0.00042556046,0.0002424692,0.00014972342,0.0001233639,0.0000020634245],"category_scores_gemma":[0.00003820305,0.00020238108,0.000055086704,0.00009392861,0.000052108164,0.0005095775,0.000032613076,0.00021601636,0.000001627747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025479984,0.000026833206,0.000014641722,0.000117175194,0.00003508411,0.000020529897,0.0010595602,0.088198364,0.36863023,0.00008471874,0.00072578026,0.5408323],"study_design_scores_gemma":[0.0002831079,0.000052862048,0.000048833666,0.0004131726,0.000021736005,0.000041763153,0.00019540114,0.756559,0.23710167,0.0049930634,0.00009183609,0.00019755868],"about_ca_topic_score_codex":0.00008520077,"about_ca_topic_score_gemma":0.000008150625,"teacher_disagreement_score":0.66936016,"about_ca_system_score_codex":0.0001136638,"about_ca_system_score_gemma":0.000049896957,"threshold_uncertainty_score":0.8252861},"labels":[],"label_agreement":null},{"id":"W2621841016","doi":"10.1016/j.sigpro.2017.05.030","title":"LMAE: A large margin Auto-Encoders for classification","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China University of Petroleum, Beijing; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Softmax function; MNIST database; Encoder; Pattern recognition (psychology); Computer science; Artificial intelligence; Classifier (UML); Discriminative model; Margin (machine learning); Artificial neural network; Feature learning; Deep learning; Autoencoder; Algorithm; Machine learning","score_opus":0.048342974523918676,"score_gpt":0.33014132792545486,"score_spread":0.2817983534015362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621841016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006001952,0.00010592693,0.98985726,0.004701591,0.000106675776,0.0001720712,0.000006545629,0.00020527958,0.004244431],"genre_scores_gemma":[0.95012814,0.0000035832707,0.048785932,0.00018186079,0.00012927859,0.00005077637,0.000030847004,0.000011629704,0.00067797484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998848,0.00003717271,0.00018886689,0.00043227067,0.00020991938,0.00028376584],"domain_scores_gemma":[0.9987513,0.000052375653,0.00034366388,0.0006530613,0.00012792984,0.00007166366],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068771874,0.00011580334,0.000114711045,0.00007026997,0.0014183169,0.0011523962,0.0011171945,0.00006855019,0.00000978836],"category_scores_gemma":[0.00018646994,0.000107535685,0.000046397417,0.00008249648,0.000049950082,0.0013588484,0.00012959103,0.0001460056,0.000035047608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001590966,0.00006606204,0.0024325438,0.00012380333,0.0000066469174,0.0000014411556,0.00050047575,0.000021167092,0.0077993236,0.048095882,0.0015533556,0.9393834],"study_design_scores_gemma":[0.0003836874,0.00003110251,0.01612448,0.000052810617,0.000006861659,0.0000034051716,0.000057408317,0.9424575,0.00032480183,0.004744879,0.03565149,0.00016156709],"about_ca_topic_score_codex":0.000012701434,"about_ca_topic_score_gemma":0.000005386656,"teacher_disagreement_score":0.9495279,"about_ca_system_score_codex":0.000034612556,"about_ca_system_score_gemma":0.0001458634,"threshold_uncertainty_score":0.9998845},"labels":[],"label_agreement":null},{"id":"W2781206324","doi":"10.1016/j.sigpro.2017.12.019","title":"Expectation maximization estimation for a class of input nonlinear state space systems by using the Kalman smoother","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Kalman filter; Nonlinear system; Class (philosophy); State space; Mathematics; Moving horizon estimation; State (computer science); State-space representation; Expectation–maximization algorithm; Extended Kalman filter; Computer science; Control theory (sociology); Algorithm; Mathematical optimization; Maximum likelihood; Artificial intelligence; Statistics; Physics","score_opus":0.01750845884092055,"score_gpt":0.25669381709156763,"score_spread":0.23918535825064707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781206324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10157313,0.00057774154,0.8968563,0.00023566054,0.00012822337,0.00046455298,0.00001365082,0.0000580806,0.00009264264],"genre_scores_gemma":[0.99813193,0.0000024025176,0.00155498,0.000015322998,0.000118683856,0.00004113678,0.000020193942,0.000030211979,0.00008511991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933386,0.000020706433,0.00026615203,0.000113986316,0.00014469046,0.000120605626],"domain_scores_gemma":[0.9993217,0.000026688722,0.00030775357,0.00016985096,0.00015765203,0.000016348788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022755998,0.000092713795,0.00012671962,0.00004365932,0.00031608588,0.000301851,0.00012351424,0.000050379418,0.0000019593217],"category_scores_gemma":[0.00003204733,0.000077252764,0.000029807297,0.00005131539,0.00002961322,0.00044669452,0.0000075935504,0.00005569011,9.603992e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028436505,0.000013569109,0.00021927236,0.0010532405,0.00004107583,3.0447657e-7,0.0016910664,0.6492392,0.29958355,0.000055180055,0.00068139593,0.047393695],"study_design_scores_gemma":[0.00025920078,0.00001071718,0.000109039225,0.00015314684,0.000022479768,0.0000012701049,0.00017592007,0.9893363,0.009245426,0.00009002903,0.00050946814,0.000086985114],"about_ca_topic_score_codex":0.00010171424,"about_ca_topic_score_gemma":0.0000065020354,"teacher_disagreement_score":0.8965588,"about_ca_system_score_codex":0.000054840926,"about_ca_system_score_gemma":0.000024009934,"threshold_uncertainty_score":0.31502762},"labels":[],"label_agreement":null},{"id":"W2809327114","doi":"10.1016/j.sigpro.2018.06.014","title":"Student-t mixture labeled multi-Bernoulli filter for multi-target tracking with heavy-tailed noise","year":2018,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Filter (signal processing); Tracking (education); Recursion (computer science); Bernoulli's principle; Noise (video); Gaussian; Computer science; Algorithm; Process (computing); State (computer science); Control theory (sociology); Mathematics; Artificial intelligence; Engineering; Physics; Computer vision; Image (mathematics)","score_opus":0.03929378938253014,"score_gpt":0.30457358625424447,"score_spread":0.2652797968717143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809327114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020947156,0.0006098295,0.9766974,0.0002559243,0.0003572081,0.0005161926,0.000020399131,0.00048270897,0.000113192655],"genre_scores_gemma":[0.58757114,0.0000030256751,0.411041,0.0005260862,0.00045357284,0.000043543612,0.000023665598,0.000041339175,0.0002966521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971914,0.00008821742,0.00044970977,0.00095825613,0.00051109766,0.0008013162],"domain_scores_gemma":[0.9982155,0.0001400978,0.00027998342,0.00052542926,0.00062500464,0.00021397158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048422944,0.0003971784,0.00038397725,0.00013609145,0.00089664763,0.00084003207,0.0011633702,0.00018670502,0.000057545712],"category_scores_gemma":[0.00004227277,0.00030903926,0.00009921402,0.00053720776,0.00017874864,0.0010621502,0.00021022369,0.0003684457,0.000044005716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021750664,0.005171735,0.0664652,0.0014749315,0.00057994627,0.00039034375,0.039873973,0.009844928,0.08966771,0.0012595998,0.016805736,0.76629084],"study_design_scores_gemma":[0.005772995,0.00074307236,0.0030376094,0.00083241716,0.00006723568,0.000073382456,0.00032764638,0.9327307,0.04234783,0.0002570277,0.012540268,0.0012698456],"about_ca_topic_score_codex":0.000010343015,"about_ca_topic_score_gemma":0.000034457134,"teacher_disagreement_score":0.9228857,"about_ca_system_score_codex":0.000048873328,"about_ca_system_score_gemma":0.00014464614,"threshold_uncertainty_score":0.99993616},"labels":[],"label_agreement":null},{"id":"W2894788163","doi":"10.1016/j.sigpro.2018.09.040","title":"Modeling of multiple-input, time-varying systems with recursively estimated basis expansions","year":2018,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hyperparameter; Estimator; Kalman filter; Computer science; Algorithm; Computation; Nonlinear system; Recursive least squares filter; Mathematical optimization; Mathematics; Adaptive filter; Artificial intelligence; Statistics","score_opus":0.0210062687376145,"score_gpt":0.2351338906339744,"score_spread":0.21412762189635992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894788163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4025377,0.0014348163,0.593422,0.000013057909,0.00013468628,0.00031636018,0.000010100718,0.00036165732,0.0017696075],"genre_scores_gemma":[0.99798805,0.00000320531,0.0017072627,0.0000031859474,0.0001602934,0.000025063857,0.000010087174,0.000043645876,0.000059231064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898624,0.000022964969,0.00036270724,0.0001968092,0.00021056682,0.00022069135],"domain_scores_gemma":[0.9993272,0.000033104225,0.00008796666,0.00014379948,0.00034596038,0.00006199475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018599488,0.00015026689,0.00024115504,0.0001247148,0.0001690408,0.00009262627,0.000110554494,0.000067254776,0.000014662012],"category_scores_gemma":[0.00002359484,0.00013236165,0.000031737818,0.00029192521,0.00003920473,0.00032703168,0.000012926418,0.00009069003,0.000026381358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042247128,0.000018986595,0.0002383796,0.00046645536,0.000048002352,0.0000020827554,0.0009141322,0.73671055,0.2488518,0.000008859573,0.00005456191,0.012643926],"study_design_scores_gemma":[0.0003280738,0.000038602688,0.000058085425,0.0013068152,0.000036537556,0.000010208829,0.00017483521,0.9914848,0.0063654766,0.000013623403,0.000018097224,0.0001648231],"about_ca_topic_score_codex":0.0001344759,"about_ca_topic_score_gemma":0.00001040298,"teacher_disagreement_score":0.59545034,"about_ca_system_score_codex":0.000050044582,"about_ca_system_score_gemma":0.00004651044,"threshold_uncertainty_score":0.5397551},"labels":[],"label_agreement":null},{"id":"W2913966198","doi":"10.1016/j.sigpro.2019.02.010","title":"Accelerated stochastic gradient descent with step size selection rules","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Stochastic gradient descent; PROX; Computer science; Gradient descent; Gradient method; Convergence (economics); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Artificial neural network; Chemistry","score_opus":0.013422164220208008,"score_gpt":0.215019254110561,"score_spread":0.201597089890353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913966198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7738429,0.00029200598,0.22309431,0.000010481731,0.00005813107,0.00022135295,9.3238765e-7,0.0010693765,0.0014105526],"genre_scores_gemma":[0.9944964,0.0000028961242,0.0052901953,0.00003245047,0.00006143487,0.00001007017,0.0000033298668,0.000044632336,0.00005856916],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.000012976473,0.00013335496,0.00018786985,0.00016715047,0.00025322541],"domain_scores_gemma":[0.9996998,0.00002636535,0.000039766077,0.0000840479,0.0000990672,0.000051007228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048657228,0.00016799357,0.00015184702,0.00006290889,0.00008129762,0.00010701172,0.00008486261,0.00005614092,0.000057505993],"category_scores_gemma":[0.0000036228519,0.00014253434,0.000022733946,0.00020658367,0.000021151975,0.00018151867,0.000014030047,0.00017522965,0.00003148373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022766132,0.00012442411,0.0017795808,0.0003752486,0.00014591457,0.000024267852,0.00069086574,0.39390248,0.4273338,0.00016482385,0.0009463469,0.17428458],"study_design_scores_gemma":[0.00047983832,0.00020612853,0.00169992,0.00075242383,0.00004179615,0.000055312852,0.00010000405,0.8905869,0.10495276,0.00036713865,0.00028670006,0.00047109113],"about_ca_topic_score_codex":0.000010340353,"about_ca_topic_score_gemma":0.0000039450874,"teacher_disagreement_score":0.4966844,"about_ca_system_score_codex":0.000076600656,"about_ca_system_score_gemma":0.000033577573,"threshold_uncertainty_score":0.58123815},"labels":[],"label_agreement":null},{"id":"W2939757246","doi":"10.1016/j.sigpro.2019.04.015","title":"Multiple detection joint integrated track splitting for multiple extended target tracking","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Defense Acquisition Program Administration; Korea Advanced Institute of Science and Technology","keywords":"Tracking (education); Computer science; Track (disk drive); Tracking system; Tree (set theory); Artificial intelligence; Monte Carlo method; Algorithm; Point target; Computer vision; Kinematics; Basis (linear algebra); Mathematics; Kalman filter; Physics","score_opus":0.024786207055251072,"score_gpt":0.24532172845054157,"score_spread":0.22053552139529048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939757246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084347785,0.00029354272,0.91325295,0.0000809719,0.00061711535,0.00052832684,0.000013326725,0.0006494405,0.00021651886],"genre_scores_gemma":[0.8283728,0.000002452873,0.1710168,0.00014354709,0.00023953855,0.000034949462,0.00003615044,0.00003897115,0.00011480917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741477,0.00009010705,0.00059686584,0.00086876354,0.000371249,0.0006582503],"domain_scores_gemma":[0.99834466,0.0004113194,0.00033929155,0.0004130719,0.00035266046,0.0001390232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008146819,0.00031051403,0.00035498527,0.0001827573,0.00052161596,0.00064213265,0.0006034948,0.00018486445,0.000039570274],"category_scores_gemma":[0.00024537934,0.00028385286,0.00016336834,0.00056197535,0.000042984735,0.001351573,0.0001276466,0.0004422478,0.00005105996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009405148,0.00012338089,0.001404818,0.00021298022,0.000018847892,0.0000071423415,0.0009045716,0.009052565,0.2113339,0.00015282149,0.00013973675,0.7765552],"study_design_scores_gemma":[0.0010017715,0.00011728462,0.00089902675,0.0002496629,0.000009053674,0.00002449076,0.00025300172,0.881038,0.11148522,0.0012314153,0.0033091514,0.00038193067],"about_ca_topic_score_codex":0.000029664836,"about_ca_topic_score_gemma":0.000012774312,"teacher_disagreement_score":0.87198544,"about_ca_system_score_codex":0.000084942076,"about_ca_system_score_gemma":0.00010590277,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W2945777343","doi":"10.1016/j.sigpro.2019.05.018","title":"Self-regularized nonlinear diffusion algorithm based on levenberg gradient descent","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council; China Postdoctoral Science Foundation; National Science Foundation","keywords":"Algorithm; Levenberg–Marquardt algorithm; Nonlinear system; Computer science; Regularization (linguistics); Gradient descent; Identification (biology); Mathematical optimization; Mathematics; Artificial neural network; Artificial intelligence","score_opus":0.008206172489211374,"score_gpt":0.21740167574974356,"score_spread":0.20919550326053218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945777343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05189436,0.00014113597,0.9436712,0.000029027935,0.00015963642,0.00042722866,0.000010811792,0.0021894115,0.0014771438],"genre_scores_gemma":[0.6238795,0.000005443298,0.3757886,0.000061670355,0.00009015924,0.000021132837,0.000015164235,0.00007351926,0.00006481814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987881,0.000022904465,0.00022655804,0.0003051221,0.00030006794,0.00035721756],"domain_scores_gemma":[0.9995384,0.000033419597,0.00005522816,0.00022309854,0.000059391987,0.00009043894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012442192,0.0002645358,0.00023013847,0.00013494698,0.00008639234,0.00005179248,0.00018213139,0.00009553154,0.0000549402],"category_scores_gemma":[0.000005487837,0.00025131338,0.000070450034,0.00020038121,0.000022853359,0.00017439856,0.00004234368,0.0002738908,0.000052940715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092246635,0.00036815766,0.00026073796,0.0009438293,0.000041245443,0.00004554546,0.00029338623,0.09585736,0.23855127,0.000110919864,0.00010049372,0.6633348],"study_design_scores_gemma":[0.00048717923,0.00012414862,0.00010932401,0.00040758657,0.000010793259,0.000003555402,0.000013610615,0.9371409,0.057395753,0.00027467476,0.0037230116,0.00030947773],"about_ca_topic_score_codex":0.0000016708372,"about_ca_topic_score_gemma":3.351821e-7,"teacher_disagreement_score":0.8412835,"about_ca_system_score_codex":0.00022431558,"about_ca_system_score_gemma":0.00003011001,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W2965287244","doi":"10.1016/j.sigpro.2019.107241","title":"3-D tracking of air targets using a single 2-D radar","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Initialization; Radar tracker; Radar; Computer science; Air traffic control; Waypoint; Algorithm; Extended Kalman filter; Low probability of intercept radar; Tracking (education); Filter (signal processing); Kalman filter; Real-time computing; Engineering; Radar engineering details; Artificial intelligence; Computer vision; Radar imaging; Telecommunications","score_opus":0.025245246907247422,"score_gpt":0.2494710970287736,"score_spread":0.22422585012152618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965287244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15347603,0.0011957053,0.84261346,0.00007332286,0.00034598575,0.00013634385,0.0000033993256,0.00021051009,0.001945262],"genre_scores_gemma":[0.8659722,0.0000021915464,0.13371167,0.0001394758,0.00010265486,8.231966e-7,0.0000034226066,0.000018347057,0.00004920423],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828017,0.00005938522,0.00039284545,0.00045361454,0.00042733547,0.0003866453],"domain_scores_gemma":[0.9990036,0.000090798,0.00027375686,0.0003767701,0.00017202858,0.0000830379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033649514,0.00017878889,0.0002773687,0.00013782333,0.00016125431,0.00014094287,0.0006915564,0.000095472,0.000057738725],"category_scores_gemma":[0.000017952963,0.00016805374,0.00008286712,0.00054315315,0.000056006786,0.0010458037,0.00019611589,0.00021078059,0.000024379135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035669713,0.00025235236,0.0021217717,0.00035261715,0.000025076928,0.000032199056,0.0017156159,0.018787446,0.5986315,0.002048861,0.00024087704,0.37575603],"study_design_scores_gemma":[0.0009960441,0.00024669484,0.0008309521,0.0011445238,0.000027905715,0.00012298439,0.00025647774,0.7691237,0.21729933,0.004222186,0.004899972,0.0008292829],"about_ca_topic_score_codex":0.000017449665,"about_ca_topic_score_gemma":7.835331e-7,"teacher_disagreement_score":0.7503362,"about_ca_system_score_codex":0.000038707185,"about_ca_system_score_gemma":0.00011377856,"threshold_uncertainty_score":0.6853033},"labels":[],"label_agreement":null},{"id":"W2974615315","doi":"10.1016/j.sigpro.2019.107294","title":"Multi-depth filtering and occlusion suppression in 4-D light fields: Algorithms and architectures","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.012425264481334174,"score_gpt":0.2765274517313642,"score_spread":0.26410218725003004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974615315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16973633,0.0014585359,0.82767725,0.0004436028,0.00007493591,0.00012573352,2.6911349e-7,0.000075679316,0.0004076576],"genre_scores_gemma":[0.84640884,0.000014388434,0.15323183,0.00023002492,0.000019136573,0.0000015063674,3.3877194e-7,0.0000065130057,0.00008742693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.000027051357,0.00014059864,0.0003529696,0.00013264582,0.00019947864],"domain_scores_gemma":[0.99971104,0.00004096687,0.00005082291,0.00011574867,0.000019298603,0.00006211635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125723,0.000112158006,0.00012383099,0.00011737296,0.00011274749,0.00016537751,0.00017367638,0.0000406168,0.000008753335],"category_scores_gemma":[0.000012963537,0.00008978814,0.0000124508,0.00013748034,0.000021375305,0.0004489213,0.0003808275,0.00018326243,0.0000032709538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000825663,0.00001710808,0.0023004217,0.00008541231,9.2598316e-7,0.000017900064,0.0025209566,0.00030161993,0.098670945,0.000011340943,0.000007420252,0.8960577],"study_design_scores_gemma":[0.00056485634,0.00004522149,0.005869754,0.0004973437,0.0000010488469,0.00004683233,0.0001259041,0.97280437,0.01861136,0.00087815773,0.0003735988,0.00018153826],"about_ca_topic_score_codex":0.0000076234705,"about_ca_topic_score_gemma":0.00000320341,"teacher_disagreement_score":0.97250277,"about_ca_system_score_codex":0.000009710561,"about_ca_system_score_gemma":0.000017882769,"threshold_uncertainty_score":0.3661454},"labels":[],"label_agreement":null},{"id":"W3012378050","doi":"10.1016/j.sigpro.2020.107581","title":"Underwater angle-only tracking with propagation delay and time-offset between observers","year":2020,"lang":"en","type":"article","venue":"Signal Processing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Underwater; Offset (computer science); Tracking (education); Computer science; Acoustics; Underwater acoustic communication; Control theory (sociology); Real-time computing; Geology; Artificial intelligence; Physics; Psychology","score_opus":0.03160737788197845,"score_gpt":0.2158470073175925,"score_spread":0.18423962943561403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012378050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7775314,0.0005508345,0.21950845,0.00068777875,0.000005418997,0.00023212958,0.0000057971847,0.00046212846,0.0010160769],"genre_scores_gemma":[0.9976722,0.00000413239,0.0020293396,0.000104337865,0.00009393081,0.0000070509363,0.000025721616,0.00003681938,0.000026479209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927884,0.00003083066,0.00019454975,0.00016117035,0.00016475811,0.00016985738],"domain_scores_gemma":[0.9997107,0.000019548259,0.00004607395,0.000077478646,0.000050653718,0.00009555341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001020675,0.00013509647,0.00015151656,0.00003095253,0.00013397598,0.00021778834,0.00013247813,0.00005598144,0.000014938377],"category_scores_gemma":[7.175477e-7,0.00011026752,0.000017745664,0.00016430263,0.00003498416,0.00041368676,0.000030077319,0.00014692324,0.000021044103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084601714,0.000030777173,0.04846818,0.0017531464,0.00021789274,0.000023261106,0.014191988,0.011977668,0.17988876,0.000036504913,0.0001962763,0.7431309],"study_design_scores_gemma":[0.0027782,0.0006208788,0.011513626,0.0013314572,0.00025861783,0.00015173657,0.002951076,0.7977456,0.16490906,0.0006802629,0.015161004,0.0018984961],"about_ca_topic_score_codex":0.0000045741785,"about_ca_topic_score_gemma":0.000002598654,"teacher_disagreement_score":0.7857679,"about_ca_system_score_codex":0.000027161674,"about_ca_system_score_gemma":0.000027952552,"threshold_uncertainty_score":0.4496579},"labels":[],"label_agreement":null},{"id":"W3028365456","doi":"10.1016/j.sigpro.2020.107659","title":"Robust sensor fusion with heavy-tailed noises","year":2020,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Key Research Program of Chongqing Science and Technology Commission; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Outlier; Sensor fusion; State space; Fusion; Bernoulli's principle; Gaussian; Bayesian probability; State (computer science); Computer science; Algorithm; Artificial intelligence; Gaussian process; State-space representation; Data mining; Pattern recognition (psychology); Mathematics; Engineering; Statistics; Physics","score_opus":0.03703339537655507,"score_gpt":0.22521192638269358,"score_spread":0.18817853100613852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028365456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009786318,0.00041154743,0.98482555,0.0025534406,0.000076526856,0.00011275039,0.0000033198057,0.0005919043,0.0016386575],"genre_scores_gemma":[0.878307,0.000009685595,0.11948045,0.0017824257,0.00032978057,0.0000044230055,0.000008346193,0.000020264586,0.000057611036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983944,0.000052464806,0.00022546315,0.0005622619,0.0004121339,0.0003532751],"domain_scores_gemma":[0.999222,0.00006511981,0.00012200931,0.00023681151,0.0001330497,0.00022105197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246448,0.00019342788,0.00019932579,0.000047280228,0.0003738599,0.00043278874,0.000579246,0.00006982419,0.00006620246],"category_scores_gemma":[0.000020626881,0.00014645937,0.000039227805,0.00061914074,0.000060194634,0.000661493,0.0001906525,0.0002679204,0.00007139818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006213245,0.0002631977,0.004018233,0.0005120645,0.000047837668,0.0006236316,0.0058203787,0.13774134,0.025695061,0.0016083407,0.014496992,0.8085516],"study_design_scores_gemma":[0.0009205105,0.00038402207,0.0003414057,0.00041787061,0.000022385551,0.000082516686,0.000257761,0.9756869,0.008560801,0.00023919418,0.012420813,0.0006658194],"about_ca_topic_score_codex":0.0000063100265,"about_ca_topic_score_gemma":0.000001801261,"teacher_disagreement_score":0.8685207,"about_ca_system_score_codex":0.00001504227,"about_ca_system_score_gemma":0.00010279757,"threshold_uncertainty_score":0.59724396},"labels":[],"label_agreement":null},{"id":"W3124046719","doi":"10.1016/j.sigpro.2021.108012","title":"Statistical analysis of narrowband active noise control using a simplified variable step-size FXLMS algorithm","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Japan Society for the Promotion of Science; Higher Education Discipline Innovation Project; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Least mean squares filter; Active noise control; Mean squared error; Residual; Noise (video); Narrowband; Control theory (sociology); Mathematics; Steady state (chemistry); Filter (signal processing); Mean square; Algorithm; Adaptive filter; Statistics; Computer science; Control (management); Telecommunications; Artificial intelligence","score_opus":0.012838144773051514,"score_gpt":0.26228372995178645,"score_spread":0.24944558517873494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124046719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015291153,0.00030131615,0.9832504,0.0000043740106,0.000033174,0.00011556846,0.00028025013,0.0002690704,0.00045473594],"genre_scores_gemma":[0.64329034,0.0000030660508,0.35657382,0.000019692321,0.00003468668,0.000009824328,0.000019196927,0.00003379582,0.000015576206],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986532,0.00005303255,0.00038309145,0.0003097536,0.00026009456,0.0003408292],"domain_scores_gemma":[0.9990443,0.00028408616,0.00011011041,0.00018038561,0.00028561274,0.000095512485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014484263,0.00022565937,0.00056257256,0.00015868187,0.00009370352,0.000054369517,0.00012240058,0.00010141479,0.00018920503],"category_scores_gemma":[0.0001009642,0.00024343893,0.000085862084,0.0010272141,0.00008201498,0.00028421744,0.00004187651,0.00023037627,9.005402e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006985157,0.00007419358,0.00017327952,0.00026464197,0.0010486337,0.00007631487,0.00027079237,0.24438001,0.67222583,0.00030649538,0.00002507223,0.081084885],"study_design_scores_gemma":[0.00041245003,0.00002926202,0.0005634958,0.00013270741,0.00068046467,0.000009598631,0.00014206383,0.9157471,0.08053114,0.0013682352,0.0001025696,0.0002808884],"about_ca_topic_score_codex":0.000017972243,"about_ca_topic_score_gemma":0.0000029583377,"teacher_disagreement_score":0.6713671,"about_ca_system_score_codex":0.00014073992,"about_ca_system_score_gemma":0.00011978655,"threshold_uncertainty_score":0.9927152},"labels":[],"label_agreement":null},{"id":"W3129540677","doi":"10.1016/j.sigpro.2021.108225","title":"Orthogonal features-based EEG signal denoising using fractionally compressed autoencoder","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Noise reduction; Compressed sensing; Compression (physics); Autoencoder; Singular value decomposition; Energy (signal processing); Pattern recognition (psychology); SIGNAL (programming language)","score_opus":0.0417817350793579,"score_gpt":0.3033933698969838,"score_spread":0.2616116348176259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129540677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48964512,0.0011043522,0.50342757,0.0007069087,0.00041713592,0.00020381286,0.000037152808,0.00039541873,0.004062515],"genre_scores_gemma":[0.97839314,0.0000016345668,0.017835215,0.0031616963,0.00031781013,0.0000052579962,0.000015509762,0.00005001906,0.0002197336],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970583,0.00026339554,0.00041955072,0.00085423404,0.0008326435,0.00057192845],"domain_scores_gemma":[0.99854016,0.00058420835,0.00025372548,0.00019658898,0.00025723205,0.0001680806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023546838,0.00033190317,0.00031782323,0.00015508104,0.0008135452,0.0009125235,0.00037412107,0.00014604688,0.00042674658],"category_scores_gemma":[0.00009792285,0.00031972557,0.00015601484,0.0005989423,0.0001834424,0.0008293756,0.00012840287,0.00060195755,0.000023335724],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006880532,0.0001539801,0.00021897853,0.000104623265,0.000009779894,0.00027666273,0.00013976422,0.07972148,0.89245975,0.00010872465,0.00015489262,0.026582535],"study_design_scores_gemma":[0.00049114524,0.000043301112,0.0007689099,0.0003831858,0.0000278373,0.00030403046,0.000057817528,0.36227962,0.6331843,0.0005645704,0.001511134,0.00038410965],"about_ca_topic_score_codex":0.000008126817,"about_ca_topic_score_gemma":0.000006586286,"teacher_disagreement_score":0.48874798,"about_ca_system_score_codex":0.00009929292,"about_ca_system_score_gemma":0.0009465176,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W3169102718","doi":"10.1016/j.sigpro.2021.108173","title":"Quantitative imaging for optical field via a single-pixel detector","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Holography and Microscopy","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; Shandong University","keywords":"Pixel; Detector; Phase retrieval; Optics; Diffraction; Coherent diffraction imaging; Phase (matter); Interferometry; Computer science; Wavelength; Artificial intelligence; Computer vision; Physics; Fourier transform","score_opus":0.017093527716161305,"score_gpt":0.2842659647766524,"score_spread":0.2671724370604911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169102718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13578515,0.00041539618,0.85069704,0.00015043443,0.00007084241,0.00010016645,0.000018646186,0.000037481383,0.012724869],"genre_scores_gemma":[0.9755793,1.305745e-7,0.023928035,0.00018317549,0.00012655878,0.00002216086,0.000021947186,0.000016300097,0.00012235483],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992589,0.000009217542,0.00015323356,0.000245031,0.000070801325,0.00026286993],"domain_scores_gemma":[0.9995415,0.00013707214,0.000056416422,0.00006838046,0.00013922065,0.000057415593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005626389,0.00011908939,0.0001384031,0.000034635672,0.00015393682,0.00018963541,0.00007564653,0.000023596533,0.00008750897],"category_scores_gemma":[0.000011825982,0.000116751995,0.000110839486,0.00015864216,0.00005508466,0.00028117475,0.000032366876,0.0000982195,0.000007881594],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006481949,0.00016680018,0.0011298214,0.000053423893,0.000028449558,0.0000053160156,0.00019622424,0.000004668111,0.49639928,0.0054341634,0.00011068718,0.49640635],"study_design_scores_gemma":[0.00059139176,0.00019770219,0.000055563305,0.00015207785,0.000047402573,0.0000064410383,0.001208927,0.0016641518,0.9463742,0.047123753,0.0022664603,0.0003119582],"about_ca_topic_score_codex":0.000003581302,"about_ca_topic_score_gemma":9.2085656e-7,"teacher_disagreement_score":0.8397942,"about_ca_system_score_codex":0.000007695747,"about_ca_system_score_gemma":0.000076821685,"threshold_uncertainty_score":0.47610083},"labels":[],"label_agreement":null},{"id":"W4248373913","doi":"10.1016/j.sigpro.2006.01.011","title":"A new efficient approach to the design of parametric windows with arbitrary sidelobe profiles","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bessel function; Mathematics; Chebyshev filter; Window function; Transformation (genetics); Algorithm; Mathematical analysis; Spectral density; Statistics","score_opus":0.025216703109517215,"score_gpt":0.24887867865162847,"score_spread":0.22366197554211126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248373913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021181323,0.0008677537,0.9923051,0.00025658772,0.000030728705,0.0005311844,6.010532e-7,0.000100394995,0.003789496],"genre_scores_gemma":[0.46904776,2.54444e-7,0.5305363,0.00016403734,0.00008519534,0.000016235126,6.45851e-7,0.000011479996,0.00013811036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793625,0.00023673369,0.00033771733,0.0004678855,0.0006272615,0.0003941234],"domain_scores_gemma":[0.9989572,0.00023957156,0.00018534128,0.00035299183,0.00016685129,0.000098056764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010149861,0.00021248207,0.00025732783,0.00025152805,0.00024099092,0.00033319052,0.00093254104,0.000054037682,0.000003170447],"category_scores_gemma":[0.000037583537,0.00012727124,0.000055987413,0.0023528216,0.00006579703,0.00027475462,0.000120875644,0.00020122378,0.00000835308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018381221,0.00030175655,0.00010169349,0.00014640662,0.000023095225,0.000026390819,0.0013576661,0.67115885,0.0134426225,0.0041540195,0.0016106692,0.30749303],"study_design_scores_gemma":[0.000871499,0.0003717182,0.00085694494,0.00019668315,0.00003528385,0.00010897396,0.000098583485,0.8983755,0.09217886,0.0061155753,0.0003240632,0.0004663266],"about_ca_topic_score_codex":0.00009178898,"about_ca_topic_score_gemma":5.216429e-7,"teacher_disagreement_score":0.4669296,"about_ca_system_score_codex":0.00003080001,"about_ca_system_score_gemma":0.0005221061,"threshold_uncertainty_score":0.5189971},"labels":[],"label_agreement":null},{"id":"W4280578743","doi":"10.1016/j.sigpro.2022.108620","title":"Censoring outliers in elliptically symmetric multivariate distribution","year":2022,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outlier; Censoring (clinical trials); Mathematics; Mathematical optimization; Covariance; Gaussian; Algorithm; Computational complexity theory; Stationary point; Computer science; Statistics","score_opus":0.09880669015401773,"score_gpt":0.3981913301496969,"score_spread":0.29938463999567916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280578743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013823408,0.0001020363,0.9845193,0.00007147715,0.000054946682,0.00016457896,0.00004119382,0.000067638146,0.0011554194],"genre_scores_gemma":[0.7630073,0.0000013111367,0.2367478,0.000034082615,0.000031260006,0.00003942066,0.000010060552,0.000019425966,0.0001093446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985478,0.00016447603,0.00033567665,0.00028115523,0.00032305848,0.00034784383],"domain_scores_gemma":[0.9990924,0.0005769376,0.00011013491,0.00009305685,0.00005026048,0.00007721486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007702488,0.00012502214,0.00021518473,0.00010073871,0.00029094447,0.00003321003,0.00012726898,0.000033340577,0.00007752412],"category_scores_gemma":[0.0006937164,0.00012382728,0.00003780891,0.0005843711,0.000036292273,0.00012369403,0.000110596186,0.00038475686,0.0000025582367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016866937,0.00042599425,0.00025153282,0.00033011383,0.000015891033,0.00009757468,0.0009986642,0.008439154,0.0050379764,0.3921466,0.000060492275,0.59202737],"study_design_scores_gemma":[0.0005892959,0.00008208133,0.00022064039,0.000058722908,0.000024182053,0.000009373131,0.0004953806,0.22608282,0.00043766716,0.7711486,0.00059491873,0.00025630798],"about_ca_topic_score_codex":0.00000889379,"about_ca_topic_score_gemma":8.6706785e-7,"teacher_disagreement_score":0.7491839,"about_ca_system_score_codex":0.00022880815,"about_ca_system_score_gemma":0.00005601862,"threshold_uncertainty_score":0.50495297},"labels":[],"label_agreement":null},{"id":"W4313478437","doi":"10.1016/j.sigpro.2022.108926","title":"Rank minimization via adaptive hybrid norm for image restoration","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Singular value; Minification; Norm (philosophy); Matrix norm; Mathematical optimization; Rank (graph theory); Image restoration; Computer science; Mathematics; Algorithm; Image (mathematics); Singular value decomposition; Artificial intelligence; Image processing","score_opus":0.023121888998113953,"score_gpt":0.249177246283302,"score_spread":0.22605535728518805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313478437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016543858,0.00015351347,0.9799641,0.000049819595,0.00009067829,0.00023174238,0.0000063835414,0.0016954903,0.0012644405],"genre_scores_gemma":[0.9831486,0.000009639386,0.016437523,0.00002939383,0.00018042701,0.000040110895,0.000057871977,0.00004228154,0.000054203592],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994053,0.000010416186,0.00014977762,0.00014230482,0.000110091576,0.00018210193],"domain_scores_gemma":[0.9996931,0.00003683957,0.000039538565,0.00007618124,0.0001250801,0.000029248282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008926369,0.00011054881,0.00010689508,0.000119637945,0.00012721223,0.00006940332,0.00006946131,0.000041060124,0.0000064573187],"category_scores_gemma":[0.00001368028,0.000117172334,0.00003528112,0.00023801715,0.000022508353,0.00030423957,0.000013468719,0.00006925059,0.000018999412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119176606,0.000023387209,0.000021411228,0.00023180249,0.000040636052,0.000031359832,0.0007992512,0.07352946,0.5085687,0.0001328587,0.032333814,0.38416815],"study_design_scores_gemma":[0.00014372024,0.000031734726,0.00003604444,0.000084941195,0.000012715252,0.0000041815874,0.00004113494,0.8043221,0.19065167,0.0038071824,0.00072818086,0.00013639132],"about_ca_topic_score_codex":0.0000031359687,"about_ca_topic_score_gemma":0.0000016748453,"teacher_disagreement_score":0.9666047,"about_ca_system_score_codex":0.000037727266,"about_ca_system_score_gemma":0.000020218153,"threshold_uncertainty_score":0.4778149},"labels":[],"label_agreement":null},{"id":"W4318774098","doi":"10.1016/j.sigpro.2023.108939","title":"One-bit compressed sensing via total variation minimization method","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","keywords":"Compressed sensing; Piecewise; Algorithm; Thresholding; Minification; Computer science; Series (stratigraphy); Binary number; Bit (key); Total variation denoising; Mathematics; Artificial intelligence; Noise reduction; Image (mathematics); Arithmetic","score_opus":0.024883693560630256,"score_gpt":0.2618927505724298,"score_spread":0.23700905701179953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318774098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015621784,0.000109753484,0.97921383,0.000056234116,0.00012331054,0.00013309545,0.0000019275765,0.0028618327,0.0018782179],"genre_scores_gemma":[0.9081444,0.000006093282,0.09146854,0.00004478389,0.00020054045,0.0000038605917,0.00003261971,0.000056039375,0.00004310696],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897283,0.000052520834,0.00024393902,0.0002219433,0.00023150913,0.00027727516],"domain_scores_gemma":[0.9995667,0.00007655826,0.00006339455,0.00013133239,0.00010992624,0.000052095118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017577728,0.00016134011,0.00019110131,0.00019910275,0.00016272478,0.00012846357,0.00008215544,0.00010882282,0.000019838431],"category_scores_gemma":[0.000014678802,0.0001906799,0.000044738306,0.00057941535,0.000018866056,0.00026940057,0.0000372226,0.00016111298,0.000035070596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010209719,0.00001043144,0.000009133942,0.000079399695,0.000027572927,0.00001015611,0.0006150536,0.2467641,0.47959083,0.000031465053,0.00048515294,0.27236652],"study_design_scores_gemma":[0.00012965787,0.0000128334195,0.00050667336,0.000157083,0.00002648359,0.000011261599,0.000031803873,0.87017953,0.12606874,0.002542497,0.00012882652,0.00020461075],"about_ca_topic_score_codex":0.000016795697,"about_ca_topic_score_gemma":0.0000013316555,"teacher_disagreement_score":0.89252263,"about_ca_system_score_codex":0.000046814956,"about_ca_system_score_gemma":0.000021244145,"threshold_uncertainty_score":0.77757007},"labels":[],"label_agreement":null},{"id":"W4320717839","doi":"10.1016/j.sigpro.2023.108972","title":"Topological interference management via low-rank tensor completion for time-varying topology networks","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Topology (electrical circuits); Rank (graph theory); Mathematics; Matrix norm; Cartesian tensor; Mathematical optimization; Tensor density; Pure mathematics; Exact solutions in general relativity; Combinatorics; Tensor field; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.017872010458829066,"score_gpt":0.2548021531827042,"score_spread":0.23693014272387514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320717839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024124838,0.0001925357,0.99443656,0.00005146515,0.00019710591,0.000386916,0.000002737111,0.00084687845,0.0014733381],"genre_scores_gemma":[0.98596233,0.000017427545,0.013289464,0.000050181032,0.0001884868,0.00011660791,0.00007042808,0.000040745857,0.00026433208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901634,0.000021972097,0.00027668983,0.00024307094,0.00007705079,0.00036489108],"domain_scores_gemma":[0.99967426,0.000072310024,0.000054074688,0.00009495926,0.000058703292,0.000045681558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016233485,0.00015944823,0.00020687055,0.0001172786,0.00016249469,0.000052202446,0.00013358594,0.00010252081,0.000058915866],"category_scores_gemma":[0.000009729515,0.0001580133,0.00004173828,0.00028448884,0.00004580629,0.0001703548,0.000047386315,0.000119909404,0.000060966522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026933436,0.000008375347,0.00003228688,0.00033376814,0.000018405559,0.000007603812,0.00008646368,0.94932246,0.0041861343,0.00017978305,0.00025796058,0.045539804],"study_design_scores_gemma":[0.0002814533,0.000039141112,0.0000478936,0.00016605709,0.000015154083,0.000007894459,0.00006843754,0.99738485,0.00045707822,0.0011549303,0.0001926058,0.00018453541],"about_ca_topic_score_codex":0.0000011274027,"about_ca_topic_score_gemma":5.8688425e-7,"teacher_disagreement_score":0.98354983,"about_ca_system_score_codex":0.00007546831,"about_ca_system_score_gemma":0.000004697671,"threshold_uncertainty_score":0.6443595},"labels":[],"label_agreement":null},{"id":"W4360873910","doi":"10.1016/j.sigpro.2023.109011","title":"Mixture of multivariate generalized Gaussians for multi-band texture modeling and representation","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Pattern recognition (psychology); Texture filtering; Image texture; Computer science; Texture compression; Multivariate statistics; Wavelet; Representation (politics); Wavelet transform; Texture (cosmology); Convolution (computer science); Mixture model; Filter bank; Computer vision; Mathematics; Algorithm; Artificial neural network; Filter (signal processing); Image processing; Image (mathematics)","score_opus":0.07535063483425117,"score_gpt":0.34753718174963555,"score_spread":0.27218654691538435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360873910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036456091,0.00029411927,0.9950983,0.0004168781,0.000023385895,0.00022210911,0.000003795245,0.0002430415,0.000052750598],"genre_scores_gemma":[0.8701407,0.000020077507,0.12942913,0.000048675363,0.00003424806,0.000030632717,0.000010193117,0.000009578389,0.00027677685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918455,0.00003006934,0.00021202855,0.0002796897,0.00014333922,0.00015035344],"domain_scores_gemma":[0.999511,0.000035885496,0.00011881171,0.00012184843,0.00017504186,0.000037397844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024142199,0.000091294845,0.00013369838,0.00010250901,0.00015424547,0.000108077555,0.00018672778,0.00006978209,0.0000011538191],"category_scores_gemma":[0.000037582635,0.00007601569,0.00003945606,0.0004463706,0.000030752446,0.00037855573,0.000042400905,0.000068105,7.4508307e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046075867,0.000050823604,0.000115192386,0.00038033698,0.000017551218,0.000003118939,0.0027561397,0.0011295598,0.6314082,0.00387351,0.00012375243,0.36009574],"study_design_scores_gemma":[0.0003453479,0.000019331696,0.000099219375,0.00005677341,0.0000064494884,0.0000022549452,0.000049182596,0.8768931,0.11838147,0.003998774,0.00006177098,0.000086327505],"about_ca_topic_score_codex":0.000011197731,"about_ca_topic_score_gemma":0.0000012336059,"teacher_disagreement_score":0.87576354,"about_ca_system_score_codex":0.000009757707,"about_ca_system_score_gemma":0.000047714188,"threshold_uncertainty_score":0.309983},"labels":[],"label_agreement":null},{"id":"W4385633790","doi":"10.1016/j.sigpro.2023.109216","title":"Recursive least-squares algorithm based on a third-order tensor decomposition for low-rank system identification","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Rank (graph theory); Impulse response; Mathematics; Matrix decomposition; Computational complexity theory; Least-squares function approximation; Kronecker product; Finite impulse response; Computer science; Mathematical optimization; Kronecker delta; Statistics","score_opus":0.03647775312829842,"score_gpt":0.34155362725061617,"score_spread":0.30507587412231774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385633790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013503468,0.00002770036,0.98188674,0.0013337522,0.00010245011,0.0011771269,0.00014191268,0.0009815365,0.00084533426],"genre_scores_gemma":[0.94182885,0.000001199632,0.056173977,0.00022013349,0.00023448982,0.00077253755,0.0002989218,0.00006766627,0.00040224168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842525,0.00006880445,0.00045573353,0.0004157845,0.00034089698,0.00029350628],"domain_scores_gemma":[0.9984449,0.00041511687,0.00029516197,0.00023827574,0.0005216117,0.00008491055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040977504,0.00019771415,0.00023077786,0.00025099688,0.0005943377,0.00019294565,0.00017622804,0.00011017764,0.000021266142],"category_scores_gemma":[0.00006864573,0.00019056088,0.000115734736,0.0006452422,0.000045668025,0.00016895308,0.000014489833,0.00013438772,0.00018927653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011760131,0.0029718243,0.00012218145,0.013856127,0.00028537837,0.00005861565,0.0053697736,0.018271925,0.17557555,0.13844943,0.058048215,0.58581495],"study_design_scores_gemma":[0.0010944764,0.000115400224,0.00026935557,0.0010439308,0.000113782786,0.000012516527,0.0013748475,0.9457608,0.015798876,0.03350039,0.0005282968,0.00038732088],"about_ca_topic_score_codex":0.0000025531206,"about_ca_topic_score_gemma":0.000001121599,"teacher_disagreement_score":0.92832536,"about_ca_system_score_codex":0.00012176598,"about_ca_system_score_gemma":0.00007986141,"threshold_uncertainty_score":0.7770847},"labels":[],"label_agreement":null},{"id":"W4386418664","doi":"10.1016/j.sigpro.2023.109238","title":"Distributed multi-target tracking with low information updates via an integral-type event-based approach","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Outlier; Event (particle physics); Computer science; Filter (signal processing); Bounded function; Tracking (education); Divergence (linguistics); Sensitivity (control systems); Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Engineering; Control (management); Electronic engineering; Computer vision","score_opus":0.019307877443030308,"score_gpt":0.2553378691175482,"score_spread":0.23602999167451788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386418664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01311715,0.00004513445,0.9853389,0.00010403178,0.00012771277,0.0001656111,0.000023533583,0.0010310687,0.000046838708],"genre_scores_gemma":[0.8687817,0.000001561685,0.12942858,0.00018747829,0.00006467265,0.000013565688,0.0014961977,0.000017199283,0.000009089502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982099,0.00008148796,0.00036919347,0.0004034569,0.000454322,0.0004816279],"domain_scores_gemma":[0.9988943,0.000056792003,0.00021721797,0.0003585028,0.00031903406,0.00015415814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042253075,0.000241841,0.00020630525,0.00022969306,0.0004566525,0.0008265201,0.0007182493,0.00011143144,0.000013922483],"category_scores_gemma":[0.00003171928,0.00019115664,0.00004130764,0.0018467495,0.00006904177,0.0033798572,0.00009666245,0.00032860774,0.000058552705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012114027,0.00027909232,0.002301925,0.00029605493,0.000022160544,0.000029071361,0.0017179808,0.681241,0.001885011,0.00020530916,0.0009036387,0.31099766],"study_design_scores_gemma":[0.00049480447,0.00010300558,0.0007981407,0.00014557452,0.0000072100675,0.000012896957,0.00022795271,0.99328405,0.0037801946,0.00018431757,0.0006598624,0.00030200917],"about_ca_topic_score_codex":0.000017224049,"about_ca_topic_score_gemma":0.0000026122432,"teacher_disagreement_score":0.85591036,"about_ca_system_score_codex":0.000040300696,"about_ca_system_score_gemma":0.00015818997,"threshold_uncertainty_score":0.79701525},"labels":[],"label_agreement":null},{"id":"W4386760226","doi":"10.1016/j.sigpro.2023.109257","title":"TEFISTA-Net: A learnable method for high-resolution range profile reconstruction with low-frequency ultra-wideband radar","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Radar; Algorithm; Convolution (computer science); Artificial intelligence; Computational complexity theory; Range (aeronautics); Thresholding; Signal-to-noise ratio (imaging); Convolutional neural network; Artificial neural network; Image (mathematics); Engineering; Telecommunications","score_opus":0.014448130146273046,"score_gpt":0.24027283596186258,"score_spread":0.22582470581558953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386760226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026342962,0.0005370085,0.9676183,0.000078209625,0.000110874855,0.0005392396,0.000017679757,0.0022054457,0.0025502667],"genre_scores_gemma":[0.8577605,0.000022491547,0.14152701,0.000028289716,0.00019875806,0.00011808238,0.000040364786,0.000078666,0.00022584722],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988933,0.000034799483,0.00022955179,0.00028476949,0.00017826204,0.00037931805],"domain_scores_gemma":[0.9995172,0.00007351949,0.0000797401,0.00013900366,0.00013511685,0.00005540399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026164934,0.00020445224,0.00023439914,0.00017776978,0.00024370466,0.0001058787,0.00010521377,0.000111328336,0.000025634334],"category_scores_gemma":[0.000021717824,0.00018238559,0.000046658497,0.0004731329,0.000048671773,0.0003410698,0.000009056488,0.00018392595,0.000011574599],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014968328,0.00002293173,0.00016493173,0.000688112,0.00007586708,0.00002288072,0.0003366957,0.016426926,0.7002292,0.00037802712,0.003937855,0.27756688],"study_design_scores_gemma":[0.0011815412,0.00025323703,0.00014861044,0.0013208861,0.00010405883,0.00011976541,0.0002832519,0.21739635,0.76109314,0.01621066,0.0011707835,0.000717687],"about_ca_topic_score_codex":0.00006937939,"about_ca_topic_score_gemma":0.000013806191,"teacher_disagreement_score":0.8314175,"about_ca_system_score_codex":0.000079495105,"about_ca_system_score_gemma":0.00006896967,"threshold_uncertainty_score":0.7437469},"labels":[],"label_agreement":null},{"id":"W4388451681","doi":"10.1016/j.sigpro.2023.109321","title":"Extended target tracking under multitarget tracking framework for convex polytope shapes","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Infrared Target Detection Methodologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tracking (education); Intersection (aeronautics); Boundary (topology); Polytope; Convex polytope; Covariance intersection; Mathematics; Computer science; Computer vision; Convex hull; Kinematics; Artificial intelligence; Algorithm; Convex combination; Regular polygon; Covariance matrix; Convex optimization; Convex set; Estimation of covariance matrices; Geometry","score_opus":0.0752096599878209,"score_gpt":0.3277797708606076,"score_spread":0.2525701108727867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388451681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03628653,0.0014887833,0.95718753,0.00013943552,0.0006616199,0.00039142306,0.00002821231,0.0033185722,0.00049790886],"genre_scores_gemma":[0.67228144,0.000018335571,0.32680044,0.00013961956,0.00044053775,0.00009260518,0.000019472738,0.00012595566,0.0000816023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997865,0.00007702448,0.00048496778,0.00043857444,0.00030775645,0.00082666066],"domain_scores_gemma":[0.9985849,0.00086877134,0.000107677224,0.0001533955,0.00017650302,0.00010872514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008696775,0.0003606479,0.0004195251,0.0003472828,0.0004478644,0.00027022843,0.00029304522,0.00033276714,0.00018395761],"category_scores_gemma":[0.00049438345,0.00037375843,0.00016427498,0.00079204,0.00008290471,0.00067580206,0.00004545593,0.00055288745,0.000064233536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011085217,0.000038415947,0.00026311347,0.0013403919,0.00017020557,0.000035491223,0.0027473322,0.42052945,0.34881446,0.0022186027,0.0006685684,0.22306313],"study_design_scores_gemma":[0.00049631763,0.000065268105,0.0021418112,0.00031701213,0.00004227223,0.00001514989,0.0023602017,0.5306473,0.3163232,0.1456291,0.0012049697,0.0007574071],"about_ca_topic_score_codex":0.0000018166519,"about_ca_topic_score_gemma":7.614329e-7,"teacher_disagreement_score":0.6359949,"about_ca_system_score_codex":0.00010613553,"about_ca_system_score_gemma":0.00006278103,"threshold_uncertainty_score":0.99987143},"labels":[],"label_agreement":null},{"id":"W4400842795","doi":"10.1016/j.sigpro.2024.109623","title":"Nonlinear acoustic echo cancellation using low-complexity low-rank recursive least-squares algorithms","year":2024,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Echo (communications protocol); Algorithm; Rank (graph theory); Recursive least squares filter; Least-squares function approximation; Nonlinear system; Computer science; Non-linear least squares; Speech recognition; Mathematics; Adaptive filter; Statistics; Combinatorics; Estimation theory; Physics","score_opus":0.03322476835799835,"score_gpt":0.29036801198131884,"score_spread":0.25714324362332047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400842795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04332859,0.0023918194,0.9510998,0.000019135307,0.00029431586,0.0002483638,0.000048248923,0.0020475583,0.0005221746],"genre_scores_gemma":[0.8533471,0.000029411238,0.14585197,0.000018217666,0.00055419875,0.000016836466,0.000023621837,0.000113684124,0.000044915236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853617,0.00002402589,0.00032592606,0.00040320068,0.0002767801,0.00043392333],"domain_scores_gemma":[0.99951845,0.00005725082,0.000053680833,0.00015565786,0.00012360231,0.000091355985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014093128,0.00031665227,0.00025233446,0.00019757879,0.0001799845,0.00019200545,0.00018062662,0.00012595311,0.00006346537],"category_scores_gemma":[0.000020422438,0.0003353939,0.00007335374,0.00044873983,0.00011837796,0.0006431304,0.00005086037,0.00043682626,0.000022273734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027911603,0.000029722887,0.000019655397,0.0027073883,0.000040111736,0.00010199283,0.00087636214,0.48710328,0.34495988,0.000076070486,0.0000975171,0.16396011],"study_design_scores_gemma":[0.00009175962,0.000028822651,0.000020587755,0.0019097986,0.00003213679,0.000023757946,0.00009369252,0.92187214,0.07048462,0.004800992,0.00025299058,0.00038872543],"about_ca_topic_score_codex":0.000027482634,"about_ca_topic_score_gemma":0.000010595365,"teacher_disagreement_score":0.81001854,"about_ca_system_score_codex":0.00042050393,"about_ca_system_score_gemma":0.00010570946,"threshold_uncertainty_score":0.9999098},"labels":[],"label_agreement":null},{"id":"W4404919737","doi":"10.1016/j.sigpro.2024.109820","title":"Automatic regularization for linear MMSE filters","year":2024,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Regularization (linguistics); Mathematics; Linear filter; Computer science; Algorithm; Artificial intelligence; Computer vision; Filter (signal processing)","score_opus":0.01977431075990281,"score_gpt":0.29802524475652226,"score_spread":0.27825093399661943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404919737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071593816,0.00018395546,0.99687153,0.00031291883,0.00011695548,0.00017406525,0.0000015085812,0.000999613,0.0006235151],"genre_scores_gemma":[0.5688843,9.577595e-7,0.43081614,0.000044234315,0.000042564272,0.000031314306,0.0000039058555,0.000010275318,0.00016629524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992861,0.000017335893,0.00021369739,0.00020435192,0.00017053928,0.00010795722],"domain_scores_gemma":[0.99958086,0.00008016273,0.000072181625,0.00011730971,0.00012153365,0.000027929726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828103,0.00007542562,0.00009159685,0.00015926726,0.00007966764,0.00020438388,0.0002360124,0.000040038845,0.000011865874],"category_scores_gemma":[0.000052920655,0.00007072419,0.000044409495,0.0004832329,0.00002845063,0.00084036926,0.000036684574,0.000049846945,0.0000060181155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016504642,0.00001612347,0.000004500947,0.00081478443,0.0000074640016,0.0000013078896,0.0005886201,0.00037563604,0.009580585,0.013518233,0.00049894693,0.97459215],"study_design_scores_gemma":[0.00003732473,0.000040002375,0.00001015313,0.0003782742,0.0000066821126,0.000004570712,0.0000058760597,0.8775975,0.087793514,0.03351742,0.00053591427,0.00007276829],"about_ca_topic_score_codex":0.0000019396396,"about_ca_topic_score_gemma":1.4655929e-7,"teacher_disagreement_score":0.9745194,"about_ca_system_score_codex":0.000031791336,"about_ca_system_score_gemma":0.00013466256,"threshold_uncertainty_score":0.28840488},"labels":[],"label_agreement":null},{"id":"W4406897900","doi":"10.1016/j.sigpro.2025.109907","title":"Simultaneously transmitting and reflecting (STAR) RIS enhanced covert transmission with noise uncertainty","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Noise (video); Transmission (telecommunications); Covert; Star (game theory); Computer science; Acoustics; Electronic engineering; Telecommunications; Engineering; Physics; Artificial intelligence; Astrophysics; Philosophy","score_opus":0.008609470588719522,"score_gpt":0.25745357047878914,"score_spread":0.24884409989006961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406897900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16046093,0.0035908872,0.83191437,0.00012781714,0.000012757565,0.0001707838,0.0000013211973,0.001178401,0.0025427125],"genre_scores_gemma":[0.96840906,0.00021894688,0.031184882,0.00006528508,0.000009554699,0.000024107363,0.0000029013781,0.00003392655,0.00005133238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904734,0.000021672822,0.0002673202,0.0002526298,0.0001318802,0.00027918754],"domain_scores_gemma":[0.999429,0.00020505264,0.000055567038,0.00018652629,0.00008249391,0.000041372394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011246008,0.0002121436,0.00022485005,0.00013759211,0.00032352973,0.000073071,0.00021281987,0.00011287517,0.0000067966894],"category_scores_gemma":[0.00003089438,0.00018828546,0.000024505116,0.0005224114,0.0001088987,0.00026440754,0.000028019766,0.00040247364,7.9961853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044114415,0.000008964629,0.0000332545,0.00033634462,0.000016082602,0.0000030460963,0.0006196879,0.24173537,0.1490128,0.00003290369,0.0000036990368,0.60815376],"study_design_scores_gemma":[0.00066656753,0.000058629423,0.00003268972,0.001385198,0.000027290398,0.000008106414,0.0014305727,0.6815704,0.3113177,0.0015539149,0.0015836025,0.00036531888],"about_ca_topic_score_codex":0.0000087923945,"about_ca_topic_score_gemma":0.000010416136,"teacher_disagreement_score":0.8079481,"about_ca_system_score_codex":0.0000858913,"about_ca_system_score_gemma":0.000050456412,"threshold_uncertainty_score":0.7678058},"labels":[],"label_agreement":null},{"id":"W4406902218","doi":"10.1016/j.sigpro.2025.109892","title":"A MISO acoustic echo cancellation algorithm based on a two-layer filter decomposition","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"National Natural Science Foundation of China","keywords":"Echo (communications protocol); Algorithm; Decomposition; Computer science; Filter (signal processing); Speech recognition; Acoustics; Physics; Computer network; Chemistry","score_opus":0.011755006731213546,"score_gpt":0.2852620623774136,"score_spread":0.27350705564620004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406902218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002191347,0.00014298374,0.9908517,0.000038082984,0.00008548046,0.00017926622,0.000009243254,0.00088328804,0.0056186365],"genre_scores_gemma":[0.8651101,0.0000021721946,0.13444217,0.0001822873,0.00007846324,0.00004749769,0.00001547029,0.000032287964,0.000089553505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920446,0.00001810397,0.00018651152,0.00022244213,0.0001415909,0.00022688686],"domain_scores_gemma":[0.9996805,0.000053655447,0.00003735778,0.00012545184,0.00006569951,0.000037301215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007965397,0.00018425232,0.00014317784,0.0001861613,0.00011327873,0.00006427363,0.00010233276,0.00006616777,0.000040359562],"category_scores_gemma":[0.0000062797753,0.00019540287,0.00003849859,0.00026105397,0.000024482524,0.00017888924,0.000016421413,0.00020179567,0.0000084504145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022428278,0.00002059525,0.000024066938,0.00016603332,0.000008573297,0.0000072093253,0.000042272182,0.560181,0.2079727,0.000014783776,0.00025943085,0.23128091],"study_design_scores_gemma":[0.0002461839,0.000032150867,0.00008912731,0.00060511136,0.000014831193,0.0000012653732,0.000008298805,0.8618155,0.1352984,0.0014088035,0.00030720345,0.00017309526],"about_ca_topic_score_codex":0.0000046428163,"about_ca_topic_score_gemma":0.0000027825895,"teacher_disagreement_score":0.86291873,"about_ca_system_score_codex":0.00024291922,"about_ca_system_score_gemma":0.000044398897,"threshold_uncertainty_score":0.79682976},"labels":[],"label_agreement":null},{"id":"W4407300992","doi":"10.1016/j.sigpro.2025.109934","title":"Reconfigurable intelligent surface-enabled gridless DoA estimation system for NLoS scenarios","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Non-line-of-sight propagation; Computer science; Estimation; Electronic engineering; Real-time computing; Engineering; Telecommunications; Systems engineering; Wireless","score_opus":0.013103286449938415,"score_gpt":0.2450033236180384,"score_spread":0.23190003716809998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407300992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114789404,0.0008804255,0.870373,0.00007722522,0.00055484736,0.0006764515,0.000009400607,0.00066755875,0.011971688],"genre_scores_gemma":[0.99687576,0.0000050753047,0.002558697,0.000021077396,0.000086748405,0.000035648474,0.000035803154,0.0000255482,0.00035563295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991383,0.000016460393,0.00031232397,0.0001725686,0.000110054585,0.00025027082],"domain_scores_gemma":[0.9996254,0.000054376716,0.00004898656,0.00008516162,0.00014664399,0.000039473936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021067687,0.0001469929,0.00018342907,0.000079844714,0.00020544739,0.00013144343,0.0000939264,0.000100306504,0.000014977943],"category_scores_gemma":[0.000017049131,0.00014437996,0.000050014292,0.00027788547,0.000014361449,0.00023347574,0.000005904984,0.00011935858,0.000018040382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045799843,0.0000133582,0.000025991354,0.0027625423,0.000026562133,0.0000013056018,0.0002326435,0.82931894,0.07414985,0.00040209384,0.0004197214,0.09260121],"study_design_scores_gemma":[0.00019904374,0.000011942502,0.000008927304,0.00065614196,0.000028388085,0.0000017773322,0.00016417158,0.7090869,0.28896493,0.00031571309,0.00044112813,0.00012096836],"about_ca_topic_score_codex":0.000022894454,"about_ca_topic_score_gemma":0.0000041619346,"teacher_disagreement_score":0.8820864,"about_ca_system_score_codex":0.00021551365,"about_ca_system_score_gemma":0.000051320047,"threshold_uncertainty_score":0.58876437},"labels":[],"label_agreement":null},{"id":"W4407357161","doi":"10.1016/j.sigpro.2025.109947","title":"Design and implementation of an adaptive extended Kalman filter with interval type-3 fuzzy set for an attitude and heading reference system","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Tabriz","keywords":"Heading (navigation); Kalman filter; Control theory (sociology); Interval (graph theory); Set (abstract data type); Attitude and heading reference system; Computer science; Fuzzy logic; Adaptive filter; Mathematics; Control engineering; Engineering; Artificial intelligence; Algorithm; Aerospace engineering","score_opus":0.036365046344989216,"score_gpt":0.3100645409717031,"score_spread":0.2736994946267139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407357161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7391598,0.00014494194,0.2601847,0.0000042793326,0.00001837021,0.00026266224,0.000006230751,0.000059550333,0.00015946406],"genre_scores_gemma":[0.98942614,0.0000015004266,0.010492373,0.000007513082,0.000020586593,0.000014233593,0.0000217178,0.000011070602,0.00000483876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.000025324245,0.00013468602,0.00012658896,0.000055889708,0.00010117745],"domain_scores_gemma":[0.99979275,0.00002173569,0.000035343437,0.000039145416,0.000082880455,0.00002816887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013107173,0.00008294183,0.000109959976,0.000055120334,0.00007392625,0.000039996696,0.00003161018,0.000032923035,0.0000012760959],"category_scores_gemma":[0.0000013825705,0.000072519455,0.00000535065,0.00008458402,0.00001980677,0.0003116193,0.0000067496294,0.000047295423,8.255085e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017150254,0.00004100276,0.00091104204,0.004475284,0.00014589493,0.000004827809,0.008186882,0.019811822,0.57012564,0.0025461721,0.00004265297,0.39199376],"study_design_scores_gemma":[0.0012707164,0.001512979,0.0037560852,0.0011347423,0.00012053628,0.000015169621,0.0060451943,0.7518551,0.2333471,0.00064360193,0.000013208281,0.0002855975],"about_ca_topic_score_codex":0.000033259104,"about_ca_topic_score_gemma":0.000037989434,"teacher_disagreement_score":0.73204327,"about_ca_system_score_codex":0.000031141633,"about_ca_system_score_gemma":0.000020540134,"threshold_uncertainty_score":0.29572576},"labels":[],"label_agreement":null},{"id":"W4407866962","doi":"10.1016/j.sigpro.2025.109953","title":"Analog filters based on the Mittag-Leffler functions","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Analogue filter; Electronic engineering; Computer science; Control theory (sociology); Digital filter; Engineering; Artificial intelligence; Telecommunications; Bandwidth (computing)","score_opus":0.02657348879844904,"score_gpt":0.27061646647206045,"score_spread":0.2440429776736114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407866962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037533304,0.00002543815,0.93267,0.005623944,0.000117703144,0.000117555464,0.0000024180235,0.00010054983,0.06096704],"genre_scores_gemma":[0.9886554,2.4441303e-7,0.0025819268,0.006790498,0.000028406046,0.000038827173,0.000005861465,0.0000044639387,0.0018943594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919605,0.000046144374,0.00014674348,0.00023277556,0.00019650404,0.00018179973],"domain_scores_gemma":[0.999517,0.00013504045,0.000048791717,0.00020701825,0.000060783546,0.000031328367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019936438,0.00009647401,0.000066069675,0.00013254155,0.00029674804,0.0005557717,0.00040340723,0.000021058755,0.00006953324],"category_scores_gemma":[0.000019030364,0.00006703534,0.000046274807,0.00064158964,0.000036128447,0.0006309229,0.000050325703,0.000092080045,0.00004884624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021977696,0.00010103929,0.00037542023,0.000046688005,0.000019526778,0.000004595628,0.00027895684,0.0015759746,0.0023383014,0.024194948,0.04769677,0.9233458],"study_design_scores_gemma":[0.0006076057,0.00020351783,0.002090292,0.00026671498,0.000022061451,0.0000020580273,0.00021409494,0.9226502,0.010763372,0.024903767,0.03795477,0.0003215315],"about_ca_topic_score_codex":0.000004584609,"about_ca_topic_score_gemma":0.0000014321352,"teacher_disagreement_score":0.98828006,"about_ca_system_score_codex":0.000033778684,"about_ca_system_score_gemma":0.00013878717,"threshold_uncertainty_score":0.53593194},"labels":[],"label_agreement":null},{"id":"W4409709111","doi":"10.1016/j.sigpro.2025.110054","title":"Aggregated<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si132.svg\" display=\"inline\" id=\"d1e5359\"><mml:mi>f</mml:mi></mml:math>-average neural network applied to few-shot class incremental learning","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"HORIZON EUROPE European Research Council; European Research Council","keywords":"Scalable Vector Graphics; Artificial neural network; Mathematics; Discrete mathematics; Computer science; Algorithm; Artificial intelligence; World Wide Web","score_opus":0.013748573058295408,"score_gpt":0.24907060408241014,"score_spread":0.23532203102411473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409709111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93153644,0.00040524657,0.05863435,0.0007634896,0.00051140727,0.000088813285,0.000004270478,0.0005083825,0.007547623],"genre_scores_gemma":[0.99104303,0.000014567688,0.005896978,0.0019103929,0.00060255936,0.00009283627,0.00006913045,0.00007520809,0.00029529072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668103,0.0001314847,0.0005921658,0.0009017299,0.0007361933,0.00095741806],"domain_scores_gemma":[0.9985101,0.00023038975,0.00043204057,0.0004980159,0.000066825814,0.00026260765],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008888563,0.00040092767,0.00026984984,0.0001645031,0.0013621494,0.0010494185,0.0010789816,0.00028613958,0.000024642348],"category_scores_gemma":[0.00012296453,0.0004588336,0.00019645499,0.0008702324,0.00013776975,0.0005778325,0.0010252242,0.00095959555,0.00033463287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015670611,0.000085469124,0.00008551394,0.00031262467,0.000088761764,0.00013727685,0.0012039151,0.112524725,0.0024215241,0.8091793,0.0006287772,0.07317538],"study_design_scores_gemma":[0.0005043565,0.0002255916,0.00011297342,0.0005373438,0.000059665777,0.00007380629,0.00019357716,0.99003696,0.001969811,0.00041469804,0.005452982,0.00041825854],"about_ca_topic_score_codex":0.00015425679,"about_ca_topic_score_gemma":0.00003906509,"teacher_disagreement_score":0.8775122,"about_ca_system_score_codex":0.000036446894,"about_ca_system_score_gemma":0.0003420317,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W4410252383","doi":"10.1016/j.sigpro.2025.110077","title":"Imputation of time-varying edge flows in graphs by multilinear kernel regression and manifold learning","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Air Force Office of Scientific Research; Japan Science and Technology Agency","keywords":"Multilinear map; Imputation (statistics); Regression; Mathematics; Kernel regression; Kernel (algebra); Artificial intelligence; Enhanced Data Rates for GSM Evolution; Computer science; Pattern recognition (psychology); Statistics; Combinatorics; Missing data; Pure mathematics","score_opus":0.006425661802753713,"score_gpt":0.26826590457837063,"score_spread":0.2618402427756169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410252383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88637745,0.0010776707,0.108870044,0.000034075183,0.000009393232,0.00015681783,0.0000022635395,0.000066745706,0.0034055547],"genre_scores_gemma":[0.99719673,0.0000051018255,0.0025088412,0.00000880436,0.000023816403,0.000008334535,0.000030116234,0.000010167382,0.00020811225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922305,0.000053016498,0.0002704285,0.00021512757,0.00009582856,0.00014256709],"domain_scores_gemma":[0.9996575,0.00005760978,0.00014664516,0.000059225058,0.000056536577,0.000022466427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020467553,0.00011492195,0.0002036143,0.00016435725,0.00011951195,0.00004453531,0.00007356988,0.000034858473,0.000040556668],"category_scores_gemma":[0.0000048108373,0.000108569606,0.000045286786,0.0003875761,0.000024684576,0.00014628534,0.00006290247,0.00018030779,9.006092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005183614,0.00011939646,0.11388353,0.00017072793,0.000044225624,0.0000012434213,0.0005524689,0.0036270123,0.1479073,0.00039747826,0.0003212049,0.73292357],"study_design_scores_gemma":[0.00044737794,0.000024786596,0.0009699203,0.0008262466,0.000041216583,2.2043965e-7,0.00018732117,0.95594037,0.030731736,0.01050887,0.00015540837,0.0001665431],"about_ca_topic_score_codex":0.000103082704,"about_ca_topic_score_gemma":0.0000020808934,"teacher_disagreement_score":0.95231336,"about_ca_system_score_codex":0.000014015801,"about_ca_system_score_gemma":0.000032182008,"threshold_uncertainty_score":0.442734},"labels":[],"label_agreement":null},{"id":"W4411302560","doi":"10.1016/j.sigpro.2025.110138","title":"On adaptive multichannel dereverberation based on dichotomous coordinate descent and data-reuse techniques","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Natural Science Foundation of China; Shanghai Lingjun Program","keywords":"Coordinate descent; Computer science; Reuse; Algorithm; Mathematics; Engineering","score_opus":0.02535365993726266,"score_gpt":0.2920354768637592,"score_spread":0.2666818169264965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411302560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047888113,0.00028051776,0.9914593,0.0015378154,0.00005730497,0.00025772708,0.00000465098,0.00032106432,0.001292818],"genre_scores_gemma":[0.8732623,0.0000043818686,0.124516316,0.0020858063,0.000035372606,0.000019497602,0.000007985816,0.000010640667,0.00005770402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849254,0.00006473573,0.00021625565,0.0006842841,0.00026066013,0.0002815246],"domain_scores_gemma":[0.99879223,0.0001459338,0.00011954053,0.0007310197,0.00013554956,0.00007570088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038845887,0.00020940464,0.00017819123,0.00023102085,0.000428221,0.00050768827,0.001165336,0.00007848386,0.000002969126],"category_scores_gemma":[0.00019151685,0.00018211639,0.000020979058,0.00044839532,0.0000634441,0.00081829855,0.00045561112,0.00022799459,0.0000046139317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011895265,0.00020944688,0.00008760683,0.0001705597,0.000012916638,0.00003273555,0.0003043305,0.00066027767,0.014039662,0.00051909115,0.0012029735,0.98264146],"study_design_scores_gemma":[0.00045692976,0.00019818502,0.000115146715,0.0011016189,0.000015482137,0.0000035260807,0.000027397567,0.62338275,0.36228797,0.012013116,0.00015309948,0.00024476508],"about_ca_topic_score_codex":0.000009688618,"about_ca_topic_score_gemma":0.0000040021087,"teacher_disagreement_score":0.98239666,"about_ca_system_score_codex":0.00007407196,"about_ca_system_score_gemma":0.00024137292,"threshold_uncertainty_score":0.7426491},"labels":[],"label_agreement":null},{"id":"W4412425365","doi":"10.1016/j.sigpro.2025.110179","title":"Performance analysis of Quaternion-MUSIC: Unification, simplification, and evaluation","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Taishan Scholar Project of Shandong Province","keywords":"Unification; Quaternion; Algebra over a field; Computer science; Mathematics; Speech recognition; Algorithm; Applied mathematics; Arithmetic; Calculus (dental); Pure mathematics; Programming language; Geometry","score_opus":0.02585280732697223,"score_gpt":0.3139844720401824,"score_spread":0.2881316647132102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412425365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2021368,0.00011949907,0.7957171,0.00018651881,0.000020700714,0.00013267012,8.8834764e-7,0.00008020192,0.0016056256],"genre_scores_gemma":[0.97836363,0.000010626784,0.021524794,0.000026858725,0.0000042151337,0.000021743544,0.000008360497,0.0000025331817,0.000037246005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900407,0.000058316495,0.00036460563,0.00022197359,0.00027937262,0.000071663555],"domain_scores_gemma":[0.9985416,0.000066098735,0.0003031192,0.00022905167,0.000841044,0.000019093733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078592775,0.000070233116,0.00015490505,0.00059500104,0.00009970191,0.00005571353,0.00025725635,0.00003668723,0.000010394475],"category_scores_gemma":[0.00006180979,0.00006954597,0.000030251711,0.0023243017,0.00006510122,0.0005810219,0.000046099285,0.00004026087,5.748394e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058112996,0.00005035622,0.015981626,0.0001985222,0.00008271853,2.6928365e-8,0.0007985527,0.004629809,0.017605243,0.009245155,0.000049222555,0.95135295],"study_design_scores_gemma":[0.00006263684,0.00001472653,0.08921896,0.000074187315,0.00013992983,2.3643172e-7,0.00002247392,0.85862213,0.048784863,0.0029631287,0.0000401573,0.00005653522],"about_ca_topic_score_codex":0.000021212654,"about_ca_topic_score_gemma":0.0000027419217,"teacher_disagreement_score":0.95129645,"about_ca_system_score_codex":0.000038317106,"about_ca_system_score_gemma":0.00016784777,"threshold_uncertainty_score":0.28360024},"labels":[],"label_agreement":null},{"id":"W4412688140","doi":"10.1016/j.sigpro.2025.110189","title":"A unified Bayesian perspective for conventional and robust adaptive filters","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"EduCanada","keywords":"Perspective (graphical); Bayesian probability; Computer science; Adaptive filter; Artificial intelligence; Mathematics; Algorithm","score_opus":0.019585507650321615,"score_gpt":0.2635281110454957,"score_spread":0.24394260339517412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412688140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007201612,0.0007423348,0.99178857,0.00009175135,0.000041803018,0.00026861313,0.00001944799,0.0004547509,0.005872578],"genre_scores_gemma":[0.8665288,0.000006506383,0.13303794,0.000045391724,0.000040852312,0.000084361855,0.000005271089,0.000024008114,0.0002268453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.0000095405285,0.00013309378,0.00021441605,0.000068496796,0.00019074399],"domain_scores_gemma":[0.9996856,0.00006353392,0.000028135,0.000059822516,0.00012598932,0.000036952344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000777877,0.00014542571,0.000143792,0.00012264788,0.00012492723,0.000045043173,0.00008133486,0.000056818597,0.000011276334],"category_scores_gemma":[0.00001828646,0.0001570205,0.000037910242,0.00015056263,0.00008497514,0.00021256423,0.000029846467,0.00012317291,4.940111e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009398635,0.00016288128,0.00032328817,0.0025632344,0.0006416011,0.000031922267,0.0033452695,0.16042386,0.113018595,0.47479254,0.0051774345,0.23857951],"study_design_scores_gemma":[0.001034046,0.00016335008,0.00045223554,0.000958809,0.00006380492,0.000009615613,0.0024129848,0.78304464,0.03050858,0.17910647,0.0016786947,0.00056678953],"about_ca_topic_score_codex":0.000003489785,"about_ca_topic_score_gemma":0.0000029984235,"teacher_disagreement_score":0.86580867,"about_ca_system_score_codex":0.00014467779,"about_ca_system_score_gemma":0.00004250198,"threshold_uncertainty_score":0.640311},"labels":[],"label_agreement":null},{"id":"W4412764230","doi":"10.1016/j.sigpro.2025.110210","title":"A third-order tensor decomposition based algorithm for speech dereverberation","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Tensor decomposition; Tensor (intrinsic definition); Speech recognition; Order (exchange); Computer science; Decomposition; Algorithm; Mathematics; Pure mathematics","score_opus":0.011764225301461075,"score_gpt":0.2882761291536431,"score_spread":0.276511903852182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412764230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005611623,0.00069543906,0.99471045,0.0016832248,0.00013176669,0.00028688437,0.0000022220681,0.0002791965,0.0016496714],"genre_scores_gemma":[0.077374324,0.0000018875473,0.9196177,0.0024399506,0.00012047816,0.000055250475,0.000013300652,0.000011973228,0.0003651267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986652,0.000034329514,0.00027982797,0.00046509117,0.00021593901,0.00033958277],"domain_scores_gemma":[0.99909055,0.00010007154,0.00012732219,0.00017083713,0.00045185382,0.00005939159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032593147,0.00017668598,0.00017995638,0.00020024348,0.0005699768,0.0006977507,0.00039490135,0.00009369891,0.00000863002],"category_scores_gemma":[0.000032133998,0.00016796583,0.000068188194,0.0007799193,0.000033796376,0.00089994376,0.00005548903,0.00012921572,0.000008948785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009282069,0.000051751886,0.00003925673,0.000116619616,0.000007506765,0.000003817009,0.00005512882,0.00014166864,0.017731298,0.00012394381,0.0005034371,0.9812163],"study_design_scores_gemma":[0.00056447875,0.00004242744,0.00005214664,0.00024259533,0.000015399592,0.0000074757186,0.000017567554,0.63439375,0.35508904,0.008462279,0.00093677355,0.00017608682],"about_ca_topic_score_codex":0.0000040602076,"about_ca_topic_score_gemma":0.000002872395,"teacher_disagreement_score":0.9810402,"about_ca_system_score_codex":0.00007513127,"about_ca_system_score_gemma":0.0005208827,"threshold_uncertainty_score":0.6849448},"labels":[],"label_agreement":null},{"id":"W4412791536","doi":"10.1016/j.sigpro.2025.110211","title":"A novel hybrid active noise control system capable of suppressing two correlated noise sources","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Japan Society for the Promotion of Science; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Active noise control; Noise (video); Computer science; Noise control; Control theory (sociology); Electronic engineering; Control (management); Engineering; Noise reduction; Artificial intelligence","score_opus":0.007452068494141907,"score_gpt":0.2287226212783953,"score_spread":0.2212705527842534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09788678,0.0009047317,0.895451,0.000010113234,0.00011662972,0.0003099101,0.000056314315,0.0012022826,0.0040622014],"genre_scores_gemma":[0.9870203,0.0000027237656,0.012692714,0.000020122112,0.000051885323,0.00004979652,0.000007850344,0.000061000104,0.00009358006],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862885,0.000028463895,0.00044758318,0.0003014899,0.00020400672,0.00038958],"domain_scores_gemma":[0.9992796,0.00011329447,0.00016613782,0.00017605764,0.00019903488,0.00006583555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015285688,0.00029665945,0.0004648051,0.0002458551,0.0001587885,0.000068647816,0.00024309685,0.000081747254,0.00000983148],"category_scores_gemma":[0.000032106644,0.00030417074,0.00008189983,0.00035489837,0.00011771043,0.00044561288,0.000060732527,0.00033224412,0.000003130861],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011242012,0.000038189173,0.00011177337,0.0010929798,0.000088395485,0.000012222867,0.00024304101,0.13966595,0.83817506,0.00013533,0.000047695743,0.020276954],"study_design_scores_gemma":[0.00086702115,0.00002311371,0.00010174099,0.0021774569,0.0000674589,0.000018249377,0.00022975879,0.4813073,0.514667,0.00017996423,0.00012459258,0.00023637588],"about_ca_topic_score_codex":0.000034670415,"about_ca_topic_score_gemma":0.0000019114163,"teacher_disagreement_score":0.8891336,"about_ca_system_score_codex":0.00023510632,"about_ca_system_score_gemma":0.0000863472,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W4413237403","doi":"10.1016/j.sigpro.2025.110234","title":"Joint range-azimuth resolution limit for radar coincidence imaging based on spatial information theory","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced SAR Imaging Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Shenzhen Science and Technology Innovation Program; Graduate Research and Innovation Projects of Jiangsu Province; National Natural Science Foundation of China","keywords":"Azimuth; Joint (building); Coincidence; Radar; Radar imaging; Range (aeronautics); Remote sensing; Computer science; Limit (mathematics); Image resolution; Physics; Geology; Optics; Telecommunications; Artificial intelligence; Mathematics; Engineering; Aerospace engineering; Mathematical analysis","score_opus":0.009014156769338305,"score_gpt":0.2429685469839439,"score_spread":0.2339543902146056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030273042,0.00039267953,0.99411124,0.00023562746,0.00010241296,0.00036652628,0.0000096791855,0.0010473814,0.0034317346],"genre_scores_gemma":[0.9364076,0.0000032373032,0.06283321,0.000554996,0.000059793292,0.00007482911,0.000024008956,0.00002460441,0.000017669468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990915,0.000027823457,0.00029188782,0.0001515414,0.00017771676,0.0002595105],"domain_scores_gemma":[0.99949366,0.00011868264,0.00007514976,0.00015156531,0.00012851047,0.00003245712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690649,0.00016966277,0.00015052165,0.00026073644,0.00019110541,0.000109311804,0.00013238552,0.00005031948,0.0000073908354],"category_scores_gemma":[0.00015340665,0.00017797883,0.00005365351,0.00020649456,0.00005281921,0.0007750539,0.000022872864,0.00019372978,0.0000052001183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020546935,0.000017757193,0.00008913614,0.00079945097,0.000008892557,0.0000031913992,0.00025449943,0.07232327,0.011915828,0.0009720168,0.0013612347,0.91204923],"study_design_scores_gemma":[0.00043183044,0.000023352597,0.00016918675,0.00075418106,0.000019335595,0.0000020810278,0.000057453934,0.9342548,0.046854075,0.015282295,0.0019547036,0.0001966743],"about_ca_topic_score_codex":0.000007977334,"about_ca_topic_score_gemma":0.0000018667289,"teacher_disagreement_score":0.9361049,"about_ca_system_score_codex":0.0002223083,"about_ca_system_score_gemma":0.00008854945,"threshold_uncertainty_score":0.7257766},"labels":[],"label_agreement":null},{"id":"W4413326883","doi":"10.1016/j.sigpro.2025.110244","title":"A multi-stage few-shot framework for extensible radar-based human activity recognition","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced SAR Imaging Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Radar; Computer science; Stage (stratigraphy); Shot (pellet); Artificial intelligence; Extensibility; Pattern recognition (psychology); Geology; Telecommunications; Materials science; Programming language","score_opus":0.08304366614017664,"score_gpt":0.36748710413798746,"score_spread":0.2844434379978108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413326883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012876332,0.0002920038,0.9840644,0.00007597637,0.00006806656,0.00038430752,0.000020683947,0.0015763976,0.0006418583],"genre_scores_gemma":[0.59051335,0.0000015546887,0.4091276,0.00011243485,0.000038367984,0.000085076215,0.000014038087,0.000037097336,0.00007048157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911743,0.000018690835,0.00018280455,0.00027101918,0.00010580224,0.0003042432],"domain_scores_gemma":[0.9995039,0.00011821133,0.0000570543,0.00016548186,0.00011417136,0.000041165564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017296702,0.00019711202,0.00020275406,0.00016692709,0.00025345944,0.00009517861,0.0001336663,0.00012532927,0.000020025049],"category_scores_gemma":[0.00007960318,0.00022258132,0.00006787089,0.00029025003,0.00005261766,0.00030460345,0.000021594187,0.00032380183,0.0000030480455],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057162488,0.00009188289,0.00007821967,0.0013594622,0.000022913728,0.0000057833417,0.00009216069,0.0029194958,0.6358755,0.00013721328,0.00030623903,0.35905394],"study_design_scores_gemma":[0.00053893327,0.00003523248,0.0001380917,0.0011414415,0.000033401946,8.4400006e-7,0.000039821996,0.25135475,0.71022934,0.03489755,0.0012222583,0.00036831672],"about_ca_topic_score_codex":0.0000060846914,"about_ca_topic_score_gemma":0.000005707308,"teacher_disagreement_score":0.577637,"about_ca_system_score_codex":0.00013257816,"about_ca_system_score_gemma":0.00005936564,"threshold_uncertainty_score":0.9076603},"labels":[],"label_agreement":null},{"id":"W645359941","doi":"10.1016/j.sigpro.2015.05.014","title":"Theoretical results for sparse signal recovery with noises using generalized OMP algorithm","year":2015,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"","keywords":"Matching pursuit; Iterated function; Algorithm; Stopping rule; Isometry (Riemannian geometry); SIGNAL (programming language); Signal reconstruction; Mathematics; Sparse approximation; Signal recovery; Constant (computer programming); Signal processing; Computer science; Compressed sensing; Mathematical optimization; Mathematical analysis","score_opus":0.04054572021444735,"score_gpt":0.26355870922858504,"score_spread":0.22301298901413769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W645359941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042565517,0.0007954482,0.9512322,0.000042339136,0.00014102644,0.00033186574,0.000031978787,0.000886097,0.003973557],"genre_scores_gemma":[0.7530059,0.000007870752,0.24636015,0.00008048604,0.00041246135,0.0000177788,0.000021626644,0.00007189859,0.000021816404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857235,0.000040331477,0.00033290655,0.00032625205,0.00029258124,0.00043558242],"domain_scores_gemma":[0.99921626,0.00008243526,0.00008487982,0.00017576914,0.00027230888,0.00016837718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043913,0.0002835689,0.0003128393,0.000118582146,0.00013721093,0.00018160205,0.00016904969,0.00012628728,0.0000132314735],"category_scores_gemma":[0.000027450636,0.00023841443,0.000069748945,0.0002134162,0.00016255799,0.00030142526,0.0000355334,0.00018053346,0.0000034640123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026488246,0.00017035627,0.000028715405,0.00023289844,0.00025620416,0.00018768507,0.0011234753,0.37639445,0.08000452,0.0024061678,0.009147846,0.5273989],"study_design_scores_gemma":[0.0012255092,0.00022930061,0.0000026905172,0.00035147,0.00007198331,0.00006986967,0.00009531569,0.8808683,0.101285025,0.014375671,0.0010077676,0.0004170562],"about_ca_topic_score_codex":0.000013431784,"about_ca_topic_score_gemma":0.0000018913598,"teacher_disagreement_score":0.7104404,"about_ca_system_score_codex":0.00009557577,"about_ca_system_score_gemma":0.00014693498,"threshold_uncertainty_score":0.97222584},"labels":[],"label_agreement":null},{"id":"W66172763","doi":"10.1016/j.sigpro.2004.05.001","title":"New trends and findings in antenna array processing for radar","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Radar; Antenna array; Antenna (radio); Computer science; Array processing; Telecommunications; Remote sensing; Signal processing; Electronic engineering; Engineering; Geography","score_opus":0.011277327449187365,"score_gpt":0.2238968680981349,"score_spread":0.21261954064894753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66172763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067917854,0.002603432,0.9894555,0.00018680537,0.000032903674,0.00008525263,0.0000020271282,0.0001813802,0.000660903],"genre_scores_gemma":[0.92555,0.000030400544,0.07398938,0.00006530714,0.000090643014,0.000008170195,0.000009887515,0.00004217275,0.00021406262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922615,0.000004413484,0.00020231752,0.0001993569,0.00009646053,0.00027130666],"domain_scores_gemma":[0.99980193,0.000012163718,0.000027988382,0.000042860433,0.00003972003,0.00007531953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009429015,0.00015200015,0.00016130446,0.00018133562,0.00009792797,0.00011908368,0.000060643095,0.000083442574,0.000011573944],"category_scores_gemma":[0.000010304149,0.00015422465,0.00002579112,0.0004222582,0.000023178796,0.00043988883,0.000006689124,0.000116326286,0.0000012590034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007336337,0.00003146585,0.0004086094,0.0006468628,0.000011986006,0.000017042292,0.0028870946,0.01859096,0.24242342,0.00021252324,0.000118779375,0.7345779],"study_design_scores_gemma":[0.008528688,0.00023278293,0.00520538,0.0028715513,0.00010804085,0.00015211965,0.0011388151,0.86441135,0.09516657,0.018622894,0.0017531648,0.0018086341],"about_ca_topic_score_codex":0.000006219447,"about_ca_topic_score_gemma":0.000013537919,"teacher_disagreement_score":0.9187582,"about_ca_system_score_codex":0.00006485706,"about_ca_system_score_gemma":0.0000984997,"threshold_uncertainty_score":0.6289099},"labels":[],"label_agreement":null},{"id":"W7116371784","doi":"10.1016/j.sigpro.2025.110451","title":"Imaging coupled filtering: A unified multi-channel framework for multimodal medical image registration and fusion","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"National Natural Science Foundation of China","keywords":"Image fusion; Medical imaging; Feature (linguistics); Pattern recognition (psychology); Benchmark (surveying); Smoothing; Fusion; Feature extraction","score_opus":0.012732848034940484,"score_gpt":0.2971015682368053,"score_spread":0.2843687202018648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116371784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028527812,0.0008125357,0.9944931,0.0002783776,0.00009287583,0.00036530662,0.0000052985156,0.000825313,0.00027440177],"genre_scores_gemma":[0.68252397,0.000044109667,0.3170584,0.0001269208,0.000065201304,0.00007762322,0.000013649633,0.000034910252,0.00005518727],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891514,0.000013737026,0.0003151923,0.000288653,0.0001911846,0.00027611846],"domain_scores_gemma":[0.9994579,0.00014307113,0.00006305185,0.00012699745,0.00012078249,0.000088202185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025881428,0.00020155196,0.00020243308,0.00013867425,0.00021610636,0.00012356315,0.00014208013,0.00014051174,0.00002669593],"category_scores_gemma":[0.00025013238,0.00020726897,0.000038964714,0.00019589027,0.00009778453,0.00036791476,0.000071100265,0.00029554364,9.582094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014574139,0.00009475764,0.000062821884,0.0021758436,0.000027540185,0.000040430237,0.00075969595,0.0023736148,0.59539175,0.00078532915,0.00054617925,0.39759633],"study_design_scores_gemma":[0.00055517006,0.000014939983,0.0000744615,0.000872404,0.000013781036,0.000008089193,0.00016122106,0.9381311,0.052196395,0.007571544,0.00019288129,0.00020803374],"about_ca_topic_score_codex":0.000007702165,"about_ca_topic_score_gemma":0.0000036985575,"teacher_disagreement_score":0.93575746,"about_ca_system_score_codex":0.000055961063,"about_ca_system_score_gemma":0.00006376273,"threshold_uncertainty_score":0.8452183},"labels":[],"label_agreement":null},{"id":"W840214300","doi":"10.1016/j.sigpro.2015.04.010","title":"On imperfect pricing in globally constrained noncooperative games for cognitive radio networks","year":2015,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Imperfect; Cognitive radio; Nash equilibrium; Mathematical optimization; Mathematical economics; Perfect information; Computer science; Monotone polygon; Class (philosophy); Contrast (vision); Economics; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.019720696094135584,"score_gpt":0.26969177196970173,"score_spread":0.24997107587556616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W840214300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02982965,0.0009157415,0.9607938,0.00026292182,0.0001544701,0.00054437417,0.000003003411,0.00012801129,0.0073680505],"genre_scores_gemma":[0.99115944,0.000006446453,0.007728133,0.00072609365,0.00029586864,0.000023626919,0.0000068772956,0.000021092024,0.0000324416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980182,0.00013489516,0.00033369812,0.00061179115,0.00030259305,0.0005988265],"domain_scores_gemma":[0.9985669,0.0006255937,0.00014801059,0.00011242672,0.00036692503,0.00018011489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008220277,0.00027355403,0.00036174917,0.00015447798,0.00021590211,0.00046954828,0.000298563,0.000100176956,0.0000035068822],"category_scores_gemma":[0.00019164225,0.00024789356,0.0000763366,0.00067503605,0.00011681863,0.0005652694,0.000080169564,0.0002962936,0.0000036962665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046739724,0.00017507598,0.00043886632,0.000042593754,0.000053374773,0.00017189216,0.004107149,0.047083277,0.0003352169,0.011704658,0.0004695844,0.9349509],"study_design_scores_gemma":[0.002269741,0.0006235392,0.00021440056,0.000771161,0.000015235334,0.000058962556,0.00044730012,0.9901031,0.00063829776,0.0044250065,0.000050493007,0.00038274945],"about_ca_topic_score_codex":0.000015607511,"about_ca_topic_score_gemma":0.000039083796,"teacher_disagreement_score":0.96132976,"about_ca_system_score_codex":0.00021213456,"about_ca_system_score_gemma":0.00049084664,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null}]}