{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":111,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":111,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d5fc8012e5c0","filters":{"venue":"Signal Processing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07905418114954706,"gpt":0.2786842532869124,"spread":0.1996300721373653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729196,0.0001156513,0.0001836195,0.0001332547,0.00009633497,0.00004018606,0.0004351409,0.00005515981,0.000008681727],"category_scores_gemma":[0.00007730274,0.0001099877,0.00004063714,0.0004703758,0.00007862407,0.001711259,0.0001168093,0.00008767646,0.000003099929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003954128,"about_ca_system_score_gemma":0.0001607947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009840627,"about_ca_topic_score_gemma":2.366306e-7,"domain_scores_codex":[0.9988678,0.00005932454,0.0003644915,0.0001782831,0.000294028,0.0002360949],"domain_scores_gemma":[0.9989868,0.0001353133,0.000411479,0.0001773817,0.0002237353,0.00006524334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007268867,0.0004925766,0.001238192,0.0006041207,0.0000540851,0.000002657478,0.008636423,0.03265603,0.09782701,0.1433341,0.00008536444,0.7149968],"study_design_scores_gemma":[0.000110511,0.0001139757,0.0003832457,0.0003819219,0.00001194269,0.00001228119,0.00007033854,0.4439564,0.5505788,0.004030531,0.0001616174,0.0001884159],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001245725,0.0002855832,0.9936683,0.00002598906,0.00006546903,0.0001465052,7.568171e-7,0.0001761308,0.004385538],"genre_scores_gemma":[0.5223888,0.000001220183,0.4775204,0.00001178215,0.00002481421,0.000008717621,2.135807e-7,0.000005616659,0.00003848604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7148084,"threshold_uncertainty_score":0.4485166,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08643494222221643,"gpt":0.3790179068213947,"spread":0.2925829645991783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098662,0.0002902743,0.001013271,0.0001280353,0.0002480993,0.0003348741,0.0005112397,0.0001412811,0.00001463285],"category_scores_gemma":[0.0001241869,0.0002111051,0.000125246,0.0001646859,0.0001274302,0.0003682607,0.0001933468,0.0002527676,7.243268e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001787851,"about_ca_system_score_gemma":0.0001399567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001422391,"about_ca_topic_score_gemma":2.980701e-7,"domain_scores_codex":[0.9982754,0.000191552,0.0005815632,0.0005244334,0.0001868293,0.0002401938],"domain_scores_gemma":[0.9982016,0.0003643976,0.000810124,0.000433717,0.00009085629,0.00009931793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003734994,0.000007366472,1.534286e-7,0.0524777,0.00001977848,0.000002674349,0.00004769638,0.000002510802,1.034614e-7,0.0002897317,0.0008113395,0.9463372],"study_design_scores_gemma":[0.0001279648,0.00005896494,0.000001247361,0.1147062,0.0002183415,0.00007298713,0.000001008701,0.009138136,0.000001500273,0.002496706,0.8728696,0.0003073809],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.587705e-7,0.7428,0.2566403,0.00007806472,0.00008053071,0.0002114636,0.00003750052,0.00002805938,0.0001239182],"genre_scores_gemma":[0.000004007311,0.9210735,0.07836174,0.0001533545,0.00006118883,0.0000470216,0.00007240695,0.00001991598,0.000206861],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9460298,"threshold_uncertainty_score":0.8608615,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01503089468195925,"gpt":0.2967754132005522,"spread":0.2817445185185929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004678706,0.000260392,0.0002829127,0.0001547943,0.0001927696,0.0001053543,0.0001606923,0.000129269,0.0001960451],"category_scores_gemma":[0.00003075744,0.0002674646,0.0001198201,0.0002602726,0.00002941614,0.001023376,0.00001362895,0.0001856576,0.00002074341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001566813,"about_ca_system_score_gemma":0.00003799163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000234648,"about_ca_topic_score_gemma":0.000009272017,"domain_scores_codex":[0.9984781,0.00003010054,0.0004342652,0.0002315668,0.0002343938,0.0005915698],"domain_scores_gemma":[0.9994639,0.0001187964,0.00007321851,0.0001271931,0.00008266395,0.0001341904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001940185,0.0000574831,0.0005530421,0.0006764361,0.00004064729,0.000001843686,0.001352745,0.0019477,0.8141624,0.0001632363,0.0009648629,0.1800602],"study_design_scores_gemma":[0.0004584889,0.0000487728,0.0001126508,0.000278027,0.00006475824,0.00001491837,0.00005127408,0.1494407,0.8461073,0.002301647,0.0006631247,0.0004584026],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1142121,0.002813474,0.8743602,0.00007725369,0.0001108754,0.0009078881,0.00001771427,0.001773915,0.005726619],"genre_scores_gemma":[0.958413,0.00001960315,0.04041371,0.00007262043,0.0005152994,0.000371713,0.00004884437,0.00009412384,0.00005104791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.844201,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01294774993518675,"gpt":0.2507175747478015,"spread":0.2377698248126148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001494607,0.000107272,0.0001102102,0.00004253093,0.00009074408,0.00003732859,0.00006924153,0.00005876834,0.000102897],"category_scores_gemma":[0.000052362,0.00007202938,0.00001620574,0.0001922772,0.00005290835,0.0002744714,0.000005616369,0.0003085432,0.000006902966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002507585,"about_ca_system_score_gemma":0.00004935367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003554575,"about_ca_topic_score_gemma":0.000003502973,"domain_scores_codex":[0.9992927,0.00002549775,0.0001679209,0.0001168925,0.0002531974,0.0001437671],"domain_scores_gemma":[0.9993777,0.0002741406,0.00009034448,0.0001102047,0.0001155477,0.00003204965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000267901,0.0000790883,0.000222027,0.0003647236,0.0001315637,0.00001722497,0.0005056001,0.3920115,0.5178617,0.06183947,0.001352034,0.02534721],"study_design_scores_gemma":[0.001801669,0.0003309822,0.001344699,0.0009232267,0.0001121406,0.0001142872,0.0004510585,0.9291955,0.03909992,0.01524232,0.01049996,0.0008842035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01308624,0.00005148102,0.9781688,0.0002528326,0.0001431664,0.0001852414,0.000001877392,0.0001465197,0.007963843],"genre_scores_gemma":[0.9960815,5.59587e-7,0.003580119,0.0000690249,0.0001395881,0.00002228473,0.000002674027,0.00003002899,0.00007424424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9829952,"threshold_uncertainty_score":0.2937273,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01372581945362532,"gpt":0.270652893456114,"spread":0.2569270740024887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005379053,0.0002299307,0.0001962884,0.0002689685,0.0005537351,0.0006664203,0.0006315878,0.00008294624,0.000001781789],"category_scores_gemma":[0.000004054801,0.0002021338,0.0001003682,0.0004627765,0.0001123037,0.002006465,0.0001708563,0.0002176358,0.000006217664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008530761,"about_ca_system_score_gemma":0.00004658862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003601839,"about_ca_topic_score_gemma":6.442286e-7,"domain_scores_codex":[0.9982651,0.00003256438,0.0003504176,0.0004569907,0.0003613844,0.0005335613],"domain_scores_gemma":[0.9993076,0.00004446032,0.0001812755,0.0002106875,0.0001404198,0.0001155234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001283632,0.0002718348,0.002269152,0.0006347743,0.00004182076,0.0009539789,0.001657377,0.0001197055,0.125833,0.01239152,0.00009213677,0.8556064],"study_design_scores_gemma":[0.001362605,0.0008187129,0.002253936,0.002446136,0.00003387457,0.0001891807,0.0007219517,0.3357439,0.6393592,0.01380355,0.00125814,0.002008769],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465195,0.00005917585,0.9757239,0.00002080224,0.00005224863,0.000135801,0.00000158071,0.001239687,0.008114838],"genre_scores_gemma":[0.9176102,8.936107e-8,0.0821532,0.00007378191,0.0001070296,0.000007555056,0.000004222879,0.00001999148,0.00002398046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9029582,"threshold_uncertainty_score":0.8242779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008601640146762396,"gpt":0.214217045569297,"spread":0.2056154054225346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005448976,0.0001766584,0.0001622277,0.0001466981,0.00015055,0.0001526748,0.0001310114,0.0001459222,0.0002550691],"category_scores_gemma":[0.0000172261,0.0001670945,0.0000499202,0.0003277357,0.00006091244,0.0002344595,0.000009630135,0.0000935436,0.00003206013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004842248,"about_ca_system_score_gemma":0.00009981827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001916805,"about_ca_topic_score_gemma":0.000002651695,"domain_scores_codex":[0.9991423,0.000008280913,0.0002433891,0.0001732282,0.0001430212,0.0002897418],"domain_scores_gemma":[0.9996004,0.00003722847,0.00004637216,0.00009017866,0.0001558916,0.00006992146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003740877,0.00001082467,0.00005388786,0.0001714964,0.00001182263,8.890535e-7,0.00009158536,0.02106809,0.001663325,0.0002207528,0.003036497,0.9736671],"study_design_scores_gemma":[0.0006097257,0.00003973214,0.00001381896,0.00009144321,0.00001421476,0.000002104557,0.0001820244,0.9463824,0.0477074,0.002607344,0.002130553,0.0002192142],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003123022,0.0003803354,0.9965904,0.0001066983,0.00007811319,0.0003839517,0.000009083192,0.001298168,0.0008409501],"genre_scores_gemma":[0.8999642,0.000003029926,0.0994781,0.000142983,0.0001274333,0.00008300068,0.00006521535,0.00005064095,0.00008540493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9734479,"threshold_uncertainty_score":0.6813914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02335360017000466,"gpt":0.2518488244883016,"spread":0.228495224318297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002435355,0.0001379372,0.0001144293,0.000133,0.0002818803,0.0001929569,0.0002020982,0.00006993194,0.0000437163],"category_scores_gemma":[0.00001241881,0.0001274378,0.0000476446,0.0004053849,0.00002044674,0.001243935,0.0000241807,0.0001589049,0.0001422607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003605974,"about_ca_system_score_gemma":0.00006443974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005149198,"about_ca_topic_score_gemma":2.693153e-7,"domain_scores_codex":[0.9988032,0.00007024084,0.0002090086,0.000380977,0.0002952621,0.0002412909],"domain_scores_gemma":[0.9994617,0.00001846571,0.000128844,0.0001508037,0.0001563098,0.00008385175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001578482,0.00006111924,0.000004035877,0.00001413629,9.930042e-7,0.000003521993,0.0001381201,0.0001741584,0.1614955,0.000009130192,0.0005557385,0.8375278],"study_design_scores_gemma":[0.0006407571,0.0002515107,0.0003780005,0.0004724705,0.00001241397,0.00005044592,0.00007524888,0.5247173,0.45239,0.01999103,0.0005787594,0.0004420847],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04054634,0.0001433829,0.956184,0.001512501,0.0001361556,0.0001359665,0.00000107143,0.0003382048,0.001002359],"genre_scores_gemma":[0.9529319,0.00000377191,0.04619808,0.0006761838,0.00009951954,0.000007034155,0.00002911206,0.000006854037,0.00004755285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9123856,"threshold_uncertainty_score":0.5196761,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01062568655568175,"gpt":0.2664970338967838,"spread":0.2558713473411021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001448494,0.00004590695,0.00009622507,0.00006998307,0.00002135418,0.000008977465,0.00003390093,0.00003025585,0.00001224177],"category_scores_gemma":[0.000005538838,0.00004703163,0.00002751032,0.0001368232,0.00001155326,0.0001930965,0.000002733996,0.0000408765,0.000002240131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002935937,"about_ca_system_score_gemma":0.00003473164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003904013,"about_ca_topic_score_gemma":0.000004675091,"domain_scores_codex":[0.9995447,0.000009300737,0.0002243573,0.00005948335,0.000105849,0.00005628704],"domain_scores_gemma":[0.9997613,0.00001893517,0.00007614587,0.00004415273,0.0000853358,0.00001416411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000006129446,0.00001677229,0.00003970419,0.0002735387,0.000008814125,4.116266e-7,0.000346108,0.0736366,0.7878339,0.0002143392,0.000009675524,0.137614],"study_design_scores_gemma":[0.001306181,0.00008187861,0.009806528,0.0008137188,0.00007663531,0.00005051224,0.0008750512,0.2688972,0.7087774,0.008425023,0.0005838393,0.0003059804],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07355444,0.0006564586,0.9239755,0.00001582021,0.00004496978,0.00007192385,0.000002902249,0.00004391358,0.00163413],"genre_scores_gemma":[0.9839227,0.000002842795,0.0159979,0.000001701818,0.0000356809,0.000005200847,0.000003527321,0.000008533419,0.00002189468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9103683,"threshold_uncertainty_score":0.1917894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0132410885447598,"gpt":0.2223789842309562,"spread":0.2091378956861964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001120478,0.0001928958,0.000174016,0.00007279596,0.0003344603,0.001020469,0.0004069226,0.0001403446,0.000139047],"category_scores_gemma":[0.00001687046,0.0001641239,0.00001916888,0.0003481693,0.00005239077,0.001290562,0.000163377,0.0003158451,0.00001052423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001571323,"about_ca_system_score_gemma":0.00007232958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004052657,"about_ca_topic_score_gemma":0.000001464699,"domain_scores_codex":[0.9987449,0.00003884102,0.0002335139,0.0004291825,0.0002375896,0.0003159912],"domain_scores_gemma":[0.9993041,0.00005228426,0.0001273189,0.0002569447,0.0001348716,0.0001245448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002515387,0.000103529,0.0004448974,0.0003799197,0.00002347301,0.00002175929,0.0008951043,0.2818468,0.02128066,0.005629314,0.00500549,0.6843439],"study_design_scores_gemma":[0.0002758797,0.0000705429,0.000746725,0.0001234579,0.000006733118,0.0000227568,0.00003701635,0.9897761,0.00047831,0.007787885,0.0004539806,0.0002206022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04503848,0.0003174903,0.952987,0.0002709585,0.0001452988,0.0001957014,0.0000109086,0.000305126,0.0007291068],"genre_scores_gemma":[0.6728747,0.000003345676,0.3267186,0.0001654233,0.0001028687,0.000005093195,0.00003706778,0.00001277244,0.00008018103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7079293,"threshold_uncertainty_score":0.9840405,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0129132641325198,"gpt":0.2297087900840749,"spread":0.2167955259515551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974912,0.0001802628,0.0001609144,0.00003856622,0.000538905,0.0003895157,0.00109036,0.00007245153,0.00003069156],"category_scores_gemma":[0.00001943971,0.0001010105,0.00005551445,0.0004009652,0.00009504167,0.00116656,0.0003819136,0.0003235709,0.00000210908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001703569,"about_ca_system_score_gemma":0.00005392251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001742712,"about_ca_topic_score_gemma":0.000001313162,"domain_scores_codex":[0.9986256,0.0001070369,0.0002400302,0.0002395064,0.0003243663,0.0004634908],"domain_scores_gemma":[0.9990172,0.0001999376,0.0001856061,0.0004870671,0.00005281115,0.0000573552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002702892,0.0001340609,0.005226988,0.002093693,0.00008353222,0.00001045224,0.02033309,0.02049174,0.6629094,0.03490627,0.001643397,0.2521404],"study_design_scores_gemma":[0.001628191,0.0002102949,0.04725017,0.006454948,0.0002044972,0.0003170946,0.004294297,0.3473491,0.535193,0.0284247,0.02635192,0.002321765],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1894346,0.002349362,0.8031458,0.0002702375,0.001495864,0.0002905018,0.000006353122,0.0002131183,0.002794139],"genre_scores_gemma":[0.9860235,0.00000439856,0.01333152,0.0002583507,0.0003312585,0.000005651658,0.000001470485,0.00001578532,0.00002806412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7965888,"threshold_uncertainty_score":0.4144876,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01701490606133687,"gpt":0.2983029703516247,"spread":0.2812880642902878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007622127,0.0001001136,0.0001203578,0.00009581599,0.00004627409,0.00004592461,0.00009338194,0.00006997134,0.00002235485],"category_scores_gemma":[0.000006412951,0.00009772678,0.0000221333,0.0001393977,0.00003680191,0.0003835886,0.00001627633,0.0003042501,0.00001308439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662503,"about_ca_system_score_gemma":0.00001341748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002955459,"about_ca_topic_score_gemma":0.00001380193,"domain_scores_codex":[0.9994311,0.000009097947,0.0001455607,0.0001222839,0.0001110105,0.0001809931],"domain_scores_gemma":[0.9998215,0.00002050952,0.00002146039,0.00007666674,0.00002589986,0.00003397992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002372128,0.00006063495,0.005703234,0.0001520565,0.000005888542,0.0000442905,0.0003926925,0.01163968,0.7424768,0.0009535398,0.001013049,0.2375345],"study_design_scores_gemma":[0.0005494917,0.00006103476,0.006691337,0.0004276217,0.00001466778,0.00006402899,0.0000982799,0.7059106,0.1978027,0.05224468,0.03534641,0.0007891193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9377146,0.007188682,0.0480097,0.0001320149,0.0003131844,0.0001556299,0.000001896506,0.001499487,0.004984827],"genre_scores_gemma":[0.9933857,0.00004785022,0.006238617,0.0000527898,0.0002371463,0.000005769268,0.000002731398,0.00002011542,0.000009285766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.694271,"threshold_uncertainty_score":0.3985183,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08077974115554895,"gpt":0.2872195236105227,"spread":0.2064397824549737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539292,0.0001810677,0.0002137315,0.00009096348,0.0004280262,0.0007598282,0.0002684514,0.00004804172,0.00002155261],"category_scores_gemma":[0.00006256148,0.0001481491,0.00002545586,0.0002248344,0.0001948271,0.0009211751,0.00008916896,0.000188058,0.00001130168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002038354,"about_ca_system_score_gemma":0.0001213678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001221999,"about_ca_topic_score_gemma":4.184464e-7,"domain_scores_codex":[0.9984755,0.0002131905,0.0002524209,0.0004107979,0.0002846984,0.0003633875],"domain_scores_gemma":[0.9994284,0.0001013086,0.00006738363,0.0001663883,0.0001310084,0.0001055373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007564782,0.0001739001,0.00008352016,0.0007464673,0.00003865618,0.0002238894,0.005559152,0.002772512,0.2873688,0.09723607,0.0006138337,0.6051075],"study_design_scores_gemma":[0.0004306053,0.00006689433,0.00003860865,0.0001096794,0.00001266746,0.0001197798,0.0001254901,0.927095,0.02563829,0.04476617,0.001256008,0.0003408133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003480975,0.001054175,0.9912965,0.0001536441,0.00003496604,0.00009167191,0.000001282282,0.0001336422,0.003753144],"genre_scores_gemma":[0.514551,0.000006358348,0.4851456,0.0001739924,0.00002127959,0.000003473157,7.324036e-7,0.000009908258,0.00008766304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9243225,"threshold_uncertainty_score":0.7327041,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01138834182562442,"gpt":0.2434723222563858,"spread":0.2320839804307614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005136144,0.0002597816,0.0002902064,0.0002263652,0.0003796516,0.0003591142,0.0001821221,0.0000885735,0.00001966032],"category_scores_gemma":[0.0001532347,0.0002589793,0.00007983976,0.0008158138,0.00007311511,0.0005136136,0.00004500309,0.0002919333,0.00000971999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001850697,"about_ca_system_score_gemma":0.0001982511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001310801,"about_ca_topic_score_gemma":0.00001998683,"domain_scores_codex":[0.997943,0.0001038905,0.0003089412,0.0006393498,0.0003908604,0.0006140025],"domain_scores_gemma":[0.9987028,0.0006324903,0.0001648194,0.0001529586,0.0002287103,0.0001181789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001651132,0.001270447,0.003223975,0.0002800067,0.00009630252,0.0002100959,0.0007190258,0.1680969,0.004781144,0.003816391,0.0006937127,0.8151608],"study_design_scores_gemma":[0.001722353,0.0001973841,0.001168444,0.0004994971,0.00001351603,0.00001253101,0.0000298153,0.9894067,0.002235386,0.003915191,0.0004598236,0.0003393275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512973,0.00004352253,0.9820417,0.0009120879,0.00019447,0.0003279188,0.00001300539,0.0001091025,0.001228447],"genre_scores_gemma":[0.9867562,0.000001013913,0.01186866,0.000946208,0.0003145032,0.000008203972,0.00004136956,0.00002706104,0.00003676838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9716265,"threshold_uncertainty_score":0.9999862,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01712882295974039,"gpt":0.1945374396183719,"spread":0.1774086166586316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002277135,0.0002463276,0.0003961931,0.00006464662,0.0002033231,0.000424238,0.00009420777,0.00008255367,0.00000920309],"category_scores_gemma":[0.00001701852,0.0002035069,0.0000417572,0.0001028187,0.00007009492,0.0003872568,0.00001687851,0.0001431017,0.000003345591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000461706,"about_ca_system_score_gemma":0.00002974016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000579549,"about_ca_topic_score_gemma":0.00001083392,"domain_scores_codex":[0.9987997,0.00002695834,0.0003269252,0.000250667,0.0001704914,0.0004252715],"domain_scores_gemma":[0.999331,0.0002417819,0.0000683392,0.000112725,0.0001377348,0.0001084268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001790225,0.00001244611,0.0002698285,0.0022494,0.00008340162,0.000003214255,0.0009141325,0.9795514,0.001937617,0.00002083808,0.00008579199,0.01469285],"study_design_scores_gemma":[0.001836487,0.00007226305,0.00004479153,0.0008594823,0.00004031843,0.00003195529,0.002117906,0.9944375,0.00006180658,0.00005111414,0.0001444976,0.0003018499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773817,0.003574573,0.8169076,0.00004146888,0.0001864223,0.001174596,0.00001608633,0.0003730579,0.0003444859],"genre_scores_gemma":[0.9973598,0.000002336897,0.001766641,0.00002266561,0.000442027,0.0002959401,0.000005933085,0.00005382879,0.00005084445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8199781,"threshold_uncertainty_score":0.8298773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02877123565849139,"gpt":0.2759096306882519,"spread":0.2471383950297605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736972,0.00012143,0.0001044286,0.000116406,0.0003889631,0.0004022697,0.0002084328,0.00005197197,0.00004667115],"category_scores_gemma":[0.00002659555,0.0001055258,0.00002781256,0.0002623109,0.00003420752,0.001435031,0.00003183267,0.0001394771,0.00007320915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004998861,"about_ca_system_score_gemma":0.0001325563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004339417,"about_ca_topic_score_gemma":0.000006003539,"domain_scores_codex":[0.9986778,0.0001327935,0.0001797633,0.0003312976,0.0004903883,0.0001879543],"domain_scores_gemma":[0.9991887,0.00004104014,0.0001558731,0.000154335,0.0003990434,0.00006106231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000214701,0.0001139389,0.0001320395,0.00007345674,0.00001198956,0.000002400959,0.0009071674,0.00289,0.0614514,0.001255909,0.0002856966,0.9328545],"study_design_scores_gemma":[0.0009280206,0.0002744145,0.006235648,0.0001651103,0.00004476568,0.00001730592,0.00007048978,0.9463234,0.02180459,0.02288693,0.0009155764,0.0003337527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05067492,0.00004954907,0.9424253,0.0004942098,0.00007480148,0.00018072,5.314832e-7,0.0001818828,0.005918153],"genre_scores_gemma":[0.9878747,5.540803e-7,0.01135831,0.0004268762,0.0001992028,0.00002281102,0.00002454575,0.000009859624,0.00008313971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9434334,"threshold_uncertainty_score":0.4303218,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05560432141391625,"gpt":0.263150511456428,"spread":0.2075461900425117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003726374,0.00009820321,0.0001423278,0.0001104792,0.0001229453,0.0002103905,0.0002647667,0.00004320711,0.000001799411],"category_scores_gemma":[0.00001560617,0.00009082892,0.00001709274,0.00008741611,0.00006967114,0.001083883,0.00006529043,0.00006497486,0.000003199551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001674673,"about_ca_system_score_gemma":0.00009746897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001101577,"about_ca_topic_score_gemma":0.000001091565,"domain_scores_codex":[0.9990645,0.00002938475,0.0002937795,0.0002354688,0.0002092269,0.0001676322],"domain_scores_gemma":[0.9993923,0.00003717391,0.0002309753,0.0001329014,0.0001466391,0.00006001791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002205486,0.00002214196,0.000007572399,0.000496737,0.00000509293,0.000002862387,0.001424863,0.0003219477,0.05476703,0.0009456145,0.00001737881,0.9419866],"study_design_scores_gemma":[0.0007024903,0.0001553999,0.0007114472,0.001653694,0.00006180753,0.0002230202,0.004844562,0.5122507,0.4705129,0.005845215,0.002250652,0.0007881596],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03990661,0.1148596,0.8403299,0.00191268,0.00009548501,0.0001336957,0.000001574258,0.0002090503,0.002551361],"genre_scores_gemma":[0.9950321,0.0006124244,0.00402174,0.00005962575,0.000106407,0.000006689258,4.924914e-7,0.000007319941,0.0001531759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9551255,"threshold_uncertainty_score":0.3703896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03320405632123942,"gpt":0.2486538770088694,"spread":0.21544982068763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005270961,0.000212311,0.0003172748,0.0002387433,0.0001617689,0.0002423696,0.0004338185,0.0001315746,0.00001759227],"category_scores_gemma":[0.000007934823,0.0001943547,0.00007485726,0.001085847,0.0000632997,0.001089827,0.0001256638,0.0002684689,0.00000859516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070054,"about_ca_system_score_gemma":0.0001143821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008578293,"about_ca_topic_score_gemma":0.000004836357,"domain_scores_codex":[0.9981087,0.00005970922,0.0004934627,0.0003318375,0.0004022837,0.000603954],"domain_scores_gemma":[0.9991352,0.00004312809,0.0002694218,0.0002312359,0.0001279503,0.0001930752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001052245,0.0007825035,0.01029591,0.000852802,0.00006483551,0.00007568608,0.00273996,0.6707364,0.07490771,0.001146773,0.0001698595,0.2381223],"study_design_scores_gemma":[0.0003472116,0.00005171196,0.0008272843,0.0003339915,0.00001018118,0.00004931216,0.0001424004,0.9932657,0.004551341,0.00006595073,0.0001016021,0.0002533088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07986338,0.001436308,0.9171994,0.00001632491,0.0003555544,0.0001928718,0.00000417365,0.00009200169,0.0008399338],"genre_scores_gemma":[0.9884807,0.000002591992,0.01108892,0.0000275475,0.0003403857,0.000009190496,0.000001686972,0.00001897033,0.00002995152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9086174,"threshold_uncertainty_score":0.7925555,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01390589597804103,"gpt":0.2252008830050497,"spread":0.2112949870270087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001545946,0.0001864723,0.0001518645,0.00007550079,0.0001198485,0.00008368111,0.0001460614,0.0001146003,0.000164991],"category_scores_gemma":[0.00003225491,0.0001894127,0.00002738329,0.0003026321,0.0000416128,0.000465565,0.00003883594,0.0004754031,0.00001183664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005729734,"about_ca_system_score_gemma":0.00003945762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001030831,"about_ca_topic_score_gemma":0.000005165816,"domain_scores_codex":[0.999136,0.000008495241,0.0001841973,0.0002223174,0.0001519753,0.0002969964],"domain_scores_gemma":[0.9996362,0.00003504086,0.00004266263,0.0001384208,0.00008871903,0.00005901155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006998156,0.00002518268,0.00001855625,0.0001352094,0.00001125898,0.000006713731,0.00007296706,0.006261419,0.483514,0.0001573902,0.0003413149,0.5094489],"study_design_scores_gemma":[0.0002803373,0.00006564771,0.0001214387,0.0001779277,0.00001780814,0.00006587304,0.00004232124,0.8702386,0.1066063,0.002671329,0.01921968,0.0004927834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002903334,0.00007998002,0.987138,0.00001166209,0.0001992684,0.000181753,0.000006366013,0.002018101,0.007461575],"genre_scores_gemma":[0.2989904,0.000003234135,0.7001885,0.0000167821,0.0003535053,0.00005064505,0.000004177278,0.00006150492,0.0003312645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8639772,"threshold_uncertainty_score":0.7724028,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04856850487225214,"gpt":0.2870733484333325,"spread":0.2385048435610804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001298392,0.0003384176,0.0003163041,0.0003282157,0.0005421229,0.0005556747,0.0009194617,0.000106868,0.00004477245],"category_scores_gemma":[0.0001377295,0.0003165821,0.0001278372,0.0006240726,0.0001086234,0.0009696758,0.0001597247,0.0004030923,0.0000419057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009295731,"about_ca_system_score_gemma":0.0002433568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004738459,"about_ca_topic_score_gemma":0.00000241849,"domain_scores_codex":[0.9973988,0.0002371399,0.0004059148,0.000727073,0.0005688577,0.0006622013],"domain_scores_gemma":[0.9986252,0.0002687122,0.0002073457,0.0004822806,0.0002263454,0.0001900751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003751213,0.0003222313,0.0001025633,0.0002646478,0.00003145485,0.0003928437,0.005430746,0.01634415,0.07171214,0.0007895356,0.0001445785,0.90409],"study_design_scores_gemma":[0.0008818271,0.0002302302,0.0004417664,0.0005616651,0.0000293912,0.00003756541,0.00008985739,0.9729146,0.01918389,0.004976898,0.0000383791,0.0006139811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005713257,0.0002886718,0.9887819,0.0001023782,0.0001785269,0.000173236,0.000001564075,0.0003407729,0.004419736],"genre_scores_gemma":[0.633941,3.349225e-7,0.3652385,0.0005901566,0.0001018053,0.000009032837,6.23722e-7,0.00003020397,0.00008835886],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9565704,"threshold_uncertainty_score":0.9999287,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03313710968084864,"gpt":0.2726279218148083,"spread":0.2394908121339596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289722,0.0001844689,0.0001615246,0.00009388071,0.0004937748,0.0007392827,0.0007679358,0.00004585183,0.00002243598],"category_scores_gemma":[0.0001653038,0.0001259931,0.00006070735,0.000607876,0.00005138776,0.0004491138,0.0001080352,0.0002320638,0.00008659631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004292165,"about_ca_system_score_gemma":0.0001155115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003739793,"about_ca_topic_score_gemma":1.259844e-7,"domain_scores_codex":[0.9982846,0.0002846877,0.0002016666,0.0004496849,0.000359446,0.0004199073],"domain_scores_gemma":[0.9991237,0.0002449144,0.00007244949,0.0003542492,0.00009922383,0.0001054871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008849342,0.0003839479,0.00001218008,0.0001994684,0.00003157981,0.0001058601,0.00660494,0.005273827,0.4615387,0.1658409,0.00522464,0.3546955],"study_design_scores_gemma":[0.001290952,0.0005301316,0.0001412636,0.0004296802,0.00003166414,0.0001976767,0.0004645867,0.3806334,0.5088806,0.09662148,0.009356894,0.001421782],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006979941,0.00009436129,0.9442533,0.0003489297,0.00008000025,0.0001940943,4.930296e-7,0.0001218469,0.0479271],"genre_scores_gemma":[0.6602423,5.622941e-7,0.3370591,0.00215317,0.0000467947,0.00003199612,3.569787e-7,0.00001630874,0.0004493585],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6532624,"threshold_uncertainty_score":0.712892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03929378938253014,"gpt":0.3045735862542445,"spread":0.2652797968717143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004842294,0.0003971784,0.0003839773,0.0001360914,0.0008966476,0.0008400321,0.00116337,0.000186705,0.00005754571],"category_scores_gemma":[0.00004227277,0.0003090393,0.00009921402,0.0005372078,0.0001787486,0.00106215,0.0002102237,0.0003684457,0.00004400572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004887333,"about_ca_system_score_gemma":0.0001446461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034301,"about_ca_topic_score_gemma":0.00003445713,"domain_scores_codex":[0.9971914,0.00008821742,0.0004497098,0.0009582561,0.0005110977,0.0008013162],"domain_scores_gemma":[0.9982155,0.0001400978,0.0002799834,0.0005254293,0.0006250046,0.0002139716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002175066,0.005171735,0.0664652,0.001474931,0.0005799463,0.0003903437,0.03987397,0.009844928,0.08966771,0.0012596,0.01680574,0.7662908],"study_design_scores_gemma":[0.005772995,0.0007430724,0.003037609,0.0008324172,0.00006723568,0.00007338246,0.0003276464,0.9327307,0.04234783,0.0002570277,0.01254027,0.001269846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02094716,0.0006098295,0.9766974,0.0002559243,0.0003572081,0.0005161926,0.00002039913,0.000482709,0.0001131927],"genre_scores_gemma":[0.5875711,0.000003025675,0.411041,0.0005260862,0.0004535728,0.00004354361,0.0000236656,0.00004133918,0.0002966521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9228857,"threshold_uncertainty_score":0.9999362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006683575202701154,"gpt":0.2171524884047895,"spread":0.2104689132020883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495481,0.0001607111,0.0001595015,0.00006108871,0.00009464555,0.00002638182,0.0001129226,0.0001637368,0.00001501793],"category_scores_gemma":[0.00001006854,0.0001639284,0.00006808229,0.0002072224,0.00005125384,0.000005295229,0.00004454721,0.0001168047,0.000002459931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006083953,"about_ca_system_score_gemma":0.0001571653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005855678,"about_ca_topic_score_gemma":0.0000704834,"domain_scores_codex":[0.9988863,0.00005965513,0.0002230251,0.0003673929,0.0001469754,0.0003165915],"domain_scores_gemma":[0.9996024,0.000004320789,0.0000784107,0.0001714426,0.00006762404,0.00007581004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002116867,0.00003852626,0.002876343,0.000008117663,0.00001999191,0.000004551343,0.000005238397,0.9556825,0.03708877,0.0002033694,0.00007421987,0.003977247],"study_design_scores_gemma":[0.0003142687,0.00002574575,0.0001925469,0.00001567143,0.00002228067,0.00001234727,0.00001497676,0.9792275,0.01887469,0.001035542,0.00005010406,0.0002143426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7795766,0.00236361,0.2173917,0.00004021137,0.00003012753,0.00006826645,0.000002138132,0.00001183622,0.0005154663],"genre_scores_gemma":[0.9926487,0.00001850597,0.006594409,0.0001736882,0.0001010166,0.000008575677,0.00009577857,0.00002904787,0.0003302657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2130721,"threshold_uncertainty_score":0.6684805,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02220470187205058,"gpt":0.2859279917441289,"spread":0.2637232898720783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579387,0.0002604734,0.0002596476,0.0002216017,0.0006455492,0.0003703821,0.0007808844,0.0001641477,0.000003690302],"category_scores_gemma":[0.00006545155,0.0002278898,0.0001447445,0.000514236,0.0001058025,0.0007412222,0.0001044862,0.0003169761,0.000003781031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004825686,"about_ca_system_score_gemma":0.00008974994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002250855,"about_ca_topic_score_gemma":7.992615e-7,"domain_scores_codex":[0.998188,0.00009850835,0.0002849746,0.0006012607,0.0002772469,0.000549973],"domain_scores_gemma":[0.9988828,0.0003030577,0.0001852978,0.0003151886,0.0002130992,0.0001005047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002172263,0.0001306577,0.001152161,0.0003479264,0.00003242147,0.000006651267,0.002905718,0.0006838546,0.009898653,0.02296463,0.0002647977,0.9613953],"study_design_scores_gemma":[0.001065579,0.0005678019,0.0005554313,0.0009046891,0.00003453509,0.0000156318,0.00004935506,0.2829431,0.1686202,0.5363785,0.007875465,0.0009897975],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002889253,0.00009188243,0.9945898,0.0002526524,0.0001004118,0.0002996154,0.00000164474,0.0007248584,0.001049858],"genre_scores_gemma":[0.5908656,9.633997e-7,0.4084243,0.0004623973,0.0001481011,0.00005967305,0.000003337839,0.00001833144,0.00001730987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9604055,"threshold_uncertainty_score":0.9293078,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04864127345745488,"gpt":0.2486127521545056,"spread":0.1999714786970507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003779804,0.0002007456,0.0001928573,0.0001058262,0.0003476143,0.0002255763,0.0008264664,0.000107337,0.0001133651],"category_scores_gemma":[0.0000267034,0.0001722002,0.0001119317,0.0003013852,0.00006820866,0.0006469064,0.00008006975,0.0001870084,0.00002760633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086619,"about_ca_system_score_gemma":0.0001133678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001202055,"about_ca_topic_score_gemma":0.000004609962,"domain_scores_codex":[0.9984074,0.00004379749,0.0002971755,0.0005208243,0.0002643763,0.0004664877],"domain_scores_gemma":[0.9991248,0.0001004872,0.0001415591,0.0003736398,0.0001333005,0.0001261681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009687557,0.000146619,0.0001615341,0.000147646,0.00001358089,0.00002710855,0.001307812,0.000299461,0.002232735,0.0009020631,0.005762805,0.9889017],"study_design_scores_gemma":[0.001718485,0.0007134395,0.000842429,0.0003833954,0.00004065027,0.00004228761,0.00007225099,0.8760284,0.06977982,0.01727134,0.03221298,0.0008945711],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002539441,0.0002584867,0.994518,0.0001276472,0.0002825609,0.0001925947,0.0000112944,0.0003855027,0.001684486],"genre_scores_gemma":[0.6688353,8.993024e-7,0.3303257,0.000519077,0.0001689403,0.00002152554,0.00000868517,0.0000210352,0.00009886714],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9880072,"threshold_uncertainty_score":0.702212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01728294830435289,"gpt":0.2316316978101526,"spread":0.2143487495057997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462872,0.0001747774,0.000181533,0.00009669038,0.0005647375,0.0007316032,0.0004712101,0.00008701488,0.00001741154],"category_scores_gemma":[0.00002759997,0.0001581236,0.00007202705,0.0003899002,0.00008023636,0.00135534,0.0001301731,0.0001757579,0.00002378774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005529488,"about_ca_system_score_gemma":0.0001267625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001973038,"about_ca_topic_score_gemma":6.707577e-7,"domain_scores_codex":[0.9985192,0.00002597862,0.0002700816,0.0005011137,0.0002406894,0.0004429161],"domain_scores_gemma":[0.9992782,0.00005585711,0.0001830061,0.0001686127,0.0002176264,0.00009672438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003904616,0.00002901548,0.0000423097,0.0002204272,0.000004936715,5.641917e-7,0.0004734739,0.0008436294,0.01714787,0.0002226392,0.0002069418,0.9808043],"study_design_scores_gemma":[0.000261096,0.00004449521,0.0001030729,0.00008369203,0.000006851601,0.00001993093,0.0001304308,0.9388098,0.05518866,0.004514521,0.0005855951,0.000251836],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003976687,0.0002493329,0.9917527,0.0002260125,0.00006947435,0.0002934324,2.104724e-7,0.0002887131,0.003143396],"genre_scores_gemma":[0.7722088,5.137051e-7,0.2268741,0.000515868,0.0001507123,0.0001104889,0.000001171789,0.00001499236,0.0001233766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9805524,"threshold_uncertainty_score":0.7054867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01481873655825973,"gpt":0.2680393405517997,"spread":0.25322060399354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763294,0.0001828666,0.0002232086,0.0001591106,0.0001596703,0.0006857812,0.0007017195,0.00005627715,0.0001699347],"category_scores_gemma":[0.00001546517,0.000163752,0.0000458104,0.0004961594,0.00007099258,0.001482827,0.0001966262,0.0002243115,0.0001971415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005777772,"about_ca_system_score_gemma":0.00009777626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006537687,"about_ca_topic_score_gemma":0.000001928258,"domain_scores_codex":[0.9982357,0.0001748466,0.0003408202,0.000429254,0.0003494855,0.0004699124],"domain_scores_gemma":[0.9993259,0.00007761503,0.0001082075,0.0002592877,0.0001350693,0.0000938717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008749998,0.00009531464,0.00003700539,0.00006685012,0.00000422997,0.00004686115,0.001451912,0.00004213449,0.4881207,0.0004649546,0.0005170635,0.5091442],"study_design_scores_gemma":[0.002984016,0.0002210811,0.002850558,0.0005765659,0.000008376282,0.00005006823,0.0003730667,0.4566868,0.4425235,0.09089471,0.00174936,0.001081822],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02423957,0.0002587598,0.965838,0.0005958509,0.00007019142,0.0002154674,3.199849e-7,0.00009378967,0.008688123],"genre_scores_gemma":[0.5953071,0.000001892762,0.4037786,0.0005139398,0.0000559193,0.00003244215,0.00000139224,0.0000107117,0.0002980688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5710675,"threshold_uncertainty_score":0.6677612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04273729445484478,"gpt":0.2687423709661339,"spread":0.2260050765112891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364984,0.0001257734,0.0001500272,0.00009474609,0.0001441859,0.0006281311,0.0004748767,0.00009814049,0.00002312733],"category_scores_gemma":[0.0001751049,0.0001113239,0.00001006578,0.000510806,0.00003565305,0.002126623,0.0002301646,0.0002207012,0.00001028221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074175,"about_ca_system_score_gemma":0.0000938154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002086025,"about_ca_topic_score_gemma":0.00003260029,"domain_scores_codex":[0.9985726,0.0001139221,0.0003204681,0.000468649,0.0002294542,0.0002949013],"domain_scores_gemma":[0.99918,0.0001108659,0.0001762515,0.0002945648,0.0001823025,0.00005604319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004136957,0.0002983306,0.02785345,0.000383294,0.00002376421,0.00003893522,0.003098296,0.01431412,0.008068345,0.001543532,0.008931984,0.9354046],"study_design_scores_gemma":[0.0002267306,0.00001367875,0.002246389,0.0002589095,0.000004803194,0.00001214488,0.00005378622,0.9927078,0.0001161419,0.003777107,0.0004268509,0.0001556154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09150166,0.0002253515,0.9069042,0.0005542806,0.00014407,0.0002581112,0.000009668635,0.00013914,0.0002635791],"genre_scores_gemma":[0.9537531,0.00000940139,0.04568218,0.0003646752,0.0000799613,0.000006745339,0.00005591685,0.0000109057,0.00003713742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9783937,"threshold_uncertainty_score":0.6057082,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03703339537655507,"gpt":0.2252119263826936,"spread":0.1881785310061385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246448,0.0001934279,0.0001993258,0.00004728023,0.0003738599,0.0004327887,0.000579246,0.00006982419,0.00006620246],"category_scores_gemma":[0.00002062688,0.0001464594,0.00003922781,0.0006191407,0.00006019463,0.000661493,0.0001906525,0.0002679204,0.00007139818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001504227,"about_ca_system_score_gemma":0.0001027976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006310026,"about_ca_topic_score_gemma":0.000001801261,"domain_scores_codex":[0.9983944,0.00005246481,0.0002254632,0.0005622619,0.0004121339,0.0003532751],"domain_scores_gemma":[0.999222,0.00006511981,0.0001220093,0.0002368115,0.0001330497,0.000221052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006213245,0.0002631977,0.004018233,0.0005120645,0.00004783767,0.0006236316,0.005820379,0.1377413,0.02569506,0.001608341,0.01449699,0.8085516],"study_design_scores_gemma":[0.0009205105,0.0003840221,0.0003414057,0.0004178706,0.00002238555,0.00008251669,0.000257761,0.9756869,0.008560801,0.0002391942,0.01242081,0.0006658194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009786318,0.0004115474,0.9848256,0.002553441,0.00007652686,0.0001127504,0.000003319806,0.0005919043,0.001638658],"genre_scores_gemma":[0.878307,0.000009685595,0.1194805,0.001782426,0.0003297806,0.000004423006,0.000008346193,0.00002026459,0.00005761104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8685207,"threshold_uncertainty_score":0.597244,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0170935277161613,"gpt":0.2842659647766524,"spread":0.2671724370604911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005626389,0.0001190894,0.0001384031,0.00003463567,0.0001539368,0.0001896354,0.00007564653,0.00002359653,0.00008750897],"category_scores_gemma":[0.00001182598,0.000116752,0.0001108395,0.0001586422,0.00005508466,0.0002811748,0.00003236688,0.0000982195,0.000007881594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007695747,"about_ca_system_score_gemma":0.00007682169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003581302,"about_ca_topic_score_gemma":9.208566e-7,"domain_scores_codex":[0.9992589,0.000009217542,0.0001532336,0.000245031,0.00007080132,0.0002628699],"domain_scores_gemma":[0.9995415,0.0001370721,0.00005641642,0.00006838046,0.0001392206,0.00005741559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006481949,0.0001668002,0.001129821,0.00005342389,0.00002844956,0.000005316016,0.0001962242,0.000004668111,0.4963993,0.005434163,0.0001106872,0.4964063],"study_design_scores_gemma":[0.0005913918,0.0001977022,0.00005556331,0.0001520778,0.00004740257,0.000006441038,0.001208927,0.001664152,0.9463742,0.04712375,0.00226646,0.0003119582],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357851,0.0004153962,0.850697,0.0001504344,0.00007084241,0.0001001664,0.00001864619,0.00003748138,0.01272487],"genre_scores_gemma":[0.9755793,1.305745e-7,0.02392804,0.0001831755,0.0001265588,0.00002216086,0.00002194719,0.0000163001,0.0001223548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8397942,"threshold_uncertainty_score":0.4761008,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03160737788197845,"gpt":0.2158470073175925,"spread":0.184239629435614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001020675,0.0001350965,0.0001515166,0.00003095253,0.000133976,0.0002177883,0.0001324781,0.00005598144,0.00001493838],"category_scores_gemma":[7.175477e-7,0.0001102675,0.00001774566,0.0001643026,0.00003498416,0.0004136868,0.00003007732,0.0001469232,0.0000210441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002716167,"about_ca_system_score_gemma":0.00002795255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004574179,"about_ca_topic_score_gemma":0.000002598654,"domain_scores_codex":[0.9992788,0.00003083066,0.0001945497,0.0001611703,0.0001647581,0.0001698574],"domain_scores_gemma":[0.9997107,0.00001954826,0.00004607395,0.00007747865,0.00005065372,0.00009555341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008460171,0.00003077717,0.04846818,0.001753146,0.0002178927,0.00002326111,0.01419199,0.01197767,0.1798888,0.00003650491,0.0001962763,0.7431309],"study_design_scores_gemma":[0.0027782,0.0006208788,0.01151363,0.001331457,0.0002586178,0.0001517366,0.002951076,0.7977456,0.1649091,0.0006802629,0.015161,0.001898496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7775314,0.0005508345,0.2195085,0.0006877788,0.000005418997,0.0002321296,0.000005797185,0.0004621285,0.001016077],"genre_scores_gemma":[0.9976722,0.00000413239,0.00202934,0.0001043379,0.00009393081,0.000007050936,0.00002572162,0.00003681938,0.00002647921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7857679,"threshold_uncertainty_score":0.4496579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04834297452391868,"gpt":0.3301413279254549,"spread":0.2817983534015362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006877187,0.0001158033,0.000114711,0.00007026997,0.001418317,0.001152396,0.001117195,0.00006855019,0.00000978836],"category_scores_gemma":[0.0001864699,0.0001075357,0.00004639742,0.00008249648,0.00004995008,0.001358848,0.000129591,0.0001460056,0.00003504761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003461256,"about_ca_system_score_gemma":0.0001458634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001270143,"about_ca_topic_score_gemma":0.000005386656,"domain_scores_codex":[0.998848,0.00003717271,0.0001888669,0.0004322707,0.0002099194,0.0002837658],"domain_scores_gemma":[0.9987513,0.00005237565,0.0003436639,0.0006530613,0.0001279298,0.00007166366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001590966,0.00006606204,0.002432544,0.0001238033,0.000006646917,0.000001441156,0.0005004758,0.00002116709,0.007799324,0.04809588,0.001553356,0.9393834],"study_design_scores_gemma":[0.0003836874,0.00003110251,0.01612448,0.00005281062,0.000006861659,0.000003405172,0.00005740832,0.9424575,0.0003248018,0.004744879,0.03565149,0.0001615671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006001952,0.0001059269,0.9898573,0.004701591,0.0001066758,0.0001720712,0.000006545629,0.0002052796,0.004244431],"genre_scores_gemma":[0.9501281,0.000003583271,0.04878593,0.0001818608,0.0001292786,0.00005077637,0.000030847,0.0000116297,0.0006779748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9495279,"threshold_uncertainty_score":0.9998845,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01540642774866393,"gpt":0.242766447155683,"spread":0.2273600194070191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007921835,0.00009335158,0.0001436772,0.00005607173,0.00006734194,0.000004888334,0.00009075162,0.00004261643,0.000008047984],"category_scores_gemma":[0.00002758916,0.0000762142,0.00002310849,0.0002499627,0.00008815801,0.0001741351,0.00001302323,0.00009654053,4.786094e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003857054,"about_ca_system_score_gemma":0.00003771914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000305663,"about_ca_topic_score_gemma":4.268912e-7,"domain_scores_codex":[0.999293,0.00001278629,0.0002583521,0.00009295816,0.0002293692,0.0001134885],"domain_scores_gemma":[0.9997168,0.00004796361,0.00006007507,0.00007413374,0.00007764068,0.00002341676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005935477,0.00001980182,0.0005918497,0.000209717,0.00001082525,0.000003251825,0.0002288339,0.03311068,0.8463566,0.00002301254,0.00002119415,0.1194183],"study_design_scores_gemma":[0.0001061278,0.00007563283,0.003170104,0.0003095538,0.00002004405,0.00004901159,0.0000125294,0.3285,0.6609734,0.006610828,0.000004103872,0.000168639],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5187974,0.001083974,0.4784748,0.00001087757,0.000009566085,0.0002133952,0.000004659021,0.000142454,0.001262863],"genre_scores_gemma":[0.9784349,0.00001874964,0.02149552,0.000009134154,0.000009198121,0.000008402957,0.000001833102,0.00001633738,0.000005897483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4596375,"threshold_uncertainty_score":0.3107925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1288607306261344,"gpt":0.3317964600104142,"spread":0.2029357293842798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243847,0.0002644775,0.0002499835,0.000171574,0.0008511324,0.0004824399,0.0002338325,0.0001271395,0.00001725339],"category_scores_gemma":[0.0001726,0.0002445518,0.00009603598,0.0005116914,0.0001622642,0.0008869215,0.00004011195,0.0002618084,0.0000176678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001349238,"about_ca_system_score_gemma":0.0005528807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003019464,"about_ca_topic_score_gemma":0.000001509155,"domain_scores_codex":[0.9977679,0.00007005507,0.000459508,0.0007219386,0.0004305368,0.0005501067],"domain_scores_gemma":[0.999038,0.0002883841,0.0002187045,0.0001309635,0.0001794406,0.0001444518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008396545,0.0001346254,0.00001498792,0.0002671991,0.000001372715,0.000003591387,0.0006260157,0.07213552,0.8038884,0.000623879,0.0000040836,0.1222164],"study_design_scores_gemma":[0.00375331,0.001187355,0.002365327,0.0008900898,0.00004966246,0.0001209027,0.0004437949,0.2864231,0.6727577,0.03066654,0.0003989446,0.0009431843],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1513063,0.00009878765,0.84671,0.0004662431,0.00005675407,0.0006895419,0.000004343321,0.0002296585,0.0004383681],"genre_scores_gemma":[0.9699232,0.000001993047,0.02910291,0.000513119,0.0002194581,0.00008849933,0.000003473818,0.00005909113,0.00008824489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8186169,"threshold_uncertainty_score":0.9972532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0453581071936266,"gpt":0.3249399175778486,"spread":0.279581810384222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917737,0.0001887956,0.0002807284,0.0001628147,0.0003545069,0.0002618616,0.0007421066,0.00004783301,0.000005159955],"category_scores_gemma":[0.0001043742,0.0001105764,0.00006702641,0.0007802069,0.0001560437,0.0008574175,0.0001871947,0.0001784629,0.000004930571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001270963,"about_ca_system_score_gemma":0.0002018161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008372504,"about_ca_topic_score_gemma":0.000007251157,"domain_scores_codex":[0.9977792,0.0004962993,0.0004462241,0.0004056122,0.000448355,0.000424291],"domain_scores_gemma":[0.9987437,0.0004148439,0.0002174893,0.0003872304,0.0001790027,0.0000577893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000712767,0.0003665801,0.00129182,0.00002513319,0.00001788932,0.0001229008,0.003469336,0.00008929774,0.9187098,0.00132755,0.00004187438,0.07446651],"study_design_scores_gemma":[0.01937993,0.002383305,0.06393357,0.005776299,0.0002047751,0.0002571157,0.01171528,0.04639446,0.7180044,0.1281187,0.0009730693,0.002859067],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3538979,0.0001721443,0.6451001,0.0002069458,0.00004276235,0.000186304,0.000003963059,0.00003345644,0.0003565259],"genre_scores_gemma":[0.9599435,0.000001184385,0.03982765,0.0001133566,0.00005432625,0.000009605075,3.995675e-7,0.00001358617,0.00003643319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6060456,"threshold_uncertainty_score":0.4509174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01283814477305151,"gpt":0.2622837299517864,"spread":0.2494455851787349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001448426,0.0002256594,0.0005625726,0.0001586819,0.00009370352,0.00005436952,0.0001224006,0.0001014148,0.000189205],"category_scores_gemma":[0.0001009642,0.0002434389,0.00008586208,0.001027214,0.00008201498,0.0002842174,0.00004187651,0.0002303763,9.005402e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001407399,"about_ca_system_score_gemma":0.0001197865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001797224,"about_ca_topic_score_gemma":0.000002958338,"domain_scores_codex":[0.9986532,0.00005303255,0.0003830915,0.0003097536,0.0002600946,0.0003408292],"domain_scores_gemma":[0.9990443,0.0002840862,0.0001101104,0.0001803856,0.0002856127,0.00009551249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006985157,0.00007419358,0.0001732795,0.000264642,0.001048634,0.00007631487,0.0002707924,0.24438,0.6722258,0.0003064954,0.00002507223,0.08108488],"study_design_scores_gemma":[0.00041245,0.00002926202,0.0005634958,0.0001327074,0.0006804647,0.000009598631,0.0001420638,0.9157471,0.08053114,0.001368235,0.0001025696,0.0002808884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01529115,0.0003013161,0.9832504,0.000004374011,0.000033174,0.0001155685,0.0002802501,0.0002690704,0.0004547359],"genre_scores_gemma":[0.6432903,0.000003066051,0.3565738,0.00001969232,0.00003468668,0.000009824328,0.00001919693,0.00003379582,0.00001557621],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6713671,"threshold_uncertainty_score":0.9927152,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01342216422020801,"gpt":0.215019254110561,"spread":0.201597089890353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004865723,0.0001679936,0.000151847,0.00006290889,0.00008129762,0.0001070117,0.00008486261,0.00005614092,0.00005750599],"category_scores_gemma":[0.000003622852,0.0001425343,0.00002273395,0.0002065837,0.00002115197,0.0001815187,0.00001403005,0.0001752297,0.00003148373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007660066,"about_ca_system_score_gemma":0.00003357757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034035,"about_ca_topic_score_gemma":0.000003945087,"domain_scores_codex":[0.9992454,0.00001297647,0.000133355,0.0001878699,0.0001671505,0.0002532254],"domain_scores_gemma":[0.9996998,0.00002636535,0.00003976608,0.0000840479,0.0000990672,0.00005100723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002276613,0.0001244241,0.001779581,0.0003752486,0.0001459146,0.00002426785,0.0006908657,0.3939025,0.4273338,0.0001648239,0.0009463469,0.1742846],"study_design_scores_gemma":[0.0004798383,0.0002061285,0.00169992,0.0007524238,0.00004179615,0.00005531285,0.0001000041,0.8905869,0.1049528,0.0003671387,0.0002867001,0.0004710911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7738429,0.000292006,0.2230943,0.00001048173,0.00005813107,0.000221353,9.323876e-7,0.001069376,0.001410553],"genre_scores_gemma":[0.9944964,0.000002896124,0.005290195,0.00003245047,0.00006143487,0.00001007017,0.000003329867,0.00004463234,0.00005856916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4966844,"threshold_uncertainty_score":0.5812382,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01186049442167381,"gpt":0.2485408718705411,"spread":0.2366803774488673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006555595,0.0003569753,0.0003424714,0.0001497871,0.0007138832,0.001058594,0.0004628366,0.0002083938,0.00001867524],"category_scores_gemma":[0.00006829592,0.000293548,0.0001247346,0.001541713,0.0001764301,0.0003042108,0.00008587596,0.0005324569,0.000007205623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000275931,"about_ca_system_score_gemma":0.0001986618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006278001,"about_ca_topic_score_gemma":0.00006564621,"domain_scores_codex":[0.9970919,0.0003821907,0.0005773259,0.0006762171,0.00042898,0.000843326],"domain_scores_gemma":[0.9986198,0.0002709134,0.0003292722,0.0003035184,0.0003023317,0.0001741553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001732275,0.0001346985,0.0004390284,0.0000419209,0.00002164851,0.00004388423,0.00008690385,0.926175,0.007041106,0.00003788165,0.00009728607,0.06570744],"study_design_scores_gemma":[0.0008919562,0.000103837,0.0009415012,0.0001440052,0.00002254224,0.0001242766,0.0000579641,0.9956666,0.0007919305,0.0001569019,0.0007109311,0.0003876025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1344708,0.0001148731,0.8638109,0.0006074111,0.0003596396,0.0003146535,0.00001135925,0.0002695543,0.00004078614],"genre_scores_gemma":[0.9871699,0.000002759794,0.01188474,0.0006636156,0.0001825831,0.00001069063,0.00002349121,0.00003372716,0.00002844838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8526991,"threshold_uncertainty_score":0.9999784,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01608221763783653,"gpt":0.2701242277178705,"spread":0.254042010080034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001189715,0.0003419913,0.0004908674,0.0003899168,0.0003939535,0.0002491778,0.001186895,0.0001557052,0.000007574099],"category_scores_gemma":[0.00001704667,0.0002984523,0.0001632839,0.0007421511,0.0001731577,0.001428727,0.0003160448,0.0003456503,0.000001035383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004170905,"about_ca_system_score_gemma":0.00006745607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000162199,"about_ca_topic_score_gemma":0.000002073534,"domain_scores_codex":[0.997665,0.0001403197,0.0005487462,0.0006271176,0.0004170634,0.0006016926],"domain_scores_gemma":[0.9986462,0.000135674,0.0004193211,0.0005364089,0.0001412187,0.0001211951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001098949,0.0006111399,0.0009382033,0.001392208,0.00007482739,0.00005570462,0.002534167,0.009053001,0.6231817,0.03368359,0.0001488911,0.3272276],"study_design_scores_gemma":[0.00228023,0.0002006025,0.000008524895,0.0007888337,0.00001934154,0.0000546304,0.00001688318,0.1352515,0.8469952,0.01286173,0.001075057,0.0004474743],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008496443,0.000176619,0.9860668,0.0002259585,0.0001163223,0.000428738,0.000001328372,0.0007838086,0.003704026],"genre_scores_gemma":[0.8515386,0.00001311809,0.1481246,0.00003939269,0.0001328853,0.00007410016,0.000003621046,0.00002812259,0.00004555037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8430421,"threshold_uncertainty_score":0.9999468,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1278538037782656,"gpt":0.3483625726101193,"spread":0.2205087688318537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004100897,0.0001411292,0.0002102511,0.00005553239,0.0001434109,0.00003932813,0.0001710802,0.00007908274,0.001512231],"category_scores_gemma":[0.000357414,0.0001183108,0.00004509631,0.0001956024,0.00008279624,0.0001319057,0.00004797312,0.0001833744,0.00005537342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002609249,"about_ca_system_score_gemma":0.00006825355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001975918,"about_ca_topic_score_gemma":0.000003226025,"domain_scores_codex":[0.9989418,0.00007825837,0.0002585402,0.0002309649,0.000202338,0.0002881471],"domain_scores_gemma":[0.9992423,0.0002674938,0.0001206451,0.0001414084,0.0001121449,0.0001160298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000119817,0.0003565727,0.001849689,0.00107181,0.00004893104,0.00008467756,0.004562881,5.801583e-7,0.007884031,0.1203332,0.002271811,0.861416],"study_design_scores_gemma":[0.0002127468,0.00009889947,0.0003245127,0.0002235446,0.00004613981,0.00001526267,0.0001528172,0.008612889,0.006781294,0.9830184,0.0002776344,0.0002358515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001949214,0.00007021012,0.9401437,0.00003365322,0.00004632094,0.00009103836,0.000003639195,0.00009930786,0.0575629],"genre_scores_gemma":[0.5387187,9.779832e-7,0.4608196,0.00009512972,0.000055772,0.000005884915,4.800836e-7,0.00001664786,0.0002868074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8626852,"threshold_uncertainty_score":0.9994005,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04667410207889074,"gpt":0.3292503450890316,"spread":0.2825762430101409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003465358,0.00006180631,0.00006663052,0.0001283622,0.000205407,0.0002122498,0.0001590335,0.00003928203,0.000003899283],"category_scores_gemma":[0.00003397324,0.00005640283,0.00002072662,0.0002628611,0.00002251188,0.0008053564,0.00007566812,0.00006402949,0.000001462594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002036108,"about_ca_system_score_gemma":0.00002636859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001608705,"about_ca_topic_score_gemma":4.747273e-7,"domain_scores_codex":[0.9993879,0.0000211701,0.0001326008,0.0001781054,0.0001167764,0.0001634393],"domain_scores_gemma":[0.9996377,0.00005492277,0.00008260063,0.00009717089,0.00006994489,0.00005765552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007465704,0.000026723,0.001373925,0.0001611631,0.000005709072,4.602713e-7,0.005740546,0.000009176257,0.1045111,0.01335964,0.0000558978,0.8747482],"study_design_scores_gemma":[0.0008696287,0.00005343175,0.06135798,0.0001553778,0.00002219207,0.0001617036,0.0005324364,0.5049192,0.3209577,0.1085958,0.001622436,0.0007520917],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02887053,0.0002602015,0.9703047,0.0001418317,0.00007663156,0.0002027346,0.000001266662,0.00006790213,0.00007418324],"genre_scores_gemma":[0.7973707,8.577768e-7,0.2024555,0.00005500062,0.00004901599,0.00003220588,0.000002031383,0.000003505833,0.00003120897],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8739961,"threshold_uncertainty_score":0.2300041,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01750845884092055,"gpt":0.2566938170915676,"spread":0.2391853582506471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022756,0.0000927138,0.0001267196,0.00004365932,0.0003160859,0.000301851,0.0001235142,0.00005037942,0.000001959322],"category_scores_gemma":[0.00003204733,0.00007725276,0.0000298073,0.00005131539,0.00002961322,0.0004466945,0.00000759355,0.00005569011,9.603992e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484093,"about_ca_system_score_gemma":0.00002400993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001017142,"about_ca_topic_score_gemma":0.000006502035,"domain_scores_codex":[0.9993339,0.00002070643,0.000266152,0.0001139863,0.0001446905,0.0001206056],"domain_scores_gemma":[0.9993217,0.00002668872,0.0003077536,0.000169851,0.000157652,0.00001634879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002843651,0.00001356911,0.0002192724,0.00105324,0.00004107583,3.044766e-7,0.001691066,0.6492392,0.2995836,0.00005518005,0.0006813959,0.04739369],"study_design_scores_gemma":[0.0002592008,0.00001071718,0.0001090392,0.0001531468,0.00002247977,0.000001270105,0.0001759201,0.9893363,0.009245426,0.00009002903,0.0005094681,0.00008698511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1015731,0.0005777415,0.8968563,0.0002356605,0.0001282234,0.000464553,0.00001365082,0.0000580806,0.00009264264],"genre_scores_gemma":[0.9981319,0.000002402518,0.00155498,0.000015323,0.0001186839,0.00004113678,0.00002019394,0.00003021198,0.00008511991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8965588,"threshold_uncertainty_score":0.3150276,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Algorithm; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01242526448133417,"gpt":0.2765274517313642,"spread":0.26410218725003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125723,0.000112158,0.000123831,0.000117373,0.0001127475,0.0001653775,0.0001736764,0.0000406168,0.000008753335],"category_scores_gemma":[0.00001296354,0.00008978814,0.0000124508,0.0001374803,0.0000213753,0.0004489213,0.0003808275,0.0001832624,0.000003270954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009710561,"about_ca_system_score_gemma":0.00001788277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007623471,"about_ca_topic_score_gemma":0.00000320341,"domain_scores_codex":[0.9991472,0.00002705136,0.0001405986,0.0003529696,0.0001326458,0.0001994786],"domain_scores_gemma":[0.999711,0.00004096687,0.00005082291,0.0001157487,0.0000192986,0.00006211635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000825663,0.00001710808,0.002300422,0.00008541231,9.259832e-7,0.00001790006,0.002520957,0.0003016199,0.09867094,0.00001134094,0.000007420252,0.8960577],"study_design_scores_gemma":[0.0005648563,0.00004522149,0.005869754,0.0004973437,0.000001048847,0.00004683233,0.0001259041,0.9728044,0.01861136,0.0008781577,0.0003735988,0.0001815383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1697363,0.001458536,0.8276772,0.0004436028,0.00007493591,0.0001257335,2.691135e-7,0.00007567932,0.0004076576],"genre_scores_gemma":[0.8464088,0.00001438843,0.1532318,0.0002300249,0.00001913657,0.000001506367,3.387719e-7,0.000006513006,0.00008742693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725028,"threshold_uncertainty_score":0.3661454,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1063684711215629,"gpt":0.3475483619809575,"spread":0.2411798908593945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342954,0.000121997,0.0002732307,0.00003990664,0.0002128593,0.00002999036,0.0001975677,0.00005502079,0.0002380694],"category_scores_gemma":[0.00009180289,0.00006611195,0.0001603183,0.0002038546,0.0001523514,0.0001329895,0.00001185705,0.0001213181,0.00000407879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008684311,"about_ca_system_score_gemma":0.00004310145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006424556,"about_ca_topic_score_gemma":0.0000059115,"domain_scores_codex":[0.9988497,0.00006559019,0.0004672643,0.0001294513,0.0002755722,0.0002124329],"domain_scores_gemma":[0.9991075,0.0004238536,0.0001532924,0.0001402746,0.0001208283,0.00005420515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001842023,0.0003574923,0.00005277322,0.001173832,0.0001399422,0.000004167792,0.004330812,8.39546e-7,0.003320017,0.1489184,0.0001543261,0.8413632],"study_design_scores_gemma":[0.0003018333,0.00009382453,0.00004371767,0.0001239222,0.0001723217,0.000005116014,0.0005158345,0.003821472,0.1012432,0.8929285,0.0006194558,0.0001308882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02074807,0.0005498528,0.8504466,0.0002904818,0.00003360939,0.0003486358,0.000004947353,0.00007282744,0.127505],"genre_scores_gemma":[0.8839603,0.00002244398,0.115292,0.0000149273,0.00003320468,0.000019946,4.758782e-7,0.00001806135,0.0006385865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8632122,"threshold_uncertainty_score":0.2695967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04014026377143567,"gpt":0.2607476609620002,"spread":0.2206073971905645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000119839,0.0002499524,0.0002778901,0.00009383882,0.0002518741,0.0001736173,0.000104453,0.0001067705,0.000009701285],"category_scores_gemma":[0.00002253957,0.0002661485,0.00003164933,0.0001547889,0.00007737063,0.0006800634,0.00002515701,0.0001463648,0.000005126511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000274586,"about_ca_system_score_gemma":0.00001355291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006085183,"about_ca_topic_score_gemma":0.000007087899,"domain_scores_codex":[0.9987544,0.00002579572,0.0003166879,0.0003291903,0.0001858415,0.0003881098],"domain_scores_gemma":[0.9993709,0.00008872108,0.0001334918,0.0001060762,0.0002071345,0.0000936286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007501084,0.00005200576,0.0003201085,0.002984964,0.00009922641,0.000006473081,0.002435682,0.8832646,0.04952941,0.0004138627,0.0002029074,0.06061576],"study_design_scores_gemma":[0.0002617353,0.00007718201,0.00005122964,0.0002746798,0.00002087775,0.00001671986,0.0007932507,0.9941248,0.002936905,0.0007445716,0.0003715661,0.000326532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0185649,0.004991315,0.9747154,0.000005892519,0.0002682572,0.0006405999,0.00005958477,0.0005564333,0.000197621],"genre_scores_gemma":[0.9894365,0.00005352834,0.009837623,0.000004689196,0.0002159654,0.0002255998,0.00001246227,0.00006471584,0.0001489071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9708716,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0135313190188505,"gpt":0.2520923510909571,"spread":0.2385610320721066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431355,0.0001861745,0.0002337443,0.0001560746,0.00008559213,0.00002897306,0.0002138202,0.00008373163,0.00006210653],"category_scores_gemma":[0.00002417021,0.0001958851,0.00005216801,0.000357624,0.00006697747,0.0004277885,0.00003892999,0.0002299778,0.000004284467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009252223,"about_ca_system_score_gemma":0.00002584108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001892514,"about_ca_topic_score_gemma":0.000007695036,"domain_scores_codex":[0.9988285,0.000009604102,0.0003853121,0.0001808521,0.0002131076,0.0003826053],"domain_scores_gemma":[0.9994993,0.00005165036,0.0001080976,0.0001650404,0.0001023865,0.0000735026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001099934,0.00002228175,0.001433024,0.000472774,0.00003274794,0.00002044635,0.0007060787,0.0153099,0.7812874,0.0002639803,0.00009696766,0.2003434],"study_design_scores_gemma":[0.0002483598,0.0000554155,0.0008269336,0.0006930054,0.00002908543,0.0000183106,0.000542224,0.06721036,0.9213936,0.008056043,0.000377867,0.0005487734],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1351505,0.0004296507,0.8514113,0.000008799319,0.00003938827,0.0001012098,0.000005560884,0.0005956661,0.0122579],"genre_scores_gemma":[0.7908375,0.00000370037,0.2089811,0.00001273344,0.00006971611,0.000004936525,0.000004073982,0.00004564267,0.00004062905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.655687,"threshold_uncertainty_score":0.7987964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02455040681723633,"gpt":0.2569871862435866,"spread":0.2324367794263503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006094303,0.0001352073,0.0001696131,0.00005900229,0.00006765969,0.00001240139,0.00008495404,0.00005178123,0.00003147988],"category_scores_gemma":[0.00001855429,0.0001427742,0.00004498782,0.0001107143,0.00006982774,0.000303922,0.000009782264,0.00009463365,0.000003463258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001060331,"about_ca_system_score_gemma":0.00001537866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002118734,"about_ca_topic_score_gemma":1.776413e-7,"domain_scores_codex":[0.9992895,0.000008509232,0.0002082203,0.0001605612,0.0001593457,0.0001738583],"domain_scores_gemma":[0.9995056,0.00004682973,0.00008069636,0.0000548594,0.0002730312,0.00003899454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005905152,0.000051345,0.000007303857,0.000292319,0.00004029832,0.0000013562,0.001162983,0.619017,0.1729119,0.00007184806,0.0001315267,0.2062531],"study_design_scores_gemma":[0.0004397892,0.00005552457,0.00003881294,0.0001093272,0.00001265158,0.000006524718,0.0001049502,0.9021105,0.09512455,0.001777159,0.00007649234,0.0001437495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007458785,0.0002799487,0.9913538,0.00001803736,0.00008345525,0.0002732886,0.00005339606,0.0003019364,0.0001773558],"genre_scores_gemma":[0.9043337,0.000005643962,0.09543537,0.000007315888,0.00009339566,0.00005741653,0.000005948114,0.00002800741,0.00003322666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8968749,"threshold_uncertainty_score":0.5822161,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06725814964956589,"gpt":0.3071153046183793,"spread":0.2398571549688134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004965586,0.0002079796,0.0002766105,0.0001820166,0.0002791992,0.0003744686,0.001249945,0.0000902358,0.00009603185],"category_scores_gemma":[0.00002297687,0.0002051937,0.00005787825,0.000761707,0.000111542,0.002589856,0.0001251936,0.0002210093,0.00001180186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005798138,"about_ca_system_score_gemma":0.0002389903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000373704,"about_ca_topic_score_gemma":6.565919e-7,"domain_scores_codex":[0.997976,0.0001020576,0.0004490267,0.0006262512,0.0005182566,0.0003284146],"domain_scores_gemma":[0.9988782,0.00006367903,0.0002507712,0.000541589,0.0001729732,0.00009274354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001707667,0.0001569228,0.0001948232,0.0001765932,0.00002241679,0.000008230321,0.001117799,0.01808988,0.0941791,0.0002390593,0.00005129759,0.8857468],"study_design_scores_gemma":[0.0001676791,0.0000377561,0.0001076643,0.0002105911,0.00001972271,0.00007916127,0.00004264398,0.9238605,0.07374302,0.001211318,0.0002480281,0.0002719351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465026,0.0001170525,0.9779901,0.00004592063,0.00003146896,0.0001961146,0.000006390369,0.0005274854,0.00643519],"genre_scores_gemma":[0.576183,0.000001538549,0.4236293,0.00004866952,0.00007190102,0.00000423213,0.000007690066,0.00001507022,0.00003858107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057706,"threshold_uncertainty_score":0.8367558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01398790553547897,"gpt":0.2574314407150714,"spread":0.2434435351795924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005788173,0.0002701113,0.00025129,0.0001924696,0.0005845893,0.001255103,0.0004403702,0.0001179348,0.00002308366],"category_scores_gemma":[0.0001539636,0.0002416596,0.00005645586,0.0005460882,0.0001030787,0.002325054,0.00009630885,0.0005046261,0.00001906168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007545383,"about_ca_system_score_gemma":0.0001136774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002051291,"about_ca_topic_score_gemma":0.00001996448,"domain_scores_codex":[0.9980918,0.00009285926,0.0003581073,0.000676265,0.0003470731,0.0004339545],"domain_scores_gemma":[0.99895,0.0001311851,0.0003004395,0.0002758373,0.0001885248,0.0001539801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002249448,0.00003735255,0.0001273693,0.00004627215,0.000004995573,0.000007583427,0.0008059429,0.00001447117,0.6415855,0.00005412855,0.00004902956,0.3572449],"study_design_scores_gemma":[0.0007595062,0.0001401161,0.000658168,0.0002645384,0.00001530146,0.0002518625,0.0002395861,0.01673818,0.9711057,0.008985722,0.0004650375,0.0003762782],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2103822,0.0002794765,0.7852387,0.0006754647,0.0001807577,0.0001103188,7.036885e-7,0.0001925981,0.002939738],"genre_scores_gemma":[0.7333679,0.000005438726,0.2657456,0.0002533878,0.0004962682,0.000006146862,0.000002567158,0.00001694194,0.0001057354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5229857,"threshold_uncertainty_score":0.9997817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03330700995063559,"gpt":0.2619760045008315,"spread":0.2286689945501959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003240675,0.0003470612,0.0003885843,0.0001325269,0.0003136316,0.0001013555,0.0002425984,0.0001282997,0.00001585131],"category_scores_gemma":[0.00007787283,0.0003583971,0.00008087022,0.0002303624,0.0001135827,0.0006428339,0.00007437775,0.0002901801,0.000002259927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001914644,"about_ca_system_score_gemma":0.0000574234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000581129,"about_ca_topic_score_gemma":0.000002432402,"domain_scores_codex":[0.9983109,0.00002321565,0.0004083009,0.000391979,0.0002193689,0.000646191],"domain_scores_gemma":[0.9992109,0.0001707538,0.0001365655,0.0001782099,0.0001890153,0.000114537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005309839,0.00004033962,0.000008440197,0.0005294469,0.00004279728,0.000002769639,0.0003378085,0.00666824,0.08815311,0.00427092,0.00006813675,0.8998249],"study_design_scores_gemma":[0.0005127029,0.0001132762,0.000006461865,0.0004298491,0.00001736405,0.00000903978,0.00006133721,0.8243322,0.1100029,0.06308565,0.0009776464,0.0004515749],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003122098,0.0001155429,0.9933425,0.00000914945,0.0001230258,0.0005324035,0.00007912517,0.001221578,0.001454643],"genre_scores_gemma":[0.4615593,0.000001313387,0.5380407,0.00002580228,0.0001821396,0.00008033191,0.000008924759,0.00006868758,0.0000328098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8993733,"threshold_uncertainty_score":0.9998868,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04054572021444735,"gpt":0.263558709228585,"spread":0.2230129890141377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043913,0.0002835689,0.0003128393,0.0001185821,0.0001372109,0.0001816021,0.0001690497,0.0001262873,0.00001323147],"category_scores_gemma":[0.00002745064,0.0002384144,0.00006974894,0.0002134162,0.000162558,0.0003014253,0.0000355334,0.0001805335,0.000003464012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009557577,"about_ca_system_score_gemma":0.000146935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001343178,"about_ca_topic_score_gemma":0.00000189136,"domain_scores_codex":[0.9985723,0.00004033148,0.0003329066,0.000326252,0.0002925812,0.0004355824],"domain_scores_gemma":[0.9992163,0.00008243526,0.00008487982,0.0001757691,0.0002723089,0.0001683772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002648825,0.0001703563,0.00002871541,0.0002328984,0.0002562042,0.0001876851,0.001123475,0.3763945,0.08000452,0.002406168,0.009147846,0.5273989],"study_design_scores_gemma":[0.001225509,0.0002293006,0.000002690517,0.00035147,0.00007198331,0.00006986967,0.00009531569,0.8808683,0.101285,0.01437567,0.001007768,0.0004170562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04256552,0.0007954482,0.9512322,0.00004233914,0.0001410264,0.0003318657,0.00003197879,0.000886097,0.003973557],"genre_scores_gemma":[0.7530059,0.000007870752,0.2463602,0.00008048604,0.0004124613,0.0000177788,0.00002162664,0.00007189859,0.0000218164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7104404,"threshold_uncertainty_score":0.9722258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}