{"meta":{"query_hash":"6b38d6abb64e","filters":{"venue":"Journal of Signal Processing Systems"},"cohort_total":72,"direct_labels_cover":0,"predictions_cover":72,"exported":72,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/6b38d6abb64e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Signal+Processing+Systems"},"results":[{"id":"W1965811650","doi":"10.1007/s11265-013-0742-6","title":"Decimal Division Algorithms: The Issue of Partial Remainders","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Division (mathematics); Division algorithm; Divisor (algebraic geometry); Arithmetic; Decimal; Numerical digit; Mathematics; Quotient; Algorithm; Remainder; Generalization; Set (abstract data type); Operand; Computer science; Discrete mathematics; Combinatorics","score_opus":0.022434748565534686,"score_gpt":0.28391382534675375,"score_spread":0.26147907678121907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965811650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02174728,0.055005524,0.8563906,0.011400048,0.006649906,0.00006546496,0.00023251436,0.00054698286,0.04796162],"genre_scores_gemma":[0.543012,0.04818255,0.3383673,0.0042677894,0.01973002,0.00015688599,0.00059702236,0.0012466747,0.044439755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972941,0.0010501262,0.00021113195,0.00038724605,0.0008762893,0.00018105116],"domain_scores_gemma":[0.99128634,0.004955398,0.0003717591,0.0021655883,0.0010325508,0.00018832234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040581385,0.0010601034,0.0012895106,0.0015648782,0.0011195927,0.0053877453,0.0013140474,0.0017527246,0.0057229158],"category_scores_gemma":[0.023997664,0.000577805,0.000597007,0.003317857,0.003099965,0.0077295746,0.0026095642,0.0043057287,0.0026390348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037768012,0.00004345366,0.0004832874,0.00028866998,0.00003581689,0.00014754228,0.0001763519,0.013370087,0.0013208361,0.7418936,0.026509698,0.21535307],"study_design_scores_gemma":[0.00004731501,0.00007525876,0.00017758628,0.00020918374,0.000028555116,0.00050942466,0.000083164705,0.06425136,0.003922354,0.86551386,0.065145425,0.00003663711],"about_ca_topic_score_codex":0.00033283458,"about_ca_topic_score_gemma":0.00039717674,"teacher_disagreement_score":0.0057229158,"about_ca_system_score_codex":0.0009352325,"about_ca_system_score_gemma":0.0009538003,"threshold_uncertainty_score":0.021461725},"labels":[],"label_agreement":null},{"id":"W1965821966","doi":"10.1007/s11265-008-0293-4","title":"Multiprocessor, Multithreading and Memory Optimization for On-Chip Multimedia Applications","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada); Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Multithreading; Computer science; Multiprocessing; Adaptation (eye); Computer architecture; Parallel computing; Locality; Chip; Embedded system; Thread (computing); Operating system","score_opus":0.030468916980718644,"score_gpt":0.273168184106578,"score_spread":0.24269926712585937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965821966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26922816,0.007206827,0.7091748,0.0008209837,0.00032384854,0.00007461616,0.000109335066,0.0011768099,0.011884673],"genre_scores_gemma":[0.9035727,0.0007839253,0.08919588,0.00013347034,0.000107078115,0.00007144031,0.000081576494,0.00022356983,0.005830407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981683,0.000059518497,0.000009981526,0.000020802812,0.000059645437,0.00003320544],"domain_scores_gemma":[0.99966824,0.00016461538,0.000038571005,0.00003393514,0.00007760626,0.000016997847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033132,0.00045209622,0.00055836333,0.00032671724,0.0003769646,0.0005837813,0.0006644473,0.0004015882,0.0020955787],"category_scores_gemma":[0.0013818219,0.00022782705,0.0002431524,0.00051721255,0.0001734234,0.0005996693,0.0004189448,0.00047429043,0.00014254994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039540854,0.00018240357,0.0013508284,0.00014054815,0.000090140245,0.00007471834,0.000057118654,0.7730382,0.02885147,0.010703215,0.004656917,0.18045896],"study_design_scores_gemma":[0.000014048953,0.000045265497,0.00033348813,0.0000027364715,0.00001688244,0.000014420611,0.000008656934,0.9934285,0.0026693824,0.0026686443,0.00079409487,0.00000385663],"about_ca_topic_score_codex":0.0026646992,"about_ca_topic_score_gemma":0.006523519,"teacher_disagreement_score":0.0026646992,"about_ca_system_score_codex":0.00050926086,"about_ca_system_score_gemma":0.00068960467,"threshold_uncertainty_score":0.0070104003},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025841340555624412,"score_gpt":0.2712819439382788,"score_spread":0.2454406033826544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967444872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051342163,0.0018353005,0.9103951,0.0005065024,0.0005454374,0.00010174308,0.00032696995,0.0024085674,0.03253818],"genre_scores_gemma":[0.41932145,0.00085863075,0.54631567,0.0003873409,0.00024821705,0.00018226486,0.000500833,0.00019111707,0.031994488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996449,0.000064056374,0.000028881448,0.00008207231,0.00011881767,0.00006130575],"domain_scores_gemma":[0.99960333,0.00010189745,0.000029342014,0.00009751446,0.00014876823,0.00001923124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169674,0.0009582671,0.0005580314,0.0008454436,0.00060304714,0.0009764554,0.0009613833,0.00039947708,0.013769938],"category_scores_gemma":[0.0011961608,0.00022144699,0.00030645658,0.0011382283,0.00033551003,0.0010879459,0.00092716765,0.00057874084,0.0032609673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016257073,0.00013330752,0.00058777415,0.0003871687,0.00008041294,0.00030283834,0.00012800793,0.029416438,0.077472016,0.07900013,0.021397488,0.7894687],"study_design_scores_gemma":[0.00057324144,0.0015608204,0.0016241693,0.00023048792,0.00026832704,0.0021931,0.00020817359,0.48134166,0.21809173,0.15543562,0.13834614,0.00012652717],"about_ca_topic_score_codex":0.00085522194,"about_ca_topic_score_gemma":0.0021646165,"teacher_disagreement_score":0.013769938,"about_ca_system_score_codex":0.0005479152,"about_ca_system_score_gemma":0.0010042198,"threshold_uncertainty_score":0.046064973},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02056301322011973,"score_gpt":0.27142063693992463,"score_spread":0.2508576237198049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975528831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7143665,0.00092531525,0.25724036,0.0018293788,0.00017086267,0.0001524877,0.0006868412,0.0005647674,0.024063503],"genre_scores_gemma":[0.98934525,0.00024712086,0.0062268157,0.00008744372,0.00003131849,0.00006922132,0.00015239943,0.000044150227,0.0037962582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00019041638,0.000023809731,0.00007023476,0.00014058873,0.00013922738],"domain_scores_gemma":[0.9967932,0.0020614048,0.0002900757,0.00021249874,0.00052433705,0.00011846911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033213,0.0005437474,0.0012473667,0.0009733207,0.0007773494,0.0013965878,0.0015475869,0.0022308666,0.002772298],"category_scores_gemma":[0.0064176894,0.00061286706,0.000842762,0.0009608096,0.0015142132,0.0017005606,0.0008114007,0.0011930435,0.00038969153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004683225,0.00003111025,0.000724717,0.000023686713,0.000018286173,0.00005853261,0.000037041318,0.964669,0.00082501915,0.032458868,0.00022494256,0.0008819456],"study_design_scores_gemma":[0.000007771395,0.0000053507297,0.000078115605,0.0000019740105,0.000004785708,0.0000072958305,0.00000383181,0.9970114,0.00015209624,0.0026813194,0.00004202775,0.0000040388272],"about_ca_topic_score_codex":0.013306879,"about_ca_topic_score_gemma":0.008025045,"teacher_disagreement_score":0.013306879,"about_ca_system_score_codex":0.0019776423,"about_ca_system_score_gemma":0.0019478654,"threshold_uncertainty_score":0.02645886},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009626717723937602,"score_gpt":0.23430842318767114,"score_spread":0.22468170546373353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975649745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886206,0.0006377388,0.0053058583,0.00014999659,0.00004015907,0.000042748656,0.0004980593,0.00033111745,0.0043737674],"genre_scores_gemma":[0.99701154,0.00015531604,0.0013964947,0.000023901426,0.000009332712,0.000015338064,0.00021471032,0.000024579205,0.0011487185],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955136,0.00005254,0.000034374058,0.00009248746,0.00015168816,0.00011755597],"domain_scores_gemma":[0.99871266,0.00048491714,0.00024875606,0.00011225431,0.00038273024,0.000058653408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025703755,0.00041193428,0.00025857083,0.00079585164,0.00030503323,0.000568451,0.0006059339,0.00039044116,0.003270325],"category_scores_gemma":[0.0013330729,0.00015349286,0.00018952052,0.00080188527,0.00019922739,0.0009851411,0.00018376266,0.00022828042,0.00066047267],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033963865,0.00053605787,0.022517927,0.0006732128,0.00023704402,0.00089236745,0.0004883078,0.06282034,0.8255039,0.007902907,0.004913754,0.07011788],"study_design_scores_gemma":[0.00018627504,0.0066928742,0.022731854,0.000092447495,0.00023235979,0.0016742458,0.00040094447,0.3122439,0.6430156,0.0022049719,0.010443171,0.00008139997],"about_ca_topic_score_codex":0.001502498,"about_ca_topic_score_gemma":0.002137253,"teacher_disagreement_score":0.003270325,"about_ca_system_score_codex":0.0007903776,"about_ca_system_score_gemma":0.0005701714,"threshold_uncertainty_score":0.010940313},"labels":[],"label_agreement":null},{"id":"W1976039732","doi":"10.1007/s11265-008-0260-0","title":"Guest Editorial: 20 Years of ASAP","year":2008,"lang":"en","type":"editorial","venue":"Journal of Signal Processing Systems","topic":"Cerebral Palsy and Movement Disorders","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Geography","score_opus":0.013462360821055895,"score_gpt":0.2772657456589976,"score_spread":0.2638033848379417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976039732","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035700312,0.003592093,0.000080882,0.024411794,0.9710453,0.000009775171,0.00003420353,0.00003622722,0.0007540006],"genre_scores_gemma":[0.00030650976,0.0018532464,0.00005722324,0.015357992,0.9778235,0.000014222707,0.000023913964,0.00002681007,0.0045365044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961111,0.00070819794,0.0005643341,0.00052485924,0.0016999489,0.00039156474],"domain_scores_gemma":[0.97977865,0.005356786,0.0021552043,0.00069046265,0.008719223,0.0032996533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059930733,0.00422682,0.00477232,0.004870846,0.0029411986,0.007973422,0.002992668,0.015995707,0.02088128],"category_scores_gemma":[0.025708292,0.0013814344,0.002826896,0.0017663051,0.0021494534,0.003436291,0.0026846766,0.016915025,0.017901685],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043501204,0.000007992969,0.00003135453,0.00011978214,0.000018906307,0.00018995906,0.000006078081,0.000013526221,0.000042916236,0.00008049258,0.9961183,0.003327239],"study_design_scores_gemma":[0.00012490823,0.000049597384,0.00051924406,0.0004042421,0.00011510191,0.00074164046,0.000037347207,0.00018518427,0.0001593392,0.00057911075,0.9970547,0.000029554554],"about_ca_topic_score_codex":0.00079847383,"about_ca_topic_score_gemma":0.0027366362,"teacher_disagreement_score":0.02088128,"about_ca_system_score_codex":0.0021765812,"about_ca_system_score_gemma":0.0021412503,"threshold_uncertainty_score":0.069854796},"labels":[],"label_agreement":null},{"id":"W1976979609","doi":"10.1007/s11265-011-0577-y","title":"Switching Activity Minimization in Iterative LDPC Decoders","year":2011,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Alberta","keywords":"Low-density parity-check code; Computer science; Decoding methods; Interconnection; Soft-decision decoder; Implementation; Process (computing); Code (set theory); Power (physics); Computer engineering; Parallel computing; Algorithm; Computer network","score_opus":0.042433211508636166,"score_gpt":0.27496765735215223,"score_spread":0.23253444584351607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976979609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0938341,0.0003890568,0.89816946,0.00022879259,0.000025517145,0.000044537166,0.00008049479,0.00031150316,0.0069165197],"genre_scores_gemma":[0.82160896,0.00048720764,0.16967839,0.00008472013,0.000047491158,0.00014025439,0.00021439132,0.00016695475,0.0075716507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994479,0.00022760895,0.000032948607,0.00005160086,0.0001810555,0.000058832487],"domain_scores_gemma":[0.99845743,0.001070529,0.00009125663,0.00013283575,0.00020586349,0.000042021766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060140213,0.0004650379,0.0005285381,0.00047540886,0.00030275685,0.0008285843,0.0007787688,0.000626193,0.001254457],"category_scores_gemma":[0.0030405773,0.00034196122,0.0002835628,0.0006849598,0.00046691435,0.0006142044,0.00064519286,0.00059129624,0.00035747516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031917435,0.00011170893,0.0010181525,0.0001610501,0.00004889462,0.00010462824,0.00023085275,0.7240493,0.029833555,0.07308441,0.0013684038,0.16966988],"study_design_scores_gemma":[0.00000938279,0.000037555405,0.00015164836,0.000010323315,0.000008189609,0.000035087105,0.000010240135,0.98060054,0.0077301436,0.010983031,0.0004179719,0.000005871108],"about_ca_topic_score_codex":0.0015181366,"about_ca_topic_score_gemma":0.002328375,"teacher_disagreement_score":0.0015181366,"about_ca_system_score_codex":0.0006998025,"about_ca_system_score_gemma":0.0010113771,"threshold_uncertainty_score":0.0050774813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014373006407067327,"score_gpt":0.26729751731313206,"score_spread":0.2529245109060647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979231468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03523623,0.00066084624,0.96094877,0.00013850874,0.00008679733,0.000022205191,0.000059523314,0.0003237719,0.0025232823],"genre_scores_gemma":[0.42084956,0.0025505319,0.56894577,0.00008812473,0.0003088726,0.000048623355,0.00021439392,0.00023047408,0.00676366],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997868,0.000055472607,0.000014899327,0.000042009033,0.0000775494,0.000023247741],"domain_scores_gemma":[0.99954516,0.00021144674,0.00006374706,0.00009454806,0.00006851478,0.000016533948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036837926,0.00048808762,0.00037467096,0.0007165802,0.00018639436,0.00058863906,0.0003334024,0.0006343993,0.002534359],"category_scores_gemma":[0.0016556486,0.0002210791,0.0005207798,0.0010793791,0.00048479225,0.00067541463,0.00040738413,0.00047849992,0.0008509005],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039202702,0.00013955444,0.0011084073,0.00024922116,0.00004598722,0.00052941014,0.00020772462,0.07024516,0.24127194,0.059528906,0.0017862432,0.6244953],"study_design_scores_gemma":[0.00002172271,0.00020879741,0.0027000867,0.000022816652,0.000042568012,0.0010288601,0.0000660177,0.8892928,0.083800666,0.015335208,0.007418023,0.00006252219],"about_ca_topic_score_codex":0.00058137416,"about_ca_topic_score_gemma":0.0006252942,"teacher_disagreement_score":0.002534359,"about_ca_system_score_codex":0.00013571269,"about_ca_system_score_gemma":0.0001752698,"threshold_uncertainty_score":0.008478284},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01825937545305971,"score_gpt":0.25245355551392257,"score_spread":0.23419418006086284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979930092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21415403,0.0007364727,0.7749575,0.00063004997,0.00008123791,0.00006644827,0.00010985443,0.00026777328,0.00899658],"genre_scores_gemma":[0.93324757,0.00045672402,0.06390173,0.00007479569,0.00013264145,0.000065205684,0.000191971,0.00011046362,0.0018189035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913424,0.00025561883,0.00005443861,0.00013205911,0.00033455645,0.00008915768],"domain_scores_gemma":[0.97974485,0.0140438415,0.0013536842,0.0015050657,0.0029268984,0.00042574038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022216158,0.00059880887,0.0004998344,0.0014161688,0.00087394245,0.0023477292,0.0012388439,0.0014296958,0.002116684],"category_scores_gemma":[0.029861175,0.00077723933,0.00050607725,0.0012593349,0.0015213912,0.0040232576,0.0010504944,0.0010778732,0.00029776563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018170886,0.0001480168,0.010314036,0.0001551089,0.00005630002,0.0002741036,0.00037881965,0.2807728,0.012910982,0.63968766,0.0011579429,0.053962585],"study_design_scores_gemma":[0.000016730242,0.00010505389,0.0030306363,0.000017750208,0.000026939551,0.00036332154,0.00012427034,0.8891678,0.0027673764,0.103301585,0.0010487383,0.0000298526],"about_ca_topic_score_codex":0.0010925059,"about_ca_topic_score_gemma":0.0011842975,"teacher_disagreement_score":0.0023477292,"about_ca_system_score_codex":0.0010834757,"about_ca_system_score_gemma":0.0012676676,"threshold_uncertainty_score":0.011749148},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025416521384771053,"score_gpt":0.25504651168256015,"score_spread":0.2296299902977891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982382171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19813767,0.001414124,0.7608397,0.0006249111,0.0005804638,0.00024123414,0.0004916689,0.005975781,0.031694412],"genre_scores_gemma":[0.86975825,0.0005223189,0.11559625,0.0003705693,0.00015702072,0.000113902686,0.00048331806,0.000069526715,0.012928928],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996896,0.00003473758,0.00002655302,0.000059975842,0.00013986781,0.000049289447],"domain_scores_gemma":[0.9997608,0.000031974447,0.000039195867,0.000043434145,0.000101502235,0.000023011142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020824159,0.00027243345,0.00018971959,0.00052516366,0.000303069,0.0008314533,0.0011146426,0.0005038915,0.0045379447],"category_scores_gemma":[0.00029354406,0.00016640428,0.00014975484,0.00046915645,0.0002575225,0.00075281854,0.00039264993,0.000503408,0.0010108044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000590478,0.00017277595,0.0020297025,0.0004916126,0.000054136854,0.00049778604,0.00023285935,0.014973469,0.7137934,0.05416752,0.005912934,0.20708331],"study_design_scores_gemma":[0.00013796655,0.0015981247,0.0020313652,0.000056500525,0.00009678023,0.0019704232,0.00007645017,0.16799538,0.72842354,0.005810697,0.091706246,0.000096455704],"about_ca_topic_score_codex":0.00044457059,"about_ca_topic_score_gemma":0.00067707035,"teacher_disagreement_score":0.0045379447,"about_ca_system_score_codex":0.0006221537,"about_ca_system_score_gemma":0.00045708497,"threshold_uncertainty_score":0.015180945},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.012245750158082835,"score_gpt":0.3032052656120817,"score_spread":0.2909595154539989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983257031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077032624,0.00022414618,0.98903465,0.0000842536,0.000050464183,0.00003405449,0.000051747695,0.0015958166,0.0012215234],"genre_scores_gemma":[0.06826215,0.000138663,0.9289937,0.00004638812,0.000039252493,0.00008174909,0.00017826921,0.00009907416,0.0021606793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960846,0.00006600206,0.000029147852,0.000053812415,0.00019265032,0.000049847295],"domain_scores_gemma":[0.99912924,0.00033699823,0.00006882655,0.00020968994,0.00022272747,0.000032544118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044990605,0.0009969852,0.0007360767,0.0010274143,0.00072510313,0.00090548844,0.0013272315,0.00092738547,0.008925241],"category_scores_gemma":[0.0024714612,0.00052885857,0.0004991676,0.0011643874,0.00030678516,0.0012405625,0.0009030917,0.0008729858,0.003155974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070711336,0.00012491044,0.0005901818,0.00016683077,0.0000667116,0.00009830661,0.0001345939,0.023818448,0.070713975,0.012881747,0.004560652,0.88613653],"study_design_scores_gemma":[0.0001739426,0.0002722811,0.0013497698,0.000047268724,0.000090082096,0.00050401,0.000064981294,0.84802866,0.12062187,0.010177673,0.018594919,0.00007450128],"about_ca_topic_score_codex":0.003229025,"about_ca_topic_score_gemma":0.0066929813,"teacher_disagreement_score":0.008925241,"about_ca_system_score_codex":0.000501271,"about_ca_system_score_gemma":0.0010996981,"threshold_uncertainty_score":0.029857874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03947942196863002,"score_gpt":0.31007701230803086,"score_spread":0.27059759033940084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986429310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14876533,0.0007213942,0.8479865,0.000092417475,0.00013235769,0.000054636977,0.00010134724,0.0005925273,0.0015534272],"genre_scores_gemma":[0.6905215,0.00057331217,0.30466005,0.00011244005,0.00012402197,0.00006543626,0.00033932444,0.000107237945,0.003496743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995455,0.000061234095,0.000020943338,0.00013920497,0.00016658683,0.00006641177],"domain_scores_gemma":[0.9986985,0.00059466244,0.00012594377,0.0001418757,0.000349459,0.00008955433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090590125,0.00048572707,0.00069986156,0.0018042104,0.00036114047,0.0010402913,0.001030165,0.0011126476,0.00064952706],"category_scores_gemma":[0.00247981,0.0004308747,0.00040023678,0.000823815,0.00039751898,0.0009681051,0.0006880981,0.00067075697,0.00045551342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094526797,0.00031702046,0.0052404744,0.00015957415,0.0000766429,0.00026477253,0.00021315008,0.010859511,0.31627536,0.0037430753,0.0015075413,0.6603977],"study_design_scores_gemma":[0.00005109947,0.00031661143,0.016650911,0.00002933769,0.0001206434,0.0010161689,0.000099088094,0.80281514,0.17248368,0.0032838327,0.003095243,0.000038206203],"about_ca_topic_score_codex":0.0011900064,"about_ca_topic_score_gemma":0.0017680578,"teacher_disagreement_score":0.0018042104,"about_ca_system_score_codex":0.0002449331,"about_ca_system_score_gemma":0.0003467625,"threshold_uncertainty_score":0.004790902},"labels":[],"label_agreement":null},{"id":"W1986927667","doi":"10.1007/s11265-013-0845-0","title":"Enhancing Hardware Assisted Test Insertion Capabilities on Embedded Processors using an FPGA-based Agile Test Support Co-processor","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Alberta; University of Calgary","funders":"","keywords":"Agile software development; Embedded system; Debugging; Computer science; Overhead (engineering); Field-programmable gate array; Software; Test (biology); Computer hardware; Operating system; Computer architecture; Software engineering","score_opus":0.04360086151967359,"score_gpt":0.2980660064033549,"score_spread":0.2544651448836813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986927667","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5704319,0.0003062163,0.42040434,0.00013680267,0.000083673905,0.00009758802,0.00004951207,0.0028754403,0.005614644],"genre_scores_gemma":[0.937425,0.000047044927,0.06098,0.000059878348,0.0000125005345,0.000019368039,0.000030442465,0.000056854762,0.0013688741],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997733,0.000041764357,0.000013112318,0.000035514382,0.000087775545,0.000048586357],"domain_scores_gemma":[0.9991579,0.0002711427,0.00011221422,0.0001434574,0.00025540384,0.000059931484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019985944,0.00043294835,0.00020196223,0.00045471324,0.00018232349,0.000385378,0.00068264926,0.000296116,0.0018804498],"category_scores_gemma":[0.0007097766,0.00014642933,0.00011984996,0.00023068217,0.00014670716,0.00045577902,0.00036911693,0.00042201235,0.00041125374],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013880259,0.0002933159,0.0057510757,0.00014536823,0.00004871033,0.0007290787,0.00018891421,0.018351378,0.69117224,0.002627932,0.0013224126,0.2779816],"study_design_scores_gemma":[0.00013466191,0.002519686,0.0053350786,0.000039567272,0.00009486158,0.0023301921,0.00007215655,0.2744202,0.7071911,0.0008030641,0.007018887,0.000040605293],"about_ca_topic_score_codex":0.00031447574,"about_ca_topic_score_gemma":0.00076761417,"teacher_disagreement_score":0.0018804498,"about_ca_system_score_codex":0.0001364885,"about_ca_system_score_gemma":0.00029899427,"threshold_uncertainty_score":0.006290674},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.12999407466791363,"score_gpt":0.327400257089322,"score_spread":0.1974061824214084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991931032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47602874,0.003022363,0.4919864,0.00051311887,0.00028891905,0.00015283097,0.00031809995,0.009588457,0.018100983],"genre_scores_gemma":[0.8577623,0.0004561361,0.13058305,0.0001476361,0.00009785922,0.00008466296,0.00047774197,0.0002712899,0.010119272],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998266,0.000020329586,0.00001098714,0.00002398691,0.00007266452,0.000045471603],"domain_scores_gemma":[0.99955136,0.00013015908,0.00003397822,0.00009985784,0.00015023195,0.000034439883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018248174,0.0005385443,0.00040563854,0.0007745543,0.00038825558,0.00048717816,0.0008863123,0.0003187131,0.005541633],"category_scores_gemma":[0.00058096374,0.00026490958,0.00026781863,0.0010200227,0.00018806764,0.00072114554,0.00044931716,0.00069872965,0.0009229207],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015999064,0.0004182279,0.004152272,0.00033623315,0.00013586343,0.00046791823,0.00025946353,0.022518372,0.5349567,0.027491288,0.01647505,0.3911887],"study_design_scores_gemma":[0.00020830942,0.0016171082,0.00806738,0.000059257418,0.00018986204,0.00081269,0.000087967106,0.5307078,0.41621834,0.014170518,0.027769232,0.00009166047],"about_ca_topic_score_codex":0.00094814505,"about_ca_topic_score_gemma":0.0022198004,"teacher_disagreement_score":0.005541633,"about_ca_system_score_codex":0.00040798285,"about_ca_system_score_gemma":0.00051181694,"threshold_uncertainty_score":0.018538594},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07510501831272712,"score_gpt":0.29030615653553093,"score_spread":0.21520113822280382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992374598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026309434,0.0010050697,0.9702027,0.00010088327,0.000039867184,0.00002776508,0.000025456957,0.00024640866,0.002042435],"genre_scores_gemma":[0.45665544,0.0010731039,0.53507316,0.000089468005,0.00008766787,0.00007169429,0.00006538394,0.000021272088,0.006862809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999718,0.000090448426,0.000010197948,0.000031086223,0.00013068844,0.000019446397],"domain_scores_gemma":[0.99980944,0.00009596594,0.000024015795,0.00002233618,0.00004105479,0.000007360957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032750468,0.00031125912,0.00021786803,0.0003255249,0.00019183877,0.0004753293,0.00047948072,0.00044303955,0.0012892061],"category_scores_gemma":[0.000720277,0.00015272711,0.00017521082,0.00028786802,0.0002706579,0.00030448032,0.00020805225,0.00033044873,0.00029487585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005202979,0.00007004516,0.0014066659,0.0003820461,0.00011031816,0.00040154773,0.00013998528,0.15907286,0.30852753,0.081068866,0.0020024427,0.4462974],"study_design_scores_gemma":[0.00007312543,0.0004624513,0.00096105336,0.000028401208,0.0000878716,0.00049863575,0.000024825256,0.85974866,0.11364247,0.008715724,0.015711525,0.000045240453],"about_ca_topic_score_codex":0.0010750971,"about_ca_topic_score_gemma":0.0026864097,"teacher_disagreement_score":0.0012892061,"about_ca_system_score_codex":0.00051583303,"about_ca_system_score_gemma":0.0005736475,"threshold_uncertainty_score":0.004312873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09692173878471042,"score_gpt":0.2912436106994541,"score_spread":0.19432187191474368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997564856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06909032,0.00079418725,0.924997,0.0002600368,0.00016755631,0.00016966015,0.0002611362,0.0014600729,0.002800071],"genre_scores_gemma":[0.62234735,0.00040494264,0.37119123,0.00026333475,0.00019324306,0.00016795141,0.00080309657,0.00009762076,0.0045312447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.0001014345,0.000036182835,0.000046441473,0.00031081436,0.000052064588],"domain_scores_gemma":[0.9991154,0.00036301246,0.00007799996,0.00022768063,0.0001791514,0.000036777972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043918623,0.00057522295,0.00050575973,0.0008586089,0.00034084602,0.0005306008,0.0005909731,0.0004726717,0.0023894452],"category_scores_gemma":[0.0016701245,0.00016814952,0.0002508924,0.00074143877,0.00028198835,0.0007792068,0.0008050002,0.00049254583,0.00057756604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010813462,0.00016808358,0.0009043758,0.0001460901,0.00006585318,0.00025138303,0.000084353305,0.040491518,0.21547455,0.012743506,0.0041477825,0.7244411],"study_design_scores_gemma":[0.00008131261,0.00045272676,0.0016915235,0.00003189113,0.00006523994,0.000655605,0.000025215813,0.807693,0.1794118,0.0045698714,0.0052845795,0.000037209666],"about_ca_topic_score_codex":0.0006714032,"about_ca_topic_score_gemma":0.0015315709,"teacher_disagreement_score":0.0023894452,"about_ca_system_score_codex":0.00032429732,"about_ca_system_score_gemma":0.0005635367,"threshold_uncertainty_score":0.00799346},"labels":[],"label_agreement":null},{"id":"W2000508287","doi":"10.1007/s11265-013-0807-6","title":"A Finite Volume Framework for Geometric Surface Processing","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Surface (topology); Noise reduction; Noise (video); Finite volume method; Computer science; Algorithm; Volume (thermodynamics); Mathematics; Iterative method; Covariance; Geometry processing; Computer vision; Polygon mesh; Artificial intelligence; Image (mathematics); Geometry; Theoretical computer science; Physics","score_opus":0.01875529911247307,"score_gpt":0.23767923933996488,"score_spread":0.21892394022749181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000508287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029563328,0.00008017004,0.99884063,0.00003427566,0.000015830348,0.000008268016,0.000025981943,0.00013870356,0.0005606317],"genre_scores_gemma":[0.07151283,0.00085845357,0.92060834,0.000121941695,0.00015225641,0.00014204641,0.000357742,0.0006893686,0.0055569997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00011985356,0.000027674687,0.00006224382,0.00029749575,0.000035352976],"domain_scores_gemma":[0.9994355,0.0002288387,0.000032933876,0.00009315912,0.00016846493,0.000041204697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499921,0.00095634494,0.0011399634,0.001618885,0.00057327887,0.0019681868,0.0026655267,0.0012354526,0.004891142],"category_scores_gemma":[0.0018650256,0.0007126494,0.0015594475,0.0013895875,0.001228391,0.0014680121,0.0017987397,0.0017106868,0.0021607091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053124924,0.000050583014,0.00017918508,0.00019059924,0.00005558128,0.00017809552,0.00014340092,0.38033974,0.016632406,0.4523824,0.005269675,0.14452522],"study_design_scores_gemma":[0.000007580612,0.000021750937,0.000037547892,0.000015906997,0.000009657002,0.00008594831,0.000016853406,0.9021294,0.0017780751,0.084546685,0.011335661,0.000014845444],"about_ca_topic_score_codex":0.0033967495,"about_ca_topic_score_gemma":0.0037172912,"teacher_disagreement_score":0.004891142,"about_ca_system_score_codex":0.0004940277,"about_ca_system_score_gemma":0.00085082307,"threshold_uncertainty_score":0.016362429},"labels":[],"label_agreement":null},{"id":"W2004826811","doi":"10.1007/s11265-014-0928-6","title":"Recent Advances in Design and Implementation of Signal Processing Systems","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Digital signal processing; Detector; Scalability; Signal processing; Efficient energy use; Baseband; Computer architecture; MIMO; Cognitive radio; Wireless; Embedded system; Electronic engineering; Computer hardware; Telecommunications; Channel (broadcasting); Bandwidth (computing); Engineering; Electrical engineering","score_opus":0.018311802471940444,"score_gpt":0.27891842224359464,"score_spread":0.2606066197716542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004826811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071354005,0.019735323,0.9592589,0.00076984643,0.00040506513,0.00006655766,0.000033599114,0.0006611592,0.011934178],"genre_scores_gemma":[0.23332642,0.03147889,0.71995485,0.0009093866,0.0012468094,0.00020609166,0.00023600283,0.00029444968,0.012347029],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987864,0.00035888405,0.0001083645,0.00019811871,0.00045472186,0.00009353424],"domain_scores_gemma":[0.99792296,0.0007881848,0.00015582897,0.000355441,0.00071590935,0.0000616695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014789151,0.0008953772,0.00071620377,0.00072301895,0.00034906203,0.0021900286,0.0018213999,0.0012014129,0.0059040175],"category_scores_gemma":[0.0036749158,0.00059314567,0.0004047594,0.00094882696,0.0005967046,0.0018807442,0.0008239979,0.0016988427,0.0026319968],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026235147,0.0002121228,0.0010871978,0.001299105,0.00008799565,0.00010606287,0.00015235433,0.041061208,0.052391168,0.078911,0.0038377747,0.8205916],"study_design_scores_gemma":[0.00015118223,0.0012027423,0.0018520858,0.0005416213,0.00027241156,0.001173649,0.00016293747,0.5079275,0.10207201,0.06523053,0.3192795,0.00013388768],"about_ca_topic_score_codex":0.0005790987,"about_ca_topic_score_gemma":0.0006464558,"teacher_disagreement_score":0.0059040175,"about_ca_system_score_codex":0.00063368294,"about_ca_system_score_gemma":0.00087575515,"threshold_uncertainty_score":0.019750893},"labels":[],"label_agreement":null},{"id":"W2005088936","doi":"10.1007/s11265-013-0731-9","title":"Guest Editors’ Introduction to Special Issue on Advances in DSP System Design","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.011774306167421419,"score_gpt":0.23948897562418384,"score_spread":0.22771466945676241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005088936","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051674887,0.023206014,0.018316481,0.013253186,0.92988604,0.000038856608,0.00014108924,0.00038044102,0.014261147],"genre_scores_gemma":[0.007852481,0.026717804,0.009178822,0.007305094,0.83422834,0.000058036974,0.00027220443,0.0006779983,0.11370923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986405,0.00017678017,0.0001472415,0.00018796287,0.00072047615,0.00012704116],"domain_scores_gemma":[0.99496305,0.0009004184,0.00020950094,0.00023411405,0.0030887146,0.0006042359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020179255,0.0016869499,0.001249963,0.0020867654,0.000652997,0.002712816,0.0012009472,0.0017623563,0.04335415],"category_scores_gemma":[0.0067811077,0.00055616704,0.0008554641,0.00088334753,0.0005446899,0.0016997576,0.001114367,0.0044863014,0.019732738],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009617326,0.000040055173,0.0001120622,0.0003881827,0.000028179538,0.000113592796,0.00001413706,0.00069099915,0.0011834805,0.0023407778,0.8868715,0.108120896],"study_design_scores_gemma":[0.000025141264,0.00012453113,0.00034191678,0.00013211188,0.00003580847,0.00033226798,0.00001352089,0.0020200254,0.0010028621,0.0022074615,0.993745,0.0000194639],"about_ca_topic_score_codex":0.0003383026,"about_ca_topic_score_gemma":0.0011364911,"teacher_disagreement_score":0.04335415,"about_ca_system_score_codex":0.0006822379,"about_ca_system_score_gemma":0.00096177304,"threshold_uncertainty_score":0.14503407},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.024023226017796464,"score_gpt":0.2834458679348129,"score_spread":0.25942264191701647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008272790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07759475,0.0005126137,0.9088607,0.00021580052,0.00024715427,0.00020213895,0.00012941063,0.0044978387,0.007739639],"genre_scores_gemma":[0.7286377,0.00013951714,0.26595905,0.00021281981,0.00006230204,0.0001138177,0.00017592826,0.00016782933,0.0045310706],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.000024176956,0.000023432056,0.000060729286,0.00010772755,0.000061187966],"domain_scores_gemma":[0.9995503,0.00009496097,0.000044205193,0.000062327184,0.00020039207,0.000047825113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028699933,0.0005406167,0.00041513407,0.0005380579,0.00041530252,0.00084078434,0.0014841598,0.00039708323,0.0035199698],"category_scores_gemma":[0.0007398651,0.00027638284,0.0002706035,0.0002538844,0.00021697351,0.00057898974,0.00045322394,0.0006071473,0.0010414475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009590706,0.0005849557,0.0035315733,0.00042095143,0.00020339407,0.0005860378,0.00038346308,0.046760388,0.5107832,0.012920608,0.009592017,0.41327438],"study_design_scores_gemma":[0.00015763077,0.0008187894,0.0020234527,0.000043433913,0.00012750145,0.00069736794,0.00008054694,0.68207973,0.28807878,0.0023299474,0.023512226,0.000050579398],"about_ca_topic_score_codex":0.0017465492,"about_ca_topic_score_gemma":0.0027851504,"teacher_disagreement_score":0.0035199698,"about_ca_system_score_codex":0.00052124984,"about_ca_system_score_gemma":0.0010497691,"threshold_uncertainty_score":0.011775494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015822678617420947,"score_gpt":0.24012969827369834,"score_spread":0.2243070196562774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014624009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34718826,0.0006677318,0.6366911,0.00077905477,0.00026985802,0.00012870172,0.000083342515,0.0025404482,0.011651576],"genre_scores_gemma":[0.97850966,0.000068231595,0.01941682,0.000084197105,0.000024815974,0.00002911559,0.000030405052,0.00003997614,0.0017967147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963844,0.00008043035,0.000024975445,0.00007393088,0.000075956705,0.000106243526],"domain_scores_gemma":[0.9990676,0.0002571369,0.000116199626,0.0002815384,0.00020393943,0.000073589305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005749086,0.0005372188,0.00045375762,0.0005114183,0.00069557934,0.00085667084,0.0012296706,0.00049362896,0.0030104234],"category_scores_gemma":[0.002392647,0.00022143434,0.00026049273,0.00035760674,0.00049399753,0.0011272405,0.0010816209,0.0008346344,0.00037663034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070575275,0.0003222416,0.0018387244,0.0001476267,0.00010723787,0.0004671737,0.00036572022,0.64643717,0.079368226,0.04955493,0.0061591053,0.21452604],"study_design_scores_gemma":[0.0000145928325,0.000092482056,0.00022378878,0.000006659851,0.000017544464,0.000078353965,0.000043976655,0.9809194,0.00596429,0.0116090905,0.001017701,0.0000121153635],"about_ca_topic_score_codex":0.00076984445,"about_ca_topic_score_gemma":0.0014482649,"teacher_disagreement_score":0.0030104234,"about_ca_system_score_codex":0.00050531735,"about_ca_system_score_gemma":0.0005135936,"threshold_uncertainty_score":0.01007086},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014614736333982997,"score_gpt":0.28849556446516805,"score_spread":0.2738808281311851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016433047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613201,0.002934552,0.37024286,0.00049077306,0.00061522814,0.00031578602,0.00070563436,0.008264077,0.055110898],"genre_scores_gemma":[0.88908845,0.00047125705,0.10099438,0.000106124244,0.00005552344,0.000058699614,0.00047404543,0.00007339964,0.008678171],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987745,0.0000211075,0.000008050203,0.000017946448,0.00004066215,0.0000346789],"domain_scores_gemma":[0.99990547,0.00002554837,0.000009677722,0.000020683308,0.000028835522,0.00000976878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011274157,0.00045885213,0.00025058424,0.00059016765,0.00030111574,0.0006532372,0.000600873,0.00024259639,0.006759877],"category_scores_gemma":[0.00029688576,0.00019008608,0.00018417822,0.00038908573,0.00012409028,0.00036331775,0.00018191437,0.00028526408,0.001128503],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024115136,0.00031917123,0.0029772138,0.00060385943,0.00015317026,0.0011679977,0.00017480402,0.03733817,0.28512964,0.020876937,0.016298959,0.6325486],"study_design_scores_gemma":[0.0013859402,0.00298355,0.008006365,0.0002503401,0.00030744146,0.0026468975,0.00025979689,0.4762054,0.42114133,0.010851699,0.07583758,0.00012362232],"about_ca_topic_score_codex":0.0015784003,"about_ca_topic_score_gemma":0.0034992162,"teacher_disagreement_score":0.006759877,"about_ca_system_score_codex":0.00036407774,"about_ca_system_score_gemma":0.00057885423,"threshold_uncertainty_score":0.022614062},"labels":[],"label_agreement":null},{"id":"W2017672001","doi":"10.1007/s11265-008-0267-6","title":"An Architecture for Programmable Multi-core IP Accelerated Platform with an Advanced Application of H.264 Codec Implementation","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Codec; Computer science; Field-programmable gate array; Computer architecture; Architecture; Embedded system; Encoding (memory); Computer hardware; Artificial intelligence","score_opus":0.07314810185829776,"score_gpt":0.3414394037843415,"score_spread":0.2682913019260438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017672001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2091581,0.0018260593,0.7198386,0.0006890828,0.00060633966,0.00063719106,0.0005559736,0.021700682,0.044987924],"genre_scores_gemma":[0.6741426,0.0005068094,0.29077235,0.00040365924,0.00014893535,0.0002037645,0.000875274,0.00033995023,0.032606676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.000016319898,0.000008119526,0.000024579083,0.00005730892,0.000032498705],"domain_scores_gemma":[0.99985254,0.000011290996,0.00000863818,0.000021420006,0.00009026997,0.000015916175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001794797,0.00035330688,0.00021766622,0.00042562443,0.0002973115,0.00046780918,0.0010636983,0.00036098663,0.006364816],"category_scores_gemma":[0.00025527595,0.00019165648,0.00019863104,0.00020927482,0.00011268234,0.00048471204,0.00023789304,0.00049317,0.0017150955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013039847,0.00027698482,0.0023244221,0.0004936357,0.00010113057,0.00099452,0.00020715578,0.01430288,0.5087261,0.01947685,0.038240325,0.41355193],"study_design_scores_gemma":[0.00041672064,0.0022855934,0.005186004,0.00014101893,0.00026252144,0.0020510242,0.00013611182,0.3730633,0.48536614,0.0068007796,0.12415685,0.00013410463],"about_ca_topic_score_codex":0.0019121751,"about_ca_topic_score_gemma":0.0032394582,"teacher_disagreement_score":0.006364816,"about_ca_system_score_codex":0.0003654346,"about_ca_system_score_gemma":0.0008045507,"threshold_uncertainty_score":0.021292448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00867406844215649,"score_gpt":0.2171119082575264,"score_spread":0.20843783981536992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025967251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06960386,0.0003015718,0.9204635,0.00028243187,0.00008089185,0.0001310015,0.00013592464,0.0009842989,0.00801647],"genre_scores_gemma":[0.55569834,0.00024296936,0.43652722,0.000111669324,0.00003498163,0.00025559825,0.00030566726,0.000065767315,0.0067577893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999348,0.000010799334,0.0000044920625,0.000015503389,0.000022466014,0.000011930267],"domain_scores_gemma":[0.99985945,0.0000269757,0.000010787055,0.000018646377,0.000075441385,0.000008640085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015295374,0.0002775672,0.00030467924,0.00033148998,0.00044492798,0.00044183104,0.0012597026,0.00044774672,0.0030159757],"category_scores_gemma":[0.00042153132,0.00017754982,0.00020226228,0.0003912911,0.00020008099,0.00058784377,0.00042548042,0.00031795164,0.00039311158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002557076,0.000087879125,0.001212788,0.00017354774,0.000070695336,0.00009591714,0.000099598605,0.7105182,0.019950679,0.03321225,0.0051778965,0.22914484],"study_design_scores_gemma":[0.000019259684,0.00003532547,0.00011951752,0.0000047652197,0.000012483596,0.000040551135,0.000014855447,0.9902845,0.003706704,0.0049071913,0.0008494032,0.0000053810204],"about_ca_topic_score_codex":0.0040381732,"about_ca_topic_score_gemma":0.007279957,"teacher_disagreement_score":0.0040381732,"about_ca_system_score_codex":0.00051930733,"about_ca_system_score_gemma":0.0010036248,"threshold_uncertainty_score":0.010089397},"labels":[],"label_agreement":null},{"id":"W2031177183","doi":"10.1007/s11265-009-0340-9","title":"On the Efficiency of Peer-to-Peer File Sharing","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"File sharing; Computer science; Upload; Peer-to-peer; Download; Bandwidth (computing); Computer network; Distributed computing; World Wide Web; The Internet","score_opus":0.022929231416888265,"score_gpt":0.2619962443118122,"score_spread":0.2390670128949239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031177183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38604575,0.008833187,0.5638885,0.0050671613,0.00047735043,0.00043326494,0.0008165526,0.0015855369,0.032852683],"genre_scores_gemma":[0.94425887,0.0015226793,0.049625818,0.00017561526,0.00030644436,0.0001469997,0.00026073458,0.00031401266,0.0033888665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9850412,0.006500884,0.00073605357,0.0013613603,0.0043961885,0.0019642625],"domain_scores_gemma":[0.78696585,0.17850687,0.0035807043,0.020576917,0.008729878,0.0016397886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013660657,0.0013889855,0.004251576,0.0032238169,0.002680955,0.0051518385,0.006650673,0.003317882,0.0058854944],"category_scores_gemma":[0.10761724,0.0009929413,0.0007837412,0.005497525,0.0040180925,0.013856532,0.0047065136,0.0020306846,0.0014180358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037860023,0.0006092045,0.0055680736,0.00047501238,0.00024687295,0.00034736015,0.00068142905,0.60901207,0.010588043,0.194147,0.011375191,0.16316372],"study_design_scores_gemma":[0.000119669385,0.00017447928,0.0008658506,0.000039316645,0.00009461194,0.00025842054,0.00019570743,0.9147954,0.004780835,0.07694401,0.0016796152,0.000052076157],"about_ca_topic_score_codex":0.0034742267,"about_ca_topic_score_gemma":0.0023963877,"teacher_disagreement_score":0.013660657,"about_ca_system_score_codex":0.00352095,"about_ca_system_score_gemma":0.003291975,"threshold_uncertainty_score":0.0722453},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010566772267949831,"score_gpt":0.24820924818032028,"score_spread":0.23764247591237045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041025829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.393401,0.0016948367,0.5666308,0.0008719489,0.0006194134,0.00067653996,0.00050859654,0.006583009,0.029013807],"genre_scores_gemma":[0.7607797,0.00033526885,0.22771648,0.00023314156,0.00008251649,0.00017395063,0.00044725224,0.000053046326,0.010178691],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998472,0.000022468801,0.000010566165,0.000030932013,0.000047460875,0.000041340325],"domain_scores_gemma":[0.99984586,0.000019705409,0.000021114141,0.000026087258,0.00007100902,0.000016222497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001558704,0.00038684517,0.00028449815,0.00058074284,0.0005606415,0.0006775974,0.0009856194,0.0005061561,0.0051246723],"category_scores_gemma":[0.00037122227,0.00024522026,0.00022338101,0.0005164588,0.00016362454,0.00044747387,0.00028085877,0.00035418724,0.0014219994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011005226,0.0003789284,0.003489166,0.0006903823,0.0002458324,0.0011802993,0.00035091164,0.021694591,0.501408,0.025617387,0.0126039265,0.43123996],"study_design_scores_gemma":[0.00086676324,0.0038532307,0.007141082,0.00019532308,0.00035550984,0.003646035,0.00025274538,0.30759394,0.59536505,0.009881812,0.07068638,0.00016206152],"about_ca_topic_score_codex":0.0015106121,"about_ca_topic_score_gemma":0.0034556328,"teacher_disagreement_score":0.0051246723,"about_ca_system_score_codex":0.0005079071,"about_ca_system_score_gemma":0.0011855942,"threshold_uncertainty_score":0.017143667},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07046605689061651,"score_gpt":0.29896674099339826,"score_spread":0.22850068410278174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043724059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032506452,0.000043809236,0.9938617,0.000038614573,0.000013562953,0.00010553672,0.00003174404,0.0011035884,0.0015508892],"genre_scores_gemma":[0.20492385,0.00020050307,0.7897821,0.0001450516,0.00004450729,0.0003844242,0.00030287536,0.0005469783,0.0036697814],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861836,0.00045022473,0.000108295644,0.0001477583,0.000575525,0.00009977224],"domain_scores_gemma":[0.9974208,0.0011042077,0.00020303261,0.0005368538,0.0006658161,0.000069241876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015032993,0.0011542679,0.0005381138,0.00093527755,0.00041473046,0.001132379,0.001896902,0.00072665163,0.0046316436],"category_scores_gemma":[0.003622594,0.00059492065,0.0009796461,0.0005073294,0.0006894361,0.0010508202,0.0010103297,0.0010315734,0.0012228494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032829514,0.00042948386,0.0023349063,0.0009421197,0.00020233239,0.0013663281,0.00043115637,0.17793074,0.124894604,0.07134841,0.00556477,0.6142268],"study_design_scores_gemma":[0.00013919128,0.0008666245,0.0009653566,0.00016109942,0.00024426784,0.0011080006,0.00009567718,0.8263353,0.09987254,0.051031653,0.01912962,0.00005069179],"about_ca_topic_score_codex":0.00069448247,"about_ca_topic_score_gemma":0.00075721316,"teacher_disagreement_score":0.0046316436,"about_ca_system_score_codex":0.0003173233,"about_ca_system_score_gemma":0.0010507501,"threshold_uncertainty_score":0.015494347},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036290406712347366,"score_gpt":0.28610341675711615,"score_spread":0.24981301004476877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057220308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01728657,0.00036970223,0.98010087,0.00009313647,0.00014954816,0.000025592484,0.000037787868,0.00083348685,0.0011033632],"genre_scores_gemma":[0.27862936,0.00038532927,0.7150351,0.00018655247,0.00015788159,0.00008219922,0.00023916809,0.00017888469,0.0051055234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994856,0.00013714802,0.000036315072,0.00009862371,0.00019097493,0.00005125741],"domain_scores_gemma":[0.9991972,0.0003599271,0.000045646426,0.00009845684,0.0002609435,0.000037843223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007292145,0.00076362916,0.0010683531,0.00052541104,0.00039706775,0.0008303619,0.00058827904,0.0011042594,0.001748032],"category_scores_gemma":[0.0020578592,0.00038946886,0.00057053566,0.00045726448,0.00023021549,0.0009854509,0.00094322686,0.00092218106,0.001392559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001511496,0.00018907175,0.00093493774,0.00017877256,0.00015888613,0.00015154762,0.000102646445,0.032792076,0.28393558,0.00394647,0.0016580537,0.67444044],"study_design_scores_gemma":[0.000084289175,0.00019029652,0.0027756721,0.00002113916,0.000107301,0.0004422274,0.000031320495,0.88454527,0.10631724,0.002354181,0.0030724886,0.00005860229],"about_ca_topic_score_codex":0.00092864764,"about_ca_topic_score_gemma":0.0028105583,"teacher_disagreement_score":0.001748032,"about_ca_system_score_codex":0.0002029258,"about_ca_system_score_gemma":0.0006820705,"threshold_uncertainty_score":0.005847752},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04485017147096986,"score_gpt":0.2844201616064039,"score_spread":0.239569990135434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059340091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24305232,0.0008887031,0.7309692,0.00019698557,0.0001968834,0.00014505108,0.00017418964,0.0047598784,0.019616865],"genre_scores_gemma":[0.7231498,0.00021316584,0.2669292,0.00018801058,0.000066254084,0.000079311336,0.00030391055,0.00022358984,0.008846815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968755,0.00005887253,0.0000249482,0.000053333537,0.000111116366,0.0000642364],"domain_scores_gemma":[0.99963284,0.00012604718,0.00005102518,0.00010424585,0.000068435955,0.000017439565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019955114,0.00077039923,0.0004172316,0.00071300025,0.00040655877,0.00088719313,0.0013284087,0.00034446022,0.0057329126],"category_scores_gemma":[0.00058635697,0.00026390626,0.00038028383,0.00066169456,0.0002375732,0.00065331353,0.00042416426,0.0005352502,0.0012937721],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011276396,0.00024529407,0.0008546708,0.00025513774,0.000117352996,0.00043673802,0.00015771345,0.017107213,0.37186822,0.033831287,0.0032649268,0.5707337],"study_design_scores_gemma":[0.00046763298,0.0018379275,0.002448904,0.000106705455,0.00040074677,0.0019747799,0.00013097913,0.4120599,0.5336289,0.016837966,0.029992571,0.00011289931],"about_ca_topic_score_codex":0.0007751842,"about_ca_topic_score_gemma":0.0023550282,"teacher_disagreement_score":0.0057329126,"about_ca_system_score_codex":0.00036616065,"about_ca_system_score_gemma":0.00049903983,"threshold_uncertainty_score":0.01917857},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.10456319697824266,"score_gpt":0.2586738773583835,"score_spread":0.1541106803801408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064553809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006682633,0.00056137604,0.9897838,0.00007013471,0.00017558786,0.00005284598,0.00008163764,0.0010038802,0.0015880215],"genre_scores_gemma":[0.106979065,0.0014610604,0.87132794,0.0002492933,0.00022283623,0.00013564472,0.00050377124,0.00012940445,0.018990941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00004228003,0.00002230048,0.00006885665,0.00017887379,0.000037708887],"domain_scores_gemma":[0.9997004,0.00006240103,0.00001723581,0.000064503285,0.0001402527,0.000015129763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003335391,0.0005343665,0.00074912974,0.0009963984,0.00039515606,0.0008686408,0.000705733,0.0009420656,0.0058608777],"category_scores_gemma":[0.00063145463,0.0003801209,0.0007539202,0.0007914052,0.00024166376,0.0007585822,0.00042960493,0.00062254135,0.0043712948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002388046,0.00017136334,0.00041886335,0.000116166055,0.00010806863,0.00015425796,0.000032298474,0.00955304,0.2979491,0.0035246431,0.0033678643,0.6843656],"study_design_scores_gemma":[0.000055610282,0.0006349104,0.0052092075,0.000050880997,0.0003210939,0.0016292497,0.00005934737,0.72247213,0.23864183,0.002841206,0.027976781,0.00010774496],"about_ca_topic_score_codex":0.0021417998,"about_ca_topic_score_gemma":0.0035068763,"teacher_disagreement_score":0.0058608777,"about_ca_system_score_codex":0.0002549007,"about_ca_system_score_gemma":0.00052215613,"threshold_uncertainty_score":0.01960653},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01903520241589814,"score_gpt":0.25077579199903705,"score_spread":0.2317405895831389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067412888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042684274,0.00037218488,0.9944596,0.000075494194,0.00004794069,0.000018512243,0.00003529175,0.00051844976,0.00020406286],"genre_scores_gemma":[0.15152152,0.00073543924,0.8424776,0.00015968487,0.00010611377,0.0001091029,0.0004598727,0.0005106404,0.0039199097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991411,0.00023883491,0.000059010566,0.0001843399,0.0002812277,0.000095542026],"domain_scores_gemma":[0.99868196,0.0005740947,0.00008484558,0.00019136116,0.00040071565,0.00006701303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019672718,0.00132085,0.0016599954,0.0015273142,0.00048815485,0.0015733751,0.0026971663,0.0028006795,0.0014808831],"category_scores_gemma":[0.0041312324,0.0012475871,0.0020876266,0.0014696508,0.0005933153,0.0022827727,0.0016247259,0.001834493,0.001284173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009407505,0.00018503668,0.0010807922,0.00024022287,0.00039422908,0.00011204926,0.00017001665,0.36100024,0.03611103,0.0113283,0.0038399734,0.5845974],"study_design_scores_gemma":[0.0000067781007,0.000020010259,0.00018292699,0.0000045084503,0.000028137993,0.00003291252,0.000005684857,0.9943455,0.0031112314,0.001583348,0.00066021644,0.00001871797],"about_ca_topic_score_codex":0.008861408,"about_ca_topic_score_gemma":0.011296773,"teacher_disagreement_score":0.008861408,"about_ca_system_score_codex":0.00077972637,"about_ca_system_score_gemma":0.0012356085,"threshold_uncertainty_score":0.01761967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02352298276305343,"score_gpt":0.2572750499648186,"score_spread":0.23375206720176517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068523583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033334352,0.0005327995,0.9635723,0.00012452698,0.0002101432,0.000042402127,0.00012802538,0.0012690438,0.0007862921],"genre_scores_gemma":[0.52174103,0.00045828667,0.47440296,0.00012650991,0.00015333708,0.00010089712,0.0004643468,0.00012705375,0.0024256117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.00031043735,0.000111432426,0.00030387778,0.0005418928,0.0001345948],"domain_scores_gemma":[0.9986797,0.00037707872,0.000091247006,0.00029944946,0.0005048164,0.00004781464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017115372,0.0009669592,0.0014401616,0.0009271645,0.00041236982,0.000983663,0.00079290994,0.00093291287,0.0018584472],"category_scores_gemma":[0.0034263267,0.00050020474,0.00102591,0.00089251436,0.00038225148,0.0014296767,0.0009875022,0.001120823,0.0012460486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013471987,0.00018243048,0.0017874208,0.00024745963,0.00020568074,0.0002655505,0.00016454366,0.030841583,0.2003834,0.002374995,0.002107751,0.760092],"study_design_scores_gemma":[0.00005996661,0.0006011821,0.0047930307,0.00004410067,0.00028053529,0.0009630585,0.00006567535,0.8173244,0.16519469,0.0042422083,0.0063322694,0.000098936616],"about_ca_topic_score_codex":0.00091763644,"about_ca_topic_score_gemma":0.0012255027,"teacher_disagreement_score":0.0018584472,"about_ca_system_score_codex":0.00024745715,"about_ca_system_score_gemma":0.0005315664,"threshold_uncertainty_score":0.009051561},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031948975350521276,"score_gpt":0.29427333874851663,"score_spread":0.26232436339799536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069839933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019622931,0.00038963178,0.9770494,0.00032512852,0.00016213885,0.00002289519,0.00012002172,0.0004915834,0.001816289],"genre_scores_gemma":[0.7107746,0.0009926837,0.27298036,0.00045678712,0.00034722587,0.00013041164,0.0005475962,0.00025331278,0.013517058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995129,0.00011316214,0.000039971528,0.00010702538,0.00014969989,0.00007731388],"domain_scores_gemma":[0.99583614,0.0026762055,0.0002574753,0.0005368047,0.00060209824,0.00009128513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013081253,0.0007886742,0.0009172125,0.0007503998,0.00074330746,0.0015414599,0.001142824,0.0014496256,0.0037258125],"category_scores_gemma":[0.0110229235,0.0006735656,0.0004505275,0.0009777136,0.0009880258,0.0020345526,0.001499787,0.0017754787,0.00094678515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054116483,0.000077465265,0.0013545745,0.0001561185,0.00011537878,0.00018738366,0.00016466237,0.5428022,0.011896966,0.21881801,0.005078257,0.21880776],"study_design_scores_gemma":[0.000010389842,0.000024147477,0.00009565507,0.000016208156,0.000011882762,0.000048091282,0.000007566092,0.9626614,0.0045833783,0.031857114,0.00067029457,0.000013857555],"about_ca_topic_score_codex":0.0040102513,"about_ca_topic_score_gemma":0.00576473,"teacher_disagreement_score":0.0040102513,"about_ca_system_score_codex":0.0008799399,"about_ca_system_score_gemma":0.0015957116,"threshold_uncertainty_score":0.012464106},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06478566272104326,"score_gpt":0.28143573147026696,"score_spread":0.2166500687492237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069850539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13579245,0.0009731825,0.85709894,0.00043860567,0.00026706504,0.00011604322,0.00066732045,0.0010239964,0.0036225093],"genre_scores_gemma":[0.61627185,0.0015597014,0.37430814,0.0001857568,0.00054057693,0.00014160272,0.0025338952,0.00014941972,0.0043090866],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996891,0.000062716455,0.000020578736,0.00006197284,0.00011007049,0.000055517037],"domain_scores_gemma":[0.9994791,0.00016920459,0.00005687955,0.00006135529,0.00018814456,0.00004538095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000465339,0.0005488555,0.0006579596,0.003165195,0.00031302232,0.0009106056,0.00043420566,0.0006273064,0.0018806],"category_scores_gemma":[0.0018042756,0.00015423493,0.00083941675,0.0018185715,0.0002663938,0.0008289997,0.0005696445,0.0006771052,0.0012396637],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055405515,0.0003156473,0.0046662088,0.00017537491,0.000100848025,0.00014268639,0.00012467995,0.01593016,0.11277917,0.0034660613,0.004694022,0.857051],"study_design_scores_gemma":[0.00006252204,0.00027319242,0.013714096,0.000046223602,0.000118686745,0.0004478631,0.00031002163,0.9576486,0.016453182,0.0073018973,0.003575716,0.000048013862],"about_ca_topic_score_codex":0.0014876497,"about_ca_topic_score_gemma":0.0018991864,"teacher_disagreement_score":0.003165195,"about_ca_system_score_codex":0.00018811696,"about_ca_system_score_gemma":0.00045109174,"threshold_uncertainty_score":0.0062912107},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029619153393336657,"score_gpt":0.33070118210275046,"score_spread":0.3010820287094138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071727855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801528,0.00056031946,0.90632856,0.0002941016,0.00029704615,0.00013138144,0.00021738204,0.0040123994,0.01014358],"genre_scores_gemma":[0.5315674,0.0003952413,0.4592222,0.000249386,0.00009933826,0.00011608681,0.00041546684,0.000099401186,0.007835457],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999608,0.00009438516,0.000025875966,0.000034653618,0.00017298361,0.00006408799],"domain_scores_gemma":[0.9991672,0.00035789495,0.000050225462,0.000104296,0.0002816108,0.000038821297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046047618,0.00057639444,0.00035329207,0.0006738087,0.00047623322,0.00095925236,0.00084264914,0.00055737037,0.005804342],"category_scores_gemma":[0.0017241859,0.00029459686,0.00026910944,0.00042367508,0.0002496442,0.0005527004,0.00053068146,0.000636113,0.0020291999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018888502,0.00035430607,0.0019229752,0.0004305227,0.00015442133,0.0004570656,0.0003134271,0.06535044,0.3112888,0.059556287,0.007173326,0.5511096],"study_design_scores_gemma":[0.00028323414,0.00070025364,0.0010043146,0.000071620394,0.000084148356,0.0007068066,0.000078179044,0.5764771,0.39284337,0.011211095,0.016463531,0.0000764038],"about_ca_topic_score_codex":0.0016791472,"about_ca_topic_score_gemma":0.003837774,"teacher_disagreement_score":0.005804342,"about_ca_system_score_codex":0.00047980598,"about_ca_system_score_gemma":0.0012390204,"threshold_uncertainty_score":0.019417405},"labels":[],"label_agreement":null},{"id":"W2076293269","doi":"10.1007/s11265-014-0930-z","title":"Latest Advances on Design and Implementation of DSP Systems","year":2014,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; BCH code; Implementation; Computer engineering; Error detection and correction; Digital signal processing; Embedded system; Computer architecture; Computer hardware; Algorithm","score_opus":0.020552999207606382,"score_gpt":0.2902257298881509,"score_spread":0.2696727306805445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076293269","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021500278,0.1675312,0.75830555,0.0020530557,0.002245462,0.00013794978,0.0002670424,0.001987926,0.045971602],"genre_scores_gemma":[0.21621498,0.19127037,0.5230429,0.0016369548,0.0027733634,0.00019764577,0.0013557987,0.0006815155,0.0628266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990139,0.0001447035,0.00010160784,0.00012457256,0.00053684093,0.000078358236],"domain_scores_gemma":[0.9984641,0.000362598,0.00009857009,0.0001921406,0.00082237483,0.00006024279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011600029,0.00078273506,0.00058665575,0.00094760326,0.00029429872,0.0013754023,0.001357631,0.00081777497,0.008570181],"category_scores_gemma":[0.0023746465,0.000512643,0.00043015034,0.0012137723,0.0003585253,0.0018401353,0.000574532,0.0013676423,0.0041383463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002764223,0.000076949684,0.0007458721,0.0018122696,0.000076204204,0.00011806216,0.00013624973,0.0070912666,0.052831184,0.017217008,0.008408068,0.9112105],"study_design_scores_gemma":[0.000100993006,0.00071195525,0.0022505291,0.0007523792,0.0003238539,0.0013042528,0.0001596215,0.061778888,0.12824881,0.014286278,0.7899857,0.000096664306],"about_ca_topic_score_codex":0.000937336,"about_ca_topic_score_gemma":0.001157709,"teacher_disagreement_score":0.008570181,"about_ca_system_score_codex":0.0005716382,"about_ca_system_score_gemma":0.0010295612,"threshold_uncertainty_score":0.028670132},"labels":[],"label_agreement":null},{"id":"W2082369791","doi":"10.1007/s11265-010-0489-2","title":"On MSE Exit Chart Analysis and Real Time DSP Implementation for Iterative (Turbo) Detection","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"National Science Council","keywords":"EXIT chart; Turbo; Computer science; Code division multiple access; Minimum mean square error; Single antenna interference cancellation; Algorithm; Additive white Gaussian noise; Equalization (audio); Multiuser detection; Data transmission; Detector; Real-time computing; Channel (broadcasting); Mathematics; Decoding methods; Telecommunications; Statistics; Computer hardware; Engineering","score_opus":0.012070180098965511,"score_gpt":0.30612703709610395,"score_spread":0.29405685699713846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082369791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005483219,0.00016794793,0.99199647,0.000047831385,0.000037427893,0.000017741757,0.000024331275,0.0009434544,0.0012814689],"genre_scores_gemma":[0.20438747,0.0005309908,0.7870587,0.000077135126,0.00013381834,0.00007007705,0.00022185816,0.00057400763,0.0069459495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00019600356,0.00004857007,0.000062994346,0.00030891734,0.000056789147],"domain_scores_gemma":[0.99789596,0.0011884349,0.00009568997,0.00024410785,0.0005374147,0.00003833219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010841391,0.0009485342,0.0005549579,0.0009930269,0.0003309983,0.0010803575,0.00069331535,0.0005237507,0.008321892],"category_scores_gemma":[0.0070712008,0.00029763536,0.0005280172,0.0008161441,0.00047492713,0.0014156833,0.00061702507,0.001135683,0.002009093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005566432,0.00015490051,0.0009943848,0.0001783479,0.000056910692,0.00026158552,0.00023681919,0.14373755,0.03964125,0.0646761,0.0070270095,0.7424785],"study_design_scores_gemma":[0.000014920376,0.00007474788,0.00045936872,0.000018839279,0.000012747282,0.0001267701,0.000020422036,0.9734135,0.01687032,0.006289116,0.002678764,0.000020520232],"about_ca_topic_score_codex":0.002913727,"about_ca_topic_score_gemma":0.004093828,"teacher_disagreement_score":0.008321892,"about_ca_system_score_codex":0.0004950756,"about_ca_system_score_gemma":0.0007478665,"threshold_uncertainty_score":0.027839482},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048431143471582686,"score_gpt":0.2589170760828741,"score_spread":0.21048593261129145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094505522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17682403,0.00077192317,0.8189004,0.00016360293,0.00011673446,0.000041917454,0.00012311967,0.0012082167,0.0018500926],"genre_scores_gemma":[0.6780674,0.000618032,0.31739077,0.00008871261,0.00009223622,0.00004623585,0.00035537296,0.000109311375,0.003232021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.000050121198,0.000017815466,0.00007676573,0.0001326145,0.000029432127],"domain_scores_gemma":[0.99941957,0.00017303499,0.00008387263,0.00012480275,0.00017350692,0.000025235371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034527245,0.00033091215,0.0005460755,0.0006953411,0.00018426853,0.0005667512,0.000382542,0.0005072629,0.0010490977],"category_scores_gemma":[0.0009546258,0.00022653998,0.00042009217,0.00062753365,0.00022513668,0.00089221,0.000404721,0.00037938455,0.0008458928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071424956,0.00017982666,0.0027064034,0.00010741126,0.00006461331,0.00015898488,0.000055762448,0.007519694,0.4321245,0.0011812845,0.0012897769,0.55389756],"study_design_scores_gemma":[0.000060828625,0.0005154622,0.017685233,0.000025228097,0.00016059793,0.0010064458,0.000056742545,0.64726067,0.32908276,0.0009109592,0.0031763518,0.00005871618],"about_ca_topic_score_codex":0.0004476688,"about_ca_topic_score_gemma":0.00068311975,"teacher_disagreement_score":0.0010490977,"about_ca_system_score_codex":0.00013981275,"about_ca_system_score_gemma":0.0002602951,"threshold_uncertainty_score":0.003509581},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04558453011064346,"score_gpt":0.28440707271804844,"score_spread":0.238822542607405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103372247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041693468,0.00030162177,0.9944061,0.000069728914,0.00009450794,0.000066285254,0.000049120674,0.0005814411,0.00026190188],"genre_scores_gemma":[0.062107604,0.00031225113,0.93372023,0.00019896103,0.00018589475,0.00031892804,0.0004219016,0.000097643926,0.0026366098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998992,0.00014358836,0.000095851,0.00030882037,0.00036441445,0.00009529901],"domain_scores_gemma":[0.9987488,0.00037577702,0.000076881035,0.00010427968,0.0006313832,0.00006286713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021733565,0.0010419651,0.0017653031,0.0016802961,0.00063332426,0.0011881505,0.0024374595,0.0018756535,0.0027902657],"category_scores_gemma":[0.0032076172,0.0005469942,0.0011144265,0.0019390935,0.00056766404,0.0017683392,0.0015621865,0.0017315372,0.0018887107],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002566603,0.00013933248,0.00050744036,0.00007577839,0.000119729215,0.000031569467,0.00003726791,0.021222338,0.022550141,0.0020766626,0.0035480482,0.94943506],"study_design_scores_gemma":[0.000074078285,0.00013125926,0.0008677383,0.000013310708,0.000063489235,0.000110972134,0.000018825587,0.98041266,0.012297245,0.0024026514,0.0035780745,0.000029755189],"about_ca_topic_score_codex":0.0042969654,"about_ca_topic_score_gemma":0.0046718693,"teacher_disagreement_score":0.0042969654,"about_ca_system_score_codex":0.00068566576,"about_ca_system_score_gemma":0.0010615244,"threshold_uncertainty_score":0.011493921},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01834471730071356,"score_gpt":0.2463816501045032,"score_spread":0.22803693280378962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105281355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35883167,0.0008561155,0.62207574,0.0005664827,0.00024026498,0.00022476743,0.00021838667,0.0016707433,0.015315879],"genre_scores_gemma":[0.93320245,0.0002716295,0.057034593,0.00019368845,0.00005677203,0.0000980944,0.00019602074,0.00018004043,0.00876675],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999863,0.000030053496,0.000008244605,0.000024219444,0.00004448295,0.000029984987],"domain_scores_gemma":[0.99960655,0.000083732055,0.00007791463,0.00002413641,0.00018076932,0.000026943273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022962905,0.00037108324,0.00019976647,0.00033493093,0.00039113316,0.0007528038,0.0009596723,0.0003086201,0.0021868765],"category_scores_gemma":[0.00057277473,0.00022553265,0.00015149542,0.00024621194,0.00014306139,0.0005971387,0.0003144026,0.00026772905,0.00040050436],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007206269,0.00038190428,0.0047946475,0.0007191419,0.00023616067,0.00060967804,0.0008780636,0.11004871,0.5540248,0.062395096,0.017161528,0.24802971],"study_design_scores_gemma":[0.00013807442,0.002157511,0.0023401675,0.000072879906,0.00020722089,0.0005387274,0.00044262552,0.69148946,0.2531127,0.012089458,0.037331454,0.00007980799],"about_ca_topic_score_codex":0.0009846545,"about_ca_topic_score_gemma":0.0049615223,"teacher_disagreement_score":0.0021868765,"about_ca_system_score_codex":0.00076078915,"about_ca_system_score_gemma":0.0008221787,"threshold_uncertainty_score":0.0073158145},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09840738497082493,"score_gpt":0.34384115141689625,"score_spread":0.24543376644607132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119245818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011829552,0.00021213121,0.9864926,0.00012695328,0.000025876361,0.000028520328,0.000047735237,0.00035356297,0.0008831344],"genre_scores_gemma":[0.2833367,0.0007547813,0.7105502,0.0001667343,0.00011236956,0.00018204484,0.00045459223,0.00059467927,0.0038478645],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947065,0.00018370981,0.000029621591,0.00010336053,0.00016299835,0.000049634185],"domain_scores_gemma":[0.9992055,0.00029902166,0.00013486925,0.00018972075,0.00013937677,0.000031534903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010848416,0.0007657821,0.00063800253,0.0013055843,0.00038154624,0.0013157098,0.0007277681,0.0010994435,0.002068472],"category_scores_gemma":[0.004450078,0.0006106674,0.00091423164,0.0012305962,0.00064573693,0.0019862745,0.0015168989,0.0011859563,0.0010787654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074683875,0.00018865525,0.0011115571,0.00030534403,0.00026078481,0.0002896022,0.00030201036,0.121591575,0.17630948,0.03429991,0.0048015625,0.65979266],"study_design_scores_gemma":[0.00006233995,0.00018454324,0.002032116,0.000042898195,0.00016565634,0.00071001315,0.00009564513,0.901092,0.057631355,0.03222862,0.005677043,0.00007773491],"about_ca_topic_score_codex":0.000641824,"about_ca_topic_score_gemma":0.0012449732,"teacher_disagreement_score":0.002068472,"about_ca_system_score_codex":0.00029656297,"about_ca_system_score_gemma":0.0006422281,"threshold_uncertainty_score":0.006919682},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.037205778785905176,"score_gpt":0.32079507271289875,"score_spread":0.28358929392699356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124989052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004626862,0.0007259677,0.9940469,0.000112681715,0.000029712874,0.000011062631,0.000008088555,0.000091569585,0.00034714074],"genre_scores_gemma":[0.26126438,0.0056643863,0.72657955,0.00022467514,0.00043039027,0.00012564202,0.0001307722,0.00051316654,0.005067077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870574,0.00069593976,0.00006550107,0.00016583859,0.0002932692,0.000073716656],"domain_scores_gemma":[0.99418986,0.0045595677,0.00020474094,0.00040112104,0.000554363,0.00009027974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038769247,0.0007985047,0.0011296899,0.0014294581,0.0005402793,0.0010352008,0.0010467462,0.0015109594,0.0013862158],"category_scores_gemma":[0.013333301,0.00046683804,0.00088362413,0.0016554499,0.0013069297,0.0014759284,0.0012917466,0.0015440697,0.0005725559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004702284,0.00018757053,0.0014731021,0.0005957671,0.00017706837,0.0005412283,0.000406456,0.25173873,0.06870777,0.10408073,0.0029359472,0.5686855],"study_design_scores_gemma":[0.0000113114,0.000042309697,0.00048836996,0.000029738883,0.000039965413,0.00012505692,0.00002752751,0.9678049,0.008166312,0.021240907,0.0019938839,0.000029697025],"about_ca_topic_score_codex":0.001909813,"about_ca_topic_score_gemma":0.0021475889,"teacher_disagreement_score":0.0038769247,"about_ca_system_score_codex":0.00037882273,"about_ca_system_score_gemma":0.00048188004,"threshold_uncertainty_score":0.020503402},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030504991756252802,"score_gpt":0.28912867807242326,"score_spread":0.25862368631617044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126177875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1646563,0.00018351965,0.8129747,0.00026201727,0.000104517894,0.00011111567,0.0001769921,0.0022034007,0.019327471],"genre_scores_gemma":[0.81785685,0.000098992285,0.17789261,0.00006921679,0.000018199595,0.00016059991,0.0001000638,0.00015356297,0.0036499042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998541,0.00004442083,0.000004745167,0.000019078214,0.00005879503,0.000018821615],"domain_scores_gemma":[0.999546,0.00029051528,0.000024878716,0.00006732421,0.000058513986,0.000012673885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002690671,0.0004176208,0.00036482353,0.00024596514,0.00034319234,0.00046631612,0.00072597887,0.0005654347,0.0045034606],"category_scores_gemma":[0.0012131516,0.00028362338,0.00032968534,0.00018738872,0.00043294334,0.00047645092,0.0003949561,0.00056518137,0.00038527168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011311062,0.00003894754,0.0003442792,0.000075049575,0.0000177723,0.000094040835,0.000072042436,0.93811727,0.011826216,0.030835843,0.00067122927,0.017794145],"study_design_scores_gemma":[0.000014709228,0.0000205272,0.00003808856,0.000003057195,0.000003345877,0.000011186915,0.000005885395,0.9921108,0.003332771,0.0036189982,0.000838442,0.0000022704676],"about_ca_topic_score_codex":0.0018326384,"about_ca_topic_score_gemma":0.0022878337,"teacher_disagreement_score":0.0045034606,"about_ca_system_score_codex":0.0003875611,"about_ca_system_score_gemma":0.0005823791,"threshold_uncertainty_score":0.015065551},"labels":[],"label_agreement":null},{"id":"W2131025090","doi":"10.1007/s11265-008-0275-6","title":"FPGA-Based Efficient Design Approaches for Large Size Two’s Complement Squarers","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Embedded Systems and FPGA Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Royal Military College of Canada","funders":"","keywords":"Stratix; Field-programmable gate array; Computer science; Operand; Reduction (mathematics); Realization (probability); Block (permutation group theory); Adder; Complement (music); Computer hardware; Embedded system; Algorithm; Arithmetic; Parallel computing; Mathematics; Latency (audio)","score_opus":0.07795409311327242,"score_gpt":0.26784948812433884,"score_spread":0.18989539501106642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131025090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037431832,0.000678579,0.94663626,0.00018173618,0.00011590422,0.00012144133,0.00004382754,0.0012384523,0.013552057],"genre_scores_gemma":[0.371826,0.000367199,0.61955273,0.00015509412,0.000076817,0.00012771865,0.00009242389,0.00012960848,0.007672348],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997156,0.00006562167,0.000015834066,0.000035416277,0.00012783775,0.000039531988],"domain_scores_gemma":[0.9996649,0.00012807446,0.00003676376,0.000054181084,0.00010301176,0.000013015642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029313576,0.00091944373,0.00039892894,0.00066572387,0.00044444285,0.0009188959,0.0009225888,0.0003899061,0.0061771274],"category_scores_gemma":[0.0006282275,0.00031015155,0.0003663497,0.00048560667,0.00025824833,0.0007040053,0.00040655563,0.0004764991,0.0010172292],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005022401,0.00018503449,0.0006093852,0.0005317588,0.000110112655,0.00040345298,0.00023098505,0.1327331,0.16956653,0.086645186,0.008202826,0.60027933],"study_design_scores_gemma":[0.00022389655,0.000850325,0.0004027495,0.00006387456,0.00009745245,0.0006911551,0.00012293558,0.8157133,0.1258353,0.02177811,0.034165636,0.00005523403],"about_ca_topic_score_codex":0.0011035932,"about_ca_topic_score_gemma":0.004486363,"teacher_disagreement_score":0.0061771274,"about_ca_system_score_codex":0.0006158885,"about_ca_system_score_gemma":0.0006884765,"threshold_uncertainty_score":0.020664573},"labels":[],"label_agreement":null},{"id":"W2146361684","doi":"10.1007/s11265-009-0410-z","title":"VLSI Implementation of an Adaptive Multiuser Detector for Multirate WCDMA Systems","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Institut National de la Recherche Scientifique","funders":"Max-Planck-Institut für Chemie; National Science Council","keywords":"Computer science; Signature (topology); Detector; Field-programmable gate array; Code division multiple access; Interference (communication); Single antenna interference cancellation; Multiuser detection; Very-large-scale integration; Rake receiver; Real-time computing; Computer hardware; Electronic engineering; Algorithm; Embedded system; Mathematics; Fading; Engineering; Telecommunications","score_opus":0.052737936812807126,"score_gpt":0.3550675711607952,"score_spread":0.30232963434798804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146361684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10755316,0.0011113506,0.8754336,0.00055283104,0.00051618,0.00012674977,0.00016150837,0.0031839437,0.011360684],"genre_scores_gemma":[0.63654745,0.00037817532,0.35314885,0.00044334432,0.00011176879,0.00007297689,0.00018681814,0.000058002857,0.009052626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998104,0.000035927802,0.000013278133,0.000030849867,0.00007493876,0.00003466751],"domain_scores_gemma":[0.99972814,0.00009161254,0.000018218712,0.000033309665,0.0001118127,0.00001684716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024042661,0.00026311688,0.00027093288,0.0004026136,0.0003493157,0.00085916906,0.0008608986,0.00058694993,0.004995473],"category_scores_gemma":[0.000713711,0.00026342637,0.00019459982,0.00027530457,0.00013474675,0.00045051525,0.00025551606,0.00041743336,0.0010886489],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000955962,0.00032411667,0.002107249,0.00027416623,0.00020793715,0.0004213666,0.00017911171,0.032553043,0.4513674,0.019508017,0.0071312375,0.48497042],"study_design_scores_gemma":[0.00025877048,0.0014058222,0.0025405649,0.0000724018,0.00017146098,0.0010723724,0.00006064647,0.6548774,0.30919823,0.004174614,0.02609667,0.00007104017],"about_ca_topic_score_codex":0.0014967117,"about_ca_topic_score_gemma":0.0036471426,"teacher_disagreement_score":0.004995473,"about_ca_system_score_codex":0.00041514222,"about_ca_system_score_gemma":0.0007318757,"threshold_uncertainty_score":0.016711473},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.034927058438292455,"score_gpt":0.30814392005397945,"score_spread":0.273216861615687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148632366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004859672,0.00016283902,0.99366426,0.00008111829,0.000028431456,0.000021924205,0.000029697414,0.0005322131,0.000619747],"genre_scores_gemma":[0.2311247,0.00024637574,0.7644196,0.00009861653,0.000057039175,0.00010835504,0.0002780464,0.00036023217,0.0033070887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987129,0.00037339548,0.0001117115,0.00012479017,0.0005778372,0.00009952252],"domain_scores_gemma":[0.997366,0.0014136863,0.00010921271,0.00038022263,0.0006545967,0.00007618912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021110876,0.0007571768,0.0009403716,0.0006597127,0.00046286004,0.0018654526,0.0012395143,0.0010759665,0.007105348],"category_scores_gemma":[0.011701913,0.0006445537,0.00046197075,0.000902398,0.0006700174,0.00249475,0.0018041597,0.0013321248,0.0015920071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007081271,0.00015455394,0.0012092049,0.00029752805,0.00009894055,0.00016003283,0.00019122504,0.34787518,0.016394513,0.075014904,0.006161439,0.5517344],"study_design_scores_gemma":[0.000031695177,0.00003789937,0.00015246306,0.000011944769,0.000008530511,0.000034203724,0.000014791841,0.9846058,0.004948647,0.009313888,0.00082907395,0.00001117514],"about_ca_topic_score_codex":0.0045217965,"about_ca_topic_score_gemma":0.0061980253,"teacher_disagreement_score":0.007105348,"about_ca_system_score_codex":0.0009246931,"about_ca_system_score_gemma":0.0018303659,"threshold_uncertainty_score":0.023769736},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.08558740047888537,"score_gpt":0.293905759405991,"score_spread":0.20831835892710565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163786726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02934953,0.00047097806,0.9677425,0.00005300778,0.00012136043,0.00002035156,0.00008702793,0.0010139938,0.0011412152],"genre_scores_gemma":[0.6631777,0.0007867978,0.3270794,0.000096774405,0.00010078795,0.00011272879,0.00078744406,0.00027839097,0.007579882],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974376,0.000060892024,0.00001616358,0.000079530495,0.000077258686,0.000022416225],"domain_scores_gemma":[0.99978393,0.00006602416,0.000009268396,0.00002948874,0.00010107396,0.000010203203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037969032,0.00039628986,0.00059574394,0.0002498154,0.00023499082,0.00032547401,0.00046379108,0.00045650842,0.0017545235],"category_scores_gemma":[0.0005862226,0.0002390027,0.0006575696,0.00028555634,0.00012044181,0.00041255323,0.0002842078,0.00062405795,0.0013276569],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057834125,0.00016423687,0.0023993156,0.00018560156,0.00022557989,0.00020405758,0.00015757149,0.1749005,0.19781826,0.0022077113,0.0034699035,0.6176889],"study_design_scores_gemma":[0.000005631265,0.00004652831,0.0015153607,0.0000070600777,0.00003705798,0.0001014968,0.000010568454,0.9800832,0.016510796,0.0003931045,0.0012738857,0.000015262525],"about_ca_topic_score_codex":0.003930071,"about_ca_topic_score_gemma":0.0048492323,"teacher_disagreement_score":0.003930071,"about_ca_system_score_codex":0.00015731607,"about_ca_system_score_gemma":0.00032350185,"threshold_uncertainty_score":0.007814348},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019551684461688784,"score_gpt":0.22739303859416862,"score_spread":0.20784135413247984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260407357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27258307,0.011659907,0.6444687,0.0028889773,0.0015478624,0.00018569911,0.00033928978,0.00025403043,0.06607243],"genre_scores_gemma":[0.9801523,0.003560449,0.009587517,0.00017759131,0.0006720675,0.00003271737,0.00008751089,0.00006830581,0.0056614843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932146,0.00026137373,0.000018751494,0.000064210486,0.00019607227,0.00013820626],"domain_scores_gemma":[0.99827266,0.0011985154,0.00006400458,0.00011888517,0.0002807877,0.00006520479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538804,0.0011659369,0.0009436179,0.0007247111,0.0007087367,0.0015865518,0.0007548281,0.00067987497,0.0033488905],"category_scores_gemma":[0.0053731794,0.0003406092,0.0004191785,0.0010701877,0.0008764334,0.0016683486,0.0010286557,0.000910445,0.00037606314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062376214,0.00014227018,0.0013206122,0.00027019,0.000092251496,0.00041089873,0.00013900393,0.79107326,0.0124500515,0.084413916,0.007238194,0.10182569],"study_design_scores_gemma":[0.0000046195732,0.00003588727,0.0004096757,0.000017923308,0.000020802945,0.000046865098,0.000040377858,0.9837875,0.00076589885,0.014075501,0.0007859992,0.000009032153],"about_ca_topic_score_codex":0.0034428942,"about_ca_topic_score_gemma":0.003717759,"teacher_disagreement_score":0.0034428942,"about_ca_system_score_codex":0.00083079323,"about_ca_system_score_gemma":0.00066455215,"threshold_uncertainty_score":0.01120317},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03401375944202923,"score_gpt":0.285097868185592,"score_spread":0.2510841087435628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301698642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019993579,0.0009202391,0.9718621,0.00039715465,0.00020736709,0.00009990962,0.00027661384,0.001346477,0.004896464],"genre_scores_gemma":[0.266853,0.0015299888,0.71388555,0.00044264246,0.00032356847,0.0002986918,0.00083609327,0.00032377837,0.015506659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990202,0.00025954726,0.000060938724,0.000087367895,0.00045630918,0.000115544266],"domain_scores_gemma":[0.99733174,0.0016158181,0.00018327752,0.00026626978,0.00052695227,0.00007590446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010554565,0.0011017343,0.00087225944,0.0009066685,0.0006010652,0.001870287,0.00075037015,0.0010812326,0.0066965357],"category_scores_gemma":[0.005590712,0.0005078747,0.0003383113,0.0008662513,0.0005562733,0.0016173397,0.0014671779,0.0016633533,0.0039522694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018131781,0.00018158308,0.0014082146,0.0006012474,0.00013976828,0.0004951347,0.00039846665,0.13426588,0.099130884,0.16614865,0.015248884,0.58016807],"study_design_scores_gemma":[0.00022042484,0.00026148828,0.00052019197,0.00013772724,0.00006816439,0.000653453,0.00009247768,0.83885956,0.08571673,0.057045855,0.01632793,0.00009593332],"about_ca_topic_score_codex":0.0013637813,"about_ca_topic_score_gemma":0.003991804,"teacher_disagreement_score":0.0066965357,"about_ca_system_score_codex":0.00064409676,"about_ca_system_score_gemma":0.0017385565,"threshold_uncertainty_score":0.022402108},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026458356493917392,"score_gpt":0.2559026675217106,"score_spread":0.2294443110277932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524478612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181724,0.0010493839,0.17620336,0.0004679509,0.00016453963,0.00027727894,0.0012715808,0.0010137627,0.0013796727],"genre_scores_gemma":[0.95107466,0.00016675805,0.046422742,0.00006649848,0.000059876522,0.00012948495,0.0014158871,0.000050875897,0.0006132917],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979264,0.000054105793,0.00002313669,0.00005643437,0.00002962811,0.000044044198],"domain_scores_gemma":[0.9996418,0.00018392308,0.000023524646,0.000021507965,0.00009890173,0.000030372541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009900404,0.0006273041,0.00091879827,0.0009296666,0.00043516324,0.00060028577,0.00045744673,0.0005063608,0.0013305652],"category_scores_gemma":[0.0016911774,0.00013465427,0.0009624542,0.0004975873,0.00012277417,0.00025793927,0.00033435543,0.0005192059,0.00032549322],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047183926,0.0011413943,0.11949991,0.00031379933,0.0010398327,0.00055621436,0.00019786696,0.025254073,0.06340285,0.0008347195,0.010738904,0.7723021],"study_design_scores_gemma":[0.0003306236,0.0009764108,0.19184484,0.00006116697,0.00085304765,0.0011609937,0.00022989593,0.7865637,0.013381409,0.0021944933,0.002344432,0.000059081256],"about_ca_topic_score_codex":0.0027431,"about_ca_topic_score_gemma":0.003443935,"teacher_disagreement_score":0.0027431,"about_ca_system_score_codex":0.00018347344,"about_ca_system_score_gemma":0.00046823543,"threshold_uncertainty_score":0.005454302},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043088716232324194,"score_gpt":0.3210319964322574,"score_spread":0.2779432801999332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549866851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19791546,0.00022689157,0.72603345,0.00048814956,0.0002517338,0.00014796396,0.00013138405,0.06019688,0.014608123],"genre_scores_gemma":[0.8906813,0.0000568351,0.09873686,0.00022542883,0.0000589438,0.00007623247,0.0002311957,0.003912723,0.006020469],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980234,0.0004896054,0.0001904491,0.00038150602,0.00065290777,0.00026214085],"domain_scores_gemma":[0.9843061,0.004672763,0.0007412679,0.007276755,0.0026017106,0.00040139555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017988279,0.0010740514,0.0004909828,0.0016010238,0.000679161,0.0020898995,0.0023949244,0.0010220547,0.009854978],"category_scores_gemma":[0.016243527,0.0007001591,0.0006758493,0.00067630643,0.00069072674,0.0045627775,0.0029262102,0.0021551421,0.0014083091],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001953192,0.0014899741,0.015552503,0.00045583618,0.00021848889,0.0010338076,0.0009025535,0.15581284,0.17924772,0.023355145,0.0118691735,0.6081087],"study_design_scores_gemma":[0.00022021105,0.00038003508,0.0016787606,0.000060626866,0.00012754419,0.00029212981,0.00007550274,0.8694078,0.09845328,0.019326232,0.009915656,0.000062301675],"about_ca_topic_score_codex":0.0018035595,"about_ca_topic_score_gemma":0.0031920946,"teacher_disagreement_score":0.009854978,"about_ca_system_score_codex":0.0006565637,"about_ca_system_score_gemma":0.000824923,"threshold_uncertainty_score":0.032968163},"labels":[],"label_agreement":null},{"id":"W2594907695","doi":"10.1007/s11265-017-1232-z","title":"A Modular Architecture for Structured Long Block-Length LDPC Decoders","year":2017,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Parallel computing; Block (permutation group theory); Modular design; Offset (computer science); Block size; Code (set theory); Interconnection; Clock rate; Decoding methods; Architecture; Computer hardware; Algorithm; Mathematics; Key (lock); Set (abstract data type); Computer network","score_opus":0.022702860753887704,"score_gpt":0.29026375036835284,"score_spread":0.2675608896144651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594907695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857738,0.00044882088,0.89948434,0.00024131754,0.00010588734,0.00013531603,0.00024182926,0.0033602424,0.0074048634],"genre_scores_gemma":[0.54180986,0.0003351681,0.4492033,0.0002099052,0.00010002989,0.00016884769,0.000433167,0.0001493517,0.0075903134],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998621,0.000025492987,0.000011031334,0.000030048079,0.000048466125,0.000022709075],"domain_scores_gemma":[0.9996402,0.000064244756,0.000041326726,0.00009949758,0.00012490842,0.000029794925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019158523,0.00041231792,0.00027287795,0.00046044588,0.00035210463,0.0005561276,0.0008603213,0.0004951528,0.0029624908],"category_scores_gemma":[0.0004796967,0.0002293829,0.0002584257,0.00031878633,0.00023260209,0.00060423755,0.00053930946,0.00051618024,0.0016855933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006832879,0.00018354684,0.0011646498,0.0004191776,0.00010220345,0.00035006634,0.0002061276,0.069512896,0.5742485,0.05930095,0.0058448534,0.28798375],"study_design_scores_gemma":[0.00018719013,0.0015363307,0.0016965278,0.00013081894,0.00017745674,0.0009109066,0.00006742516,0.5686526,0.36509922,0.029575573,0.031864796,0.00010124592],"about_ca_topic_score_codex":0.0005914129,"about_ca_topic_score_gemma":0.0019101887,"teacher_disagreement_score":0.0029624908,"about_ca_system_score_codex":0.000447681,"about_ca_system_score_gemma":0.0006878915,"threshold_uncertainty_score":0.009910524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028771086451306205,"score_gpt":0.2812319284293984,"score_spread":0.2524608419780922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744617995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01471656,0.00035410942,0.9777803,0.00011456367,0.00009951063,0.000056305493,0.00014262807,0.001921317,0.0048147533],"genre_scores_gemma":[0.15502557,0.00039358513,0.83283895,0.00010931038,0.00010881737,0.00013799744,0.000704491,0.00037364545,0.010307546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995252,0.000062817206,0.00003234453,0.000045567795,0.00028167674,0.000052428757],"domain_scores_gemma":[0.99950004,0.00021918994,0.000028057915,0.000095937794,0.00013378612,0.00002297598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037866354,0.0010940097,0.0008524952,0.0008569775,0.00044170197,0.0011310133,0.00061012025,0.00047670965,0.011870855],"category_scores_gemma":[0.0017484381,0.000377702,0.0005373404,0.0009366348,0.00028434195,0.0009710898,0.0007204957,0.0007460439,0.004765386],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005806697,0.00010366646,0.00067703804,0.00027032648,0.00009965115,0.0004033678,0.00017833603,0.038850773,0.13541348,0.028634116,0.009843728,0.78494483],"study_design_scores_gemma":[0.00013310148,0.00026591608,0.0012794014,0.000064374835,0.00009833643,0.00086547167,0.00009410032,0.80666727,0.14659812,0.01890309,0.024977123,0.000053698473],"about_ca_topic_score_codex":0.0017763544,"about_ca_topic_score_gemma":0.0049734768,"teacher_disagreement_score":0.011870855,"about_ca_system_score_codex":0.00042445632,"about_ca_system_score_gemma":0.0012128853,"threshold_uncertainty_score":0.03971201},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012473613175751378,"score_gpt":0.2494648621683075,"score_spread":0.2369912489925561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766216077","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017562874,0.00049983565,0.96667475,0.00026591856,0.0001949943,0.00009566497,0.00031272796,0.008197487,0.0061957864],"genre_scores_gemma":[0.268122,0.0005771928,0.70740706,0.00044080315,0.00025203606,0.00029067814,0.0011433209,0.0010642881,0.02070265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989961,0.00024104622,0.00006354432,0.00010099844,0.00046944214,0.00012885623],"domain_scores_gemma":[0.9975727,0.0009211641,0.00015027125,0.0005537191,0.00069749495,0.00010456444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273405,0.001055082,0.00071533024,0.0012980371,0.0008155789,0.0016877467,0.0014545975,0.0009877665,0.0108118635],"category_scores_gemma":[0.0032850294,0.00056783506,0.0004238203,0.0013425255,0.00050656544,0.0016091442,0.0021803405,0.0011022199,0.007740741],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017565172,0.00015358013,0.0012613066,0.00029552318,0.00009511665,0.0004317854,0.00022761055,0.047227807,0.090572484,0.07375551,0.019959154,0.7642636],"study_design_scores_gemma":[0.0003558684,0.0005003252,0.0008900643,0.00015402159,0.000100174264,0.0011144069,0.00012395911,0.7050239,0.19996406,0.047173504,0.044431612,0.0001680899],"about_ca_topic_score_codex":0.0015506484,"about_ca_topic_score_gemma":0.0037167754,"teacher_disagreement_score":0.0108118635,"about_ca_system_score_codex":0.00062915473,"about_ca_system_score_gemma":0.0016649535,"threshold_uncertainty_score":0.03616929},"labels":[],"label_agreement":null},{"id":"W2790071460","doi":"10.1007/s11265-018-1332-4","title":"A Rank Decomposed Statistical Error Compensation Technique for Robust Convolutional Neural Networks in the Near Threshold Voltage Regime","year":2018,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Semiconductor Research Corporation","keywords":"MNIST database; Computer science; Convolutional neural network; Redundancy (engineering); Estimator; Pattern recognition (psychology); Compensation (psychology); Artificial intelligence; Algorithm; Artificial neural network; Mathematics; Statistics","score_opus":0.0358262283067966,"score_gpt":0.2798921470510717,"score_spread":0.24406591874427508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790071460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070261653,0.00019359842,0.9916779,0.0000770187,0.000043213673,0.00001527237,0.00003198512,0.0003762929,0.0005585866],"genre_scores_gemma":[0.25878483,0.00039947307,0.73247606,0.0001287151,0.00011046405,0.00006488114,0.0002875116,0.00024986005,0.0074981316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995173,0.000093585644,0.000037151003,0.00007448849,0.00023401911,0.0000434432],"domain_scores_gemma":[0.9991804,0.00024214303,0.000096489304,0.00015251758,0.00029737214,0.00003099936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439763,0.0009390904,0.0006155015,0.000498625,0.00032851598,0.0006554561,0.0008856218,0.0008528108,0.0025048733],"category_scores_gemma":[0.0025197698,0.0003492541,0.000509017,0.00045931488,0.00040716864,0.0010686533,0.0007678936,0.0010976875,0.0008005991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044610893,0.0001363829,0.0006982189,0.00018708574,0.00012804488,0.00016407708,0.00009331086,0.26865983,0.14808819,0.028427793,0.004167083,0.5488038],"study_design_scores_gemma":[0.0000049320997,0.000043681674,0.00015804674,0.0000060847283,0.000009864994,0.000043905155,0.0000053526105,0.9820827,0.014871279,0.0020078102,0.0007560459,0.000010274184],"about_ca_topic_score_codex":0.0029468366,"about_ca_topic_score_gemma":0.0064595994,"teacher_disagreement_score":0.0029468366,"about_ca_system_score_codex":0.00041597887,"about_ca_system_score_gemma":0.0009191026,"threshold_uncertainty_score":0.008379698},"labels":[],"label_agreement":null},{"id":"W2791756387","doi":"10.1007/s11265-018-1338-y","title":"Performance Analysis of Mobile Multiuser Cooperative Networks with TAS Schemes","year":2018,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.02341813941893293,"score_gpt":0.2754403589934775,"score_spread":0.25202221957454457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791756387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42364702,0.003428244,0.53815454,0.001030651,0.00015577035,0.00016065127,0.00035221546,0.00055125065,0.03251965],"genre_scores_gemma":[0.9902744,0.00047878062,0.00733718,0.000052137028,0.00005116587,0.00003990019,0.000047256923,0.000027047945,0.0016920201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982291,0.0006901548,0.000051797113,0.00016056445,0.00043446108,0.0004339658],"domain_scores_gemma":[0.99286276,0.004495867,0.000576945,0.0003650679,0.001536337,0.00016307832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027621514,0.0012695343,0.0009729809,0.0011359801,0.00089487,0.0018508055,0.0010545147,0.0009380745,0.0030676648],"category_scores_gemma":[0.007918892,0.00040613575,0.0006536467,0.001590156,0.0012994775,0.0011673155,0.0014553755,0.00065794546,0.00041473046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004384541,0.00004926739,0.0017554763,0.0001387445,0.000094225274,0.00020111687,0.0001839755,0.919003,0.009816721,0.052885417,0.00083835074,0.014595247],"study_design_scores_gemma":[0.0000092807295,0.00012690996,0.00034742052,0.000015660435,0.000043119722,0.00008867562,0.00006414589,0.9926892,0.0013714285,0.0049001486,0.00033077865,0.000013218936],"about_ca_topic_score_codex":0.005581709,"about_ca_topic_score_gemma":0.0046418617,"teacher_disagreement_score":0.005581709,"about_ca_system_score_codex":0.002495265,"about_ca_system_score_gemma":0.0017716121,"threshold_uncertainty_score":0.018104434},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03184729412565777,"score_gpt":0.3307016108114475,"score_spread":0.2988543166857897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899428255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08719523,0.00067493727,0.8989258,0.00014769475,0.00012873716,0.00010869161,0.00014669567,0.0032098494,0.0094623575],"genre_scores_gemma":[0.4767263,0.00034914346,0.51487625,0.00013164083,0.000083339764,0.00011660462,0.0004461901,0.000280732,0.006989792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923897,0.00017147593,0.00007276053,0.00008249937,0.0002928552,0.00014142442],"domain_scores_gemma":[0.99898773,0.00039359572,0.000091421934,0.00021285043,0.000271127,0.000043154327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071236014,0.0007507685,0.00044707712,0.0009298101,0.0007822247,0.0015054137,0.0010898135,0.00047144483,0.007545966],"category_scores_gemma":[0.001589483,0.00044747323,0.00034369525,0.00095075986,0.0004579633,0.0015632333,0.0015606951,0.0007436554,0.0019941062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002304722,0.00019421222,0.0018159016,0.00042404176,0.00009684794,0.0004003508,0.00054324727,0.030751735,0.16869248,0.11766045,0.0059248395,0.67119116],"study_design_scores_gemma":[0.00023197496,0.001144148,0.0014662185,0.00014347839,0.00016505225,0.001003811,0.00039399875,0.36459184,0.5389886,0.055913527,0.03582793,0.00012942862],"about_ca_topic_score_codex":0.00097449124,"about_ca_topic_score_gemma":0.0025858865,"teacher_disagreement_score":0.007545966,"about_ca_system_score_codex":0.0005489309,"about_ca_system_score_gemma":0.0012745041,"threshold_uncertainty_score":0.025243819},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028940824194038685,"score_gpt":0.300909515127282,"score_spread":0.2719686909332433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947592526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022312324,0.0003380636,0.9817931,0.00012133078,0.00015990024,0.000074609066,0.00087082095,0.013389292,0.0010216715],"genre_scores_gemma":[0.05714193,0.00033343481,0.93119794,0.00033525692,0.00009079486,0.00037653456,0.0029956207,0.0021444978,0.005383986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989359,0.00027542308,0.0001271054,0.00026914274,0.000306551,0.0000860213],"domain_scores_gemma":[0.9978423,0.0011614414,0.00010768923,0.00032372941,0.0004679346,0.00009691786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026156239,0.0012120971,0.001615572,0.0013068694,0.00086220435,0.0020764314,0.0033399977,0.0017549719,0.022367831],"category_scores_gemma":[0.008734837,0.0013557173,0.0013436805,0.0017151322,0.0006103846,0.0033680915,0.0018526105,0.0036133905,0.007960944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015391597,0.0003260227,0.0014632088,0.0007960678,0.00039181404,0.000172339,0.000111119305,0.13138519,0.0053827497,0.032319438,0.054171838,0.771941],"study_design_scores_gemma":[0.00008724257,0.000041751526,0.00020514456,0.000048704875,0.00003996649,0.000038108956,0.000010411604,0.9592248,0.0054327715,0.02799296,0.006856767,0.000021422635],"about_ca_topic_score_codex":0.009297855,"about_ca_topic_score_gemma":0.013757323,"teacher_disagreement_score":0.022367831,"about_ca_system_score_codex":0.0011491434,"about_ca_system_score_gemma":0.0021020484,"threshold_uncertainty_score":0.07482785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Soft-decision decoder; Computer science; Decoding methods; Algorithm; Software; Sorting; Theoretical computer science","score_opus":0.029176133680983624,"score_gpt":0.28824625622597955,"score_spread":0.25907012254499595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997794147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01648255,0.00039649048,0.973056,0.0003190944,0.00018044797,0.00006754999,0.00032899395,0.0031477725,0.006021128],"genre_scores_gemma":[0.26329985,0.0007884119,0.7170093,0.0004447532,0.00020685945,0.00015881805,0.001292551,0.00048802883,0.01631144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993148,0.00016353276,0.000042248077,0.000063455154,0.00032668634,0.00008928978],"domain_scores_gemma":[0.9989641,0.00032154913,0.000057729918,0.00016839737,0.00043014326,0.000058044643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047080108,0.0008933469,0.00083380775,0.00083066896,0.0006371448,0.0014378054,0.00071478816,0.00083647046,0.0045426646],"category_scores_gemma":[0.0018880122,0.0003592094,0.0003963335,0.0010960653,0.00041356895,0.0009214854,0.0017788766,0.00084256567,0.004589254],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015485405,0.0001786272,0.0015639549,0.00045255906,0.00013033,0.00071081554,0.0002861616,0.112684265,0.12087021,0.11838763,0.02579593,0.61739105],"study_design_scores_gemma":[0.00013442153,0.0003339529,0.0004154444,0.0000807973,0.000062935615,0.0007916735,0.000073156436,0.831873,0.113855526,0.028883638,0.023417873,0.0000776423],"about_ca_topic_score_codex":0.0023874852,"about_ca_topic_score_gemma":0.0043604793,"teacher_disagreement_score":0.0045426646,"about_ca_system_score_codex":0.000540609,"about_ca_system_score_gemma":0.0024962302,"threshold_uncertainty_score":0.0151968},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01574898870569315,"score_gpt":0.2521758610143998,"score_spread":0.23642687230870665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103043697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09354854,0.0018316446,0.8743999,0.000634511,0.00045667257,0.00013586122,0.00036925383,0.0078601325,0.020763518],"genre_scores_gemma":[0.6835148,0.001206586,0.2776716,0.00058080215,0.00030327408,0.000098293654,0.0006757444,0.00047001409,0.035478823],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953485,0.000091378795,0.000027995413,0.000059354355,0.00021470345,0.00007175661],"domain_scores_gemma":[0.9985972,0.0005228299,0.000117399184,0.00023061219,0.00047257982,0.00005932775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035899493,0.0006658314,0.00044570485,0.00073716545,0.00051319186,0.0014412071,0.0008157266,0.00058774935,0.011243415],"category_scores_gemma":[0.0021515172,0.0003112407,0.00020349331,0.0007297707,0.0002881168,0.0012700163,0.00087118056,0.0007394507,0.004377101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021928872,0.00019223127,0.003121037,0.00048331913,0.00010259043,0.00044871925,0.00020965045,0.02531139,0.24597661,0.061570056,0.012982,0.6474095],"study_design_scores_gemma":[0.00026793615,0.00077371823,0.0016363083,0.00018231016,0.00015827315,0.0015250926,0.00019371866,0.4893629,0.43031994,0.024329131,0.051146973,0.00010368775],"about_ca_topic_score_codex":0.0012371859,"about_ca_topic_score_gemma":0.004223606,"teacher_disagreement_score":0.011243415,"about_ca_system_score_codex":0.0005151324,"about_ca_system_score_gemma":0.001427793,"threshold_uncertainty_score":0.037612915},"labels":[],"label_agreement":null},{"id":"W3127689544","doi":"10.1007/s11265-020-01631-1","title":"Deep Unfolded Extended Conjugate Gradient Method for Massive MIMO Processing with Application to Reciprocity Calibration","year":2021,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Conjugate gradient method; Algorithm; Residual; Computer science; Backpropagation; MIMO; Reciprocity (cultural anthropology); Calibration; Mathematical optimization; Mathematics; Artificial intelligence; Artificial neural network; Channel (broadcasting); Statistics","score_opus":0.011986529524214576,"score_gpt":0.2507253372033772,"score_spread":0.2387388076791626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127689544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003473042,0.00011748942,0.9952598,0.000101266756,0.000028492375,0.000013203211,0.00003798594,0.00024418804,0.00072455755],"genre_scores_gemma":[0.14441967,0.00037008975,0.84836763,0.00019307052,0.00008231863,0.00010166884,0.00031015364,0.00024232107,0.0059130443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997197,0.00011367308,0.000012912598,0.000045873752,0.000081448256,0.000026485533],"domain_scores_gemma":[0.9993855,0.0002928518,0.00004335333,0.000115566334,0.00012731673,0.000035356705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008207686,0.0010153005,0.0008471758,0.00035212323,0.0003783352,0.00077330164,0.0009258686,0.0012593847,0.0036435921],"category_scores_gemma":[0.002398866,0.00049462303,0.0006792772,0.0005983157,0.00080735126,0.0012924167,0.0017903552,0.0016790862,0.0012796688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027665775,0.00014707413,0.0005478696,0.00022562519,0.00013476987,0.00017846124,0.00019245518,0.62126815,0.029312858,0.07447604,0.006742367,0.26649767],"study_design_scores_gemma":[0.000005428819,0.000018913595,0.0000483335,0.000004956846,0.0000034894965,0.000023212728,0.0000062635318,0.98944926,0.0016181082,0.007853604,0.00096067425,0.000007809392],"about_ca_topic_score_codex":0.0016225977,"about_ca_topic_score_gemma":0.0028737795,"teacher_disagreement_score":0.0036435921,"about_ca_system_score_codex":0.00034943692,"about_ca_system_score_gemma":0.0012075952,"threshold_uncertainty_score":0.01218909},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013587254431149475,"score_gpt":0.26004785592222374,"score_spread":0.24646060149107427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198896842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086400155,0.0005334561,0.98637044,0.00011176612,0.0001398543,0.000017448267,0.00021984613,0.002677175,0.0012898943],"genre_scores_gemma":[0.50926614,0.0009360197,0.47651052,0.00036774596,0.00020376469,0.00015650426,0.0013677004,0.0005825346,0.01060909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997614,0.000041381703,0.000013922568,0.00007131472,0.00005776261,0.000054166056],"domain_scores_gemma":[0.9997694,0.000074831565,0.000015916765,0.00004004612,0.00008386846,0.00001585955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003711515,0.0010644307,0.00078147254,0.00040702467,0.00024660572,0.00064222387,0.0014797174,0.0010002847,0.005437325],"category_scores_gemma":[0.0010029639,0.00038760746,0.0005719158,0.00073002843,0.00021428702,0.0015464622,0.0011908471,0.0013853085,0.0021346675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038211606,0.00013978065,0.0004117281,0.00019810643,0.00009066548,0.00013532533,0.00010336377,0.12679814,0.033965237,0.005160528,0.008666204,0.8239489],"study_design_scores_gemma":[0.000009711381,0.000043820848,0.00015454681,0.000011164244,0.000018315444,0.000037295576,0.000019856952,0.9895432,0.0060866848,0.0023650546,0.0016997014,0.0000106921925],"about_ca_topic_score_codex":0.0058802464,"about_ca_topic_score_gemma":0.011752884,"teacher_disagreement_score":0.0058802464,"about_ca_system_score_codex":0.0002868169,"about_ca_system_score_gemma":0.000820588,"threshold_uncertainty_score":0.018189609},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02525561520820731,"score_gpt":0.2605640449131329,"score_spread":0.23530842970492558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210268934","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079480475,0.00007653581,0.99112284,0.000047008445,0.0000195818,0.000007861753,0.0000118732805,0.000056916793,0.000709378],"genre_scores_gemma":[0.37438366,0.00058447255,0.6174766,0.00013540809,0.00010070633,0.00009701936,0.00013246122,0.00015021737,0.0069394694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996012,0.000116594456,0.000018494602,0.000079342804,0.00014524635,0.00003916783],"domain_scores_gemma":[0.9993512,0.00022459251,0.000083671715,0.000102939855,0.00019658403,0.000041043648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079069735,0.0006025847,0.0006775477,0.00059099536,0.00027990632,0.00087874715,0.000714669,0.0011987945,0.0016861237],"category_scores_gemma":[0.0022176944,0.00029286617,0.0009670141,0.0006878734,0.0006859668,0.0013473782,0.0010223128,0.0011612799,0.0005025795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000360338,0.000099149336,0.0011522917,0.00025039585,0.00017183468,0.00029914462,0.00023564667,0.15783824,0.11350542,0.5089792,0.002354186,0.21475416],"study_design_scores_gemma":[0.000027894066,0.00004845642,0.00031956498,0.000009467634,0.00002742965,0.00018312095,0.000015924405,0.93288267,0.009764728,0.054741677,0.0019529642,0.00002614237],"about_ca_topic_score_codex":0.0008281522,"about_ca_topic_score_gemma":0.000848415,"teacher_disagreement_score":0.0016861237,"about_ca_system_score_codex":0.0004463326,"about_ca_system_score_gemma":0.00054319337,"threshold_uncertainty_score":0.005640626},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016864744375231267,"score_gpt":0.23390020479214968,"score_spread":0.2170354604169184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207078582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053839706,0.0017859858,0.92623895,0.0006831132,0.0005179474,0.00014908637,0.0015916565,0.0073545356,0.007839098],"genre_scores_gemma":[0.64484656,0.001410446,0.3233528,0.00097774,0.00031513744,0.0002647818,0.008891776,0.00070661324,0.019234043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.000050422525,0.000013935729,0.00010511363,0.000111135574,0.00006966649],"domain_scores_gemma":[0.9993705,0.00013079349,0.000057690926,0.00013364917,0.00021081888,0.000096508404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088214,0.0013472345,0.0007621828,0.00069456163,0.00043974022,0.00080782146,0.0025732582,0.0012328306,0.0037902903],"category_scores_gemma":[0.0019783878,0.00042897963,0.0005277809,0.0010065928,0.0006485386,0.001895476,0.0017127066,0.0014491425,0.0014576314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010107578,0.0003259158,0.0027901276,0.00029751993,0.00023195527,0.0004286502,0.00006623314,0.21486658,0.026309721,0.016281886,0.05528203,0.6821087],"study_design_scores_gemma":[0.00002275881,0.00011736328,0.00040230883,0.000013081231,0.000031891497,0.000088839275,0.000011592125,0.98450327,0.0073115537,0.0030770095,0.00440015,0.000020105852],"about_ca_topic_score_codex":0.012255108,"about_ca_topic_score_gemma":0.019125901,"teacher_disagreement_score":0.012255108,"about_ca_system_score_codex":0.0007396653,"about_ca_system_score_gemma":0.0019607926,"threshold_uncertainty_score":0.024367511},"labels":[],"label_agreement":null},{"id":"W4210377634","doi":"10.1007/s11265-021-01735-2","title":"Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes","year":2022,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; Intel Corporation","keywords":"Computer science; Fixed point; Lattice (music); Decoding methods; Arithmetic; Algorithm; Mathematics; Physics; Mathematical analysis; Acoustics","score_opus":0.02383310801065427,"score_gpt":0.3114317446696866,"score_spread":0.28759863665903235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210377634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0897157,0.00023324153,0.8948139,0.00020318151,0.000117187956,0.00011640925,0.0001996585,0.00538303,0.009217732],"genre_scores_gemma":[0.59094584,0.000116663745,0.4036516,0.00010933498,0.000023613753,0.000070307164,0.0002741853,0.00008217945,0.0047262404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975365,0.000042365304,0.000013099537,0.000029478064,0.00012898102,0.000032498127],"domain_scores_gemma":[0.9997104,0.00008114985,0.00002143198,0.00004535242,0.00012249137,0.000019101724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022133386,0.00025003843,0.00026877303,0.00035869438,0.00031425006,0.0005731797,0.0009452376,0.00037801522,0.0033086718],"category_scores_gemma":[0.0007177472,0.00014465561,0.00017132191,0.0002975806,0.0002398981,0.00036051666,0.0002664906,0.00044305413,0.0011827664],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009165587,0.00026232452,0.0029681062,0.00034305349,0.000094624804,0.0006816391,0.00024698328,0.23128971,0.31901136,0.04244489,0.008325388,0.39341542],"study_design_scores_gemma":[0.00007345196,0.00026238442,0.0004274337,0.0000213238,0.000014419326,0.00023998338,0.000020297814,0.869922,0.11945513,0.0020148088,0.007517404,0.00003136109],"about_ca_topic_score_codex":0.0046202084,"about_ca_topic_score_gemma":0.0061646346,"teacher_disagreement_score":0.0046202084,"about_ca_system_score_codex":0.00077919045,"about_ca_system_score_gemma":0.0013045328,"threshold_uncertainty_score":0.011068642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.061445300657523155,"score_gpt":0.3143183680113405,"score_spread":0.2528730673538173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303645613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01628911,0.000937521,0.698991,0.000653991,0.0005670507,0.00024221474,0.005967954,0.26271057,0.013640519],"genre_scores_gemma":[0.3310664,0.00043441908,0.608621,0.0010741163,0.0001866667,0.00049098465,0.011940261,0.013228263,0.032957885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.00008453614,0.000022808472,0.00018308405,0.00019894178,0.000079873425],"domain_scores_gemma":[0.99918455,0.00030480363,0.000047990427,0.00017698463,0.00021266652,0.00007300031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007270032,0.0020601598,0.000940843,0.0008418723,0.0008283636,0.0013742422,0.0032639569,0.0012015736,0.034638923],"category_scores_gemma":[0.0035394717,0.0014697823,0.0008136429,0.00075791386,0.0004372498,0.0015780764,0.0014144529,0.0023956276,0.012261211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00281455,0.00049595395,0.0056020576,0.00079274806,0.0006214451,0.00044709374,0.00023825199,0.15311304,0.024899798,0.01306695,0.30667332,0.49123484],"study_design_scores_gemma":[0.00018795284,0.00009488232,0.00089476025,0.000028259159,0.000047917896,0.00006067004,0.000030545474,0.9480112,0.016617507,0.011603755,0.022361549,0.00006106115],"about_ca_topic_score_codex":0.01277894,"about_ca_topic_score_gemma":0.025707606,"teacher_disagreement_score":0.034638923,"about_ca_system_score_codex":0.0009784694,"about_ca_system_score_gemma":0.0026736038,"threshold_uncertainty_score":0.1158787},"labels":[],"label_agreement":null},{"id":"W4366984249","doi":"10.1007/s11265-023-01865-9","title":"A Triplet-loss Dilated Residual Network for High-Resolution Representation Learning in Image Retrieval","year":2023,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Artificial intelligence; Computer science; Residual; Image retrieval; Pooling; Pattern recognition (psychology); Convolutional neural network; Robustness (evolution); Precision and recall; Computer vision; Image (mathematics); Algorithm","score_opus":0.02947200411002551,"score_gpt":0.31594214127914405,"score_spread":0.28647013716911857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366984249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016647186,0.0007799113,0.9799658,0.00019961101,0.000106617495,0.000050589413,0.000111094225,0.0009577834,0.0011813621],"genre_scores_gemma":[0.46342206,0.0011251557,0.5190229,0.00050373876,0.00021266147,0.0001931655,0.00117594,0.00027433728,0.014070083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996654,0.000074831194,0.000020186,0.000099379075,0.0000902251,0.00005001337],"domain_scores_gemma":[0.99956864,0.0001287894,0.00003915165,0.000074953656,0.00015126044,0.000037196125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010000037,0.0007748153,0.0011305743,0.00054843375,0.0003531964,0.0006539047,0.0019824726,0.0016386939,0.0036819635],"category_scores_gemma":[0.0017408205,0.0004097465,0.00061615504,0.0008115283,0.0005097769,0.0015094315,0.0012358273,0.0014710348,0.0013512464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004129869,0.00030722996,0.0006117939,0.00016700967,0.0001311154,0.00013050427,0.00007213414,0.26093203,0.031899743,0.010097854,0.010430857,0.6848067],"study_design_scores_gemma":[0.000007535787,0.00006213362,0.00007933048,0.0000047063486,0.000012358307,0.000027074466,0.000004507164,0.9956196,0.0023054844,0.0012683148,0.0006030257,0.000005889246],"about_ca_topic_score_codex":0.006155477,"about_ca_topic_score_gemma":0.006494964,"teacher_disagreement_score":0.006155477,"about_ca_system_score_codex":0.0005443471,"about_ca_system_score_gemma":0.00080911303,"threshold_uncertainty_score":0.012317359},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Biometrics; Artificial intelligence; Preprocessor; Convolutional neural network; Identification (biology); Fingerprint (computing); Segmentation; Pattern recognition (psychology); Matching (statistics); Architecture; Deep learning; Computer vision; Machine learning","score_opus":0.044774177126011165,"score_gpt":0.2497754268995254,"score_spread":0.20500124977351422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367316159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015042977,0.00029669824,0.9823142,0.00016375999,0.00008899139,0.000027434095,0.000095718235,0.0008355221,0.0011348004],"genre_scores_gemma":[0.6959891,0.0007251509,0.28730568,0.00045187844,0.0001416054,0.00012631477,0.0004920766,0.00019545776,0.014572707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.000032938806,0.000011460718,0.00007645957,0.00009119326,0.000047439207],"domain_scores_gemma":[0.9997296,0.00006197713,0.000025794401,0.000048826136,0.00010804055,0.000025788375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045567757,0.000503426,0.0009200786,0.00054016785,0.0003458396,0.0007426784,0.0015402656,0.0011419593,0.0027599891],"category_scores_gemma":[0.0008648068,0.00041883878,0.0007693967,0.0007205829,0.00030734198,0.0012756718,0.0011337304,0.0014275863,0.0010781336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031994557,0.00024937117,0.0013329637,0.00010394475,0.00014603039,0.000110589426,0.00003968089,0.40309826,0.030172361,0.011672686,0.004011337,0.54874283],"study_design_scores_gemma":[0.000003007054,0.000017765246,0.00010242701,0.0000025939487,0.000008624541,0.000017771057,0.0000013914643,0.9968876,0.001620144,0.0010566161,0.0002767925,0.0000052334335],"about_ca_topic_score_codex":0.006735285,"about_ca_topic_score_gemma":0.0063446336,"teacher_disagreement_score":0.006735285,"about_ca_system_score_codex":0.00059004925,"about_ca_system_score_gemma":0.00091208523,"threshold_uncertainty_score":0.01339221},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0173303216200356,"score_gpt":0.26987073865787486,"score_spread":0.25254041703783925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385320790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9741666,0.00015724788,0.004404984,0.00086447306,0.000017691857,0.00011268587,0.00042536773,0.000103148115,0.019747881],"genre_scores_gemma":[0.9880001,0.000090181056,0.0027801576,0.00003800233,0.0000062706627,0.000031604734,0.00020653835,0.000017144042,0.008829965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999318,0.00028701703,0.000029481069,0.00006221525,0.00010238339,0.00020102168],"domain_scores_gemma":[0.9984628,0.0006963526,0.0001369694,0.00016563595,0.00028885523,0.00024936238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374682,0.0002549814,0.00024481217,0.00057554955,0.0017253846,0.0013284943,0.0008353637,0.0015220236,0.006745162],"category_scores_gemma":[0.0018839478,0.000119403834,0.00021468275,0.0010316868,0.00082525716,0.0012792959,0.0010501131,0.0005843911,0.0005827625],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029967746,0.0028455446,0.13761476,0.0009957044,0.00024442078,0.0552272,0.009513752,0.45549023,0.034103304,0.11229113,0.034121823,0.15455535],"study_design_scores_gemma":[0.00076354627,0.0018652712,0.06044237,0.0003933362,0.00020354486,0.00564268,0.034741,0.6521402,0.041141506,0.03596582,0.16653544,0.0001652378],"about_ca_topic_score_codex":0.03039485,"about_ca_topic_score_gemma":0.03795712,"teacher_disagreement_score":0.03039485,"about_ca_system_score_codex":0.0019037232,"about_ca_system_score_gemma":0.0014550955,"threshold_uncertainty_score":0.06043589},"labels":[],"label_agreement":null},{"id":"W4385381666","doi":"10.1007/s11265-023-01885-5","title":"The Good, the Bad and the Ugly: Practices and Perspectives on Hardware Acceleration for Embedded Image Processing","year":2023,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hardware acceleration; Bespoke; Design space exploration; Acceleration; Image processing; Software deployment; Computer engineering; Process (computing); Partition (number theory); Application-specific integrated circuit; Computer hardware; Embedded system; Computer architecture; Artificial intelligence; Image (mathematics); Programming language; Software engineering; Field-programmable gate array","score_opus":0.042210781030266466,"score_gpt":0.3194950669638841,"score_spread":0.2772842859336176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385381666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034569174,0.27951577,0.3903471,0.18133228,0.0017862581,0.00007559148,0.00010405661,0.0008270241,0.11144275],"genre_scores_gemma":[0.5647653,0.13084236,0.26266932,0.011494346,0.0028256942,0.00013154585,0.00007459657,0.00037307537,0.026823722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9973525,0.0011030354,0.00013833455,0.00026501215,0.0009395622,0.00020141575],"domain_scores_gemma":[0.995001,0.0025067716,0.00021534364,0.0008983663,0.0010899953,0.0002885359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044879755,0.0006533007,0.00046976123,0.0015680813,0.0012139798,0.008378532,0.0020864597,0.0032975557,0.0024550231],"category_scores_gemma":[0.0077637606,0.00056541414,0.00026856654,0.002081328,0.007811686,0.007780172,0.002365361,0.004799381,0.0009628843],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009774404,0.00010602228,0.0009065561,0.00042074826,0.00003138343,0.00012526143,0.0020662532,0.0042709443,0.00235107,0.7293404,0.0144997705,0.2457839],"study_design_scores_gemma":[0.000038140857,0.00021831747,0.0012414722,0.0014152457,0.00003433157,0.0006816194,0.0031762356,0.019652078,0.004294431,0.67388695,0.2952828,0.00007836153],"about_ca_topic_score_codex":0.0031521493,"about_ca_topic_score_gemma":0.005051162,"teacher_disagreement_score":0.008378532,"about_ca_system_score_codex":0.0017294267,"about_ca_system_score_gemma":0.001850817,"threshold_uncertainty_score":0.023734987},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02538687802069558,"score_gpt":0.30186264661702383,"score_spread":0.2764757685963283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409461316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07088744,0.0007492289,0.9092526,0.00043596816,0.00036034168,0.00013394174,0.00015450834,0.00071325473,0.01731268],"genre_scores_gemma":[0.84741074,0.0007610384,0.13519669,0.0004465182,0.00018317216,0.00018458081,0.00022420005,0.00019318149,0.015399848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989937,0.00033045778,0.000057776848,0.00013988887,0.0003004351,0.00017773319],"domain_scores_gemma":[0.9981717,0.00060720637,0.00016554771,0.00063057744,0.0003624066,0.00006259744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012007533,0.00080662576,0.0008368599,0.0008860176,0.0010683149,0.0018771089,0.001429109,0.0016669005,0.004841755],"category_scores_gemma":[0.0032344135,0.0003310125,0.00068475446,0.0008821062,0.0012703169,0.0014114563,0.0017380954,0.0012426529,0.0013198955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066089496,0.00007939446,0.00041328731,0.00021493495,0.00006990991,0.0004998202,0.00025109493,0.041693855,0.048434354,0.841468,0.0027401906,0.063474365],"study_design_scores_gemma":[0.00013206492,0.00023747217,0.00033212613,0.00009378534,0.00007082354,0.0008106756,0.00007842929,0.53171015,0.07605968,0.38184798,0.008476493,0.00015029161],"about_ca_topic_score_codex":0.00045688852,"about_ca_topic_score_gemma":0.00050625164,"teacher_disagreement_score":0.004841755,"about_ca_system_score_codex":0.00050791993,"about_ca_system_score_gemma":0.00120759,"threshold_uncertainty_score":0.016197264},"labels":[],"label_agreement":null},{"id":"W4415364448","doi":"10.1007/s11265-025-01969-4","title":"On Reducing Decoding Complexity of Successive-Cancellation List 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":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sequential decoding; List decoding; Coding (social sciences); Berlekamp–Welch algorithm; Metric (unit); Computational complexity theory; Partition (number theory)","score_opus":0.03908256154485173,"score_gpt":0.31162368192656775,"score_spread":0.272541120381716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415364448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08134949,0.0011223739,0.9014905,0.0007770024,0.0002748078,0.00015281157,0.00032710918,0.0012096388,0.013296293],"genre_scores_gemma":[0.5671187,0.0018354414,0.41641793,0.00047802948,0.00036181972,0.00025532252,0.0009136417,0.00036245486,0.012256697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767,0.0006660256,0.00008331782,0.00018673032,0.0010708806,0.0003230225],"domain_scores_gemma":[0.9941366,0.00415675,0.0002031441,0.0005665269,0.0008612707,0.00007578629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513664,0.0013337644,0.000918653,0.0009189726,0.00083054864,0.001496548,0.00092120195,0.00073545193,0.004147551],"category_scores_gemma":[0.008244043,0.0003539349,0.000594457,0.0013393111,0.0008705396,0.0015953463,0.0014661365,0.0014988275,0.0011300945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014031064,0.00018865407,0.0017507706,0.00041636507,0.00011954364,0.00039333943,0.00037518414,0.43210793,0.055167492,0.10236714,0.010688704,0.39502183],"study_design_scores_gemma":[0.000054973883,0.00013267108,0.0005127348,0.000040393228,0.0000417209,0.0001891001,0.00006511472,0.94587183,0.021926068,0.028109334,0.0030292035,0.000026864485],"about_ca_topic_score_codex":0.0053424733,"about_ca_topic_score_gemma":0.008263349,"teacher_disagreement_score":0.0053424733,"about_ca_system_score_codex":0.00109746,"about_ca_system_score_gemma":0.0032181237,"threshold_uncertainty_score":0.013874948},"labels":[],"label_agreement":null}]}