{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":557,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":557,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"506dc85b86f0","filters":{"topic":"Digital Filter Design and Implementation"}},"results":[{"id":"W2480439833","doi":"10.1016/b978-012373624-6/50003-5","title":"Discrete Cosine and Sine Transforms","year":2007,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Sine; Discrete cosine transform; Trigonometric functions; Mathematics; Fourier sine and cosine series; Discrete sine transform; Sine and cosine transforms; Mathematical analysis; Computer science; Geometry; Artificial intelligence; Fourier transform; Fourier analysis; Fractional Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.03104246352566212,"gpt":0.269611552803315,"spread":0.2385690892776529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001950265,0.0003313471,0.0003090819,0.0001755706,0.00007628897,0.0002690832,0.0004002758,0.0001331322,0.00004280197],"category_scores_gemma":[0.000002730171,0.0002815163,0.0001058501,0.0000184017,0.00009168786,0.0003359127,0.000128006,0.0001937033,0.00006842642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004089762,"about_ca_system_score_gemma":0.00004574559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.647046e-7,"about_ca_topic_score_gemma":0.00001191152,"domain_scores_codex":[0.998518,0.000007164184,0.0003915523,0.0004582736,0.0003374843,0.0002874489],"domain_scores_gemma":[0.9992122,0.00003640892,0.0001230988,0.0004165733,0.00005603566,0.0001556605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000524437,0.000002481062,7.940293e-7,0.00003214273,0.00002538546,0.00002191799,0.0001688315,5.215559e-8,0.00003431343,0.08855603,0.0001006723,0.9110522],"study_design_scores_gemma":[0.0003663604,0.0001707197,0.00002254165,0.0001895645,0.00002423779,0.0000475059,0.00000203134,0.00008973227,0.0002604452,0.04611946,0.9522965,0.0004108786],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000005589465,0.0003254645,0.03398711,0.0001549176,0.0001754627,0.0004089163,0.00002114104,0.0001085505,0.9648129],"genre_scores_gemma":[0.001604923,0.00006525929,0.004602199,0.0008019214,0.0001265461,0.000008908021,0.00004382904,0.00004097213,0.9927055],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9521958,"threshold_uncertainty_score":0.9999637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041808434","doi":"10.1049/el:20082239","title":"Low-complexity 8×8 transform for image compression","year":2008,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Discrete cosine transform; Image compression; Transform coding; Discrete sine transform; Algorithm; Modified discrete cosine transform; Discrete Hartley transform; Data compression; Mathematics; Compression (physics); Discrete Fourier transform (general); Lapped transform; Computation; Matrix (chemical analysis); Reduction (mathematics); S transform; Image (mathematics); Arithmetic; Computer science; Fractional Fourier transform; Image processing; Computer vision; Fourier transform; Wavelet transform; Mathematical analysis; Discrete wavelet transform; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.0334821053465562,"gpt":0.2659717262750284,"spread":0.2324896209284721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009704589,0.0001231921,0.0001146938,0.00006347637,0.0001954065,0.00009994499,0.0004769119,0.0000220572,0.000007973948],"category_scores_gemma":[0.000005223254,0.0001191826,0.00008942441,0.0001478945,0.00005139162,0.0009054605,0.00003209505,0.00008817697,0.00002196656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008807624,"about_ca_system_score_gemma":0.0000544572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004145041,"about_ca_topic_score_gemma":0.00000427136,"domain_scores_codex":[0.9988992,0.00002022063,0.0001816961,0.0002702427,0.000192104,0.0004365223],"domain_scores_gemma":[0.9995633,0.00004301995,0.0000485657,0.0002505429,0.00003302611,0.00006149922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007572254,0.0002291682,0.00004754542,0.00007328053,0.0000426583,0.00002735655,0.001609189,0.00003742496,0.7225972,0.07547496,0.1050321,0.09475341],"study_design_scores_gemma":[0.002764253,0.0006344166,0.001147472,0.00002569934,0.00001154039,0.0001250783,0.00001152615,0.02064127,0.8818293,0.02330813,0.06878318,0.0007181777],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05262093,0.00003574429,0.9400826,0.005767636,0.0001256179,0.0003475835,0.000007350156,0.0001428213,0.0008697039],"genre_scores_gemma":[0.933227,0.00002992058,0.06028131,0.006058848,0.00009071177,0.00006994684,0.00006762408,0.00002080662,0.0001538051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8806061,"threshold_uncertainty_score":0.4860126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167425979","doi":"10.1109/iccit.2008.131","title":"High Speed VLSI Implementation of the Hyperbolic Tangent Sigmoid Function","year":2008,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Hyperbolic function; Sigmoid function; Decoding methods; Lookup table; Tangent; Function (biology); Computer science; Exponential function; Activation function; Range (aeronautics); Very-large-scale integration; Algorithm; Inverse hyperbolic function; Artificial neural network; Mathematics; Arithmetic; Artificial intelligence; Mathematical analysis; Hyperbolic manifold; Geometry; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.03136584253642447,"gpt":0.2534214218179986,"spread":0.2220555792815741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008202146,0.00007622419,0.00007631374,0.00005082496,0.00009139399,0.00003955132,0.0003198233,0.00001548262,0.0001465678],"category_scores_gemma":[0.000004138561,0.0000527645,0.0000558438,0.0003113327,0.00002584542,0.0006241499,0.0001040113,0.00002935951,0.00003655226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003026696,"about_ca_system_score_gemma":0.00004739934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002238521,"about_ca_topic_score_gemma":0.00003081345,"domain_scores_codex":[0.9991562,0.00003499927,0.0002286109,0.0001619711,0.0002821291,0.0001361092],"domain_scores_gemma":[0.9994979,0.00001733496,0.00009682377,0.0002937957,0.00006240864,0.00003172535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002885747,0.0002605098,0.02739177,0.00003456192,0.0001100809,0.000004749028,0.00355886,0.0001256395,0.2163478,0.3825595,0.04189651,0.3276811],"study_design_scores_gemma":[0.001417797,0.0004525353,0.4983339,0.000007672132,0.00002475247,0.00003680759,0.0003935965,0.001323892,0.4840045,0.006285708,0.007449638,0.000269168],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7678535,0.00001757842,0.2257246,0.0008215149,0.0006648189,0.0003644151,0.000005735404,0.00009213691,0.004455646],"genre_scores_gemma":[0.9957225,0.000006767096,0.002935061,0.0005638271,0.00003877523,0.000005203217,0.000007636365,0.000004407427,0.00071583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4709422,"threshold_uncertainty_score":0.2151674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971081516","doi":"10.1080/10652469.2011.623350","title":"The incomplete Pochhammer symbols and their applications to hypergeometric and related functions","year":2011,"lang":"en","type":"article","venue":"Integral Transforms and Special Functions","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Generalized hypergeometric function; Hypergeometric function; Generalization; Hypergeometric function of a matrix argument; Pure mathematics; Special functions; Algebra over a field; Class (philosophy); Hypergeometric distribution; Mathematical analysis; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03620437961624186,"gpt":0.2327523009411531,"spread":0.1965479213249112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001507624,0.0001535457,0.0001257634,0.0002188424,0.0008557466,0.0004193333,0.0001719384,0.00004509871,0.00005432313],"category_scores_gemma":[0.00001425765,0.00009333955,0.00005079716,0.0007981493,0.0001332785,0.0006211791,0.00005488319,0.0001348766,0.00003970569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001821038,"about_ca_system_score_gemma":0.00002595891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092044,"about_ca_topic_score_gemma":0.0002784682,"domain_scores_codex":[0.9990899,0.00001875944,0.0002580296,0.0003007421,0.00009944327,0.0002331395],"domain_scores_gemma":[0.9994177,0.0001014906,0.000030774,0.0002028621,0.00007056313,0.0001766707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002451828,0.00005046919,0.0008090694,0.000004779607,0.00005548734,6.593618e-7,0.002635965,4.003561e-7,0.0003997502,0.2399202,0.001534465,0.7545642],"study_design_scores_gemma":[0.001369081,0.001514635,0.1139074,0.00003796622,0.00008087735,0.0002538812,0.006606411,0.0009131099,0.0005541922,0.1921027,0.6817933,0.0008664941],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05514921,0.0002739177,0.8795288,0.001916678,0.0007275891,0.0009172818,0.00008424475,0.0001435617,0.06125867],"genre_scores_gemma":[0.9953607,0.0001906671,0.001132477,0.0002320029,0.0001883135,0.0001950683,0.00001623313,0.00001202607,0.002672484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9402115,"threshold_uncertainty_score":0.6581797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116925983","doi":"10.1109/iscas.2011.5938023","title":"A low-complexity parametric transform for image compression","year":2011,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Computational complexity theory; Image compression; Parametric statistics; Computer science; Transform coding; Image (mathematics); Computation; Data compression; Compression (physics); Discrete cosine transform; Top-hat transform; S transform; Simple (philosophy); Multiplication (music); Image processing; Artificial intelligence; Mathematics; Digital image processing; Wavelet transform","retraction":null,"screen_n_in":null,"score":{"opus":0.1360563521801954,"gpt":0.3065258259649642,"spread":0.1704694737847688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001065713,0.00008409463,0.00008831377,0.0001027463,0.00006337174,0.0001273296,0.0004249013,0.00001951253,0.0001035677],"category_scores_gemma":[0.000009280494,0.00006726677,0.00006378878,0.0002632019,0.00002661873,0.001171898,0.00004397238,0.00002734395,0.00005382823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001469082,"about_ca_system_score_gemma":0.00001620471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003134047,"about_ca_topic_score_gemma":0.000005440798,"domain_scores_codex":[0.9992822,0.00001222905,0.0001708755,0.0002100629,0.0001228223,0.0002018538],"domain_scores_gemma":[0.9995794,0.00004191583,0.00003468148,0.0002222148,0.00005211756,0.00006969718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005608594,0.0004806084,0.00008156077,0.00008183846,0.00001711548,0.000004714556,0.00171777,4.361005e-7,0.005289488,0.3698296,0.0141812,0.6082596],"study_design_scores_gemma":[0.002067487,0.0008289862,0.007434078,0.000024338,0.00001065393,0.00001483515,0.0000938817,0.04155113,0.5940706,0.3471063,0.006295518,0.0005021982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002601812,0.000004650587,0.9428681,0.00009710781,0.0001162765,0.0003618737,0.000007259869,0.0001445707,0.05379831],"genre_scores_gemma":[0.6543429,0.000001348828,0.3448334,0.0002667014,0.00001163858,0.0000355849,0.000009026227,0.000004892836,0.000494451],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6517411,"threshold_uncertainty_score":0.2743059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110860373","doi":"10.1109/78.839988","title":"Design of orthogonal pulse shapes for communications via semidefinite programming","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Bandwidth (computing); Convex optimization; Pulse shaping; Algorithm; Computer science; Spectral efficiency; Robustness (evolution); Mathematics; Digital filter; Matched filter; Electronic engineering; Mathematical optimization; Telecommunications; Channel (broadcasting); Regular polygon; Optics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0697757718180618,"gpt":0.3054178187978334,"spread":0.2356420469797716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002769028,0.0001481142,0.0001560367,0.000149625,0.0003518419,0.0002246825,0.000615766,0.00004647837,0.00007368548],"category_scores_gemma":[0.000001566736,0.0001488864,0.000088423,0.000468097,0.00007764619,0.001178265,0.000002564983,0.0001157402,0.00001497743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003056209,"about_ca_system_score_gemma":0.0001145179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005182274,"about_ca_topic_score_gemma":0.000003003446,"domain_scores_codex":[0.9987882,0.00006637131,0.0003917384,0.0002693619,0.0002360462,0.0002482191],"domain_scores_gemma":[0.9991685,0.000232164,0.0001132648,0.0002725214,0.0001446631,0.00006887808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005152045,0.0002038641,0.000001283618,0.00004136111,0.00001820993,4.42556e-7,0.0004956836,0.007355359,0.006726946,0.0001571421,0.00001110278,0.9849371],"study_design_scores_gemma":[0.000901012,0.0006498264,0.00002744324,0.0001842711,0.00005237862,0.00002739018,0.00006254889,0.9373448,0.05512467,0.003874313,0.001380775,0.0003705938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003504545,0.00007079703,0.9983187,0.0001758978,0.0000275337,0.0004639449,0.00001415912,0.0001317122,0.0004467581],"genre_scores_gemma":[0.7629276,0.00001245107,0.2366303,0.0001325201,0.00001004154,0.0001436912,0.000005483727,0.00001318739,0.0001247562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9845665,"threshold_uncertainty_score":0.607141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127203855","doi":"10.1109/iscas.2000.857103","title":"Design of stable minimax IIR digital filters using semidefinite programming","year":2000,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Semidefinite programming; Minimax; Infinite impulse response; Linear matrix inequality; Mathematical optimization; Stability (learning theory); Computer science; Constraint (computer-aided design); Digital filter; Linear programming; Finite impulse response; 2D Filters; Mathematics; Filter (signal processing); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05974676226214511,"gpt":0.2692330892319443,"spread":0.2094863269697992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001334568,0.000114799,0.0001270258,0.00008266845,0.00004886288,0.0004866169,0.0003631451,0.00002298188,0.0001656137],"category_scores_gemma":[0.000009283677,0.0001056995,0.00004466732,0.0003599983,0.00003095112,0.002382465,0.00006332275,0.00003316134,0.00004592146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002606124,"about_ca_system_score_gemma":0.00005597571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002333732,"about_ca_topic_score_gemma":3.645935e-7,"domain_scores_codex":[0.998939,0.0000245607,0.0002880961,0.0002402485,0.0002294586,0.0002786705],"domain_scores_gemma":[0.9994888,0.00007254737,0.00006603652,0.0002606352,0.00004435311,0.00006762805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002463855,0.0001429826,0.0004329763,0.00002355801,0.00003226768,0.000009796642,0.0008395622,0.001852383,0.007165548,0.002145634,0.001183064,0.9861476],"study_design_scores_gemma":[0.002840933,0.001805805,0.0005834011,0.000222965,0.00004352722,0.0001534652,0.0005387008,0.7823768,0.1592142,0.008923651,0.04163309,0.0016635],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02790877,0.00001446332,0.9612297,0.00003710829,0.00004637245,0.0002294084,0.000005718955,0.000114235,0.01041416],"genre_scores_gemma":[0.5893462,0.000003816345,0.40843,0.0001412704,0.00001350576,0.000007498061,0.00001028827,0.00001095634,0.002036483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9844841,"threshold_uncertainty_score":0.4692458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120960466","doi":"10.1109/isspit.2006.270806","title":"Area-Efficient FIR Filter Design on FPGAs using Distributed Arithmetic","year":2006,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Stratix; Lookup table; Field-programmable gate array; Finite impulse response; Computer science; Accumulator (cryptography); Multiplier (economics); Parallel computing; Adder; Filter (signal processing); Computer hardware; Arithmetic; Embedded system; Algorithm; Mathematics; Latency (audio)","retraction":null,"screen_n_in":null,"score":{"opus":0.07291664940181444,"gpt":0.2681352013203891,"spread":0.1952185519185747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536509,0.0001449491,0.0001064307,0.0001059582,0.00009723444,0.0004204865,0.0003532806,0.00002874741,0.00006546421],"category_scores_gemma":[0.00001335868,0.0001207512,0.000053011,0.0003594722,0.00002146623,0.0003081387,0.00008554525,0.00004982996,0.00009870595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000892946,"about_ca_system_score_gemma":0.00003683918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006421912,"about_ca_topic_score_gemma":0.000002300368,"domain_scores_codex":[0.998789,0.00005091433,0.0002367148,0.0003271023,0.0002922287,0.000304116],"domain_scores_gemma":[0.9993969,0.0000945155,0.00005960222,0.0003348188,0.00005331718,0.00006083394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007898136,0.002023867,0.0006706081,0.00003670832,0.00007067138,0.0001734802,0.0004521429,0.522141,0.03652734,0.2572432,0.108333,0.07224903],"study_design_scores_gemma":[0.0004161122,0.0001820663,0.002037252,0.00001903069,0.000005999388,0.00001748097,0.000008149806,0.9563226,0.03357482,0.005036542,0.002127972,0.0002519391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01955966,0.00000695513,0.9755703,0.0002380442,0.0001594687,0.0002228458,0.0000131951,0.0001660839,0.004063503],"genre_scores_gemma":[0.9089698,2.35813e-7,0.09007218,0.000396629,0.00003600735,0.000009229556,0.00003397369,0.000008052179,0.0004738793],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8894101,"threshold_uncertainty_score":0.492409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135928115","doi":"10.1109/tcsi.2008.2002116","title":"IIR Digital Filter Design With New Stability Constraint Based on Argument Principle","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Stability (learning theory); Constraint (computer-aided design); Mathematics; Mathematical optimization; Filter (signal processing); Iterative method; Infinite impulse response; Control theory (sociology); Digital filter; Iterative design; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05335816823256538,"gpt":0.2335197746645157,"spread":0.1801616064319503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000199038,0.000247782,0.0002362131,0.0001240923,0.0002628146,0.0003839296,0.0002228026,0.00005911387,0.0000299396],"category_scores_gemma":[0.000005011287,0.0001963213,0.00007941906,0.0002148355,0.0001133417,0.0005777241,0.000001711954,0.000116132,0.00001718769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001129478,"about_ca_system_score_gemma":0.0002709073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002008531,"about_ca_topic_score_gemma":0.000003794793,"domain_scores_codex":[0.9982411,0.00009016429,0.0003192424,0.000539371,0.0005037094,0.000306416],"domain_scores_gemma":[0.9988928,0.0001384188,0.00008638192,0.0005136665,0.00005572869,0.0003130203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006096787,0.003524042,0.001672646,0.0005404282,0.0009183849,0.0004751073,0.01080015,0.1873925,0.03764758,0.01144733,0.002504616,0.7424675],"study_design_scores_gemma":[0.03553338,0.03032256,0.01150822,0.002514696,0.0003540688,0.003879559,0.002509369,0.5389947,0.3041016,0.0008613159,0.06078176,0.008638858],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837656,0.00001368655,0.9778774,0.0001740537,0.0002565091,0.0007498995,0.00003898195,0.0001354192,0.00237744],"genre_scores_gemma":[0.9981255,0.000004896266,0.0008310196,0.0002255751,0.0000219247,0.0000551489,0.00000475655,0.0000166949,0.0007144723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.979749,"threshold_uncertainty_score":0.8005751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004797867","doi":"10.1364/josaa.32.000611","title":"Theory and operational rules for the discrete Hankel transform","year":2015,"lang":"en","type":"article","venue":"Journal of the Optical Society of America A","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hankel transform; Discrete Hartley transform; Discrete Fourier transform (general); Hartley transform; Mathematics; Discrete sine transform; Convolution (computer science); Convolution theorem; Fourier transform; Discretization; Orthogonality; Fractional Fourier transform; S transform; Mathematical analysis; Integral transform; Inverse; Circular convolution; Bessel function; Mellin transform; Fourier analysis; Computer science; Geometry; Discrete wavelet transform","retraction":null,"screen_n_in":null,"score":{"opus":0.03012322454885692,"gpt":0.291052093022974,"spread":0.2609288684741171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357965,0.00005222908,0.0001023167,0.000006582263,0.00008102284,0.0001046661,0.0004060445,0.0000149824,0.000002613844],"category_scores_gemma":[0.00007922016,0.00002431802,0.0001859364,0.0000711739,0.0001920757,0.0003946954,0.00005883936,0.00006921518,5.080653e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001836837,"about_ca_system_score_gemma":0.0000809757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002282366,"about_ca_topic_score_gemma":8.120053e-8,"domain_scores_codex":[0.999349,0.00003362288,0.0002089101,0.00005559205,0.0002633178,0.00008955516],"domain_scores_gemma":[0.9992375,0.0003591308,0.0001205333,0.00009509298,0.0001280823,0.00005970566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003476054,0.0002268787,0.0001650307,0.00004893812,0.0005780971,6.717465e-7,0.02093107,0.0004210774,0.005758571,0.3698426,0.07297178,0.5287077],"study_design_scores_gemma":[0.005852075,0.003996941,0.007898213,0.0001607417,0.0003240326,0.0002874395,0.01511752,0.244917,0.01508493,0.5913537,0.1144524,0.0005550777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002649122,0.0001456237,0.9736902,0.02285701,0.0001097704,0.0001164496,0.000005856127,0.000002826116,0.0004231341],"genre_scores_gemma":[0.6492744,0.00009636276,0.3465591,0.003618803,0.0001532458,0.000006536402,9.408922e-7,0.000007335883,0.0002832568],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6466253,"threshold_uncertainty_score":0.1009297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2536582620","doi":"10.1109/icm.2009.5418584","title":"A fast 8&amp;#x00D7;8 transform for image compression","year":2009,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Discrete cosine transform; Transform coding; Hartley transform; Image compression; S transform; Algorithm; Computer science; Compression (physics); Discrete Hartley transform; Top-hat transform; Data compression; Image (mathematics); Discrete sine transform; Computation; Fractional Fourier transform; Artificial intelligence; Computer vision; Mathematics; Wavelet transform; Image processing; Fourier transform; Discrete wavelet transform; Digital image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.03914152298939353,"gpt":0.3170090143636445,"spread":0.2778674913742509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007358858,0.00007763087,0.00007456313,0.00004806489,0.00006250906,0.0002529272,0.0003102105,0.00001736545,0.0000297166],"category_scores_gemma":[0.000004056275,0.00006211036,0.00005510901,0.0001067573,0.000007845276,0.001150879,0.00001593291,0.00002358061,0.00004866692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001325763,"about_ca_system_score_gemma":0.00001373595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000033372,"about_ca_topic_score_gemma":0.0000038044,"domain_scores_codex":[0.9993641,0.000007200179,0.0001434186,0.0001810705,0.0001222269,0.0001819911],"domain_scores_gemma":[0.9996679,0.00002470689,0.00002301712,0.0001853224,0.00004017176,0.00005881529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001194904,0.00007807955,0.000003059645,0.000006825193,0.000003389208,6.667559e-7,0.0004408977,0.000002226853,0.03731856,0.06053443,0.02359246,0.8780075],"study_design_scores_gemma":[0.00459734,0.001795144,0.003144169,0.00006542218,0.00001557413,0.00004495316,0.0001278088,0.04856797,0.2966185,0.2465266,0.3975157,0.0009808978],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006261368,0.000005695735,0.9508644,0.002135302,0.00007822167,0.0002803356,0.000005532325,0.0001483012,0.04585605],"genre_scores_gemma":[0.4729965,0.000003278678,0.519811,0.002352772,0.00004836156,0.00002269226,0.00003739818,0.000005914046,0.004722076],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8770266,"threshold_uncertainty_score":0.2532787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1535745965","doi":"","title":"Design of digital filters and filter banks by optimization: A state of the art review","year":2000,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Filter design; Filter (signal processing); Infinite impulse response; Half-band filter; Digital filter; 2D Filters; Field (mathematics); Finite impulse response; Adaptive filter; State (computer science); Prototype filter; Electronic engineering; Engineering; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02042268135428107,"gpt":0.2329736127664686,"spread":0.2125509314121875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000985455,0.00007186133,0.0001127109,0.00001750194,0.00001853993,0.00008439121,0.0002819014,0.000008674619,0.0003007315],"category_scores_gemma":[0.000008660402,0.00004748156,0.00003073141,0.0001938448,0.00004323601,0.0008418317,0.00005697564,0.00002143673,0.000008843737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004897265,"about_ca_system_score_gemma":0.00001927322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001403837,"about_ca_topic_score_gemma":9.751286e-8,"domain_scores_codex":[0.9993221,0.00003525272,0.0002505179,0.0001361371,0.0001640953,0.00009194669],"domain_scores_gemma":[0.9995708,0.00004468111,0.0000747713,0.0002419985,0.00003831437,0.00002939111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000181389,0.0001132574,0.0001620295,0.000278238,0.00004358177,9.814349e-7,0.0004180468,0.006163929,0.000566413,0.0005081277,0.2534025,0.7383248],"study_design_scores_gemma":[0.004283695,0.002388922,0.001559696,0.003394577,0.0001348401,0.0001405279,0.00004556528,0.7842842,0.07941432,0.00738982,0.1150845,0.001879327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002900103,0.0003912264,0.9896376,0.0007980664,0.00002402105,0.0003208257,0.00002393028,0.00001896582,0.008495381],"genre_scores_gemma":[0.5105983,0.01034745,0.3758476,0.01488757,0.00003286486,0.0001057476,0.0001250361,0.00006498383,0.08799044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7781203,"threshold_uncertainty_score":0.3292799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049005062","doi":"10.1007/s00034-004-1029-8","title":"2-Norm Based Recursive Design of Transmultiplexers with Designable Filter Length","year":2006,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"","keywords":"Computation; Filter bank; Norm (philosophy); Computer science; Algorithm; Filter (signal processing); Distortion (music); Filter design; Prototype filter; Mathematics; Computer engineering; Bandwidth (computing); Telecommunications; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.0312969596271949,"gpt":0.2237704159761958,"spread":0.192473456349001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003507368,0.0001902575,0.0002591795,0.0001481057,0.0001577034,0.0004557021,0.0002553906,0.00005294824,0.000004773746],"category_scores_gemma":[0.000003992098,0.0001536148,0.00003132983,0.0003466126,0.00007083894,0.001211721,0.0000134479,0.00006720758,0.000001680004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003445191,"about_ca_system_score_gemma":0.0001796045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009307457,"about_ca_topic_score_gemma":0.000002062125,"domain_scores_codex":[0.9985161,0.0000910069,0.0003784208,0.0003717221,0.0003370631,0.0003056891],"domain_scores_gemma":[0.9992433,0.0001094449,0.0002211613,0.0001558439,0.0001945032,0.0000757551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002503366,0.00074024,0.00461143,0.004102139,0.0001576967,0.0001473793,0.006146061,0.09883875,0.2722647,0.03245631,0.002258379,0.5780265],"study_design_scores_gemma":[0.004050069,0.001611479,0.001489019,0.00175905,0.00007791992,0.0001380991,0.0007342878,0.9011239,0.08350555,0.003689612,0.0006836029,0.001137387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003683078,0.0006377067,0.99345,0.00003065708,0.00003720168,0.0004615449,0.000005789976,0.00007126146,0.001622721],"genre_scores_gemma":[0.9885947,0.000001589247,0.01111864,0.00004476903,0.00003807135,0.00003619275,0.000007716261,0.00001647984,0.0001418954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9849116,"threshold_uncertainty_score":0.626423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245023137","doi":"10.1109/tcsi.2009.2028749","title":"Minimax Design of IIR Digital Filters Using Iterative SOCP","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Minimax; Mathematical optimization; Infinite impulse response; Mathematics; Iterative method; Relaxation (psychology); Convergence (economics); Second-order cone programming; Digital filter; Convex optimization; Filter (signal processing); Algorithm; Computer science; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.04793524047683621,"gpt":0.2577023663040665,"spread":0.2097671258272302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001542422,0.0001790635,0.0002366883,0.0001701004,0.0001453028,0.000423071,0.0002100597,0.00005712323,0.00000473587],"category_scores_gemma":[0.000004015169,0.0001638802,0.00008599312,0.0002548606,0.00005291245,0.001026326,0.000001233882,0.00006863297,0.000003339904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004982321,"about_ca_system_score_gemma":0.00006229435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007329456,"about_ca_topic_score_gemma":3.380052e-7,"domain_scores_codex":[0.9987209,0.00008382396,0.0003509039,0.0003321687,0.0002893137,0.0002229055],"domain_scores_gemma":[0.9993384,0.00007976771,0.0001187389,0.000269953,0.00006554518,0.0001276141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004107917,0.0004077428,0.00001969847,0.0001083875,0.00024696,0.00003527953,0.006033422,0.0317083,0.3333639,0.005643582,0.0003293265,0.6220623],"study_design_scores_gemma":[0.008516105,0.009092229,0.001068474,0.001861966,0.0003019403,0.00124186,0.005009369,0.7041612,0.2583194,0.003089894,0.003647681,0.003689848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01049906,0.00006217587,0.9874141,0.00006832917,0.0003125617,0.0003723822,0.0000339621,0.00005845326,0.001178962],"genre_scores_gemma":[0.9984175,0.00001119915,0.001059894,0.0001082417,0.0000178209,0.000008758562,0.000002217468,0.000009008848,0.0003653815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9879184,"threshold_uncertainty_score":0.6682842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148913652","doi":"10.1155/asp.2005.1910","title":"Design of Nonrecursive Digital Filters Using the Ultraspherical Window Function","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Chebyshev filter; Passband; Computer science; Window function; Prototype filter; Computation; Ripple; Elliptic filter; Low-pass filter; Algorithm; Window (computing); Digital filter; Mathematics; Stopband; Filter (signal processing); Band-pass filter; Electronic engineering; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03614577363413086,"gpt":0.304048980228436,"spread":0.2679032065943052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004216459,0.0001692573,0.0001758007,0.0001295043,0.0001861068,0.0005907946,0.0005340509,0.00003003758,0.00001750548],"category_scores_gemma":[0.00004668186,0.0001196288,0.00006341308,0.0005330666,0.00008671487,0.00644117,0.00004011558,0.0002946494,0.000006299072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281966,"about_ca_system_score_gemma":0.0001201695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.98144e-7,"about_ca_topic_score_gemma":2.751922e-7,"domain_scores_codex":[0.9983302,0.0001249488,0.0005062851,0.0002313027,0.0005098757,0.0002973889],"domain_scores_gemma":[0.998996,0.0002489964,0.0004288266,0.0001212049,0.0001288713,0.00007615134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001509249,0.0001094993,0.0003047647,0.00001168092,0.000008566997,0.00001290984,0.0007270999,0.1240422,0.006593521,0.0002971603,0.00003417584,0.8677074],"study_design_scores_gemma":[0.004228787,0.003961868,0.001968251,0.001578629,0.0000540016,0.001384437,0.002266664,0.8940892,0.05097373,0.02800977,0.01015695,0.001327713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008349444,0.0006908392,0.9895446,0.0002437029,0.0001653795,0.0001436121,0.000001188604,0.00002183515,0.000839409],"genre_scores_gemma":[0.9593543,0.00004139403,0.03998499,0.0004055535,0.0001721662,0.000002752868,8.908315e-7,0.00001186787,0.00002602801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9510049,"threshold_uncertainty_score":0.5697046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1827246489","doi":"10.1109/iscas.2001.921982","title":"An automatic word length determination method","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Department of National Defence; Nortel (Canada); Polytechnique Montréal","funders":"","keywords":"Word (group theory); Computer science; Digital signal processing; Signal-flow graph; Algorithm; Discrete cosine transform; Filter (signal processing); Floating point; Word length; Fixed-point arithmetic; Range (aeronautics); Point (geometry); Inverse; Fixed point; Trigonometric functions; Mathematics; Computer hardware; Artificial intelligence; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.0543541598534081,"gpt":0.3299369614705593,"spread":0.2755828016171512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001500082,0.00006327608,0.00005705913,0.00007908454,0.00004261718,0.0003186621,0.0003415742,0.00001596244,0.0003033966],"category_scores_gemma":[0.00001021105,0.0000556482,0.00002109187,0.0001918564,0.000005788274,0.002066236,0.00003186087,0.00002387459,0.0001955487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000182589,"about_ca_system_score_gemma":0.000003967269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004998722,"about_ca_topic_score_gemma":0.000003111127,"domain_scores_codex":[0.9993405,0.00006054555,0.0001378624,0.0001780908,0.0001537385,0.0001293124],"domain_scores_gemma":[0.9995631,0.00004492951,0.00003577143,0.0002734617,0.00002596228,0.00005675253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.932891e-8,0.00003461803,0.00002545877,0.000002381452,0.000001434443,0.000001477622,0.0003902527,0.000001993833,0.0006323115,0.01504912,0.0007655093,0.9830953],"study_design_scores_gemma":[0.000130747,0.00009428587,0.001198516,0.000002621401,0.000001773114,0.00001057163,0.00002139006,0.9886716,0.004379552,0.004290423,0.001105115,0.00009339076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004002247,0.000004015095,0.9749073,0.0002524805,0.00008766018,0.00008820012,3.840086e-7,0.0002821767,0.02037558],"genre_scores_gemma":[0.499762,8.831254e-7,0.4989309,0.0003813988,0.00001332278,0.000007082047,0.000001674401,0.000003093321,0.0008996345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9886696,"threshold_uncertainty_score":0.332198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020043054","doi":"10.1109/tsp.2012.2231678","title":"Improved Design Method for Nearly Linear-Phase IIR Filters Using Constrained Optimization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stopband; Passband; Control theory (sociology); Infinite impulse response; Linear phase; 2D Filters; Mathematics; Ripple; Transition band; Prototype filter; Digital filter; Chebyshev filter; Attenuation; Filter design; Convex optimization; Filter (signal processing); Computer science; Band-pass filter; Electronic engineering; Regular polygon; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09439101809114468,"gpt":0.3641566448939329,"spread":0.2697656268027882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846678,0.0002260496,0.0001939709,0.0002194026,0.0004333331,0.0004223838,0.0002677448,0.00007940319,0.00003162213],"category_scores_gemma":[0.000007137779,0.0002265108,0.0001104095,0.0004681711,0.00004211614,0.003165221,0.000002372237,0.0001285358,0.000003864745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009310993,"about_ca_system_score_gemma":0.0001897867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007186991,"about_ca_topic_score_gemma":3.972414e-7,"domain_scores_codex":[0.9984483,0.000113334,0.0003883294,0.0003527186,0.000225231,0.0004721239],"domain_scores_gemma":[0.9990721,0.0002208642,0.0001734839,0.0001774421,0.0001783109,0.0001778014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001500532,0.0003515264,6.271234e-7,0.00005301101,0.00003820634,8.302524e-7,0.0009976091,0.3204019,0.08824468,0.00006311809,0.00002536701,0.5896731],"study_design_scores_gemma":[0.001291234,0.000336482,3.513064e-7,0.00003709319,0.00004187354,0.00002089041,0.00006616578,0.8367518,0.1610948,0.00009075236,0.00004315595,0.0002254526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001831175,0.00002473914,0.9984861,0.00008572646,0.000278458,0.0006561752,0.00002537033,0.0002022206,0.00005808459],"genre_scores_gemma":[0.4109538,6.517206e-7,0.58867,0.0002022719,0.00005603096,0.00005029406,0.000005123271,0.00001915602,0.00004263326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5894476,"threshold_uncertainty_score":0.9236844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163296328","doi":"10.1016/j.acha.2005.04.003","title":"Second-order Sigma–Delta (ΣΔ) quantization of finite frame expansions","year":2005,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Quantization (signal processing); Bandlimiting; Sigma; Norm (philosophy); Unit sphere; Applied mathematics; Mathematical analysis; Algorithm; Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.01909188491596856,"gpt":0.2590475964454247,"spread":0.2399557115294562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001402643,0.0001281373,0.0002225776,0.0003280227,0.000108495,0.0001226885,0.000237921,0.00003992284,0.0001581325],"category_scores_gemma":[0.000008991277,0.0001268216,0.00009117778,0.001344681,0.00004457182,0.0004251288,0.0000939406,0.00006141591,0.00002020212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001890383,"about_ca_system_score_gemma":0.00006127916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000947337,"about_ca_topic_score_gemma":0.00001355697,"domain_scores_codex":[0.9987917,0.00002638003,0.0003876036,0.0003316784,0.0003050746,0.0001575554],"domain_scores_gemma":[0.9992181,0.0002020344,0.0001677756,0.0001936459,0.000144598,0.00007384613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001734988,0.0002366993,0.0008342834,0.00002259756,0.0008163481,0.000001100274,0.001477961,0.2745962,0.001475351,0.6127072,0.0006446178,0.1071703],"study_design_scores_gemma":[0.0004965041,0.0000373898,0.01061179,0.000004409609,0.000156688,0.000001371856,0.00009030087,0.9640931,0.0008236208,0.02230661,0.00117881,0.0001994053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03901915,0.00007318388,0.9585389,0.0004537804,0.00001862412,0.0001033756,0.00002374523,0.0000497677,0.001719493],"genre_scores_gemma":[0.9232619,0.0000142508,0.07570904,0.0006481247,0.00002189133,0.00001353842,0.0002200043,0.000005779811,0.0001054261],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8842428,"threshold_uncertainty_score":0.5171636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161486443","doi":"10.1109/tcsi.2004.836848","title":"Results on Maximally Flat Fractional-Delay Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Infinite impulse response; Mathematics; Finite impulse response; Transfer function; Impulse response; Interpolation (computer graphics); Padé approximant; Fractional calculus; Frequency response; Applied mathematics; Control theory (sociology); Mathematical analysis; Algorithm; Digital filter; Computer science; Filter (signal processing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03100500456053106,"gpt":0.2651935437548752,"spread":0.2341885391943442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004751268,0.0002154571,0.0001899323,0.0001862748,0.0006051188,0.0006257682,0.000216001,0.0000765322,0.000004910627],"category_scores_gemma":[0.000002547736,0.0001966971,0.00005628759,0.0002663827,0.00008627542,0.0006237747,0.000003997976,0.000163043,0.00008600613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088778,"about_ca_system_score_gemma":0.000040487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005210578,"about_ca_topic_score_gemma":0.000004484652,"domain_scores_codex":[0.9984004,0.0001180907,0.000421701,0.0005431803,0.0002844104,0.000232187],"domain_scores_gemma":[0.9989888,0.0002738509,0.0001312082,0.0003824368,0.0000517568,0.0001719538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005785405,0.0002730174,0.000003319832,0.00005423797,0.00007383214,0.000004348743,0.000485342,0.00550342,0.002576985,0.9428585,0.00006190019,0.04804721],"study_design_scores_gemma":[0.04599528,0.01455761,0.003335796,0.003949799,0.00079651,0.006789531,0.02127127,0.04655023,0.05991597,0.3631003,0.4230657,0.01067198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007421077,0.0001271931,0.9833077,0.0001800658,0.0004814229,0.0009575342,0.000270998,0.000159005,0.007095058],"genre_scores_gemma":[0.9979883,0.000071398,0.0001056036,0.0002291752,0.00007858798,0.0004923972,0.00001910114,0.00001548929,0.0009999755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9905672,"threshold_uncertainty_score":0.8021075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104322476","doi":"10.1109/tcsi.2008.918214","title":"A Speed-Optimized Systolic Array Processor Architecture for Spatio-Temporal 2-D IIR Broadband Beam Filters","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Systolic array; Very-large-scale integration; Gate array; Field-programmable gate array; Computer science; Infinite impulse response; Broadband; Critical path method; Frame rate; Frame (networking); Filter (signal processing); Latency (audio); Electronic engineering; Computer hardware; Electronic circuit; Digital filter; Engineering; Electrical engineering; Embedded system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03097258290075952,"gpt":0.2401785505025741,"spread":0.2092059676018146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000223006,0.0003031046,0.0003910665,0.0002503062,0.0004835431,0.0003054421,0.0003399407,0.0001059902,0.000008768208],"category_scores_gemma":[0.000009051485,0.0002676731,0.0001758806,0.0003161788,0.00009616597,0.000518303,0.0000018023,0.0001329722,0.000007335328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006929986,"about_ca_system_score_gemma":0.0001329699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005570448,"about_ca_topic_score_gemma":0.00001626212,"domain_scores_codex":[0.9980544,0.00008139672,0.0004547593,0.0006025886,0.0004005295,0.0004062772],"domain_scores_gemma":[0.9989494,0.0001109426,0.0001635502,0.0004163533,0.0001039112,0.0002558441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009805689,0.002146767,0.0003530087,0.004683858,0.002392064,0.0002263451,0.04387246,0.2121021,0.2405686,0.005262642,0.01454347,0.4728682],"study_design_scores_gemma":[0.06529656,0.01381185,0.001701796,0.004313843,0.001122289,0.01223042,0.004825858,0.2192508,0.3652629,0.002264922,0.2972719,0.01264686],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02093677,0.0001371041,0.9753248,0.0002825206,0.000745204,0.001387965,0.00009036681,0.000200407,0.00089487],"genre_scores_gemma":[0.9956096,0.00003391153,0.001710502,0.0002374268,0.0000771451,0.0002030101,0.00002443737,0.00003220991,0.002071704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9746729,"threshold_uncertainty_score":0.9999775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1555715953","doi":"10.1109/tcsi.2004.834508","title":"A New Radix-&amp;lt;tex&amp;gt;$2/8$&amp;lt;/tex&amp;gt;FFT Algorithm for Length-&amp;lt;tex&amp;gt;$qtimes 2^m$&amp;lt;/tex&amp;gt;DFTs","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Fast Fourier transform; Twiddle factor; Split-radix FFT algorithm; Prime-factor FFT algorithm; Algorithm; Cooley–Tukey FFT algorithm; Rader's FFT algorithm; Radix (gastropod); Computation; Integer (computer science); Mathematics; Discrete Fourier transform (general); Arithmetic; Computer science; Fourier transform; Fourier analysis; Fractional Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.04899216212762784,"gpt":0.2911471197812872,"spread":0.2421549576536593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002263758,0.001896579,0.001776941,0.001094999,0.003238993,0.002950927,0.001969362,0.000762789,0.0006760046],"category_scores_gemma":[0.00006069834,0.001924481,0.000923064,0.001977907,0.0007615428,0.00282984,0.0001060617,0.0009729184,0.001587474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007586141,"about_ca_system_score_gemma":0.0005176433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002651383,"about_ca_topic_score_gemma":0.001230313,"domain_scores_codex":[0.9894894,0.0007857658,0.002705716,0.003212927,0.001640137,0.002166087],"domain_scores_gemma":[0.9922706,0.001472292,0.001088211,0.003048359,0.0005139476,0.001606621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004207118,0.004033057,0.00005966295,0.001011739,0.002062415,0.00000941588,0.0114839,0.002407521,0.1046169,0.1555306,0.01793238,0.7004317],"study_design_scores_gemma":[0.006319162,0.0005753327,0.0001754647,0.0008645428,0.0008132817,0.000888614,0.0004772322,0.0004902739,0.001644503,0.02313654,0.9614115,0.003203524],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01386756,0.003381577,0.9662302,0.0007331504,0.002182189,0.005724626,0.002824546,0.0009843585,0.004071811],"genre_scores_gemma":[0.8727878,0.001382947,0.05974276,0.001389761,0.001793573,0.005155796,0.002339576,0.000514304,0.05489351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9434792,"threshold_uncertainty_score":0.9993778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1922451998","doi":"10.1109/mwscas.1998.759529","title":"Optimization of FIR digital filters over the canonical signed-digit coefficient space using genetic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Finite impulse response; Digital filter; Algorithm; Genetic algorithm; Mutation; Computer science; Operator (biology); Mathematics; Optimization problem; Mathematical optimization; Filter (signal processing); Arithmetic; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03688834832066185,"gpt":0.2561300809870475,"spread":0.2192417326663856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000579641,0.000123337,0.0001115467,0.00006596932,0.00007611814,0.0005062504,0.0004741917,0.00002870451,0.0001957434],"category_scores_gemma":[0.00002123124,0.00008922949,0.00006645834,0.0003892003,0.00006632034,0.0008690019,0.0001670831,0.00004225859,0.00001683421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005136882,"about_ca_system_score_gemma":0.00003322084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003330292,"about_ca_topic_score_gemma":0.000001332414,"domain_scores_codex":[0.9988369,0.00002710969,0.0002852481,0.000256414,0.0003592632,0.0002351145],"domain_scores_gemma":[0.9993159,0.00008699896,0.0001040155,0.0003569576,0.00006708463,0.00006901736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008095172,0.0004611128,0.0008203568,0.00002497103,0.0000734198,0.00001682669,0.001579821,0.8223321,0.001238409,0.008994871,0.01120252,0.1532475],"study_design_scores_gemma":[0.0002542981,0.00009964441,0.0003482188,0.000008796714,0.000005504587,0.00001417705,0.00003556226,0.9967156,0.001519453,0.00008955732,0.0007816656,0.0001275006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246305,0.00003116355,0.9814224,0.0002525486,0.0001421817,0.0002159148,0.00001232168,0.000056801,0.005403625],"genre_scores_gemma":[0.9242253,0.000005426599,0.07474808,0.0002963415,0.00003118749,0.000004460802,0.000006824313,0.00001087917,0.0006715027],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9117622,"threshold_uncertainty_score":0.4881784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168423527","doi":"10.1109/tcsi.2008.2011590","title":"FIR, Allpass, and IIR Variable Fractional Delay Digital Filter Design","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Infinite impulse response; All-pass filter; Mathematics; Finite impulse response; 2D Filters; Filter design; Control theory (sociology); Group delay and phase delay; Digital filter; Low-pass filter; Filter (signal processing); Algorithm; High-pass filter; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02603781725333299,"gpt":0.2271166066559486,"spread":0.2010787894026156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094869,0.0002045018,0.0001998181,0.0001341319,0.0002725998,0.0009461279,0.0001788074,0.00008519674,0.00001692712],"category_scores_gemma":[0.000005586036,0.0001874542,0.00005373265,0.0002090539,0.00004044918,0.001407281,0.000001881678,0.0001171523,0.00001270241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004566585,"about_ca_system_score_gemma":0.00006241568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001197321,"about_ca_topic_score_gemma":8.742059e-7,"domain_scores_codex":[0.9985977,0.00007065368,0.0002902883,0.0004461785,0.0003198588,0.0002753415],"domain_scores_gemma":[0.9992645,0.0001246281,0.00007376222,0.0002724495,0.00005610288,0.000208555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005610735,0.0005825807,0.00005227622,0.0001023092,0.0003545559,0.00007042844,0.001429451,0.01528352,0.04068651,0.03514563,0.005008954,0.9012277],"study_design_scores_gemma":[0.01628578,0.01089838,0.008142272,0.001514219,0.0005003838,0.007650854,0.001479962,0.5181073,0.02337446,0.0233444,0.381028,0.007674019],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001480564,0.0001266561,0.9935324,0.0002933567,0.0004271743,0.0003378496,0.00003351818,0.0001173841,0.003651159],"genre_scores_gemma":[0.9964553,0.00004102673,0.001303207,0.0004220947,0.00004254281,0.00002770955,0.000006506907,0.00001163382,0.001689996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9949747,"threshold_uncertainty_score":0.9123533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125854233","doi":"10.1109/tcsii.2003.816917","title":"Optimal design of multichannel transmultiplexers with stopband energy and passband magnitude constraints","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Stopband; Passband; Quadratic equation; Elliptic filter; Finite impulse response; Transition band; Mathematical optimization; Magnitude (astronomy); Quadratic programming; Control theory (sociology); Distortion (music); Iterative design; Impulse (physics); Optimal design; Energy (signal processing); Computer science; Mathematics; Filter (signal processing); Filter design; Algorithm; Prototype filter; Band-pass filter; Physics; Electronic engineering; Scheduling (production processes); Engineering; Geometry; Bandwidth (computing); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02982948633655695,"gpt":0.2264486844452663,"spread":0.1966191981087093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001684192,0.0002220409,0.0002793751,0.0001595084,0.0003237554,0.0006774096,0.00008692518,0.00006209139,0.000002230541],"category_scores_gemma":[0.000002742477,0.0001793939,0.00002902495,0.0001967066,0.0002368802,0.001308673,0.000001932269,0.00007197166,1.515658e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001328356,"about_ca_system_score_gemma":0.00007681669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679231,"about_ca_topic_score_gemma":0.00000364801,"domain_scores_codex":[0.9987327,0.00005645583,0.0003222925,0.000400173,0.0002374964,0.0002508912],"domain_scores_gemma":[0.999411,0.0001139094,0.0001096169,0.00009036783,0.0001004349,0.0001746711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007532361,0.0003132804,0.0001519188,0.0003479949,0.0001353817,0.00002792988,0.002957433,0.01261669,0.00680712,0.002975505,0.000009495827,0.9735819],"study_design_scores_gemma":[0.01481364,0.00944884,0.0004790045,0.002242278,0.000360497,0.002693079,0.007095803,0.9109595,0.04619287,0.001913275,0.0007831668,0.003018022],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02155398,0.0004448781,0.9769804,0.00001260211,0.00003937038,0.0001985402,0.00003267155,0.00003806615,0.0006994224],"genre_scores_gemma":[0.9989668,0.00003648055,0.0008101824,0.00003146553,0.000007231061,0.00001855332,0.000002174501,0.00001248563,0.0001146459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9774128,"threshold_uncertainty_score":0.7315472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064585895","doi":"10.1007/s11045-010-0129-9","title":"Two-dimensional digital filters with sparse coefficients","year":2010,"lang":"en","type":"article","venue":"Multidimensional Systems and Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Computer science; Filter design; Digital filter; Filter (signal processing); Constraint (computer-aided design); Finite impulse response; Focus (optics); Mathematical optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01909541187611483,"gpt":0.2492243480702044,"spread":0.2301289361940896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002217514,0.0002233576,0.0001979615,0.000113201,0.0003149573,0.0008990644,0.0002050806,0.0000470402,0.000009540403],"category_scores_gemma":[0.000009646555,0.000164622,0.00003236776,0.0002194311,0.0001018788,0.001654436,0.0001463925,0.0001740541,0.00002495943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001689054,"about_ca_system_score_gemma":0.0001123583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003966758,"about_ca_topic_score_gemma":0.00000393386,"domain_scores_codex":[0.9982452,0.00002472963,0.0003040285,0.000498254,0.000595005,0.0003327479],"domain_scores_gemma":[0.9991891,0.0000863802,0.0001405416,0.0001741162,0.0001965437,0.0002133071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004003607,0.001094835,0.0171027,0.0003798089,0.0001759119,0.0004141165,0.002159937,0.01630813,0.4003362,0.0541839,0.001979986,0.5054641],"study_design_scores_gemma":[0.003481064,0.0004844441,0.003413768,0.0003997492,0.00002087137,0.001092237,0.0001687439,0.9804198,0.004601411,0.0004249613,0.004497307,0.0009956586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7838726,0.00013889,0.2139536,0.000134835,0.0003446816,0.0003593088,0.00002194556,0.0001662948,0.001007844],"genre_scores_gemma":[0.9847299,1.886985e-7,0.01475161,0.0001455671,0.00007735347,0.00001466156,0.00002603238,0.00001616588,0.0002384737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9641117,"threshold_uncertainty_score":0.8669699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1486317707","doi":"10.1109/iscas.2006.1693612","title":"An argument-principle based stability criterion and application to the design of IIR digital filters","year":2006,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Infinite impulse response; Stability (learning theory); Stability criterion; 2D Filters; Minimax; Digital filter; Mathematics; Constraint (computer-aided design); Control theory (sociology); Convex optimization; Filter (signal processing); Mathematical optimization; Computer science; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.02393472216992956,"gpt":0.2722200181565208,"spread":0.2482852959865912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002272563,0.00007481175,0.00006558563,0.00004082613,0.00005260245,0.0003239385,0.0003085661,0.00001304231,0.00001354777],"category_scores_gemma":[0.000008890618,0.00005415118,0.00001728337,0.000170927,0.00002558454,0.0009115062,0.00006241802,0.00001805176,0.00001129645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002183495,"about_ca_system_score_gemma":0.00002109925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004220751,"about_ca_topic_score_gemma":0.000009996646,"domain_scores_codex":[0.9992436,0.00004128895,0.0001913295,0.0002377771,0.000166148,0.000119823],"domain_scores_gemma":[0.999392,0.00006222088,0.00004710756,0.0003986404,0.00005147175,0.00004857318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001674231,0.001283838,0.022159,0.00009034443,0.00002323437,0.000001794894,0.001763108,0.01087291,0.3527546,0.09970283,0.004742369,0.5064386],"study_design_scores_gemma":[0.0006376125,0.0008160961,0.04437698,0.000009235052,0.000006318292,0.000002796403,0.0001159978,0.7837411,0.1590057,0.006670532,0.004314557,0.000303071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06465435,0.000002680723,0.9338742,0.0004826313,0.00002129836,0.0004300013,0.00001327502,0.00005071113,0.000470822],"genre_scores_gemma":[0.9611697,1.572767e-7,0.03843835,0.0002876376,0.00001137397,0.00003560936,0.00002856323,0.000003442142,0.00002518973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8965153,"threshold_uncertainty_score":0.3123747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1912217140","doi":"10.1109/iscas.2002.1009967","title":"Design of prototype filter for near-perfect-reconstruction overlapped complex-modulated transmultiplexers","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Attenuation; Filter (signal processing); Side lobe; m-derived filter; Finite impulse response; Prototype filter; Impulse (physics); Filter design; Modulation (music); Electronic engineering; Main lobe; Low-pass filter; Acoustics; Algorithm; Telecommunications; Physics; Optics; Engineering; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.06424015521176188,"gpt":0.2781641038296707,"spread":0.2139239486179088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000232924,0.0001289413,0.0001653181,0.00007073694,0.00007952718,0.0001359891,0.0002236678,0.00004161027,0.000127267],"category_scores_gemma":[0.00002636971,0.0001159224,0.00007150218,0.0002471161,0.0000465692,0.0007223383,0.00001067416,0.00003334766,0.00001170951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002451241,"about_ca_system_score_gemma":0.00007967401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001337699,"about_ca_topic_score_gemma":0.000002469626,"domain_scores_codex":[0.9989496,0.00007885678,0.0003140282,0.0002766158,0.000150506,0.0002303673],"domain_scores_gemma":[0.9993942,0.00009663993,0.00008910975,0.0002429147,0.000119397,0.00005775366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004302443,0.0003545753,0.0009589082,0.0001890067,0.000174711,0.000001873283,0.001487876,0.003779094,0.5977469,0.1154158,0.003492918,0.275968],"study_design_scores_gemma":[0.003608702,0.001545495,0.001390258,0.00003007378,0.00001843781,0.00004035117,0.00007173643,0.6611551,0.3178345,0.01008239,0.003771922,0.0004510518],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008262557,0.000004451807,0.9871898,0.00005836193,0.0001627655,0.001811789,0.000007432116,0.00009781259,0.002405048],"genre_scores_gemma":[0.6295433,7.343364e-7,0.3701183,0.00008483295,0.000005024862,0.00009422379,0.000009717542,0.000008088934,0.0001357779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.657376,"threshold_uncertainty_score":0.472718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118894697","doi":"10.1109/78.890348","title":"Design of multichannel nonuniform transmultiplexers using general building blocks","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Aliasing; Computer science; Signal reconstruction; Algorithm; Distortion (music); Phase distortion; Mathematics; Signal processing; Bandwidth (computing); Filter (signal processing); Telecommunications; Transmission (telecommunications)","retraction":null,"screen_n_in":null,"score":{"opus":0.06833419842562356,"gpt":0.3004952609624574,"spread":0.2321610625368338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002437111,0.0002177135,0.000212096,0.0003304959,0.0003001287,0.0002074917,0.0004106923,0.00006852098,0.00002783959],"category_scores_gemma":[0.000001397221,0.0002172555,0.00009960165,0.0006846104,0.00005714706,0.001591392,0.000002225412,0.0001533185,0.000003631931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008379078,"about_ca_system_score_gemma":0.0001253077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004330725,"about_ca_topic_score_gemma":0.00000258891,"domain_scores_codex":[0.9983845,0.00005401253,0.0004360548,0.0003696102,0.0003854092,0.0003704495],"domain_scores_gemma":[0.9993356,0.00007785654,0.0001477643,0.0001884937,0.0001409851,0.0001092801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006100097,0.000147254,0.000006384877,0.00002744708,0.00002122774,0.000008595178,0.0008898529,0.4857739,0.2087066,0.00003153362,0.000002683733,0.3043235],"study_design_scores_gemma":[0.0005894845,0.0001487433,0.000004552878,0.00008457754,0.00002098795,0.00004147802,0.00007415642,0.7546751,0.2439388,0.0002108368,0.00002036556,0.0001909558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03308705,0.00003318258,0.9661996,0.00004205088,0.0001360552,0.0002708932,0.0000047715,0.0001292646,0.0000970946],"genre_scores_gemma":[0.7794979,0.000006601555,0.2202895,0.00008184496,0.00002616654,0.00001225427,6.975851e-7,0.00001732507,0.0000677223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7464108,"threshold_uncertainty_score":0.8859422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081289377","doi":"10.1109/tcsii.2006.889453","title":"New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Prime (order theory); Sine; Systolic array; Simple (philosophy); Algorithm; Convolution (computer science); Mathematics; Discrete sine transform; Transformation (genetics); Discrete cosine transform; Discrete mathematics; Computer science; Combinatorics; Very-large-scale integration; Mathematical analysis; Fourier transform; Geometry; Fourier analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02001259224966694,"gpt":0.2543285198812066,"spread":0.2343159276315396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002471909,0.0002529316,0.0002832386,0.0002095772,0.0005417409,0.001314248,0.0001309102,0.0000819679,9.835667e-7],"category_scores_gemma":[0.000002135862,0.0002093906,0.00006229601,0.0002424966,0.00006407029,0.001517527,0.000002736174,0.0001280734,5.039034e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002749467,"about_ca_system_score_gemma":0.00007136765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003301237,"about_ca_topic_score_gemma":0.00001199033,"domain_scores_codex":[0.9984992,0.00001410704,0.0003935239,0.0004744135,0.0002457714,0.0003730422],"domain_scores_gemma":[0.9993147,0.0001109148,0.0000974835,0.0001094261,0.00006633604,0.0003011129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001401122,0.00003415197,0.000005200535,0.0001550533,0.0000298689,0.000003189895,0.001039164,0.00005434557,0.001188945,0.000403157,0.00001127035,0.9970617],"study_design_scores_gemma":[0.03035347,0.02254398,0.002024953,0.007699231,0.00110382,0.008301046,0.00961341,0.6792291,0.1017929,0.06577768,0.06032387,0.01123644],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001619187,0.0008883493,0.9955355,0.0001217391,0.0001224333,0.0004744151,0.00006995224,0.0000984575,0.001069959],"genre_scores_gemma":[0.9974723,0.00002354344,0.001836265,0.0000734763,0.00008967768,0.00001640521,0.000009784667,0.00001789878,0.0004606626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9958531,"threshold_uncertainty_score":0.9997225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2540877969","doi":"10.1049/el:20046165","title":"Multiplication-free 8 <b>×</b> 8 2D DCT architecture using algebraic integer encoding","year":2004,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete cosine transform; Encoding (memory); Algebraic number; Integer (computer science); Adder; Mathematics; Arithmetic; Computation; Transform coding; Algorithm; Multiplication (music); Discrete mathematics; Computer science; Image (mathematics); Combinatorics; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01752490765087214,"gpt":0.2510056815221904,"spread":0.2334807738713183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001511402,0.0001749559,0.0001202716,0.0001642718,0.000137614,0.0002986442,0.0009865898,0.00003673576,0.000005815074],"category_scores_gemma":[0.00003603649,0.000173515,0.0000803885,0.0004102703,0.00003187693,0.0007381826,0.0001726675,0.0002226616,0.000030705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003551712,"about_ca_system_score_gemma":0.0001256592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002635713,"about_ca_topic_score_gemma":0.00001857232,"domain_scores_codex":[0.9985452,0.00003350944,0.000230862,0.0004002867,0.0002803144,0.0005098376],"domain_scores_gemma":[0.9991198,0.00004478693,0.00009619576,0.0006300781,0.00003233131,0.00007676372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001123257,0.00007544059,0.0001345892,0.00001837741,0.00005698286,0.00001622172,0.002520589,0.009554542,0.8298399,0.1145443,0.001330495,0.04189728],"study_design_scores_gemma":[0.006843659,0.0007514269,0.001599672,0.0002097872,0.00007481324,0.0005149307,0.0001275453,0.04520028,0.6824707,0.2330228,0.02651612,0.002668329],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.138297,0.00008809521,0.8535801,0.007237591,0.0001340028,0.0001888667,0.000002057028,0.0001609506,0.0003114332],"genre_scores_gemma":[0.9330401,0.000006375274,0.06073593,0.006052307,0.00009556859,0.00001635522,0.00001341591,0.00002070749,0.0000192143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7947432,"threshold_uncertainty_score":0.7075738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075514383","doi":"10.1109/tcsi.2003.818613","title":"Optimal design of IIR frequency-response-masking filters using second-order cone programming","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Infinite impulse response; Finite impulse response; 2D Filters; Digital filter; Frequency response; Impulse response; Second-order cone programming; Linear filter; Filter design; Realization (probability); Prototype filter; Rounding; Masking (illustration); Computer science; Network synthesis filters; Control theory (sociology); Mathematics; Filter (signal processing); Algorithm; Electronic engineering; Engineering; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04676449648446468,"gpt":0.2786317461928887,"spread":0.231867249708424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008732617,0.0001711988,0.0001955195,0.0001516008,0.0003911317,0.0002645874,0.0001536603,0.00005425575,0.00002524213],"category_scores_gemma":[0.000004895437,0.0001687847,0.00004294668,0.0003167886,0.0001290792,0.0005198426,0.000002866825,0.00009444886,0.000003195745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004575309,"about_ca_system_score_gemma":0.00006307999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009103863,"about_ca_topic_score_gemma":9.318775e-7,"domain_scores_codex":[0.9985155,0.0003881958,0.0003650914,0.0003539676,0.0001576866,0.0002195354],"domain_scores_gemma":[0.9990324,0.0004160994,0.00013822,0.0002492536,0.00005726818,0.0001067074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001695673,0.000895531,0.00008885984,0.00036491,0.0003933875,0.000007376343,0.004917029,0.0273773,0.3373612,0.4672077,0.00002108313,0.1611961],"study_design_scores_gemma":[0.01707811,0.007693867,0.0008120136,0.002115531,0.0009363434,0.003635774,0.03788662,0.1946475,0.6389686,0.06251413,0.02651547,0.007196097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03890247,0.0001613684,0.9595076,0.000009357927,0.0001318131,0.0009010744,0.00004951034,0.00005439477,0.0002824314],"genre_scores_gemma":[0.9898208,0.000008553838,0.009647257,0.00005055143,0.00001077603,0.0002395436,0.000002177924,0.00001354178,0.0002068497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9509183,"threshold_uncertainty_score":0.688284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114438412","doi":"10.1109/icassp.1998.681703","title":"A new DCT algorithm based on encoding algebraic integers","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Encoding (memory); Algebraic number; Matrix (chemical analysis); Discrete cosine transform; Algorithm; Integer (computer science); Trigonometric functions; Scheme (mathematics); ENCODE; Computer science; Function (biology); Mathematics; Multiplication (music); Arithmetic; Discrete mathematics; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03846730035887404,"gpt":0.2490150551795992,"spread":0.2105477548207251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000746496,0.0000943753,0.00006997377,0.0001197074,0.00004254501,0.0002989383,0.0003736664,0.0000183316,0.0009648332],"category_scores_gemma":[0.00001281923,0.00008110458,0.0000467772,0.0002861457,0.00000688774,0.0006710907,0.00004193929,0.00004934554,0.0005671965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003722575,"about_ca_system_score_gemma":0.00001919288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002989953,"about_ca_topic_score_gemma":0.000002269952,"domain_scores_codex":[0.9991934,0.00001985301,0.0001338704,0.0002372491,0.0002226775,0.0001929776],"domain_scores_gemma":[0.9995271,0.00006129134,0.00002963302,0.0002569952,0.00001670923,0.0001082847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.508285e-7,0.00002519237,0.00001532469,0.000001288441,0.000003104007,0.000005986808,0.0001623044,0.00001511186,0.0001286436,0.01864809,0.05604666,0.9249476],"study_design_scores_gemma":[0.0005037595,0.0002782322,0.0001060298,0.0000164603,0.000001967308,0.000004795346,0.00002147561,0.9731632,0.006997895,0.002765778,0.01594901,0.0001913931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000471538,0.000005001898,0.8821554,0.001151794,0.0001844781,0.00008003415,7.574354e-7,0.0001652969,0.1162101],"genre_scores_gemma":[0.414583,0.000002932751,0.5665396,0.007319121,0.00009768538,0.000009080373,0.000006398074,0.00001250088,0.01142967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9731481,"threshold_uncertainty_score":0.9999484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061893205","doi":"10.1007/s001900100217","title":"Spherical harmonic analysis and synthesis for global multiresolution applications","year":2002,"lang":"en","type":"article","venue":"Journal of Geodesy","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Computation; Scalar (mathematics); Spherical harmonics; Harmonic analysis; Multiresolution analysis; Convolution (computer science); Computer science; Dilation (metric space); Algorithm; Harmonic; Applied mathematics; Mathematics; Algebra over a field; Computational science; Mathematical analysis; Geometry; Pure mathematics; Physics; Artificial intelligence; Wavelet","retraction":null,"screen_n_in":null,"score":{"opus":0.03914701974110806,"gpt":0.2873069322746638,"spread":0.2481599125335557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001493821,0.00005580449,0.0001302923,0.0000701032,0.00006022694,0.0001488206,0.0002032911,0.00001933301,0.00001247871],"category_scores_gemma":[0.00003859175,0.0000484867,0.000119726,0.0004356047,0.00001800505,0.00049115,0.00002841621,0.00002936406,0.00000378351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005716258,"about_ca_system_score_gemma":0.00001152586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000483202,"about_ca_topic_score_gemma":0.000004281391,"domain_scores_codex":[0.9993676,0.00002105985,0.0002482607,0.0001025341,0.0001471484,0.0001134066],"domain_scores_gemma":[0.9994476,0.0000978491,0.0001713738,0.0001081094,0.00009675293,0.00007833551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001550758,0.0002179055,0.003761617,0.00001361327,0.0003521107,0.000003140877,0.0001214619,0.0001149025,0.001199756,0.008056393,0.002375042,0.9837685],"study_design_scores_gemma":[0.002343797,0.0007563244,0.1217815,0.00003516959,0.00124687,0.0002513724,0.0001189358,0.7995414,0.004338487,0.01821247,0.05082901,0.0005446997],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007072095,0.0001875507,0.9916288,0.000688848,0.00003302833,0.0000941715,0.000007017887,0.00001084597,0.0002776229],"genre_scores_gemma":[0.872914,0.00004511137,0.1268246,0.0001019456,0.00004284627,0.00001429999,7.105347e-7,0.000002023921,0.00005443562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9832239,"threshold_uncertainty_score":0.197723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146506178","doi":"10.1109/83.988952","title":"The quantized DCT and its application to DCT-based video coding","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Discrete cosine transform; Trellis quantization; Quantization (signal processing); Encoder; Algorithm; Transform coding; Computation; Lapped transform; Computer science; Modified discrete cosine transform; Data compression; Computational complexity theory; Coding (social sciences); Mathematics; Image compression; Computer vision; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03513321611543994,"gpt":0.2860669142346735,"spread":0.2509336981192336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743157,0.0001169944,0.00008399481,0.000109371,0.0006122903,0.0008349895,0.0002726105,0.00002312477,0.000007154229],"category_scores_gemma":[0.000008194019,0.00009684833,0.00003259186,0.0004473862,0.00002623224,0.001082853,0.000002380864,0.00009014057,0.00007500418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003670539,"about_ca_system_score_gemma":0.00002142891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003729599,"about_ca_topic_score_gemma":0.000005384886,"domain_scores_codex":[0.9990407,0.00003360305,0.0002028471,0.0002992031,0.0002107492,0.0002128918],"domain_scores_gemma":[0.9994638,0.000107174,0.00006280765,0.0002008438,0.00008236536,0.0000829965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001340214,0.00005314932,7.4825e-7,0.00002715373,0.000004870322,9.405336e-7,0.0004343539,0.000468086,0.0497255,0.0002776448,0.0001343386,0.9488598],"study_design_scores_gemma":[0.0003996277,0.00007605918,0.00001957074,0.00004143055,0.000008642552,0.000006045677,0.00003915654,0.8183146,0.1798551,0.0002086238,0.0008828694,0.0001482085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001551859,0.00008307368,0.9953095,0.002005219,0.00009798261,0.0003059744,0.000003765559,0.0001618253,0.0004808016],"genre_scores_gemma":[0.978705,0.00001548839,0.02036017,0.0005708029,0.00001282393,0.0001057847,5.918147e-7,0.00001112362,0.0002181801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9771532,"threshold_uncertainty_score":0.8051823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097392854","doi":"10.1109/iscas.2011.5937917","title":"Analysis of Mean-Square-Error (MSE) for fixed-point FFT units","year":2011,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Fast Fourier transform; Robustness (evolution); Mean squared error; Fixed-point arithmetic; Mathematics; Algorithm; Range (aeronautics); Floating point; Arithmetic; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1346562616309238,"gpt":0.3048344789388746,"spread":0.1701782173079509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693817,0.00008148741,0.0001604897,0.0002714815,0.00002893485,0.0000501234,0.0004199624,0.00002035659,0.0001778975],"category_scores_gemma":[0.00001768762,0.00006850503,0.0001034952,0.001101776,0.00001675256,0.0006418408,0.000080085,0.00001704524,0.00001338356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001283409,"about_ca_system_score_gemma":0.00002658683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007916563,"about_ca_topic_score_gemma":0.0001080599,"domain_scores_codex":[0.9992083,0.00002033815,0.0002566602,0.000208855,0.0001459164,0.000159988],"domain_scores_gemma":[0.99927,0.00005443563,0.00009067308,0.0003452635,0.0001835,0.00005612726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006838996,0.0004615563,0.00846849,0.00008331509,0.001588946,0.000004498242,0.02164783,0.00005072342,0.005324218,0.7794131,0.01105319,0.1718357],"study_design_scores_gemma":[0.00276423,0.002763805,0.08283586,0.00004244263,0.00107934,0.000005556286,0.002776771,0.6714889,0.1942886,0.03238336,0.008260928,0.00131021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01354218,0.00000455654,0.9664586,0.00005731289,0.00007681333,0.0002211734,0.00001908461,0.00006439479,0.01955585],"genre_scores_gemma":[0.9421604,6.411108e-7,0.05675891,0.0002261107,0.000007031911,0.0000256129,0.00002504138,0.00000446251,0.0007917728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9286183,"threshold_uncertainty_score":0.2793554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3103984832","doi":"10.1007/s11045-018-0601-5","title":"Low-complexity 8-point DCT approximation based on angle similarity for image and video coding","year":2018,"lang":"en","type":"article","venue":"Multidimensional Systems and Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete cosine transform; Decorrelation; Image compression; Orthogonal transformation; Transformation matrix; Data compression; Transform coding; Signal compression; Principal component analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05298930922502433,"gpt":0.2907698513058694,"spread":0.2377805420808451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822302,0.0001616296,0.0001825353,0.00009492845,0.0004876628,0.0005302607,0.00009953522,0.00004538395,0.000003487062],"category_scores_gemma":[0.00003395824,0.0001375563,0.0000309485,0.0001225482,0.000107223,0.0009957514,0.00006715818,0.00005821339,0.000003054232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003911873,"about_ca_system_score_gemma":0.00005143221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002902235,"about_ca_topic_score_gemma":0.000002752116,"domain_scores_codex":[0.9987113,0.0000594388,0.0002907083,0.0004298209,0.0002779295,0.0002307517],"domain_scores_gemma":[0.9992418,0.0001570991,0.0001445412,0.0001182074,0.0002352838,0.0001030374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007665458,0.0009217118,0.001202277,0.004181464,0.00006057482,0.00002778297,0.004072758,0.0006242617,0.5456638,0.1097982,0.003207456,0.3294731],"study_design_scores_gemma":[0.0008298398,0.0003048356,0.0008911733,0.0002850034,0.000005813837,0.00001269303,0.00006414677,0.980713,0.01465371,0.001844468,0.000203007,0.0001923058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04978568,0.00005201653,0.9489353,0.0002406345,0.0001015255,0.0004900751,0.00001930184,0.00007550186,0.000299972],"genre_scores_gemma":[0.9308347,4.871785e-7,0.06866736,0.0003094245,0.0001041873,0.00003238889,0.00002063048,0.000009968422,0.00002088183],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9800887,"threshold_uncertainty_score":0.5609384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105751676","doi":"10.1109/78.887000","title":"Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Finite impulse response; Mathematics; Group delay and phase delay; Stopband; Linear phase; Algorithm; Control theory (sociology); Parameterized complexity; Filter (signal processing); Computer science; Band-pass filter; Electronic engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02292491526069546,"gpt":0.2619199050629204,"spread":0.2389949898022249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903862,0.000166531,0.0002114375,0.0001543097,0.0001446893,0.0001357587,0.0001311129,0.00003712572,0.00001180495],"category_scores_gemma":[2.639877e-7,0.0001460702,0.00002774739,0.000279115,0.00007277042,0.001010198,0.000002175955,0.00008140451,9.946014e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003282994,"about_ca_system_score_gemma":0.00008227002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000428721,"about_ca_topic_score_gemma":0.00001402842,"domain_scores_codex":[0.9987726,0.00006810732,0.0003770146,0.0003158072,0.0002717514,0.0001946784],"domain_scores_gemma":[0.9994419,0.00008234163,0.0001679054,0.0001287915,0.0001062711,0.00007279226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000154758,0.0001148971,0.00002516958,0.0004999076,0.00004795014,0.000006887346,0.003510821,0.01462962,0.01878464,0.00006889957,0.000005648873,0.9621508],"study_design_scores_gemma":[0.002773651,0.001015971,0.0002823545,0.0006283779,0.00006187468,0.0001124453,0.0009935006,0.5754556,0.4181827,0.0001720532,0.000007194706,0.0003142781],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1677394,0.00003762138,0.8317209,0.0000246593,0.00001831064,0.0003357451,0.00001383697,0.00004417084,0.00006537422],"genre_scores_gemma":[0.9778481,0.000007295234,0.02202092,0.00003524024,0.000007218011,0.00003924827,0.000002075217,0.00001354873,0.00002633816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618365,"threshold_uncertainty_score":0.5956571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1870590056","doi":"10.1109/iscas.2004.1328808","title":"Improved radix-4 and radix-8 FFT algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Radix (gastropod); Twiddle factor; Fast Fourier transform; Computer science; Arithmetic; Algorithm; Split-radix FFT algorithm; Cooley–Tukey FFT algorithm; Lookup table; Prime-factor FFT algorithm; Rader's FFT algorithm; Parallel computing; Mathematics; Fourier transform; Fourier analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01852191408834589,"gpt":0.2504933026704272,"spread":0.2319713885820814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008132677,0.00008151939,0.0000706833,0.00005105619,0.00005044393,0.0003070721,0.0002310621,0.00001923447,0.0000153992],"category_scores_gemma":[0.000006207039,0.00006922884,0.00002153598,0.0001376041,0.00002163702,0.0009920944,0.00009329422,0.000032869,0.00003197176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002488837,"about_ca_system_score_gemma":0.00003248113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006122667,"about_ca_topic_score_gemma":0.000006166199,"domain_scores_codex":[0.999364,0.000008461255,0.0001238717,0.0002268991,0.0001028996,0.0001738597],"domain_scores_gemma":[0.9996561,0.00001493692,0.00002574783,0.000195245,0.00002100367,0.00008692393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000477509,0.00008413475,0.00008925804,0.0000117874,0.00002446284,0.00001480731,0.001048676,0.000005713139,0.02553334,0.3186127,0.002333497,0.6522368],"study_design_scores_gemma":[0.01474212,0.002780137,0.01075253,0.00006601434,0.00003561242,0.0005413752,0.00045851,0.2842361,0.292714,0.3027516,0.08855636,0.002365542],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004839442,0.00003963017,0.9857385,0.00139329,0.0001672147,0.0001353658,0.00000154124,0.0001481901,0.007536827],"genre_scores_gemma":[0.5748441,0.00001481483,0.4213142,0.001476582,0.00006821336,0.00001331812,0.000006921251,0.000009585606,0.002252355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6498713,"threshold_uncertainty_score":0.2961103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037872181","doi":"10.1063/1.1738187","title":"Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Discrete cosine transform; Discrete sine transform; Mathematics; Discrete Fourier transform (general); Inverse; Trigonometric functions; Fourier transform; Lie group; Pure mathematics; Discrete mathematics; Mathematical analysis; Fractional Fourier transform; Fourier analysis; Image (mathematics); Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03402168356775366,"gpt":0.2550529585405166,"spread":0.2210312749727629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001664844,0.00006487025,0.0001801802,0.00002057165,0.00002680338,0.0000191955,0.0001417977,0.0000165741,0.000001401464],"category_scores_gemma":[0.00004520438,0.00003545392,0.00007223956,0.00009955213,0.00004708377,0.0004966929,0.00004180021,0.0000480811,5.17132e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000119246,"about_ca_system_score_gemma":0.00004267265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.533021e-7,"about_ca_topic_score_gemma":1.204957e-7,"domain_scores_codex":[0.999112,0.00002242767,0.0003909078,0.00005735036,0.0003483733,0.00006890204],"domain_scores_gemma":[0.9993225,0.00002644681,0.0002796046,0.00009834873,0.0002400996,0.00003303371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005081743,0.0004143981,0.00002076221,0.0002897225,0.00005628644,0.000002388982,0.002798832,0.0009372435,0.5317611,0.4518176,0.0000698091,0.01178098],"study_design_scores_gemma":[0.00110075,0.0003102129,0.0003457531,0.0006681918,0.00003461013,0.00006088528,0.00005609361,0.03174666,0.7624245,0.2031495,0.00001749874,0.0000852637],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4412785,0.00006237986,0.5579044,0.0005262275,0.00004148625,0.0001156758,0.000001842308,0.000002796646,0.00006676226],"genre_scores_gemma":[0.9770985,0.000008827347,0.02279525,0.00005042055,0.0000236448,6.232859e-7,2.648533e-7,0.000004191285,0.00001833154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.53582,"threshold_uncertainty_score":0.1445769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066348733","doi":"10.1155/2007/83858","title":"Design of Optimal Quincunx Filter Banks for Image Coding","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Filter bank; Mathematics; Filter design; Finite impulse response; Algorithm; Filter (signal processing); Digital filter; JPEG; Separable space; Coding (social sciences); Coding gain; Control theory (sociology); Computer science; Artificial intelligence; Data compression; Computer vision; Decoding methods; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03226447291396645,"gpt":0.3158956479369514,"spread":0.2836311750229849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006640126,0.0001726847,0.0002234812,0.0002640757,0.000148791,0.000451949,0.0005107528,0.00003243786,0.0000151412],"category_scores_gemma":[0.00003448389,0.0001512629,0.00007019354,0.0003313829,0.00005253324,0.004206929,0.00004261432,0.0001841598,0.000003504661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007840793,"about_ca_system_score_gemma":0.00009519639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.278149e-7,"about_ca_topic_score_gemma":4.612677e-7,"domain_scores_codex":[0.9983163,0.00008245592,0.0006174735,0.0002635792,0.0003700372,0.0003500946],"domain_scores_gemma":[0.9989671,0.0002586594,0.0004348556,0.0001048847,0.0001773926,0.00005718499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003434274,0.0003055499,0.0003162996,0.0001876386,0.00001039843,0.00009298291,0.0006324842,0.05756713,0.07655904,0.006078531,0.0007556707,0.8571509],"study_design_scores_gemma":[0.005583037,0.003073478,0.001071034,0.001723654,0.00002645668,0.0005312728,0.0002857619,0.6126397,0.2940636,0.07394246,0.005882878,0.001176737],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002685153,0.0006365781,0.9947489,0.0001277667,0.0001438933,0.0002056235,0.000003145349,0.00002976708,0.001419204],"genre_scores_gemma":[0.697127,0.00002497944,0.3025039,0.0001310015,0.0001275363,0.00001035877,0.000002322835,0.00001384098,0.00005909513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8559741,"threshold_uncertainty_score":0.616832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048459949","doi":"10.1049/iet-ipr:20080057","title":"Recursive algorithm, architectures and FPGA implementation of the two-dimensional discrete cosine transform","year":2008,"lang":"en","type":"article","venue":"IET Image Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Discrete cosine transform; Algorithm; Kernel (algebra); Field-programmable gate array; Computer science; Computation; Block (permutation group theory); Reduction (mathematics); Parallel computing; Computer hardware; Mathematics; Artificial intelligence; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0157142205444693,"gpt":0.2912121909216899,"spread":0.2754979703772206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001007529,0.0001047904,0.00009984017,0.0000544433,0.000208683,0.0001064579,0.0002270198,0.00001333493,0.000006657464],"category_scores_gemma":[0.000006521676,0.00007414143,0.00003786412,0.0002273564,0.0001247973,0.0007144494,0.00007640675,0.0000654814,8.503058e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000166739,"about_ca_system_score_gemma":0.00009380031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003707221,"about_ca_topic_score_gemma":0.000008843237,"domain_scores_codex":[0.9991081,0.00003126428,0.0002178081,0.0002031936,0.0002716364,0.0001680478],"domain_scores_gemma":[0.9995976,0.00002763711,0.0001178613,0.0001252876,0.00009096896,0.00004066276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000008093982,0.00002081012,0.0002411103,0.00003648513,0.00001043699,0.000004268027,0.004157066,0.00002017856,0.01392406,0.0001384111,0.0002276068,0.9812115],"study_design_scores_gemma":[0.002623053,0.0002992415,0.02786734,0.0001983078,0.00003109052,0.0004321584,0.0005473568,0.02469555,0.914609,0.02799092,0.0002581688,0.0004478038],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1511693,0.0002108453,0.8456203,0.001747897,0.00009100269,0.0003933671,0.00003753098,0.00005539829,0.0006742725],"genre_scores_gemma":[0.9015174,0.000003151642,0.09813938,0.0002501023,0.00002575461,0.00001012274,0.000009250263,0.000007099548,0.00003774363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9807637,"threshold_uncertainty_score":0.30234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002357419","doi":"10.1117/12.732447","title":"Time-frequency multipliers for sound synthesis","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Transfer function; Wavelet; Time–frequency analysis; Pointwise; Frequency domain; Multiplication (music); Algorithm; Context (archaeology); Filter (signal processing); Mathematics; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01709146433297906,"gpt":0.2471016436989844,"spread":0.2300101793660053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108506,0.000274649,0.0003167642,0.000137181,0.0001038554,0.0002545852,0.001537724,0.0001294559,0.000007223197],"category_scores_gemma":[0.0007579053,0.0002392321,0.0005781499,0.0003485578,0.0001608624,0.001355021,0.0001756283,0.000141225,0.000003823049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001732368,"about_ca_system_score_gemma":0.00003293734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003931919,"about_ca_topic_score_gemma":1.156058e-7,"domain_scores_codex":[0.9977559,8.290234e-9,0.0007010197,0.0004270944,0.0006225032,0.000493432],"domain_scores_gemma":[0.9976556,0.0004338831,0.000356487,0.00007700554,0.001336539,0.0001405405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000443916,0.0000832551,0.0001173951,0.0001974243,0.0002216605,5.758463e-8,0.0002364888,0.00001537412,0.377882,0.6158887,0.002962181,0.002351108],"study_design_scores_gemma":[0.002892662,0.001074919,0.001582357,0.0004443818,0.0002608305,0.00003875437,0.001950155,0.1280367,0.8081405,0.04651614,0.007814463,0.001248231],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9787768,0.00003159314,0.01438596,0.001383234,0.0002619232,0.0007550432,0.00004964841,0.000131183,0.004224588],"genre_scores_gemma":[0.3393413,0.00001540964,0.6594772,0.0002004245,0.0003460311,0.0002253107,0.000009608593,0.00005474437,0.000329934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6450913,"threshold_uncertainty_score":0.9755604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385486157","doi":"10.1109/tcsi.2023.3298882","title":"Design of High Hardware Efficiency Approximate Floating-Point FFT Processor","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Fast Fourier transform; Digital signal processing; Split-radix FFT algorithm; Computer science; Algorithm; Multiplier (economics); Reduction (mathematics); Mathematics; Computer hardware; Fourier transform; Fourier analysis; Fractional Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.0355980757137643,"gpt":0.2422926645059093,"spread":0.206694588792145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854971,0.0001815669,0.0002589244,0.0002536556,0.0002078608,0.0002181433,0.0003136771,0.0000629799,0.000007152803],"category_scores_gemma":[0.00001007906,0.0001607899,0.0000649019,0.0007069011,0.00005415056,0.0004399644,0.000003373762,0.00007989978,0.00002054366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003421236,"about_ca_system_score_gemma":0.00007641501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003232847,"about_ca_topic_score_gemma":0.000001362479,"domain_scores_codex":[0.9983367,0.0001175004,0.0004066286,0.0004251382,0.0004136859,0.0003002902],"domain_scores_gemma":[0.9991786,0.0001106718,0.0001353825,0.0003569143,0.00009398995,0.0001244703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000494461,0.0005669492,0.00002657341,0.002054411,0.0003751737,0.00006608622,0.01306797,0.1812659,0.3915803,0.02228465,0.001379086,0.3872835],"study_design_scores_gemma":[0.003311912,0.001976099,0.0003348696,0.0009690655,0.0001130919,0.0001987116,0.002541716,0.8299899,0.1565832,0.001469581,0.00112274,0.001389123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006557716,0.00004453144,0.9913292,0.00011086,0.0005617577,0.0006359231,0.00002631257,0.0002581987,0.0004755106],"genre_scores_gemma":[0.9982038,0.00003181796,0.0007971755,0.00004208464,0.00001723383,0.00007240353,0.000004472744,0.00001825978,0.0008127691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9916461,"threshold_uncertainty_score":0.6556822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020509300","doi":"10.1007/s00041-006-6032-y","title":"Smooth Frame-Path Termination for Higher Order Sigma-Delta Quantization","year":2007,"lang":"en","type":"article","venue":"Journal of Fourier Analysis and Applications","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bandlimiting; Quantization (signal processing); Sigma; Hilbert space; Vector quantization; Path (computing); Delta-sigma modulation; Algorithm; Mathematical analysis; Computer science; Fourier transform; Physics; Telecommunications; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.01929461380094466,"gpt":0.3122673680323295,"spread":0.2929727542313849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000619202,0.00008272721,0.0001698215,0.000408504,0.0001281816,0.000232864,0.0002290384,0.00003731167,0.00001421949],"category_scores_gemma":[0.00002094636,0.00007011234,0.0001271152,0.001198474,0.00002246706,0.0006872482,0.00002431679,0.00005394024,0.000001238857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002555924,"about_ca_system_score_gemma":0.00003223685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000682185,"about_ca_topic_score_gemma":0.00001224896,"domain_scores_codex":[0.9989924,0.00001622883,0.0004701432,0.0001551104,0.0002364017,0.0001297308],"domain_scores_gemma":[0.9987319,0.0001118958,0.0004042822,0.000187779,0.000475168,0.00008902701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002518897,0.0003000942,0.008520954,0.00002531583,0.0005398638,0.000002144098,0.0004177546,0.0003950377,0.003499317,0.1995046,0.00221613,0.7845536],"study_design_scores_gemma":[0.002596318,0.0007425027,0.2573185,0.00004107185,0.002380352,0.00003460083,0.0003122825,0.1399415,0.006725617,0.07959354,0.5094631,0.0008506774],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00336206,0.00006312242,0.9951907,0.000702063,0.00004496891,0.0001672559,0.000007923221,0.0000124188,0.0004494204],"genre_scores_gemma":[0.8413373,0.00002972133,0.1577599,0.0002954617,0.0001786413,0.00001900115,0.00003152688,0.000006745106,0.000341665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8379753,"threshold_uncertainty_score":0.2859098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1870454542","doi":"10.1109/iscas.1990.112147","title":"Design of digital filters using simulated annealing","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Finite impulse response; Simulated annealing; Digital filter; Transfer function; Filter design; Adaptive simulated annealing; Linear filter; Computer science; Algorithm; Annealing (glass); Electronic engineering; Filter (signal processing); Control theory (sociology); Engineering; Materials science; Artificial intelligence; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.141530461847345,"gpt":0.2857543561051523,"spread":0.1442238942578073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000573227,0.00006981996,0.00007937014,0.0000777368,0.00002883579,0.0002218947,0.0002564139,0.00001636651,0.00006817504],"category_scores_gemma":[0.00001334673,0.0000638264,0.00002832723,0.0002562197,0.00001512506,0.001555501,0.00006125437,0.0000206245,0.00002631409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001503759,"about_ca_system_score_gemma":0.000006826163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005013783,"about_ca_topic_score_gemma":3.510869e-8,"domain_scores_codex":[0.9993516,0.00001594957,0.0001932829,0.0001464808,0.0001458067,0.0001469143],"domain_scores_gemma":[0.9996182,0.00006143904,0.00005723889,0.0001784013,0.00004332218,0.00004134221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002964546,0.0004657109,0.00242925,0.00006535924,0.0001638851,0.00005302496,0.005523088,0.5305,0.09056477,0.01588244,0.007839001,0.3464838],"study_design_scores_gemma":[0.0001852168,0.0000724003,0.00001559328,0.000006894415,0.000001909469,0.000005067986,0.00001698978,0.9875249,0.01131534,0.0007062845,0.00006558782,0.00008382351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01571602,0.00001093506,0.9807246,0.00004431504,0.00006140776,0.00009673883,0.00000197144,0.00007853156,0.003265484],"genre_scores_gemma":[0.9454904,0.00000109315,0.05415777,0.00008215044,0.000007282733,1.899486e-7,0.000001777425,0.000004471374,0.0002548164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9297744,"threshold_uncertainty_score":0.2602765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113871668","doi":"10.1109/tcsii.2006.882802","title":"Design of 1-D Stable Variable Fractional Delay IIR Filters","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Infinite impulse response; 2D Filters; Mathematics; Control theory (sociology); Filter design; Variable (mathematics); Digital filter; Stability (learning theory); Filter (signal processing); Polynomial; Computer science; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03553745668923033,"gpt":0.2511096429665384,"spread":0.215572186277308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004568095,0.0001795398,0.0002289367,0.0002244702,0.0004164969,0.0007147369,0.000146053,0.00007096388,0.000007402632],"category_scores_gemma":[0.000003359576,0.0001630108,0.00003666624,0.0003760757,0.00006840493,0.00242408,0.000004675263,0.0001148744,0.000001752312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000347803,"about_ca_system_score_gemma":0.00009814722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003489873,"about_ca_topic_score_gemma":0.000001567069,"domain_scores_codex":[0.9985389,0.00002915655,0.0004422966,0.0003550703,0.0003350194,0.0002995738],"domain_scores_gemma":[0.9992417,0.0001908023,0.0001575667,0.0001153087,0.0001371384,0.0001574944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006445246,0.0003920816,0.0001196001,0.0003004399,0.0001138134,0.00002046253,0.001208706,0.01938527,0.01406813,0.004601275,0.0001258522,0.9595999],"study_design_scores_gemma":[0.004159489,0.004057589,0.0006025258,0.001357244,0.0001639866,0.001210405,0.001983871,0.9452695,0.02485415,0.01011836,0.004105077,0.002117808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003323503,0.0002698514,0.9930544,0.00001535139,0.0001418846,0.0001969759,0.00002911797,0.00006296837,0.002905906],"genre_scores_gemma":[0.998578,0.000009469663,0.000828249,0.00005860998,0.00002781423,0.00000920328,0.000004745679,0.00001100287,0.0004729052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9952545,"threshold_uncertainty_score":0.6892225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2732578738","doi":"10.1109/fccm.2017.12","title":"A Configurable FPGA Implementation of the Tanh Function Using DCT Interpolation","year":2017,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Hyperbolic function; Discrete cosine transform; Field-programmable gate array; Interpolation (computer graphics); Computer science; Virtex; Algorithm; Function (biology); Trigonometric functions; Activation function; Adder; Computational science; Arithmetic; Mathematics; Computer hardware; Artificial neural network; Artificial intelligence; Image (mathematics); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05929419762999973,"gpt":0.333751257878376,"spread":0.2744570602483763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001567804,0.00006132683,0.0000615894,0.00003945133,0.000255971,0.0003854059,0.0004630339,0.00001588131,0.00009611663],"category_scores_gemma":[0.00001320095,0.00004437436,0.00004514146,0.00006959282,0.00002759828,0.001882436,0.0001313621,0.00002770703,0.000007285539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002414092,"about_ca_system_score_gemma":0.00004721805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004869338,"about_ca_topic_score_gemma":0.00009491984,"domain_scores_codex":[0.9993564,0.00002823013,0.0001981128,0.0001361287,0.0001748687,0.00010622],"domain_scores_gemma":[0.9991442,0.00001325221,0.0002711912,0.0004752437,0.00007630036,0.00001980584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002287624,0.0000602686,0.02907725,0.00003414353,0.00007321072,5.434898e-7,0.001311071,0.00003851813,0.2466002,0.2770271,0.002743387,0.4430115],"study_design_scores_gemma":[0.001572429,0.0003160356,0.4140669,0.00006340064,0.00004929614,0.00001197594,0.0009311611,0.08314199,0.4671018,0.0299418,0.002488002,0.0003151999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08098577,0.000004407394,0.9055474,0.0002958978,0.0005418494,0.0002450909,0.000003582618,0.00003025242,0.01234571],"genre_scores_gemma":[0.9963232,6.18306e-7,0.003251253,0.000133542,0.00002069461,0.000003913717,0.000002782331,0.000003314575,0.0002606682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9153374,"threshold_uncertainty_score":0.3716478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088839215","doi":"10.1109/tcsii.2007.898891","title":"On the Error-Free Realization of a Scaled DCT Algorithm and Its VLSI Implementation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Realization (probability); Very-large-scale integration; Computer science; Discrete cosine transform; Arithmetic; Algorithm; Computer engineering; Mathematics; Artificial intelligence; Embedded system; Statistics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03394156028638141,"gpt":0.2772975117773618,"spread":0.2433559514909804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004029857,0.0001589639,0.0001723228,0.0001759882,0.0004481555,0.0006185719,0.0001409952,0.00004809532,0.000003006065],"category_scores_gemma":[0.000005450692,0.0001190795,0.00003277864,0.0003099609,0.00005578047,0.001277953,0.000006765687,0.00007948749,6.044233e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002284717,"about_ca_system_score_gemma":0.00003474814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002743739,"about_ca_topic_score_gemma":0.00001176912,"domain_scores_codex":[0.998741,0.00003622809,0.0003966826,0.0003071195,0.0003106245,0.0002083995],"domain_scores_gemma":[0.9993516,0.0001479743,0.000162321,0.0001244863,0.0001127613,0.000100839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001115985,0.00007213192,0.00003362733,0.0001056813,0.00002649485,0.000003061544,0.00115168,0.0001034018,0.001149085,0.01052923,0.0000336453,0.9867808],"study_design_scores_gemma":[0.00929301,0.007701677,0.00534862,0.002305165,0.0003271354,0.000759535,0.01193096,0.8643098,0.04881714,0.04565897,0.0009895305,0.002558403],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04607558,0.0002373757,0.9520598,0.00006252804,0.00007115752,0.0002977297,0.00005547972,0.00004108685,0.001099289],"genre_scores_gemma":[0.9996907,0.00001809423,0.00005596107,0.00008684198,0.00002221273,0.00001188811,0.000007942959,0.000009170374,0.000097263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9842224,"threshold_uncertainty_score":0.5964903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105785674","doi":"10.1109/tcomm.2006.874006","title":"Efficient design of FMT systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Transceiver; Electronic engineering; Iterative method; Matched filter; Channel (broadcasting); Design methods; Systems design; Filter (signal processing); Engineering; Algorithm; Wireless; Telecommunications; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.06161142283313114,"gpt":0.2820327095995154,"spread":0.2204212867663842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001916807,0.00009278442,0.0001093878,0.0001750934,0.0002012913,0.0001020315,0.001080277,0.00003051234,0.00000681748],"category_scores_gemma":[0.000001710994,0.0000939013,0.00006044873,0.0004525385,0.00006819067,0.0001699273,0.000006074084,0.00009174222,0.00005417014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004859341,"about_ca_system_score_gemma":0.0000520703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001546416,"about_ca_topic_score_gemma":0.00001019258,"domain_scores_codex":[0.9990308,0.0001536695,0.0003308769,0.0001499198,0.0001976326,0.0001371091],"domain_scores_gemma":[0.9980302,0.000267235,0.0001003222,0.001461086,0.0001060865,0.0000351018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001034518,0.001213076,0.000005743992,0.00001851597,0.00003900431,6.711498e-7,0.0003718132,0.8451863,0.01133992,0.122587,0.001138912,0.01808867],"study_design_scores_gemma":[0.0003842706,0.0001506887,0.0001181655,0.00003886561,0.00001832114,0.00000963976,0.00005857988,0.9805141,0.01572704,0.001404413,0.001400331,0.0001755503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003283239,0.00008763889,0.9942403,0.0003602513,0.0002204838,0.0003178968,0.00002178024,0.0001261754,0.004297137],"genre_scores_gemma":[0.9476041,0.00001859201,0.0518428,0.0000286792,0.000006121923,0.00008734022,0.000004359774,0.00000741872,0.0004005994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9472758,"threshold_uncertainty_score":0.3829184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096956900","doi":"10.1109/iscas.2008.4542117","title":"A farrow-structure-based multi-mode transmultiplexer","year":2008,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Engineering Link (Canada)","funders":"","keywords":"Polyphase system; Decimation; Finite impulse response; Nyquist–Shannon sampling theorem; Control theory (sociology); Mathematics; Filter bank; Integer (computer science); Algorithm; Computer science; Bandwidth (computing); Electronic engineering; Filter (signal processing); Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05043798505796684,"gpt":0.2820573301421898,"spread":0.231619345084223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000302566,0.0001099956,0.00009027494,0.00007518751,0.00009004399,0.00008551453,0.0004017115,0.00002830198,0.00009026759],"category_scores_gemma":[0.000006766036,0.00009100695,0.00005714592,0.000193587,0.00003111086,0.0006702089,0.0000234513,0.00004592763,0.00005821462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000194484,"about_ca_system_score_gemma":0.00005692548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004896633,"about_ca_topic_score_gemma":0.00003323388,"domain_scores_codex":[0.9991569,0.00002178766,0.0001627055,0.0002532311,0.0001954512,0.0002099476],"domain_scores_gemma":[0.9995432,0.0000262867,0.00002784607,0.0002812679,0.00004050562,0.00008083374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000120827,0.001245679,0.02587715,0.00009654259,0.0001257654,0.0002695109,0.01044686,0.002968648,0.5073014,0.1202825,0.03241524,0.2988499],"study_design_scores_gemma":[0.004240763,0.0002159394,0.02284339,0.00001053701,0.000005718729,0.00007545895,0.00002139574,0.6168758,0.3400852,0.001555753,0.0134105,0.0006596075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0286457,0.000006975828,0.9686149,0.0003412846,0.0001224669,0.0001490156,0.000009977752,0.0002251777,0.001884483],"genre_scores_gemma":[0.7761074,6.891846e-7,0.2220604,0.001174013,0.00001185844,0.000006216805,0.00001132733,0.000005512461,0.0006226627],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7474617,"threshold_uncertainty_score":0.3711156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}