{"meta":{"query_hash":"d5fc8012e5c0","filters":{"venue":"Signal Processing"},"cohort_total":111,"direct_labels_cover":0,"predictions_cover":111,"exported":111,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d5fc8012e5c0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Signal+Processing"},"results":[{"id":"W1521144119","doi":"10.5772/8529","title":"New Trends in Biologically-Inspired Audio Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Speech coding; Speech recognition; Codebook; Auditory masking; Coding (social sciences); Audio signal; Lossless compression; Neural coding; Masking (illustration); Data compression; Artificial intelligence; Mathematics","score_opus":0.03561951384583587,"score_gpt":0.2800878518970018,"score_spread":0.24446833805116594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521144119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008041806,0.2440284,0.5476985,0.0054795966,0.0039216015,0.0000696346,0.0002172495,0.0013585186,0.18918467],"genre_scores_gemma":[0.09725214,0.23556873,0.42917648,0.0027855728,0.0037034282,0.00027007106,0.00076572795,0.0010333153,0.22944456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982893,0.000019912366,0.000009444361,0.00003310482,0.00009774597,0.000010901351],"domain_scores_gemma":[0.99972135,0.00015715841,0.00001067463,0.000029494711,0.000064423606,0.000016794464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029708535,0.00058853725,0.00049400225,0.0008778237,0.0003029272,0.0017010018,0.0009988814,0.0011327465,0.008762054],"category_scores_gemma":[0.0006609408,0.00035104298,0.00045768922,0.0010816158,0.0012169547,0.002193949,0.0006878656,0.0021045704,0.0040359246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004528579,0.000055451135,0.00016592871,0.0013597201,0.000039700404,0.00013864246,0.00036070513,0.010485827,0.02508559,0.42664343,0.035392266,0.5002275],"study_design_scores_gemma":[0.00001524417,0.000078644414,0.0002748884,0.0002956747,0.00001775838,0.0006238245,0.00009839904,0.029334022,0.009272355,0.18526886,0.77466524,0.000054959542],"about_ca_topic_score_codex":0.0004257147,"about_ca_topic_score_gemma":0.0005424902,"teacher_disagreement_score":0.008762054,"about_ca_system_score_codex":0.0008310427,"about_ca_system_score_gemma":0.00035541083,"threshold_uncertainty_score":0.029312015},"labels":[],"label_agreement":null},{"id":"W1963864898","doi":"10.1016/j.sigpro.2004.05.008","title":"A method of extraction of nonstationary sinusoids","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Nonlinear system; Uniqueness; Mathematical proof; Algorithm; Amplitude; Differential equation; Noise immunity; Software; Noise (video); Signal processing; Computer science; Control theory (sociology); Nonlinear dynamical systems; Mathematics; Mathematical analysis; Digital signal processing; Artificial intelligence; Physics","score_opus":0.010625686555681755,"score_gpt":0.2664970338967838,"score_spread":0.25587134734110206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963864898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013346247,0.00021885002,0.9973953,0.000018789604,0.000069787355,0.000027722637,0.000050772007,0.00032732842,0.0005568554],"genre_scores_gemma":[0.01719821,0.00048087724,0.9767701,0.000032228152,0.000074210584,0.000078192206,0.00023296954,0.00013590264,0.004997312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.000047711463,0.000025115336,0.000091424256,0.00019346838,0.000029688556],"domain_scores_gemma":[0.9994261,0.0001824806,0.000031669544,0.000105484934,0.00022938126,0.000024948098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044563686,0.0007337211,0.00074524275,0.0012461892,0.000686664,0.0008703168,0.0007432983,0.0008664395,0.0044304742],"category_scores_gemma":[0.001198851,0.00044805906,0.00067565613,0.0012008654,0.00037824447,0.0009327138,0.00065157865,0.0010226414,0.003677763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020181427,0.000046532914,0.00033493125,0.0003817,0.000075393065,0.00018699189,0.0001977912,0.0042100856,0.22291693,0.011810276,0.0032986144,0.756339],"study_design_scores_gemma":[0.00018578419,0.00051269785,0.0055237855,0.0001996373,0.00034174463,0.0032642651,0.00024788277,0.41667104,0.36256906,0.026112776,0.18416692,0.00020436457],"about_ca_topic_score_codex":0.0007320442,"about_ca_topic_score_gemma":0.0010949095,"teacher_disagreement_score":0.0044304742,"about_ca_system_score_codex":0.00016640681,"about_ca_system_score_gemma":0.0006994348,"threshold_uncertainty_score":0.01482141},"labels":[],"label_agreement":null},{"id":"W1967568565","doi":"10.1016/j.sigpro.2004.10.005","title":"Aggregation of color and shape features for hybrid query generation in content based visual information retrieval","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Feature (linguistics); Content-based image retrieval; Precision and recall; Image retrieval; Ground truth; Segmentation; Pattern recognition (psychology); Visual Word; Fuzzy logic; Information retrieval; Content (measure theory); Computer vision; Data mining; Image (mathematics); Mathematics","score_opus":0.03160332932031044,"score_gpt":0.2723456777036463,"score_spread":0.24074234838333589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967568565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11695235,0.0016402134,0.87145615,0.00031238396,0.00016026144,0.0003058869,0.0007596184,0.0055322237,0.0028808913],"genre_scores_gemma":[0.5763007,0.00059254153,0.41723508,0.00016922303,0.00018126814,0.0002697348,0.0016469943,0.00043367635,0.0031708265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918765,0.00015602093,0.00005525125,0.00010247747,0.00038126376,0.00011724856],"domain_scores_gemma":[0.9987173,0.00034761932,0.00006948419,0.00025716447,0.00052896707,0.00007940142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093448925,0.0007705964,0.0015412722,0.0023862203,0.0004609399,0.0011470158,0.0009854218,0.00066894805,0.0023331062],"category_scores_gemma":[0.0025338673,0.00036253114,0.000658953,0.0031121548,0.00037892064,0.0016925982,0.0010671457,0.0005432307,0.0010859024],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013558893,0.00048743444,0.0021195572,0.00019596503,0.000086364234,0.00016881373,0.00019952162,0.029055836,0.204488,0.004103132,0.009322753,0.7484167],"study_design_scores_gemma":[0.000112234455,0.00039082085,0.0043191696,0.000015521395,0.00012924601,0.00028470848,0.00013405703,0.8798957,0.10300873,0.007036205,0.004599807,0.000073738855],"about_ca_topic_score_codex":0.0047125504,"about_ca_topic_score_gemma":0.0066467146,"teacher_disagreement_score":0.0047125504,"about_ca_system_score_codex":0.00072710536,"about_ca_system_score_gemma":0.0006425428,"threshold_uncertainty_score":0.009370267},"labels":[],"label_agreement":null},{"id":"W1968598997","doi":"10.1016/j.sigpro.2007.05.001","title":"A novel efficient two-phase algorithm for training interpolation radial basis function networks","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Radial basis function; Interpolation (computer graphics); Algorithm; Basis (linear algebra); Radial basis function network; Computer science; Phase (matter); Function (biology); Basis function; Mathematics; Artificial intelligence; Artificial neural network; Physics; Mathematical analysis; Geometry","score_opus":0.03175908120931126,"score_gpt":0.3014459874021143,"score_spread":0.26968690619280306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968598997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018175981,0.00006832719,0.99701,0.000039989904,0.000031620413,0.000027453329,0.000017989365,0.00057018636,0.0004167715],"genre_scores_gemma":[0.030701388,0.00007642062,0.96652293,0.00007229523,0.00003597503,0.00014428682,0.00015503635,0.00013545422,0.0021561515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995035,0.00012117727,0.000028023622,0.00008828412,0.00021677345,0.000042325428],"domain_scores_gemma":[0.9991622,0.0002776297,0.000060457172,0.000110602,0.00035052,0.000038494247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011880379,0.0010800065,0.0011549895,0.0007367118,0.00056833966,0.00076747854,0.002239277,0.0013622125,0.0050080763],"category_scores_gemma":[0.002735919,0.0006828959,0.0006525957,0.0010377953,0.00040294186,0.0013067195,0.0013169716,0.0016864263,0.0021490525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002754012,0.00018430146,0.0004345149,0.00012359004,0.000070488684,0.000049693936,0.000057526082,0.19113171,0.015239288,0.012180103,0.005547419,0.77470607],"study_design_scores_gemma":[0.000022520142,0.00002995948,0.000069036345,0.0000039044153,0.000006647584,0.000021044318,0.0000035794467,0.9946196,0.0024059142,0.0012760472,0.0015350061,0.000006761289],"about_ca_topic_score_codex":0.004475037,"about_ca_topic_score_gemma":0.0071320166,"teacher_disagreement_score":0.0050080763,"about_ca_system_score_codex":0.000544793,"about_ca_system_score_gemma":0.0014530378,"threshold_uncertainty_score":0.016753674},"labels":[],"label_agreement":null},{"id":"W1969025618","doi":"10.1016/j.sigpro.2007.08.011","title":"On approximation of smooth functions from samples of partial derivatives with application to phase unwrapping","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; Army Research Office; Multidisciplinary University Research Initiative; National Institutes of Health","keywords":"Subspace topology; Linear subspace; Mathematics; Bivariate analysis; Invariant (physics); Projection (relational algebra); Applied mathematics; Invariant subspace; Operator (biology); Deconvolution; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.04535854535043788,"score_gpt":0.30430499059565014,"score_spread":0.25894644524521226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969025618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025447446,0.00023943513,0.99674654,0.000029826004,0.00002550134,0.000013085444,0.000010426876,0.000105342064,0.00028503212],"genre_scores_gemma":[0.07171927,0.0017818348,0.9232202,0.00006262214,0.0001068693,0.00009501564,0.00015567864,0.0002380783,0.002620354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936265,0.00024070159,0.00004282615,0.00006852285,0.0002483766,0.000036960304],"domain_scores_gemma":[0.9971764,0.0020757276,0.000112985814,0.00028140933,0.0002889594,0.00006454361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019779427,0.001369771,0.0012770649,0.0013078301,0.0005040048,0.0013190963,0.0013129789,0.0015079137,0.0014534205],"category_scores_gemma":[0.008818333,0.00081367395,0.0011253736,0.0016493088,0.0014180993,0.0017085838,0.0015005699,0.0022971248,0.00068556616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037946587,0.0001378661,0.0005519198,0.00050814886,0.00011145588,0.00031069614,0.00043996883,0.44219327,0.03620866,0.15684573,0.002842793,0.35947007],"study_design_scores_gemma":[0.0000060655525,0.000020548287,0.00007015076,0.000008659831,0.000008913175,0.000043451633,0.000009070995,0.9846028,0.002306368,0.011470154,0.0014435757,0.000010198716],"about_ca_topic_score_codex":0.002704356,"about_ca_topic_score_gemma":0.002285771,"teacher_disagreement_score":0.002704356,"about_ca_system_score_codex":0.00046134653,"about_ca_system_score_gemma":0.0005708168,"threshold_uncertainty_score":0.010460436},"labels":[],"label_agreement":null},{"id":"W1975836707","doi":"10.1016/j.sigpor.2006.04.009","title":"Perturbative corrections to stochastic resonant quantizers","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"stochastic dynamics and bifurcation","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Probability density function; Perturbation (astronomy); Limit (mathematics); Bounded function; Signal-to-noise ratio (imaging); Statistical physics; Function (biology); Noise (video); Applied mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics; Computer science","score_opus":0.008019037480059542,"score_gpt":0.24363851735773312,"score_spread":0.23561947987767357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975836707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35511804,0.002125387,0.52867275,0.00086258596,0.0005140098,0.00008007934,0.000088394016,0.001286207,0.11125254],"genre_scores_gemma":[0.97818506,0.000582036,0.012570508,0.00026796453,0.00013602916,0.000031636944,0.000024904883,0.00015537582,0.008046414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994911,0.000067912995,0.00001903927,0.0000623358,0.00028720227,0.000072462455],"domain_scores_gemma":[0.9991423,0.00046737542,0.000117872856,0.00013067658,0.00010058402,0.00004121037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029792,0.00035204555,0.00048830983,0.0005104287,0.0005869315,0.00062831346,0.0005213505,0.00054793607,0.0039935983],"category_scores_gemma":[0.002458414,0.00019254924,0.00043682402,0.00029350742,0.0012542594,0.0009058158,0.0009840417,0.000665623,0.0004506181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007082268,0.00004016518,0.00088633655,0.00013982256,0.000034850487,0.00067905855,0.00041352853,0.10024491,0.046388794,0.8292703,0.00093712006,0.020894347],"study_design_scores_gemma":[0.000013586014,0.00010068274,0.0021446606,0.00003241413,0.000030580926,0.00073437486,0.000115931216,0.53306276,0.017831752,0.4409493,0.0049178475,0.000066073386],"about_ca_topic_score_codex":0.0006314384,"about_ca_topic_score_gemma":0.00059233635,"teacher_disagreement_score":0.0039935983,"about_ca_system_score_codex":0.0007817932,"about_ca_system_score_gemma":0.00038290865,"threshold_uncertainty_score":0.013359904},"labels":[],"label_agreement":null},{"id":"W1979837465","doi":"10.1016/j.sigpro.2014.06.003","title":"A low-complexity variable forgetting factor constant modulus RLS algorithm for blind adaptive beamforming","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Department of Education of Zhejiang Province; National Natural Science Foundation of China","keywords":"Recursive least squares filter; Constant (computer programming); Adaptive beamformer; Beamforming; Algorithm; Mathematics; Computational complexity theory; Convexity; Mean squared error; Variable (mathematics); Adaptive filter; Control theory (sociology); Computer science; Mathematical optimization; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.03330700995063559,"score_gpt":0.26197600450083147,"score_spread":0.22866899455019588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979837465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008036494,0.00015967408,0.99802655,0.000055310706,0.00006552605,0.000013473034,0.000018259638,0.00032722933,0.0005303168],"genre_scores_gemma":[0.032940354,0.000324554,0.96218747,0.00012319596,0.00012025381,0.00007976584,0.00016109394,0.0001102132,0.003953185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.00016388054,0.000053228792,0.00010978083,0.0003384806,0.00004402074],"domain_scores_gemma":[0.9992599,0.00026137807,0.000047960184,0.00013849155,0.00026121334,0.00003103863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088382786,0.0011015969,0.0006847049,0.00060170516,0.00034921698,0.00081672205,0.001364672,0.0010237728,0.0065924134],"category_scores_gemma":[0.0027804133,0.00043011733,0.00063317944,0.0010078945,0.0006388963,0.0011999175,0.00094023097,0.0017986541,0.0043349313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042997938,0.00011391027,0.00027471245,0.00020929996,0.00008609665,0.00008093741,0.0001018907,0.066480294,0.065059036,0.032333266,0.008744709,0.82608587],"study_design_scores_gemma":[0.000078109166,0.00013463736,0.0002309124,0.00003591797,0.000036408517,0.00018031921,0.000019572299,0.94928646,0.024188114,0.009364492,0.01639773,0.000047392823],"about_ca_topic_score_codex":0.0021083911,"about_ca_topic_score_gemma":0.003366635,"teacher_disagreement_score":0.0065924134,"about_ca_system_score_codex":0.0004640124,"about_ca_system_score_gemma":0.0012437546,"threshold_uncertainty_score":0.022053838},"labels":[],"label_agreement":null},{"id":"W1980550929","doi":"10.1016/j.sigpro.2014.08.030","title":"Whole-body humanoid robot imitation with pose similarity evaluation","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Humanoid robot; Imitation; Artificial intelligence; Similarity (geometry); Robot; Computer vision; Computer science; Metric (unit); Pose; Discriminative model; Motion (physics); Focus (optics); Motion capture; Human–robot interaction; Engineering; Psychology","score_opus":0.028771235658491393,"score_gpt":0.2759096306882519,"score_spread":0.24713839502976054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980550929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20456311,0.00041394375,0.7872204,0.00010128478,0.00007825972,0.00026318745,0.00019029132,0.0017196742,0.0054497495],"genre_scores_gemma":[0.9079271,0.000078505764,0.08918543,0.000044094937,0.000023852766,0.00009123902,0.00031962426,0.00012646786,0.0022037087],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986877,0.00037203575,0.00007554985,0.00024166936,0.00050778955,0.00011519843],"domain_scores_gemma":[0.9983084,0.0005649757,0.00019045516,0.00026398164,0.0005507404,0.00012141412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016207449,0.0007966616,0.0010147019,0.00096462754,0.0003173345,0.0006447573,0.0007688426,0.001122246,0.0032967313],"category_scores_gemma":[0.005646635,0.00024938062,0.0005645574,0.00061799143,0.0005322673,0.00082345866,0.0012452333,0.0004219299,0.0007724694],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015482018,0.00042678928,0.0076183863,0.00033189412,0.00028112315,0.00034961957,0.00014467916,0.18942288,0.08892496,0.002306363,0.0018209111,0.7068242],"study_design_scores_gemma":[0.00003693013,0.0006083604,0.006772346,0.000011868256,0.00004471334,0.00033398753,0.000058623205,0.96461076,0.025697205,0.0013559134,0.00044758842,0.000021675989],"about_ca_topic_score_codex":0.0025170003,"about_ca_topic_score_gemma":0.0025064407,"teacher_disagreement_score":0.0032967313,"about_ca_system_score_codex":0.00041724974,"about_ca_system_score_gemma":0.00070629583,"threshold_uncertainty_score":0.011028647},"labels":[],"label_agreement":null},{"id":"W1981622420","doi":"10.1016/j.sigpro.2005.08.007","title":"Decorrelating bootstrap equalizer for time-variation suppression of MIMO channel","year":2005,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"MIMO; Adaptive equalizer; Bit error rate; Channel (broadcasting); Equalizer; Computer science; Equalization (audio); Control theory (sociology); Decorrelation; Algorithm; Mathematics; Electronic engineering; Engineering; Telecommunications; Artificial intelligence","score_opus":0.023844071416772573,"score_gpt":0.2925714144759504,"score_spread":0.26872734305917784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981622420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033484317,0.00031637546,0.96366495,0.00007788233,0.000070985196,0.00001609693,0.00003173268,0.00026297476,0.0020747704],"genre_scores_gemma":[0.66903746,0.00061606197,0.3243141,0.000273869,0.00016715495,0.00008491336,0.00023008086,0.000073208124,0.0052031614],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997559,0.000093340015,0.000012096808,0.00003461171,0.00007179021,0.000032207343],"domain_scores_gemma":[0.99958795,0.00020891432,0.000028576818,0.000068594345,0.00009320488,0.000012790526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038849824,0.0005059205,0.0003953303,0.00021243557,0.00033605166,0.0003261163,0.0004599375,0.0005064348,0.0020148484],"category_scores_gemma":[0.0010232643,0.00017707408,0.0002930276,0.00031202866,0.00023728456,0.0004289185,0.00045397456,0.00047226073,0.0006078644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012081608,0.00017658842,0.0008004097,0.00016808326,0.00013069394,0.00037384767,0.00015487112,0.08161123,0.530836,0.026445594,0.0030793059,0.3550152],"study_design_scores_gemma":[0.00004426358,0.00025166507,0.0011107066,0.000026857128,0.00007466855,0.0005132117,0.00003227161,0.8406829,0.14765869,0.0045737154,0.005001835,0.00002925167],"about_ca_topic_score_codex":0.00028815225,"about_ca_topic_score_gemma":0.0008980514,"teacher_disagreement_score":0.0020148484,"about_ca_system_score_codex":0.00012730133,"about_ca_system_score_gemma":0.00023439269,"threshold_uncertainty_score":0.0067403316},"labels":[],"label_agreement":null},{"id":"W1982312956","doi":"10.1016/j.sigpro.2012.06.021","title":"A multilevel structural technique for fingerprint representation and matching","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fingerprint (computing); Minutiae; Matching (statistics); Pattern recognition (psychology); Benchmark (surveying); Computer science; Fingerprint recognition; Artificial intelligence; Representation (politics); Feature (linguistics); Byte; Mathematics; Statistics","score_opus":0.046674102078890736,"score_gpt":0.3292503450890316,"score_spread":0.2825762430101409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982312956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046279873,0.00006478834,0.993983,0.00004217161,0.000021305068,0.000016572161,0.000059600272,0.00029474054,0.0008898544],"genre_scores_gemma":[0.11751157,0.00024489613,0.87704504,0.0000728937,0.00006580694,0.00008159861,0.00031445993,0.00016824614,0.004495431],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944276,0.00008481771,0.000024342153,0.00009446536,0.00029531313,0.000058287405],"domain_scores_gemma":[0.9992945,0.00014241411,0.000053706062,0.00029266937,0.00018154256,0.000035144025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003417965,0.0003856584,0.0005520502,0.0012000375,0.0005723073,0.00070016645,0.0011150388,0.0007877624,0.0067292335],"category_scores_gemma":[0.0018255779,0.00037279175,0.00089125364,0.0015710068,0.00045907524,0.0010166396,0.0016213661,0.0012463013,0.002563414],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021507329,0.000116416035,0.0006193293,0.0001502419,0.000065562504,0.00010308402,0.00013806709,0.024088468,0.19656529,0.050153203,0.004057938,0.72372735],"study_design_scores_gemma":[0.000030673884,0.00040598508,0.0018760245,0.000042162435,0.000113431866,0.0006465752,0.00008139976,0.84337234,0.10807494,0.02462754,0.020674024,0.000054909113],"about_ca_topic_score_codex":0.0013138683,"about_ca_topic_score_gemma":0.0026914862,"teacher_disagreement_score":0.0067292335,"about_ca_system_score_codex":0.00029127783,"about_ca_system_score_gemma":0.0005913182,"threshold_uncertainty_score":0.022511542},"labels":[],"label_agreement":null},{"id":"W1983760178","doi":"10.1016/j.sigpro.2003.06.001","title":"Complex Daubechies wavelets: properties and statistical image modelling","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wavelet; Context (archaeology); Representation (politics); Computer science; Artificial intelligence; Pattern recognition (psychology); Algorithm; Focus (optics); Wavelet transform; Mathematics","score_opus":0.08077974115554895,"score_gpt":0.28721952361052266,"score_spread":0.2064397824549737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983760178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014983839,0.005295061,0.97607034,0.00071139977,0.0001977946,0.000025160794,0.00016980208,0.0001354612,0.0024111439],"genre_scores_gemma":[0.506263,0.02506059,0.45270085,0.00030529697,0.0013097873,0.00020575557,0.0010543936,0.00035809915,0.012742232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956805,0.0001195392,0.000033861914,0.00008701241,0.00016152428,0.000029994013],"domain_scores_gemma":[0.9979432,0.0009980287,0.00026898095,0.00027792164,0.0004346955,0.00007717966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202134,0.0007388361,0.0009493107,0.0015861515,0.00037969896,0.0023125305,0.00081035023,0.0016215853,0.0012994027],"category_scores_gemma":[0.0070381598,0.00048300257,0.00042198724,0.0025973667,0.0016119949,0.0022519564,0.0006605268,0.001933395,0.0007961008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011628186,0.000045168475,0.001193136,0.0003800534,0.000044948978,0.00022752861,0.00033379727,0.055836007,0.017945472,0.7564687,0.005768732,0.16164017],"study_design_scores_gemma":[0.000020766867,0.000051098992,0.0014196596,0.00006843241,0.00003506303,0.0005822488,0.00010050197,0.6096905,0.0049324837,0.36568642,0.017354885,0.000057919202],"about_ca_topic_score_codex":0.0010552473,"about_ca_topic_score_gemma":0.0006261393,"teacher_disagreement_score":0.0023125305,"about_ca_system_score_codex":0.0004996534,"about_ca_system_score_gemma":0.0005437111,"threshold_uncertainty_score":0.0085686445},"labels":[],"label_agreement":null},{"id":"W1983852521","doi":"10.1016/j.sigpro.2013.11.007","title":"Fast image enhancement in compressed wavelet domain","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wavelet; Artificial intelligence; Computer science; Computer vision; Compressed sensing; Wavelet transform; Stationary wavelet transform; Image quality; Noise (video); Image (mathematics); Wavelet packet decomposition; Mathematics; Algorithm","score_opus":0.014818736558259733,"score_gpt":0.2680393405517997,"score_spread":0.25322060399353996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983852521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021108147,0.0005238404,0.9749587,0.00017879909,0.00009762313,0.00003292012,0.000052554755,0.00024857718,0.0027988295],"genre_scores_gemma":[0.19522367,0.0017921497,0.7905346,0.00017950482,0.00018075024,0.000066881614,0.0002543407,0.00016292169,0.011605126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998099,0.00003540415,0.000009006254,0.000023160135,0.00010709405,0.000015349578],"domain_scores_gemma":[0.99961334,0.00014897829,0.00003329504,0.000067690635,0.00012073194,0.000016057478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042955313,0.00049047644,0.00034431677,0.00047733303,0.0001402935,0.00047767378,0.0003181515,0.0004933251,0.0025050046],"category_scores_gemma":[0.0011389148,0.00015516396,0.00030570518,0.00053708616,0.0002921804,0.0007768354,0.000519418,0.0006567004,0.0005876138],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005574359,0.00012112117,0.0006291134,0.00042655232,0.00007355526,0.0003527593,0.0001679045,0.036787823,0.33131453,0.047154427,0.004579891,0.57783496],"study_design_scores_gemma":[0.000050558738,0.00014067566,0.0012803486,0.0000492072,0.00005403261,0.0008914004,0.000053154345,0.79920715,0.1724453,0.012367646,0.013433278,0.000027163134],"about_ca_topic_score_codex":0.0005443321,"about_ca_topic_score_gemma":0.00068436627,"teacher_disagreement_score":0.0025050046,"about_ca_system_score_codex":0.00014297602,"about_ca_system_score_gemma":0.00023599155,"threshold_uncertainty_score":0.008380055},"labels":[],"label_agreement":null},{"id":"W1985319438","doi":"10.1016/s0165-1684(00)00139-0","title":"Sensor array signal tracking using a data-driven window approach","year":2000,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Window (computing); Sensor array; SIGNAL (programming language); Computer science; Tracking (education); Real-time computing; Artificial intelligence","score_opus":0.06725814964956589,"score_gpt":0.3071153046183793,"score_spread":0.23985715496881344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985319438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004369499,0.000069022164,0.99521315,0.000013154005,0.000020562955,0.0000075003886,0.000015300266,0.00015149273,0.00014027767],"genre_scores_gemma":[0.17927311,0.00041031267,0.8178039,0.00004840902,0.0000789115,0.00012066742,0.00022134041,0.00013934534,0.0019040875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970955,0.00003505226,0.000020610581,0.000087958906,0.00012411897,0.000022705632],"domain_scores_gemma":[0.99940276,0.00025679302,0.00005834052,0.00010475746,0.00015123664,0.000026092614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052597997,0.00064186525,0.00076727226,0.00059653854,0.0002820994,0.00068304106,0.00078414945,0.00058705965,0.0011347061],"category_scores_gemma":[0.0020632963,0.0004808513,0.0005054397,0.00097354426,0.00023857376,0.0013090532,0.0007221895,0.0007503991,0.0005663956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007364889,0.00016661618,0.0015126232,0.00023278981,0.00022107977,0.00018012531,0.00016119619,0.13054025,0.23915792,0.021896616,0.0014895983,0.6037047],"study_design_scores_gemma":[0.000018368211,0.00008501154,0.00049301394,0.000008661746,0.000040658215,0.00008717456,0.000007609931,0.9639017,0.031008048,0.0024636246,0.0018696439,0.000016472837],"about_ca_topic_score_codex":0.00072080444,"about_ca_topic_score_gemma":0.0010928775,"teacher_disagreement_score":0.0011347061,"about_ca_system_score_codex":0.00021597372,"about_ca_system_score_gemma":0.00046421436,"threshold_uncertainty_score":0.0037959218},"labels":[],"label_agreement":null},{"id":"W1988838366","doi":"10.1016/j.sigpro.2006.11.001","title":"On the adaptive linear estimators, using biased Cramér–Rao bound","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Estimator; Cramér–Rao bound; Mathematics; Algorithm; Computer science; Statistics; Applied mathematics","score_opus":0.03617379225947152,"score_gpt":0.2838124885625061,"score_spread":0.24763869630303462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988838366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010107374,0.0010911097,0.99680614,0.00010703706,0.00006609838,0.000011581543,0.000018443452,0.00008261101,0.00080619176],"genre_scores_gemma":[0.0798135,0.004692061,0.9092312,0.00039734945,0.0006888642,0.00020932256,0.00021769652,0.0002713267,0.0044786776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581075,0.0020780538,0.00016386573,0.0005413233,0.0012224435,0.00018362053],"domain_scores_gemma":[0.98768884,0.009336987,0.00042816874,0.0012086693,0.0012374712,0.00009983939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006064683,0.0017129944,0.0014840079,0.0019514451,0.0006009624,0.001852912,0.001895017,0.0021071073,0.00317866],"category_scores_gemma":[0.0346231,0.0011450688,0.000943902,0.0024917107,0.0026241813,0.0037654745,0.0024040192,0.0034549632,0.0020058812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000433222,0.0000836859,0.0010151517,0.00058253045,0.00026089954,0.00017162293,0.00029401557,0.3246905,0.010614514,0.3045624,0.009013116,0.3482784],"study_design_scores_gemma":[0.00005070652,0.000078323676,0.00068250526,0.00011163369,0.00009247489,0.00022177499,0.000037485293,0.8930518,0.0053631207,0.090263285,0.0099492,0.000097634475],"about_ca_topic_score_codex":0.0025278341,"about_ca_topic_score_gemma":0.0029162962,"teacher_disagreement_score":0.006064683,"about_ca_system_score_codex":0.00084952003,"about_ca_system_score_gemma":0.0015247464,"threshold_uncertainty_score":0.032073498},"labels":[],"label_agreement":null},{"id":"W1997332416","doi":"10.1016/j.sigpro.2008.01.014","title":"Extrapolated impulse response filter using coefficient-autocorrelation-matrix decomposition","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Finite impulse response; Stopband; Autocorrelation matrix; Mathematics; Algorithm; Passband; Impulse response; Infinite impulse response; Chebyshev filter; Autocorrelation; Low-pass filter; Ripple; Side lobe; Digital filter; Extrapolation; Elliptic filter; Filter (signal processing); Prototype filter; Computer science; Mathematical analysis; Statistics; Electronic engineering; Physics; Engineering; Band-pass filter; Telecommunications","score_opus":0.04048491393066182,"score_gpt":0.32463455237703004,"score_spread":0.2841496384463682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997332416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009148331,0.00008569404,0.9883409,0.000042256197,0.00004241357,0.000016990227,0.000040191844,0.00065865193,0.0016244347],"genre_scores_gemma":[0.13199538,0.00023510616,0.8595535,0.00010215765,0.00006309712,0.0000690604,0.000331685,0.0001814192,0.0074685877],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970585,0.000056304812,0.000017176766,0.00005135111,0.00014405498,0.00002526177],"domain_scores_gemma":[0.99937266,0.00019908338,0.000048028676,0.000103516606,0.0002484741,0.00002826224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003932075,0.0006858916,0.00042472163,0.0007278187,0.00031527516,0.00070808793,0.00059296394,0.0008513733,0.0066195647],"category_scores_gemma":[0.0015410263,0.00025701697,0.0005259339,0.0005755062,0.00021108886,0.0008490717,0.00043756687,0.00069111295,0.0022916857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008730179,0.00019864744,0.00087065366,0.0002520573,0.00013480967,0.00058075914,0.00017502494,0.06272133,0.45424333,0.037498005,0.003152693,0.4392996],"study_design_scores_gemma":[0.000051335683,0.00026977333,0.0011704592,0.000056863162,0.00008744878,0.0007701128,0.000036556048,0.8243685,0.15587719,0.0067780786,0.010487652,0.000046034744],"about_ca_topic_score_codex":0.0008045703,"about_ca_topic_score_gemma":0.0015731863,"teacher_disagreement_score":0.0066195647,"about_ca_system_score_codex":0.00034360975,"about_ca_system_score_gemma":0.00061906583,"threshold_uncertainty_score":0.022144675},"labels":[],"label_agreement":null},{"id":"W1999008170","doi":"10.1016/j.sigpro.2010.06.018","title":"On the practical realization of higher-order filters with fractional stepping","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Control Systems Design","field":"Engineering","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Transfer function; Band-pass filter; Integer (computer science); Butterworth filter; Realization (probability); Filter (signal processing); Order (exchange); Fractional calculus; Prototype filter; Low-pass filter; Network synthesis filters; Spice; Operator (biology); Applied mathematics; Control theory (sociology); Topology (electrical circuits); Computer science; Electronic engineering; Combinatorics; Engineering","score_opus":0.012947749935186752,"score_gpt":0.25071757474780154,"score_spread":0.2377698248126148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999008170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01424783,0.00033969202,0.97867525,0.00012830208,0.000054693428,0.000020213307,0.000012551028,0.00021307678,0.006308418],"genre_scores_gemma":[0.43243927,0.00093089195,0.5621308,0.00010967029,0.00009570321,0.000056980145,0.00008454047,0.000049404374,0.0041026976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957234,0.00013451766,0.00002870253,0.00005284936,0.00016980122,0.00004177205],"domain_scores_gemma":[0.9995196,0.0002636818,0.000027839687,0.00012234531,0.000054534292,0.0000119204005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072510244,0.00067715836,0.00041533436,0.00035914758,0.0003885251,0.001181413,0.00047047582,0.0009687375,0.0035582543],"category_scores_gemma":[0.0017419967,0.0002714037,0.000519122,0.00044420717,0.000605019,0.0010800688,0.00040953173,0.0010212794,0.0007339746],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039616617,0.0001029225,0.0003323824,0.00042737724,0.00006867522,0.00042205464,0.0004005563,0.09489957,0.09159909,0.5141919,0.0023999137,0.29475948],"study_design_scores_gemma":[0.00008485475,0.00035064813,0.00040650417,0.00006770445,0.00005746078,0.00075621705,0.00007827473,0.718421,0.08766959,0.15706708,0.034989282,0.000051534244],"about_ca_topic_score_codex":0.00042921377,"about_ca_topic_score_gemma":0.00076309306,"teacher_disagreement_score":0.0035582543,"about_ca_system_score_codex":0.00038079332,"about_ca_system_score_gemma":0.00034154844,"threshold_uncertainty_score":0.011903524},"labels":[],"label_agreement":null},{"id":"W1999575913","doi":"10.1016/j.sigpro.2013.06.026","title":"Integrated track initialization and maintenance in heavy clutter using probabilistic data association","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Initialization; Clutter; Computer science; Probabilistic logic; Track (disk drive); Data association; Algorithm; Track-before-detect; Joint (building); Artificial intelligence; Real-time computing; Radar; Engineering","score_opus":0.042737294454844775,"score_gpt":0.2687423709661339,"score_spread":0.22600507651128912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999575913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014858441,0.00013175291,0.98376113,0.00005396331,0.000035927846,0.00001459839,0.000032236396,0.00072407525,0.00038790848],"genre_scores_gemma":[0.51503485,0.00014226913,0.4823113,0.00009301816,0.00007936047,0.000060986455,0.00030076582,0.0001700246,0.0018074214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982992,0.00029095565,0.00012245163,0.00043460864,0.0006540998,0.00019872033],"domain_scores_gemma":[0.995652,0.0015404179,0.000470412,0.0011769405,0.0010063623,0.00015393569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387793,0.0007519349,0.0014301499,0.0011836856,0.0010680391,0.0017770766,0.0021185947,0.0012988651,0.0011108208],"category_scores_gemma":[0.007925875,0.0010959442,0.00068993063,0.0018662127,0.00067234004,0.0031765276,0.0026595995,0.0016115975,0.0009022987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012646624,0.00031703926,0.0052606296,0.00011795883,0.0002265745,0.00012834423,0.00020293481,0.3564589,0.021801416,0.004467829,0.0021909457,0.6075628],"study_design_scores_gemma":[0.000028670629,0.00006805986,0.001080508,0.0000050200442,0.000046340563,0.00010429839,0.00001356383,0.9865824,0.009198387,0.0022027604,0.0006516847,0.000018218756],"about_ca_topic_score_codex":0.0039467188,"about_ca_topic_score_gemma":0.005892993,"teacher_disagreement_score":0.0039467188,"about_ca_system_score_codex":0.0005862455,"about_ca_system_score_gemma":0.0019250115,"threshold_uncertainty_score":0.012628019},"labels":[],"label_agreement":null},{"id":"W2000798228","doi":"10.1016/j.sigpro.2007.12.014","title":"Estimation of the instantaneous amplitude and frequency of non-stationary short-time signals","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Electrical Measurement Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec","funders":"","keywords":"Amplitude; Instantaneous phase; Speech recognition; Time–frequency analysis; Acoustics; Computer science; Mathematics; Algorithm; Telecommunications; Physics; Optics","score_opus":0.015406427748663932,"score_gpt":0.24276644715568302,"score_spread":0.22736001940701908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000798228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058592588,0.00065526046,0.9387038,0.00008893529,0.00009590472,0.000029883491,0.00017862389,0.00040762595,0.0012474727],"genre_scores_gemma":[0.63700575,0.001560004,0.35558492,0.00007757575,0.00027566357,0.00005431928,0.0009962439,0.00013350791,0.0043121036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983037,0.000024076335,0.0000111590225,0.000037533988,0.00007940748,0.000017424538],"domain_scores_gemma":[0.999413,0.00026809773,0.00006775934,0.00006350183,0.00015982515,0.000027792737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030411623,0.0005050867,0.00043594567,0.0010451383,0.00015458387,0.0004293357,0.0003360515,0.0004644279,0.0011071966],"category_scores_gemma":[0.0019319096,0.00013790898,0.00022011618,0.0005989056,0.00015227852,0.000677922,0.00021788258,0.00039601512,0.0006300912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032966927,0.00010563142,0.0050757104,0.0002802938,0.00007426743,0.00013148226,0.0000694775,0.013875218,0.2863436,0.0030509946,0.0010164838,0.6896472],"study_design_scores_gemma":[0.000031545624,0.00033109036,0.054309044,0.000054926742,0.0001606016,0.0009898499,0.0000924734,0.6987247,0.23006777,0.006661175,0.008512768,0.00006403375],"about_ca_topic_score_codex":0.00042066324,"about_ca_topic_score_gemma":0.0005499062,"teacher_disagreement_score":0.0011071966,"about_ca_system_score_codex":0.0001024884,"about_ca_system_score_gemma":0.00021328761,"threshold_uncertainty_score":0.0037038922},"labels":[],"label_agreement":null},{"id":"W2002910452","doi":"10.1016/j.sigpro.2013.08.015","title":"Combined cubature Kalman and smooth variable structure filtering: A robust nonlinear estimation strategy","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ford Motor Company (Canada); McMaster University","funders":"","keywords":"Kalman filter; Robustness (evolution); Control theory (sociology); Nonlinear system; Mathematics; Gaussian; State variable; Algorithm; Computer science; Statistics; Artificial intelligence","score_opus":0.013241088544759801,"score_gpt":0.22237898423095623,"score_spread":0.20913789568619642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002910452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002298207,0.00013782791,0.99692625,0.000042791715,0.000029109007,0.000007870162,0.000009872618,0.000107432774,0.0004406556],"genre_scores_gemma":[0.38386825,0.00056285533,0.60655427,0.00017282531,0.00017718597,0.00017421086,0.00022763228,0.00019626133,0.008066553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00019026223,0.000040737195,0.00015215362,0.00023200743,0.000056884073],"domain_scores_gemma":[0.9989893,0.00041390798,0.00009779288,0.00013329976,0.00033166842,0.000034025667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001363591,0.0009331155,0.0017018344,0.000745696,0.000487905,0.0011892023,0.0011359417,0.0013783894,0.0017297957],"category_scores_gemma":[0.002623198,0.0008029125,0.00086221786,0.00090877584,0.0006079519,0.0016522903,0.0014388532,0.0009829177,0.00068780297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004544135,0.00011050001,0.0007524614,0.00022368571,0.0002495172,0.00011430967,0.00012671934,0.59963804,0.026016567,0.04214068,0.0027093764,0.32746378],"study_design_scores_gemma":[0.000008644774,0.000037317714,0.000097976874,0.000004093867,0.000015276255,0.000020571724,0.0000035451906,0.99449784,0.00172018,0.0026791724,0.0009040879,0.000011362085],"about_ca_topic_score_codex":0.0038445122,"about_ca_topic_score_gemma":0.0036601436,"teacher_disagreement_score":0.0038445122,"about_ca_system_score_codex":0.0004884453,"about_ca_system_score_gemma":0.0009427417,"threshold_uncertainty_score":0.007644236},"labels":[],"label_agreement":null},{"id":"W2010243737","doi":"10.1016/j.sigpro.2008.05.006","title":"Low-cost modifications of Rao-Blackwellized particle filters for improved speech denoising","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle filter; Noise reduction; Speech recognition; Particle (ecology); Computer science; Artificial intelligence; Biology; Kalman filter","score_opus":0.0378160765145632,"score_gpt":0.27238952375904324,"score_spread":0.23457344724448004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010243737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060786163,0.00026552618,0.99236566,0.00009187925,0.00019101784,0.000019557074,0.000034012897,0.00044120592,0.0005124427],"genre_scores_gemma":[0.114324786,0.000447608,0.87923086,0.00014007307,0.00018674726,0.000097199154,0.00025277387,0.00022054015,0.00509943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990495,0.0002585661,0.00008326188,0.00015666819,0.00038575655,0.000066307184],"domain_scores_gemma":[0.9983529,0.0006397441,0.00011161949,0.00033881422,0.00050326355,0.00005359506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012545711,0.0012562237,0.0010805808,0.0005089726,0.00032998092,0.00083995005,0.0010344426,0.0017589219,0.003341182],"category_scores_gemma":[0.0059299446,0.0007087772,0.00088457984,0.0006454481,0.0004714199,0.001050585,0.0008385182,0.0015341436,0.0016361792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012852397,0.00020850172,0.0006441587,0.00028860656,0.00025812487,0.00017021991,0.00015982402,0.1684107,0.09216973,0.013640644,0.0059758625,0.7167884],"study_design_scores_gemma":[0.000045163844,0.00010610099,0.00077225716,0.000014361592,0.000056351426,0.00014525595,0.00001487333,0.9650451,0.026765632,0.0019793327,0.0050223037,0.000033243225],"about_ca_topic_score_codex":0.003671096,"about_ca_topic_score_gemma":0.007020077,"teacher_disagreement_score":0.003671096,"about_ca_system_score_codex":0.00044351895,"about_ca_system_score_gemma":0.0009954456,"threshold_uncertainty_score":0.011177301},"labels":[],"label_agreement":null},{"id":"W2012011201","doi":"10.1016/j.sigpro.2013.11.023","title":"A local fingerprinting approach for audio copy detection","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Music and Audio Processing","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Identification (biology); Scale-invariant feature transform; Artificial intelligence; Pattern recognition (psychology); Speech recognition; Representation (politics); Change detection; Audio signal processing; Spectrogram; Computer vision; Audio signal; Image (mathematics); Speech coding","score_opus":0.017282948304352886,"score_gpt":0.2316316978101526,"score_spread":0.2143487495057997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012011201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009220868,0.00039039724,0.98819983,0.000043440847,0.000041950887,0.000035987465,0.000060188,0.00089517806,0.0011121754],"genre_scores_gemma":[0.20543195,0.0008851094,0.78350997,0.00015298082,0.00018227975,0.00010112351,0.00029975668,0.00022148786,0.009215421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.00008162981,0.000027759746,0.00014712969,0.00031370492,0.00006299345],"domain_scores_gemma":[0.99904746,0.00018533245,0.00006786271,0.00037776603,0.0002682699,0.000053202897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042377063,0.00083985954,0.0010879858,0.0015285485,0.00062763714,0.00088196236,0.0011799437,0.00097574457,0.0036106484],"category_scores_gemma":[0.0015348705,0.00039663873,0.0007891497,0.0013386403,0.00046907194,0.0013883461,0.0011813635,0.0008393759,0.0028598257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027854505,0.00015820516,0.0011668722,0.00014733367,0.00008592832,0.00016612299,0.00007260159,0.014740519,0.26437497,0.0035475113,0.0018828133,0.7133785],"study_design_scores_gemma":[0.000051679388,0.00046184583,0.004069631,0.000035590674,0.00026286716,0.0023038883,0.00011219141,0.73412365,0.24059713,0.0064166053,0.01144938,0.00011542534],"about_ca_topic_score_codex":0.0014096374,"about_ca_topic_score_gemma":0.0024742666,"teacher_disagreement_score":0.0036106484,"about_ca_system_score_codex":0.0003170493,"about_ca_system_score_gemma":0.00055948104,"threshold_uncertainty_score":0.012078822},"labels":[],"label_agreement":null},{"id":"W2012307835","doi":"10.1016/j.sigpro.2005.06.023","title":"Identification of acoustic MIMO systems: Challenges and opportunities","year":2005,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"MIMO; Identification (biology); Signal processing; Computer science; Impulse (physics); Impulse response; Channel (broadcasting); System identification; Acoustics; Speech recognition; Electronic engineering; Telecommunications; Engineering; Digital signal processing; Mathematics; Physics; Data mining","score_opus":0.05560432141391625,"score_gpt":0.263150511456428,"score_spread":0.20754619004251174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012307835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01790467,0.0051606228,0.9702009,0.0026174355,0.00021831057,0.00003095236,0.000118484626,0.00032731943,0.0034213592],"genre_scores_gemma":[0.60006076,0.015486811,0.36513755,0.0012413564,0.0023924804,0.00022958865,0.0006779929,0.00012907725,0.014644322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989505,0.000370598,0.000053980984,0.00019527688,0.00031847216,0.000111254165],"domain_scores_gemma":[0.99583,0.0027440926,0.0002499451,0.0004196046,0.0006486984,0.00010779868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014587229,0.0007157831,0.0015215267,0.00068056217,0.000514685,0.0018468687,0.0007773704,0.0015019223,0.0018718301],"category_scores_gemma":[0.0067757983,0.0006054383,0.0003393678,0.0008273102,0.0007240067,0.0022123463,0.0011521439,0.0012866,0.0013929948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035644774,0.00022886108,0.004326192,0.0005849074,0.000141899,0.00029804514,0.0003881225,0.19042881,0.03308348,0.05792798,0.008266401,0.7039688],"study_design_scores_gemma":[0.000049428323,0.00012403369,0.002459757,0.00007255107,0.00003751636,0.00059579476,0.00039906419,0.9008554,0.006509343,0.07914498,0.009678145,0.00007400896],"about_ca_topic_score_codex":0.0011680139,"about_ca_topic_score_gemma":0.0016280991,"teacher_disagreement_score":0.0018718301,"about_ca_system_score_codex":0.00024665156,"about_ca_system_score_gemma":0.00083521166,"threshold_uncertainty_score":0.00771451},"labels":[],"label_agreement":null},{"id":"W2017793876","doi":"10.1016/j.sigpro.2013.12.032","title":"Recursive hidden input estimation in nonlinear dynamic systems with varying amounts of a priori knowledge","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University; Microsoft Research","keywords":"A priori and a posteriori; Nonlinear system; Estimator; Computer science; Residual; Bayesian probability; Algorithm; Bayes estimator; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.005656454738410073,"score_gpt":0.22776831952580986,"score_spread":0.2221118647873998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017793876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115253836,0.00064942037,0.88272804,0.0002630969,0.000039475624,0.000010458123,0.000052364874,0.00020823677,0.0007950478],"genre_scores_gemma":[0.9544155,0.00037452817,0.04301157,0.000032821077,0.00003880024,0.000020193249,0.00011930567,0.000039301733,0.0019479349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996803,0.00009939421,0.000024029325,0.00006989095,0.000071600174,0.000054785683],"domain_scores_gemma":[0.9967871,0.0026429119,0.00017982916,0.00017056454,0.00018907395,0.000030655432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009645921,0.00059448247,0.00072325877,0.00034510216,0.00033346884,0.0007907076,0.0006188101,0.0010591112,0.00068142434],"category_scores_gemma":[0.0067636333,0.0006827459,0.00035628912,0.00034234795,0.0007816576,0.0017396598,0.00072946755,0.0010833343,0.00015984547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027002458,0.0000544016,0.00093839807,0.00012931567,0.00007874863,0.000112728965,0.00012690968,0.92655057,0.0076229842,0.008999142,0.00030859603,0.0548081],"study_design_scores_gemma":[0.000002624144,0.000008603007,0.00034416193,0.0000033190831,0.000005336463,0.0000053807544,0.0000029336597,0.996951,0.0011601596,0.0014645112,0.000048137535,0.000003954363],"about_ca_topic_score_codex":0.0054504015,"about_ca_topic_score_gemma":0.007379236,"teacher_disagreement_score":0.0054504015,"about_ca_system_score_codex":0.00051381346,"about_ca_system_score_gemma":0.0005710078,"threshold_uncertainty_score":0.0108373165},"labels":[],"label_agreement":null},{"id":"W2018204386","doi":"10.1016/s0165-1684(02)00382-1","title":"Computational load reduction of fast convergence algorithms for multichannel active noise control","year":2002,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; Convergence (economics); Reduction (mathematics); Recursive least squares filter; Active noise control; Adaptive filter; Computational complexity theory; Noise (video); Computer science; Noise reduction; Mathematics; Artificial intelligence","score_opus":0.024550406817236328,"score_gpt":0.25698718624358663,"score_spread":0.2324367794263503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018204386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020579716,0.00017179464,0.9773427,0.000109300694,0.00007081861,0.000021979795,0.00001341126,0.0001519942,0.0015382033],"genre_scores_gemma":[0.5801671,0.00030511763,0.4138076,0.00008755742,0.00013821165,0.00020987714,0.00007801083,0.00018620309,0.0050203525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994235,0.00020677647,0.000031779404,0.0000656331,0.0002149147,0.000057388002],"domain_scores_gemma":[0.9983644,0.0010242773,0.00007604221,0.00015932345,0.00033655547,0.00003937474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011222652,0.0006919252,0.00059937756,0.0004280452,0.00053864316,0.00074310426,0.00066201284,0.00056758313,0.0027019032],"category_scores_gemma":[0.0052495655,0.00028486756,0.0002934996,0.00040519275,0.0005391627,0.0010059648,0.00088966417,0.000866461,0.00038881172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000868887,0.00019192956,0.00053661526,0.00016055038,0.00005121188,0.00004911457,0.00022148536,0.56482464,0.017703779,0.031081695,0.0025282737,0.38178173],"study_design_scores_gemma":[0.000011377879,0.000030423846,0.00007081992,0.0000028247841,0.000002966832,0.0000062409454,0.0000050970452,0.99490523,0.0024899563,0.002099845,0.00037230746,0.0000030186554],"about_ca_topic_score_codex":0.0019433349,"about_ca_topic_score_gemma":0.002509127,"teacher_disagreement_score":0.0027019032,"about_ca_system_score_codex":0.00040399592,"about_ca_system_score_gemma":0.00095468666,"threshold_uncertainty_score":0.009038806},"labels":[],"label_agreement":null},{"id":"W2021090852","doi":"10.1016/s0165-1684(02)00479-6","title":"Dynamics in high-dimensional model gene networks","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria","funders":"","keywords":"Attractor; Ordinary differential equation; Boolean network; Product (mathematics); Binary number; Function (biology); Set (abstract data type); Gene regulatory network; Mathematics; Boolean function; Boolean model; Class (philosophy); Dynamical systems theory; Statistical physics; Differential equation; Computer science; Topology (electrical circuits); Biological system; Gene; Algorithm; Physics; Discrete mathematics; Biology; Mathematical analysis; Artificial intelligence; Combinatorics; Genetics","score_opus":0.006683575202701154,"score_gpt":0.21715248840478948,"score_spread":0.21046891320208833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021090852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71129316,0.00046500453,0.28097343,0.0017194784,0.000034144945,0.000046692865,0.00050358707,0.0003300303,0.0046345415],"genre_scores_gemma":[0.9775589,0.00048603507,0.01853032,0.00008500446,0.000026241074,0.00012272013,0.0003413864,0.000040649677,0.002808835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972147,0.00012164419,0.000011095647,0.0000666254,0.000048608814,0.000030570864],"domain_scores_gemma":[0.9959494,0.0031609498,0.0003949797,0.00015512572,0.00015876399,0.000180786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097368937,0.00040804548,0.00092310936,0.00096008804,0.00067807094,0.0013214855,0.0011048538,0.0012596984,0.002062608],"category_scores_gemma":[0.007993316,0.00057321385,0.0006966996,0.00081331196,0.0014888786,0.002718303,0.00073654996,0.00090828625,0.00017781057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046450892,0.000025258449,0.0012493376,0.000033550074,0.000022202013,0.00006401505,0.00007894934,0.94224995,0.0009293811,0.052954316,0.00033718252,0.002009527],"study_design_scores_gemma":[0.0000053585195,0.000003195047,0.00014628995,0.0000014281832,0.0000025591814,0.000009480027,0.0000076167034,0.98538786,0.000069277674,0.014294656,0.00006985019,0.0000024766712],"about_ca_topic_score_codex":0.008435562,"about_ca_topic_score_gemma":0.006676599,"teacher_disagreement_score":0.008435562,"about_ca_system_score_codex":0.0016812426,"about_ca_system_score_gemma":0.0006666146,"threshold_uncertainty_score":0.016772866},"labels":[],"label_agreement":null},{"id":"W2030364295","doi":"10.1016/j.sigpro.2008.09.006","title":"Particle-method-based formulation of risk-sensitive filter","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Russian Science Foundation; Commonwealth Scholarship Commission","keywords":"Particle filter; Algorithm; Robustness (evolution); Gaussian; Parametric statistics; Probabilistic logic; Computer science; Benchmark (surveying); Nonlinear system; Range (aeronautics); Mathematical optimization; Mathematics; Filter (signal processing); Artificial intelligence; Engineering; Statistics","score_opus":0.029370305437797693,"score_gpt":0.27074250745106576,"score_spread":0.24137220201326806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030364295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056440994,0.00011448895,0.998681,0.00007325734,0.000036141202,0.000007055454,0.000011187259,0.000019006065,0.0004934659],"genre_scores_gemma":[0.30690172,0.0017817889,0.6730144,0.0003494487,0.00049097894,0.00032009758,0.00038386165,0.0001737647,0.016583938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999466,0.00019170801,0.000027795697,0.00009554001,0.0001848922,0.000034041648],"domain_scores_gemma":[0.9990263,0.0004902855,0.00007033949,0.00005638531,0.0003191811,0.000037494792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018672459,0.0009463261,0.0011347634,0.00056851277,0.0002830175,0.0012579521,0.0013769087,0.0018338846,0.00243337],"category_scores_gemma":[0.0034961,0.0005688738,0.00081008894,0.0007418211,0.0008950589,0.0015289934,0.0010714321,0.0014952574,0.0005191344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037609905,0.000028602995,0.00027652405,0.00017242871,0.00006264573,0.000083945175,0.0000651156,0.8288448,0.0024302634,0.1385591,0.001935799,0.027503181],"study_design_scores_gemma":[0.0000033513716,0.00000907218,0.00004144966,0.0000038631474,0.0000063236434,0.000012380101,0.0000023308041,0.9914057,0.00021096077,0.00761723,0.00068217533,0.0000052836926],"about_ca_topic_score_codex":0.0038475173,"about_ca_topic_score_gemma":0.002619761,"teacher_disagreement_score":0.0038475173,"about_ca_system_score_codex":0.0008992095,"about_ca_system_score_gemma":0.0014567773,"threshold_uncertainty_score":0.009875059},"labels":[],"label_agreement":null},{"id":"W2036704249","doi":"10.1016/j.sigpro.2014.03.010","title":"Musical-noise-free blind speech extraction integrating microphone array and iterative spectral subtraction","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Core Research for Evolutional Science and Technology; Japan Society for the Promotion of Science","keywords":"Noise (video); Computer science; Speech recognition; Independent component analysis; Speech enhancement; Iterative method; Microphone; Noise measurement; Microphone array; Estimator; Acoustics; Algorithm; Mathematics; Artificial intelligence; Noise reduction; Physics; Telecommunications; Statistics","score_opus":0.013987905535478965,"score_gpt":0.2574314407150714,"score_spread":0.24344353517959244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036704249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030010373,0.00014776392,0.9961547,0.000017435808,0.000020709625,0.00001834533,0.000008607957,0.00031332645,0.00031809288],"genre_scores_gemma":[0.051689208,0.00023869918,0.9463241,0.00006361928,0.000050462328,0.000060505496,0.00006864905,0.000070559276,0.001434088],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999089,0.00016311053,0.000076487464,0.00018275737,0.00044594426,0.00004273765],"domain_scores_gemma":[0.99927074,0.0002397729,0.00007864966,0.000116056886,0.0002640381,0.00003066325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007507298,0.0011296216,0.0009531289,0.00077983557,0.00034490286,0.0006710501,0.001153231,0.0012124636,0.0013679178],"category_scores_gemma":[0.0016644772,0.0005436904,0.0009511205,0.0005059923,0.0006084133,0.0015941664,0.0009015738,0.0006838034,0.0016964136],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034646434,0.000095880845,0.000721891,0.00042285857,0.00014269048,0.00014595341,0.00016403006,0.020294454,0.475975,0.0054952307,0.00069061015,0.49550492],"study_design_scores_gemma":[0.00006826473,0.0003600118,0.001791661,0.000039630064,0.0001697385,0.0013315415,0.000051646653,0.46503478,0.5153429,0.003499797,0.012159328,0.00015073102],"about_ca_topic_score_codex":0.00043556702,"about_ca_topic_score_gemma":0.0008963768,"teacher_disagreement_score":0.0013679178,"about_ca_system_score_codex":0.00022541227,"about_ca_system_score_gemma":0.0006474476,"threshold_uncertainty_score":0.0045761466},"labels":[],"label_agreement":null},{"id":"W2038096646","doi":"10.1016/j.sigpro.2011.03.021","title":"Stochastic image denoising based on Markov-chain Monte Carlo sampling","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Noise reduction; Monte Carlo method; Mathematics; Algorithm; Artificial intelligence; Markov chain; Nonparametric statistics; Pattern recognition (psychology); Computer science; Mathematical optimization; Statistics","score_opus":0.04856850487225214,"score_gpt":0.28707334843333254,"score_spread":0.2385048435610804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038096646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00614162,0.000118013995,0.9929061,0.00009299952,0.00003015362,0.000019043875,0.000015958165,0.00010045898,0.00057560916],"genre_scores_gemma":[0.4815719,0.0008366862,0.5113793,0.00026316993,0.000214645,0.00029413504,0.0003138606,0.00022582483,0.004900437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839157,0.000717769,0.00006465986,0.00020531408,0.0005068804,0.000113766575],"domain_scores_gemma":[0.9912047,0.0068939417,0.00039628823,0.00054946024,0.00071873766,0.00023681943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037995223,0.0006923124,0.002176516,0.0013358638,0.0007938369,0.0014991282,0.0018219443,0.0017991774,0.0023207765],"category_scores_gemma":[0.012880179,0.0011309518,0.0014427135,0.0011969882,0.00242231,0.0019325688,0.0015446859,0.0020846962,0.00042671402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018505972,0.00006455595,0.00076750276,0.00010132298,0.00009907404,0.0000893606,0.000090847665,0.7997441,0.002092315,0.17245764,0.00087184075,0.023436444],"study_design_scores_gemma":[0.000008281314,0.00000566635,0.00004474642,0.000004799082,0.0000052444366,0.000011711438,0.0000017532669,0.98778963,0.0002765496,0.011705035,0.00013956406,0.000006939704],"about_ca_topic_score_codex":0.0065369573,"about_ca_topic_score_gemma":0.007432311,"teacher_disagreement_score":0.0065369573,"about_ca_system_score_codex":0.0013847055,"about_ca_system_score_gemma":0.001820736,"threshold_uncertainty_score":0.020094037},"labels":[],"label_agreement":null},{"id":"W2038253873","doi":"10.1016/s0165-1684(02)00135-4","title":"Numerically stable fast convergence least-squares algorithms for multichannel active sound cancellation systems and sound deconvolution systems","year":2002,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; QR decomposition; Recursive least squares filter; Adaptive filter; System identification; Deconvolution; Computer science; Convergence (economics); Active noise control; Numerical stability; Mathematics; Numerical analysis; Filter (signal processing)","score_opus":0.040140263771435675,"score_gpt":0.2607476609620002,"score_spread":0.22060739719056452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038253873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029901045,0.00016207217,0.99604225,0.00008710389,0.00004609912,0.000012601139,0.000011491876,0.0001472914,0.0005010165],"genre_scores_gemma":[0.10141566,0.00046494266,0.88864094,0.00008887933,0.00009881374,0.00017762689,0.00012718342,0.00020876837,0.008777129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.00019898874,0.00003040868,0.00006448406,0.00023050605,0.000031199826],"domain_scores_gemma":[0.9976146,0.0014626349,0.0001381527,0.00016323743,0.000577863,0.00004348432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503178,0.0008056163,0.000606173,0.00041983978,0.000548197,0.00090156606,0.00080343,0.001414428,0.0029448115],"category_scores_gemma":[0.007906356,0.0005404905,0.00038181114,0.000625156,0.000834957,0.0013035242,0.0011339831,0.0015557129,0.0012767896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039771933,0.00009724017,0.00037335683,0.0003166368,0.000068862784,0.00008904566,0.0003435192,0.4764363,0.0290475,0.051449213,0.004670351,0.43671036],"study_design_scores_gemma":[0.000027744667,0.00002278997,0.00008496476,0.000011568112,0.000005396022,0.0000273373,0.000015673582,0.9845265,0.004865845,0.008533771,0.001863787,0.00001464588],"about_ca_topic_score_codex":0.0021779342,"about_ca_topic_score_gemma":0.003814389,"teacher_disagreement_score":0.0029448115,"about_ca_system_score_codex":0.00041273635,"about_ca_system_score_gemma":0.0013337834,"threshold_uncertainty_score":0.0098513365},"labels":[],"label_agreement":null},{"id":"W2041348998","doi":"10.1016/j.sigpro.2012.07.036","title":"Kalman filtering strategies utilizing the chattering effects of the smooth variable structure filter","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Control theory (sociology); Kalman filter; Robustness (evolution); Extended Kalman filter; Invariant extended Kalman filter; Unscented transform; Nonlinear system; Alpha beta filter; Fast Kalman filter; Computer science; Mathematics; Moving horizon estimation; Artificial intelligence; Physics","score_opus":0.0129132641325198,"score_gpt":0.22970879008407494,"score_spread":0.21679552595155513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041348998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028365965,0.00014434797,0.9963542,0.00002417338,0.000032840853,0.000008137012,0.0000052598107,0.00009310559,0.00050140574],"genre_scores_gemma":[0.54100525,0.00087570486,0.45065877,0.00012035414,0.00012327255,0.00011840327,0.00010164376,0.00012527041,0.006871323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962556,0.00009834201,0.000029831106,0.00006908228,0.00014937518,0.000027756369],"domain_scores_gemma":[0.99879116,0.00067260064,0.00009794988,0.0001482938,0.0002657703,0.000024220952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890881,0.0006467162,0.00077841117,0.00055204413,0.00042145295,0.000799592,0.0006959716,0.0007436324,0.0016002159],"category_scores_gemma":[0.0032718393,0.00036825862,0.00056866504,0.0005277679,0.00065719563,0.0012169512,0.00076365576,0.0009292512,0.00054266554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023079103,0.000080394,0.0010187353,0.00036372847,0.00022704616,0.0001364907,0.0003725988,0.5587904,0.031203313,0.10156082,0.0019294488,0.30408624],"study_design_scores_gemma":[0.000018337705,0.00009197201,0.000267344,0.000013431116,0.00003124973,0.00003675214,0.000013880454,0.98211193,0.0042590727,0.01156339,0.0015725534,0.000020089998],"about_ca_topic_score_codex":0.0023479024,"about_ca_topic_score_gemma":0.003358163,"teacher_disagreement_score":0.0023479024,"about_ca_system_score_codex":0.00034987676,"about_ca_system_score_gemma":0.0007013558,"threshold_uncertainty_score":0.0053532124},"labels":[],"label_agreement":null},{"id":"W2044000385","doi":"10.1016/j.sigpro.2012.10.021","title":"Principles of minimum variance robust adaptive beamforming design","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":294,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robustness (evolution); Minimum-variance unbiased estimator; Beamforming; Adaptive beamformer; Computer science; Imperfect; Variance (accounting); Range (aeronautics); Electronic engineering; Engineering; Telecommunications; Mathematics; Statistics; Mean squared error","score_opus":0.07905418114954706,"score_gpt":0.2786842532869124,"score_spread":0.19963007213736533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044000385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013950055,0.00017115174,0.99868995,0.000057292855,0.000017305094,0.00000917717,0.000009359512,0.00004379093,0.0008623978],"genre_scores_gemma":[0.046837613,0.0023230975,0.9462894,0.00023316474,0.00023339875,0.0003323773,0.000121326935,0.000094720024,0.003534804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.00034120205,0.00007371191,0.00015935641,0.0005246612,0.000050117087],"domain_scores_gemma":[0.99900347,0.0005555417,0.00007796876,0.00010593855,0.00023365,0.000023421566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013763969,0.0012358751,0.0009780392,0.00088882574,0.00035659104,0.0016853798,0.0014740651,0.0015118618,0.0025197791],"category_scores_gemma":[0.003733045,0.0008407143,0.0007459824,0.0013150828,0.0011299428,0.0012666748,0.0011992148,0.0023939437,0.0024054023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095679155,0.000060411283,0.0002892894,0.00046038692,0.00011506556,0.00012291457,0.00017877785,0.17509763,0.023945078,0.460087,0.0049430667,0.3346048],"study_design_scores_gemma":[0.000055498906,0.00013638407,0.00032490946,0.00012210324,0.00005435771,0.00028332893,0.000028507397,0.6747274,0.0071210307,0.28854138,0.028522285,0.0000829147],"about_ca_topic_score_codex":0.0004867428,"about_ca_topic_score_gemma":0.0005794761,"teacher_disagreement_score":0.0025197791,"about_ca_system_score_codex":0.0004134042,"about_ca_system_score_gemma":0.000714657,"threshold_uncertainty_score":0.008429527},"labels":[],"label_agreement":null},{"id":"W2045012981","doi":"10.1016/j.sigpro.2013.04.004","title":"A new constrained weighted least squares algorithm for TDOA-based localization","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"University of Chinese Academy of Sciences; City University of Hong Kong","keywords":"Mathematics; Multilateration; Linear least squares; Algorithm; Least-squares function approximation; Estimator; Non-linear least squares; Total least squares; Matrix (chemical analysis); Quadratic equation; Generalized least squares; Gaussian elimination; Gaussian; Mathematical optimization; Applied mathematics; Statistics; Estimation theory; Geometry","score_opus":0.008601640146762396,"score_gpt":0.21421704556929702,"score_spread":0.20561540542253462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045012981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065735367,0.0000708899,0.99876285,0.0000247757,0.00004609275,0.000010223018,0.000014333155,0.00014868694,0.00026483674],"genre_scores_gemma":[0.01948788,0.000231762,0.9768183,0.00008900088,0.00006243736,0.000107056716,0.00015634375,0.00012929796,0.0029179123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.00014458087,0.000050288018,0.0002036888,0.00047425283,0.000042689797],"domain_scores_gemma":[0.99920636,0.00018524865,0.00006096932,0.000097811055,0.00041523555,0.000034438108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006116524,0.0010573852,0.00096971635,0.0007894506,0.00046444716,0.00081583153,0.0015045626,0.0010266345,0.002994951],"category_scores_gemma":[0.002718802,0.00057346903,0.00072955375,0.0019144454,0.0004502568,0.0016626733,0.0014668006,0.0012821552,0.0023162002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001821412,0.00009581421,0.0005047083,0.00022360503,0.00014221825,0.00008658784,0.00012429162,0.12773508,0.059309628,0.012064411,0.006826942,0.79270464],"study_design_scores_gemma":[0.000027338036,0.000062618754,0.00031471034,0.000020120255,0.00003835931,0.00016385873,0.000020116877,0.97266227,0.010881182,0.00321693,0.012553868,0.000038652466],"about_ca_topic_score_codex":0.003890622,"about_ca_topic_score_gemma":0.006189475,"teacher_disagreement_score":0.003890622,"about_ca_system_score_codex":0.0003602049,"about_ca_system_score_gemma":0.0015341108,"threshold_uncertainty_score":0.010019124},"labels":[],"label_agreement":null},{"id":"W2046575129","doi":"10.1016/s0165-1684(00)00276-0","title":"Parameter estimation of a target-directed dynamic system model with switching states","year":2001,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Else Kröner-Fresenius-Stiftung","keywords":"Control theory (sociology); Computer science; Estimation theory; Estimation; Mathematics; Algorithm; Engineering; Artificial intelligence; Control (management)","score_opus":0.011028273784722006,"score_gpt":0.23700117275607457,"score_spread":0.22597289897135256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046575129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070941426,0.00014431756,0.92625415,0.00016696057,0.000032557706,0.00003785955,0.00012225957,0.00035143108,0.0019489991],"genre_scores_gemma":[0.98293245,0.00011039406,0.014715013,0.000038758062,0.000011969986,0.00006128057,0.00018263413,0.000031406966,0.0019161635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995995,0.00010118878,0.000018895349,0.00013868987,0.00009598734,0.00004558622],"domain_scores_gemma":[0.9986141,0.0008462474,0.0001881401,0.00010482774,0.00021315954,0.00003357402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008132027,0.00079860585,0.0009897905,0.0004734265,0.00028651298,0.000852204,0.00076762005,0.0012214629,0.001221524],"category_scores_gemma":[0.003175563,0.0005611045,0.00050966174,0.0004961118,0.0007114032,0.00086462434,0.00075203733,0.0011248131,0.00042597431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011145556,0.000030327823,0.00061506784,0.00006183974,0.00004738587,0.000049315022,0.00006310104,0.9750921,0.002931783,0.0044363025,0.0002336092,0.016327785],"study_design_scores_gemma":[0.000006841598,0.000015025249,0.00020652087,0.0000029816415,0.000008400323,0.000010083973,0.000003421029,0.9980995,0.00060618116,0.0009434133,0.0000927121,0.0000049997143],"about_ca_topic_score_codex":0.0055669704,"about_ca_topic_score_gemma":0.0036245086,"teacher_disagreement_score":0.0055669704,"about_ca_system_score_codex":0.0005821743,"about_ca_system_score_gemma":0.0006262449,"threshold_uncertainty_score":0.011069179},"labels":[],"label_agreement":null},{"id":"W2051382371","doi":"10.1016/j.sigpro.2007.03.003","title":"Fast RLS Fourier analyzers capable of accommodating frequency mismatch","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Recursive least squares filter; Algorithm; Fast Fourier transform; Sine; Fourier transform; Computer science; Noise (video); Discrete Fourier transform (general); Least mean squares filter; Spectrum analyzer; Fourier series; Fourier analysis; Control theory (sociology); Mathematics; Adaptive filter; Short-time Fourier transform; Artificial intelligence; Telecommunications","score_opus":0.013531319018850498,"score_gpt":0.25209235109095707,"score_spread":0.23856103207210658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051382371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046273183,0.0005859014,0.94122094,0.00025636787,0.00020100488,0.00009055949,0.00012566586,0.0029676554,0.0082787005],"genre_scores_gemma":[0.39399123,0.00041997278,0.590132,0.0003480973,0.00024076586,0.00017738594,0.00034065393,0.00024438254,0.014105584],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991455,0.00023004627,0.00005181871,0.000119750475,0.00038315842,0.000069735885],"domain_scores_gemma":[0.9962836,0.0019978795,0.00025589662,0.0007203507,0.0006549176,0.00008735671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001800488,0.00097181456,0.0006917235,0.00089987763,0.00046352283,0.0012644299,0.0011778582,0.0013719811,0.005292995],"category_scores_gemma":[0.004303256,0.0005422798,0.0002988538,0.0005896158,0.00058950146,0.002177389,0.00074832316,0.0009569702,0.002679446],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013430733,0.00017692702,0.002112672,0.00028509664,0.00005929151,0.00040241607,0.0002890333,0.009679595,0.58929837,0.03955973,0.0056054653,0.3511883],"study_design_scores_gemma":[0.000261722,0.0006410361,0.0028994957,0.000083253675,0.00013547497,0.0024204517,0.00010676118,0.38364568,0.5525187,0.010296905,0.046845175,0.00014521943],"about_ca_topic_score_codex":0.00040268133,"about_ca_topic_score_gemma":0.0011952884,"teacher_disagreement_score":0.005292995,"about_ca_system_score_codex":0.00057020073,"about_ca_system_score_gemma":0.00050853303,"threshold_uncertainty_score":0.017706811},"labels":[],"label_agreement":null},{"id":"W2054697955","doi":"10.1016/j.sigpro.2011.02.014","title":"A Bayesian Lasso via reversible-jump MCMC","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lasso (programming language); Markov chain Monte Carlo; Bayesian probability; Prior probability; Bayesian inference; Gibbs sampling; Reversible-jump Markov chain Monte Carlo; Computer science; Algorithm; Model selection; Mathematics; Artificial intelligence","score_opus":0.1278538037782656,"score_gpt":0.3483625726101193,"score_spread":0.22050876883185372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054697955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002146235,0.00016199193,0.9957808,0.00034710215,0.00008239251,0.00003924862,0.00013354531,0.0005766701,0.00073202973],"genre_scores_gemma":[0.12270308,0.00031310448,0.86779237,0.00069777726,0.0005086619,0.00057214015,0.0012360873,0.0005933134,0.00558336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561214,0.0028073594,0.00017160668,0.0005295778,0.0006352546,0.00024401858],"domain_scores_gemma":[0.9889254,0.008540477,0.00043146368,0.001047014,0.0007291811,0.00032647655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071315197,0.0016116742,0.0032036754,0.0011316087,0.0013107111,0.002196097,0.0045140614,0.0037338217,0.009008348],"category_scores_gemma":[0.017071687,0.0017332789,0.0019718374,0.0016344306,0.0021639399,0.0023649042,0.003095412,0.006396547,0.0023815096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007065143,0.00025464012,0.0010538303,0.00040203598,0.0005209435,0.0001756432,0.00015914356,0.6831052,0.001987208,0.10994927,0.017477809,0.18420787],"study_design_scores_gemma":[0.00006700105,0.000020362713,0.00006574249,0.000015418118,0.000020525904,0.000016555194,0.0000063029684,0.9704203,0.00024621913,0.0283398,0.00076581654,0.000015963971],"about_ca_topic_score_codex":0.0041191517,"about_ca_topic_score_gemma":0.0063929777,"teacher_disagreement_score":0.009008348,"about_ca_system_score_codex":0.0008676974,"about_ca_system_score_gemma":0.0033841098,"threshold_uncertainty_score":0.037715495},"labels":[],"label_agreement":null},{"id":"W2056489576","doi":"10.1016/j.sigpro.2011.02.018","title":"Optimum crossing-point estimation of a sampled analog signal with a periodic carrier","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Minimum mean square error; Maximum a posteriori estimation; Mathematics; Algorithm; Bayesian probability; Mean squared error; SIGNAL (programming language); Cramér–Rao bound; Sampling (signal processing); Statistics; Computer science; Filter (signal processing); Maximum likelihood","score_opus":0.028889270101780207,"score_gpt":0.26867675165923377,"score_spread":0.23978748155745355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056489576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078362845,0.00037732456,0.91924095,0.000117661744,0.00004877946,0.000024910261,0.00004269252,0.00015216545,0.0016326084],"genre_scores_gemma":[0.64905745,0.0004701417,0.3484274,0.000048976694,0.00007834847,0.00003254394,0.00010532679,0.00005397135,0.0017258401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996728,0.00008958512,0.000018114777,0.00006397184,0.00012594995,0.000029550378],"domain_scores_gemma":[0.999419,0.0003483994,0.00006396908,0.00005997802,0.000083207895,0.000025577909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060886,0.00050453766,0.00046511577,0.00069193775,0.0002661356,0.0006444188,0.00037707604,0.00089022715,0.0012362312],"category_scores_gemma":[0.0034363251,0.0002648308,0.00030416815,0.00074909977,0.00045209084,0.0008180466,0.0004276612,0.0005838561,0.0002480264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002359802,0.00021414059,0.0030860177,0.00059363415,0.00015291011,0.00055779394,0.00052477285,0.16673182,0.23904693,0.04605309,0.001531911,0.53914714],"study_design_scores_gemma":[0.0000611749,0.00029873024,0.0036725146,0.00006089022,0.000059145226,0.00052161026,0.00004618895,0.9194975,0.06437219,0.009447537,0.0019244197,0.000038140446],"about_ca_topic_score_codex":0.00070162193,"about_ca_topic_score_gemma":0.00085807114,"teacher_disagreement_score":0.0012362312,"about_ca_system_score_codex":0.00031709074,"about_ca_system_score_gemma":0.00047179166,"threshold_uncertainty_score":0.0041356087},"labels":[],"label_agreement":null},{"id":"W2060606688","doi":"10.1016/j.sigpro.2014.12.022","title":"Spectrum sensing based on fractional lower order moments for cognitive radios in α-stable distributed noise","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"Nanjing Tech University; Nanjing University of Science and Technology; National Natural Science Foundation of China","keywords":"Rayleigh fading; Detector; Cognitive radio; Cauchy distribution; False alarm; Fading; Algorithm; Gaussian noise; Computer science; Gaussian; Detection theory; Additive white Gaussian noise; Signal-to-noise ratio (imaging); Noise (video); Mathematics; Electronic engineering; Statistics; Wireless; Telecommunications; White noise; Physics; Artificial intelligence; Engineering; Decoding methods","score_opus":0.011388341825624423,"score_gpt":0.2434723222563858,"score_spread":0.23208398043076137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060606688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051362626,0.00043137185,0.9460399,0.00023753241,0.00007748748,0.000013975928,0.000028131954,0.00008596876,0.0017230718],"genre_scores_gemma":[0.9604343,0.00034970033,0.037907686,0.00010001975,0.000082630526,0.000020305408,0.000023156397,0.000021279397,0.0010608953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00015501754,0.000023977265,0.000103509454,0.00015069646,0.00009642439],"domain_scores_gemma":[0.9977851,0.0016259974,0.0002051424,0.00011329547,0.00020752712,0.000062888525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010489763,0.00064749573,0.0008046282,0.00048084627,0.0005637151,0.0011408036,0.00064624887,0.0008145804,0.00060536707],"category_scores_gemma":[0.004971884,0.00031873316,0.0005014806,0.0005583341,0.0011383123,0.0011450361,0.00071794563,0.0009418946,0.00008766888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006982152,0.00010141591,0.0016639506,0.00021743015,0.0001162911,0.0004667404,0.000346463,0.6879785,0.036868192,0.20630464,0.0012872437,0.063950814],"study_design_scores_gemma":[0.000004569532,0.000017305465,0.00013981026,0.0000053469976,0.0000074134473,0.000042311207,0.000010062222,0.9868285,0.0010919039,0.011736705,0.00010681276,0.000009261782],"about_ca_topic_score_codex":0.0023617304,"about_ca_topic_score_gemma":0.0023921984,"teacher_disagreement_score":0.0023617304,"about_ca_system_score_codex":0.00080050493,"about_ca_system_score_gemma":0.00066098646,"threshold_uncertainty_score":0.005808115},"labels":[],"label_agreement":null},{"id":"W2062753093","doi":"10.1016/j.sigpro.2013.05.015","title":"Two-way cooperative communications with statistical channel knowledge","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Channel (broadcasting); Relay channel; Channel state information; Computer network; Transmitter power output; Probabilistic logic; Bandwidth (computing); Power (physics); Mathematical optimization; Electronic engineering; Engineering; Telecommunications; Wireless; Mathematics; Transmitter; Artificial intelligence","score_opus":0.05118604664809637,"score_gpt":0.31473776397565323,"score_spread":0.2635517173275569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062753093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026150705,0.0004190499,0.9657701,0.0004372782,0.000085338856,0.000065465654,0.00009618698,0.00023868617,0.0067371666],"genre_scores_gemma":[0.861019,0.0010509903,0.124141656,0.00048385336,0.00030956074,0.00044566838,0.00020699768,0.000067466484,0.012274814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969422,0.0009516254,0.00015206916,0.00042347817,0.0011065064,0.00042400372],"domain_scores_gemma":[0.9910267,0.0052838624,0.00074630993,0.0014502669,0.0013094987,0.00018336142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028127907,0.0017574272,0.0016864393,0.0014615003,0.0013448264,0.002093433,0.0015101705,0.0019830887,0.001523795],"category_scores_gemma":[0.009897452,0.0008304438,0.00081844156,0.0030294028,0.0019328935,0.0029298784,0.0036964111,0.0012287918,0.0010569335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014122004,0.0003475051,0.0034483469,0.00060743367,0.00048472153,0.0011537338,0.001670982,0.5464105,0.06338496,0.18427074,0.0050063026,0.19180264],"study_design_scores_gemma":[0.000093798866,0.00022601614,0.00052585715,0.000041041712,0.00013404276,0.00050751626,0.00014435513,0.90730244,0.012664315,0.07513523,0.0031237171,0.00010164104],"about_ca_topic_score_codex":0.0011495168,"about_ca_topic_score_gemma":0.0021649688,"teacher_disagreement_score":0.0028127907,"about_ca_system_score_codex":0.0007301954,"about_ca_system_score_gemma":0.0015548503,"threshold_uncertainty_score":0.01487565},"labels":[],"label_agreement":null},{"id":"W2070565404","doi":"10.1016/j.sigpro.2010.03.029","title":"A robust variable step-size affine projection algorithm","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"A priori and a posteriori; Adaptive filter; Algorithm; Norm (philosophy); Mathematics; Affine transformation; Robustness (evolution); Variable (mathematics); System identification; Constraint (computer-aided design); Computer science","score_opus":0.013905895978041026,"score_gpt":0.2252008830050497,"score_spread":0.21129498702700866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070565404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010784775,0.00007191509,0.99797875,0.00003283401,0.000041182007,0.00001473281,0.000017515327,0.00024512687,0.00051950646],"genre_scores_gemma":[0.035594124,0.00019115915,0.96051425,0.00005826668,0.000061820996,0.000077491226,0.00014687044,0.00010709852,0.0032489218],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925584,0.000152611,0.00003714996,0.00015703954,0.00036087196,0.000036494563],"domain_scores_gemma":[0.9994004,0.00016302573,0.00004008154,0.0001307006,0.00023191565,0.000033927015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078043627,0.00086121116,0.0009850923,0.00050363096,0.00038068244,0.00096176844,0.0010188182,0.0010721709,0.0042845],"category_scores_gemma":[0.0017816077,0.00054784183,0.0007286414,0.00084704865,0.0004573024,0.0010771864,0.0012588084,0.0015002913,0.0027329],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003408917,0.0001155716,0.00040818352,0.00018232477,0.00016586791,0.00011454128,0.000063073,0.12520687,0.05516051,0.034833446,0.006497783,0.77691084],"study_design_scores_gemma":[0.00003532467,0.00009562598,0.0002606973,0.000009710849,0.000028952914,0.00016924113,0.000007659462,0.97257304,0.01444813,0.004846817,0.00749844,0.000026366351],"about_ca_topic_score_codex":0.0010046049,"about_ca_topic_score_gemma":0.0011740593,"teacher_disagreement_score":0.0042845,"about_ca_system_score_codex":0.00023545351,"about_ca_system_score_gemma":0.0010753348,"threshold_uncertainty_score":0.014333069},"labels":[],"label_agreement":null},{"id":"W2075123782","doi":"10.1016/j.sigpro.2014.10.005","title":"Consensus-based distributed dynamic sensor selection in decentralised sensor networks using the posterior Cramér–Rao lower bound","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Selection (genetic algorithm); Algorithm; Upper and lower bounds; Overhead (engineering); Sensor array; Mathematics; Artificial intelligence; Machine learning","score_opus":0.011860494421673813,"score_gpt":0.24854087187054114,"score_spread":0.23668037744886733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075123782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055621746,0.00016990655,0.9932335,0.00009682895,0.000024839715,0.000014122636,0.000013932993,0.0001244008,0.00076023117],"genre_scores_gemma":[0.8257419,0.00053230725,0.16998866,0.00010932062,0.00011751197,0.00016735509,0.0001545174,0.00011905612,0.003069365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820983,0.0005194999,0.000090099915,0.0004520392,0.00057325553,0.00015529478],"domain_scores_gemma":[0.99493587,0.003388236,0.00036087952,0.0004304634,0.0007531564,0.00013131823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019882813,0.0007858621,0.0019506866,0.00082715176,0.00072088814,0.0014568092,0.0014190524,0.00094497687,0.001564803],"category_scores_gemma":[0.009639341,0.00070163794,0.00062036846,0.0013982747,0.0013528262,0.0022298766,0.0016906866,0.0016963079,0.0004051833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014484995,0.00003570629,0.00029996838,0.00009686991,0.000058163336,0.00004718047,0.00009821183,0.9378924,0.0028052032,0.017767658,0.001148124,0.039605755],"study_design_scores_gemma":[0.000010399144,0.000020233287,0.00007951996,0.000004636649,0.000006575618,0.0000145439435,0.000008359302,0.9924757,0.0005964122,0.006561515,0.00021519691,0.0000069550333],"about_ca_topic_score_codex":0.0035564678,"about_ca_topic_score_gemma":0.00306215,"teacher_disagreement_score":0.0035564678,"about_ca_system_score_codex":0.00097037444,"about_ca_system_score_gemma":0.0017653385,"threshold_uncertainty_score":0.010515153},"labels":[],"label_agreement":null},{"id":"W2075565834","doi":"10.1016/j.sigpro.2012.02.019","title":"A generalized synchrosqueezing transform for enhancing signal time–frequency representation","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":218,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Instantaneous phase; Wavelet; Time–frequency analysis; SIGNAL (programming language); Time–frequency representation; Mathematics; Dimension (graph theory); Wavelet transform; Algorithm; Continuous wavelet transform; Computer science; Artificial intelligence; Discrete wavelet transform; Telecommunications","score_opus":0.015030894681959247,"score_gpt":0.2967754132005522,"score_spread":0.28174451851859295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075565834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006843304,0.000106531494,0.9914301,0.00006910427,0.000049085662,0.000018191371,0.00004325037,0.00025343863,0.0011870401],"genre_scores_gemma":[0.18993656,0.00060841517,0.8006912,0.0001568646,0.00016410745,0.000061945466,0.0003990693,0.00019448601,0.0077873757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998115,0.000045645877,0.00001108295,0.000033001605,0.000087980625,0.000010897721],"domain_scores_gemma":[0.99978703,0.00006069151,0.000020911251,0.000050763127,0.00006903324,0.000011666435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026909378,0.0005587984,0.0002831006,0.0003823584,0.00015726237,0.00046194898,0.00032619032,0.00040578746,0.0035933994],"category_scores_gemma":[0.00077610504,0.00013105654,0.0002842002,0.0006263631,0.00026771627,0.00078553305,0.00044870574,0.00046638455,0.0011593893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030252725,0.00007453175,0.00036193413,0.00024940274,0.00004173817,0.00023131452,0.00011438784,0.029440839,0.394531,0.047165003,0.0030357898,0.5244515],"study_design_scores_gemma":[0.00004085658,0.0002910315,0.0010560051,0.000032874705,0.00006806641,0.00086672517,0.00005072657,0.81805766,0.13366015,0.01482211,0.0310155,0.00003832009],"about_ca_topic_score_codex":0.00042674877,"about_ca_topic_score_gemma":0.0007223113,"teacher_disagreement_score":0.0035933994,"about_ca_system_score_codex":0.00012863505,"about_ca_system_score_gemma":0.0002624682,"threshold_uncertainty_score":0.012021065},"labels":[],"label_agreement":null},{"id":"W2076402610","doi":"10.1016/j.sigpro.2014.05.003","title":"Perceptual-based DWPT-DCT framework for selective blind audio watermarking","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council; McGill University","keywords":"Digital watermarking; Watermark; Discrete cosine transform; Robustness (evolution); Speech recognition; Computer science; Quantization (signal processing); Audio signal; Embedding; Artificial intelligence; Mathematics; Computer vision; Speech coding; Image (mathematics)","score_opus":0.022204701872050578,"score_gpt":0.2859279917441289,"score_spread":0.2637232898720783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076402610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004497885,0.00031811662,0.99362,0.00003267698,0.000041132716,0.000031232135,0.00007702396,0.00027284378,0.0011090562],"genre_scores_gemma":[0.23991713,0.0015194688,0.7510079,0.00008708287,0.00013221953,0.00009012824,0.0005684263,0.0001372399,0.006540391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997776,0.000032911044,0.000012973684,0.00003635677,0.00011969044,0.000020513386],"domain_scores_gemma":[0.9998456,0.00003034396,0.00001469967,0.000026684815,0.00006918637,0.000013493408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028230957,0.0005088511,0.0003975457,0.00041866655,0.00017380263,0.00050048874,0.0005244761,0.0003873465,0.0030980427],"category_scores_gemma":[0.00062481617,0.00013276756,0.00036614318,0.0004631909,0.00021662666,0.00052323926,0.00055141334,0.0005388606,0.0011344817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003678886,0.00012214824,0.00029427596,0.0003928762,0.00004426685,0.00021016206,0.000047459474,0.0701757,0.36341643,0.023433393,0.0028152806,0.5386801],"study_design_scores_gemma":[0.000020692649,0.00017543384,0.00043746846,0.000022139504,0.000029715344,0.00035003934,0.000024791874,0.92697006,0.057352237,0.005153343,0.009440924,0.000023159819],"about_ca_topic_score_codex":0.0013120663,"about_ca_topic_score_gemma":0.002148523,"teacher_disagreement_score":0.0030980427,"about_ca_system_score_codex":0.00015793575,"about_ca_system_score_gemma":0.0004683897,"threshold_uncertainty_score":0.010363996},"labels":[],"label_agreement":null},{"id":"W2077495158","doi":"10.1016/j.sigpro.2011.09.007","title":"PHD filter based track-before-detect for MIMO radars","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; MIMO; Transmitter; Radar; Radar tracker; Filter (signal processing); Computer science; Observability; Control theory (sociology); Mathematics; Telecommunications; Artificial intelligence; Channel (broadcasting); Computer vision","score_opus":0.04864127345745488,"score_gpt":0.24861275215450557,"score_spread":0.19997147869705068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077495158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004755713,0.00017586836,0.99377877,0.00010421127,0.000080290665,0.000016602433,0.000053034284,0.00032824464,0.00070723036],"genre_scores_gemma":[0.3388214,0.00075960637,0.6450371,0.00045366152,0.00053373165,0.0001438577,0.0006425228,0.00015598505,0.01345219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992488,0.0001592573,0.00003624862,0.00017032029,0.00029468164,0.00009068454],"domain_scores_gemma":[0.9987764,0.00058887777,0.00009846071,0.00019992112,0.00027786705,0.00005841008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955997,0.0006851899,0.0010267069,0.00055102713,0.00052449683,0.0008756054,0.00092298276,0.0014786518,0.0036705432],"category_scores_gemma":[0.0029357236,0.0006133272,0.0005315234,0.00069030497,0.0005380351,0.0012016366,0.0010779107,0.0012291501,0.001977712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00124344,0.00029302706,0.0012568567,0.00037208796,0.00023039659,0.00019168349,0.00015125658,0.22765231,0.10400349,0.025751498,0.0073308693,0.63152313],"study_design_scores_gemma":[0.00003767593,0.00012864216,0.0003891858,0.000006349174,0.00002896278,0.00011555253,0.000008414442,0.97493106,0.01817695,0.0040027173,0.0021535188,0.00002095842],"about_ca_topic_score_codex":0.0014459423,"about_ca_topic_score_gemma":0.0026572533,"teacher_disagreement_score":0.0036705432,"about_ca_system_score_codex":0.00040405447,"about_ca_system_score_gemma":0.00095957733,"threshold_uncertainty_score":0.0122792125},"labels":[],"label_agreement":null},{"id":"W2077602786","doi":"10.1016/j.sigpro.2014.06.024","title":"Robustness of Double Random Phase Encoding spread-space spread-spectrum watermarking technique","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Watermark; Digital watermarking; Robustness (evolution); Computer vision; Computer science; Artificial intelligence; Barcode; Image processing; Digital image; Quantization (signal processing); Pattern recognition (psychology); Mathematics; Algorithm; Image (mathematics)","score_opus":0.016082217637836533,"score_gpt":0.27012422771787054,"score_spread":0.254042010080034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077602786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.774217,0.001249142,0.2156355,0.00034060018,0.00018189145,0.000028684652,0.00014395866,0.0006323794,0.0075708465],"genre_scores_gemma":[0.98757404,0.00027951424,0.010882776,0.000025835623,0.000028610413,0.0000056489657,0.00007105837,0.000023162436,0.0011093996],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948055,0.000096534124,0.000027735992,0.00011419313,0.00021904483,0.00006203288],"domain_scores_gemma":[0.9983479,0.00083977194,0.0002411431,0.0002192118,0.00030891507,0.00004310489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033992215,0.00044183628,0.00031701848,0.00057713187,0.00018872798,0.00043107703,0.00027908772,0.0007596818,0.0014965708],"category_scores_gemma":[0.002519585,0.00012433165,0.00021920096,0.0003214393,0.00029525874,0.0006906652,0.0002906293,0.0003303174,0.00032767895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001732793,0.00008182458,0.002438411,0.00021083455,0.00007385047,0.00041971682,0.000091021124,0.03718315,0.8557727,0.0056473287,0.00045176255,0.095896654],"study_design_scores_gemma":[0.00007646609,0.00059643673,0.0055331006,0.000039973063,0.00011049544,0.0015989217,0.0000650759,0.37009886,0.6176796,0.0020602408,0.0020837174,0.00005713015],"about_ca_topic_score_codex":0.00025626432,"about_ca_topic_score_gemma":0.00016974773,"teacher_disagreement_score":0.0014965708,"about_ca_system_score_codex":0.00021334416,"about_ca_system_score_gemma":0.00016386514,"threshold_uncertainty_score":0.0050065517},"labels":[],"label_agreement":null},{"id":"W2077709167","doi":"10.1016/j.sigpro.2007.11.006","title":"Experimental antenna array calibration with artificial neural networks","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Artificial neural network; Computer science; Perceptron; Calibration; Antenna (radio); Antenna array; Context (archaeology); Network topology; Algorithm; Electronic engineering; Artificial intelligence; Engineering; Mathematics; Telecommunications","score_opus":0.019065685617639164,"score_gpt":0.2754845854648529,"score_spread":0.2564188998472137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709167","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58433354,0.00024473612,0.39541665,0.000424944,0.00039038828,0.00019068122,0.0005291349,0.0022913727,0.016178539],"genre_scores_gemma":[0.95148134,0.000065211185,0.045239795,0.000070792754,0.000012025584,0.00006537894,0.00022339358,0.000111494846,0.0027305614],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990208,0.00028958448,0.000059186907,0.00019466864,0.0003294004,0.000106294996],"domain_scores_gemma":[0.9984711,0.00041239144,0.0001379048,0.00045493068,0.0004835098,0.00004019402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008725072,0.000623837,0.00040961703,0.0003982497,0.00043458576,0.000655931,0.00090677215,0.0010439099,0.0049325456],"category_scores_gemma":[0.0033230186,0.0003189301,0.00022426706,0.00090919324,0.0005231248,0.00085138914,0.00068760826,0.00073924917,0.0010821167],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019743866,0.0007152299,0.0072768233,0.00045438093,0.00014953915,0.00026697468,0.00049495796,0.22714455,0.55377275,0.0065193395,0.0037624538,0.19746862],"study_design_scores_gemma":[0.00014514504,0.0006501172,0.0068214107,0.000048690952,0.00005028896,0.0002788575,0.00013802316,0.44799206,0.5363356,0.0018232138,0.005652059,0.000064570515],"about_ca_topic_score_codex":0.000826545,"about_ca_topic_score_gemma":0.0009800494,"teacher_disagreement_score":0.0049325456,"about_ca_system_score_codex":0.00052920927,"about_ca_system_score_gemma":0.00042082169,"threshold_uncertainty_score":0.01650101},"labels":[],"label_agreement":null},{"id":"W2077926306","doi":"10.1016/j.sigpro.2011.02.011","title":"The trinion Fourier transform of color images","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Western University; Princess Margaret Cancer Centre","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quaternion; RGB color model; Color space; Mathematics; Discrete Fourier transform (general); Fourier transform; Artificial intelligence; Representation (politics); Computer vision; Color image; Fourier analysis; Mathematical analysis; Computer science; Image processing; Short-time Fourier transform; Geometry; Image (mathematics)","score_opus":0.10636847112156295,"score_gpt":0.34754836198095745,"score_spread":0.2411798908593945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077926306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021034755,0.0021353317,0.94791985,0.00065098854,0.00066985947,0.000036718488,0.00028289994,0.0003316491,0.026937919],"genre_scores_gemma":[0.3904709,0.008675541,0.539002,0.000687926,0.0011824722,0.00012510103,0.0006596732,0.000544671,0.058651682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997589,0.00005148192,0.000012311798,0.00004953268,0.00010248317,0.000025276653],"domain_scores_gemma":[0.99950373,0.00014772297,0.000057997735,0.000112467686,0.00013908317,0.00003897945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041775164,0.00039348367,0.00025153477,0.0017645629,0.00026381595,0.0013112988,0.00041876512,0.000537748,0.004770085],"category_scores_gemma":[0.002133579,0.00017440492,0.00034959253,0.0014850484,0.0010912863,0.0016204262,0.0007031715,0.0012610165,0.0012552715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089838024,0.000020645983,0.00032841568,0.00016641796,0.000021745778,0.00017509048,0.00025063576,0.006148781,0.03300207,0.7567431,0.0068057617,0.19624761],"study_design_scores_gemma":[0.000021680138,0.000068739326,0.002903065,0.000096720425,0.000032928314,0.0019288638,0.00024637216,0.24200505,0.028398054,0.61733365,0.10688884,0.00007611443],"about_ca_topic_score_codex":0.0009498549,"about_ca_topic_score_gemma":0.00079074147,"teacher_disagreement_score":0.004770085,"about_ca_system_score_codex":0.00036588532,"about_ca_system_score_gemma":0.00045812005,"threshold_uncertainty_score":0.015957475},"labels":[],"label_agreement":null},{"id":"W2078133453","doi":"10.1016/j.sigpro.2007.07.020","title":"Human visual system based adaptive digital image watermarking","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Watermark; Digital watermarking; Human visual system model; Computer vision; Artificial intelligence; Computer science; Image quality; Robustness (evolution); Masking (illustration); Digital image; Embedding; Visual masking; Discrete cosine transform; Image (mathematics); Brightness; Mathematics; Image processing; Visual perception","score_opus":0.01372581945362532,"score_gpt":0.27065289345611404,"score_spread":0.2569270740024887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078133453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18167463,0.0016922553,0.7930025,0.00027932692,0.00043882194,0.00012467329,0.00012237644,0.001352352,0.021313088],"genre_scores_gemma":[0.88628215,0.00091652054,0.09610523,0.00013082032,0.00007743253,0.0000470314,0.00010915998,0.00006794867,0.01626381],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987733,0.00002393461,0.0000040135847,0.000032773067,0.000048893045,0.00001296711],"domain_scores_gemma":[0.9998313,0.000063118605,0.000014313174,0.00002649463,0.00005629051,0.000008505301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014182916,0.00023728728,0.0001873955,0.00036883814,0.00013701661,0.00035937023,0.00029121817,0.00048447395,0.003927337],"category_scores_gemma":[0.0006110106,0.0000801071,0.0001808804,0.00022549824,0.00021592925,0.00039703766,0.0003644278,0.000248753,0.0008425055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048549412,0.00009657233,0.0008307398,0.0001952801,0.000057990863,0.00015740957,0.0000744942,0.02052262,0.63039273,0.0071306624,0.0017978976,0.33825818],"study_design_scores_gemma":[0.00005898569,0.00052032655,0.007272894,0.00003944842,0.00011417501,0.0014021304,0.000049249007,0.56111866,0.41035086,0.004638447,0.014391483,0.000043432094],"about_ca_topic_score_codex":0.00038935785,"about_ca_topic_score_gemma":0.0005518726,"teacher_disagreement_score":0.003927337,"about_ca_system_score_codex":0.00014063317,"about_ca_system_score_gemma":0.00012472614,"threshold_uncertainty_score":0.013138294},"labels":[],"label_agreement":null},{"id":"W2079122741","doi":"10.1016/j.sigpro.2008.10.033","title":"An improved partial Haar dual adaptive filter for rapid identification of a sparse echo channel","year":2008,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Echo (communications protocol); Haar; Dual (grammatical number); Adaptive filter; Filter (signal processing); Channel (broadcasting); Computer science; Identification (biology); Algorithm; Speech recognition; Mathematics; Artificial intelligence; Telecommunications; Computer vision; Computer network; Wavelet","score_opus":0.03919387691156592,"score_gpt":0.26403659841423077,"score_spread":0.22484272150266485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079122741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057695326,0.00014458751,0.99295783,0.000055285553,0.00007204944,0.000016407199,0.000031299558,0.00025122653,0.0007017246],"genre_scores_gemma":[0.059457287,0.00030458142,0.93591386,0.0001615372,0.00011542209,0.00007359906,0.000189977,0.00008141896,0.0037023379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.00009518694,0.000023716486,0.00007601118,0.00022135174,0.000040837265],"domain_scores_gemma":[0.99917066,0.00025439248,0.00004243895,0.00014637718,0.0003297044,0.000056445973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823975,0.00064375374,0.0007676624,0.0006581399,0.0004081433,0.00063110597,0.00083559053,0.0012893572,0.0032942942],"category_scores_gemma":[0.0015909442,0.00043948292,0.0005875295,0.0007103677,0.00034525205,0.0010674695,0.00087117305,0.0010601727,0.0018923006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007862651,0.00019268633,0.0006651714,0.00022207519,0.00013441773,0.0002110334,0.000121624515,0.043701608,0.31586862,0.012523431,0.0042559872,0.6213171],"study_design_scores_gemma":[0.000044223194,0.0001655149,0.00065088965,0.000014774059,0.000065825916,0.0005225984,0.000018622202,0.933819,0.054957133,0.0014460551,0.008243921,0.00005148074],"about_ca_topic_score_codex":0.0010554433,"about_ca_topic_score_gemma":0.0020278783,"teacher_disagreement_score":0.0032942942,"about_ca_system_score_codex":0.00020330558,"about_ca_system_score_gemma":0.0006859256,"threshold_uncertainty_score":0.011020482},"labels":[],"label_agreement":null},{"id":"W2079514273","doi":"10.1016/j.sigpro.2011.03.023","title":"A three-layer scheme for M-channel multiple description image coding","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coding (social sciences); Algorithm; Iterative reconstruction; Multiple description coding; Channel (broadcasting); Image (mathematics); Sub-band coding; Layer (electronics); Mathematics; Transform coding; Computer science; Decoding methods; Artificial intelligence; Pattern recognition (psychology); Discrete cosine transform; Telecommunications; Statistics","score_opus":0.106396677333911,"score_gpt":0.29739387616166235,"score_spread":0.19099719882775135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079514273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014972363,0.0007205273,0.97724724,0.00033905957,0.00017814948,0.0001525474,0.0002003086,0.0011316307,0.005058177],"genre_scores_gemma":[0.41701916,0.0007415384,0.5705815,0.00053065456,0.00014293316,0.00025923387,0.0005371486,0.00007111056,0.0101168165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.00009727316,0.00003991389,0.000048598627,0.0002030851,0.000103017606],"domain_scores_gemma":[0.9994235,0.00011301591,0.000042087428,0.00021659864,0.00016638091,0.00003844311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000693618,0.00067711325,0.0005630165,0.0006960592,0.000849295,0.0009873093,0.0012123846,0.0009800975,0.0038990595],"category_scores_gemma":[0.001149439,0.0002413577,0.0004969803,0.0007227024,0.00046357737,0.0011746058,0.001960436,0.0010143096,0.0013165309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080522953,0.00027563242,0.00088438264,0.0004223948,0.00013525602,0.00039854395,0.00026974652,0.04194969,0.18981448,0.12474337,0.013407825,0.62689346],"study_design_scores_gemma":[0.00010112614,0.00032109974,0.00071439345,0.00008027325,0.00011144177,0.000679643,0.00006097881,0.83855087,0.10846209,0.028771862,0.021993117,0.0001531378],"about_ca_topic_score_codex":0.0030637314,"about_ca_topic_score_gemma":0.005152044,"teacher_disagreement_score":0.0038990595,"about_ca_system_score_codex":0.0006210521,"about_ca_system_score_gemma":0.001062364,"threshold_uncertainty_score":0.013043702},"labels":[],"label_agreement":null},{"id":"W2086156411","doi":"10.1016/j.sigpro.2009.03.007","title":"Curvelet based face recognition via dimension reduction","year":2009,"lang":"en","type":"article","venue":"Signal Processing","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of British Columbia","funders":"","keywords":"Curvelet; Contourlet; Wavelet; Artificial intelligence; Pattern recognition (psychology); Wavelet transform; Computer science; Face (sociological concept); Dimensionality reduction; Facial recognition system; Feature extraction; Dimension (graph theory); Feature (linguistics); Curse of dimensionality; Discrete wavelet transform; Computer vision; Mathematics","score_opus":0.023353600170004662,"score_gpt":0.25184882448830165,"score_spread":0.228495224318297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086156411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054272957,0.00035210044,0.9403931,0.00024232442,0.000097411306,0.000061018523,0.00018050679,0.0014985283,0.0029021124],"genre_scores_gemma":[0.37988386,0.0008141333,0.60738146,0.00018715014,0.00017417365,0.00014959052,0.00084699393,0.00026199454,0.010300639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.000054646694,0.000014258256,0.000055930654,0.00021596519,0.000036636342],"domain_scores_gemma":[0.9995009,0.00015700363,0.000027310054,0.00013006045,0.00016052694,0.000024246141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003050722,0.00047490498,0.0007488678,0.0009466814,0.00030800872,0.0007400298,0.0004522001,0.0004951894,0.0031961529],"category_scores_gemma":[0.0009146821,0.00026340174,0.0004291694,0.00084748096,0.00033069644,0.0008010639,0.0006379748,0.0008055603,0.0018791462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021804757,0.000116021736,0.00091170485,0.000059827424,0.000037798593,0.00008277825,0.000054532593,0.021797752,0.17972088,0.006349523,0.0041128458,0.7865383],"study_design_scores_gemma":[0.000024044588,0.00013187635,0.0037954522,0.000013214557,0.000036743848,0.0005720011,0.000046562956,0.79419196,0.18833777,0.0054768906,0.0073320316,0.000041551342],"about_ca_topic_score_codex":0.00087688986,"about_ca_topic_score_gemma":0.00094371586,"teacher_disagreement_score":0.0031961529,"about_ca_system_score_codex":0.00029837605,"about_ca_system_score_gemma":0.0003597814,"threshold_uncertainty_score":0.010692179},"labels":[],"label_agreement":null},{"id":"W2086615926","doi":"10.1016/j.sigpro.2012.12.022","title":"Robust H∞ filtering for networked stochastic systems with randomly occurring sensor nonlinearities and packet dropouts","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Control theory (sociology); Network packet; Imperfect; Mathematics; Filter (signal processing); Filtering problem; Bounded function; Norm (philosophy); Exponential stability; Computer science; Filter design; Nonlinear system; Statistics; Artificial intelligence","score_opus":0.017128822959740393,"score_gpt":0.19453743961837194,"score_spread":0.17740861665863156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086615926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019960998,0.00031682072,0.9781311,0.00021765905,0.00007732267,0.000022635539,0.00004995604,0.00017086275,0.001052673],"genre_scores_gemma":[0.96114826,0.0007345238,0.033399817,0.00012998257,0.00015722222,0.00011749892,0.00025837723,0.00006452965,0.0039898613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877805,0.00025340257,0.00010005167,0.00034445693,0.0003992266,0.00012483033],"domain_scores_gemma":[0.99704176,0.0016704703,0.00051366613,0.00023382163,0.0004921284,0.00004800827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001848389,0.0009941653,0.0013313004,0.00059196644,0.0005615301,0.0014506709,0.0012919084,0.0016199896,0.00089263427],"category_scores_gemma":[0.0093861725,0.00065447734,0.00093235745,0.00064751366,0.0013238903,0.0014652718,0.0011011395,0.0012396289,0.00023419117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015988355,0.0000526403,0.00048377304,0.00019091718,0.00010750763,0.000117221,0.000098196484,0.9414897,0.0036818767,0.022160413,0.0005961979,0.030861747],"study_design_scores_gemma":[0.0000070936867,0.00002420745,0.00021084904,0.000005026437,0.000009974114,0.000009806677,0.000005566168,0.99518687,0.00065716845,0.0037223462,0.00015266727,0.000008514803],"about_ca_topic_score_codex":0.008527204,"about_ca_topic_score_gemma":0.0048381747,"teacher_disagreement_score":0.008527204,"about_ca_system_score_codex":0.0011716991,"about_ca_system_score_gemma":0.0012254092,"threshold_uncertainty_score":0.016955197},"labels":[],"label_agreement":null},{"id":"W2089594082","doi":"10.1016/s0165-1684(03)00091-4","title":"Moment-based fast discrete Hartley transform","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"University of Hong Kong; National Natural Science Foundation of China","keywords":"Discrete Hartley transform; Mathematics; Computation; Moment (physics); Sequence (biology); Computational complexity theory; Modular design; Hartley transform; Algorithm; Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis; Fourier transform; Physics","score_opus":0.02330945482248602,"score_gpt":0.26721630421799203,"score_spread":0.243906849395506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089594082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006924745,0.00018827412,0.98970544,0.00010627895,0.00007128525,0.000010883431,0.000047422447,0.00034308707,0.0026025102],"genre_scores_gemma":[0.32459417,0.000761421,0.6630415,0.00023413682,0.00022339041,0.000060658807,0.00041127752,0.00025785255,0.010415717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996965,0.00007107239,0.000012683727,0.00003918647,0.00015841564,0.000022275797],"domain_scores_gemma":[0.99941206,0.00024179507,0.000060057624,0.0001265093,0.00012973399,0.000029824705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041184417,0.00044806395,0.00045582163,0.00058873196,0.00023603319,0.00092199043,0.00047045067,0.00078946113,0.0046559363],"category_scores_gemma":[0.0017129398,0.0002226145,0.00033443287,0.00069640647,0.0003632857,0.0012871773,0.00052306073,0.00079620356,0.0015532544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074771803,0.00009169405,0.00072673307,0.00021895338,0.0000710723,0.00024402152,0.0001231217,0.11461555,0.12747912,0.24902089,0.0059238984,0.5007372],"study_design_scores_gemma":[0.00003607151,0.00011923953,0.00054803386,0.000020764915,0.00002546496,0.00040183825,0.000016463884,0.92892027,0.035631508,0.024215652,0.010021073,0.00004358156],"about_ca_topic_score_codex":0.00037361588,"about_ca_topic_score_gemma":0.00064257777,"teacher_disagreement_score":0.0046559363,"about_ca_system_score_codex":0.00030273086,"about_ca_system_score_gemma":0.0003299957,"threshold_uncertainty_score":0.015575647},"labels":[],"label_agreement":null},{"id":"W2091972047","doi":"10.1016/j.sigpro.2010.05.019","title":"Joint source-decoding in large scale sensor networks using Markov random field models","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Computer science; Markov process; Markov random field; Algorithm; Scalability; Joint (building); Markov chain; Quantization (signal processing); Vector quantization; Artificial intelligence; Mathematics; Machine learning; Statistics; Engineering","score_opus":0.016343662333652698,"score_gpt":0.2379779742394222,"score_spread":0.22163431190576952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091972047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008802316,0.00032026874,0.9898028,0.00027743026,0.000029419167,0.000020310157,0.00006728093,0.00018469247,0.0004955521],"genre_scores_gemma":[0.7262917,0.0017759197,0.26255688,0.00027376335,0.00027710426,0.00035105913,0.00068333914,0.00028478776,0.0075054527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980673,0.0009550231,0.000088619025,0.00036432705,0.00035572334,0.00016890936],"domain_scores_gemma":[0.9776595,0.019870562,0.00081073924,0.00075287046,0.00073845795,0.00016795254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042895665,0.001258619,0.0023248133,0.0011692195,0.00083881785,0.0018632236,0.0022736727,0.0022651528,0.0017433912],"category_scores_gemma":[0.020026024,0.0015977215,0.0010747557,0.0021181693,0.0025103074,0.0041281222,0.002192659,0.002204664,0.0005215985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089189,0.0000258894,0.00030963504,0.00006648989,0.000045857003,0.000057415302,0.00006276942,0.94401854,0.0005754486,0.039857503,0.0006432378,0.014247953],"study_design_scores_gemma":[0.000009140219,0.0000051141114,0.0000433122,0.000003766384,0.000005590508,0.00001089322,0.000004425232,0.97758627,0.0001974379,0.022032712,0.00009411338,0.0000071850386],"about_ca_topic_score_codex":0.007941352,"about_ca_topic_score_gemma":0.007519273,"teacher_disagreement_score":0.007941352,"about_ca_system_score_codex":0.0016618986,"about_ca_system_score_gemma":0.0018098622,"threshold_uncertainty_score":0.022685647},"labels":[],"label_agreement":null},{"id":"W2093238275","doi":"10.1016/j.sigpro.2010.12.005","title":"Some empirical advances in matrix completion","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Minification; Mathematical optimization; Matrix norm; Convex optimization; Matrix (chemical analysis); Sampling (signal processing); Mathematics; Low-rank approximation; Algorithm; Norm (philosophy); Regular polygon; Optimization problem; Sparse matrix; Computer science","score_opus":0.017014906061336873,"score_gpt":0.2983029703516247,"score_spread":0.2812880642902878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093238275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008334234,0.04242467,0.9116386,0.011643732,0.0011446979,0.000039804778,0.00034250403,0.00015496375,0.024276737],"genre_scores_gemma":[0.32063216,0.1028376,0.52294946,0.004201279,0.018142195,0.00032523304,0.0013645932,0.00044901785,0.029098509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973558,0.0013462208,0.00015351856,0.00033666176,0.0007052546,0.0001025368],"domain_scores_gemma":[0.9786323,0.016201349,0.00062446337,0.0020044877,0.0022139149,0.00032346504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00860759,0.0013770845,0.0011261296,0.0023562305,0.001000708,0.0026780306,0.0018556057,0.0016985752,0.0050103175],"category_scores_gemma":[0.0377465,0.000848622,0.0010604004,0.004075509,0.005275335,0.006529013,0.0026875301,0.0060197967,0.0010895219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003706841,0.00005616011,0.00063561863,0.00030164773,0.000036424248,0.000059012655,0.00015621542,0.0113316085,0.00032737866,0.9207883,0.010835297,0.055435166],"study_design_scores_gemma":[0.0000152345365,0.000036929247,0.0006301867,0.00012311898,0.00002071464,0.00013144664,0.000059121376,0.06726256,0.00034325485,0.9046232,0.026727619,0.000026670874],"about_ca_topic_score_codex":0.0025349439,"about_ca_topic_score_gemma":0.0020206114,"teacher_disagreement_score":0.00860759,"about_ca_system_score_codex":0.0013866574,"about_ca_system_score_gemma":0.0015938606,"threshold_uncertainty_score":0.045521855},"labels":[],"label_agreement":null},{"id":"W2100344887","doi":"10.1016/j.sigpro.2013.05.003","title":"Oversampled perfect reconstruction DFT modulated filter banks for multi-carrier transceiver systems","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyphase system; Additive white Gaussian noise; Filter bank; Carrier frequency offset; Algorithm; Orthogonal frequency-division multiplexing; Electronic engineering; Transceiver; Mathematics; Parametric statistics; Computer science; Prototype filter; Topology (electrical circuits); Filter (signal processing); Filter design; Channel (broadcasting); Frequency offset; Telecommunications; Wireless; Engineering","score_opus":0.028981199299515176,"score_gpt":0.23962612420912896,"score_spread":0.21064492490961378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100344887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03523353,0.00065737695,0.96070015,0.00017916872,0.00006225698,0.00001843334,0.000053610707,0.00030482683,0.0027906643],"genre_scores_gemma":[0.49925795,0.0011068088,0.49226755,0.00016625192,0.00013310989,0.000049023023,0.00020658465,0.00006969544,0.006743148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975806,0.000079012345,0.000012384552,0.000027557944,0.00010564755,0.000017417946],"domain_scores_gemma":[0.9996244,0.00017796282,0.000035389145,0.000086435546,0.00006812262,0.000007660076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409469,0.00042250648,0.0002849094,0.00022297988,0.00018833719,0.00046371573,0.00028205477,0.00053289556,0.0022640591],"category_scores_gemma":[0.0014127203,0.00021335045,0.00016070173,0.00032298258,0.0002560279,0.0005499031,0.000291302,0.00045742994,0.000637122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006018699,0.00013572094,0.001001303,0.0003170904,0.00007893313,0.00028985518,0.00023167612,0.11463646,0.23655419,0.042816304,0.0035504855,0.59978604],"study_design_scores_gemma":[0.000032678294,0.00019737231,0.0011115453,0.000052361338,0.000046100704,0.0004907659,0.00004621859,0.8790294,0.102987505,0.007893565,0.008089845,0.00002281515],"about_ca_topic_score_codex":0.0004185572,"about_ca_topic_score_gemma":0.0009936128,"teacher_disagreement_score":0.0022640591,"about_ca_system_score_codex":0.0001782657,"about_ca_system_score_gemma":0.00027766803,"threshold_uncertainty_score":0.007574022},"labels":[],"label_agreement":null},{"id":"W2107023572","doi":"10.1016/j.sigpro.2011.09.035","title":"ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Equalization (audio); Computer science; Channel (broadcasting); Viterbi algorithm; Algorithm; Adaptive equalizer; Maximum likelihood sequence estimation; Intersymbol interference; Sparse approximation; Sequence (biology); Estimation theory; Decoding methods; Telecommunications","score_opus":0.07973093308475858,"score_gpt":0.3067964404288097,"score_spread":0.22706550734405112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107023572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008854208,0.00019156116,0.9896337,0.00006444884,0.000028575962,0.000008587787,0.000020462909,0.00019027173,0.0010082138],"genre_scores_gemma":[0.36968794,0.0011598129,0.6248455,0.00010759603,0.00023778678,0.00006200389,0.00019618038,0.00014209084,0.0035611144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.00008183323,0.000012608072,0.000031389318,0.000083655534,0.000014983999],"domain_scores_gemma":[0.99888307,0.0007077816,0.00006200974,0.000094195726,0.0002235829,0.000029348765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005642699,0.0004825764,0.00041487496,0.00058059284,0.0002489302,0.00038371462,0.00032231663,0.0005952025,0.0014571748],"category_scores_gemma":[0.0032275517,0.00025280542,0.00026222406,0.0008973436,0.0004850809,0.00093164935,0.0005232682,0.00054537645,0.00057123834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058013515,0.00012240051,0.0017259058,0.00035766631,0.00008999506,0.00020149683,0.0002950743,0.2355009,0.15572618,0.043145034,0.0023272429,0.5599279],"study_design_scores_gemma":[0.000011615413,0.00005641335,0.0005824786,0.0000134445545,0.000021977785,0.0001265587,0.00001450724,0.96985257,0.022071617,0.005827103,0.0014004526,0.000021261352],"about_ca_topic_score_codex":0.00080964866,"about_ca_topic_score_gemma":0.0010989944,"teacher_disagreement_score":0.0014571748,"about_ca_system_score_codex":0.00013955381,"about_ca_system_score_gemma":0.0004060928,"threshold_uncertainty_score":0.004874766},"labels":[],"label_agreement":null},{"id":"W2130302745","doi":"10.1016/j.sigpro.2012.11.012","title":"Outage-based design of robust Tomlinson–Harashima transceivers for the MISO downlink with QoS requirements","year":2013,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of British Columbia","funders":"","keywords":"Telecommunications link; Probabilistic logic; Quality of service; Computer science; Transceiver; Mathematical optimization; Transmitter; Channel (broadcasting); Channel state information; Computer network; Mathematics; Wireless; Telecommunications","score_opus":0.03183494789118279,"score_gpt":0.23033139524182,"score_spread":0.1984964473506372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130302745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028892193,0.0005389894,0.9660688,0.00023585076,0.00006007192,0.000037663027,0.000042110092,0.00016710916,0.0039572148],"genre_scores_gemma":[0.9172799,0.00048408957,0.07952887,0.00014677952,0.0000725621,0.00009102473,0.000060597566,0.00004852393,0.00228752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00014292818,0.00001867953,0.000071495,0.00012090127,0.000057591566],"domain_scores_gemma":[0.99921536,0.00037549232,0.00012666378,0.00005216432,0.0001909162,0.000039397328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153674,0.0011199004,0.0008117723,0.0003287193,0.00034269816,0.00097439974,0.0007727635,0.0009950162,0.0017191923],"category_scores_gemma":[0.0028946372,0.00054046937,0.00038864883,0.0003324917,0.0005652902,0.00062452146,0.0007874933,0.0006537613,0.0004255236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020664357,0.000041317242,0.0005929764,0.00013982457,0.0000818257,0.00013748674,0.00016597216,0.91941065,0.02116106,0.016684607,0.0012517864,0.040125854],"study_design_scores_gemma":[0.000013170102,0.000078754885,0.00011035186,0.000008712846,0.000015482796,0.000036531528,0.000017917351,0.9951851,0.0020650413,0.0019662743,0.000492617,0.00001003738],"about_ca_topic_score_codex":0.0015032551,"about_ca_topic_score_gemma":0.0021837282,"teacher_disagreement_score":0.0017191923,"about_ca_system_score_codex":0.0006966614,"about_ca_system_score_gemma":0.0009908103,"threshold_uncertainty_score":0.005751312},"labels":[],"label_agreement":null},{"id":"W2152904516","doi":"10.1016/s0165-1684(03)00058-6","title":"On the geodesic paths approach to color image filtering","year":2003,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geodesic; Filter (signal processing); Mathematics; Median filter; Noise reduction; Noise (video); Gaussian noise; Bilateral filter; Computer vision; Reduction (mathematics); Algorithm; Image (mathematics); Artificial intelligence; Computer science; Image processing","score_opus":0.03313710968084864,"score_gpt":0.27262792181480827,"score_spread":0.23949081213395962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152904516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029465596,0.0005832563,0.99342465,0.00024997134,0.00007082501,0.000013221718,0.000036354988,0.00012140297,0.0025537228],"genre_scores_gemma":[0.119497515,0.0052187853,0.8479445,0.00039496284,0.00043814568,0.00012268878,0.00037591133,0.0006497584,0.025357729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957794,0.00017280727,0.000018740537,0.00007994662,0.00012276036,0.000027838683],"domain_scores_gemma":[0.99905735,0.0005071691,0.000059109367,0.000105105864,0.00021638388,0.00005488904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010961561,0.0011122767,0.0007987775,0.0019629009,0.0006898972,0.0013745747,0.0012224021,0.0015672491,0.0045468756],"category_scores_gemma":[0.0037343288,0.000573466,0.0008821473,0.0020724337,0.0017877044,0.0024130808,0.0019092608,0.0020154908,0.0011334254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007742277,0.00003704105,0.00029654297,0.00010693108,0.00005223705,0.00008276037,0.00018880659,0.088520765,0.004395951,0.76594156,0.0042708707,0.13602908],"study_design_scores_gemma":[0.000014681434,0.000033429114,0.00020366916,0.000022765607,0.00001948351,0.00006386953,0.00003225195,0.40485376,0.00114784,0.58168966,0.011888683,0.000029881905],"about_ca_topic_score_codex":0.0069231438,"about_ca_topic_score_gemma":0.0062320237,"teacher_disagreement_score":0.0069231438,"about_ca_system_score_codex":0.0008997687,"about_ca_system_score_gemma":0.0008696669,"threshold_uncertainty_score":0.015210807},"labels":[],"label_agreement":null},{"id":"W2154286128","doi":"10.1016/j.sigpro.2004.04.006","title":"A novel signal-processing strategy for hearing-aid design: neurocompensation","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Hearing Loss and Rehabilitation","field":"Neuroscience","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hearing aid; Signal processing; Computer science; Speech recognition; SIGNAL (programming language); Digital signal processing; Engineering; Computer hardware; Electrical engineering","score_opus":0.1288607306261344,"score_gpt":0.3317964600104142,"score_spread":0.20293572938427978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154286128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01189894,0.0002377082,0.9819933,0.00010696348,0.00008311843,0.00004870894,0.000012641302,0.0002218147,0.0053968458],"genre_scores_gemma":[0.52614146,0.00047352767,0.46481273,0.00033820394,0.00015222692,0.00015129615,0.000047459347,0.00008647479,0.007796583],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983954,0.000029291821,0.000011383441,0.000045371868,0.0000567657,0.000017620278],"domain_scores_gemma":[0.99982315,0.00005700314,0.000012759077,0.000017433056,0.000075570344,0.000014169109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021327684,0.0008422743,0.00033289898,0.0002832267,0.00034602592,0.0007915794,0.0007140525,0.000962313,0.0036452194],"category_scores_gemma":[0.00050838204,0.0002130303,0.0002737945,0.00019334217,0.00029630944,0.00061700924,0.00043199005,0.00040976977,0.00094290747],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034652642,0.00030348325,0.00033612753,0.00029112113,0.00006574593,0.00033483977,0.000102443526,0.048113182,0.50895065,0.02688237,0.0018583608,0.41241515],"study_design_scores_gemma":[0.000057776328,0.00056300237,0.00064099755,0.00004873739,0.00008855932,0.0008641192,0.000040608717,0.88180435,0.09880407,0.010007872,0.0070359767,0.000043951142],"about_ca_topic_score_codex":0.00044836925,"about_ca_topic_score_gemma":0.0013138038,"teacher_disagreement_score":0.0036452194,"about_ca_system_score_codex":0.00020411242,"about_ca_system_score_gemma":0.00035958012,"threshold_uncertainty_score":0.012194455},"labels":[],"label_agreement":null},{"id":"W2164283738","doi":"10.1016/j.sigpro.2012.04.014","title":"A robust detector of known signal in non-Gaussian noise using threshold systems","year":2012,"lang":"en","type":"article","venue":"Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Gaussian noise; Probability density function; Noise (video); Detector; Value noise; Detection theory; Noise spectral density; Noise measurement; Additive white Gaussian noise; Robustness (evolution); Gradient noise; Matched filter; White noise; Mathematics; Algorithm; Gaussian; Noise floor; Computer science; Statistics; Noise reduction; Noise figure; Artificial intelligence; Physics; Telecommunications; Bandwidth (computing)","score_opus":0.03320405632123942,"score_gpt":0.2486538770088694,"score_spread":0.21544982068762997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164283738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005507086,0.0002089691,0.9932515,0.00011911868,0.00007578514,0.000024898936,0.000029878296,0.0003601523,0.00042266372],"genre_scores_gemma":[0.23926237,0.00041278306,0.75610614,0.00040616645,0.00022255747,0.00013030942,0.00017046134,0.00015971053,0.0031295458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983638,0.00035340656,0.000096246375,0.0004933069,0.0005703454,0.00012289172],"domain_scores_gemma":[0.99785197,0.0010323719,0.00018947116,0.0003386688,0.0004660019,0.000121516336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021723176,0.0009793334,0.0018747662,0.001005962,0.00055692485,0.0020306932,0.001612678,0.0025722587,0.001428526],"category_scores_gemma":[0.0058034454,0.00062675244,0.00086827093,0.0010420161,0.0010810349,0.0024667578,0.0021605191,0.0014979123,0.0010189639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012130584,0.00030181333,0.0018784429,0.0005973206,0.00044471852,0.00044322517,0.00026382582,0.11422804,0.30611303,0.14347534,0.0053671235,0.42567402],"study_design_scores_gemma":[0.000062302504,0.00022510748,0.0005477718,0.000023557574,0.00008895514,0.0004373213,0.00001654485,0.9253976,0.044855442,0.025605153,0.0026731794,0.000067071596],"about_ca_topic_score_codex":0.00046498276,"about_ca_topic_score_gemma":0.000757586,"teacher_disagreement_score":0.0025722587,"about_ca_system_score_codex":0.0007544912,"about_ca_system_score_gemma":0.0011865321,"threshold_uncertainty_score":0.011488497},"labels":[],"label_agreement":null},{"id":"W2273269588","doi":"10.1016/j.sigpro.2016.01.016","title":"Rotation invariant HOG for object localization in web images","year":2016,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Invariant (physics); Histogram; Computer vision; Robustness (evolution); Histogram of oriented gradients; Rotation (mathematics); Computer science; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Mathematics; Feature extraction; Image (mathematics)","score_opus":0.018785604059985157,"score_gpt":0.2912272856869152,"score_spread":0.27244168162693005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273269588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08563995,0.0021206427,0.9019285,0.00023209085,0.00017367756,0.00015502603,0.0010107801,0.0047649164,0.003974395],"genre_scores_gemma":[0.5733815,0.0019282448,0.41002694,0.00020538569,0.00012068949,0.00012743534,0.0025255564,0.0003442612,0.011339911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985003,0.00001710486,0.000005968978,0.000034547986,0.000058111305,0.00003413276],"domain_scores_gemma":[0.99988234,0.00001951267,0.000010862974,0.00003079206,0.000042835592,0.0000137216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019707187,0.000386708,0.0005381474,0.0012070438,0.00020248687,0.00043646857,0.0004911345,0.00035064312,0.003240454],"category_scores_gemma":[0.00053133664,0.00021063245,0.00030107354,0.0011274425,0.00022458527,0.0006061722,0.00054825604,0.0004315659,0.0017332301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034457253,0.00017925943,0.001416397,0.00018725054,0.000057569763,0.00016426474,0.000031835578,0.023846546,0.16671067,0.0028718447,0.009610141,0.79457957],"study_design_scores_gemma":[0.000035491965,0.00018646006,0.007644184,0.000032187145,0.000052746625,0.00033304802,0.00008376695,0.8924051,0.08560336,0.0056148465,0.007977712,0.000031155047],"about_ca_topic_score_codex":0.0037918356,"about_ca_topic_score_gemma":0.0060924287,"teacher_disagreement_score":0.0037918356,"about_ca_system_score_codex":0.0003103811,"about_ca_system_score_gemma":0.0004375832,"threshold_uncertainty_score":0.010840416},"labels":[],"label_agreement":null},{"id":"W2363380895","doi":"","title":"A Group Target Data Association Algorithm Based On D-S evidence theory","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Measurement and Detection Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Association (psychology); Group (periodic table); Matching (statistics); Algorithm; Function (biology); Feature (linguistics); Composition (language); Object (grammar); Computer science; Association scheme; Assignment problem; Data association; Pattern recognition (psychology); Mathematics; Artificial intelligence; Mathematical optimization; Statistics; Combinatorics","score_opus":0.11050778456377704,"score_gpt":0.3000194647845649,"score_spread":0.1895116802207879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363380895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004903256,0.00007336403,0.994027,0.000060408125,0.000025208885,0.00003840774,0.000017852215,0.00019043907,0.0006639656],"genre_scores_gemma":[0.1818343,0.00028489402,0.81379235,0.00012265825,0.00007319315,0.00024130015,0.00025079428,0.000055941255,0.0033445535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984395,0.00024540027,0.0001063835,0.0003806974,0.0007292595,0.00009878108],"domain_scores_gemma":[0.9986902,0.00045429126,0.00014426823,0.00014477197,0.000505129,0.00006133031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014360134,0.0006282314,0.001049448,0.002131068,0.0008960398,0.0011604092,0.0015028457,0.001097675,0.0018039218],"category_scores_gemma":[0.0045362287,0.00042164102,0.0009460656,0.0021333091,0.0007338231,0.0023654015,0.0018958785,0.0011670676,0.0007488678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025795962,0.00012308966,0.003115187,0.0001480548,0.00011914249,0.00013222957,0.00024469147,0.11279032,0.013948531,0.033068374,0.002962794,0.83308965],"study_design_scores_gemma":[0.000056216657,0.000109105604,0.0010312179,0.000017245127,0.000043243497,0.0003015023,0.00006357128,0.96735173,0.009524069,0.0161989,0.0052597555,0.000043488206],"about_ca_topic_score_codex":0.003086477,"about_ca_topic_score_gemma":0.0017330799,"teacher_disagreement_score":0.003086477,"about_ca_system_score_codex":0.0007348876,"about_ca_system_score_gemma":0.0015275504,"threshold_uncertainty_score":0.007594466},"labels":[],"label_agreement":null},{"id":"W2377974534","doi":"","title":"An Improved Method of Ghost Correction Algorithm for EPI","year":2007,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Algorithm; Homogeneity (statistics); Image quality; Echo-planar imaging; Imaging phantom; ENCODE; Reliability (semiconductor); Computer science; Degenerate energy levels; Artificial intelligence; Image (mathematics); Computer vision; Physics; Optics","score_opus":0.021481947656575247,"score_gpt":0.3987591442271921,"score_spread":0.37727719657061687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377974534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080462015,0.00023654639,0.99764913,0.00008469262,0.00015728305,0.00003412815,0.000036107096,0.00060219056,0.0003952073],"genre_scores_gemma":[0.0069405953,0.00024486758,0.99000216,0.00009116125,0.00008297992,0.000076836004,0.00019319369,0.00019978001,0.0021684146],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983796,0.0003076988,0.00011621234,0.00030362455,0.00081649754,0.00007642863],"domain_scores_gemma":[0.9983027,0.00027292088,0.00009996325,0.00028422396,0.0009856402,0.00005449512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014214829,0.0011901871,0.0010163501,0.001170297,0.0007866424,0.0010160073,0.0018356065,0.0016415461,0.0046129255],"category_scores_gemma":[0.0033697449,0.0005269756,0.0009902753,0.0015125507,0.00047429898,0.001800093,0.0011844577,0.0025689076,0.0031553213],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028784195,0.000085146465,0.00075007544,0.00038214264,0.000173638,0.0002212638,0.00020855668,0.024204588,0.084235646,0.020609943,0.018001253,0.85083985],"study_design_scores_gemma":[0.00014653454,0.0002322296,0.001820393,0.000064364096,0.00017785601,0.0024880115,0.000047147118,0.7269188,0.1130269,0.009978694,0.14480984,0.00028930343],"about_ca_topic_score_codex":0.0021400067,"about_ca_topic_score_gemma":0.0026792255,"teacher_disagreement_score":0.0046129255,"about_ca_system_score_codex":0.0004319894,"about_ca_system_score_gemma":0.0016260813,"threshold_uncertainty_score":0.015431762},"labels":[],"label_agreement":null},{"id":"W2380159924","doi":"","title":"The Moving Object Detection based on Local Hierarchical GMM","year":2009,"lang":"en","type":"article","venue":"Signal Processing","topic":"Remote Sensing and Land Use","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Mixture model; Artificial intelligence; Dispose pattern; Computer science; Pattern recognition (psychology); Block (permutation group theory); Object detection; Computer vision; Process (computing); Pixel; Mathematics","score_opus":0.008985493593931698,"score_gpt":0.21043760370581435,"score_spread":0.20145211011188266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380159924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015482308,0.00029700922,0.981487,0.00007217676,0.000041868898,0.000030879226,0.00007761023,0.001421261,0.0010899097],"genre_scores_gemma":[0.3859001,0.0005404539,0.6085787,0.00011802768,0.000077111945,0.00008975982,0.00036139248,0.00025581877,0.0040786555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999401,0.00013469868,0.000021041562,0.0001754719,0.00018655209,0.000081165985],"domain_scores_gemma":[0.9996296,0.00011064087,0.000027916321,0.000055147528,0.00015069531,0.00002595789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008390041,0.00052940834,0.0007956128,0.0010963284,0.00032871525,0.00050982035,0.00075008307,0.00045785395,0.001337105],"category_scores_gemma":[0.0017869107,0.00031811508,0.00066851854,0.00076446135,0.00035839036,0.0010743006,0.00060415233,0.0005910788,0.0007544851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021258993,0.00007207442,0.0027225323,0.00013681574,0.00010417042,0.00010673863,0.00017996976,0.06803998,0.059594184,0.008741382,0.0048054354,0.85528415],"study_design_scores_gemma":[0.000016201626,0.00006995916,0.0040675653,0.000011930711,0.000059293736,0.00014903315,0.00003903079,0.9629209,0.024071608,0.0044757575,0.0040707397,0.000048032914],"about_ca_topic_score_codex":0.008519515,"about_ca_topic_score_gemma":0.0072203972,"teacher_disagreement_score":0.008519515,"about_ca_system_score_codex":0.0006381746,"about_ca_system_score_gemma":0.00080546056,"threshold_uncertainty_score":0.016939878},"labels":[],"label_agreement":null},{"id":"W2406034201","doi":"10.1016/j.sigpro.2016.05.018","title":"A study on image denoising in contourlet domain using the alpha-stable family of distributions","year":2016,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Contourlet; Mathematics; Noise reduction; Maximum a posteriori estimation; Prior probability; Univariate; Pattern recognition (psychology); Artificial intelligence; Wavelet; Estimator; Noise (video); Bivariate analysis; Generalized normal distribution; Algorithm; Bayesian probability; Statistics; Image (mathematics); Computer science; Wavelet transform; Multivariate statistics; Normal distribution; Maximum likelihood","score_opus":0.045358107193626596,"score_gpt":0.3249399175778486,"score_spread":0.27958181038422203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406034201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052925985,0.0033580442,0.93589735,0.00034093697,0.00010702357,0.000021503864,0.000020665966,0.00006264803,0.0072658896],"genre_scores_gemma":[0.8012346,0.011465766,0.1700249,0.00028646935,0.00052119995,0.000045146786,0.00010229626,0.00018189696,0.016137794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995782,0.00013994564,0.000016158947,0.000072038936,0.00016780251,0.00002586846],"domain_scores_gemma":[0.99781764,0.0013647453,0.00011156135,0.00014760939,0.00048186758,0.00007660899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016592637,0.00048516304,0.0004383054,0.0007143612,0.000366223,0.00079149986,0.00051040895,0.0008069671,0.001117691],"category_scores_gemma":[0.0039776447,0.00023725156,0.0007003339,0.0007033592,0.00086049264,0.0014079182,0.00046946204,0.00097575755,0.00030467837],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034225849,0.0001970254,0.002987587,0.00043247952,0.00014610341,0.0006778531,0.00054592645,0.110262774,0.061218586,0.6337937,0.0034383868,0.18595725],"study_design_scores_gemma":[0.000017707556,0.00021307397,0.0014045244,0.00004819843,0.000053621967,0.0011295124,0.00009008209,0.9051613,0.016808659,0.0666005,0.008441432,0.000031278967],"about_ca_topic_score_codex":0.00052612415,"about_ca_topic_score_gemma":0.00026099788,"teacher_disagreement_score":0.0016592637,"about_ca_system_score_codex":0.0003443013,"about_ca_system_score_gemma":0.00030340007,"threshold_uncertainty_score":0.008775115},"labels":[],"label_agreement":null},{"id":"W2570372101","doi":"10.1016/j.sigpro.2017.01.001","title":"Gaussian filters for parameter and state estimation: A general review of theory and recent trends","year":2017,"lang":"en","type":"review","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; McMaster University","funders":"","keywords":"Computer science; Parametric statistics; Robustness (evolution); Gaussian; Gaussian noise; Kalman filter; Estimation theory; Nonlinear system; State (computer science); Noise (video); Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Control (management); Statistics","score_opus":0.08643494222221643,"score_gpt":0.3790179068213947,"score_spread":0.29258296459917826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570372101","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024263521,0.98697484,0.009635862,0.0007820448,0.00058865966,0.000013515589,0.00005303784,0.00003676701,0.0016727124],"genre_scores_gemma":[0.0023003323,0.9899974,0.0051972736,0.00043002123,0.001142337,0.00001799624,0.000077764336,0.000012824858,0.00082414405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993197,0.00011031035,0.000084500156,0.00012617989,0.0003153533,0.00004408765],"domain_scores_gemma":[0.99717015,0.0018525616,0.00016020135,0.00010875935,0.0006405842,0.00006765346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021275138,0.0013321394,0.0020594902,0.0028486957,0.0003096782,0.0018804291,0.0020163928,0.002428451,0.0036790716],"category_scores_gemma":[0.004158358,0.00057839317,0.0007356773,0.0055056466,0.0014239901,0.003381388,0.0010345737,0.002331708,0.0026850086],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005573848,0.00008327914,0.0003996467,0.00857785,0.000096954835,0.00010829543,0.00007008107,0.0017466608,0.0011221947,0.026154665,0.025178544,0.936406],"study_design_scores_gemma":[0.000029184663,0.0001797025,0.0012301424,0.0041424865,0.00018018488,0.0013746757,0.00011188404,0.0034240775,0.0018360743,0.035958473,0.9514177,0.00011547998],"about_ca_topic_score_codex":0.0029520781,"about_ca_topic_score_gemma":0.0024939931,"teacher_disagreement_score":0.0036790716,"about_ca_system_score_codex":0.0010512518,"about_ca_system_score_gemma":0.002161172,"threshold_uncertainty_score":0.0123077035},"labels":[],"label_agreement":null},{"id":"W2617877636","doi":"10.1016/j.sigpro.2017.05.019","title":"A projection matrix design method for MSE reduction in adaptive compressive sensing","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"China Postdoctoral Science Foundation","keywords":"Compressed sensing; Matrix (chemical analysis); Projection (relational algebra); Algorithm; SIGNAL (programming language); Sparse matrix; Mean squared error; Mathematics; Mathematical optimization; Dykstra's projection algorithm; Reduction (mathematics); Signal reconstruction; Optimization problem; Signal processing; Computer science; Statistics","score_opus":0.05996828308211537,"score_gpt":0.33565830647334516,"score_spread":0.2756900233912298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617877636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034836907,0.0000384514,0.9992587,0.000024799396,0.000020303065,0.0000116156525,0.000009404525,0.00004730934,0.00024103417],"genre_scores_gemma":[0.030645575,0.00025437662,0.96648616,0.00007836985,0.00008727885,0.00015546662,0.000078732795,0.000078391,0.0021357173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993704,0.00020240343,0.000028469012,0.00009519248,0.00028191129,0.000021671824],"domain_scores_gemma":[0.99922717,0.0003664902,0.000043666485,0.00009591453,0.0002361646,0.000030513263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080482714,0.0010546544,0.00066830066,0.00039047597,0.00037220755,0.00055289955,0.00068099133,0.00093118515,0.0044819103],"category_scores_gemma":[0.002611353,0.0004430119,0.0006199622,0.00066253764,0.00055375317,0.00087854284,0.0008813458,0.0016169901,0.0013683178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029364938,0.00019221833,0.00028368583,0.0005040298,0.00010984111,0.00014810536,0.00016459097,0.16379325,0.09655831,0.06022968,0.007911966,0.66981065],"study_design_scores_gemma":[0.000038878283,0.00019771476,0.00016077177,0.000025759102,0.000027316306,0.00020882761,0.000018134633,0.96564376,0.015801575,0.010900883,0.0069477754,0.000028650076],"about_ca_topic_score_codex":0.0007609697,"about_ca_topic_score_gemma":0.0011914723,"teacher_disagreement_score":0.0044819103,"about_ca_system_score_codex":0.00019806935,"about_ca_system_score_gemma":0.00069757627,"threshold_uncertainty_score":0.014993489},"labels":[],"label_agreement":null},{"id":"W2621841016","doi":"10.1016/j.sigpro.2017.05.030","title":"LMAE: A large margin Auto-Encoders for classification","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China University of Petroleum, Beijing; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Softmax function; MNIST database; Encoder; Pattern recognition (psychology); Computer science; Artificial intelligence; Classifier (UML); Discriminative model; Margin (machine learning); Artificial neural network; Feature learning; Deep learning; Autoencoder; Algorithm; Machine learning","score_opus":0.048342974523918676,"score_gpt":0.33014132792545486,"score_spread":0.2817983534015362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621841016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004424834,0.00079644274,0.98644024,0.0002653794,0.00022605131,0.00005922844,0.00056817615,0.005881602,0.0013380293],"genre_scores_gemma":[0.13015415,0.0008165929,0.84030426,0.00089822314,0.00032327016,0.0003748038,0.0032733977,0.00095179747,0.022903506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990471,0.00031038697,0.00006007722,0.00022869282,0.00026948735,0.00008424267],"domain_scores_gemma":[0.9986731,0.00055330707,0.00005318428,0.0003165424,0.0003246639,0.000079220015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015324404,0.0011782516,0.0010977293,0.00067978783,0.00050544477,0.0010388334,0.0021024144,0.001601815,0.011182365],"category_scores_gemma":[0.0040912605,0.00060024485,0.00082372,0.0009015138,0.00038995093,0.0021829302,0.0021453726,0.0031308732,0.008801141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045109322,0.0002151121,0.00045085757,0.00013012774,0.000084200634,0.00007647788,0.000052807416,0.034576226,0.014610949,0.0111062,0.025935445,0.9123105],"study_design_scores_gemma":[0.000042850203,0.00010302332,0.00031279714,0.000038644062,0.000026263442,0.00007934171,0.000020820165,0.9573479,0.015792202,0.013461536,0.0127458675,0.00002877584],"about_ca_topic_score_codex":0.003282546,"about_ca_topic_score_gemma":0.0065920227,"teacher_disagreement_score":0.011182365,"about_ca_system_score_codex":0.00041251292,"about_ca_system_score_gemma":0.0010664789,"threshold_uncertainty_score":0.03740877},"labels":[],"label_agreement":null},{"id":"W2781206324","doi":"10.1016/j.sigpro.2017.12.019","title":"Expectation maximization estimation for a class of input nonlinear state space systems by using the Kalman smoother","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Kalman filter; Nonlinear system; Class (philosophy); State space; Mathematics; Moving horizon estimation; State (computer science); State-space representation; Expectation–maximization algorithm; Extended Kalman filter; Computer science; Control theory (sociology); Algorithm; Mathematical optimization; Maximum likelihood; Artificial intelligence; Statistics; Physics","score_opus":0.01750845884092055,"score_gpt":0.25669381709156763,"score_spread":0.23918535825064707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781206324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017104458,0.00018511304,0.9820393,0.000096982345,0.000011239473,0.0000064502806,0.000021509612,0.0001087491,0.00042616887],"genre_scores_gemma":[0.81786364,0.00070311164,0.17671868,0.00005496565,0.00007110208,0.00005423252,0.00024248514,0.00010121731,0.004190649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969065,0.00011311352,0.00001858479,0.00006994529,0.00007838867,0.000029316074],"domain_scores_gemma":[0.9988053,0.00089955196,0.00009441421,0.00007272195,0.000108034896,0.000020051799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012004365,0.00043530593,0.0007599663,0.00029459823,0.0002608969,0.00066653744,0.0005175181,0.0006140472,0.0006216203],"category_scores_gemma":[0.0043484764,0.00026017008,0.0005766263,0.00041261892,0.00047313442,0.0009171924,0.00056067336,0.0009938693,0.00017427077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026910324,0.00008235105,0.0021505493,0.00020466106,0.00016827897,0.00010785199,0.00024758087,0.8022414,0.009957291,0.06967228,0.0013416536,0.11355698],"study_design_scores_gemma":[0.0000042295355,0.000008031096,0.00020535255,0.000002370745,0.0000045444112,0.000008744683,0.0000027249089,0.99440867,0.00038385036,0.0047560143,0.00021150374,0.0000039572587],"about_ca_topic_score_codex":0.0038869348,"about_ca_topic_score_gemma":0.0030442628,"teacher_disagreement_score":0.0038869348,"about_ca_system_score_codex":0.0003804702,"about_ca_system_score_gemma":0.0005667487,"threshold_uncertainty_score":0.0077286363},"labels":[],"label_agreement":null},{"id":"W2809327114","doi":"10.1016/j.sigpro.2018.06.014","title":"Student-t mixture labeled multi-Bernoulli filter for multi-target tracking with heavy-tailed noise","year":2018,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Filter (signal processing); Tracking (education); Recursion (computer science); Bernoulli's principle; Noise (video); Gaussian; Computer science; Algorithm; Process (computing); State (computer science); Control theory (sociology); Mathematics; Artificial intelligence; Engineering; Physics; Computer vision; Image (mathematics)","score_opus":0.03929378938253014,"score_gpt":0.30457358625424447,"score_spread":0.2652797968717143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809327114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001213455,0.00013148587,0.99818677,0.00005579915,0.000044430744,0.000013330494,0.000029705561,0.00017671181,0.00014828026],"genre_scores_gemma":[0.15781902,0.0009548524,0.83009917,0.00045271326,0.000297815,0.00045765238,0.0011790353,0.00024580833,0.008493958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997399,0.00083838514,0.00016459623,0.00067259284,0.0006960307,0.00022947293],"domain_scores_gemma":[0.9945074,0.0031976954,0.00033883794,0.00063409656,0.0011502554,0.00017175614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052105393,0.0014229395,0.0022267373,0.0012518585,0.000972128,0.0012827892,0.0029962172,0.0037630803,0.0031204415],"category_scores_gemma":[0.015473464,0.0013715377,0.0016984629,0.0019633726,0.0016338868,0.0024568406,0.0024419425,0.0034848894,0.0025676214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009429929,0.00019497394,0.0016190374,0.0004398799,0.00027426775,0.00016190813,0.0002391857,0.6338801,0.010832,0.062075607,0.005201974,0.284138],"study_design_scores_gemma":[0.000011913987,0.000022507875,0.000153797,0.000010708103,0.000015675134,0.000028050266,0.0000057845045,0.9922915,0.0011470098,0.005580234,0.00071589224,0.000016983082],"about_ca_topic_score_codex":0.008512848,"about_ca_topic_score_gemma":0.008555927,"teacher_disagreement_score":0.008512848,"about_ca_system_score_codex":0.0013544313,"about_ca_system_score_gemma":0.0029820492,"threshold_uncertainty_score":0.02755624},"labels":[],"label_agreement":null},{"id":"W2894788163","doi":"10.1016/j.sigpro.2018.09.040","title":"Modeling of multiple-input, time-varying systems with recursively estimated basis expansions","year":2018,"lang":"en","type":"article","venue":"Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hyperparameter; Estimator; Kalman filter; Computer science; Algorithm; Computation; Nonlinear system; Recursive least squares filter; Mathematical optimization; Mathematics; Adaptive filter; Artificial intelligence; Statistics","score_opus":0.0210062687376145,"score_gpt":0.2351338906339744,"score_spread":0.21412762189635992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894788163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046798706,0.00023470132,0.9510125,0.000095582036,0.000028356006,0.000012581028,0.0000386886,0.00017652923,0.0016024414],"genre_scores_gemma":[0.9164285,0.00043392277,0.07838153,0.000031919983,0.000030756044,0.000066778484,0.000114860384,0.00005770043,0.0044538314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.000055908684,0.000007192986,0.000026084095,0.000055252007,0.000021272657],"domain_scores_gemma":[0.99974173,0.00013477159,0.00004602231,0.000025480293,0.000041921216,0.0000100718435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032605694,0.0004408363,0.0005664153,0.00024063712,0.0001914461,0.0005518416,0.00066633517,0.00082919607,0.000725597],"category_scores_gemma":[0.0010813834,0.00032242667,0.0004934631,0.00029937222,0.00031905694,0.00062575,0.00040139645,0.0007964073,0.0002194745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002863363,0.000013812345,0.00019636945,0.000022310318,0.000018284289,0.000034880555,0.000032063497,0.9788824,0.0037178104,0.0068790778,0.00012563486,0.010048764],"study_design_scores_gemma":[8.0010335e-7,0.0000033485235,0.000041280564,0.0000010741297,0.0000016419342,0.000003962728,0.000001147529,0.9993344,0.00017669005,0.00038154933,0.00005275571,0.0000013234192],"about_ca_topic_score_codex":0.004009339,"about_ca_topic_score_gemma":0.005157766,"teacher_disagreement_score":0.004009339,"about_ca_system_score_codex":0.0003177838,"about_ca_system_score_gemma":0.00051217584,"threshold_uncertainty_score":0.007972002},"labels":[],"label_agreement":null},{"id":"W2913966198","doi":"10.1016/j.sigpro.2019.02.010","title":"Accelerated stochastic gradient descent with step size selection rules","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Stochastic gradient descent; PROX; Computer science; Gradient descent; Gradient method; Convergence (economics); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Artificial neural network; Chemistry","score_opus":0.013422164220208008,"score_gpt":0.215019254110561,"score_spread":0.201597089890353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913966198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036506613,0.00008931842,0.99465513,0.00012141177,0.00009179047,0.00004381177,0.000028024351,0.00030265693,0.0010172438],"genre_scores_gemma":[0.16383074,0.00025717364,0.8242891,0.00032591994,0.0002938242,0.00050187926,0.00028434373,0.00040964404,0.009807413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.00037406757,0.00004988766,0.000111830326,0.0004315131,0.00006099071],"domain_scores_gemma":[0.9964592,0.0020859744,0.00017478563,0.0003441118,0.00077765406,0.00015824393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288605,0.0010135198,0.0014771221,0.00070117373,0.00042627595,0.00084202114,0.0017414511,0.0019907325,0.00446333],"category_scores_gemma":[0.009086574,0.0008505856,0.00064375676,0.00073166407,0.0008906378,0.0010136869,0.0013251164,0.0021627953,0.0015734342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023963596,0.00020786961,0.0006165532,0.00015391692,0.0001015674,0.00014603126,0.000047671096,0.7672255,0.0059845243,0.05892291,0.009463331,0.1568905],"study_design_scores_gemma":[0.000016166387,0.000015935919,0.000031153297,0.0000032856321,0.0000032052137,0.0000114366585,8.177665e-7,0.99670225,0.00038403648,0.0024101199,0.0004187286,0.0000028618515],"about_ca_topic_score_codex":0.0021104529,"about_ca_topic_score_gemma":0.003872563,"teacher_disagreement_score":0.00446333,"about_ca_system_score_codex":0.0004400025,"about_ca_system_score_gemma":0.0014610105,"threshold_uncertainty_score":0.014931381},"labels":[],"label_agreement":null},{"id":"W2939757246","doi":"10.1016/j.sigpro.2019.04.015","title":"Multiple detection joint integrated track splitting for multiple extended target tracking","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Defense Acquisition Program Administration; Korea Advanced Institute of Science and Technology","keywords":"Tracking (education); Computer science; Track (disk drive); Tracking system; Tree (set theory); Artificial intelligence; Monte Carlo method; Algorithm; Point target; Computer vision; Kinematics; Basis (linear algebra); Mathematics; Kalman filter; Physics","score_opus":0.024786207055251072,"score_gpt":0.24532172845054157,"score_spread":0.22053552139529048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939757246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007845271,0.00016171446,0.99107915,0.000035357894,0.000033442357,0.000016794365,0.000036082307,0.00022121373,0.00057097967],"genre_scores_gemma":[0.3298385,0.00024036464,0.66386086,0.000120029916,0.00006346243,0.00007933001,0.0004350702,0.00010408458,0.005258208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999485,0.00007507028,0.000023834373,0.0001414142,0.00022507655,0.000049573966],"domain_scores_gemma":[0.9994655,0.00014205647,0.000050602735,0.00014390599,0.00016933354,0.000028608682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082011765,0.00065358164,0.00073217007,0.00045626567,0.00038768857,0.0005953035,0.0010159091,0.00081863184,0.0019016566],"category_scores_gemma":[0.0012352455,0.0004258042,0.0005809485,0.00081787904,0.0003109797,0.001172398,0.0014537742,0.0009855143,0.0008100592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006792664,0.00018445992,0.0011908225,0.00016917603,0.00020391152,0.00019064738,0.00020708081,0.14990784,0.14823967,0.011774296,0.0031993769,0.6840534],"study_design_scores_gemma":[0.000021093127,0.000093737166,0.00068114814,0.0000065464837,0.000036261277,0.00013454993,0.000016215596,0.9714543,0.02120758,0.004384566,0.0019494342,0.000014693812],"about_ca_topic_score_codex":0.0015223592,"about_ca_topic_score_gemma":0.0029428883,"teacher_disagreement_score":0.0019016566,"about_ca_system_score_codex":0.00034740145,"about_ca_system_score_gemma":0.00069418934,"threshold_uncertainty_score":0.0063616633},"labels":[],"label_agreement":null},{"id":"W2945777343","doi":"10.1016/j.sigpro.2019.05.018","title":"Self-regularized nonlinear diffusion algorithm based on levenberg gradient descent","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council; China Postdoctoral Science Foundation; National Science Foundation","keywords":"Algorithm; Levenberg–Marquardt algorithm; Nonlinear system; Computer science; Regularization (linguistics); Gradient descent; Identification (biology); Mathematical optimization; Mathematics; Artificial neural network; Artificial intelligence","score_opus":0.008206172489211374,"score_gpt":0.21740167574974356,"score_spread":0.20919550326053218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945777343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004668921,0.00014048544,0.993489,0.00010081739,0.000086596294,0.000026212101,0.00001696129,0.000344993,0.0011259711],"genre_scores_gemma":[0.13032193,0.00029049924,0.8603349,0.00012701059,0.00010440613,0.00017110418,0.00018166032,0.000204128,0.00826437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966633,0.00007918636,0.000024391147,0.00007079317,0.00013703381,0.00002222297],"domain_scores_gemma":[0.99939954,0.00015172575,0.00005459804,0.00006329903,0.00029335177,0.000037599802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075122365,0.000508557,0.0009758003,0.00065455,0.00048047624,0.00074462657,0.001149004,0.0012238941,0.0023954941],"category_scores_gemma":[0.0016378664,0.00035913082,0.0005876757,0.0005678596,0.0005158827,0.0010615087,0.00070921605,0.0009315796,0.0010365868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026906596,0.00017016906,0.0009358642,0.0002944756,0.00022605807,0.00015201111,0.00020172416,0.5100727,0.041424185,0.049464725,0.009576794,0.38721216],"study_design_scores_gemma":[0.0000077502555,0.00001497531,0.000052452935,0.000003562169,0.000004977298,0.000019524932,0.000002468372,0.99585766,0.0016381588,0.0011807837,0.0012106351,0.000006951751],"about_ca_topic_score_codex":0.0033497484,"about_ca_topic_score_gemma":0.0036851503,"teacher_disagreement_score":0.0033497484,"about_ca_system_score_codex":0.00051778945,"about_ca_system_score_gemma":0.001413845,"threshold_uncertainty_score":0.008013666},"labels":[],"label_agreement":null},{"id":"W2965287244","doi":"10.1016/j.sigpro.2019.107241","title":"3-D tracking of air targets using a single 2-D radar","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Initialization; Radar tracker; Radar; Computer science; Air traffic control; Waypoint; Algorithm; Extended Kalman filter; Low probability of intercept radar; Tracking (education); Filter (signal processing); Kalman filter; Real-time computing; Engineering; Radar engineering details; Artificial intelligence; Computer vision; Radar imaging; Telecommunications","score_opus":0.025245246907247422,"score_gpt":0.2494710970287736,"score_spread":0.22422585012152618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965287244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07467423,0.0004003808,0.91953903,0.00018817434,0.00011196503,0.000032920078,0.00011951442,0.00066853897,0.004265333],"genre_scores_gemma":[0.6450616,0.00044699767,0.3503813,0.00018497393,0.0000639404,0.000058363436,0.00023810679,0.000059949303,0.0035045962],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999811,0.00002542768,0.000010504887,0.00005021777,0.00008013053,0.000022766786],"domain_scores_gemma":[0.99979025,0.00006825164,0.00002942962,0.000047666006,0.000048562626,0.00001588504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021638842,0.00047483915,0.00048431882,0.00044008245,0.0003444466,0.0007486976,0.00032229576,0.00086621294,0.0009550947],"category_scores_gemma":[0.00058281224,0.00039073086,0.00046314122,0.0005120433,0.00022669965,0.0008805719,0.0008392771,0.0004700148,0.0005063337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004963023,0.000117876,0.004446887,0.00023185909,0.00012821448,0.0004495231,0.0004574814,0.26359403,0.42786962,0.0044435463,0.002349895,0.29541475],"study_design_scores_gemma":[0.000019385241,0.00013778658,0.0037275255,0.000014623847,0.000033524797,0.0003680506,0.00006481787,0.93446237,0.056077585,0.0015820612,0.003471824,0.000040427596],"about_ca_topic_score_codex":0.001529307,"about_ca_topic_score_gemma":0.0026793056,"teacher_disagreement_score":0.001529307,"about_ca_system_score_codex":0.00019618096,"about_ca_system_score_gemma":0.00046441157,"threshold_uncertainty_score":0.0031951666},"labels":[],"label_agreement":null},{"id":"W2974615315","doi":"10.1016/j.sigpro.2019.107294","title":"Multi-depth filtering and occlusion suppression in 4-D light fields: Algorithms and architectures","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.012425264481334174,"score_gpt":0.2765274517313642,"score_spread":0.26410218725003004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974615315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007019189,0.00031028886,0.9913468,0.00008133492,0.000019457839,0.000029728571,0.000047973783,0.00035829816,0.00078699476],"genre_scores_gemma":[0.0899739,0.00065628556,0.9060029,0.0000688407,0.00004882319,0.000084527295,0.00019198524,0.0000812182,0.0028915186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.00005162915,0.000022331737,0.000056024423,0.0001723894,0.000050698003],"domain_scores_gemma":[0.99958664,0.00012953361,0.000053467687,0.00007494878,0.00012485491,0.00003055173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565921,0.0008434991,0.00070443243,0.0010891634,0.0005057585,0.0010795966,0.0011187025,0.0009984899,0.0035148303],"category_scores_gemma":[0.0011875107,0.0006877312,0.00072925654,0.0010936267,0.00036407914,0.0015721087,0.0012514073,0.00091025163,0.0010084944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003687239,0.00014476989,0.0010600094,0.00020193722,0.00008313379,0.000050738763,0.00018114176,0.08690987,0.06691612,0.020522762,0.0030794714,0.8204813],"study_design_scores_gemma":[0.000023101575,0.000071720744,0.0006472068,0.000021891143,0.000023372328,0.00007800151,0.000029715675,0.9562891,0.031297706,0.0072728293,0.004217492,0.000027942673],"about_ca_topic_score_codex":0.0072585433,"about_ca_topic_score_gemma":0.011872068,"teacher_disagreement_score":0.0072585433,"about_ca_system_score_codex":0.0008240215,"about_ca_system_score_gemma":0.001186878,"threshold_uncertainty_score":0.0144325495},"labels":[],"label_agreement":null},{"id":"W3012378050","doi":"10.1016/j.sigpro.2020.107581","title":"Underwater angle-only tracking with propagation delay and time-offset between observers","year":2020,"lang":"en","type":"article","venue":"Signal Processing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Underwater; Offset (computer science); Tracking (education); Computer science; Acoustics; Underwater acoustic communication; Control theory (sociology); Real-time computing; Geology; Artificial intelligence; Physics; Psychology","score_opus":0.03160737788197845,"score_gpt":0.2158470073175925,"score_spread":0.18423962943561403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012378050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025378602,0.00011809339,0.9712488,0.000065529086,0.00010448804,0.000018106082,0.000033934884,0.00018776665,0.0028447213],"genre_scores_gemma":[0.85842013,0.00024423064,0.12716109,0.000083710926,0.000064132975,0.00005357928,0.00018820021,0.000059214395,0.013725633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955803,0.00005641392,0.000023771938,0.00014270007,0.00016520773,0.000053840242],"domain_scores_gemma":[0.9994006,0.00013760655,0.00011327628,0.00013992169,0.00018668035,0.000021821408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763373,0.000774599,0.0006788863,0.00031884346,0.00045145393,0.00066768506,0.00071388006,0.0009234872,0.0011211247],"category_scores_gemma":[0.0017893192,0.00046122455,0.0002840442,0.00058550364,0.0005780049,0.0014793539,0.0014302065,0.0009190899,0.0005374528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073333544,0.000135399,0.0054220296,0.00034252874,0.0001640052,0.0003984371,0.0005328516,0.5840731,0.07299843,0.035547674,0.0022751105,0.29737705],"study_design_scores_gemma":[0.000031071937,0.00015542521,0.0011075952,0.000015430063,0.00003429138,0.00013598199,0.00003509233,0.9744274,0.018118307,0.0036889152,0.0022272253,0.000023122879],"about_ca_topic_score_codex":0.0038633656,"about_ca_topic_score_gemma":0.0033935339,"teacher_disagreement_score":0.0038633656,"about_ca_system_score_codex":0.0004364727,"about_ca_system_score_gemma":0.00088668265,"threshold_uncertainty_score":0.0076817274},"labels":[],"label_agreement":null},{"id":"W3028365456","doi":"10.1016/j.sigpro.2020.107659","title":"Robust sensor fusion with heavy-tailed noises","year":2020,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Key Research Program of Chongqing Science and Technology Commission; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Outlier; Sensor fusion; State space; Fusion; Bernoulli's principle; Gaussian; Bayesian probability; State (computer science); Computer science; Algorithm; Artificial intelligence; Gaussian process; State-space representation; Data mining; Pattern recognition (psychology); Mathematics; Engineering; Statistics; Physics","score_opus":0.03703339537655507,"score_gpt":0.22521192638269358,"score_spread":0.18817853100613852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028365456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00773389,0.00045836027,0.990677,0.00016136067,0.00009809875,0.000013776206,0.00004656752,0.00018742618,0.0006235438],"genre_scores_gemma":[0.8255683,0.0020262294,0.16274619,0.0004690652,0.000650265,0.00011105357,0.0005580385,0.00017567616,0.007695215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99574995,0.0010059167,0.0002197782,0.0010175355,0.0016663397,0.0003404381],"domain_scores_gemma":[0.99409336,0.0034422074,0.0005997702,0.0009143498,0.00084312697,0.00010715507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039962977,0.0015998465,0.0020823267,0.00091359514,0.00072504755,0.0015758444,0.0014580619,0.0026163282,0.00083873316],"category_scores_gemma":[0.015703753,0.0009988234,0.0008663124,0.0019924499,0.0022962277,0.0035679908,0.0027049659,0.0025413213,0.0006537374],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081554777,0.00011147243,0.0010888015,0.0004004862,0.00029211122,0.00035542765,0.0002039132,0.8032276,0.027621318,0.04066256,0.0027686055,0.1224521],"study_design_scores_gemma":[0.000012248899,0.000045487308,0.00037894963,0.000011999641,0.000022564995,0.000081342245,0.000013994685,0.9794781,0.004536991,0.014830275,0.00056714116,0.00002092537],"about_ca_topic_score_codex":0.0017776503,"about_ca_topic_score_gemma":0.0020187055,"teacher_disagreement_score":0.0039962977,"about_ca_system_score_codex":0.00084064784,"about_ca_system_score_gemma":0.0011447415,"threshold_uncertainty_score":0.021134675},"labels":[],"label_agreement":null},{"id":"W3124046719","doi":"10.1016/j.sigpro.2021.108012","title":"Statistical analysis of narrowband active noise control using a simplified variable step-size FXLMS algorithm","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Japan Society for the Promotion of Science; Higher Education Discipline Innovation Project; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Least mean squares filter; Active noise control; Mean squared error; Residual; Noise (video); Narrowband; Control theory (sociology); Mathematics; Steady state (chemistry); Filter (signal processing); Mean square; Algorithm; Adaptive filter; Statistics; Computer science; Control (management); Telecommunications; Artificial intelligence","score_opus":0.012838144773051514,"score_gpt":0.26228372995178645,"score_spread":0.24944558517873494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124046719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029883279,0.00007612543,0.96897674,0.000053278138,0.00002494849,0.00002264042,0.00006781049,0.00039479815,0.00050036167],"genre_scores_gemma":[0.66869974,0.00023959173,0.32688016,0.000070743685,0.00006193821,0.00015280915,0.00053682533,0.00021274833,0.0031455169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995048,0.00011731721,0.000030411738,0.00011111194,0.00020503417,0.0000313261],"domain_scores_gemma":[0.9986576,0.00075667916,0.00010926397,0.00013408576,0.00032285234,0.000019458774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008885493,0.0004039707,0.0004393514,0.00045211345,0.00022370392,0.00051124184,0.00041197473,0.00035479435,0.0016550078],"category_scores_gemma":[0.0033021492,0.00015489492,0.00031664575,0.00038930017,0.00036922374,0.00049110147,0.00029793146,0.00041664438,0.00030908093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069697923,0.0001979862,0.0030480553,0.00027376972,0.00015273152,0.000120501594,0.0001361679,0.5240403,0.08117408,0.022981016,0.001679278,0.36549923],"study_design_scores_gemma":[0.000005690563,0.00002454745,0.0012184088,0.0000032219796,0.0000066568646,0.00001141901,0.0000044493727,0.9927394,0.0048575266,0.0008013211,0.00032154046,0.000005886551],"about_ca_topic_score_codex":0.0021432554,"about_ca_topic_score_gemma":0.0022490507,"teacher_disagreement_score":0.0021432554,"about_ca_system_score_codex":0.0003020551,"about_ca_system_score_gemma":0.00070682913,"threshold_uncertainty_score":0.0055365562},"labels":[],"label_agreement":null},{"id":"W3129540677","doi":"10.1016/j.sigpro.2021.108225","title":"Orthogonal features-based EEG signal denoising using fractionally compressed autoencoder","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Noise reduction; Compressed sensing; Compression (physics); Autoencoder; Singular value decomposition; Energy (signal processing); Pattern recognition (psychology); SIGNAL (programming language)","score_opus":0.0417817350793579,"score_gpt":0.3033933698969838,"score_spread":0.2616116348176259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129540677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028143099,0.00023184053,0.97048134,0.00010311504,0.000056989324,0.000017428332,0.000034716784,0.00022731406,0.0007041629],"genre_scores_gemma":[0.469429,0.00056141644,0.52550596,0.00010708895,0.000092361784,0.00006539334,0.00032599186,0.00010888101,0.0038039268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983084,0.000030677806,0.000012552333,0.000038800434,0.00006595865,0.000021249207],"domain_scores_gemma":[0.9997117,0.00009392656,0.000025466192,0.00003843755,0.000118197546,0.000012203289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004233519,0.00049442786,0.00047350887,0.00033214103,0.00022982183,0.000397115,0.00038731878,0.0005663265,0.0008689297],"category_scores_gemma":[0.0011875508,0.00016999377,0.00057702983,0.0003704214,0.000295046,0.0005738474,0.0004416283,0.0006746324,0.00025387717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005788794,0.00021041349,0.0011901691,0.00019820673,0.00013804532,0.00019208602,0.00015248575,0.20477796,0.19035019,0.011293672,0.0021092107,0.58880866],"study_design_scores_gemma":[0.0000059705653,0.000043083204,0.000505805,0.0000073077663,0.000019265504,0.00005073369,0.000009789462,0.9810161,0.016474724,0.0010492185,0.0008103032,0.000007685076],"about_ca_topic_score_codex":0.0028979545,"about_ca_topic_score_gemma":0.0030520048,"teacher_disagreement_score":0.0028979545,"about_ca_system_score_codex":0.0001931929,"about_ca_system_score_gemma":0.00053115666,"threshold_uncertainty_score":0.0057622194},"labels":[],"label_agreement":null},{"id":"W3169102718","doi":"10.1016/j.sigpro.2021.108173","title":"Quantitative imaging for optical field via a single-pixel detector","year":2021,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Holography and Microscopy","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; Shandong University","keywords":"Pixel; Detector; Phase retrieval; Optics; Diffraction; Coherent diffraction imaging; Phase (matter); Interferometry; Computer science; Wavelength; Artificial intelligence; Computer vision; Physics; Fourier transform","score_opus":0.017093527716161305,"score_gpt":0.2842659647766524,"score_spread":0.2671724370604911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169102718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06599449,0.00042504637,0.9292349,0.00016698144,0.000053151445,0.000084745225,0.00023944522,0.0010813603,0.0027198999],"genre_scores_gemma":[0.2748115,0.000368394,0.72118604,0.00007996988,0.000030565516,0.00010938658,0.0001380145,0.000091981325,0.0031842133],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996698,0.00004425207,0.000014076233,0.000109836,0.00013955354,0.000022506953],"domain_scores_gemma":[0.999582,0.00018387173,0.000047567715,0.00007589514,0.00008207732,0.000028571387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452179,0.0005509878,0.00058766175,0.0005762854,0.00035630085,0.00093812356,0.00093860016,0.0007766082,0.003465442],"category_scores_gemma":[0.0008158801,0.00046300545,0.00024691084,0.0004320897,0.0005825462,0.0015114408,0.00051116385,0.0005620495,0.0008619788],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001638743,0.00007133661,0.000644599,0.0001908315,0.00001737795,0.00004056606,0.000057359182,0.0023794128,0.92591375,0.016763812,0.0007939557,0.0529631],"study_design_scores_gemma":[0.000017054526,0.000149308,0.0011355624,0.000012492015,0.000021829095,0.0003642696,0.000023236573,0.11811234,0.86965287,0.005225344,0.0052593374,0.000026256292],"about_ca_topic_score_codex":0.00046654377,"about_ca_topic_score_gemma":0.0010522282,"teacher_disagreement_score":0.003465442,"about_ca_system_score_codex":0.0006749054,"about_ca_system_score_gemma":0.00070458156,"threshold_uncertainty_score":0.011593044},"labels":[],"label_agreement":null},{"id":"W4248373913","doi":"10.1016/j.sigpro.2006.01.011","title":"A new efficient approach to the design of parametric windows with arbitrary sidelobe profiles","year":2006,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bessel function; Mathematics; Chebyshev filter; Window function; Transformation (genetics); Algorithm; Mathematical analysis; Spectral density; Statistics","score_opus":0.025216703109517215,"score_gpt":0.24887867865162847,"score_spread":0.22366197554211126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248373913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024444729,0.00009038428,0.99683726,0.00001430072,0.000011749313,0.000014649292,0.0000073869637,0.00009558672,0.00048416745],"genre_scores_gemma":[0.059311803,0.0002951577,0.93869895,0.000035824083,0.00004175051,0.0001034252,0.000054263506,0.00014887433,0.0013099586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00010524769,0.000028650526,0.00006698025,0.00019046283,0.000038786606],"domain_scores_gemma":[0.99927884,0.0002938817,0.000094261,0.0001334684,0.00015944704,0.000040098494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066300924,0.0011275911,0.000814844,0.000692545,0.00031886448,0.000988087,0.0011270752,0.00076699595,0.0015943638],"category_scores_gemma":[0.0022212404,0.0005904329,0.0007206213,0.00058589864,0.00043275292,0.0011244114,0.0010884467,0.001206045,0.00077671476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041389593,0.00019878177,0.00048110215,0.00031815743,0.00013651482,0.00018295264,0.00023811626,0.1267194,0.3397892,0.094291866,0.0027795597,0.43445045],"study_design_scores_gemma":[0.00004587883,0.00021451227,0.00021556886,0.00003020082,0.00005848193,0.00037402578,0.000023083805,0.890933,0.082884826,0.012800285,0.0123713175,0.00004885495],"about_ca_topic_score_codex":0.00025512048,"about_ca_topic_score_gemma":0.0004855479,"teacher_disagreement_score":0.0015943638,"about_ca_system_score_codex":0.00027214398,"about_ca_system_score_gemma":0.0004733828,"threshold_uncertainty_score":0.005333662},"labels":[],"label_agreement":null},{"id":"W4280578743","doi":"10.1016/j.sigpro.2022.108620","title":"Censoring outliers in elliptically symmetric multivariate distribution","year":2022,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outlier; Censoring (clinical trials); Mathematics; Mathematical optimization; Covariance; Gaussian; Algorithm; Computational complexity theory; Stationary point; Computer science; Statistics","score_opus":0.09880669015401773,"score_gpt":0.3981913301496969,"score_spread":0.29938463999567916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280578743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051517162,0.00025677684,0.9467578,0.000247497,0.000041672214,0.000018427027,0.000085846055,0.00029386452,0.00078089855],"genre_scores_gemma":[0.916188,0.00074798433,0.07638086,0.00018859647,0.00027546711,0.00010188289,0.0005935185,0.00032627734,0.0051974105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682224,0.0013118951,0.00019143481,0.000564631,0.00083957886,0.00027022135],"domain_scores_gemma":[0.9702762,0.01941636,0.004678941,0.003082512,0.0019886938,0.0005574335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006744153,0.0009749143,0.0014741732,0.0018511959,0.0006509592,0.0017170167,0.0019376331,0.0019191351,0.0018618044],"category_scores_gemma":[0.054667447,0.0007837416,0.00092329714,0.002743918,0.0027919689,0.002663375,0.0023292946,0.0026493627,0.0006474303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008794394,0.00014138664,0.018547175,0.00039124963,0.00022252025,0.0019044749,0.0011050542,0.40185305,0.0065172343,0.47909996,0.0039540543,0.085384406],"study_design_scores_gemma":[0.000024453591,0.00004705765,0.0031084332,0.00004329097,0.00003669673,0.00044689226,0.000099288125,0.83481526,0.0017411715,0.15842265,0.0011716933,0.000043061576],"about_ca_topic_score_codex":0.0015513801,"about_ca_topic_score_gemma":0.0011539618,"teacher_disagreement_score":0.006744153,"about_ca_system_score_codex":0.00097200065,"about_ca_system_score_gemma":0.00076898513,"threshold_uncertainty_score":0.035666883},"labels":[],"label_agreement":null},{"id":"W4313478437","doi":"10.1016/j.sigpro.2022.108926","title":"Rank minimization via adaptive hybrid norm for image restoration","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Singular value; Minification; Norm (philosophy); Matrix norm; Mathematical optimization; Rank (graph theory); Image restoration; Computer science; Mathematics; Algorithm; Image (mathematics); Singular value decomposition; Artificial intelligence; Image processing","score_opus":0.023121888998113953,"score_gpt":0.249177246283302,"score_spread":0.22605535728518805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313478437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035081632,0.00015099988,0.99476445,0.00012986972,0.00003167319,0.000009382786,0.00003190222,0.000097635115,0.0012759476],"genre_scores_gemma":[0.15509373,0.0006132316,0.8326477,0.00018277143,0.00015773051,0.000101231046,0.000246023,0.0001983318,0.010759302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962735,0.0001382276,0.000013471422,0.000054034666,0.00014324952,0.000023665934],"domain_scores_gemma":[0.9995098,0.0002410299,0.000048418016,0.000072441355,0.00010667136,0.00002171368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006065478,0.00063016894,0.00062306074,0.00052140764,0.0002381949,0.0006771216,0.0006829248,0.00094409403,0.0027999151],"category_scores_gemma":[0.0017160485,0.00026375082,0.0004796473,0.0006820094,0.00088889565,0.0010283059,0.0011850242,0.0013150333,0.0007460912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038160858,0.00017744569,0.00041585922,0.00045978965,0.00013056165,0.000120697754,0.00016369403,0.3353632,0.058065537,0.2071609,0.0142053785,0.38335532],"study_design_scores_gemma":[0.000010164092,0.000049341037,0.000082647864,0.00000780824,0.000008228479,0.00005686299,0.000014429425,0.9678693,0.004682573,0.024718085,0.002489113,0.000011625771],"about_ca_topic_score_codex":0.0010455323,"about_ca_topic_score_gemma":0.0017121074,"teacher_disagreement_score":0.0027999151,"about_ca_system_score_codex":0.0002691687,"about_ca_system_score_gemma":0.000542285,"threshold_uncertainty_score":0.009366691},"labels":[],"label_agreement":null},{"id":"W4318774098","doi":"10.1016/j.sigpro.2023.108939","title":"One-bit compressed sensing via total variation minimization method","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","keywords":"Compressed sensing; Piecewise; Algorithm; Thresholding; Minification; Computer science; Series (stratigraphy); Binary number; Bit (key); Total variation denoising; Mathematics; Artificial intelligence; Noise reduction; Image (mathematics); Arithmetic","score_opus":0.024883693560630256,"score_gpt":0.2618927505724298,"score_spread":0.23700905701179953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318774098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004105591,0.00029735017,0.9925821,0.00023157743,0.00006603583,0.00001881983,0.000076025404,0.00013869618,0.0024837418],"genre_scores_gemma":[0.2693169,0.0012681357,0.7194325,0.00042318198,0.00026144725,0.00013479327,0.00043550614,0.00015647837,0.008571014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.0001623182,0.000024176104,0.000091625596,0.0002331649,0.000035744622],"domain_scores_gemma":[0.99946445,0.0002900492,0.000039650982,0.00009529499,0.00008660546,0.000023922512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046248914,0.0008263214,0.0007998137,0.00036040155,0.0002854695,0.0007553066,0.0007315599,0.00086925353,0.0032624635],"category_scores_gemma":[0.0019643605,0.0002562362,0.00038668644,0.0006974745,0.0006171671,0.0012571806,0.0011754503,0.0010565303,0.0007886761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004599147,0.000112137845,0.00046807507,0.00052036846,0.00011937331,0.00022142925,0.00020795659,0.1930032,0.07288659,0.19829984,0.009264011,0.52443707],"study_design_scores_gemma":[0.000016518743,0.000068642126,0.00014680302,0.000027463333,0.000017835027,0.00020307368,0.000014747932,0.96282774,0.0108759,0.022528363,0.0032481628,0.000024714724],"about_ca_topic_score_codex":0.00093850406,"about_ca_topic_score_gemma":0.0012033301,"teacher_disagreement_score":0.0032624635,"about_ca_system_score_codex":0.00027737278,"about_ca_system_score_gemma":0.00069059717,"threshold_uncertainty_score":0.010914028},"labels":[],"label_agreement":null},{"id":"W4320717839","doi":"10.1016/j.sigpro.2023.108972","title":"Topological interference management via low-rank tensor completion for time-varying topology networks","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Topology (electrical circuits); Rank (graph theory); Mathematics; Matrix norm; Cartesian tensor; Mathematical optimization; Tensor density; Pure mathematics; Exact solutions in general relativity; Combinatorics; Tensor field; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.017872010458829066,"score_gpt":0.2548021531827042,"score_spread":0.23693014272387514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320717839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014562157,0.0001922135,0.98271704,0.0002301135,0.00004401097,0.00002266035,0.000101325815,0.00017159984,0.0019588883],"genre_scores_gemma":[0.83770996,0.00062972924,0.155675,0.0001773868,0.0001658879,0.00011151971,0.00045672437,0.00012532472,0.004948483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915195,0.00029695645,0.000031232426,0.00015917566,0.00020245726,0.00015825688],"domain_scores_gemma":[0.99773943,0.0010995452,0.00032974462,0.0002642109,0.00040048466,0.0001666532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012438239,0.0012401012,0.0010192785,0.000630561,0.0005147485,0.0013971486,0.0013823385,0.0008703791,0.0018773655],"category_scores_gemma":[0.0051286705,0.0003842349,0.00042296483,0.001008432,0.0013277511,0.0022633872,0.0014087913,0.0012812433,0.0004087959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095895746,0.000056953057,0.0002857106,0.00007761032,0.000039600633,0.000066286324,0.00006683617,0.92460537,0.0025300116,0.034827497,0.002666886,0.034681387],"study_design_scores_gemma":[0.000002750568,0.000017075467,0.00003578808,0.000002155839,0.0000030272154,0.000009657305,0.000011320096,0.9909984,0.0002006294,0.008537548,0.00017796576,0.0000037276282],"about_ca_topic_score_codex":0.0041819857,"about_ca_topic_score_gemma":0.0050668446,"teacher_disagreement_score":0.0041819857,"about_ca_system_score_codex":0.00088996725,"about_ca_system_score_gemma":0.0012486434,"threshold_uncertainty_score":0.008315265},"labels":[],"label_agreement":null},{"id":"W4360873910","doi":"10.1016/j.sigpro.2023.109011","title":"Mixture of multivariate generalized Gaussians for multi-band texture modeling and representation","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Pattern recognition (psychology); Texture filtering; Image texture; Computer science; Texture compression; Multivariate statistics; Wavelet; Representation (politics); Wavelet transform; Texture (cosmology); Convolution (computer science); Mixture model; Filter bank; Computer vision; Mathematics; Algorithm; Artificial neural network; Filter (signal processing); Image processing; Image (mathematics)","score_opus":0.07535063483425117,"score_gpt":0.34753718174963555,"score_spread":0.27218654691538435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360873910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013364238,0.00025451265,0.9979796,0.000043575586,0.000025199684,0.000009171499,0.000049173097,0.00018008004,0.00012241675],"genre_scores_gemma":[0.14163809,0.0023824943,0.8494702,0.00022076737,0.0001707102,0.00022258099,0.0009207259,0.00038311954,0.0045914035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924517,0.00029377005,0.000036902635,0.0001344685,0.0002168121,0.0000728689],"domain_scores_gemma":[0.999092,0.0003782858,0.000081134,0.00020654906,0.00019351467,0.00004854884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012476684,0.00078353356,0.0012067489,0.0012336234,0.00035968656,0.0009590983,0.0015717527,0.0012975866,0.0017953534],"category_scores_gemma":[0.0032363692,0.00054379663,0.0019698022,0.0024797877,0.00063465396,0.0012593139,0.001106008,0.0020225835,0.0015884051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033158876,0.00012963716,0.0012936929,0.00035676901,0.00032114206,0.00013685336,0.00021259072,0.45061424,0.025086109,0.114582054,0.0075695436,0.39936572],"study_design_scores_gemma":[0.000005352475,0.000017682813,0.00027764752,0.000011855884,0.000022272096,0.00004485181,0.000011233921,0.9835556,0.0010680996,0.012450189,0.0025190176,0.000016322438],"about_ca_topic_score_codex":0.005560475,"about_ca_topic_score_gemma":0.006312818,"teacher_disagreement_score":0.005560475,"about_ca_system_score_codex":0.0005985598,"about_ca_system_score_gemma":0.00079021044,"threshold_uncertainty_score":0.011056244},"labels":[],"label_agreement":null},{"id":"W4385633790","doi":"10.1016/j.sigpro.2023.109216","title":"Recursive least-squares algorithm based on a third-order tensor decomposition for low-rank system identification","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Rank (graph theory); Impulse response; Mathematics; Matrix decomposition; Computational complexity theory; Least-squares function approximation; Kronecker product; Finite impulse response; Computer science; Mathematical optimization; Kronecker delta; Statistics","score_opus":0.03647775312829842,"score_gpt":0.34155362725061617,"score_spread":0.30507587412231774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385633790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001637693,0.00006681757,0.9977245,0.00002835236,0.000017583961,0.000012742791,0.000016743437,0.00029510807,0.00020056279],"genre_scores_gemma":[0.073592946,0.00026334377,0.9236782,0.000052448504,0.000046803296,0.00011237853,0.00023267725,0.00018982562,0.0018314526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.00016387146,0.000039825587,0.000111366986,0.00018772445,0.000051471783],"domain_scores_gemma":[0.99897987,0.00040032304,0.0000965108,0.00016262615,0.00032342473,0.000037288366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007666452,0.0010726394,0.0011970178,0.0005989173,0.0006623066,0.000729977,0.0008888443,0.0008492594,0.002126111],"category_scores_gemma":[0.0029260877,0.00045711195,0.000983872,0.0009370374,0.0005442724,0.0009709006,0.000687101,0.0018234381,0.0014371674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026942242,0.00018543728,0.000876823,0.00032427593,0.00018299498,0.00014240538,0.00027179124,0.33962405,0.07564454,0.04266806,0.006071917,0.5337382],"study_design_scores_gemma":[0.0000068049303,0.000036711335,0.0001861204,0.000006080727,0.000015361918,0.000044782224,0.000007864372,0.9908698,0.0047448436,0.0025976228,0.0014681412,0.000015844435],"about_ca_topic_score_codex":0.005775072,"about_ca_topic_score_gemma":0.0075178035,"teacher_disagreement_score":0.005775072,"about_ca_system_score_codex":0.00039885018,"about_ca_system_score_gemma":0.0018817085,"threshold_uncertainty_score":0.011482894},"labels":[],"label_agreement":null},{"id":"W4386418664","doi":"10.1016/j.sigpro.2023.109238","title":"Distributed multi-target tracking with low information updates via an integral-type event-based approach","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Outlier; Event (particle physics); Computer science; Filter (signal processing); Bounded function; Tracking (education); Divergence (linguistics); Sensitivity (control systems); Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Engineering; Control (management); Electronic engineering; Computer vision","score_opus":0.019307877443030308,"score_gpt":0.2553378691175482,"score_spread":0.23602999167451788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386418664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027058222,0.00006116176,0.9965773,0.000025434936,0.000019081015,0.000008248762,0.0000074347017,0.000103655395,0.0004917322],"genre_scores_gemma":[0.53455734,0.00033860342,0.4598865,0.00016194826,0.00014123817,0.00008098019,0.00012912921,0.00009923008,0.004605123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921024,0.00012855904,0.0000408301,0.00021483011,0.0003366473,0.0000689233],"domain_scores_gemma":[0.9992119,0.00037392246,0.00006172784,0.00013299737,0.00017807439,0.000041405725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009114232,0.00075586146,0.0013439519,0.00049643754,0.00049982156,0.0012698028,0.0018977418,0.0010330332,0.0016706398],"category_scores_gemma":[0.0019240481,0.0004363348,0.0006993608,0.0009095009,0.0005919046,0.0016516597,0.0016492859,0.0013889406,0.0005945868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010581969,0.00031711033,0.0010872154,0.0001998413,0.00018860605,0.000266474,0.00025601176,0.44920695,0.0703692,0.04604671,0.002394333,0.42860937],"study_design_scores_gemma":[0.000010779633,0.00003426218,0.00010011238,0.0000026318583,0.000016355698,0.000052049585,0.0000051520637,0.99253595,0.0035281545,0.0032243654,0.00048293924,0.0000072370417],"about_ca_topic_score_codex":0.0011697008,"about_ca_topic_score_gemma":0.00155155,"teacher_disagreement_score":0.0018977418,"about_ca_system_score_codex":0.00048331963,"about_ca_system_score_gemma":0.0005989008,"threshold_uncertainty_score":0.0055888295},"labels":[],"label_agreement":null},{"id":"W4386760226","doi":"10.1016/j.sigpro.2023.109257","title":"TEFISTA-Net: A learnable method for high-resolution range profile reconstruction with low-frequency ultra-wideband radar","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Radar; Algorithm; Convolution (computer science); Artificial intelligence; Computational complexity theory; Range (aeronautics); Thresholding; Signal-to-noise ratio (imaging); Convolutional neural network; Artificial neural network; Image (mathematics); Engineering; Telecommunications","score_opus":0.014448130146273046,"score_gpt":0.24027283596186258,"score_spread":0.22582470581558953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386760226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020531774,0.00015705479,0.995171,0.00008086384,0.00005339114,0.000019161747,0.00011157667,0.0017190862,0.0006346208],"genre_scores_gemma":[0.08282096,0.0002964532,0.9081585,0.00035085573,0.00014147625,0.0001428788,0.0009850471,0.00047044078,0.0066334084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997577,0.000057170946,0.000009728515,0.000053574593,0.00009504264,0.000026810618],"domain_scores_gemma":[0.9996197,0.00016559161,0.00002713988,0.00006742472,0.00009015174,0.000029826522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064510887,0.0008117015,0.000662288,0.00052452134,0.00029483144,0.0006039157,0.0015445711,0.0013319846,0.004583803],"category_scores_gemma":[0.0018998132,0.0003453077,0.00050607795,0.0005083956,0.00040966447,0.00083346147,0.0011363861,0.0016409586,0.0020784747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058823,0.000121813246,0.00056904834,0.00013713371,0.00013141391,0.0001251233,0.000038157214,0.2012037,0.013367313,0.011003509,0.019157816,0.75373906],"study_design_scores_gemma":[0.000013521138,0.000028104732,0.000060688915,0.000006076973,0.00000666984,0.00004025863,0.000003315827,0.9917012,0.0031980292,0.0026519725,0.002283814,0.0000062846275],"about_ca_topic_score_codex":0.0024673361,"about_ca_topic_score_gemma":0.005659321,"teacher_disagreement_score":0.004583803,"about_ca_system_score_codex":0.00035942232,"about_ca_system_score_gemma":0.00077958114,"threshold_uncertainty_score":0.015334368},"labels":[],"label_agreement":null},{"id":"W4388451681","doi":"10.1016/j.sigpro.2023.109321","title":"Extended target tracking under multitarget tracking framework for convex polytope shapes","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Infrared Target Detection Methodologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tracking (education); Intersection (aeronautics); Boundary (topology); Polytope; Convex polytope; Covariance intersection; Mathematics; Computer science; Computer vision; Convex hull; Kinematics; Artificial intelligence; Algorithm; Convex combination; Regular polygon; Covariance matrix; Convex optimization; Convex set; Estimation of covariance matrices; Geometry","score_opus":0.0752096599878209,"score_gpt":0.3277797708606076,"score_spread":0.2525701108727867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388451681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001514473,0.00007693065,0.99773043,0.000025358462,0.000012914464,0.000007863826,0.000013675208,0.000037916947,0.0005804197],"genre_scores_gemma":[0.36284038,0.0015160067,0.6174655,0.00022749827,0.00021634091,0.00026124468,0.000537862,0.00023348133,0.016701613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.00016660521,0.000030964988,0.00027001643,0.0003087466,0.000065443826],"domain_scores_gemma":[0.999116,0.000258329,0.00011043836,0.00012172459,0.00034204565,0.000051412568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010643774,0.0009837492,0.0009719251,0.0008651595,0.0004006235,0.0013806084,0.0017390854,0.0011555293,0.0025347134],"category_scores_gemma":[0.002035706,0.00041929662,0.0010502592,0.001002392,0.0009125459,0.0019004749,0.0019524372,0.0016296774,0.00084326364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081132814,0.000056548623,0.0007117312,0.00025844295,0.00008650293,0.00029329807,0.00015603245,0.7742591,0.012265707,0.10544624,0.0024799227,0.10390536],"study_design_scores_gemma":[0.0000017118466,0.000020590123,0.000085491876,0.000005033173,0.0000058995693,0.00003847912,0.000007916631,0.99033207,0.0005880314,0.0082069,0.000702819,0.0000050385806],"about_ca_topic_score_codex":0.0030207585,"about_ca_topic_score_gemma":0.0019710353,"teacher_disagreement_score":0.0030207585,"about_ca_system_score_codex":0.0006687734,"about_ca_system_score_gemma":0.0008635663,"threshold_uncertainty_score":0.008479476},"labels":[],"label_agreement":null},{"id":"W4400842795","doi":"10.1016/j.sigpro.2024.109623","title":"Nonlinear acoustic echo cancellation using low-complexity low-rank recursive least-squares algorithms","year":2024,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Echo (communications protocol); Algorithm; Rank (graph theory); Recursive least squares filter; Least-squares function approximation; Nonlinear system; Computer science; Non-linear least squares; Speech recognition; Mathematics; Adaptive filter; Statistics; Combinatorics; Estimation theory; Physics","score_opus":0.03322476835799835,"score_gpt":0.29036801198131884,"score_spread":0.25714324362332047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400842795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019551315,0.000080034195,0.9968886,0.00004579653,0.000024514706,0.00001386023,0.000022963333,0.00047242228,0.0004967247],"genre_scores_gemma":[0.056275964,0.00023447108,0.93822134,0.00008144483,0.00006714615,0.00009945454,0.00026683754,0.0002130848,0.004540179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.00018377914,0.00004485651,0.00009859379,0.0003770047,0.00006095751],"domain_scores_gemma":[0.99876165,0.00056304346,0.000107435306,0.00017012462,0.0003619407,0.000035798566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107,0.0012335782,0.00086479075,0.00057442306,0.00046804288,0.0010214589,0.0010587913,0.0010254303,0.0039059008],"category_scores_gemma":[0.0042665466,0.00051223376,0.0006131334,0.00078938133,0.0005142508,0.0012174319,0.0009994193,0.0019303582,0.0047222427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034900912,0.0002112852,0.0006312604,0.00029146404,0.00013745457,0.00011840355,0.00019357693,0.12642257,0.107108355,0.019999385,0.006727106,0.73781],"study_design_scores_gemma":[0.000034868735,0.00008108407,0.00035763826,0.000019696532,0.00002311707,0.00011315812,0.000022279033,0.9601858,0.02881062,0.0047737993,0.0055401027,0.00003777357],"about_ca_topic_score_codex":0.0022715426,"about_ca_topic_score_gemma":0.005393646,"teacher_disagreement_score":0.0039059008,"about_ca_system_score_codex":0.00032319236,"about_ca_system_score_gemma":0.001241182,"threshold_uncertainty_score":0.01306653},"labels":[],"label_agreement":null},{"id":"W4404919737","doi":"10.1016/j.sigpro.2024.109820","title":"Automatic regularization for linear MMSE filters","year":2024,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Regularization (linguistics); Mathematics; Linear filter; Computer science; Algorithm; Artificial intelligence; Computer vision; Filter (signal processing)","score_opus":0.01977431075990281,"score_gpt":0.29802524475652226,"score_spread":0.27825093399661943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404919737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016482087,0.00009990677,0.9972716,0.00007499295,0.000027874248,0.000007820699,0.00002062554,0.00016121606,0.00068776624],"genre_scores_gemma":[0.11141869,0.00049114967,0.87762177,0.00015678904,0.00017362181,0.00015631322,0.00031784075,0.0003703918,0.009293435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989166,0.0004358409,0.000057081626,0.00015409394,0.00035164607,0.00008473571],"domain_scores_gemma":[0.9979804,0.0011330107,0.0001222948,0.00027670193,0.0004349464,0.00005265922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015330287,0.0011174494,0.000891198,0.0007953301,0.0004946473,0.0011368408,0.00096427556,0.0015826456,0.003630913],"category_scores_gemma":[0.007832483,0.0008095603,0.00086399843,0.00063797116,0.00096717256,0.0013732328,0.0014532566,0.001823098,0.0017793161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000543518,0.00017316954,0.0006902097,0.0004957252,0.00019547595,0.00015672638,0.00024846586,0.27750945,0.087181665,0.21183552,0.011423211,0.40954694],"study_design_scores_gemma":[0.000016617918,0.000038648617,0.00022547161,0.00002613189,0.000017562534,0.000077544835,0.0000127948915,0.9536288,0.011026664,0.030995985,0.0039117867,0.00002195432],"about_ca_topic_score_codex":0.0016137433,"about_ca_topic_score_gemma":0.0032065606,"teacher_disagreement_score":0.003630913,"about_ca_system_score_codex":0.0005426772,"about_ca_system_score_gemma":0.00116459,"threshold_uncertainty_score":0.012146592},"labels":[],"label_agreement":null},{"id":"W4406897900","doi":"10.1016/j.sigpro.2025.109907","title":"Simultaneously transmitting and reflecting (STAR) RIS enhanced covert transmission with noise uncertainty","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Noise (video); Transmission (telecommunications); Covert; Star (game theory); Computer science; Acoustics; Electronic engineering; Telecommunications; Engineering; Physics; Artificial intelligence; Astrophysics; Philosophy","score_opus":0.008609470588719522,"score_gpt":0.25745357047878914,"score_spread":0.24884409989006961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406897900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25523663,0.00048693843,0.71254206,0.0004897918,0.00018063665,0.000047085636,0.00019133202,0.0004875595,0.030337952],"genre_scores_gemma":[0.89732724,0.00042670273,0.08927043,0.00017410723,0.00011803783,0.000043814216,0.00018185982,0.00010443002,0.012353549],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934834,0.00009329449,0.000019715977,0.00010175261,0.00035899162,0.00007794727],"domain_scores_gemma":[0.9991387,0.0003436847,0.0001495842,0.00013709899,0.00019127732,0.000039539293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038752507,0.00068849715,0.0005546763,0.0003055994,0.00033669383,0.0008295113,0.00053487456,0.0009749663,0.0019285767],"category_scores_gemma":[0.001306124,0.00028281927,0.00047871002,0.000565801,0.0006390105,0.0010909692,0.0010194358,0.0006529067,0.00073141203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010141752,0.00011937344,0.00209273,0.0003142619,0.000113836904,0.0011548261,0.00050458463,0.16410705,0.65058833,0.091294184,0.0018822388,0.086814284],"study_design_scores_gemma":[0.000018875497,0.00019880025,0.0010375511,0.00002296875,0.000058760812,0.00074925896,0.000059672384,0.82013804,0.16680409,0.007798584,0.0030574894,0.000055914512],"about_ca_topic_score_codex":0.00036302052,"about_ca_topic_score_gemma":0.0005898676,"teacher_disagreement_score":0.0019285767,"about_ca_system_score_codex":0.00047012055,"about_ca_system_score_gemma":0.0003788226,"threshold_uncertainty_score":0.006451726},"labels":[],"label_agreement":null},{"id":"W4406902218","doi":"10.1016/j.sigpro.2025.109892","title":"A MISO acoustic echo cancellation algorithm based on a two-layer filter decomposition","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"National Natural Science Foundation of China","keywords":"Echo (communications protocol); Algorithm; Decomposition; Computer science; Filter (signal processing); Speech recognition; Acoustics; Physics; Computer network; Chemistry","score_opus":0.011755006731213546,"score_gpt":0.2852620623774136,"score_spread":0.27350705564620004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406902218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002667573,0.00009236455,0.99612325,0.00006181277,0.00008988474,0.000017028578,0.00002192884,0.00026721318,0.00065892504],"genre_scores_gemma":[0.044116244,0.00019624535,0.9499931,0.0001165085,0.00008259287,0.00007803324,0.00018033492,0.00007899442,0.005158052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997328,0.000036284513,0.00001707868,0.000044507622,0.00014585891,0.000023483659],"domain_scores_gemma":[0.9996952,0.00006577459,0.000022320191,0.000034969984,0.00015022421,0.000031510423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003835005,0.000849516,0.0006516268,0.0004645853,0.0003325507,0.00062622817,0.0006107029,0.0008610611,0.002377022],"category_scores_gemma":[0.0007955661,0.0003393935,0.0005661203,0.00043544188,0.00021809147,0.00081306783,0.0005944689,0.0010403998,0.0018248325],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045854706,0.00013336286,0.0006734159,0.00015211503,0.00011689899,0.00010382003,0.00008973819,0.03676191,0.25312054,0.011687788,0.0045932764,0.6921086],"study_design_scores_gemma":[0.000047468657,0.00015694197,0.0008952835,0.000016484555,0.0000559518,0.00027551712,0.00002319672,0.91565114,0.068170525,0.0026544838,0.011996744,0.00005617947],"about_ca_topic_score_codex":0.0011532799,"about_ca_topic_score_gemma":0.0024667976,"teacher_disagreement_score":0.002377022,"about_ca_system_score_codex":0.00022404458,"about_ca_system_score_gemma":0.0008092086,"threshold_uncertainty_score":0.007951975},"labels":[],"label_agreement":null},{"id":"W4407300992","doi":"10.1016/j.sigpro.2025.109934","title":"Reconfigurable intelligent surface-enabled gridless DoA estimation system for NLoS scenarios","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Non-line-of-sight propagation; Computer science; Estimation; Electronic engineering; Real-time computing; Engineering; Telecommunications; Systems engineering; Wireless","score_opus":0.013103286449938415,"score_gpt":0.2450033236180384,"score_spread":0.23190003716809998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407300992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03861662,0.000107799606,0.9554763,0.00009019784,0.00006138219,0.000030799685,0.000060854112,0.0020800985,0.0034759864],"genre_scores_gemma":[0.8737658,0.00007893032,0.12361919,0.000120669494,0.00003647305,0.000081159975,0.00015407056,0.000045979843,0.0020977238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997856,0.000029348566,0.000012407426,0.00006461728,0.000081137616,0.000026842348],"domain_scores_gemma":[0.99978894,0.000030660376,0.00004312144,0.000062824125,0.00005669406,0.000017740194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016206992,0.00047601011,0.00047546122,0.00024029828,0.00026050615,0.00046491652,0.0007898904,0.00029767567,0.0011580978],"category_scores_gemma":[0.00048501618,0.00015303105,0.00025923437,0.00028606888,0.00023022712,0.00056011835,0.0007330582,0.00037608662,0.0005508402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006584583,0.00016672646,0.005125519,0.00020178252,0.00010668503,0.0004971861,0.00036313548,0.34797066,0.15184928,0.011651406,0.006475896,0.4749333],"study_design_scores_gemma":[0.00003753547,0.00015932831,0.0007775924,0.000009061745,0.00002583229,0.00013698645,0.00003065166,0.97588205,0.017195968,0.0017706938,0.003952235,0.000022055361],"about_ca_topic_score_codex":0.001401575,"about_ca_topic_score_gemma":0.0018693792,"teacher_disagreement_score":0.001401575,"about_ca_system_score_codex":0.00023046695,"about_ca_system_score_gemma":0.00039429532,"threshold_uncertainty_score":0.0038741827},"labels":[],"label_agreement":null},{"id":"W4407357161","doi":"10.1016/j.sigpro.2025.109947","title":"Design and implementation of an adaptive extended Kalman filter with interval type-3 fuzzy set for an attitude and heading reference system","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Tabriz","keywords":"Heading (navigation); Kalman filter; Control theory (sociology); Interval (graph theory); Set (abstract data type); Attitude and heading reference system; Computer science; Fuzzy logic; Adaptive filter; Mathematics; Control engineering; Engineering; Artificial intelligence; Algorithm; Aerospace engineering","score_opus":0.036365046344989216,"score_gpt":0.3100645409717031,"score_spread":0.2736994946267139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407357161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011744246,0.00010251677,0.9857064,0.000045278808,0.000067549125,0.00005422762,0.00001970386,0.0003307676,0.001929253],"genre_scores_gemma":[0.72691005,0.00016814089,0.26937282,0.000089775596,0.000042214077,0.0002090756,0.00007010613,0.000025344745,0.003112438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967635,0.00004317139,0.000023933952,0.00008796807,0.00013293576,0.000035537498],"domain_scores_gemma":[0.99973375,0.000052687683,0.000034423836,0.000022960452,0.00014244327,0.0000137481775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049749675,0.0004410311,0.00060980546,0.00034070824,0.0005440955,0.00068497646,0.0009823365,0.0009283473,0.0017749497],"category_scores_gemma":[0.0006579345,0.00027420672,0.0006109754,0.00020380302,0.00030254736,0.00044105024,0.00034451258,0.00048315385,0.00036175194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066459173,0.00018842348,0.0023745126,0.0004324325,0.00023928873,0.00040416152,0.00039845798,0.51614606,0.12638609,0.018025998,0.0021226583,0.3326173],"study_design_scores_gemma":[0.000055498767,0.00023412584,0.00093136687,0.000020763686,0.00007057987,0.00008580878,0.000024053517,0.97884357,0.015300761,0.0009947326,0.0034100749,0.000028617973],"about_ca_topic_score_codex":0.008096307,"about_ca_topic_score_gemma":0.0058672517,"teacher_disagreement_score":0.008096307,"about_ca_system_score_codex":0.0004809464,"about_ca_system_score_gemma":0.00084705505,"threshold_uncertainty_score":0.01609838},"labels":[],"label_agreement":null},{"id":"W4407866962","doi":"10.1016/j.sigpro.2025.109953","title":"Analog filters based on the Mittag-Leffler functions","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Analogue filter; Electronic engineering; Computer science; Control theory (sociology); Digital filter; Engineering; Artificial intelligence; Telecommunications; Bandwidth (computing)","score_opus":0.02657348879844904,"score_gpt":0.27061646647206045,"score_spread":0.2440429776736114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407866962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010632966,0.0010934217,0.9770997,0.00023552624,0.00012959474,0.000038410744,0.000031768246,0.0006693987,0.010069236],"genre_scores_gemma":[0.5419902,0.0027596245,0.41936642,0.0005305198,0.0004540465,0.00022343485,0.00015869307,0.00029717432,0.034219805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937904,0.00022642422,0.000040297535,0.00006210849,0.00023353753,0.000058594447],"domain_scores_gemma":[0.99926156,0.00035989314,0.000070311646,0.0001132979,0.00016314337,0.000031705727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078189786,0.000991957,0.00054132985,0.0012472097,0.00043215047,0.0022192819,0.0006619766,0.0013065813,0.0041606296],"category_scores_gemma":[0.002695757,0.00028100717,0.00045910632,0.0009666696,0.00083742506,0.0017683853,0.0004911426,0.0013918066,0.002846367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043487153,0.00007908558,0.00042479206,0.00020111488,0.00006297668,0.00012560376,0.00030620108,0.031147841,0.05635369,0.676135,0.0033863874,0.23134251],"study_design_scores_gemma":[0.00013082617,0.0005231929,0.0010632614,0.00014354843,0.00013064737,0.00065596995,0.00008768766,0.5463736,0.118773215,0.26853153,0.06337533,0.00021119489],"about_ca_topic_score_codex":0.00036760446,"about_ca_topic_score_gemma":0.00045411589,"teacher_disagreement_score":0.0041606296,"about_ca_system_score_codex":0.0005411808,"about_ca_system_score_gemma":0.00033583437,"threshold_uncertainty_score":0.013918757},"labels":[],"label_agreement":null},{"id":"W4409709111","doi":"10.1016/j.sigpro.2025.110054","title":"Aggregated<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si132.svg\" display=\"inline\" id=\"d1e5359\"><mml:mi>f</mml:mi></mml:math>-average neural network applied to few-shot class incremental learning","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"HORIZON EUROPE European Research Council; European Research Council","keywords":"Scalable Vector Graphics; Artificial neural network; Mathematics; Discrete mathematics; Computer science; Algorithm; Artificial intelligence; World Wide Web","score_opus":0.013748573058295408,"score_gpt":0.24907060408241014,"score_spread":0.23532203102411473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409709111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024116149,0.0004241658,0.44716138,0.0027023028,0.0017721856,0.0003577275,0.1347549,0.1895118,0.2209038],"genre_scores_gemma":[0.04574285,0.0009891989,0.25445274,0.0013139027,0.00058769376,0.00070086063,0.2848032,0.06825789,0.34315172],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942553,0.00006509112,0.000050596755,0.00012907316,0.00027934386,0.00005027449],"domain_scores_gemma":[0.9985781,0.0002609199,0.000047488225,0.0004344327,0.00061460404,0.000064505504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063162314,0.0011832566,0.00078768627,0.0016471306,0.0005579258,0.0029351988,0.002657473,0.0014137998,0.45139018],"category_scores_gemma":[0.005235396,0.0005960978,0.0007263764,0.002680486,0.0003440534,0.002989642,0.0016402447,0.0015530318,0.2758545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000983888,0.00004002424,0.00016978818,0.0002647908,0.000020583937,0.000059360635,0.000043919896,0.0023271455,0.002854584,0.017794263,0.8681748,0.10815229],"study_design_scores_gemma":[0.000082319755,0.000034749006,0.00089031074,0.00008390943,0.000016604079,0.00016069939,0.00003848188,0.066319585,0.017300284,0.039400768,0.8756195,0.00005276585],"about_ca_topic_score_codex":0.0125082275,"about_ca_topic_score_gemma":0.020097837,"teacher_disagreement_score":0.45139018,"about_ca_system_score_codex":0.0014997843,"about_ca_system_score_gemma":0.001125415,"threshold_uncertainty_score":0.7825253},"labels":[],"label_agreement":null},{"id":"W4410252383","doi":"10.1016/j.sigpro.2025.110077","title":"Imputation of time-varying edge flows in graphs by multilinear kernel regression and manifold learning","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Air Force Office of Scientific Research; Japan Science and Technology Agency","keywords":"Multilinear map; Imputation (statistics); Regression; Mathematics; Kernel regression; Kernel (algebra); Artificial intelligence; Enhanced Data Rates for GSM Evolution; Computer science; Pattern recognition (psychology); Statistics; Combinatorics; Missing data; Pure mathematics","score_opus":0.006425661802753713,"score_gpt":0.26826590457837063,"score_spread":0.2618402427756169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410252383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952712,0.0001718376,0.9823599,0.00028102795,0.00007523943,0.000021597263,0.00025527508,0.00069788867,0.00018449905],"genre_scores_gemma":[0.60553175,0.0005684219,0.38375357,0.00024363556,0.00036262805,0.00020542053,0.0030454083,0.00047943334,0.005809729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978536,0.00095327635,0.000100114565,0.00073231454,0.00020679136,0.00015387786],"domain_scores_gemma":[0.98330265,0.010719108,0.0014741985,0.0026727312,0.0013860764,0.0004453093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050901524,0.0015605942,0.0023089226,0.0022867771,0.0007980608,0.0019204774,0.004629929,0.0043450855,0.0019539888],"category_scores_gemma":[0.029590407,0.0013974733,0.0021664165,0.002862666,0.0017259627,0.004127844,0.0019610343,0.005708857,0.0016186461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020021715,0.00023995878,0.004523342,0.000105045794,0.00018065546,0.00014494425,0.00012692323,0.8959016,0.0008417528,0.018986426,0.0049425303,0.073806666],"study_design_scores_gemma":[0.0000053429367,0.00000855437,0.00020370175,0.0000051501333,0.0000068048253,0.0000124826,0.000006623885,0.9875668,0.00014899514,0.011834785,0.00019367783,0.00000713177],"about_ca_topic_score_codex":0.0071794037,"about_ca_topic_score_gemma":0.0061019296,"teacher_disagreement_score":0.0071794037,"about_ca_system_score_codex":0.000993008,"about_ca_system_score_gemma":0.0013589892,"threshold_uncertainty_score":0.026919603},"labels":[],"label_agreement":null},{"id":"W4411302560","doi":"10.1016/j.sigpro.2025.110138","title":"On adaptive multichannel dereverberation based on dichotomous coordinate descent and data-reuse techniques","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Natural Science Foundation of China; Shanghai Lingjun Program","keywords":"Coordinate descent; Computer science; Reuse; Algorithm; Mathematics; Engineering","score_opus":0.02535365993726266,"score_gpt":0.2920354768637592,"score_spread":0.2666818169264965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411302560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011292507,0.0005607547,0.9847115,0.00010150397,0.000101005506,0.00002008994,0.000018362603,0.00011932485,0.0030750055],"genre_scores_gemma":[0.36414018,0.0017210153,0.62085885,0.00023516377,0.00022308792,0.00010759208,0.00012657137,0.000121226665,0.012466286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.00014513938,0.00001824682,0.00006820631,0.0001362824,0.000037931477],"domain_scores_gemma":[0.999691,0.00015868542,0.000020669193,0.000050966875,0.000065483655,0.000013345772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047549157,0.0007650987,0.00076622964,0.0003103441,0.00035923542,0.00049591326,0.00052537373,0.00059383916,0.001740402],"category_scores_gemma":[0.0009387299,0.00026837867,0.0005460529,0.0006716778,0.00063491106,0.00076184986,0.0006975769,0.00065225683,0.00050199544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006874745,0.00019948567,0.0010914996,0.00030349146,0.00021218194,0.000248037,0.0003538655,0.32335487,0.1282105,0.11484164,0.005188528,0.4253084],"study_design_scores_gemma":[0.000019111527,0.00008486429,0.00031160412,0.000010588494,0.000018729674,0.00011593159,0.000011641991,0.9812732,0.009665141,0.0052409377,0.0032247799,0.00002350666],"about_ca_topic_score_codex":0.0019562142,"about_ca_topic_score_gemma":0.003771409,"teacher_disagreement_score":0.0019562142,"about_ca_system_score_codex":0.0003329853,"about_ca_system_score_gemma":0.0004973659,"threshold_uncertainty_score":0.0058221817},"labels":[],"label_agreement":null},{"id":"W4412425365","doi":"10.1016/j.sigpro.2025.110179","title":"Performance analysis of Quaternion-MUSIC: Unification, simplification, and evaluation","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Taishan Scholar Project of Shandong Province","keywords":"Unification; Quaternion; Algebra over a field; Computer science; Mathematics; Speech recognition; Algorithm; Applied mathematics; Arithmetic; Calculus (dental); Pure mathematics; Programming language; Geometry","score_opus":0.02585280732697223,"score_gpt":0.3139844720401824,"score_spread":0.2881316647132102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412425365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072424114,0.0028315282,0.9147995,0.0003633319,0.00016999412,0.00011335729,0.00030147165,0.0029221685,0.0060745534],"genre_scores_gemma":[0.71400326,0.0018201045,0.2786968,0.00011795588,0.00020529637,0.000095674935,0.0013080529,0.0007075356,0.0030453734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724007,0.0007722637,0.000167721,0.00026833068,0.001299413,0.00025226595],"domain_scores_gemma":[0.9950016,0.0025010244,0.00027864947,0.00076111907,0.0013366007,0.00012098748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032446617,0.0014716687,0.0011566911,0.0018764687,0.000588762,0.0017166303,0.00097127206,0.00089989987,0.004366103],"category_scores_gemma":[0.012682545,0.00025890683,0.0005243891,0.0021221146,0.00055073656,0.0016239648,0.0014015643,0.00074103154,0.0014694226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002218636,0.00025523233,0.004105356,0.0005874874,0.00023310776,0.00018677292,0.00020398345,0.23338364,0.052871518,0.014065724,0.0043572052,0.6875313],"study_design_scores_gemma":[0.00003416719,0.00037320016,0.0019121619,0.000022595197,0.00004761357,0.0002051825,0.00006297837,0.9681966,0.025240215,0.0014938937,0.0023787562,0.000032523058],"about_ca_topic_score_codex":0.0044245874,"about_ca_topic_score_gemma":0.004005175,"teacher_disagreement_score":0.0044245874,"about_ca_system_score_codex":0.00075492414,"about_ca_system_score_gemma":0.0011894883,"threshold_uncertainty_score":0.01715964},"labels":[],"label_agreement":null},{"id":"W4412688140","doi":"10.1016/j.sigpro.2025.110189","title":"A unified Bayesian perspective for conventional and robust adaptive filters","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"EduCanada","keywords":"Perspective (graphical); Bayesian probability; Computer science; Adaptive filter; Artificial intelligence; Mathematics; Algorithm","score_opus":0.019585507650321615,"score_gpt":0.2635281110454957,"score_spread":0.24394260339517412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412688140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071084814,0.0016295623,0.9906228,0.001226413,0.00013915182,0.0000110415485,0.000057506648,0.000036359615,0.005566283],"genre_scores_gemma":[0.24239384,0.010996489,0.72083807,0.0021155179,0.004680836,0.00034552193,0.00037521217,0.00023526544,0.01801932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601823,0.0015765292,0.00027022057,0.00052880845,0.0014340779,0.00017214309],"domain_scores_gemma":[0.99208516,0.004944563,0.00043368747,0.000790593,0.0015420932,0.000203932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067100963,0.0014733656,0.0017521867,0.0022634335,0.0010259349,0.005542322,0.0033246265,0.0042289845,0.004051928],"category_scores_gemma":[0.01629682,0.0011293133,0.001444176,0.0020726416,0.0038442085,0.0074449927,0.0023384064,0.0041816444,0.001170661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009708432,0.000012156043,0.00008284679,0.000060465416,0.000024416704,0.000054396693,0.000076923134,0.01100353,0.0003452142,0.97216976,0.0012740074,0.014886619],"study_design_scores_gemma":[0.0000099626195,0.00001887325,0.00012755887,0.000047095884,0.000023883724,0.000071171904,0.000029238823,0.075271025,0.0001844167,0.9162321,0.007959853,0.000024729476],"about_ca_topic_score_codex":0.003190861,"about_ca_topic_score_gemma":0.0035134247,"teacher_disagreement_score":0.0067100963,"about_ca_system_score_codex":0.0018817381,"about_ca_system_score_gemma":0.0016662999,"threshold_uncertainty_score":0.035486817},"labels":[],"label_agreement":null},{"id":"W4412764230","doi":"10.1016/j.sigpro.2025.110210","title":"A third-order tensor decomposition based algorithm for speech dereverberation","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Tensor decomposition; Tensor (intrinsic definition); Speech recognition; Order (exchange); Computer science; Decomposition; Algorithm; Mathematics; Pure mathematics","score_opus":0.011764225301461075,"score_gpt":0.2882761291536431,"score_spread":0.276511903852182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412764230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022075297,0.0000854253,0.9962309,0.00006116575,0.000059786184,0.000030762585,0.00006103656,0.00082078594,0.00044260747],"genre_scores_gemma":[0.016781691,0.00013330545,0.97982955,0.000035075507,0.000031353506,0.000059891085,0.00026321883,0.00022248374,0.002643523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937767,0.000099743695,0.000044703196,0.00012330053,0.0002834402,0.000071275994],"domain_scores_gemma":[0.9988807,0.00018210919,0.00007018009,0.00018696494,0.0006000704,0.000080021855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091386936,0.0012945117,0.0008783964,0.0010089263,0.0008274907,0.0011769572,0.0011740319,0.0010072341,0.006493854],"category_scores_gemma":[0.0020464396,0.0004298614,0.0009943623,0.0011680267,0.00045167905,0.0012556274,0.0010025249,0.0016880318,0.0038238605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028700818,0.00012417462,0.0004697967,0.00012473554,0.000066235174,0.000071442664,0.00012337501,0.035327617,0.09972201,0.012646782,0.0070288815,0.8440079],"study_design_scores_gemma":[0.000025414754,0.00011032562,0.0006028669,0.000016633025,0.00003079849,0.00021160863,0.00004013928,0.9377147,0.042972744,0.004260979,0.0139683895,0.000045378478],"about_ca_topic_score_codex":0.0072013247,"about_ca_topic_score_gemma":0.010322982,"teacher_disagreement_score":0.0072013247,"about_ca_system_score_codex":0.00064448576,"about_ca_system_score_gemma":0.0018186017,"threshold_uncertainty_score":0.021724164},"labels":[],"label_agreement":null},{"id":"W4412791536","doi":"10.1016/j.sigpro.2025.110211","title":"A novel hybrid active noise control system capable of suppressing two correlated noise sources","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Japan Society for the Promotion of Science; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Active noise control; Noise (video); Computer science; Noise control; Control theory (sociology); Electronic engineering; Control (management); Engineering; Noise reduction; Artificial intelligence","score_opus":0.007452068494141907,"score_gpt":0.2287226212783953,"score_spread":0.2212705527842534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076955356,0.0004891833,0.9150158,0.00016845032,0.00031371147,0.00007413189,0.000048855218,0.0011496426,0.0057848836],"genre_scores_gemma":[0.8276022,0.00017542404,0.1592215,0.0003016749,0.00020445796,0.00013997179,0.00010140552,0.00005262977,0.012200852],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999673,0.000032236414,0.000018320487,0.000112334936,0.00013334112,0.000030725514],"domain_scores_gemma":[0.9997477,0.000048822687,0.00003405767,0.00003064397,0.000109314096,0.000029404044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026619196,0.00052626885,0.0005350061,0.00039875365,0.00061987643,0.00075269304,0.0012471516,0.00083556504,0.0018674175],"category_scores_gemma":[0.00025832665,0.00023250874,0.000241681,0.00025740542,0.00030124927,0.0006041195,0.00061398046,0.0003696497,0.0006670706],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006109771,0.00025113052,0.0010050439,0.00020883542,0.00009183918,0.0003523254,0.0001618516,0.011979047,0.750179,0.005785462,0.0017659299,0.22760864],"study_design_scores_gemma":[0.00017585607,0.0012293104,0.0029198725,0.00004960433,0.00018932424,0.00093771337,0.000042897576,0.7275445,0.24767745,0.0020579824,0.017067514,0.00010803411],"about_ca_topic_score_codex":0.00068349874,"about_ca_topic_score_gemma":0.001732008,"teacher_disagreement_score":0.0018674175,"about_ca_system_score_codex":0.0001929512,"about_ca_system_score_gemma":0.00030336707,"threshold_uncertainty_score":0.006247103},"labels":[],"label_agreement":null},{"id":"W4413237403","doi":"10.1016/j.sigpro.2025.110234","title":"Joint range-azimuth resolution limit for radar coincidence imaging based on spatial information theory","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced SAR Imaging Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Shenzhen Science and Technology Innovation Program; Graduate Research and Innovation Projects of Jiangsu Province; National Natural Science Foundation of China","keywords":"Azimuth; Joint (building); Coincidence; Radar; Radar imaging; Range (aeronautics); Remote sensing; Computer science; Limit (mathematics); Image resolution; Physics; Geology; Optics; Telecommunications; Artificial intelligence; Mathematics; Engineering; Aerospace engineering; Mathematical analysis","score_opus":0.009014156769338305,"score_gpt":0.2429685469839439,"score_spread":0.2339543902146056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038050562,0.002046585,0.9353002,0.00084507826,0.00013390351,0.000029361388,0.00013971806,0.0003714692,0.023083223],"genre_scores_gemma":[0.7920844,0.0018527132,0.19874826,0.00060471625,0.00030715237,0.00016973188,0.0003915373,0.00030348075,0.005537986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976562,0.00051762676,0.00010219675,0.0003432633,0.0011662695,0.0002145142],"domain_scores_gemma":[0.9938221,0.0042055394,0.00044831497,0.0005965878,0.0006752976,0.00025211682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035248015,0.0008455153,0.0012645189,0.0013499092,0.0008899138,0.002835013,0.0012411884,0.0017924092,0.0029044915],"category_scores_gemma":[0.010317051,0.0006994928,0.0005720625,0.0014468975,0.0022900694,0.0055097993,0.0042443555,0.002973845,0.0009287131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045871336,0.00009193728,0.00120932,0.00040386876,0.00008125361,0.00033437222,0.00022617876,0.025054092,0.040120795,0.89986074,0.0025515617,0.02960726],"study_design_scores_gemma":[0.000029500023,0.00009075301,0.00097037625,0.000111875146,0.00004773367,0.00090724195,0.00008457732,0.568712,0.036459416,0.3891997,0.0032910143,0.00009578456],"about_ca_topic_score_codex":0.00032140437,"about_ca_topic_score_gemma":0.00029632612,"teacher_disagreement_score":0.0035248015,"about_ca_system_score_codex":0.0009897692,"about_ca_system_score_gemma":0.0010420667,"threshold_uncertainty_score":0.018641114},"labels":[],"label_agreement":null},{"id":"W4413326883","doi":"10.1016/j.sigpro.2025.110244","title":"A multi-stage few-shot framework for extensible radar-based human activity recognition","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced SAR Imaging Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Radar; Computer science; Stage (stratigraphy); Shot (pellet); Artificial intelligence; Extensibility; Pattern recognition (psychology); Geology; Telecommunications; Materials science; Programming language","score_opus":0.08304366614017664,"score_gpt":0.36748710413798746,"score_spread":0.2844434379978108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413326883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015434275,0.000090709495,0.9962852,0.000015982981,0.000018898803,0.000028303819,0.000082907995,0.0016331112,0.00030152156],"genre_scores_gemma":[0.10954322,0.00034979457,0.8836185,0.00013077876,0.00008643585,0.0001661376,0.0010522784,0.0004529686,0.0045999256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996039,0.000047043,0.000021556163,0.00012213622,0.00014649359,0.000058884285],"domain_scores_gemma":[0.9996761,0.00006674676,0.00002367262,0.00007994913,0.000110354114,0.000043110405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066160597,0.0010061015,0.0012361447,0.0008723788,0.00035089208,0.0008635745,0.002275313,0.00097221264,0.003989863],"category_scores_gemma":[0.0010808402,0.0005633292,0.0010758251,0.0006598237,0.00030394172,0.0010896833,0.001806239,0.0012806033,0.0024055967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038807886,0.00039827524,0.0013318234,0.00019664601,0.00021624587,0.00032075602,0.00012971158,0.12411522,0.08776654,0.008957973,0.007133481,0.7690452],"study_design_scores_gemma":[0.0000094731,0.00006353589,0.0004736772,0.000010799942,0.000025932632,0.00014134054,0.000016027203,0.9839526,0.008440868,0.004006627,0.0028386626,0.000020473044],"about_ca_topic_score_codex":0.006280164,"about_ca_topic_score_gemma":0.013341603,"teacher_disagreement_score":0.006280164,"about_ca_system_score_codex":0.0002834566,"about_ca_system_score_gemma":0.00084254635,"threshold_uncertainty_score":0.013347447},"labels":[],"label_agreement":null},{"id":"W645359941","doi":"10.1016/j.sigpro.2015.05.014","title":"Theoretical results for sparse signal recovery with noises using generalized OMP algorithm","year":2015,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"","keywords":"Matching pursuit; Iterated function; Algorithm; Stopping rule; Isometry (Riemannian geometry); SIGNAL (programming language); Signal reconstruction; Mathematics; Sparse approximation; Signal recovery; Constant (computer programming); Signal processing; Computer science; Compressed sensing; Mathematical optimization; Mathematical analysis","score_opus":0.04054572021444735,"score_gpt":0.26355870922858504,"score_spread":0.22301298901413769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W645359941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038666169,0.0014928078,0.9818672,0.00079281896,0.00017843438,0.000020315374,0.00009024583,0.000073092284,0.011618551],"genre_scores_gemma":[0.33678943,0.014376357,0.62108624,0.0018392163,0.0022619006,0.00046206926,0.000815032,0.00042406996,0.021945726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.0002998159,0.000053423173,0.00013248945,0.0004419867,0.00009307708],"domain_scores_gemma":[0.9963799,0.002417405,0.00017661581,0.00028152642,0.00064858026,0.00009597702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199393,0.0017986197,0.0010429268,0.0025365648,0.00066177285,0.0017617808,0.001498219,0.0019872559,0.004522849],"category_scores_gemma":[0.0093716765,0.00050658936,0.0012864021,0.0023960024,0.002839947,0.0035545893,0.0029873303,0.003965727,0.001322402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008004021,0.000050093426,0.00022019699,0.00044066855,0.00004833208,0.00018394884,0.000188996,0.09826552,0.004493627,0.8508156,0.0042451955,0.040967833],"study_design_scores_gemma":[0.000012297691,0.000043055585,0.00017298874,0.0000741551,0.000026833643,0.0001934312,0.00006200199,0.46446323,0.0016682463,0.52817553,0.0050772657,0.000031015028],"about_ca_topic_score_codex":0.0011368283,"about_ca_topic_score_gemma":0.000786349,"teacher_disagreement_score":0.004522849,"about_ca_system_score_codex":0.0008409166,"about_ca_system_score_gemma":0.00090275495,"threshold_uncertainty_score":0.01513046},"labels":[],"label_agreement":null},{"id":"W66172763","doi":"10.1016/j.sigpro.2004.05.001","title":"New trends and findings in antenna array processing for radar","year":2004,"lang":"en","type":"article","venue":"Signal Processing","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Radar; Antenna array; Antenna (radio); Computer science; Array processing; Telecommunications; Remote sensing; Signal processing; Electronic engineering; Engineering; Geography","score_opus":0.011277327449187365,"score_gpt":0.2238968680981349,"score_spread":0.21261954064894753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66172763","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019828657,0.27341074,0.6384588,0.021026663,0.0030304512,0.00008662533,0.0002763058,0.0006815614,0.043200143],"genre_scores_gemma":[0.17128092,0.33700058,0.4521738,0.0074002077,0.010886462,0.0001474552,0.0005572931,0.00043121027,0.020122165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918824,0.00019525613,0.0000540536,0.00014951159,0.00036058488,0.000052360872],"domain_scores_gemma":[0.99658394,0.0021637075,0.00012270798,0.0002808112,0.000714332,0.00013444357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019406093,0.00079264864,0.000913414,0.0011143506,0.00035584718,0.00315226,0.001195671,0.0017343971,0.0058029667],"category_scores_gemma":[0.0047463845,0.0004354431,0.00055970397,0.0017584823,0.0017035172,0.005070327,0.00096054235,0.0029420643,0.0020254818],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026320122,0.00031097772,0.0027015803,0.002528037,0.00012675808,0.00023386728,0.00043900582,0.022522265,0.023587903,0.33092108,0.023837414,0.592528],"study_design_scores_gemma":[0.0000807291,0.00043459365,0.002938986,0.0008139606,0.00013572053,0.0011423056,0.00085044524,0.14443861,0.014233701,0.4702627,0.36451316,0.0001551965],"about_ca_topic_score_codex":0.0004806075,"about_ca_topic_score_gemma":0.0007646013,"teacher_disagreement_score":0.0058029667,"about_ca_system_score_codex":0.0005436994,"about_ca_system_score_gemma":0.0007161986,"threshold_uncertainty_score":0.019412816},"labels":[],"label_agreement":null},{"id":"W7116371784","doi":"10.1016/j.sigpro.2025.110451","title":"Imaging coupled filtering: A unified multi-channel framework for multimodal medical image registration and fusion","year":2025,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"National Natural Science Foundation of China","keywords":"Image fusion; Medical imaging; Feature (linguistics); Pattern recognition (psychology); Benchmark (surveying); Smoothing; Fusion; Feature extraction","score_opus":0.012732848034940484,"score_gpt":0.2971015682368053,"score_spread":0.2843687202018648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116371784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039683265,0.00009094234,0.9990007,0.000033954486,0.000011414303,0.000011357417,0.000022377508,0.00015216749,0.00028020816],"genre_scores_gemma":[0.04405753,0.0008138072,0.9515592,0.00015816698,0.00011389658,0.00014308629,0.00024157918,0.00029698428,0.0026157144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902856,0.0002916615,0.000062608524,0.00015129845,0.0003903692,0.000075509786],"domain_scores_gemma":[0.9994573,0.00015547122,0.00006621991,0.00012720669,0.0001577705,0.00003599123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748469,0.0011001445,0.0011875824,0.0013673713,0.00046588495,0.002077482,0.001843999,0.0018148724,0.0025926016],"category_scores_gemma":[0.002551547,0.0005897167,0.0017120033,0.0017578028,0.00080502743,0.0018964976,0.002127623,0.0014245259,0.0014744567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029272612,0.00015970899,0.0007127179,0.00044158846,0.000384389,0.0003268356,0.0002943972,0.25099716,0.08884872,0.13331512,0.006909767,0.5173169],"study_design_scores_gemma":[0.000014677779,0.000081100654,0.00039885423,0.000031573956,0.00008347405,0.00024117787,0.00003080351,0.94285095,0.014248915,0.03205668,0.009907199,0.00005457405],"about_ca_topic_score_codex":0.0034030408,"about_ca_topic_score_gemma":0.0051679495,"teacher_disagreement_score":0.0034030408,"about_ca_system_score_codex":0.0006217569,"about_ca_system_score_gemma":0.0016078937,"threshold_uncertainty_score":0.009246945},"labels":[],"label_agreement":null},{"id":"W840214300","doi":"10.1016/j.sigpro.2015.04.010","title":"On imperfect pricing in globally constrained noncooperative games for cognitive radio networks","year":2015,"lang":"en","type":"article","venue":"Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Imperfect; Cognitive radio; Nash equilibrium; Mathematical optimization; Mathematical economics; Perfect information; Computer science; Monotone polygon; Class (philosophy); Contrast (vision); Economics; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.019720696094135584,"score_gpt":0.26969177196970173,"score_spread":0.24997107587556616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W840214300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09248019,0.0036022416,0.83815926,0.006829005,0.0007119709,0.0002886875,0.0005947852,0.00020779068,0.05712606],"genre_scores_gemma":[0.9459375,0.0032385876,0.02874763,0.00095393526,0.0006643214,0.00029915708,0.00023454611,0.00014903895,0.019775305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592894,0.002314385,0.00015601836,0.00048751922,0.0005223875,0.0005907166],"domain_scores_gemma":[0.97051156,0.024335347,0.0018592051,0.0008143517,0.0012766673,0.0012029022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061597605,0.0032183176,0.0058924844,0.0015801708,0.0014895919,0.00586968,0.0035515286,0.0047293208,0.008764714],"category_scores_gemma":[0.03142799,0.0019332819,0.0016990774,0.0023614932,0.0080413995,0.008182707,0.0044890195,0.0055754613,0.0004678968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019799637,0.00012978568,0.00045025253,0.00024981084,0.00010466124,0.00029731804,0.0002965573,0.41404495,0.0005506234,0.5740688,0.004641499,0.0049677496],"study_design_scores_gemma":[0.00006151347,0.00005374892,0.00020086142,0.00005113935,0.000033650456,0.000038143506,0.000097879725,0.5855802,0.000087784014,0.4129126,0.00083781546,0.000044548415],"about_ca_topic_score_codex":0.010106885,"about_ca_topic_score_gemma":0.0070871115,"teacher_disagreement_score":0.010106885,"about_ca_system_score_codex":0.0043908083,"about_ca_system_score_gemma":0.0035138552,"threshold_uncertainty_score":0.032576382},"labels":[],"label_agreement":null}]}