{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":72,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":72,"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":"6b38d6abb64e","filters":{"venue":"Journal of Signal Processing Systems"}},"results":[{"id":"W2071727855","doi":"10.1007/s11265-012-0685-3","title":"Hardware Implementation of Successive-Cancellation Decoders for Polar Codes","year":2012,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Coding (social sciences); Polar; Logarithm; Arithmetic; Algorithm; Coding theory; Theoretical computer science; Computer engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02961915339333666,"gpt":0.3307011821027505,"spread":0.3010820287094138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001549408,0.0001196919,0.00029451,0.0002325045,0.0001240928,0.0001386269,0.0004454735,0.00006018448,0.000002800177],"category_scores_gemma":[0.00005108872,0.0001029667,0.00009886803,0.0002540572,0.00002462487,0.001730922,0.00003249002,0.0001167386,5.076065e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001255299,"about_ca_system_score_gemma":0.0002325282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007978729,"about_ca_topic_score_gemma":0.000007487356,"domain_scores_codex":[0.9983659,0.00009177988,0.0007579732,0.0001147602,0.0004271621,0.0002424391],"domain_scores_gemma":[0.9969262,0.000175231,0.001830877,0.00011333,0.0008698066,0.00008455214],"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.0002409429,0.0004346285,0.2175147,0.005082189,0.0003402308,0.00001053342,0.03044173,0.005183844,0.2405975,0.007273211,0.008927325,0.4839533],"study_design_scores_gemma":[0.004712107,0.003120151,0.01257073,0.007407782,0.000444096,0.001038128,0.01847124,0.3085632,0.628756,0.003866968,0.009269617,0.001779973],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04156483,0.002520298,0.9549453,0.0001001216,0.000518137,0.0002239424,0.000004740354,0.00004905641,0.00007363295],"genre_scores_gemma":[0.9630845,0.000006455066,0.03652439,0.00001917015,0.0003206801,0.000008755395,0.000001399896,0.0000133578,0.00002126424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215197,"threshold_uncertainty_score":0.4198859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2301698642","doi":"10.1007/s11265-016-1173-y","title":"Fast Low-Complexity Decoders for Low-Rate Polar Codes","year":2016,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Computer science; Application-specific integrated circuit; Clock rate; Polar code; Latency (audio); Throughput; Code rate; Polar; Algorithm; CMOS; Field-programmable gate array; Efficient energy use; Word error rate; Bit error rate; Computer hardware; Electronic engineering; Telecommunications; Wireless; Electrical engineering; Physics; Engineering; Chip; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.03401375944202923,"gpt":0.285097868185592,"spread":0.2510841087435628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00252042,0.000243988,0.0005079212,0.0002973514,0.0002684317,0.0004882556,0.001310927,0.0001164203,0.000003316029],"category_scores_gemma":[0.0002048996,0.000159281,0.0001932323,0.0003135647,0.0001161611,0.001541554,0.00009546791,0.0002194937,0.000007584842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002194654,"about_ca_system_score_gemma":0.0004121004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002535932,"about_ca_topic_score_gemma":0.000007027431,"domain_scores_codex":[0.9975804,0.0001900181,0.0009481735,0.0003210806,0.0005198621,0.0004404606],"domain_scores_gemma":[0.996643,0.0004033524,0.001411413,0.0002794988,0.001077702,0.0001850114],"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.0005256108,0.0006519423,0.005376318,0.003960048,0.0002673355,0.0002214444,0.004486186,0.001297921,0.6241679,0.009577238,0.01367279,0.3357953],"study_design_scores_gemma":[0.00961177,0.005316854,0.002880592,0.04991271,0.000307035,0.00586514,0.002195931,0.4927326,0.340519,0.07657506,0.009602303,0.004481112],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03570072,0.0006914681,0.9616497,0.0006135372,0.0007107496,0.0002404957,0.000006449383,0.0002106501,0.0001762501],"genre_scores_gemma":[0.9598691,0.000008527215,0.03932927,0.00009926696,0.0004506411,0.00001177148,2.707899e-7,0.0000296501,0.0002014323],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9241685,"threshold_uncertainty_score":0.6495292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105281355","doi":"10.1007/s11265-007-0141-y","title":"Interconnect Driver Design for Long Wires in Field-Programmable Gate Arrays","year":2007,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; CMC Microsystems","keywords":"Interconnection; Repeater (horology); Field-programmable gate array; Overhead (engineering); Computer science; Node (physics); Electronic engineering; Path (computing); Transistor; Critical path method; Electrical engineering; Engineering; Embedded system; Voltage; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01834471730071356,"gpt":0.2463816501045032,"spread":0.2280369328037896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388365,0.0002433742,0.0004782915,0.0004703611,0.00008238031,0.0002120164,0.0003237541,0.0001607443,0.00000944707],"category_scores_gemma":[0.00005038651,0.0002068844,0.0001151867,0.0003683376,0.00002938087,0.0008703082,0.00001292817,0.000391727,0.000008346921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002299831,"about_ca_system_score_gemma":0.00009701365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001080037,"about_ca_topic_score_gemma":0.00001036973,"domain_scores_codex":[0.9978984,0.00004432484,0.001012296,0.0001542313,0.0003478689,0.0005428737],"domain_scores_gemma":[0.9988437,0.0003243742,0.0003320721,0.0001101749,0.0002547479,0.0001349542],"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.0007946446,0.0001523334,0.005251503,0.003397591,0.0002461692,0.00050736,0.004162554,0.7909268,0.04847216,0.00005006534,0.002579451,0.1434594],"study_design_scores_gemma":[0.004593366,0.001922607,0.0009152527,0.007935024,0.0001504425,0.001038017,0.002244346,0.8243746,0.1509281,0.0004643815,0.004228114,0.001205761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1670313,0.003687611,0.8278618,0.00002191666,0.0007539601,0.0003576572,6.218068e-7,0.0000774274,0.0002077574],"genre_scores_gemma":[0.9921688,0.00003918833,0.007037727,0.00002384223,0.0005759652,0.00001549855,6.455164e-7,0.00005926125,0.00007911697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8251375,"threshold_uncertainty_score":0.8436503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119245818","doi":"10.1007/s11265-008-0202-x","title":"Robust Multimodal Registration Using Local Phase-Coherence Representations","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Artificial intelligence; Computer science; Robustness (evolution); Subpixel rendering; Residual; Image registration; Computer vision; Pattern recognition (psychology); Coherence (philosophical gambling strategy); Image (mathematics); Mathematics; Algorithm; Pixel; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09840738497082493,"gpt":0.3438411514168963,"spread":0.2454337664460713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874328,0.0001319163,0.0002645749,0.0002135416,0.0002837221,0.0002627274,0.0005735965,0.00007674852,0.00001163597],"category_scores_gemma":[0.00009280516,0.0001127352,0.00007645292,0.0004502714,0.0001798304,0.002113145,0.00004004395,0.0002787084,0.000003391882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001421372,"about_ca_system_score_gemma":0.0005664271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007319287,"about_ca_topic_score_gemma":6.132652e-7,"domain_scores_codex":[0.997556,0.0001622756,0.0009507437,0.0002156558,0.0009205085,0.000194858],"domain_scores_gemma":[0.9975832,0.00009005638,0.001222769,0.0001823803,0.0007524873,0.0001690803],"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.0001495985,0.001414256,0.00136627,0.00070156,0.0001423316,0.001937079,0.008167873,0.1256329,0.4028821,0.0005865889,0.01046113,0.4465583],"study_design_scores_gemma":[0.001155227,0.0003105811,0.0001093105,0.0006364996,0.00002170247,0.003951014,0.0005501402,0.9520682,0.04077815,0.0001533727,0.00005990695,0.0002058903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008737176,0.0005010352,0.9900041,0.00009930634,0.0002261882,0.0001535805,8.573725e-7,0.00007812824,0.0001996425],"genre_scores_gemma":[0.7778992,0.000008284135,0.2217159,0.00005000512,0.0002280691,0.000003845219,8.927669e-7,0.000008356757,0.000085411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8264353,"threshold_uncertainty_score":0.4597206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124989052","doi":"10.1007/s11265-007-0156-4","title":"On Bandwidth Selection in Local Polynomial Regression Analysis and Its Application to Multi-resolution Analysis of Non-uniform Data","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Saskatchewan; University of Missouri","keywords":"Bandwidth (computing); Algorithm; Computer science; Polynomial regression; Polynomial; Regression analysis; Signal processing; Mathematics; Digital signal processing; Machine learning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03720577878590518,"gpt":0.3207950727128988,"spread":0.2835892939269936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135151,0.0001587927,0.0006610472,0.002314403,0.0001716729,0.0001005404,0.0006364221,0.0001047668,0.000001120829],"category_scores_gemma":[0.00007507556,0.0001242714,0.000114314,0.004743289,0.00003531236,0.0009724408,0.0001054639,0.0002334914,0.000001010019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001443206,"about_ca_system_score_gemma":0.0001789364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002097084,"about_ca_topic_score_gemma":0.00004114009,"domain_scores_codex":[0.9976929,0.0002325501,0.000889671,0.0003661162,0.0006172784,0.0002015027],"domain_scores_gemma":[0.9981244,0.0001335104,0.0009197702,0.0002418138,0.0004536088,0.0001269227],"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.0006163105,0.0004060477,0.007875066,0.0001906384,0.0009432505,0.00005286176,0.002266865,0.8099298,0.0875236,0.00003293773,0.0001675374,0.08999507],"study_design_scores_gemma":[0.0006027856,0.0002032957,0.01903291,0.0002295316,0.0004590551,0.00006360746,0.00004761952,0.9753508,0.003863008,0.000006515246,0.00001579389,0.0001250625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1385823,0.0004368777,0.8607317,0.0000476938,0.00005140001,0.0001221712,0.000003464849,0.000009817625,0.00001455609],"genre_scores_gemma":[0.9703979,0.00001877026,0.02942492,0.00002818887,0.00008084183,0.00000294799,0.000005376988,0.000007162304,0.00003382415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8318157,"threshold_uncertainty_score":0.5067639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163786726","doi":"10.1007/s11265-015-1012-6","title":"Speaker Adaptation of Hybrid NN/HMM Model for Speech Recognition Based on Singular Value Decomposition","year":2015,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Speech recognition; Singular value decomposition; TIMIT; Hidden Markov model; Adaptation (eye); Vocabulary; Speaker recognition; Pattern recognition (psychology); Artificial intelligence; Artificial neural network; Task (project management)","retraction":null,"screen_n_in":null,"score":{"opus":0.08558740047888537,"gpt":0.293905759405991,"spread":0.2083183589271057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001959316,0.000160931,0.0003709099,0.0004018417,0.00009769736,0.0002332935,0.0003076918,0.00006487817,0.000002853677],"category_scores_gemma":[0.0001608496,0.0001401031,0.0001645074,0.0002327919,0.00002833146,0.0009202103,0.00001262267,0.0001387896,0.000006924122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001573661,"about_ca_system_score_gemma":0.0004890336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009597158,"about_ca_topic_score_gemma":5.245669e-7,"domain_scores_codex":[0.9977693,0.0001655016,0.000851067,0.0002120386,0.0008171323,0.00018494],"domain_scores_gemma":[0.9965522,0.0001878556,0.001217894,0.0001341281,0.00174854,0.0001593736],"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.0005603574,0.0005519521,0.00003090826,0.0004592098,0.00005700616,0.00006361493,0.0007300638,0.3415025,0.008323055,0.0001902508,0.0009411094,0.6465899],"study_design_scores_gemma":[0.001070504,0.0005048678,0.000006450006,0.001187725,0.00004745525,0.000258871,0.0001542559,0.96675,0.02641003,0.003374554,0.00007588523,0.0001593732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03973265,0.0001861777,0.9588892,0.0001866458,0.0003352828,0.0002352688,0.00001066066,0.00003237701,0.0003917791],"genre_scores_gemma":[0.7791128,0.00000176623,0.2205331,0.00010059,0.0001993987,0.000006267575,0.000007505947,0.00001515037,0.00002346448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7393801,"threshold_uncertainty_score":0.5713241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385320790","doi":"10.1007/s11265-023-01880-w","title":"Low Power Blockchain in Industry 4.0 Case Study: Water Management in Tunisia","year":2023,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Blockchain Technology Applications and Security","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":"Université de Moncton","funders":"","keywords":"Traceability; Blockchain; Computer security; Water security; Reliability (semiconductor); Business; Work (physics); Consumption (sociology); Service provider; Internet of Things; Environmental economics; Water industry; Computer science; Service (business); Water supply; Power (physics); Engineering; Water resources; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.0173303216200356,"gpt":0.2698707386578749,"spread":0.2525404170378392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306083,0.0001395338,0.0002999919,0.00101346,0.0001067011,0.0001587742,0.0007167617,0.0002046125,0.000002884031],"category_scores_gemma":[0.000005904994,0.0001042694,0.00003873056,0.001366636,0.00003715997,0.0001909001,0.0002102433,0.0008033141,0.00001069564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038956,"about_ca_system_score_gemma":0.00005965414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000048111,"about_ca_topic_score_gemma":0.00001928425,"domain_scores_codex":[0.9981571,0.0001280425,0.0007719577,0.0002525374,0.0003566619,0.0003336811],"domain_scores_gemma":[0.9992717,0.00003411982,0.0002516133,0.0002593375,0.0001156428,0.00006761626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"case_report","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001595179,0.008776018,0.08394887,0.002049264,0.0005347345,0.4173838,0.1029037,0.09087144,0.006288949,0.01382029,0.002421787,0.2708417],"study_design_scores_gemma":[0.009103552,0.001565467,0.009456561,0.003376677,0.00007556305,0.0357854,0.1335595,0.7862958,0.003381724,0.01387486,0.001858069,0.001666809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898955,0.0001776217,0.008669655,0.0005847313,0.0001356067,0.0003226755,3.119726e-7,0.00007328315,0.0001405922],"genre_scores_gemma":[0.9994538,0.000002362711,0.0003411178,0.00003196273,0.00004061232,0.00003457708,1.331276e-7,0.00001014506,0.00008522585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6954244,"threshold_uncertainty_score":0.4251982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016433047","doi":"10.1007/s11265-009-0376-x","title":"Efficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Jordan University of Science and Technology; Dalhousie University","keywords":"Elliptic curve cryptography; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Field-programmable gate array; Tripling-oriented Doche–Icart–Kohel curve; Computation; Computer science; Elliptic curve; Hessian form of an elliptic curve; Parallel computing; Multiplication (music); Cryptography; Prime (order theory); Arithmetic; Mathematics; Algorithm; Computer hardware; Public-key cryptography; Combinatorics; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.014614736333983,"gpt":0.2884955644651681,"spread":0.2738808281311851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717722,0.0001375723,0.0003186591,0.0003608593,0.0001854182,0.0002631709,0.0004211043,0.00005089185,0.00000165995],"category_scores_gemma":[0.00001258547,0.0001046749,0.0001880818,0.0006018894,0.00004855544,0.0001517439,0.00001823235,0.0001531007,6.321608e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003673053,"about_ca_system_score_gemma":0.0002102796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001190159,"about_ca_topic_score_gemma":0.000001309283,"domain_scores_codex":[0.9982248,0.0000825794,0.0007882417,0.0001708728,0.0004782479,0.0002552347],"domain_scores_gemma":[0.9980151,0.0001155024,0.000988289,0.000115625,0.0006668064,0.00009868134],"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.00007409157,0.0004816261,0.000226605,0.0008805442,0.0001093281,0.00001851158,0.004724529,0.4005443,0.006355906,0.004590919,0.0003153825,0.5816783],"study_design_scores_gemma":[0.007629556,0.008478723,0.008228683,0.004213995,0.0004177795,0.001702813,0.004664515,0.9083402,0.02119419,0.02919861,0.004787546,0.001143366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04127592,0.002200007,0.9553137,0.0005630493,0.0001737976,0.0004134349,0.000003086382,0.00002629921,0.00003073425],"genre_scores_gemma":[0.9399735,0.000003240159,0.05982262,0.0000331901,0.0001453967,0.000008066783,0.000001200804,0.000006906017,0.000005836739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8986976,"threshold_uncertainty_score":0.4268517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094505522","doi":"10.1007/s11265-014-0911-2","title":"Iris Recognition using Robust Localization and Nonsubsampled Contourlet Based Features","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Contourlet; Artificial intelligence; Pattern recognition (psychology); Iris recognition; Computer science; Computer vision; Support vector machine; Feature extraction; Feature selection; Feature vector; Biometrics; Wavelet transform","retraction":null,"screen_n_in":null,"score":{"opus":0.04843114347158269,"gpt":0.2589170760828741,"spread":0.2104859326112914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466125,0.00009963215,0.0002201733,0.000453425,0.0002048508,0.0007468893,0.0002392012,0.00008669162,0.000004883112],"category_scores_gemma":[0.0001308459,0.00008288254,0.00004357588,0.0006845344,0.00004162709,0.0006963724,0.000019443,0.0001442882,0.000002512247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005723619,"about_ca_system_score_gemma":0.0001271059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004092379,"about_ca_topic_score_gemma":0.000001872792,"domain_scores_codex":[0.9985986,0.0002137205,0.0004783491,0.0001597619,0.0004194177,0.0001301756],"domain_scores_gemma":[0.9981408,0.0001120996,0.0007694144,0.00009770958,0.0007767065,0.0001032909],"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.000232534,0.0006865758,0.006643233,0.003020387,0.0001672267,0.00005780272,0.003809459,0.05775684,0.03686164,0.001916282,0.008456403,0.8803916],"study_design_scores_gemma":[0.0005730176,0.00007329556,0.0004831546,0.0003935718,0.0000240109,0.0002238652,0.00008456285,0.994846,0.0005359442,0.0002394551,0.002395689,0.0001273867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009515581,0.001163872,0.9886997,0.0001646873,0.0003016146,0.00007699701,0.00000167208,0.00002538671,0.00005049109],"genre_scores_gemma":[0.9704611,0.000006488482,0.02914935,0.0001358965,0.0002214082,9.752033e-7,0.000003508207,0.000007129134,0.00001419647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9609455,"threshold_uncertainty_score":0.7202271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367316159","doi":"10.1007/s11265-023-01870-y","title":"A Fast and Light Fingerprint-Matching Model Based on Deep Learning Approaches","year":2023,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Biometrics; Artificial intelligence; Preprocessor; Convolutional neural network; Identification (biology); Fingerprint (computing); Segmentation; Pattern recognition (psychology); Matching (statistics); Architecture; Deep learning; Computer vision; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04477417712601117,"gpt":0.2497754268995254,"spread":0.2050012497735142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751102,0.0001154751,0.0002275655,0.0007769493,0.0002747817,0.00081668,0.000413287,0.00006927067,8.308247e-7],"category_scores_gemma":[0.00005917737,0.00009253401,0.00006168727,0.001122011,0.00002309097,0.0005228759,0.00005932615,0.0003473505,0.000008426336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004959893,"about_ca_system_score_gemma":0.0001211284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003587205,"about_ca_topic_score_gemma":2.748364e-7,"domain_scores_codex":[0.9984505,0.00011457,0.0004542823,0.0002097908,0.0005797578,0.0001910631],"domain_scores_gemma":[0.9989562,0.0001123186,0.000529873,0.0001129471,0.0001751384,0.000113524],"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.00002097406,0.00008781042,0.0003226503,0.0005053681,0.00002186436,0.00003870806,0.005659037,0.7639283,0.002214948,0.001579096,0.0001436872,0.2254776],"study_design_scores_gemma":[0.0002064225,0.00005656271,0.0001924013,0.0003052987,0.000006407393,0.00005121836,0.000465708,0.9978045,0.0001776958,0.0004510969,0.0001775665,0.0001051445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01440825,0.0006088213,0.983524,0.0007596452,0.0001543835,0.00006213648,2.888619e-7,0.00008005164,0.0004023778],"genre_scores_gemma":[0.9945337,0.000007647657,0.005106904,0.00004295177,0.00009956199,0.000002915532,5.292487e-7,0.000009849399,0.0001959079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9801255,"threshold_uncertainty_score":0.7875264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2524478612","doi":"10.1007/s11265-016-1159-9","title":"Discriminating Bipolar Disorder from Major Depression using Whole-Brain Functional Connectivity: a Feature Selection Analysis with SVM-FoBa Algorithm","year":2016,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lawson Health Research Institute; Western University","funders":"National Institutes of Health; Chinese Academy of Sciences; National Natural Science Foundation of China; National High-tech Research and Development Program; Lawson Health Research Institute","keywords":"Feature selection; Support vector machine; Discriminative model; Feature (linguistics); Pattern recognition (psychology); Major depressive disorder; Artificial intelligence; Bipolar disorder; Neuroimaging; Mood; Computer science; Psychology; Machine learning; Psychiatry","retraction":null,"screen_n_in":null,"score":{"opus":0.02645835649391739,"gpt":0.2559026675217106,"spread":0.2294443110277932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009579693,0.0003944023,0.0007550656,0.0007435481,0.0009501048,0.0003552262,0.0002410453,0.0001696655,0.00002989151],"category_scores_gemma":[0.001749416,0.0002353861,0.0002585773,0.001667144,0.0001916399,0.001723416,0.00007938469,0.0004948673,0.000004717284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004076442,"about_ca_system_score_gemma":0.0003050057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001843476,"about_ca_topic_score_gemma":0.00007362128,"domain_scores_codex":[0.9962254,0.0005770306,0.0006486181,0.0007046571,0.001412928,0.0004313751],"domain_scores_gemma":[0.9935814,0.003881219,0.001492018,0.0001643854,0.0007167538,0.0001642531],"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.0006562833,0.0002998533,0.06875052,0.0001307082,0.0008670122,0.00008717246,0.000501102,0.01206666,0.8368455,0.0000296724,0.001020997,0.07874455],"study_design_scores_gemma":[0.01503315,0.003078338,0.09798826,0.01075145,0.0078455,0.005907733,0.006584958,0.6657686,0.1534296,0.001818198,0.02798666,0.003807576],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3703025,0.00198268,0.6246198,0.002409089,0.0003585368,0.0001875107,0.00005729722,0.00006029261,0.00002236304],"genre_scores_gemma":[0.9957907,0.000005363729,0.002456684,0.0002401586,0.001038818,0.00001484787,0.000002941323,0.00005361818,0.0003968551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6834158,"threshold_uncertainty_score":0.9598768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766216077","doi":"10.1007/s11265-018-1430-3","title":"Fast and Flexible Software Polar List Decoders","year":2019,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; Agence Nationale de la Recherche","keywords":"Computer science; Decoding methods; Puncturing; Software; Soft-decision decoder; Coding (social sciences); Redundancy (engineering); Computer engineering; Algorithm; Throughput; Computer hardware; Wireless; Telecommunications; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01247361317575138,"gpt":0.2494648621683075,"spread":0.2369912489925561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066067,0.0001623645,0.0003497936,0.0002690481,0.0001316742,0.0006343512,0.0007155364,0.00009039375,0.000004340588],"category_scores_gemma":[0.00005502883,0.0001338575,0.00007228424,0.000331294,0.00003771932,0.00133107,0.0001164456,0.0003501692,0.00000884787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008753713,"about_ca_system_score_gemma":0.0002381156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004288002,"about_ca_topic_score_gemma":0.000001631842,"domain_scores_codex":[0.9983739,0.00008537659,0.000548379,0.0002302976,0.0005115593,0.0002504408],"domain_scores_gemma":[0.998343,0.0001158272,0.0007742681,0.0002027505,0.0004329651,0.0001312007],"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.0002059896,0.0004322567,0.2319021,0.005060043,0.0002823898,0.0004484959,0.0143866,0.007814972,0.08198528,0.003314817,0.01052351,0.6436436],"study_design_scores_gemma":[0.005449216,0.00625527,0.008268318,0.02677696,0.0002468304,0.02731558,0.006867636,0.8337246,0.04470958,0.0112825,0.02497492,0.00412855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06632546,0.004222606,0.9276744,0.0001707271,0.0006443971,0.0001457867,7.446232e-7,0.0002383903,0.0005774579],"genre_scores_gemma":[0.9558166,0.000010867,0.04351724,0.00008449745,0.0001638909,0.000001580743,1.572752e-7,0.0000187413,0.0003864574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8894911,"threshold_uncertainty_score":0.6117063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069850539","doi":"10.1007/s11265-013-0797-4","title":"Music Genre Classification Using Spectral Analysis and Sparse Representation of the Signals","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":17,"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":"Sparse approximation; Pattern recognition (psychology); Artificial intelligence; Computer science; Feature extraction; Classifier (UML); Dimensionality reduction; K-SVD; Audio signal; Speech recognition; Speech coding","retraction":null,"screen_n_in":null,"score":{"opus":0.06478566272104326,"gpt":0.281435731470267,"spread":0.2166500687492237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718981,0.0001266035,0.0003889382,0.0003086231,0.000205072,0.0005112852,0.0004954818,0.00006279619,0.00001169246],"category_scores_gemma":[0.00003765836,0.00008216673,0.0001518918,0.00150308,0.0000916842,0.001435022,0.00006624051,0.0001738469,9.400871e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005354994,"about_ca_system_score_gemma":0.0001994692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009455238,"about_ca_topic_score_gemma":0.000001669583,"domain_scores_codex":[0.998035,0.0001722693,0.0008215088,0.0002064778,0.0005906215,0.0001741213],"domain_scores_gemma":[0.997053,0.00007288058,0.001949259,0.0002065394,0.0006379157,0.00008035295],"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.00002054776,0.0001426702,0.04931965,0.0006781555,0.0005218326,0.0000120552,0.005228295,0.03371204,0.8118513,0.0005918648,0.000472023,0.09744954],"study_design_scores_gemma":[0.0003155415,0.00005739908,0.05172133,0.0006433816,0.0003555785,0.0002289571,0.001073786,0.9288074,0.01556045,0.00103315,0.00002136571,0.0001815974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5087036,0.0008787623,0.4898698,0.0002096588,0.0001184606,0.0001028214,3.306111e-7,0.00000820399,0.0001083027],"genre_scores_gemma":[0.9926744,0.000006669848,0.006988972,0.00006373422,0.0002052292,0.00000205774,2.129711e-7,0.000007274769,0.00005150898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8950954,"threshold_uncertainty_score":0.4930335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057220308","doi":"10.1007/s11265-008-0274-7","title":"Monaural Speech Separation Based on Gain Adapted Minimum Mean Square Error Estimation","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Queen's University","funders":"","keywords":"Monaural; Estimator; Mean squared error; Computer science; Speech recognition; SIGNAL (programming language); Minimum mean square error; Source separation; Separation (statistics); Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03629040671234737,"gpt":0.2861034167571161,"spread":0.2498130100447688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837384,0.0002434957,0.0004043099,0.0004155838,0.0004162772,0.0004292626,0.000590266,0.0001169621,0.000005874039],"category_scores_gemma":[0.00007280059,0.0001972882,0.0001289705,0.0006434034,0.00005252375,0.001652953,0.00002495965,0.0003306111,0.00001799348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001750195,"about_ca_system_score_gemma":0.000677373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000771026,"about_ca_topic_score_gemma":0.000001367053,"domain_scores_codex":[0.9971462,0.000158087,0.0008849152,0.0002848991,0.001204291,0.0003215729],"domain_scores_gemma":[0.9975596,0.00009130577,0.001252079,0.0001981435,0.0007182207,0.0001806365],"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.0004615539,0.0006287549,0.001514828,0.001106609,0.00006888252,0.001250782,0.004508996,0.6754123,0.05584722,0.000091848,0.005333091,0.2537751],"study_design_scores_gemma":[0.000845017,0.0005063734,0.0002719423,0.001240606,0.00001643629,0.001094806,0.0002022125,0.9568738,0.03840615,0.0001545932,0.0001379363,0.0002501824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1342023,0.0007574918,0.8633229,0.000496915,0.000397926,0.0001632147,0.000001224142,0.00009707208,0.000560988],"genre_scores_gemma":[0.9577985,0.000002537958,0.04144899,0.0001784217,0.0003938911,0.000004095781,0.00000270954,0.00001931813,0.0001515109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8235962,"threshold_uncertainty_score":0.8045181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899428255","doi":"10.1007/s11265-018-1413-4","title":"Operation Merging for Hardware Implementations of Fast Polar Decoders","year":2018,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Throughput; Polar code; Block (permutation group theory); Node (physics); Application-specific integrated circuit; Coding (social sciences); Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.03184729412565777,"gpt":0.3307016108114475,"spread":0.2988543166857897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144362,0.0001076286,0.0002473139,0.0002594841,0.0002485166,0.0002418892,0.0005324653,0.0000437488,0.000003370445],"category_scores_gemma":[0.00006318051,0.00009008811,0.00008860065,0.0002650943,0.00004168343,0.001095586,0.00004245974,0.0001047168,9.608382e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000858352,"about_ca_system_score_gemma":0.0002938628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005080284,"about_ca_topic_score_gemma":0.00001372005,"domain_scores_codex":[0.9985213,0.00006865006,0.000731126,0.0001431688,0.0003590427,0.0001767313],"domain_scores_gemma":[0.9973891,0.00008894485,0.001002538,0.0001272593,0.001333692,0.00005842052],"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.000223342,0.0004175306,0.01367631,0.002561012,0.0004074607,0.00002572417,0.04429101,0.005988047,0.5943975,0.009374535,0.01650334,0.3121342],"study_design_scores_gemma":[0.001822897,0.003138895,0.0007305529,0.003926672,0.0001506323,0.000827943,0.008386262,0.7572203,0.2156173,0.00228509,0.005188657,0.0007047994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01534375,0.0003800922,0.9832841,0.0001842911,0.000431751,0.0001879949,0.000003974141,0.00005439193,0.0001296728],"genre_scores_gemma":[0.8955529,0.00000209391,0.1040403,0.00003362308,0.0003196171,0.000007304908,8.812612e-7,0.00001176717,0.00003148096],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8802091,"threshold_uncertainty_score":0.3673687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979930092","doi":"10.1007/s11265-009-0434-4","title":"Study of Algorithmic and Architectural Characteristics of Gaussian Particle Filters","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Resampling; Computer science; Field-programmable gate array; Realization (probability); Gaussian; Particle filter; Throughput; Computer engineering; Algorithm; Parallel computing; Computer hardware; Artificial intelligence; Mathematics; Kalman filter; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01825937545305971,"gpt":0.2524535555139226,"spread":0.2341941800608628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629531,0.0001088165,0.0003907667,0.0001123226,0.0000703059,0.0001233764,0.0003940988,0.00003782495,0.000001093274],"category_scores_gemma":[0.00002252251,0.00008014223,0.00004309576,0.0002331175,0.00004409362,0.0003285248,0.00003893362,0.0001834132,2.427506e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001170276,"about_ca_system_score_gemma":0.00005033509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001058794,"about_ca_topic_score_gemma":2.845077e-7,"domain_scores_codex":[0.9983327,0.0001092358,0.0008331834,0.0001355787,0.0004294105,0.0001599251],"domain_scores_gemma":[0.998422,0.00007743742,0.001016675,0.0001550579,0.0002339342,0.00009484794],"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.0002438189,0.00136162,0.0196468,0.0004962056,0.0001238049,0.0003006263,0.01942794,0.005958491,0.03549279,0.0004627294,0.0002504112,0.9162347],"study_design_scores_gemma":[0.00659329,0.01398372,0.2960361,0.005768152,0.0002643275,0.005433652,0.008549307,0.6523404,0.008726902,0.0009743869,0.0002800761,0.001049743],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9100944,0.000689894,0.08880036,0.00008297013,0.0002024764,0.00009375859,0.000002467549,0.00001311002,0.00002053298],"genre_scores_gemma":[0.9966012,0.000007479185,0.003198603,0.00001647573,0.0001616847,4.630016e-7,2.960904e-7,0.000004762581,0.000009050547],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.915185,"threshold_uncertainty_score":0.3268105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982382171","doi":"10.1007/s11265-012-0656-8","title":"Differential Time Signaling Data-Link Architecture","year":2012,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advancements in PLL and VCO Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Signal edge; Jitter; Computer science; Digital clock manager; SIGNAL (programming language); CMOS; Clock domain crossing; Field-programmable gate array; Bandwidth (computing); Electronic engineering; Computer hardware; Clock skew; Clock signal; Analog signal; Engineering; Telecommunications; Digital signal processing; Synchronous circuit","retraction":null,"screen_n_in":null,"score":{"opus":0.02541652138477105,"gpt":0.2550465116825602,"spread":0.2296299902977891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560461,0.0001904867,0.0003544422,0.0001698725,0.00009111571,0.0001051805,0.0005804852,0.0001153073,0.00004862429],"category_scores_gemma":[0.00002807916,0.0001409998,0.00005321467,0.0001556467,0.00004911224,0.0007561788,0.00008175713,0.0004619435,0.00001859868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005853982,"about_ca_system_score_gemma":0.0000264869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.268174e-7,"about_ca_topic_score_gemma":4.009996e-8,"domain_scores_codex":[0.998559,0.00002741595,0.0005790557,0.0001012888,0.000377946,0.0003552659],"domain_scores_gemma":[0.9992612,0.00005625074,0.0002929706,0.0002012215,0.00008883304,0.00009951695],"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.0000886194,0.0001618703,0.001306292,0.001793618,0.0005198525,0.0000527213,0.001078919,0.1491373,0.3721489,0.0001134715,0.005054852,0.4685436],"study_design_scores_gemma":[0.004554361,0.000901879,0.0005217614,0.009497201,0.001166406,0.004770629,0.003538004,0.6504949,0.110341,0.002573948,0.2080813,0.003558538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1521552,0.02340445,0.8209375,0.00008314737,0.00187267,0.0001763214,0.00002639596,0.000449873,0.0008945136],"genre_scores_gemma":[0.9945138,0.00003178461,0.003300213,0.000007589606,0.001999209,0.000001952883,0.000006709119,0.00003686016,0.0001019017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8423586,"threshold_uncertainty_score":0.5749804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4303645613","doi":"10.1007/s11265-022-01814-y","title":"PipeBERT: High-throughput BERT Inference for ARM Big.LITTLE Multi-core Processors","year":2022,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Huawei Technologies","keywords":"Computer science; Inference; Pipeline (software); Edge device; Throughput; Enhanced Data Rates for GSM Evolution; Parallel computing; Cluster analysis; Artificial intelligence; Computer engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.06144530065752316,"gpt":0.3143183680113405,"spread":0.2528730673538173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712728,0.0002383288,0.0004501817,0.0002167254,0.0007995853,0.0002788151,0.001223507,0.00005865583,0.000006170504],"category_scores_gemma":[0.00007757212,0.0002073067,0.0001296919,0.0009769999,0.00006646833,0.000896266,0.0002624289,0.0004939067,0.000004016435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002321002,"about_ca_system_score_gemma":0.0005138032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001569584,"about_ca_topic_score_gemma":0.000002456713,"domain_scores_codex":[0.9973607,0.00008062944,0.0009510851,0.0004130401,0.0007699462,0.0004246039],"domain_scores_gemma":[0.9969903,0.0003274444,0.001507413,0.0003041793,0.0007036976,0.0001669653],"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.0003121681,0.001970273,0.001293695,0.001457643,0.0001880064,0.0001547607,0.005723041,0.6843063,0.02017701,0.02581596,0.006173983,0.2524272],"study_design_scores_gemma":[0.003031047,0.001547987,0.0003272811,0.0006664519,0.00006859641,0.001606267,0.0008314122,0.9158578,0.002503134,0.01634174,0.05627582,0.0009424799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009107321,0.00237647,0.9863476,0.0007184567,0.0007674071,0.0005167197,0.00001139476,0.00009289338,0.00006172356],"genre_scores_gemma":[0.9564658,0.00001806717,0.04205057,0.0001963901,0.0005653093,0.0002184483,0.000003475958,0.00003260066,0.0004492887],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9473585,"threshold_uncertainty_score":0.8453721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069839933","doi":"10.1007/s11265-009-0441-5","title":"Tracking Forecast Memories for Stochastic Decoding","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Decoding methods; Computer science; Tracking (education); Encoding (memory); Channel (broadcasting); Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence; Theoretical computer science; Arithmetic; Mathematics; Computer network; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.03194897535052128,"gpt":0.2942733387485166,"spread":0.2623243633979954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002031,0.0001734764,0.000364583,0.0002917902,0.0002947133,0.000780126,0.0009712437,0.0001071875,0.00000141628],"category_scores_gemma":[0.0003379251,0.0001430918,0.0001381904,0.0002976713,0.00004746535,0.001436138,0.00006136359,0.0005019248,0.000001053243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006129737,"about_ca_system_score_gemma":0.000289485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004734768,"about_ca_topic_score_gemma":0.000005809879,"domain_scores_codex":[0.9982432,0.00003994437,0.0007384761,0.0002113115,0.0004565633,0.0003104634],"domain_scores_gemma":[0.9972026,0.000366914,0.001123592,0.0001844428,0.001003811,0.0001186797],"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.0001277783,0.0001967623,0.0008899049,0.001297685,0.0001067562,0.00008589691,0.008205066,0.006102946,0.2580374,0.008739293,0.001758492,0.7144521],"study_design_scores_gemma":[0.0008798187,0.0007730626,0.0001078224,0.002474557,0.00007342366,0.004653492,0.0008335193,0.9465335,0.03260461,0.009105182,0.00132862,0.0006324003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0347483,0.0004531043,0.9622,0.0001409623,0.00196456,0.000201309,7.283142e-7,0.0001535279,0.0001374641],"genre_scores_gemma":[0.896246,6.549783e-7,0.1028062,0.00002459655,0.0008461612,0.00001151164,1.505265e-7,0.00002214901,0.00004255032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9404305,"threshold_uncertainty_score":0.7522773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975528831","doi":"10.1007/s11265-013-0854-z","title":"Clockless Stochastic Decoding of Low-Density Parity-Check Codes: Architecture and Simulation Model","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Decoding methods; Computer science; Computation; Low-density parity-check code; Stochastic computing; Synchronization (alternating current); Algorithm; CMOS; Parallel computing; Theoretical computer science; Computer engineering; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02056301322011973,"gpt":0.2714206369399246,"spread":0.2508576237198049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694826,0.0001731581,0.0004473352,0.0002638024,0.0001425988,0.0003069379,0.0004840768,0.0001121721,6.995184e-7],"category_scores_gemma":[0.0001252611,0.0001424253,0.00007197683,0.0002543274,0.00006373328,0.0008376015,0.0001109361,0.0003929043,7.402265e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007110383,"about_ca_system_score_gemma":0.0001766199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003844368,"about_ca_topic_score_gemma":0.000002429649,"domain_scores_codex":[0.9981727,0.0001107649,0.0007609549,0.0002137002,0.0005287677,0.0002131139],"domain_scores_gemma":[0.9973342,0.0002700801,0.001197095,0.0001766041,0.0009026669,0.0001193968],"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.00001987272,0.00005184695,0.0006090292,0.0006080533,0.00002172206,0.000006048435,0.002368355,0.9512416,0.02476059,0.0001550832,0.00003387669,0.02012393],"study_design_scores_gemma":[0.000189993,0.0001098694,0.0002010392,0.001592461,0.00001741844,0.0001988228,0.0001627544,0.9914958,0.002025607,0.003860989,8.526885e-7,0.0001443403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3316837,0.0004035069,0.667566,0.00004544831,0.00008906007,0.0001366604,3.661376e-7,0.00005194652,0.000023317],"genre_scores_gemma":[0.9588829,0.000002247022,0.0409582,0.00002402925,0.00009991406,0.000003386302,1.529813e-7,0.00001398736,0.00001517618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6271992,"threshold_uncertainty_score":0.5807936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3103043697","doi":"10.1007/s11265-016-1157-y","title":"Low-Latency Software Polar Decoders","year":2016,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Memory footprint; Software; Rendering (computer graphics); Exploit; Polar; Encoding (memory); Latency (audio); Efficient energy use","retraction":null,"screen_n_in":null,"score":{"opus":0.01574898870569315,"gpt":0.2521758610143998,"spread":0.2364268723087067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338791,0.0001923659,0.0003612138,0.0003207012,0.0001613301,0.0003211555,0.001279637,0.0001127678,0.000005788925],"category_scores_gemma":[0.0001958884,0.0001189811,0.0001370787,0.0003796578,0.00005340882,0.001767807,0.0001026977,0.0002515456,0.00001862167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000182644,"about_ca_system_score_gemma":0.0004035686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001453487,"about_ca_topic_score_gemma":0.000001212863,"domain_scores_codex":[0.9977746,0.0001325379,0.0008093778,0.0002472763,0.0006927603,0.0003434599],"domain_scores_gemma":[0.9974635,0.0002014602,0.001129222,0.0002674678,0.0007698886,0.0001684763],"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.00007341214,0.0002766313,0.01489191,0.0007767098,0.000117476,0.0005361116,0.002472282,0.0003028669,0.1164315,0.001047781,0.00754346,0.8555298],"study_design_scores_gemma":[0.01509111,0.01253118,0.01062933,0.1402171,0.0006078503,0.05435027,0.003294687,0.1415108,0.4881167,0.08338312,0.03956119,0.0107066],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01800421,0.001771073,0.9784966,0.0004213593,0.0007463346,0.00009341413,8.507798e-7,0.0002835214,0.0001826305],"genre_scores_gemma":[0.9582712,0.00001755818,0.0410899,0.00006843691,0.0003145116,0.000002952826,5.814027e-8,0.00002312408,0.0002122344],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.940267,"threshold_uncertainty_score":0.4851906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043724059","doi":"10.1007/s11265-008-0266-7","title":"A Test-oriented Embedded System Production Methodology","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BP (Canada); University of Alberta; University of Calgary","funders":"","keywords":"Agile software development; Computer science; Domain (mathematical analysis); Software engineering; Extreme programming; New product development; Embedded system; Human–computer interaction; Software development; Software; Operating system; Software development process","retraction":null,"screen_n_in":null,"score":{"opus":0.07046605689061651,"gpt":0.2989667409933983,"spread":0.2285006841027817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004561453,0.0003079293,0.0008942008,0.0006624127,0.000354756,0.0001865595,0.001148821,0.0002177098,0.000001393563],"category_scores_gemma":[0.0004421693,0.0002454593,0.0001906173,0.001067588,0.0001191629,0.001644515,0.00009538291,0.0004893857,0.000014557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003762519,"about_ca_system_score_gemma":0.000627531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002685843,"about_ca_topic_score_gemma":4.451566e-7,"domain_scores_codex":[0.9952539,0.001020536,0.001732931,0.0004556114,0.001097206,0.0004398775],"domain_scores_gemma":[0.9946012,0.000409979,0.002451922,0.0004800955,0.001846915,0.0002099028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"case_report","study_design_scores_codex":[0.0004524385,0.001539093,0.01068604,0.01021338,0.0007010058,0.006297834,0.03897832,0.005802297,0.806659,0.03105534,0.05186726,0.03574792],"study_design_scores_gemma":[0.004277083,0.006346416,0.001092292,0.01858812,0.000347848,0.3849421,0.008613052,0.3167866,0.239132,0.001590116,0.01505944,0.003224968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01520623,0.002748128,0.9787217,0.0001645291,0.001630232,0.0004144425,8.527684e-7,0.0004788978,0.0006350257],"genre_scores_gemma":[0.8764697,0.00001512175,0.1220591,0.0000297703,0.0009787289,0.00002439322,3.232024e-7,0.00003090066,0.0003919529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8612635,"threshold_uncertainty_score":0.9999998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979231468","doi":"10.1007/s11265-012-0722-2","title":"Rotation Invariance in 2D-FRFT with Application to Digital Image Watermarking","year":2012,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digital watermarking; Artificial intelligence; Computer vision; Rotation (mathematics); Image (mathematics); Computer science; Digital image; Mathematics; Pattern recognition (psychology); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01437300640706733,"gpt":0.2672975173131321,"spread":0.2529245109060647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706244,0.0001365872,0.0002618325,0.0002845608,0.00009184326,0.0008745948,0.000471928,0.00004716158,7.626297e-7],"category_scores_gemma":[0.00004048698,0.0001004853,0.00003599603,0.0005944082,0.00002226956,0.004464502,0.00004799096,0.0002037009,0.00001283892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001145136,"about_ca_system_score_gemma":0.0001195147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001225139,"about_ca_topic_score_gemma":4.747837e-7,"domain_scores_codex":[0.9983372,0.0001238079,0.0005665526,0.0001627317,0.0005014314,0.0003082438],"domain_scores_gemma":[0.9987425,0.00008227193,0.0005283234,0.0001423249,0.0003552595,0.0001492989],"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.0004705569,0.0004525503,0.02522037,0.0007739135,0.00005452548,0.0002037424,0.0158363,0.01212218,0.2611399,0.0009701165,0.000323093,0.6824328],"study_design_scores_gemma":[0.01448863,0.003567683,0.07796999,0.01914589,0.0002131171,0.01527677,0.004300199,0.6716921,0.1671338,0.005874363,0.01564193,0.004695537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0409623,0.0004753024,0.9574856,0.0001630223,0.0001587822,0.0001647759,3.792318e-7,0.00002201979,0.000567871],"genre_scores_gemma":[0.9442971,0.000001085102,0.05518327,0.00008007793,0.0003631317,0.000009532414,5.187906e-7,0.00001305658,0.00005226125],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033347,"threshold_uncertainty_score":0.8433738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103372247","doi":"10.1007/s11265-008-0290-7","title":"A New Learning Algorithm for the Fusion of Adaptive Audio–Visual Features for the Retrieval and Classification of Movie Clips","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Support vector machine; Pattern recognition (psychology); Search engine indexing; Feature (linguistics); CLIPS; Feature extraction; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.04558453011064346,"gpt":0.2844070727180484,"spread":0.238822542607405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552364,0.0001308041,0.0003450165,0.0000981794,0.0005756592,0.0001320573,0.0004603838,0.00008103779,6.816711e-7],"category_scores_gemma":[0.000140078,0.00007042324,0.0001262203,0.0003083639,0.0001300094,0.0004768632,0.00005111117,0.0002532307,9.051248e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003117093,"about_ca_system_score_gemma":0.000538834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001238074,"about_ca_topic_score_gemma":4.594681e-7,"domain_scores_codex":[0.9984057,0.00008079796,0.0006610202,0.0001689463,0.0005113002,0.0001722295],"domain_scores_gemma":[0.9962751,0.0008659957,0.00186023,0.0001007937,0.0008372936,0.00006058826],"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.0003864906,0.00005164411,0.0001343066,0.0004644791,0.000109553,0.000002650161,0.005258486,0.002116017,0.02455691,0.0004408977,0.002206221,0.9642724],"study_design_scores_gemma":[0.001214923,0.000949718,0.002894988,0.00121604,0.0001174744,0.0004596854,0.002156826,0.9830179,0.005489706,0.0004246152,0.001903618,0.0001545144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005313788,0.01430915,0.9792441,0.0005426017,0.0002354558,0.0003163554,0.000001795274,0.000009855296,0.00002689606],"genre_scores_gemma":[0.9675196,0.0001245626,0.03141179,0.00003550534,0.0006239822,0.000005041072,3.815485e-7,0.00001191107,0.0002672532],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9809019,"threshold_uncertainty_score":0.4427563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014624009","doi":"10.1007/s11265-013-0811-x","title":"Self-Adapting Resource Escalation for Resilient Signal Processing Architectures","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Control reconfiguration; Computer science; Latency (audio); Redundancy (engineering); Real-time computing; Encoder; Benchmark (surveying); Throughput; Embedded system; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01582267861742095,"gpt":0.2401296982736983,"spread":0.2243070196562774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002099929,0.0002687068,0.0005087543,0.0003665175,0.0005427317,0.001607725,0.0007646226,0.0001542809,0.000005848489],"category_scores_gemma":[0.00003935127,0.0002030563,0.0002075658,0.0004402225,0.00003643082,0.0010395,0.00006587587,0.000400217,0.000006489786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001812701,"about_ca_system_score_gemma":0.00028644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002265042,"about_ca_topic_score_gemma":0.000001375171,"domain_scores_codex":[0.9966704,0.0002589659,0.001415547,0.0003591711,0.000815775,0.0004801793],"domain_scores_gemma":[0.9962429,0.0002674063,0.001837833,0.0001777978,0.00127428,0.0001998257],"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.0002126558,0.0003772255,0.0007747527,0.003974315,0.0002293406,0.00004271745,0.0134539,0.2779384,0.01533968,0.00219937,0.01060471,0.6748529],"study_design_scores_gemma":[0.0005595473,0.000424632,0.0001020796,0.002025247,0.00002630162,0.0006899257,0.0008516063,0.98533,0.0005274096,0.0006604518,0.008525276,0.0002775361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837827,0.003132637,0.9760919,0.0003820989,0.0004406817,0.000595814,6.640404e-7,0.0001313717,0.0008465181],"genre_scores_gemma":[0.9756855,0.000001851862,0.02195575,0.0001002689,0.001927959,0.00004235257,7.050793e-7,0.000031548,0.0002541175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9573072,"threshold_uncertainty_score":0.9994287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041025829","doi":"10.1007/s11265-013-0791-x","title":"Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada); Terry Fox Research Institute","funders":"","keywords":"Polynomial basis; Parameterized complexity; Finite field; Multiplier (economics); Multiplication (music); Mathematics; Primitive polynomial; Polynomial; Irreducible polynomial; Galois theory; Computer science; Architecture; Arithmetic; GF(2); Discrete mathematics; Algorithm; Combinatorics; Matrix polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.01056677226794983,"gpt":0.2482092481803203,"spread":0.2376424759123704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005416232,0.0001163234,0.0002525039,0.0002817489,0.0001006691,0.0002767032,0.0002903738,0.0000560858,0.00001526719],"category_scores_gemma":[0.000007028868,0.00008222861,0.00007502765,0.0002587681,0.00006106809,0.0005013975,0.00004571576,0.0001573848,0.000001155026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002133436,"about_ca_system_score_gemma":0.0001149129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001198938,"about_ca_topic_score_gemma":0.000001107848,"domain_scores_codex":[0.9986617,0.000126517,0.0005374125,0.0001382212,0.0003651532,0.0001710167],"domain_scores_gemma":[0.9987864,0.0001194588,0.0006586721,0.0000936339,0.0002442803,0.00009748442],"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.0001158097,0.0002143122,0.01082925,0.001094403,0.0003016105,0.00004329147,0.01569294,0.009656301,0.1745086,0.0002836394,0.002988191,0.7842716],"study_design_scores_gemma":[0.0204165,0.006810449,0.2571252,0.007144216,0.0006770374,0.006476396,0.01447815,0.5150911,0.1559329,0.009384525,0.003502388,0.002961152],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.187024,0.001761997,0.8106039,0.0002375181,0.0001316655,0.0002115084,6.325227e-7,0.00001052129,0.00001825408],"genre_scores_gemma":[0.9575675,0.00001134856,0.04223209,0.00003327124,0.0001339306,0.000005456963,1.156814e-7,0.00000719094,0.000009083165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7813105,"threshold_uncertainty_score":0.3353185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067412888","doi":"10.1007/s11265-014-0898-8","title":"Two Fast and Robust Modified Gaussian Mixture Models Incorporating Local Spatial Information for Image Segmentation","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Robustness (evolution); Mixture model; Artificial intelligence; Pattern recognition (psychology); Pixel; Image segmentation; Computer science; Mathematics; Segmentation; Gaussian; Spatial analysis; Gaussian noise; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01903520241589814,"gpt":0.250775791999037,"spread":0.2317405895831389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055878,0.0001274717,0.0002248083,0.0001750884,0.0002017484,0.000796641,0.0002704597,0.00006901605,3.343717e-7],"category_scores_gemma":[0.00002728738,0.00009946332,0.00004888879,0.0001792206,0.00005407052,0.003836651,0.00003363081,0.0001545955,6.511102e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007041491,"about_ca_system_score_gemma":0.0001272615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002625072,"about_ca_topic_score_gemma":9.995962e-7,"domain_scores_codex":[0.9985851,0.00008097755,0.0006869333,0.0001208221,0.0003857299,0.0001404188],"domain_scores_gemma":[0.9978532,0.00005493776,0.001198293,0.00008837563,0.0007187259,0.00008643182],"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.00007649423,0.00004322376,0.00001927707,0.0007506934,0.00001965288,0.000002339628,0.00140585,0.03196089,0.02230009,0.01398911,0.0001366066,0.9292958],"study_design_scores_gemma":[0.0005864156,0.0001870747,0.00001326255,0.0002732157,0.00001304462,0.0001195906,0.0003065396,0.9850461,0.009200643,0.004081155,0.00005338064,0.0001195555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004521111,0.0001411305,0.9984806,0.0002426738,0.0001146197,0.0002224022,0.000002265457,0.00005089616,0.0002932726],"genre_scores_gemma":[0.882519,0.000002816259,0.1171887,0.0000571581,0.0001973106,0.00001070385,0.0000038969,0.000006694997,0.00001370209],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9530852,"threshold_uncertainty_score":0.7682028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064553809","doi":"10.1007/s11265-011-0630-x","title":"A Filter Bank Based Approach for Rotation Invariant Fingerprint Recognition","year":2011,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Principal component analysis; Thresholding; Gabor filter; Computer science; Fingerprint (computing); Linear discriminant analysis; Dimensionality reduction; Filter bank; Filter (signal processing); Computer vision; Invariant (physics); Curse of dimensionality; Feature extraction; Mathematics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.1045631969782427,"gpt":0.2586738773583835,"spread":0.1541106803801408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001698252,0.00009505094,0.0001907101,0.0004615992,0.0001257565,0.0003580131,0.0004201418,0.00007561976,0.000009831136],"category_scores_gemma":[0.00007812541,0.00007724588,0.00009498209,0.0005711812,0.00002186475,0.0007632343,0.00001852379,0.000131168,0.000004582344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000628088,"about_ca_system_score_gemma":0.0002184282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001502925,"about_ca_topic_score_gemma":2.122011e-7,"domain_scores_codex":[0.9986147,0.0001049992,0.0006029301,0.000177094,0.0003551795,0.0001450526],"domain_scores_gemma":[0.9980282,0.00006581304,0.0008522645,0.000120145,0.0008498881,0.00008373732],"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.0006773935,0.002899122,0.001052483,0.005012689,0.0002581786,0.00006184195,0.01962731,0.00217787,0.03048539,0.006942323,0.006304981,0.9245004],"study_design_scores_gemma":[0.0009494571,0.0002691158,0.0007086438,0.0003374167,0.00003453236,0.000157639,0.0002782388,0.9888946,0.005878283,0.001484469,0.0007847557,0.0002228836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001812161,0.0002822317,0.9968415,0.00007119282,0.0002899154,0.0002197803,0.000002876482,0.00002631728,0.0004540519],"genre_scores_gemma":[0.8304447,0.000001457072,0.1692793,0.00007445398,0.0001369835,0.0000196077,0.000004081608,0.000006427136,0.0000330183],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9867167,"threshold_uncertainty_score":0.3452328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991931032","doi":"10.1007/s11265-008-0230-6","title":"High Acceleration for Video Processing Applications Using Specialized Instruction Set Based on Parallelism and Data Reuse","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Parallel computing; Reuse; Acceleration; Cache; Leverage (statistics); Computation; Embedding; Block (permutation group theory); Frame rate; Set (abstract data type); Key (lock); Computer engineering; Matching (statistics); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1299940746679136,"gpt":0.327400257089322,"spread":0.1974061824214084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006715752,0.0001641512,0.0003279757,0.0003214975,0.0007147895,0.0005487181,0.00167794,0.0001001575,6.817103e-7],"category_scores_gemma":[0.0001515664,0.0001322414,0.00004104366,0.0003855771,0.00007536526,0.001580574,0.0002363518,0.0002202594,4.464335e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000757076,"about_ca_system_score_gemma":0.0003697333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001154541,"about_ca_topic_score_gemma":3.485931e-7,"domain_scores_codex":[0.9982659,0.00006989529,0.0006644041,0.0003581969,0.000455896,0.0001857626],"domain_scores_gemma":[0.9975943,0.00009867379,0.001080505,0.0006890139,0.000466562,0.00007096715],"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.0008082029,0.0005782311,0.001196793,0.002511497,0.0001158984,0.00009571316,0.002151449,0.1480823,0.04849421,0.004361916,0.01101105,0.7805928],"study_design_scores_gemma":[0.001316701,0.0001811508,0.00009095688,0.0009344844,0.00002774339,0.0005341051,0.000144958,0.9885103,0.002269858,0.002557741,0.00322098,0.0002110151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04505154,0.001038566,0.9526917,0.0005619302,0.000214336,0.000301549,0.000006013738,0.0001191671,0.00001521239],"genre_scores_gemma":[0.8675652,0.00002289888,0.1318587,0.00006685065,0.0004378172,0.00002078915,0.000004282663,0.00001267022,0.00001077109],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8404281,"threshold_uncertainty_score":0.5497655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025967251","doi":"10.1007/s11265-014-0886-z","title":"Algorithm and Architecture of Fully-Parallel Associative Memories Based on Sparse Clustered Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Associative property; Field-programmable gate array; Content-addressable memory; Parallel computing; Artificial neural network; Architecture; Content-addressable storage; Computer architecture; Computer hardware; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.00867406844215649,"gpt":0.2171119082575264,"spread":0.2084378398153699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531416,0.0002012031,0.0005097116,0.0002117959,0.0001913354,0.0003695604,0.0004246746,0.000131512,9.468562e-7],"category_scores_gemma":[0.00007429632,0.0001528941,0.00007929221,0.000417253,0.00008726765,0.0004354193,0.00004533745,0.000356473,3.694439e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005200933,"about_ca_system_score_gemma":0.0001753422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003106187,"about_ca_topic_score_gemma":6.141673e-7,"domain_scores_codex":[0.9979282,0.0003108065,0.0006821459,0.0002266728,0.0006018049,0.0002503975],"domain_scores_gemma":[0.9971921,0.0003062008,0.001616939,0.0001484801,0.0006111728,0.0001250496],"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.00005972738,0.00005807069,0.0002094299,0.0001640286,0.00002813796,0.000006636326,0.0007201289,0.7799441,0.00002994318,0.00009057944,0.0001738169,0.2185155],"study_design_scores_gemma":[0.0008041671,0.0004997033,0.0001260044,0.001282249,0.0000286589,0.00006656098,0.00008674843,0.9959822,0.0000815035,0.0006844655,0.0001976573,0.000160025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007992397,0.00134613,0.9968026,0.0002610691,0.0003505832,0.00009358681,0.000001007777,0.00003050833,0.0003152656],"genre_scores_gemma":[0.8356965,0.00001277872,0.163485,0.0001346358,0.0005841462,0.000002357149,0.000001203469,0.00001608502,0.00006726923],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8348972,"threshold_uncertainty_score":0.6234841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983257031","doi":"10.1007/s11265-010-0525-2","title":"Interpolation-Free Fractional-Pixel Motion Estimation Algorithms with Efficient Hardware Implementation","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; IntelliView Technologies (Canada)","funders":"","keywords":"Algorithm; Computer science; Interpolation (computer graphics); Pixel; Block (permutation group theory); Hardware architecture; Motion estimation; Matching (statistics); Gate count; Software; Artificial intelligence; Computer hardware; Mathematics; Motion (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01224575015808283,"gpt":0.3032052656120817,"spread":0.2909595154539989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007213636,0.0001212383,0.0001661841,0.0002757382,0.0003260575,0.0004148479,0.0004540236,0.00003114474,0.00004579893],"category_scores_gemma":[0.00003812746,0.00009407865,0.00004767243,0.0003370145,0.00002719812,0.001746806,0.00006240915,0.0003822169,0.000003401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009296271,"about_ca_system_score_gemma":0.0001843593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009838126,"about_ca_topic_score_gemma":0.000001407424,"domain_scores_codex":[0.9982573,0.00005747631,0.0005451684,0.0001775612,0.0008074512,0.0001550816],"domain_scores_gemma":[0.9980159,0.00006080326,0.001055948,0.0001718502,0.000607283,0.00008822245],"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.00005059087,0.000162175,0.001031163,0.0001084752,0.00003279043,0.00001965018,0.001653956,0.12093,0.02747841,0.001421893,0.000465023,0.8466459],"study_design_scores_gemma":[0.00067923,0.0001446298,0.0008285549,0.0001390302,0.00001163152,0.0006070501,0.0007293181,0.9947353,0.0005298509,0.0003325178,0.001142246,0.0001206325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007910053,0.0001247314,0.9905856,0.0003961797,0.0007180827,0.0001294259,0.000002119024,0.00004126655,0.00009252876],"genre_scores_gemma":[0.8181037,9.074762e-7,0.1816117,0.00004412799,0.000190581,0.000005931648,0.000003102263,0.00001006744,0.00002979764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8738053,"threshold_uncertainty_score":0.4000388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947592526","doi":"10.1007/s11265-019-01453-w","title":"POLYBiNN: Binary Inference Engine for Neural Networks using Decision Trees","year":2019,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; MNIST database; Convolutional neural network; Field-programmable gate array; Inference; Artificial intelligence; Machine learning; Artificial neural network; Inference engine; Deep learning; Computer engineering; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.02894082419403868,"gpt":0.300909515127282,"spread":0.2719686909332433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004859389,0.0001887447,0.0003835365,0.0002017255,0.0002802547,0.0002607206,0.0008723286,0.0000865286,0.000001967614],"category_scores_gemma":[0.00003070053,0.0001494789,0.0001199553,0.0006183321,0.00002899977,0.001427727,0.0001403231,0.000279415,0.000002016158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009095026,"about_ca_system_score_gemma":0.0001142262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002670877,"about_ca_topic_score_gemma":3.10822e-7,"domain_scores_codex":[0.9981893,0.00004917433,0.0007569357,0.000264616,0.0004101883,0.0003297754],"domain_scores_gemma":[0.9976654,0.0005047229,0.0009575229,0.0002522398,0.0004862781,0.0001338382],"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.00004235597,0.00003151617,0.0006681921,0.00004838448,0.000010471,0.000007272581,0.00007976223,0.9359601,0.005067622,0.000366899,0.00006303944,0.0576544],"study_design_scores_gemma":[0.0004611941,0.0002704774,0.0002585735,0.0005084003,0.00001428472,0.0002796685,0.0000322823,0.9969689,0.0001247546,0.0005489984,0.0003638642,0.0001685567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1566517,0.002897484,0.8394387,0.00008839358,0.000597383,0.0002745405,7.246227e-7,0.0000394836,0.00001159888],"genre_scores_gemma":[0.9545975,0.00001383331,0.04467026,0.00006248836,0.0005876967,0.000007387151,5.597211e-7,0.00002031993,0.00003995403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7979458,"threshold_uncertainty_score":0.6095574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008272790","doi":"10.1007/s11265-014-0894-z","title":"Design and Implementation of a Power-aware FFT Core for OFDM-based DSA-enabled Cognitive Radios","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fast Fourier transform; Overhead (engineering); Computer science; Pruning; Node (physics); Cognitive radio; Orthogonal frequency-division multiplexing; Embedded system; Algorithm; Telecommunications; Engineering; Wireless; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02402322601779646,"gpt":0.2834458679348129,"spread":0.2594226419170165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001664747,0.0001668201,0.0004604767,0.0002225715,0.0001819785,0.0002563595,0.0002032961,0.00006167701,0.000003014211],"category_scores_gemma":[0.0000494137,0.0001381993,0.00009173915,0.000263015,0.00005635493,0.0004894361,0.00002082137,0.0001359888,2.352771e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005619335,"about_ca_system_score_gemma":0.0003196564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009669851,"about_ca_topic_score_gemma":0.000001348699,"domain_scores_codex":[0.9982625,0.0001837803,0.0006991526,0.0002143536,0.0003842366,0.0002559791],"domain_scores_gemma":[0.9968567,0.0007191637,0.001196023,0.00007646839,0.001039809,0.0001118723],"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.001848914,0.0004704344,0.004301521,0.003813007,0.0007046152,0.000141305,0.01067486,0.02091583,0.08913669,0.003692791,0.001575806,0.8627242],"study_design_scores_gemma":[0.003260164,0.001674091,0.0005080035,0.001984823,0.00009560609,0.0002873335,0.001089191,0.9843484,0.00587999,0.0005702865,0.00007985505,0.0002223147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03998309,0.0008925757,0.9583657,0.0001144641,0.0001604281,0.0004303727,0.000002781747,0.00001710119,0.00003343193],"genre_scores_gemma":[0.9848467,0.000005780725,0.01483262,0.00008266601,0.0002029743,0.000006190774,0.000001304353,0.00001600985,0.000005724673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9634325,"threshold_uncertainty_score":0.5635604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2744617995","doi":"10.1007/s11265-017-1270-6","title":"Efficient Computation of the 8-point DCT via Summation by Parts","year":2017,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Virtual Materials Group (Canada); University of Calgary","funders":"","keywords":"Discrete cosine transform; Computation; Multiplicative function; SIGNAL (programming language); Matrix (chemical analysis); Transformation matrix; Transformation (genetics); Computational complexity theory; Harmonic","retraction":null,"screen_n_in":null,"score":{"opus":0.02877108645130621,"gpt":0.2812319284293984,"spread":0.2524608419780922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865704,0.00008488966,0.0001737263,0.00006385415,0.0002744836,0.0007897033,0.0006804902,0.00002699645,8.032296e-7],"category_scores_gemma":[0.0000279509,0.00005539275,0.00007279775,0.00009238847,0.00004944987,0.0009179989,0.0000667016,0.00008076469,0.000001942851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005277142,"about_ca_system_score_gemma":0.00009782315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001463146,"about_ca_topic_score_gemma":3.729604e-7,"domain_scores_codex":[0.9985263,0.00008190516,0.0006104545,0.0001010905,0.000563113,0.0001170737],"domain_scores_gemma":[0.9973494,0.00003096221,0.001999801,0.0001713745,0.0004011392,0.00004732898],"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.0001025435,0.0006204477,0.004512863,0.001355707,0.000152073,0.00002041509,0.007619589,0.1037089,0.2042437,0.003065528,0.01258236,0.6620159],"study_design_scores_gemma":[0.0007874261,0.000280058,0.003404455,0.001177242,0.00002406926,0.0001645,0.0001816591,0.97043,0.02171008,0.001293592,0.0003860969,0.0001608526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05967735,0.000267613,0.9386815,0.0003234809,0.0005072152,0.0001359763,0.000001729099,0.000008840367,0.0003962659],"genre_scores_gemma":[0.9990103,8.244081e-7,0.0008397041,0.00002440685,0.00007742061,0.000001494032,5.51949e-7,0.000005032145,0.00004028742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.939333,"threshold_uncertainty_score":0.7615128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4207078582","doi":"10.1007/s11265-021-01731-6","title":"Convolutional Fully-Connected Capsule Network (CFC-CapsNet): A Novel and Fast Capsule Network","year":2022,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Capsule; Convolutional neural network; Computer science; Artificial intelligence; Pattern recognition (psychology); Computer vision; Biology; Botany","retraction":null,"screen_n_in":null,"score":{"opus":0.01686474437523127,"gpt":0.2339002047921497,"spread":0.2170354604169184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001157942,0.0002790964,0.0005278459,0.0001377927,0.001301141,0.0003504881,0.00102835,0.00007610332,0.00002086926],"category_scores_gemma":[0.00002510137,0.0002629437,0.0001138641,0.001333456,0.0001193861,0.0008200003,0.0004354227,0.0007639225,0.000004315837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002264411,"about_ca_system_score_gemma":0.0004235572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001461274,"about_ca_topic_score_gemma":0.000002251108,"domain_scores_codex":[0.9967504,0.0002067528,0.001040061,0.0004510726,0.0009133436,0.0006383601],"domain_scores_gemma":[0.9973531,0.0001713326,0.001451432,0.0002806333,0.0004678171,0.0002756753],"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.00004592293,0.0001487018,0.0002739661,0.00008690919,0.00008267778,0.00005755032,0.000399817,0.9571065,0.009781701,0.0129308,0.0117398,0.007345629],"study_design_scores_gemma":[0.001767523,0.0005417563,0.00123009,0.0004179883,0.00006746894,0.005291636,0.0003458966,0.9571659,0.0001077189,0.005612784,0.02680365,0.0006476161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01899388,0.01338036,0.9649271,0.0007921067,0.001074384,0.0003990977,0.00001407769,0.0001197167,0.0002992377],"genre_scores_gemma":[0.9760301,0.00002357137,0.02120373,0.0003396322,0.002060374,0.00006126147,0.000005587684,0.00003295107,0.0002428273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9570362,"threshold_uncertainty_score":0.999999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997564856","doi":"10.1007/s11265-011-0635-5","title":"An Efficient Block Entropy Based Compression Scheme for Systems-on-a-Chip Test Data","year":2011,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Positive Living North; University of Northern British Columbia","funders":"","keywords":"Computer science; Very-large-scale integration; Data compression; Test vector; Chip; Compression ratio; Entropy (arrow of time); Scheme (mathematics); Test data; Algorithm; Block (permutation group theory); Computer engineering; Embedded system; Mathematics; Artificial intelligence; Engineering; Test set","retraction":null,"screen_n_in":null,"score":{"opus":0.09692173878471042,"gpt":0.2912436106994541,"spread":0.1943218719147437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077508,0.0002517044,0.0004859725,0.0002743147,0.0003920552,0.0006703183,0.002424949,0.00009981049,0.000001783796],"category_scores_gemma":[0.0001896291,0.0001869056,0.00009077874,0.000323876,0.00004665344,0.0008106981,0.00009521867,0.0003033637,0.00000577034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007503818,"about_ca_system_score_gemma":0.0004124722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002166271,"about_ca_topic_score_gemma":2.31774e-7,"domain_scores_codex":[0.9971651,0.0001614567,0.0009989381,0.0004644088,0.0007898007,0.0004203265],"domain_scores_gemma":[0.9964865,0.0004098331,0.001418351,0.0006792903,0.0007166119,0.0002893469],"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.0002240862,0.01088515,0.03776583,0.01134377,0.0004231578,0.001192148,0.007538605,0.410926,0.4002617,0.008530484,0.008441591,0.1024675],"study_design_scores_gemma":[0.000841125,0.0007913694,0.0001926637,0.002961528,0.00003039273,0.0003098976,0.0002117626,0.9929836,0.001099368,0.00002828102,0.0003090849,0.0002408979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03129972,0.001507611,0.9655802,0.00004951656,0.0008298142,0.0003560544,0.00002142472,0.0001134163,0.0002422104],"genre_scores_gemma":[0.9912603,9.667474e-7,0.007872013,0.00006127863,0.0007499568,0.000007313845,0.000004986212,0.00002596553,0.00001722208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9599606,"threshold_uncertainty_score":0.7621791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967444872","doi":"10.1007/s11265-013-0795-6","title":"Area Efficient Sequential Decimal Fixed-point Multiplier","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Adder; Decimal; Arithmetic; Multiplier (economics); Operand; Computer science; Computation; Mathematics; Parallel computing; Algorithm; Latency (audio); Computer hardware; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02584134055562441,"gpt":0.2712819439382788,"spread":0.2454406033826544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142651,0.0001965946,0.0004338508,0.0001814575,0.0001785997,0.0008775091,0.0008238954,0.00008109731,0.00003116468],"category_scores_gemma":[0.00006853703,0.0001336352,0.0001684472,0.000392409,0.00006392082,0.0007888461,0.0001256403,0.000345922,0.0000427771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009845155,"about_ca_system_score_gemma":0.0001921581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002986783,"about_ca_topic_score_gemma":7.121337e-8,"domain_scores_codex":[0.9975325,0.0001838148,0.0008744617,0.0002539144,0.0007768446,0.0003784046],"domain_scores_gemma":[0.9978248,0.0001592746,0.000846991,0.0001891501,0.0007002244,0.000279543],"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.00004339306,0.0005837666,0.0005286738,0.0003606562,0.000130262,0.0002960452,0.001757985,0.0392755,0.1004424,0.001116915,0.002584666,0.8528798],"study_design_scores_gemma":[0.0006663008,0.0003074289,0.0004032731,0.0005825042,0.00001923694,0.0009096768,0.0002510583,0.9915099,0.002939959,0.0009157397,0.001204393,0.0002904985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02569491,0.001179046,0.971261,0.0003280831,0.0009946368,0.0001623813,6.46778e-7,0.00004185753,0.0003373936],"genre_scores_gemma":[0.8273774,0.000002781772,0.1718626,0.00008107989,0.0005481354,0.000007538378,1.200736e-7,0.00001318263,0.0001072107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9522344,"threshold_uncertainty_score":0.8461841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3210268934","doi":"10.1007/s11265-021-01707-6","title":"Bilateral Filters with Adaptive Generalized Kernels Generated via Riemann-Lebesgue Theorem","year":2021,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Bilateral filter; Upsampling; Gaussian; Lebesgue integration; Adaptive filter; Filter (signal processing); Artificial intelligence; JPEG; Noise reduction; Pattern recognition (psychology); Algorithm; Computer vision; Computer science; Pixel; Image (mathematics); Pure mathematics; Data compression","retraction":null,"screen_n_in":null,"score":{"opus":0.02525561520820731,"gpt":0.2605640449131329,"spread":0.2353084297049256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001626051,0.0003256704,0.000700318,0.0002450902,0.0002803461,0.001137815,0.0007882658,0.0001243853,0.00001833127],"category_scores_gemma":[0.00003417262,0.0002241154,0.0001765488,0.0008909306,0.0001029838,0.001482743,0.00009831629,0.0004416559,0.000008139718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001204889,"about_ca_system_score_gemma":0.0007844899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002734888,"about_ca_topic_score_gemma":0.000001299766,"domain_scores_codex":[0.9964405,0.0008398033,0.0009333518,0.0004158916,0.0009142616,0.0004561914],"domain_scores_gemma":[0.9964975,0.0001344562,0.001006658,0.0003084456,0.001816927,0.000236017],"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.001738075,0.0006276622,0.0005700435,0.0007196639,0.001090893,0.0162019,0.007944863,0.08427569,0.737526,0.004444367,0.003098907,0.1417619],"study_design_scores_gemma":[0.007152126,0.00185914,0.0003027943,0.003473219,0.0002597669,0.02412572,0.0005966001,0.6571279,0.2966921,0.005128809,0.001863145,0.001418747],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03583708,0.004011495,0.9586743,0.0002445167,0.0005820328,0.000115004,0.000001919185,0.00005902063,0.0004746212],"genre_scores_gemma":[0.8909025,0.00001406361,0.107248,0.0003130334,0.0006314392,0.000004745137,0.000001878272,0.0000345662,0.000849782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8550654,"threshold_uncertainty_score":0.9998991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198896842","doi":"10.1007/s11265-022-01752-9","title":"Online Dynamic Window (ODW) Assisted Two-Stage LSTM Frameworks For Indoor Localization","year":2022,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inertial measurement unit; Context (archaeology); Artificial intelligence; Window (computing); Heading (navigation); Field (mathematics); Sliding window protocol; Real-time computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01358725443114948,"gpt":0.2600478559222237,"spread":0.2464606014910743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887242,0.0002158202,0.0004322993,0.0004163337,0.0003621153,0.0001602586,0.0003816973,0.0002078191,0.00003443137],"category_scores_gemma":[0.00007301839,0.0002016154,0.0001358525,0.000607008,0.00004719351,0.0003109041,0.00004435819,0.0008589866,0.000001166041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004080247,"about_ca_system_score_gemma":0.0001332115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005390967,"about_ca_topic_score_gemma":0.000003292891,"domain_scores_codex":[0.9980345,0.00006845497,0.0009111698,0.0001533166,0.0005307362,0.0003018033],"domain_scores_gemma":[0.9987544,0.00009214329,0.0005649341,0.0001309386,0.0003871173,0.00007045867],"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.0000673071,0.0001003264,0.0003507525,0.0006469,0.00007967205,0.00002665897,0.0002973299,0.9752418,0.004861511,0.0002157331,0.0005322709,0.01757968],"study_design_scores_gemma":[0.001252314,0.0002343432,0.00009444437,0.000370066,0.00006314639,0.0001979763,0.002977462,0.9826193,0.001165609,0.000210587,0.01053774,0.0002770042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02624486,0.003794077,0.9680879,0.00008946511,0.0009761683,0.0003383885,0.00007174628,0.0002611184,0.0001363508],"genre_scores_gemma":[0.9977782,0.00002534331,0.001489838,0.00008169487,0.0002485357,0.00003673657,0.00004395294,0.00007239843,0.0002232928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715334,"threshold_uncertainty_score":0.8221638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992374598","doi":"10.1007/s11265-008-0234-2","title":"Adaptive Duplicated Filters and Interference Canceller for DS-CDMA Systems","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Payload (computing); Interference (communication); Block (permutation group theory); Multiuser detection; Code division multiple access; Context (archaeology); Telecommunications link; Reduction (mathematics); Throughput; Field-programmable gate array; Adaptive filter; Real-time computing; Electronic engineering; Computer hardware; Algorithm; Computer network; Telecommunications; Network packet; Engineering; Mathematics; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.07510501831272712,"gpt":0.2903061565355309,"spread":0.2152011382228038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006471,0.000168924,0.0004222342,0.0002337059,0.0003545598,0.0004130902,0.001333544,0.00009026765,0.000001217836],"category_scores_gemma":[0.00003965464,0.0001336679,0.00006700038,0.0004129807,0.0001560961,0.0008732991,0.0001764512,0.0003682068,0.000002528033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00014333,"about_ca_system_score_gemma":0.0004375269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006369247,"about_ca_topic_score_gemma":0.000001593878,"domain_scores_codex":[0.9979497,0.0002065425,0.0007540675,0.0002472962,0.0005211278,0.0003212851],"domain_scores_gemma":[0.9970517,0.0003675873,0.0008501055,0.0003129087,0.001223327,0.0001943657],"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.002484252,0.001434044,0.007817742,0.006680726,0.001581596,0.000736965,0.03943131,0.4370823,0.05030644,0.01959366,0.08894629,0.3439047],"study_design_scores_gemma":[0.0006538643,0.0004026443,0.0002252191,0.00124534,0.000009122067,0.001085666,0.0004295046,0.9934946,0.000243034,0.00005680705,0.001962318,0.0001919095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02009304,0.01349257,0.9650245,0.0003670396,0.0003372824,0.000404184,0.000002810923,0.0000442843,0.0002342652],"genre_scores_gemma":[0.9949648,0.0002106712,0.004161185,0.00002668709,0.0002463226,0.00004288589,5.116836e-7,0.00001704467,0.0003298629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9748718,"threshold_uncertainty_score":0.5450819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068523583","doi":"10.1007/s11265-009-0374-z","title":"Feature Fusion Applied to Missing Data ASR with the Combination of Recognizers","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Speech recognition; Computer science; Pattern recognition (psychology); Noise (video); Mel-frequency cepstrum; Artificial intelligence; Feature (linguistics); Cepstrum; Fusion; Process (computing); Hidden Markov model; Feature extraction","retraction":null,"screen_n_in":null,"score":{"opus":0.02352298276305343,"gpt":0.2572750499648186,"spread":0.2337520672017652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452101,0.0001521156,0.0003247737,0.0001896211,0.0002590289,0.0005743243,0.00150097,0.00006620626,8.458607e-7],"category_scores_gemma":[0.00003982347,0.00008725752,0.00003424536,0.0007865663,0.00003577349,0.001060642,0.00008641764,0.0002911548,0.00000116139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004881887,"about_ca_system_score_gemma":0.0003294818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001899047,"about_ca_topic_score_gemma":4.68601e-7,"domain_scores_codex":[0.9982615,0.00006529776,0.0004088823,0.0002422415,0.0008062613,0.0002157869],"domain_scores_gemma":[0.9978002,0.00007406795,0.001117116,0.0003374423,0.00055518,0.0001159428],"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.0001686573,0.0001289907,0.00008701777,0.0002398537,0.00003321865,0.00003212285,0.001681758,0.002082335,0.1503476,0.0001123769,0.007012792,0.8380733],"study_design_scores_gemma":[0.01313217,0.009001801,0.008562248,0.03511011,0.0007090316,0.007834013,0.010938,0.2323083,0.6345618,0.006886851,0.03755642,0.003399303],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680967,0.001990073,0.9568889,0.01283509,0.0001868839,0.0002358627,0.000001770333,0.00003834675,0.001013446],"genre_scores_gemma":[0.9647801,0.000004709094,0.03456873,0.0003648073,0.0002080417,7.625992e-7,0.000001608752,0.000008887549,0.00006236184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9379704,"threshold_uncertainty_score":0.5538223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997794147","doi":"10.1007/s11265-019-01506-0","title":"An Efficient Software List Sphere Decoder for Polar Codes","year":2020,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Soft-decision decoder; Computer science; Decoding methods; Algorithm; Software; Sorting; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02917613368098362,"gpt":0.2882462562259795,"spread":0.259070122544996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044765,0.000202623,0.0004326452,0.0001060316,0.0002426015,0.0007244274,0.001277231,0.0001025542,0.000003240652],"category_scores_gemma":[0.0001920346,0.0001671029,0.0001458008,0.0003774363,0.00003776501,0.0007585611,0.00006732843,0.000311621,0.000002046667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009716275,"about_ca_system_score_gemma":0.0003833061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002854078,"about_ca_topic_score_gemma":0.000003566711,"domain_scores_codex":[0.9979349,0.0001228783,0.0007514004,0.0003074851,0.0005801502,0.0003031326],"domain_scores_gemma":[0.9974651,0.000164345,0.0009736766,0.0002022066,0.0009147059,0.0002800071],"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.0009539112,0.001747306,0.01794984,0.008043696,0.000438007,0.0007182523,0.04082906,0.2848968,0.1711315,0.004801764,0.03744214,0.4310477],"study_design_scores_gemma":[0.0005390852,0.001365457,0.00009516274,0.001096364,0.00004161636,0.0004898029,0.0006894811,0.9849161,0.006913121,0.0003106455,0.003154835,0.0003883124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02434964,0.002202923,0.97207,0.0004214813,0.0003615349,0.0002324492,0.000005108394,0.0003125827,0.00004432303],"genre_scores_gemma":[0.8423142,0.000001767086,0.1568198,0.0002700091,0.0005431509,0.000006613982,7.274972e-7,0.00002698417,0.00001671345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8179646,"threshold_uncertainty_score":0.698567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059340091","doi":"10.1007/s11265-010-0458-9","title":"Low Complexity Reconfigurable DSP Circuit Implementations Based on Common Sub-expression Elimination","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Multiplier (economics); Operand; Computer science; Field-programmable gate array; Digital signal processing; Adder; Electronic circuit; Arithmetic; Booth's multiplication algorithm; Circuit design; Computer hardware; Parallel computing; Algorithm; Mathematics; Embedded system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04485017147096986,"gpt":0.2844201616064039,"spread":0.239569990135434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511162,0.0001732999,0.0003152278,0.0003146536,0.0004893415,0.0006405594,0.0006954999,0.00008718498,0.00001692388],"category_scores_gemma":[0.00008764168,0.0001459041,0.0001024543,0.0003912307,0.00005325307,0.00102292,0.00001998943,0.0005622617,0.000009517059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008299224,"about_ca_system_score_gemma":0.0003066717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002670996,"about_ca_topic_score_gemma":0.00001276233,"domain_scores_codex":[0.9977998,0.0001526552,0.0008188809,0.0002332899,0.0007060756,0.0002892847],"domain_scores_gemma":[0.9975265,0.0002610963,0.00120079,0.0002260578,0.0006223129,0.0001632478],"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.00000674216,0.0004278717,0.005660882,0.0005245295,0.00001551524,0.00006978954,0.0006713798,0.01385018,0.747924,0.003917958,0.0007997657,0.2261314],"study_design_scores_gemma":[0.001769891,0.0007680519,0.01082345,0.00328886,0.00004359468,0.0005874808,0.0003923281,0.8761957,0.1005539,0.004537555,0.0004312686,0.0006079771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2036448,0.0001055292,0.7911227,0.0005050214,0.0009902015,0.0002253309,0.000005710119,0.000104531,0.00329608],"genre_scores_gemma":[0.9984953,9.948087e-7,0.0009504393,0.0001402193,0.0003686899,0.000005370111,0.000004770639,0.0000143795,0.00001983796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8623455,"threshold_uncertainty_score":0.6176929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126177875","doi":"10.1007/s11265-010-0562-x","title":"Rapid Synthesis and Simulation of Computational Circuits in an MPPA","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Speedup; Computer science; Field-programmable gate array; Scalability; Electronic circuit; Routing (electronic design automation); Massively parallel; Parallel computing; Computer architecture; Range (aeronautics); Software; Design flow; Computer hardware; Computer engineering; Embedded system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0305049917562528,"gpt":0.2891286780724233,"spread":0.2586236863161704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128206,0.0001224397,0.0003830075,0.0004582118,0.0000579434,0.0002254937,0.0004725221,0.000114339,0.000002282339],"category_scores_gemma":[0.0001021926,0.0001057803,0.00004330189,0.0003293315,0.00005833938,0.001492278,0.0000311998,0.0002801264,4.728942e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003558088,"about_ca_system_score_gemma":0.0002119471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001177439,"about_ca_topic_score_gemma":0.000002362671,"domain_scores_codex":[0.9979729,0.0002226345,0.0009385854,0.0001767409,0.0005455667,0.0001435409],"domain_scores_gemma":[0.9975644,0.0004308266,0.001109711,0.0001428402,0.0006572108,0.00009497336],"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.00005299842,0.0004408387,0.01258246,0.001655171,0.00005728025,0.000111088,0.006269202,0.2900806,0.2209714,0.003675007,0.00007251595,0.4640314],"study_design_scores_gemma":[0.0002758432,0.0002209552,0.002658236,0.0009360996,0.00001016853,0.0003689316,0.0001348854,0.9873964,0.005248297,0.002553834,0.00004030709,0.0001560114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3567367,0.0005879556,0.6421927,0.0000333336,0.0001614489,0.0001383097,9.44696e-7,0.00003283335,0.0001157902],"genre_scores_gemma":[0.9864076,0.000002218705,0.01342173,0.0000105352,0.000139151,0.00000401523,1.992668e-7,0.00001082347,0.000003701899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6973159,"threshold_uncertainty_score":0.4313595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409461316","doi":"10.1007/s11265-025-01949-8","title":"Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes","year":2025,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Mechanism (biology); Computer science; Polar; Algorithm; Speech recognition; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02538687802069558,"gpt":0.3018626466170238,"spread":0.2764757685963283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654585,0.0001563147,0.0004761672,0.0004593688,0.0001946875,0.0002531755,0.0007735951,0.0001045598,0.000001018973],"category_scores_gemma":[0.0002112081,0.0001357108,0.0001396939,0.0005016965,0.00003164801,0.0007286735,0.00006596182,0.0001851669,2.694452e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001498782,"about_ca_system_score_gemma":0.0004702437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005474919,"about_ca_topic_score_gemma":0.00000606554,"domain_scores_codex":[0.9980115,0.0001390822,0.0009951757,0.0002111732,0.0004221588,0.0002208656],"domain_scores_gemma":[0.9963332,0.0003099885,0.001604967,0.0001860122,0.001517608,0.0000481697],"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.0003181823,0.0001847951,0.002575342,0.003126936,0.000226894,0.00003012691,0.002542597,0.006262705,0.7042724,0.2199583,0.003377603,0.05712411],"study_design_scores_gemma":[0.001128933,0.0004431651,0.00005730958,0.005303294,0.00008068102,0.00009192776,0.0003445842,0.7204256,0.2346593,0.0365606,0.0005826869,0.0003218789],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03924971,0.001706315,0.9574249,0.0002734496,0.0007452237,0.000243488,0.000001846561,0.00008116439,0.0002738683],"genre_scores_gemma":[0.9043949,0.00001559219,0.09513906,0.00005543757,0.0001618186,0.00000990705,4.891265e-7,0.00001199972,0.0002108207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8651451,"threshold_uncertainty_score":0.5534125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2260407357","doi":"10.1007/s11265-015-1064-7","title":"On the Traffic Offloading in Wi-Fi Supported Heterogeneous Wireless Networks","year":2015,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Macrocell; Computer network; Computer science; Heterogeneous network; Small cell; Cellular network; Femtocell; Wireless network; Context (archaeology); Wireless; Telecommunications; Base station; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01955168446168878,"gpt":0.2273930385941686,"spread":0.2078413541324798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040632,0.0002073474,0.0004028422,0.0002166162,0.00006351549,0.00015049,0.0002507757,0.0001246868,0.000003831944],"category_scores_gemma":[0.00003916275,0.0001484083,0.00006544969,0.0004096034,0.00002874396,0.0003500239,0.0000103073,0.0004328743,0.000004790675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003238839,"about_ca_system_score_gemma":0.00009125281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003416633,"about_ca_topic_score_gemma":0.000003753377,"domain_scores_codex":[0.9981858,0.0001166024,0.0009037966,0.0001215935,0.000372363,0.0002998215],"domain_scores_gemma":[0.9989272,0.000124943,0.0004409807,0.0001191669,0.0002503644,0.0001373087],"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.00003712989,0.00002230842,0.00004600953,0.0001085322,0.00002714126,0.00007826467,0.0005400105,0.9946853,0.0007252009,0.00003076373,0.0003691054,0.003330262],"study_design_scores_gemma":[0.0004315486,0.000111392,0.000004372282,0.001300084,0.00001609792,0.0005122829,0.0007389509,0.9962317,0.0003617003,0.00003977105,0.0000855386,0.000166518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5173982,0.00517981,0.4754209,0.00004888369,0.001131873,0.0003527599,0.000001841189,0.000123127,0.0003426032],"genre_scores_gemma":[0.9992863,0.00001690933,0.0001436439,0.00001851193,0.0004367577,0.000009471513,0.00000155152,0.00006008728,0.0000267725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4818881,"threshold_uncertainty_score":0.6051916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986429310","doi":"10.1007/s11265-010-0540-3","title":"Automatic Detection of Object of Interest and Tracking in Active Video","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Initialization; Video tracking; AdaBoost; Pattern recognition (psychology); Classifier (UML); Outlier; Salient; Object detection; Tracking (education); Object (grammar)","retraction":null,"screen_n_in":null,"score":{"opus":0.03947942196863002,"gpt":0.3100770123080309,"spread":0.2705975903394008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002209349,0.00009526202,0.0004003475,0.0003463042,0.00003703847,0.00009531226,0.0002913152,0.0000760542,9.319049e-7],"category_scores_gemma":[0.0001925556,0.00007577305,0.0000574643,0.0003733682,0.00005931544,0.0008341684,0.00003259367,0.0003624209,1.561155e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002384802,"about_ca_system_score_gemma":0.0001315591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004415114,"about_ca_topic_score_gemma":0.00004805584,"domain_scores_codex":[0.9985858,0.0001785011,0.0007562445,0.0001212237,0.00023479,0.0001234264],"domain_scores_gemma":[0.9979783,0.0002911678,0.001231098,0.0001060057,0.0003475718,0.00004585145],"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.00002630218,0.00005254191,0.004598056,0.0005708009,0.00002098069,0.00001406828,0.001914575,0.0001498039,0.4631622,0.00008050851,7.738128e-7,0.5294093],"study_design_scores_gemma":[0.001871898,0.001048004,0.1650977,0.006568023,0.00004565334,0.001924208,0.001457535,0.2751621,0.5432186,0.003181136,0.00004155635,0.0003836262],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8141791,0.0004461722,0.1849315,0.00002056319,0.0003184329,0.0000574816,3.272526e-7,0.000009221862,0.0000372002],"genre_scores_gemma":[0.9938388,0.000005166645,0.006057766,0.000003948663,0.00008479832,0.000001119694,3.162968e-8,0.000006605495,0.000001784589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5290257,"threshold_uncertainty_score":0.3089935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975649745","doi":"10.1007/s11265-013-0788-5","title":"Performance Characterization of AES Datapath Architectures in 90-nm Standard Cell CMOS Technology","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Datapath; Advanced Encryption Standard; Computer science; Standard cell; Parameterized complexity; CMOS; Throughput; Computer architecture; Efficient energy use; Embedded system; Parallel computing; Computer hardware; Cryptography; Integrated circuit; Algorithm; Electronic engineering; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009626717723937602,"gpt":0.2343084231876711,"spread":0.2246817054637335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941789,0.00009778231,0.0002600595,0.0006303406,0.00007696117,0.0001586574,0.0004978299,0.00005423217,0.000007905302],"category_scores_gemma":[0.000008495904,0.00007594989,0.00003544034,0.0007006423,0.00005294184,0.0006877858,0.00005680567,0.0001959501,9.98918e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003087084,"about_ca_system_score_gemma":0.0001568263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002371217,"about_ca_topic_score_gemma":0.000002269958,"domain_scores_codex":[0.9985971,0.00005243229,0.0006979816,0.0001239773,0.0003563855,0.000172092],"domain_scores_gemma":[0.9986297,0.00002269827,0.0007929545,0.0001349264,0.0003786796,0.00004103459],"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.00006772042,0.0003242219,0.1067532,0.001762186,0.00003834299,0.00002329349,0.007155781,0.001807408,0.5834435,0.001071892,0.000114985,0.2974375],"study_design_scores_gemma":[0.006263714,0.004539488,0.1654222,0.005765369,0.00008696174,0.001330497,0.005738281,0.6218604,0.179027,0.004754264,0.003803898,0.001408015],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.835116,0.0002634614,0.1641809,0.0001430069,0.0001000937,0.000138705,0.00000439554,0.00001254928,0.00004086935],"genre_scores_gemma":[0.9966028,0.00002535797,0.003284897,0.00001399995,0.00005289372,0.000007092129,0.000001906939,0.000005505347,0.000005536793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.620053,"threshold_uncertainty_score":0.3097147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2549866851","doi":"10.1007/s11265-017-1225-y","title":"Using OpenCL to Increase SCA Application Portability","year":2017,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nordion (Canada)","funders":"","keywords":"Software portability; Computer science; Software; Software-defined radio; Embedded system; Component (thermodynamics); Operating system; Computer architecture; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04308871623232419,"gpt":0.3210319964322574,"spread":0.2779432801999332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171197,0.0001463008,0.0003206589,0.0001654642,0.0003524068,0.000927009,0.001821509,0.00007355274,0.000001063673],"category_scores_gemma":[0.00004051341,0.0001270691,0.00007063212,0.0001414939,0.00003641522,0.001693684,0.0002373263,0.0002040205,0.000003258039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000173918,"about_ca_system_score_gemma":0.0002647973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001986997,"about_ca_topic_score_gemma":0.000001290489,"domain_scores_codex":[0.9983485,0.00005383775,0.0006308132,0.0002415976,0.0005206413,0.0002045903],"domain_scores_gemma":[0.9974151,0.00002399804,0.001078535,0.0006429615,0.0006287052,0.0002106527],"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.0001066454,0.0004573594,0.03346068,0.001573747,0.0001177383,0.0002077106,0.002242228,0.1062056,0.1426904,0.02248479,0.001207322,0.6892458],"study_design_scores_gemma":[0.0003332189,0.0001877708,0.005039767,0.001515713,0.00003100082,0.0006337832,0.00001537807,0.978738,0.004059022,0.001056649,0.007960227,0.0004294853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04627242,0.0001806491,0.9528106,0.000127141,0.0001842672,0.0002218751,9.843659e-7,0.0000950894,0.0001069079],"genre_scores_gemma":[0.7159976,9.620879e-7,0.2837604,0.00001972407,0.0001913192,0.000006816935,1.15225e-7,0.00001053696,0.00001250409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8725324,"threshold_uncertainty_score":0.8939168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148632366","doi":"10.1007/s11265-013-0798-3","title":"Efficient Uniform Quantization Likelihood Evaluation for Particle Filters in Embedded Implementations","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Concordia University; Polytechnique Montréal","keywords":"Speedup; Quantization (signal processing); Computer science; Software; Algorithm; Software implementation; Particle filter; Floating point; Parallel computing; Computer engineering; Computer hardware; Artificial intelligence; Programming language; Kalman filter","retraction":null,"screen_n_in":null,"score":{"opus":0.03492705843829245,"gpt":0.3081439200539794,"spread":0.273216861615687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00176342,0.00009681183,0.0001800445,0.0001672177,0.0001499297,0.0004658852,0.0003172597,0.00004553222,0.00001596636],"category_scores_gemma":[0.00006448246,0.00007901333,0.00005342705,0.0004325841,0.00001569018,0.0006460745,0.00002650176,0.0001063159,0.000006510832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070409,"about_ca_system_score_gemma":0.0001924307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000322914,"about_ca_topic_score_gemma":0.000004002249,"domain_scores_codex":[0.9981462,0.0001173605,0.0007884091,0.0001568649,0.0005418482,0.0002492607],"domain_scores_gemma":[0.9981328,0.0001441294,0.0006245518,0.0001253832,0.0008879534,0.00008522206],"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.00002980779,0.000246436,0.002011459,0.0001770722,0.00002542388,0.000003663764,0.003688837,0.8454013,0.01082825,0.001651355,0.002798786,0.1331376],"study_design_scores_gemma":[0.0008981416,0.0001238061,0.001024748,0.0002706733,0.00001551005,0.0000301453,0.001017082,0.9952162,0.0005757757,0.0006345322,0.00009678811,0.00009658513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2279741,0.0003892597,0.7705078,0.00025009,0.0003941823,0.0004267619,0.000002392558,0.0000206231,0.00003486115],"genre_scores_gemma":[0.9846909,0.000003114629,0.01504195,0.00004524261,0.0001542737,0.00004151903,0.000005983637,0.000008284565,0.000008742996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7567168,"threshold_uncertainty_score":0.4492542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}