{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060803914,0.002009351,0.9895921,0.0012924364,0.000692246,0.00014346786,4.0051629e-7,0.000016259566,0.00017339812],"genre_scores_gemma":[0.8886965,0.000010970593,0.110441856,0.000121416866,0.00062934717,0.000004835852,6.5428935e-8,0.000010802332,0.00008419825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975539,0.00030293516,0.00087887835,0.00017168756,0.000825095,0.00026750015],"domain_scores_gemma":[0.9976326,0.00029673174,0.0011010965,0.00020489002,0.0006221509,0.0001425201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017719192,0.0001445841,0.00039797582,0.00010583188,0.0001694482,0.00040519072,0.0010059155,0.000066164386,0.000016987937],"category_scores_gemma":[0.00009160649,0.00007838994,0.00013933635,0.0004396313,0.00010759475,0.000954113,0.000105814455,0.0002916903,0.000012884509],"study_design_candidate":"design_other","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.00001101347,0.000121785764,0.00030160698,0.00014528456,0.000051500592,0.000025487036,0.001095392,0.0014635404,0.00895302,0.00049646,0.0016614834,0.9856734],"study_design_scores_gemma":[0.00095929997,0.0011111252,0.0017703973,0.0011702897,0.000046940208,0.00059441425,0.0016911215,0.96976775,0.0074772886,0.0060451063,0.008962083,0.00040418806],"about_ca_topic_score_codex":0.00005315162,"about_ca_topic_score_gemma":5.554411e-8,"teacher_disagreement_score":0.98526925,"about_ca_system_score_codex":0.00003492129,"about_ca_system_score_gemma":0.00015307126,"threshold_uncertainty_score":0.39072633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012823789,0.0014554753,0.9964019,0.00010185853,0.00010947778,0.00035477482,0.0000013429124,0.00012662412,0.0001661475],"genre_scores_gemma":[0.57688254,0.000052008123,0.4226811,0.00005432645,0.00021599948,0.000032394983,0.0000011216285,0.000012694123,0.00006781724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865043,0.000050395814,0.000570471,0.00023197928,0.0003135335,0.00018320729],"domain_scores_gemma":[0.99806416,0.00023187061,0.0007619206,0.0001310833,0.00069143524,0.00011955213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785697,0.00015208872,0.00028496626,0.00027782313,0.00042429165,0.00018435145,0.0004140602,0.00008407065,6.675447e-7],"category_scores_gemma":[0.000069100264,0.00012847075,0.000060801845,0.0002789936,0.00006164391,0.00059327064,0.000035160574,0.00015976578,0.0000010240652],"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.000041233507,0.00014790545,0.00024907434,0.00029916078,0.000028876451,0.000009686373,0.0015422364,0.93717456,0.0005761135,0.00033397725,0.00052556174,0.05907162],"study_design_scores_gemma":[0.00064235,0.0001556026,0.000031342606,0.00029935612,0.000009793442,0.0002809939,0.00005981996,0.99697375,0.0009905803,0.00009718106,0.0003089198,0.00015032633],"about_ca_topic_score_codex":0.0000035286437,"about_ca_topic_score_gemma":9.131337e-8,"teacher_disagreement_score":0.57560015,"about_ca_system_score_codex":0.0000487976,"about_ca_system_score_gemma":0.00015077318,"threshold_uncertainty_score":0.5238885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025694914,0.0011790456,0.971261,0.0003280831,0.0009946368,0.00016238133,6.46778e-7,0.000041857533,0.0003373936],"genre_scores_gemma":[0.8273774,0.0000027817716,0.1718626,0.00008107989,0.0005481354,0.000007538378,1.2007357e-7,0.00001318263,0.000107210726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753255,0.00018381483,0.0008744617,0.00025391442,0.0007768446,0.0003784046],"domain_scores_gemma":[0.9978248,0.00015927461,0.00084699097,0.00018915015,0.0007002244,0.00027954296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426514,0.0001965946,0.0004338508,0.00018145746,0.00017859967,0.0008775091,0.0008238954,0.000081097314,0.00003116468],"category_scores_gemma":[0.00006853703,0.00013363521,0.00016844716,0.000392409,0.00006392082,0.0007888461,0.00012564033,0.00034592205,0.0000427771],"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.00004339306,0.00058376655,0.0005286738,0.0003606562,0.00013026204,0.0002960452,0.0017579846,0.039275505,0.10044237,0.0011169151,0.002584666,0.85287976],"study_design_scores_gemma":[0.0006663008,0.0003074289,0.00040327306,0.0005825042,0.000019236943,0.00090967683,0.0002510583,0.9915099,0.0029399593,0.0009157397,0.0012043932,0.00029049854],"about_ca_topic_score_codex":0.000029867831,"about_ca_topic_score_gemma":7.121337e-8,"teacher_disagreement_score":0.95223445,"about_ca_system_score_codex":0.00009845155,"about_ca_system_score_gemma":0.00019215807,"threshold_uncertainty_score":0.8461841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33168373,0.00040350686,0.667566,0.00004544831,0.00008906007,0.00013666038,3.6613764e-7,0.000051946525,0.000023316998],"genre_scores_gemma":[0.9588829,0.0000022470222,0.040958196,0.000024029254,0.00009991406,0.000003386302,1.529813e-7,0.00001398736,0.00001517618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981727,0.0001107649,0.00076095486,0.00021370016,0.0005287677,0.00021311392],"domain_scores_gemma":[0.9973342,0.00027008008,0.0011970949,0.0001766041,0.00090266694,0.0001193968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096948264,0.00017315807,0.00044733525,0.0002638024,0.00014259883,0.00030693787,0.0004840768,0.00011217213,6.995184e-7],"category_scores_gemma":[0.00012526114,0.00014242531,0.00007197683,0.0002543274,0.00006373328,0.00083760155,0.00011093608,0.00039290433,7.4022654e-7],"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.000019872716,0.00005184695,0.0006090292,0.0006080533,0.000021722057,0.0000060484354,0.0023683547,0.9512416,0.024760593,0.0001550832,0.000033876688,0.02012393],"study_design_scores_gemma":[0.00018999296,0.00010986945,0.00020103925,0.0015924609,0.000017418444,0.00019882277,0.00016275437,0.99149585,0.0020256066,0.0038609891,8.526885e-7,0.00014434032],"about_ca_topic_score_codex":0.000038443683,"about_ca_topic_score_gemma":0.0000024296487,"teacher_disagreement_score":0.6271992,"about_ca_system_score_codex":0.00007110383,"about_ca_system_score_gemma":0.00017661985,"threshold_uncertainty_score":0.58079356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83511597,0.0002634614,0.16418095,0.00014300687,0.000100093705,0.00013870496,0.00000439554,0.000012549282,0.000040869352],"genre_scores_gemma":[0.99660283,0.000025357973,0.0032848967,0.000013999947,0.000052893723,0.0000070921287,0.0000019069386,0.000005505347,0.000005536793],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859715,0.000052432286,0.00069798157,0.00012397731,0.00035638554,0.00017209197],"domain_scores_gemma":[0.9986297,0.000022698274,0.0007929545,0.0001349264,0.0003786796,0.000041034593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941789,0.000097782315,0.00026005955,0.0006303406,0.000076961165,0.00015865738,0.00049782987,0.00005423217,0.0000079053025],"category_scores_gemma":[0.000008495904,0.000075949894,0.00003544034,0.0007006423,0.000052941843,0.0006877858,0.000056805675,0.00019595007,9.98918e-7],"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.00006772042,0.0003242219,0.10675322,0.0017621858,0.000038342994,0.000023293494,0.0071557807,0.0018074077,0.58344346,0.0010718924,0.00011498504,0.2974375],"study_design_scores_gemma":[0.0062637143,0.004539488,0.16542216,0.005765369,0.00008696174,0.0013304974,0.005738281,0.6218604,0.17902696,0.004754264,0.0038038979,0.001408015],"about_ca_topic_score_codex":0.000023712173,"about_ca_topic_score_gemma":0.0000022699576,"teacher_disagreement_score":0.620053,"about_ca_system_score_codex":0.00003087084,"about_ca_system_score_gemma":0.00015682625,"threshold_uncertainty_score":0.30971467},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079413113,0.011568804,0.00008412537,0.0000491207,0.9862029,0.0003026488,0.00004347842,0.000021764137,0.00093304814],"genre_scores_gemma":[0.0109875845,0.000839265,0.00005633097,0.00001767123,0.9861503,0.000004482535,0.000059044436,0.00008304458,0.0018022703],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99456984,0.00009859634,0.0018041573,0.00025894446,0.002941196,0.00032729126],"domain_scores_gemma":[0.9940614,0.0003102647,0.0030084911,0.0002076811,0.0021733926,0.00023874534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011027765,0.00034885528,0.0016044234,0.000446219,0.00007564551,0.000071092305,0.00033373424,0.0010002988,0.000019881081],"category_scores_gemma":[0.00058088265,0.0002993966,0.00044392218,0.00028111233,0.00015341662,0.00025658985,0.000038462596,0.0015188658,0.000009507901],"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.000547516,0.00023239892,0.000105756146,0.002703018,0.0003420286,0.00016048735,0.00029839473,0.000031519037,0.0010303097,9.108895e-7,0.99353945,0.0010081915],"study_design_scores_gemma":[0.0027143068,0.0011080095,0.000024718478,0.0068785115,0.00050348864,0.00012445093,0.00028222828,0.000016267222,0.000121792276,0.000011144043,0.98796403,0.00025103244],"about_ca_topic_score_codex":0.00012909828,"about_ca_topic_score_gemma":0.0000038426565,"teacher_disagreement_score":0.01072954,"about_ca_system_score_codex":0.00019081311,"about_ca_system_score_gemma":0.0024966486,"threshold_uncertainty_score":0.9999458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16445522,0.00030512657,0.83390725,0.00004211194,0.00031026686,0.00009719409,1.0523063e-7,0.00007518921,0.0008075662],"genre_scores_gemma":[0.9601527,0.000003889666,0.03968843,0.000027945014,0.00009109719,0.000003839207,5.012978e-8,0.000011972672,0.000020080844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984266,0.00021152476,0.0005792745,0.00019455615,0.00038071323,0.0002073168],"domain_scores_gemma":[0.99831426,0.0000919999,0.0010233043,0.00013554623,0.00036249857,0.000072418115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012222071,0.00014289946,0.00029847302,0.000425521,0.00009661566,0.00023961553,0.0006053817,0.00008193046,0.0000020539771],"category_scores_gemma":[0.000076864,0.00012135912,0.0000620364,0.00050324795,0.00001844611,0.0021642921,0.000060989478,0.00037228983,0.0000015089836],"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.00047557094,0.0012688207,0.06551151,0.001175564,0.00014842562,0.0009513298,0.16528265,0.008224127,0.11138723,0.0024252257,0.00076788705,0.64238167],"study_design_scores_gemma":[0.0009519755,0.0007940549,0.007431135,0.00440783,0.000027671818,0.0012311141,0.001614226,0.9362047,0.04330436,0.0033000205,0.0000967354,0.00063620205],"about_ca_topic_score_codex":0.000086552674,"about_ca_topic_score_gemma":0.000011254431,"teacher_disagreement_score":0.92798054,"about_ca_system_score_codex":0.00016176919,"about_ca_system_score_gemma":0.00022691801,"threshold_uncertainty_score":0.4948881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040962297,0.00047530237,0.95748556,0.00016302231,0.00015878222,0.0001647759,3.7923175e-7,0.000022019789,0.00056787103],"genre_scores_gemma":[0.9442971,0.0000010851024,0.055183273,0.00008007793,0.0003631317,0.000009532414,5.1879056e-7,0.000013056576,0.000052261246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983372,0.00012380793,0.00056655257,0.0001627317,0.00050143135,0.00030824382],"domain_scores_gemma":[0.9987425,0.00008227193,0.0005283234,0.00014232489,0.0003552595,0.00014929888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017062443,0.00013658723,0.00026183252,0.00028456078,0.000091843256,0.00087459484,0.000471928,0.000047161582,7.626297e-7],"category_scores_gemma":[0.000040486982,0.00010048532,0.00003599603,0.0005944082,0.000022269558,0.0044645024,0.000047990965,0.00020370087,0.00001283892],"study_design_candidate":"design_other","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.00047055693,0.0004525503,0.025220368,0.0007739135,0.000054525477,0.00020374235,0.015836298,0.01212218,0.2611399,0.0009701165,0.00032309303,0.6824328],"study_design_scores_gemma":[0.014488627,0.0035676833,0.07796999,0.01914589,0.00021311709,0.015276768,0.0043001985,0.6716921,0.16713381,0.0058743632,0.015641931,0.004695537],"about_ca_topic_score_codex":0.000012251395,"about_ca_topic_score_gemma":4.747837e-7,"teacher_disagreement_score":0.90333474,"about_ca_system_score_codex":0.00011451358,"about_ca_system_score_gemma":0.00011951474,"threshold_uncertainty_score":0.84337384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91009444,0.00068989396,0.088800356,0.00008297013,0.0002024764,0.000093758594,0.0000024675487,0.00001311002,0.000020532978],"genre_scores_gemma":[0.99660116,0.000007479185,0.003198603,0.00001647573,0.00016168473,4.6300156e-7,2.9609043e-7,0.000004762581,0.000009050547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983327,0.00010923583,0.00083318335,0.00013557874,0.00042941052,0.00015992505],"domain_scores_gemma":[0.998422,0.00007743742,0.0010166751,0.00015505793,0.00023393423,0.000094847936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056295306,0.000108816464,0.00039076674,0.00011232261,0.000070305905,0.00012337645,0.00039409884,0.000037824953,0.0000010932745],"category_scores_gemma":[0.000022522507,0.00008014223,0.000043095755,0.00023311748,0.000044093624,0.00032852482,0.000038933616,0.0001834132,2.4275062e-7],"study_design_candidate":"design_other","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.00024381888,0.0013616205,0.019646805,0.0004962056,0.00012380494,0.00030062633,0.01942794,0.0059584915,0.035492793,0.00046272943,0.00025041122,0.91623473],"study_design_scores_gemma":[0.0065932903,0.013983717,0.2960361,0.005768152,0.0002643275,0.005433652,0.008549307,0.65234035,0.008726902,0.0009743869,0.0002800761,0.0010497427],"about_ca_topic_score_codex":0.000010587938,"about_ca_topic_score_gemma":2.8450768e-7,"teacher_disagreement_score":0.91518503,"about_ca_system_score_codex":0.000011702756,"about_ca_system_score_gemma":0.000050335086,"threshold_uncertainty_score":0.32681054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15215519,0.02340445,0.82093745,0.000083147366,0.0018726696,0.0001763214,0.000026395961,0.000449873,0.0008945136],"genre_scores_gemma":[0.9945138,0.000031784606,0.0033002126,0.0000075896064,0.001999209,0.000001952883,0.0000067091187,0.000036860158,0.000101901685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998559,0.00002741595,0.0005790557,0.00010128879,0.000377946,0.0003552659],"domain_scores_gemma":[0.9992612,0.00005625074,0.00029297057,0.00020122147,0.00008883304,0.000099516954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035604613,0.00019048671,0.0003544422,0.00016987248,0.00009111571,0.000105180494,0.0005804852,0.000115307324,0.00004862429],"category_scores_gemma":[0.000028079156,0.00014099978,0.000053214666,0.00015564667,0.000049112245,0.0007561788,0.00008175713,0.00046194348,0.000018598681],"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.0000886194,0.00016187032,0.0013062918,0.0017936176,0.0005198525,0.0000527213,0.0010789193,0.14913733,0.3721489,0.00011347148,0.0050548515,0.46854356],"study_design_scores_gemma":[0.0045543606,0.00090187904,0.0005217614,0.009497201,0.0011664064,0.004770629,0.0035380044,0.65049493,0.11034101,0.002573948,0.2080813,0.0035585384],"about_ca_topic_score_codex":6.2681744e-7,"about_ca_topic_score_gemma":4.0099962e-8,"teacher_disagreement_score":0.8423586,"about_ca_system_score_codex":0.000058539823,"about_ca_system_score_gemma":0.000026486896,"threshold_uncertainty_score":0.5749804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007910053,0.00012473136,0.9905856,0.00039617973,0.00071808265,0.00012942591,0.0000021190237,0.000041266547,0.00009252876],"genre_scores_gemma":[0.81810373,9.0747625e-7,0.18161173,0.000044127988,0.00019058102,0.0000059316476,0.000003102263,0.000010067444,0.000029797642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982573,0.00005747631,0.00054516835,0.0001775612,0.0008074512,0.00015508155],"domain_scores_gemma":[0.9980159,0.00006080326,0.0010559476,0.00017185017,0.00060728303,0.00008822245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072136364,0.00012123829,0.00016618405,0.00027573816,0.00032605752,0.0004148479,0.00045402363,0.000031144744,0.00004579893],"category_scores_gemma":[0.000038127462,0.00009407865,0.00004767243,0.0003370145,0.000027198124,0.0017468057,0.00006240915,0.0003822169,0.0000034009997],"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.000050590872,0.00016217495,0.0010311633,0.000108475215,0.000032790434,0.000019650179,0.0016539561,0.120929964,0.027478412,0.0014218928,0.00046502298,0.8466459],"study_design_scores_gemma":[0.00067923,0.00014462977,0.0008285549,0.00013903022,0.000011631522,0.00060705014,0.00072931807,0.9947353,0.00052985095,0.00033251775,0.001142246,0.00012063246],"about_ca_topic_score_codex":0.000009838126,"about_ca_topic_score_gemma":0.0000014074238,"teacher_disagreement_score":0.87380534,"about_ca_system_score_codex":0.000092962706,"about_ca_system_score_gemma":0.00018435933,"threshold_uncertainty_score":0.40003878},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8141791,0.00044617223,0.18493149,0.00002056319,0.00031843293,0.000057481597,3.272526e-7,0.000009221862,0.0000372002],"genre_scores_gemma":[0.9938388,0.0000051666448,0.0060577663,0.000003948663,0.000084798325,0.0000011196942,3.162968e-8,0.0000066054954,0.0000017845886],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985858,0.00017850111,0.0007562445,0.000121223704,0.00023479004,0.0001234264],"domain_scores_gemma":[0.9979783,0.00029116782,0.0012310983,0.00010600571,0.0003475718,0.00004585145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002209349,0.000095262025,0.0004003475,0.00034630418,0.00003703847,0.00009531226,0.0002913152,0.0000760542,9.319049e-7],"category_scores_gemma":[0.00019255561,0.00007577305,0.0000574643,0.00037336824,0.000059315444,0.0008341684,0.000032593674,0.00036242095,1.5611555e-7],"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.000026302176,0.000052541905,0.004598056,0.00057080085,0.000020980686,0.000014068281,0.0019145755,0.00014980388,0.46316224,0.00008050851,7.738128e-7,0.52940935],"study_design_scores_gemma":[0.0018718983,0.0010480037,0.16509765,0.006568023,0.00004565334,0.0019242076,0.0014575352,0.27516207,0.5432186,0.003181136,0.00004155635,0.00038362623],"about_ca_topic_score_codex":0.00004415114,"about_ca_topic_score_gemma":0.000048055837,"teacher_disagreement_score":0.52902573,"about_ca_system_score_codex":0.00002384802,"about_ca_system_score_gemma":0.00013155912,"threshold_uncertainty_score":0.30899352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34753913,0.00044125688,0.6475243,0.00019275518,0.0003409029,0.00065421767,0.000009258941,0.0030208523,0.00027732668],"genre_scores_gemma":[0.9488133,0.0000015141844,0.050378166,0.00024035061,0.00036788904,0.000045640638,0.000005329528,0.000059893737,0.00008791846],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958023,0.0002003564,0.0015224993,0.000575859,0.0012901077,0.000608886],"domain_scores_gemma":[0.9936025,0.0010879539,0.0020276823,0.0004630223,0.0024632795,0.00035552317],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018753083,0.00046023956,0.0007278686,0.00065031974,0.00055281585,0.0016353208,0.0012043521,0.00022660653,0.000019886185],"category_scores_gemma":[0.0014466519,0.0003787173,0.00015170817,0.0008279741,0.00013386091,0.00286977,0.000052594303,0.0005849688,0.000018479848],"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.00027924613,0.008375871,0.06823571,0.0152497515,0.00021638794,0.0007213283,0.019818233,0.039103396,0.64705163,0.00007766169,0.01442069,0.18645008],"study_design_scores_gemma":[0.0016812689,0.005485659,0.0031492575,0.011868346,0.00011426525,0.0020391128,0.0013768475,0.78710157,0.18345168,0.001847471,0.00028337017,0.0016011527],"about_ca_topic_score_codex":0.00014103326,"about_ca_topic_score_gemma":0.0000023094194,"teacher_disagreement_score":0.7479982,"about_ca_system_score_codex":0.0003730065,"about_ca_system_score_gemma":0.0013830523,"threshold_uncertainty_score":0.9998665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045051537,0.0010385662,0.9526917,0.0005619302,0.00021433602,0.00030154898,0.0000060137377,0.00011916709,0.000015212388],"genre_scores_gemma":[0.8675652,0.000022898885,0.1318587,0.00006685065,0.0004378172,0.000020789148,0.000004282663,0.000012670224,0.000010771092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826586,0.00006989529,0.0006644041,0.00035819688,0.00045589605,0.0001857626],"domain_scores_gemma":[0.9975943,0.000098673794,0.0010805054,0.00068901386,0.00046656196,0.00007096715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006715752,0.00016415124,0.0003279757,0.0003214975,0.0007147895,0.00054871815,0.0016779396,0.00010015751,6.8171033e-7],"category_scores_gemma":[0.00015156643,0.00013224136,0.000041043655,0.00038557706,0.00007536526,0.0015805735,0.00023635179,0.00022025942,4.4643352e-7],"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.0008082029,0.0005782311,0.0011967927,0.0025114974,0.000115898445,0.000095713156,0.002151449,0.14808226,0.048494212,0.0043619163,0.011011045,0.7805928],"study_design_scores_gemma":[0.0013167008,0.00018115077,0.00009095688,0.00093448436,0.00002774339,0.0005341051,0.00014495804,0.9885103,0.0022698576,0.0025577408,0.00322098,0.00021101511],"about_ca_topic_score_codex":0.0000115454095,"about_ca_topic_score_gemma":3.4859306e-7,"teacher_disagreement_score":0.84042805,"about_ca_system_score_codex":0.0000757076,"about_ca_system_score_gemma":0.00036973334,"threshold_uncertainty_score":0.5497655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02009304,0.013492575,0.96502453,0.00036703958,0.00033728243,0.00040418404,0.0000028109228,0.0000442843,0.00023426519],"genre_scores_gemma":[0.99496484,0.00021067123,0.0041611847,0.000026687092,0.0002463226,0.000042885888,5.116836e-7,0.000017044667,0.00032986293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794966,0.00020654246,0.0007540675,0.00024729624,0.0005211278,0.00032128507],"domain_scores_gemma":[0.9970517,0.0003675873,0.0008501055,0.00031290867,0.0012233265,0.00019436573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010064705,0.000168924,0.0004222342,0.00023370588,0.00035455977,0.0004130902,0.0013335441,0.00009026765,0.0000012178361],"category_scores_gemma":[0.00003965464,0.00013366791,0.00006700038,0.00041298068,0.00015609608,0.00087329914,0.00017645124,0.0003682068,0.000002528033],"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.0024842524,0.0014340437,0.007817742,0.006680726,0.0015815963,0.000736965,0.03943131,0.43708232,0.050306436,0.01959366,0.08894629,0.34390467],"study_design_scores_gemma":[0.0006538643,0.00040264428,0.00022521912,0.0012453399,0.000009122067,0.001085666,0.0004295046,0.9934946,0.00024303401,0.000056807054,0.0019623179,0.00019190946],"about_ca_topic_score_codex":0.00006369247,"about_ca_topic_score_gemma":0.0000015938775,"teacher_disagreement_score":0.9748718,"about_ca_system_score_codex":0.00014332999,"about_ca_system_score_gemma":0.0004375269,"threshold_uncertainty_score":0.5450819},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03129972,0.0015076105,0.9655802,0.000049516555,0.00082981423,0.00035605437,0.00002142472,0.00011341625,0.00024221037],"genre_scores_gemma":[0.9912603,9.667474e-7,0.007872013,0.00006127863,0.0007499568,0.000007313845,0.0000049862124,0.00002596553,0.000017222075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971651,0.0001614567,0.0009989381,0.00046440883,0.0007898007,0.0004203265],"domain_scores_gemma":[0.99648654,0.0004098331,0.0014183513,0.0006792903,0.00071661186,0.0002893469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020775083,0.0002517044,0.00048597253,0.00027431475,0.00039205523,0.00067031826,0.0024249486,0.00009981049,0.0000017837959],"category_scores_gemma":[0.0001896291,0.00018690563,0.00009077874,0.00032387598,0.000046653444,0.0008106981,0.000095218675,0.0003033637,0.00000577034],"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.00022408616,0.010885153,0.03776583,0.011343768,0.00042315782,0.0011921483,0.0075386055,0.41092598,0.40026167,0.008530484,0.008441591,0.10246753],"study_design_scores_gemma":[0.000841125,0.0007913694,0.00019266369,0.002961528,0.000030392732,0.00030989764,0.00021176261,0.99298364,0.0010993676,0.000028281022,0.0003090849,0.00024089792],"about_ca_topic_score_codex":0.000021662707,"about_ca_topic_score_gemma":2.3177402e-7,"teacher_disagreement_score":0.9599606,"about_ca_system_score_codex":0.00007503818,"about_ca_system_score_gemma":0.00041247223,"threshold_uncertainty_score":0.7621791},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05763811,0.016085232,0.9255473,0.00008228616,0.0002569316,0.0001571947,0.0000034070792,0.000101931,0.00012760836],"genre_scores_gemma":[0.9812241,0.000038428196,0.017567651,0.000024298759,0.0007306784,0.000012573389,0.000001520683,0.00006581329,0.00033493334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806726,0.000029439987,0.00090696826,0.00015489888,0.00045865242,0.00038276674],"domain_scores_gemma":[0.9982028,0.00017876066,0.0004815725,0.00010438362,0.0008611439,0.00017136306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067478034,0.00022891282,0.00055404735,0.00042168444,0.00017258966,0.0006015578,0.0002897918,0.00017393565,0.000031536547],"category_scores_gemma":[0.00012772984,0.00018886288,0.00020638504,0.00091173523,0.000027038304,0.0006771688,0.000012371245,0.00041005906,0.000029155415],"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.0000085674155,0.000030073374,0.00054975954,0.0013224964,0.000094744675,0.000004964107,0.00031956693,0.95819366,0.0011230769,0.0000054570874,0.0013082176,0.037039395],"study_design_scores_gemma":[0.00024253254,0.000079416954,0.000049906,0.0014753685,0.00010603975,0.000049440325,0.00040596558,0.9959775,0.00018777269,0.0005783186,0.0006073303,0.00024037097],"about_ca_topic_score_codex":0.000012776088,"about_ca_topic_score_gemma":1.7406185e-7,"teacher_disagreement_score":0.923586,"about_ca_system_score_codex":0.00010390122,"about_ca_system_score_gemma":0.00010473864,"threshold_uncertainty_score":0.77016044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020853765,0.054918136,0.9234773,0.00010431445,0.00023261734,0.000261144,4.737636e-7,0.000019107256,0.0001331464],"genre_scores_gemma":[0.99307674,0.00082849024,0.00567014,0.000021802785,0.00037651515,0.000004079452,3.801658e-7,0.000015895239,0.0000059322697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971391,0.00042041147,0.0011940827,0.00027508207,0.0006396479,0.00033170707],"domain_scores_gemma":[0.99731326,0.00023448163,0.0015943514,0.00009178907,0.0006463566,0.00011977847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002717049,0.00020370235,0.00057010486,0.00036582624,0.00015199289,0.00049239746,0.00030595294,0.0000717821,0.000001826233],"category_scores_gemma":[0.000020759682,0.00016758719,0.00005021888,0.00058404566,0.000062126455,0.001683245,0.00004249346,0.00025003747,3.7569515e-7],"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.00005041921,0.00004567149,0.0013159162,0.0006139477,0.0000162981,0.000025270172,0.0012314906,0.03190813,0.0032234301,0.00042163467,0.00002771312,0.96112007],"study_design_scores_gemma":[0.0012254525,0.0006382975,0.0007429264,0.0038511003,0.000033507007,0.0007303764,0.0017195508,0.9870282,0.0013122584,0.0005615173,0.0018710672,0.00028578631],"about_ca_topic_score_codex":0.000019295128,"about_ca_topic_score_gemma":0.0000060844986,"teacher_disagreement_score":0.972223,"about_ca_system_score_codex":0.0001225146,"about_ca_system_score_gemma":0.00029848865,"threshold_uncertainty_score":0.6834007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014907349,0.0013454388,0.90252507,0.0016826416,0.08963841,0.00074081065,5.145142e-7,0.00008671107,0.0024896667],"genre_scores_gemma":[0.68348384,0.000006559142,0.0015237216,0.000049550395,0.31460774,0.000026051997,1.6791938e-7,0.000015311269,0.000287073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970566,0.00036088147,0.0011676159,0.00033218818,0.00074280845,0.00033991717],"domain_scores_gemma":[0.9978822,0.00012044588,0.00085007964,0.00020702364,0.00076042337,0.00017981953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018197909,0.00021468049,0.0005064123,0.00053323567,0.00015257229,0.00082035846,0.0006631155,0.000115279996,0.000017895085],"category_scores_gemma":[0.000053043565,0.00016389426,0.00008238002,0.0006646157,0.00002064894,0.0022132557,0.000038848906,0.00034539215,0.00018963596],"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.00018145553,0.00021984104,0.00017192384,0.0008212767,0.00004092215,0.000117387404,0.0029466865,0.25202435,0.0023157133,0.0021558534,0.65828764,0.08071692],"study_design_scores_gemma":[0.0011834324,0.002567961,0.00013328333,0.006803359,0.000018073657,0.0018352562,0.0037462984,0.26227427,0.0017479406,0.00018040082,0.7187652,0.00074453885],"about_ca_topic_score_codex":0.000037447157,"about_ca_topic_score_gemma":0.000002398436,"teacher_disagreement_score":0.90100133,"about_ca_system_score_codex":0.00040234238,"about_ca_system_score_gemma":0.00012317003,"threshold_uncertainty_score":0.7910735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039983094,0.0008925757,0.95836574,0.00011446408,0.00016042811,0.00043037272,0.0000027817473,0.000017101194,0.000033431927],"genre_scores_gemma":[0.9848467,0.0000057807247,0.014832623,0.00008266601,0.0002029743,0.000006190774,0.0000013043525,0.000016009848,0.0000057246734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982625,0.00018378028,0.0006991526,0.00021435358,0.0003842366,0.00025597907],"domain_scores_gemma":[0.9968567,0.0007191637,0.0011960231,0.000076468394,0.0010398091,0.00011187227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016647473,0.00016682009,0.00046047673,0.00022257146,0.00018197852,0.00025635946,0.00020329609,0.00006167701,0.0000030142112],"category_scores_gemma":[0.0000494137,0.0001381993,0.00009173915,0.00026301495,0.000056354926,0.0004894361,0.000020821373,0.00013598884,2.352771e-7],"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.0018489138,0.0004704344,0.0043015205,0.0038130071,0.0007046152,0.00014130499,0.010674857,0.02091583,0.08913669,0.0036927906,0.0015758057,0.86272424],"study_design_scores_gemma":[0.0032601638,0.0016740913,0.0005080035,0.001984823,0.00009560609,0.0002873335,0.0010891913,0.98434836,0.0058799903,0.0005702865,0.00007985505,0.00022231475],"about_ca_topic_score_codex":0.000009669851,"about_ca_topic_score_gemma":0.0000013486991,"teacher_disagreement_score":0.9634325,"about_ca_system_score_codex":0.000056193352,"about_ca_system_score_gemma":0.00031965642,"threshold_uncertainty_score":0.5635604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018378269,0.003132637,0.9760919,0.00038209886,0.00044068173,0.000595814,6.640404e-7,0.0001313717,0.00084651815],"genre_scores_gemma":[0.9756855,0.0000018518616,0.021955747,0.000100268946,0.0019279595,0.000042352574,7.0507934e-7,0.000031548,0.00025411753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667037,0.0002589659,0.0014155465,0.00035917113,0.000815775,0.00048017933],"domain_scores_gemma":[0.9962429,0.00026740629,0.0018378334,0.00017779777,0.00127428,0.00019982568],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020999294,0.0002687068,0.0005087543,0.0003665175,0.0005427317,0.0016077254,0.00076462264,0.00015428095,0.0000058484893],"category_scores_gemma":[0.000039351275,0.00020305629,0.00020756583,0.00044022247,0.00003643082,0.0010394998,0.000065875865,0.00040021702,0.0000064897863],"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.00021265578,0.00037722546,0.0007747527,0.003974315,0.0002293406,0.000042717453,0.013453899,0.2779384,0.015339676,0.0021993702,0.010604708,0.6748529],"study_design_scores_gemma":[0.0005595473,0.00042463196,0.00010207961,0.0020252473,0.000026301625,0.00068992574,0.0008516063,0.98533,0.0005274096,0.0006604518,0.008525276,0.00027753614],"about_ca_topic_score_codex":0.000022650423,"about_ca_topic_score_gemma":0.0000013751707,"teacher_disagreement_score":0.95730716,"about_ca_system_score_codex":0.00018127012,"about_ca_system_score_gemma":0.00028643996,"threshold_uncertainty_score":0.9994287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041275922,0.0022000074,0.9553137,0.00056304934,0.00017379757,0.00041343493,0.0000030863819,0.000026299207,0.000030734245],"genre_scores_gemma":[0.93997353,0.0000032401585,0.059822615,0.000033190096,0.00014539673,0.000008066783,0.0000012008045,0.000006906017,0.000005836739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982248,0.000082579405,0.0007882417,0.00017087277,0.00047824794,0.00025523466],"domain_scores_gemma":[0.9980151,0.00011550236,0.000988289,0.00011562503,0.0006668064,0.00009868134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717722,0.00013757234,0.00031865915,0.0003608593,0.0001854182,0.0002631709,0.00042110434,0.000050891853,0.0000016599496],"category_scores_gemma":[0.000012585469,0.00010467485,0.00018808177,0.0006018894,0.000048555445,0.00015174388,0.000018232353,0.00015310074,6.3216083e-7],"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.00007409157,0.00048162614,0.000226605,0.00088054425,0.000109328095,0.000018511582,0.0047245286,0.40054432,0.0063559064,0.0045909192,0.00031538252,0.5816783],"study_design_scores_gemma":[0.0076295557,0.0084787235,0.008228683,0.004213995,0.0004177795,0.0017028133,0.0046645147,0.9083402,0.021194192,0.029198611,0.0047875457,0.0011433656],"about_ca_topic_score_codex":0.000011901594,"about_ca_topic_score_gemma":0.0000013092825,"teacher_disagreement_score":0.8986976,"about_ca_system_score_codex":0.000036730533,"about_ca_system_score_gemma":0.00021027957,"threshold_uncertainty_score":0.42685166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3172194,0.00027172547,0.68201023,0.000033802582,0.00003474877,0.00032887456,0.00000211564,0.00009613174,0.0000029471069],"genre_scores_gemma":[0.87191594,0.0000055001005,0.12793349,0.000010486995,0.0000511939,0.000058164824,0.0000049512,0.0000125731485,0.000007695112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985333,0.000027837876,0.0005959781,0.00022993342,0.00039656233,0.000216363],"domain_scores_gemma":[0.997619,0.00003323991,0.0012291141,0.00023339294,0.0008013842,0.000083901294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038516743,0.00015086622,0.00030821605,0.00021272426,0.0002672801,0.0001509823,0.0006951766,0.00007777383,3.9717182e-7],"category_scores_gemma":[0.0000090443355,0.00010343789,0.00004585947,0.00040024982,0.000059249025,0.001278882,0.000026714286,0.00017566624,1.6566507e-7],"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.00035858806,0.00032962757,0.0017506831,0.00037181168,0.000039734812,0.000010439998,0.0019701936,0.026417691,0.10423428,0.0004918148,0.000036694644,0.86398846],"study_design_scores_gemma":[0.004536047,0.006356525,0.0013027837,0.00094580406,0.000043532495,0.0009933513,0.0036769926,0.8530035,0.12611951,0.0017814891,0.0007633638,0.00047709848],"about_ca_topic_score_codex":0.00002289301,"about_ca_topic_score_gemma":0.0000089201385,"teacher_disagreement_score":0.8635113,"about_ca_system_score_codex":0.000045680696,"about_ca_system_score_gemma":0.00023240404,"threshold_uncertainty_score":0.42180747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007992397,0.0013461299,0.9968026,0.00026106907,0.00035058323,0.00009358681,0.0000010077773,0.000030508334,0.0003152656],"genre_scores_gemma":[0.83569646,0.000012778722,0.16348504,0.00013463577,0.0005841462,0.0000023571495,0.0000012034691,0.00001608502,0.00006726923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979282,0.0003108065,0.0006821459,0.0002266728,0.0006018049,0.00025039748],"domain_scores_gemma":[0.99719214,0.00030620085,0.0016169393,0.00014848007,0.00061117276,0.00012504958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531416,0.00020120306,0.00050971156,0.00021179592,0.00019133544,0.00036956038,0.00042467462,0.00013151197,9.4685623e-7],"category_scores_gemma":[0.000074296324,0.00015289412,0.000079292215,0.00041725303,0.00008726765,0.0004354193,0.000045337445,0.00035647303,3.6944394e-7],"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.000059727376,0.000058070695,0.00020942985,0.00016402856,0.000028137956,0.000006636326,0.0007201289,0.77994406,0.00002994318,0.00009057944,0.00017381688,0.21851546],"study_design_scores_gemma":[0.0008041671,0.0004997033,0.00012600441,0.0012822492,0.000028658902,0.00006656098,0.000086748434,0.9959822,0.0000815035,0.00068446546,0.00019765733,0.00016002498],"about_ca_topic_score_codex":0.0000031061866,"about_ca_topic_score_gemma":6.1416733e-7,"teacher_disagreement_score":0.8348972,"about_ca_system_score_codex":0.000052009334,"about_ca_system_score_gemma":0.00017534223,"threshold_uncertainty_score":0.62348413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18352412,0.0011042126,0.7806455,0.028334022,0.00090016215,0.0005499193,0.0000130292465,0.00028236158,0.0046466673],"genre_scores_gemma":[0.9916608,9.3212896e-7,0.0068047275,0.00046487042,0.00022045769,0.000005418624,3.3150548e-7,0.000011310603,0.0008311918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965646,0.000060363967,0.0008390885,0.0002986981,0.0018287929,0.00040840686],"domain_scores_gemma":[0.9969495,0.00028980483,0.00078614743,0.0004761435,0.0013536742,0.00014474087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024589938,0.00020928291,0.000428654,0.00044953375,0.00020208972,0.0004927155,0.003033029,0.000099663535,0.00001597154],"category_scores_gemma":[0.0007212401,0.00013255113,0.00011908078,0.0013352274,0.000047240355,0.00042807445,0.0001972937,0.00046610404,0.00002740223],"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.0002029995,0.00082646887,0.00040542815,0.0003330831,0.00013110091,0.00032045378,0.008729056,0.17682928,0.043361254,0.039144028,0.4825128,0.24720404],"study_design_scores_gemma":[0.0028095837,0.016074961,0.0062667844,0.024473539,0.00016317778,0.0030788858,0.00429439,0.7438039,0.07514002,0.052036263,0.06866425,0.0031941943],"about_ca_topic_score_codex":0.000006831068,"about_ca_topic_score_gemma":4.149008e-7,"teacher_disagreement_score":0.80813664,"about_ca_system_score_codex":0.00011391673,"about_ca_system_score_gemma":0.00017002295,"threshold_uncertainty_score":0.5636173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18702401,0.0017619965,0.81060386,0.00023751806,0.00013166553,0.00021150836,6.325227e-7,0.000010521293,0.000018254075],"genre_scores_gemma":[0.9575675,0.000011348558,0.042232085,0.000033271244,0.00013393065,0.0000054569628,1.1568138e-7,0.00000719094,0.000009083165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986617,0.00012651703,0.00053741253,0.00013822116,0.0003651532,0.00017101674],"domain_scores_gemma":[0.99878645,0.00011945885,0.00065867207,0.0000936339,0.00024428032,0.000097484415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054162316,0.00011632342,0.0002525039,0.00028174894,0.00010066914,0.00027670318,0.00029037378,0.000056085795,0.00001526719],"category_scores_gemma":[0.0000070288684,0.00008222861,0.00007502765,0.00025876806,0.000061068095,0.0005013975,0.000045715762,0.00015738484,0.0000011550264],"study_design_candidate":"design_other","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.00011580971,0.00021431224,0.010829252,0.001094403,0.00030161053,0.000043291468,0.015692942,0.009656301,0.17450863,0.00028363944,0.0029881906,0.7842716],"study_design_scores_gemma":[0.020416502,0.006810449,0.25712523,0.0071442164,0.0006770374,0.0064763958,0.014478148,0.51509106,0.15593292,0.009384525,0.0035023883,0.0029611518],"about_ca_topic_score_codex":0.00011989376,"about_ca_topic_score_gemma":0.0000011078479,"teacher_disagreement_score":0.7813105,"about_ca_system_score_codex":0.000021334365,"about_ca_system_score_gemma":0.00011491285,"threshold_uncertainty_score":0.33531854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015206225,0.0027481285,0.9787217,0.00016452912,0.0016302324,0.00041444247,8.527684e-7,0.00047889783,0.00063502573],"genre_scores_gemma":[0.8764697,0.000015121752,0.12205914,0.000029770297,0.0009787289,0.000024393215,3.2320236e-7,0.000030900657,0.00039195293],"study_design_codex":"bench_or_experimental","study_design_gemma":"case_report","domain_scores_codex":[0.99525386,0.001020536,0.0017329314,0.0004556114,0.0010972063,0.00043987748],"domain_scores_gemma":[0.9946012,0.00040997902,0.0024519218,0.00048009548,0.0018469153,0.00020990284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004561453,0.00030792932,0.0008942008,0.0006624127,0.00035475605,0.00018655951,0.0011488212,0.00021770979,0.0000013935631],"category_scores_gemma":[0.00044216934,0.00024545926,0.00019061731,0.0010675879,0.00011916293,0.0016445151,0.00009538291,0.0004893857,0.000014557005],"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.00045243851,0.0015390926,0.010686043,0.01021338,0.0007010058,0.0062978338,0.038978323,0.005802297,0.80665904,0.031055342,0.051867258,0.035747916],"study_design_scores_gemma":[0.0042770826,0.0063464157,0.001092292,0.018588118,0.00034784796,0.38494205,0.008613052,0.31678665,0.23913197,0.0015901157,0.015059436,0.0032249675],"about_ca_topic_score_codex":0.000026858434,"about_ca_topic_score_gemma":4.4515656e-7,"teacher_disagreement_score":0.86126345,"about_ca_system_score_codex":0.00037625193,"about_ca_system_score_gemma":0.00062753103,"threshold_uncertainty_score":0.99999976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13420229,0.0007574918,0.8633229,0.00049691496,0.00039792602,0.00016321472,0.0000012241419,0.00009707208,0.00056098803],"genre_scores_gemma":[0.95779854,0.0000025379582,0.04144899,0.00017842169,0.00039389107,0.000004095781,0.0000027095396,0.000019318128,0.00015151092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714625,0.000158087,0.00088491524,0.00028489908,0.0012042915,0.00032157288],"domain_scores_gemma":[0.9975596,0.00009130577,0.0012520787,0.00019814353,0.0007182207,0.00018063652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837384,0.0002434957,0.00040430992,0.00041558375,0.00041627715,0.00042926264,0.00059026596,0.00011696215,0.000005874039],"category_scores_gemma":[0.00007280059,0.00019728825,0.00012897051,0.00064340344,0.00005252375,0.0016529531,0.000024959649,0.00033061113,0.000017993478],"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.0004615539,0.0006287549,0.0015148277,0.0011066085,0.000068882524,0.0012507824,0.0045089964,0.6754123,0.055847224,0.000091848,0.005333091,0.25377512],"study_design_scores_gemma":[0.000845017,0.0005063734,0.00027194226,0.0012406062,0.000016436292,0.0010948064,0.00020221253,0.9568738,0.03840615,0.00015459316,0.00013793632,0.00025018243],"about_ca_topic_score_codex":0.00000771026,"about_ca_topic_score_gemma":0.0000013670533,"teacher_disagreement_score":0.82359624,"about_ca_system_score_codex":0.00017501954,"about_ca_system_score_gemma":0.000677373,"threshold_uncertainty_score":0.8045181},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20364484,0.00010552922,0.79112273,0.00050502137,0.0009902015,0.00022533094,0.000005710119,0.00010453103,0.0032960796],"genre_scores_gemma":[0.9984953,9.948087e-7,0.0009504393,0.00014021934,0.00036868989,0.000005370111,0.0000047706394,0.000014379503,0.000019837957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977998,0.00015265521,0.00081888086,0.0002332899,0.00070607563,0.0002892847],"domain_scores_gemma":[0.99752647,0.0002610963,0.0012007902,0.00022605783,0.0006223129,0.00016324777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015111623,0.00017329992,0.0003152278,0.00031465362,0.0004893415,0.00064055936,0.0006954999,0.00008718498,0.000016923881],"category_scores_gemma":[0.00008764168,0.00014590411,0.000102454294,0.00039123074,0.00005325307,0.0010229201,0.000019989431,0.0005622617,0.000009517059],"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.0000067421597,0.00042787174,0.005660882,0.00052452955,0.000015515245,0.000069789545,0.0006713798,0.013850178,0.747924,0.0039179577,0.0007997657,0.22613142],"study_design_scores_gemma":[0.0017698912,0.0007680519,0.010823455,0.0032888604,0.00004359468,0.0005874808,0.00039232807,0.87619567,0.100553855,0.004537555,0.0004312686,0.0006079771],"about_ca_topic_score_codex":0.00002670996,"about_ca_topic_score_gemma":0.000012762332,"teacher_disagreement_score":0.8623455,"about_ca_system_score_codex":0.00008299224,"about_ca_system_score_gemma":0.00030667172,"threshold_uncertainty_score":0.6176929},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018121614,0.00028223166,0.9968415,0.00007119282,0.00028991545,0.00021978028,0.000002876482,0.000026317275,0.00045405194],"genre_scores_gemma":[0.8304447,0.0000014570719,0.16927928,0.00007445398,0.0001369835,0.000019607704,0.0000040816085,0.0000064271358,0.0000330183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986147,0.00010499922,0.00060293014,0.00017709404,0.00035517945,0.00014505265],"domain_scores_gemma":[0.99802816,0.00006581304,0.0008522645,0.000120145,0.00084988814,0.00008373732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982517,0.00009505094,0.00019071008,0.0004615992,0.00012575646,0.0003580131,0.00042014185,0.00007561976,0.000009831136],"category_scores_gemma":[0.000078125406,0.00007724588,0.00009498209,0.0005711812,0.000021864746,0.00076323433,0.000018523793,0.00013116798,0.000004582344],"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.0006773935,0.0028991222,0.0010524828,0.0050126887,0.00025817862,0.00006184195,0.019627314,0.0021778697,0.030485392,0.0069423234,0.0063049807,0.9245004],"study_design_scores_gemma":[0.00094945705,0.00026911584,0.0007086438,0.00033741668,0.000034532357,0.00015763905,0.0002782388,0.9888946,0.005878283,0.0014844692,0.00078475574,0.00022288362],"about_ca_topic_score_codex":0.000015029245,"about_ca_topic_score_gemma":2.1220109e-7,"teacher_disagreement_score":0.9867167,"about_ca_system_score_codex":0.0000628088,"about_ca_system_score_gemma":0.00021842825,"threshold_uncertainty_score":0.34523284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004521111,0.00014113054,0.9984806,0.0002426738,0.00011461967,0.00022240219,0.0000022654574,0.00005089616,0.00029327263],"genre_scores_gemma":[0.882519,0.0000028162592,0.11718873,0.0000571581,0.00019731064,0.0000107038495,0.0000038969,0.000006694997,0.000013702085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985851,0.00008097755,0.00068693334,0.00012082211,0.0003857299,0.00014041884],"domain_scores_gemma":[0.9978532,0.000054937762,0.0011982927,0.00008837563,0.0007187259,0.00008643182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558782,0.00012747172,0.00022480826,0.00017508838,0.00020174841,0.00079664105,0.00027045968,0.000069016045,3.3437166e-7],"category_scores_gemma":[0.000027287382,0.000099463316,0.000048888793,0.00017922063,0.000054070522,0.0038366509,0.000033630808,0.00015459552,6.5111016e-7],"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.00007649423,0.000043223758,0.000019277073,0.0007506934,0.000019652882,0.0000023396276,0.0014058498,0.03196089,0.02230009,0.013989106,0.00013660656,0.9292958],"study_design_scores_gemma":[0.00058641564,0.00018707466,0.000013262553,0.0002732157,0.000013044623,0.0001195906,0.00030653962,0.98504615,0.009200643,0.0040811547,0.00005338064,0.00011955554],"about_ca_topic_score_codex":0.000026250718,"about_ca_topic_score_gemma":9.995962e-7,"teacher_disagreement_score":0.95308524,"about_ca_system_score_codex":0.000070414906,"about_ca_system_score_gemma":0.00012726146,"threshold_uncertainty_score":0.76820284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026809674,0.001990073,0.95688885,0.012835085,0.00018688392,0.00023586267,0.0000017703329,0.000038346752,0.0010134456],"genre_scores_gemma":[0.9647801,0.000004709094,0.03456873,0.00036480726,0.00020804166,7.625992e-7,0.0000016087522,0.000008887549,0.00006236184],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982615,0.00006529776,0.00040888228,0.00024224145,0.0008062613,0.00021578687],"domain_scores_gemma":[0.99780023,0.000074067946,0.0011171162,0.00033744227,0.00055518,0.00011594279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014521009,0.00015211564,0.00032477366,0.0001896211,0.0002590289,0.00057432434,0.0015009705,0.00006620626,8.4586065e-7],"category_scores_gemma":[0.000039823466,0.00008725752,0.00003424536,0.0007865663,0.000035773486,0.001060642,0.00008641764,0.00029115484,0.0000011613904],"study_design_candidate":"design_other","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.0001686573,0.00012899065,0.00008701777,0.00023985367,0.000033218646,0.000032122854,0.0016817575,0.0020823353,0.15034762,0.00011237691,0.0070127924,0.83807325],"study_design_scores_gemma":[0.013132166,0.009001801,0.008562248,0.03511011,0.0007090316,0.007834013,0.010938005,0.2323083,0.6345618,0.006886851,0.037556417,0.0033993034],"about_ca_topic_score_codex":0.0000018990465,"about_ca_topic_score_gemma":4.68601e-7,"teacher_disagreement_score":0.9379704,"about_ca_system_score_codex":0.000048818874,"about_ca_system_score_gemma":0.00032948185,"threshold_uncertainty_score":0.5538223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0347483,0.0004531043,0.96220005,0.00014096232,0.0019645605,0.00020130901,7.283142e-7,0.00015352789,0.00013746411],"genre_scores_gemma":[0.89624596,6.549783e-7,0.10280624,0.000024596553,0.00084616116,0.000011511641,1.5052653e-7,0.000022149012,0.000042550317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982432,0.000039944367,0.00073847605,0.00021131155,0.00045656334,0.00031046342],"domain_scores_gemma":[0.9972026,0.00036691397,0.0011235924,0.00018444285,0.0010038108,0.00011867969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002031,0.00017347638,0.00036458301,0.0002917902,0.0002947133,0.000780126,0.00097124366,0.000107187465,0.00000141628],"category_scores_gemma":[0.00033792507,0.00014309179,0.00013819043,0.00029767133,0.000047465353,0.0014361383,0.00006136359,0.0005019248,0.0000010532432],"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.00012777829,0.00019676228,0.0008899049,0.0012976847,0.000106756204,0.000085896914,0.0082050655,0.006102946,0.25803736,0.008739293,0.001758492,0.7144521],"study_design_scores_gemma":[0.0008798187,0.0007730626,0.00010782243,0.002474557,0.00007342366,0.004653492,0.00083351927,0.9465335,0.032604612,0.009105182,0.0013286201,0.00063240033],"about_ca_topic_score_codex":0.0000047347685,"about_ca_topic_score_gemma":0.0000058098785,"teacher_disagreement_score":0.9404305,"about_ca_system_score_codex":0.000061297374,"about_ca_system_score_gemma":0.00028948503,"threshold_uncertainty_score":0.7522773},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50870365,0.00087876234,0.4898698,0.00020965884,0.00011846058,0.00010282141,3.306111e-7,0.00000820399,0.00010830272],"genre_scores_gemma":[0.99267435,0.000006669848,0.0069889724,0.000063734224,0.00020522915,0.0000020577404,2.1297106e-7,0.0000072747694,0.00005150898],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998035,0.0001722693,0.0008215088,0.00020647778,0.0005906215,0.00017412128],"domain_scores_gemma":[0.997053,0.00007288058,0.0019492586,0.00020653941,0.0006379157,0.00008035295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718981,0.0001266035,0.0003889382,0.00030862307,0.00020507196,0.0005112852,0.0004954818,0.00006279619,0.00001169246],"category_scores_gemma":[0.000037658356,0.000082166735,0.00015189176,0.0015030798,0.0000916842,0.0014350221,0.000066240515,0.00017384694,9.4008715e-7],"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.000020547755,0.0001426702,0.049319655,0.0006781555,0.0005218326,0.0000120552,0.0052282945,0.033712044,0.8118513,0.00059186475,0.00047202304,0.09744954],"study_design_scores_gemma":[0.00031554146,0.000057399076,0.05172133,0.00064338156,0.0003555785,0.00022895705,0.0010737858,0.92880744,0.01556045,0.0010331505,0.000021365708,0.00018159741],"about_ca_topic_score_codex":0.00009455238,"about_ca_topic_score_gemma":0.000001669583,"teacher_disagreement_score":0.8950954,"about_ca_system_score_codex":0.000053549942,"about_ca_system_score_gemma":0.00019946923,"threshold_uncertainty_score":0.49303353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041564826,0.0025202977,0.95494527,0.00010012163,0.000518137,0.00022394242,0.000004740354,0.000049056405,0.000073632946],"genre_scores_gemma":[0.9630845,0.0000064550663,0.036524385,0.00001917015,0.0003206801,0.000008755395,0.0000013998956,0.000013357799,0.000021264239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983659,0.000091779875,0.0007579732,0.000114760165,0.00042716207,0.00024243908],"domain_scores_gemma":[0.9969262,0.00017523098,0.0018308774,0.000113330025,0.0008698066,0.00008455214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015494078,0.00011969189,0.00029451004,0.00023250446,0.0001240928,0.0001386269,0.00044547347,0.000060184477,0.0000028001768],"category_scores_gemma":[0.00005108872,0.000102966675,0.00009886803,0.00025405717,0.00002462487,0.001730922,0.000032490017,0.00011673858,5.076065e-7],"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.00024094294,0.00043462854,0.21751466,0.0050821886,0.00034023076,0.000010533422,0.03044173,0.005183844,0.24059746,0.007273211,0.008927325,0.48395327],"study_design_scores_gemma":[0.004712107,0.0031201509,0.012570734,0.007407782,0.00044409605,0.0010381279,0.018471237,0.30856323,0.628756,0.003866968,0.0092696175,0.0017799734],"about_ca_topic_score_codex":0.000079787285,"about_ca_topic_score_gemma":0.000007487356,"teacher_disagreement_score":0.9215197,"about_ca_system_score_codex":0.00012552988,"about_ca_system_score_gemma":0.0002325282,"threshold_uncertainty_score":0.4198859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010737622,0.0057711992,0.982851,0.00009559307,0.00027176895,0.00016531651,0.0000018106969,0.00005797964,0.000047691236],"genre_scores_gemma":[0.9685396,0.00006494486,0.03126343,0.000012115715,0.000096127646,0.000005330939,3.3218996e-7,0.000009089179,0.000009041884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838585,0.00013109586,0.00067644555,0.00018223921,0.00045015936,0.00017421729],"domain_scores_gemma":[0.99778974,0.00025064076,0.0014041503,0.0001851292,0.00031480918,0.000055533208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179671,0.00013632349,0.0003522178,0.00024672176,0.000095648225,0.00020114532,0.00056027045,0.000056756668,4.7921355e-7],"category_scores_gemma":[0.00006188047,0.000102545135,0.000028853035,0.0002602898,0.000069915994,0.001505478,0.000065569366,0.00015682583,0.0000012991754],"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.000121471036,0.00015813817,0.0024137525,0.002675225,0.00010192594,0.000071321636,0.0017081351,0.15277347,0.04331395,0.03962454,0.0010471259,0.7559909],"study_design_scores_gemma":[0.005098274,0.010219657,0.0014767951,0.009417295,0.0001478169,0.0028589875,0.0094393855,0.8486576,0.07713007,0.014531126,0.019503266,0.0015197102],"about_ca_topic_score_codex":0.000009539225,"about_ca_topic_score_gemma":3.6366382e-7,"teacher_disagreement_score":0.95780194,"about_ca_system_score_codex":0.000055018918,"about_ca_system_score_gemma":0.000080549005,"threshold_uncertainty_score":0.41816694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23565435,0.000028829843,0.76364714,0.00016815981,0.00011043125,0.00019641755,0.0000024467467,0.00004689631,0.00014531493],"genre_scores_gemma":[0.98945034,0.000004187353,0.010207188,0.00005618968,0.00019573186,0.000015477104,0.0000020447605,0.000007759527,0.000061057806],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987989,0.00009364092,0.0004891352,0.00017525481,0.00031927312,0.00012377069],"domain_scores_gemma":[0.99841726,0.00012137408,0.00078917836,0.000099454206,0.00049917446,0.00007355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012574272,0.000111048095,0.00025026055,0.00071200164,0.00017366443,0.0005946648,0.00019684414,0.00007265867,0.000005787521],"category_scores_gemma":[0.000022067412,0.00008924308,0.00008928179,0.00045429522,0.000022315908,0.0009753991,0.000017899696,0.00019102964,0.0000015276722],"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.00018763682,0.00014882044,0.000723209,0.00017957711,0.0004355752,0.0000110466335,0.0077973325,0.00060548465,0.7949143,0.006322125,0.00078688207,0.18788798],"study_design_scores_gemma":[0.002174607,0.0029948964,0.004947313,0.00033487013,0.0004748926,0.0003568345,0.0008382537,0.6454048,0.33313382,0.007454463,0.0012056713,0.00067955325],"about_ca_topic_score_codex":0.000023004812,"about_ca_topic_score_gemma":0.000015229084,"teacher_disagreement_score":0.753796,"about_ca_system_score_codex":0.000032294854,"about_ca_system_score_gemma":0.00007225618,"threshold_uncertainty_score":0.5734366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009515581,0.0011638717,0.9886997,0.0001646873,0.0003016146,0.000076997014,0.0000016720799,0.000025386711,0.000050491086],"genre_scores_gemma":[0.9704611,0.0000064884816,0.029149352,0.00013589645,0.00022140819,9.752033e-7,0.0000035082069,0.0000071291342,0.000014196471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985986,0.00021372053,0.00047834907,0.00015976188,0.00041941775,0.00013017558],"domain_scores_gemma":[0.99814075,0.00011209956,0.0007694144,0.000097709584,0.0007767065,0.00010329093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014661249,0.00009963215,0.00022017334,0.00045342496,0.00020485076,0.00074688933,0.00023920117,0.000086691616,0.0000048831116],"category_scores_gemma":[0.00013084592,0.000082882536,0.000043575885,0.00068453443,0.000041627085,0.00069637236,0.000019443001,0.00014428822,0.0000025122467],"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.00023253403,0.0006865758,0.0066432334,0.0030203871,0.0001672267,0.000057802717,0.0038094593,0.057756837,0.03686164,0.0019162822,0.008456403,0.8803916],"study_design_scores_gemma":[0.0005730176,0.00007329556,0.00048315455,0.00039357177,0.000024010897,0.00022386521,0.00008456285,0.99484605,0.00053594424,0.00023945508,0.0023956893,0.00012738671],"about_ca_topic_score_codex":0.000040923787,"about_ca_topic_score_gemma":0.000001872792,"teacher_disagreement_score":0.9609455,"about_ca_system_score_codex":0.000057236193,"about_ca_system_score_gemma":0.00012710586,"threshold_uncertainty_score":0.7202271},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053137876,0.014309152,0.9792441,0.0005426017,0.00023545582,0.00031635538,0.000001795274,0.000009855296,0.000026896058],"genre_scores_gemma":[0.9675196,0.0001245626,0.031411793,0.00003550534,0.0006239822,0.0000050410717,3.815485e-7,0.000011911069,0.00026725317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984057,0.00008079796,0.00066102017,0.00016894632,0.00051130017,0.00017222951],"domain_scores_gemma":[0.9962751,0.0008659957,0.0018602296,0.000100793724,0.00083729357,0.00006058826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015523636,0.00013080407,0.00034501648,0.0000981794,0.0005756592,0.00013205729,0.00046038383,0.00008103779,6.8167105e-7],"category_scores_gemma":[0.000140078,0.00007042324,0.00012622034,0.0003083639,0.0001300094,0.00047686318,0.00005111117,0.00025323065,9.051248e-8],"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.0003864906,0.000051644107,0.00013430655,0.0004644791,0.000109552966,0.0000026501614,0.005258486,0.002116017,0.024556905,0.00044089765,0.0022062208,0.9642724],"study_design_scores_gemma":[0.0012149226,0.000949718,0.0028949883,0.00121604,0.000117474396,0.00045968537,0.0021568257,0.98301786,0.005489706,0.00042461517,0.0019036185,0.00015451442],"about_ca_topic_score_codex":0.000012380737,"about_ca_topic_score_gemma":4.594681e-7,"teacher_disagreement_score":0.9809019,"about_ca_system_score_codex":0.000031170926,"about_ca_system_score_gemma":0.000538834,"threshold_uncertainty_score":0.44275633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16703126,0.0036876106,0.8278618,0.000021916665,0.0007539601,0.00035765723,6.218068e-7,0.0000774274,0.00020775745],"genre_scores_gemma":[0.9921688,0.000039188326,0.007037727,0.000023842234,0.0005759652,0.00001549855,6.455164e-7,0.00005926125,0.00007911697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978984,0.00004432484,0.0010122964,0.00015423125,0.00034786892,0.0005428737],"domain_scores_gemma":[0.99884367,0.0003243742,0.0003320721,0.00011017488,0.00025474787,0.00013495417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023883649,0.00024337422,0.0004782915,0.00047036106,0.00008238031,0.00021201636,0.00032375407,0.00016074431,0.00000944707],"category_scores_gemma":[0.000050386512,0.00020688445,0.00011518674,0.00036833755,0.000029380866,0.0008703082,0.00001292817,0.00039172696,0.000008346921],"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.0007946446,0.00015233342,0.0052515026,0.003397591,0.0002461692,0.00050736003,0.004162554,0.79092675,0.04847216,0.000050065337,0.002579451,0.14345942],"study_design_scores_gemma":[0.0045933663,0.0019226072,0.0009152527,0.007935024,0.00015044255,0.0010380172,0.0022443456,0.82437456,0.15092814,0.0004643815,0.004228114,0.0012057613],"about_ca_topic_score_codex":0.000010800366,"about_ca_topic_score_gemma":0.000010369727,"teacher_disagreement_score":0.8251375,"about_ca_system_score_codex":0.00022998314,"about_ca_system_score_gemma":0.00009701365,"threshold_uncertainty_score":0.8436503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008737176,0.0005010352,0.99000406,0.00009930634,0.00022618823,0.00015358052,8.5737247e-7,0.000078128236,0.00019964254],"genre_scores_gemma":[0.7778992,0.000008284135,0.22171594,0.00005000512,0.00022806908,0.0000038452185,8.9276693e-7,0.000008356757,0.000085411004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997556,0.00016227561,0.00095074374,0.00021565576,0.0009205085,0.00019485803],"domain_scores_gemma":[0.9975832,0.000090056375,0.0012227689,0.00018238029,0.00075248734,0.00016908026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874328,0.00013191633,0.00026457486,0.00021354164,0.00028372207,0.00026272744,0.00057359645,0.00007674852,0.0000116359715],"category_scores_gemma":[0.00009280516,0.00011273516,0.000076452925,0.00045027141,0.00017983036,0.0021131453,0.000040043946,0.00027870835,0.0000033918818],"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.00014959852,0.0014142564,0.0013662705,0.00070156,0.00014233157,0.0019370788,0.008167873,0.12563287,0.4028821,0.00058658887,0.010461132,0.44655833],"study_design_scores_gemma":[0.0011552274,0.0003105811,0.00010931047,0.0006364996,0.000021702466,0.0039510136,0.00055014016,0.9520682,0.040778145,0.00015337266,0.00005990695,0.00020589028],"about_ca_topic_score_codex":0.00007319287,"about_ca_topic_score_gemma":6.132652e-7,"teacher_disagreement_score":0.8264353,"about_ca_system_score_codex":0.00014213719,"about_ca_system_score_gemma":0.0005664271,"threshold_uncertainty_score":0.45972064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1385823,0.00043687774,0.8607317,0.000047693804,0.000051400006,0.00012217117,0.000003464849,0.000009817625,0.000014556085],"genre_scores_gemma":[0.97039795,0.00001877026,0.029424917,0.000028188868,0.00008084183,0.0000029479897,0.0000053769877,0.0000071623035,0.000033824148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976929,0.0002325501,0.000889671,0.00036611618,0.00061727845,0.00020150271],"domain_scores_gemma":[0.99812436,0.00013351043,0.00091977016,0.00024181385,0.00045360875,0.00012692268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021351506,0.00015879267,0.0006610472,0.0023144034,0.00017167295,0.000100540376,0.00063642213,0.00010476678,0.0000011208292],"category_scores_gemma":[0.00007507556,0.00012427136,0.00011431395,0.004743289,0.000035312358,0.0009724408,0.00010546394,0.00023349145,0.0000010100193],"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.0006163105,0.0004060477,0.007875066,0.00019063837,0.00094325055,0.00005286176,0.0022668645,0.80992985,0.0875236,0.000032937733,0.00016753741,0.08999507],"study_design_scores_gemma":[0.00060278556,0.00020329567,0.019032914,0.00022953161,0.00045905513,0.00006360746,0.00004761952,0.9753508,0.0038630082,0.0000065152462,0.000015793894,0.00012506249],"about_ca_topic_score_codex":0.0002097084,"about_ca_topic_score_gemma":0.00004114009,"teacher_disagreement_score":0.83181566,"about_ca_system_score_codex":0.00014432063,"about_ca_system_score_gemma":0.00017893636,"threshold_uncertainty_score":0.5067639},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35673666,0.0005879556,0.6421927,0.000033333603,0.00016144893,0.00013830965,9.4469596e-7,0.00003283335,0.00011579022],"genre_scores_gemma":[0.98640764,0.0000022187046,0.013421733,0.000010535204,0.00013915096,0.00000401523,1.992668e-7,0.000010823466,0.000003701899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979729,0.00022263454,0.00093858544,0.00017674093,0.0005455667,0.00014354094],"domain_scores_gemma":[0.99756444,0.00043082656,0.0011097107,0.00014284019,0.00065721077,0.00009497336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128206,0.0001224397,0.00038300754,0.00045821178,0.000057943398,0.00022549367,0.0004725221,0.00011433895,0.000002282339],"category_scores_gemma":[0.000102192644,0.000105780295,0.000043301894,0.00032933152,0.00005833938,0.0014922782,0.000031199805,0.00028012638,4.7289416e-7],"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.000052998425,0.00044083866,0.012582457,0.0016551714,0.000057280253,0.00011108803,0.0062692016,0.29008058,0.22097144,0.0036750073,0.00007251595,0.46403143],"study_design_scores_gemma":[0.00027584317,0.0002209552,0.0026582363,0.00093609956,0.00001016853,0.00036893162,0.00013488538,0.9873964,0.0052482975,0.002553834,0.000040307088,0.00015601142],"about_ca_topic_score_codex":0.00001177439,"about_ca_topic_score_gemma":0.0000023626708,"teacher_disagreement_score":0.6973159,"about_ca_system_score_codex":0.00003558088,"about_ca_system_score_gemma":0.00021194712,"threshold_uncertainty_score":0.4313595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013120386,0.0024687676,0.9828863,0.00004935475,0.00026341257,0.00069711637,0.000021334905,0.000085555366,0.0004077618],"genre_scores_gemma":[0.9858506,0.0000033315516,0.013421824,0.000018845669,0.00048779225,0.00011503567,0.000003484009,0.000053047253,0.000046057517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801224,0.000067401634,0.0009478422,0.00015480412,0.00045200076,0.00036570444],"domain_scores_gemma":[0.99868906,0.00026907597,0.00044051075,0.00014017493,0.0003068314,0.00015432716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011610033,0.00021799824,0.00046100118,0.00014418786,0.00030741325,0.00009255328,0.0002450013,0.000074038726,0.000009365577],"category_scores_gemma":[0.000021972435,0.00018223895,0.00016629873,0.00022704057,0.00003228936,0.00010902355,0.000006607162,0.0001923461,0.000006233],"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.00003961269,0.00013798845,0.00007600366,0.00081299525,0.000071637485,0.000008709683,0.00080083846,0.9881689,0.0061880574,0.00024449534,0.0025673392,0.0008834555],"study_design_scores_gemma":[0.0020007,0.0001791737,0.000065783606,0.0005450159,0.0000634331,0.00022008448,0.0009536896,0.98561156,0.0036459868,0.000037120422,0.006386758,0.00029067544],"about_ca_topic_score_codex":0.0000041844937,"about_ca_topic_score_gemma":6.939359e-7,"teacher_disagreement_score":0.9727302,"about_ca_system_score_codex":0.00018561046,"about_ca_system_score_gemma":0.00018406549,"threshold_uncertainty_score":0.7431488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11600585,0.0026722956,0.8802052,0.0001322481,0.00025775435,0.00065120944,0.0000059462914,0.000038201208,0.0000312783],"genre_scores_gemma":[0.97951,0.000015191182,0.02007613,0.000018218658,0.0003122265,0.000021976526,0.0000016516392,0.000015385107,0.000029184506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971322,0.00038716898,0.0011656659,0.00021388766,0.0007819619,0.00031911107],"domain_scores_gemma":[0.9956295,0.00022787951,0.0016811204,0.00035771198,0.0019356498,0.00016816177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020381724,0.00016705356,0.00044188768,0.0003212834,0.00019654754,0.0004443081,0.0013785046,0.000090023656,0.0000014156067],"category_scores_gemma":[0.0000302294,0.00013725752,0.00010752373,0.0004576119,0.000042279255,0.0017272006,0.00005729413,0.00025218056,0.0000011883101],"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.00054751826,0.0005763177,0.00048000185,0.0009737503,0.00019404324,0.00003198706,0.00554672,0.16220076,0.13060048,0.0028787549,0.0005342905,0.6954354],"study_design_scores_gemma":[0.0013867387,0.0016401004,0.0009311204,0.0006729679,0.000020791189,0.00010011318,0.0017231931,0.98631656,0.0067170374,0.00010236249,0.00021154163,0.00017750138],"about_ca_topic_score_codex":0.000068374,"about_ca_topic_score_gemma":0.00000782878,"teacher_disagreement_score":0.8635042,"about_ca_system_score_codex":0.00015040196,"about_ca_system_score_gemma":0.00038914732,"threshold_uncertainty_score":0.55972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22797407,0.0003892597,0.77050775,0.00025008997,0.00039418228,0.00042676192,0.0000023925584,0.000020623103,0.00003486115],"genre_scores_gemma":[0.9846909,0.0000031146294,0.015041953,0.000045242614,0.00015427374,0.000041519033,0.0000059836366,0.0000082845645,0.000008742996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814624,0.00011736055,0.00078840915,0.00015686495,0.0005418482,0.00024926072],"domain_scores_gemma":[0.99813277,0.00014412943,0.0006245518,0.00012538323,0.0008879534,0.00008522206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017634202,0.00009681183,0.00018004447,0.00016721773,0.00014992968,0.00046588524,0.0003172597,0.00004553222,0.00001596636],"category_scores_gemma":[0.00006448246,0.000079013334,0.000053427055,0.00043258411,0.000015690179,0.00064607454,0.000026501757,0.000106315856,0.0000065108316],"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.000029807788,0.00024643596,0.0020114586,0.00017707217,0.000025423878,0.0000036637637,0.0036888374,0.8454013,0.010828245,0.001651355,0.002798786,0.13313763],"study_design_scores_gemma":[0.00089814165,0.00012380606,0.0010247482,0.00027067334,0.000015510052,0.000030145304,0.0010170824,0.9952162,0.0005757757,0.00063453225,0.00009678811,0.00009658513],"about_ca_topic_score_codex":0.0000322914,"about_ca_topic_score_gemma":0.0000040022487,"teacher_disagreement_score":0.7567168,"about_ca_system_score_codex":0.000107040876,"about_ca_system_score_gemma":0.00019243066,"threshold_uncertainty_score":0.4492542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039732646,0.00018617765,0.9588892,0.00018664579,0.00033528285,0.0002352688,0.000010660663,0.00003237701,0.00039177906],"genre_scores_gemma":[0.77911276,0.0000017662298,0.22053312,0.00010058996,0.00019939872,0.0000062675754,0.000007505947,0.000015150371,0.000023464478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977693,0.0001655016,0.000851067,0.00021203863,0.0008171323,0.00018494003],"domain_scores_gemma":[0.9965522,0.00018785556,0.0012178939,0.00013412813,0.0017485399,0.00015937362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019593155,0.00016093095,0.00037090987,0.00040184168,0.00009769736,0.00023329347,0.00030769178,0.00006487817,0.0000028536767],"category_scores_gemma":[0.0001608496,0.00014010315,0.00016450741,0.00023279186,0.000028331457,0.00092021027,0.000012622667,0.00013878963,0.0000069241223],"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.0005603574,0.0005519521,0.000030908257,0.00045920975,0.000057006157,0.000063614934,0.00073006377,0.34150255,0.008323055,0.00019025082,0.00094110944,0.64658993],"study_design_scores_gemma":[0.0010705043,0.00050486776,0.000006450006,0.0011877253,0.00004745525,0.00025887103,0.00015425595,0.96675,0.026410034,0.0033745542,0.000075885226,0.00015937322],"about_ca_topic_score_codex":0.000009597158,"about_ca_topic_score_gemma":5.245669e-7,"teacher_disagreement_score":0.7393801,"about_ca_system_score_codex":0.00015736606,"about_ca_system_score_gemma":0.00048903364,"threshold_uncertainty_score":0.57132405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51739824,0.00517981,0.47542086,0.00004888369,0.0011318735,0.0003527599,0.0000018411889,0.00012312701,0.00034260325],"genre_scores_gemma":[0.9992863,0.000016909333,0.00014364386,0.00001851193,0.0004367577,0.000009471513,0.0000015515199,0.000060087285,0.000026772503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981858,0.00011660235,0.00090379664,0.00012159355,0.000372363,0.00029982155],"domain_scores_gemma":[0.99892724,0.00012494298,0.00044098066,0.0001191669,0.0002503644,0.00013730874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010406319,0.00020734742,0.0004028422,0.00021661624,0.000063515494,0.00015049,0.00025077566,0.00012468679,0.0000038319445],"category_scores_gemma":[0.00003916275,0.00014840832,0.00006544969,0.00040960335,0.00002874396,0.00035002394,0.000010307304,0.00043287428,0.0000047906747],"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.000037129892,0.000022308419,0.000046009525,0.000108532164,0.000027141255,0.000078264675,0.0005400105,0.9946853,0.00072520087,0.000030763727,0.00036910537,0.0033302621],"study_design_scores_gemma":[0.00043154857,0.000111391986,0.0000043722816,0.0013000842,0.000016097923,0.0005122829,0.0007389509,0.99623173,0.00036170034,0.000039771054,0.000085538595,0.00016651803],"about_ca_topic_score_codex":0.000003416633,"about_ca_topic_score_gemma":0.000003753377,"teacher_disagreement_score":0.48188806,"about_ca_system_score_codex":0.00032388393,"about_ca_system_score_gemma":0.00009125281,"threshold_uncertainty_score":0.6051916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035700716,0.0006914681,0.96164966,0.00061353715,0.0007107496,0.00024049566,0.000006449383,0.00021065012,0.00017625015],"genre_scores_gemma":[0.95986915,0.000008527215,0.03932927,0.00009926696,0.0004506411,0.000011771483,2.7078985e-7,0.000029650104,0.00020143228],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975804,0.00019001811,0.0009481735,0.00032108065,0.0005198621,0.0004404606],"domain_scores_gemma":[0.996643,0.00040335237,0.0014114134,0.00027949875,0.0010777018,0.00018501143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025204197,0.000243988,0.0005079212,0.00029735136,0.00026843167,0.00048825558,0.0013109266,0.00011642033,0.0000033160288],"category_scores_gemma":[0.00020489958,0.00015928104,0.0001932323,0.00031356467,0.000116161085,0.0015415539,0.00009546791,0.00021949368,0.000007584842],"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.0005256108,0.00065194233,0.0053763185,0.003960048,0.00026733548,0.00022144441,0.0044861864,0.0012979206,0.62416786,0.009577238,0.0136727905,0.3357953],"study_design_scores_gemma":[0.00961177,0.005316854,0.0028805917,0.049912713,0.00030703502,0.00586514,0.0021959306,0.49273255,0.34051895,0.07657506,0.009602303,0.0044811117],"about_ca_topic_score_codex":0.000025359319,"about_ca_topic_score_gemma":0.000007027431,"teacher_disagreement_score":0.92416847,"about_ca_system_score_codex":0.00021946544,"about_ca_system_score_gemma":0.0004121004,"threshold_uncertainty_score":0.6495292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37030247,0.0019826798,0.6246198,0.0024090891,0.00035853675,0.00018751065,0.00005729722,0.00006029261,0.000022363043],"genre_scores_gemma":[0.9957907,0.000005363729,0.0024566844,0.00024015864,0.0010388177,0.000014847873,0.000002941323,0.000053618183,0.0003968551],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962254,0.00057703065,0.0006486181,0.00070465705,0.001412928,0.0004313751],"domain_scores_gemma":[0.99358135,0.0038812193,0.0014920175,0.0001643854,0.0007167538,0.00016425308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095796934,0.0003944023,0.00075506564,0.0007435481,0.00095010485,0.0003552262,0.00024104533,0.0001696655,0.000029891513],"category_scores_gemma":[0.0017494161,0.00023538613,0.00025857726,0.001667144,0.00019163986,0.0017234165,0.00007938469,0.00049486733,0.000004717284],"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.00065628334,0.0002998533,0.06875052,0.00013070823,0.0008670122,0.000087172455,0.000501102,0.012066658,0.83684546,0.000029672403,0.0010209967,0.078744546],"study_design_scores_gemma":[0.015033154,0.003078338,0.09798826,0.010751447,0.0078455,0.0059077335,0.0065849577,0.66576856,0.15342964,0.0018181979,0.027986662,0.0038075761],"about_ca_topic_score_codex":0.00018434759,"about_ca_topic_score_gemma":0.00007362128,"teacher_disagreement_score":0.68341583,"about_ca_system_score_codex":0.0004076442,"about_ca_system_score_gemma":0.00030500573,"threshold_uncertainty_score":0.95987684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04627242,0.00018064912,0.95281065,0.00012714101,0.00018426716,0.0002218751,9.843659e-7,0.000095089395,0.0001069079],"genre_scores_gemma":[0.71599764,9.620879e-7,0.2837604,0.000019724073,0.0001913192,0.0000068169347,1.1522497e-7,0.000010536958,0.000012504094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834853,0.000053837746,0.00063081324,0.00024159756,0.00052064133,0.0002045903],"domain_scores_gemma":[0.9974151,0.000023998042,0.001078535,0.0006429615,0.0006287052,0.00021065274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017119702,0.00014630081,0.0003206589,0.00016546421,0.0003524068,0.000927009,0.001821509,0.00007355274,0.000001063673],"category_scores_gemma":[0.000040513405,0.0001270691,0.00007063212,0.00014149386,0.000036415222,0.0016936838,0.00023732634,0.00020402053,0.000003258039],"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.00010664544,0.00045735942,0.033460677,0.0015737468,0.00011773825,0.0002077106,0.0022422278,0.10620563,0.14269039,0.022484789,0.0012073215,0.68924576],"study_design_scores_gemma":[0.0003332189,0.0001877708,0.0050397674,0.001515713,0.00003100082,0.00063378323,0.000015378067,0.978738,0.0040590223,0.0010566487,0.007960227,0.00042948526],"about_ca_topic_score_codex":0.00019869972,"about_ca_topic_score_gemma":0.0000012904887,"teacher_disagreement_score":0.87253237,"about_ca_system_score_codex":0.00017391799,"about_ca_system_score_gemma":0.00026479727,"threshold_uncertainty_score":0.89391685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043917477,0.0013005948,0.9525195,0.0005078397,0.0011502818,0.00031829372,0.0000018953142,0.00013935371,0.00014477473],"genre_scores_gemma":[0.9209615,0.000004310623,0.07820111,0.00004959752,0.0006643112,0.0000106508105,2.3912855e-7,0.000030037949,0.00007827665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785095,0.000087908134,0.000718771,0.00032541584,0.00063027244,0.00038665195],"domain_scores_gemma":[0.9961543,0.00013098489,0.002184878,0.0005874111,0.00077609264,0.00016632161],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013572774,0.00025208932,0.0004997207,0.00026532856,0.0007638333,0.0015383416,0.0024719127,0.00015233885,7.751693e-7],"category_scores_gemma":[0.0002763633,0.00019886545,0.00022228782,0.00012040984,0.000070481394,0.0010729445,0.00015521498,0.0004778123,7.592905e-7],"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.00045401347,0.00032170105,0.0070235063,0.0037197198,0.00061323924,0.0007299874,0.010686813,0.055114493,0.11488754,0.0019865842,0.004428073,0.80003434],"study_design_scores_gemma":[0.0035243698,0.0019699198,0.0043600583,0.007548996,0.00024791216,0.007271629,0.00058215065,0.9023323,0.03896875,0.02516633,0.0062634973,0.0017641071],"about_ca_topic_score_codex":0.000022226162,"about_ca_topic_score_gemma":0.0000126998075,"teacher_disagreement_score":0.877044,"about_ca_system_score_codex":0.00011102356,"about_ca_system_score_gemma":0.0003283713,"threshold_uncertainty_score":0.9994981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059677348,0.00026761298,0.93868154,0.0003234809,0.0005072152,0.0001359763,0.000001729099,0.000008840367,0.0003962659],"genre_scores_gemma":[0.99901026,8.2440806e-7,0.0008397041,0.00002440685,0.000077420606,0.0000014940317,5.51949e-7,0.0000050321446,0.00004028742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852633,0.000081905164,0.00061045453,0.000101090525,0.000563113,0.00011707365],"domain_scores_gemma":[0.9973494,0.00003096221,0.0019998008,0.00017137452,0.0004011392,0.000047328977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865704,0.00008488966,0.00017372625,0.00006385415,0.00027448358,0.00078970334,0.00068049016,0.000026996448,8.032296e-7],"category_scores_gemma":[0.000027950902,0.00005539275,0.00007279775,0.000092388465,0.000049449867,0.0009179989,0.0000667016,0.000080764694,0.0000019428512],"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.00010254347,0.0006204477,0.004512863,0.0013557066,0.00015207297,0.000020415093,0.007619589,0.10370887,0.20424366,0.0030655276,0.012582363,0.6620159],"study_design_scores_gemma":[0.00078742614,0.00028005804,0.003404455,0.0011772417,0.000024069255,0.00016449997,0.00018165911,0.97042996,0.021710083,0.0012935924,0.0003860969,0.00016085264],"about_ca_topic_score_codex":0.000014631459,"about_ca_topic_score_gemma":3.7296044e-7,"teacher_disagreement_score":0.93933296,"about_ca_system_score_codex":0.000052771422,"about_ca_system_score_gemma":0.00009782315,"threshold_uncertainty_score":0.76151276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06632546,0.0042226063,0.9276744,0.00017072709,0.0006443971,0.00014578667,7.4462315e-7,0.00023839028,0.00057745795],"genre_scores_gemma":[0.95581657,0.000010866998,0.043517236,0.00008449745,0.00016389089,0.0000015807428,1.5727521e-7,0.000018741297,0.0003864574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983739,0.00008537659,0.000548379,0.0002302976,0.0005115593,0.0002504408],"domain_scores_gemma":[0.998343,0.0001158272,0.0007742681,0.00020275047,0.00043296505,0.00013120074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066067,0.00016236446,0.00034979364,0.0002690481,0.00013167418,0.00063435116,0.0007155364,0.000090393754,0.000004340588],"category_scores_gemma":[0.000055028828,0.00013385751,0.00007228424,0.000331294,0.000037719325,0.0013310703,0.00011644557,0.00035016917,0.00000884787],"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.00020598964,0.0004322567,0.2319021,0.0050600427,0.00028238975,0.00044849588,0.014386595,0.007814972,0.08198528,0.0033148169,0.01052351,0.64364356],"study_design_scores_gemma":[0.0054492163,0.00625527,0.008268318,0.026776958,0.00024683043,0.027315581,0.006867636,0.8337246,0.04470958,0.011282499,0.024974922,0.0041285497],"about_ca_topic_score_codex":0.000042880023,"about_ca_topic_score_gemma":0.0000016318415,"teacher_disagreement_score":0.8894911,"about_ca_system_score_codex":0.000087537126,"about_ca_system_score_gemma":0.00023811564,"threshold_uncertainty_score":0.61170626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048892867,0.0007063632,0.9494688,0.00005447779,0.00036845155,0.0004116193,0.000004068713,0.00003828558,0.000055079694],"genre_scores_gemma":[0.9927543,0.0000017686222,0.0061075496,0.000060041068,0.0010224762,0.000017261993,0.0000044036688,0.000025716867,0.0000065117347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986774,0.000071959636,0.00059512595,0.00012060366,0.00026394337,0.00027097244],"domain_scores_gemma":[0.99900097,0.00034206832,0.0002816988,0.000076198296,0.00024109495,0.000057983027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010565404,0.00015764326,0.0002974339,0.00008639783,0.0002372973,0.00014035503,0.00023313782,0.00008772011,0.000004078736],"category_scores_gemma":[0.000037843634,0.00011464749,0.00006278967,0.00020511223,0.00011331645,0.00030525343,0.00001188536,0.00043547456,7.3786276e-7],"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.00019664517,0.000025556596,0.00015261465,0.0002306622,0.000015271773,0.000033421373,0.00025274578,0.9814939,0.015270746,0.0002547851,0.00056546024,0.0015081909],"study_design_scores_gemma":[0.0006310184,0.00023219502,0.00025253883,0.00042374968,0.00001971068,0.00050930935,0.00016199882,0.9965794,0.0005715943,0.0002668478,0.00021696856,0.00013468802],"about_ca_topic_score_codex":0.0000015390999,"about_ca_topic_score_gemma":0.000002028151,"teacher_disagreement_score":0.9438614,"about_ca_system_score_codex":0.00008094037,"about_ca_system_score_gemma":0.000049592963,"threshold_uncertainty_score":0.4675189},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28369072,0.00400518,0.7116991,0.00003090819,0.000100270896,0.000106051346,4.9435073e-7,0.000018956442,0.00034831566],"genre_scores_gemma":[0.99499804,0.00020205358,0.0044770692,0.000035986803,0.00018500183,0.0000064145183,7.585146e-7,0.000008207409,0.000086483145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.00016032241,0.00065832207,0.00015981334,0.00038728432,0.00017753209],"domain_scores_gemma":[0.99634403,0.000095802345,0.00095105346,0.0002748945,0.0022506888,0.000083517225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564109,0.00014133305,0.00048227198,0.0003381671,0.00025976947,0.00021237011,0.000798473,0.000049690327,0.000013751536],"category_scores_gemma":[0.000014153225,0.00009484582,0.00008143267,0.0020361647,0.0001614701,0.00086287974,0.000096806514,0.00022369056,0.0000015614598],"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.0002787989,0.0003714637,0.024908489,0.00018659544,0.0022115854,0.000016838036,0.00837567,0.7879535,0.008412597,0.0010160807,0.00054652744,0.1657219],"study_design_scores_gemma":[0.00033989115,0.0005550239,0.0013416349,0.0006223887,0.00013709355,0.000032656615,0.00020863947,0.993779,0.0016050664,5.511916e-7,0.0012480807,0.00012996756],"about_ca_topic_score_codex":0.0000022890754,"about_ca_topic_score_gemma":0.000004757346,"teacher_disagreement_score":0.7113073,"about_ca_system_score_codex":0.00004866094,"about_ca_system_score_gemma":0.00020153813,"threshold_uncertainty_score":0.38677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015343748,0.00038009215,0.98328406,0.00018429112,0.00043175096,0.00018799493,0.0000039741412,0.000054391934,0.00012967284],"genre_scores_gemma":[0.8955529,0.0000020939103,0.10404034,0.000033623084,0.00031961713,0.0000073049077,8.812612e-7,0.000011767174,0.00003148096],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852127,0.000068650064,0.000731126,0.00014316879,0.00035904266,0.00017673132],"domain_scores_gemma":[0.99738914,0.00008894485,0.0010025378,0.0001272593,0.001333692,0.00005842052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443625,0.000107628584,0.00024731387,0.0002594841,0.00024851656,0.00024188917,0.00053246535,0.0000437488,0.000003370445],"category_scores_gemma":[0.00006318051,0.00009008811,0.00008860065,0.0002650943,0.00004168343,0.0010955861,0.000042459742,0.00010471683,9.608382e-7],"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.00022334197,0.0004175306,0.013676312,0.0025610116,0.0004074607,0.000025724174,0.044291012,0.005988047,0.59439754,0.009374535,0.016503341,0.31213418],"study_design_scores_gemma":[0.0018228967,0.0031388947,0.0007305529,0.0039266716,0.00015063229,0.000827943,0.008386262,0.7572203,0.21561725,0.0022850898,0.0051886574,0.0007047994],"about_ca_topic_score_codex":0.000050802842,"about_ca_topic_score_gemma":0.000013720055,"teacher_disagreement_score":0.88020915,"about_ca_system_score_codex":0.0000858352,"about_ca_system_score_gemma":0.00029386283,"threshold_uncertainty_score":0.36736867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15665169,0.0028974835,0.8394387,0.00008839358,0.000597383,0.0002745405,7.246227e-7,0.000039483602,0.000011598878],"genre_scores_gemma":[0.9545975,0.000013833307,0.044670258,0.00006248836,0.0005876967,0.0000073871506,5.597211e-7,0.000020319929,0.000039954033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818933,0.000049174327,0.0007569357,0.00026461596,0.00041018828,0.0003297754],"domain_scores_gemma":[0.9976654,0.0005047229,0.0009575229,0.00025223976,0.00048627806,0.00013383816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004859389,0.00018874471,0.0003835365,0.00020172552,0.0002802547,0.00026072055,0.00087232864,0.0000865286,0.0000019676136],"category_scores_gemma":[0.00003070053,0.00014947893,0.00011995527,0.00061833207,0.000028999772,0.001427727,0.00014032306,0.00027941505,0.0000020161583],"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.00004235597,0.000031516174,0.0006681921,0.000048384478,0.000010471,0.0000072725807,0.00007976223,0.9359601,0.005067622,0.00036689904,0.000063039435,0.0576544],"study_design_scores_gemma":[0.0004611941,0.0002704774,0.0002585735,0.0005084003,0.000014284723,0.00027966846,0.000032282296,0.9969689,0.00012475459,0.0005489984,0.00036386424,0.00016855665],"about_ca_topic_score_codex":0.0000026708774,"about_ca_topic_score_gemma":3.10822e-7,"teacher_disagreement_score":0.7979458,"about_ca_system_score_codex":0.00009095026,"about_ca_system_score_gemma":0.00011422619,"threshold_uncertainty_score":0.6095574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024349643,0.0022029234,0.97207,0.0004214813,0.00036153485,0.00023244921,0.000005108394,0.00031258274,0.000044323027],"genre_scores_gemma":[0.84231424,0.0000017670858,0.15681976,0.0002700091,0.0005431509,0.000006613982,7.274972e-7,0.00002698417,0.00001671345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793494,0.00012287832,0.00075140037,0.00030748508,0.0005801502,0.00030313263],"domain_scores_gemma":[0.9974651,0.00016434497,0.00097367656,0.00020220659,0.00091470586,0.00028000705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010447653,0.000202623,0.00043264517,0.00010603161,0.00024260153,0.0007244274,0.0012772308,0.000102554186,0.0000032406517],"category_scores_gemma":[0.00019203463,0.0001671029,0.0001458008,0.00037743628,0.00003776501,0.0007585611,0.00006732843,0.00031162103,0.000002046667],"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.0009539112,0.0017473061,0.017949842,0.008043696,0.00043800703,0.00071825227,0.04082906,0.28489682,0.17113154,0.004801764,0.03744214,0.43104768],"study_design_scores_gemma":[0.00053908525,0.0013654571,0.00009516274,0.0010963641,0.000041616357,0.00048980286,0.0006894811,0.9849161,0.006913121,0.0003106455,0.0031548352,0.00038831242],"about_ca_topic_score_codex":0.000028540782,"about_ca_topic_score_gemma":0.0000035667113,"teacher_disagreement_score":0.8179646,"about_ca_system_score_codex":0.00009716275,"about_ca_system_score_gemma":0.0003833061,"threshold_uncertainty_score":0.69856703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018004205,0.0017710725,0.9784966,0.00042135935,0.0007463346,0.00009341413,8.507798e-7,0.0002835214,0.00018263052],"genre_scores_gemma":[0.9582712,0.000017558179,0.041089896,0.00006843691,0.00031451165,0.0000029528262,5.8140273e-8,0.00002312408,0.00021223443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977746,0.00013253787,0.0008093778,0.00024727627,0.0006927603,0.0003434599],"domain_scores_gemma":[0.99746346,0.00020146024,0.0011292225,0.00026746778,0.0007698886,0.00016847628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013387915,0.0001923659,0.00036121375,0.0003207012,0.00016133011,0.00032115547,0.0012796371,0.00011276778,0.000005788925],"category_scores_gemma":[0.00019588837,0.00011898105,0.00013707869,0.00037965778,0.000053408818,0.0017678074,0.00010269767,0.00025154557,0.000018621675],"study_design_candidate":"design_other","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.00007341214,0.0002766313,0.014891908,0.0007767098,0.00011747603,0.0005361116,0.0024722817,0.00030286686,0.11643153,0.0010477805,0.0075434605,0.85552984],"study_design_scores_gemma":[0.015091112,0.012531178,0.010629331,0.14021711,0.0006078503,0.05435027,0.0032946868,0.14151084,0.4881167,0.08338312,0.039561186,0.010706604],"about_ca_topic_score_codex":0.0000145348695,"about_ca_topic_score_gemma":0.0000012128627,"teacher_disagreement_score":0.940267,"about_ca_system_score_codex":0.00018264397,"about_ca_system_score_gemma":0.00040356856,"threshold_uncertainty_score":0.48519063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121207945,0.002332729,0.9845266,0.00012609448,0.00024378981,0.0003758719,0.0000034492084,0.000121819074,0.00014887264],"genre_scores_gemma":[0.8617859,0.000010171395,0.13721302,0.00006314568,0.00065613614,0.00011598386,0.000010994644,0.00008066437,0.000063969244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789006,0.00011019425,0.0008912919,0.0002867102,0.00046366514,0.00035811274],"domain_scores_gemma":[0.9975774,0.00016540823,0.00066695386,0.00014672148,0.0012233444,0.0002201579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078044744,0.00026908374,0.0005296639,0.00016115753,0.00020670553,0.0003691698,0.00021070172,0.00015157921,0.000001859217],"category_scores_gemma":[0.000071654445,0.00022975933,0.00008414669,0.0006068381,0.000028593002,0.0005772606,0.000018173203,0.00031037716,7.7639044e-7],"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.00011938043,0.00003953896,0.00005911755,0.0011715847,0.000074848336,0.000028145943,0.0006013321,0.8945058,0.033943947,0.00015196463,0.00015797523,0.06914638],"study_design_scores_gemma":[0.00066421763,0.00020064114,0.000057412708,0.0019885546,0.00010945302,0.0003553486,0.00057316554,0.977099,0.017630458,0.00029360226,0.00072358927,0.00030453285],"about_ca_topic_score_codex":0.000007327792,"about_ca_topic_score_gemma":0.00001996025,"teacher_disagreement_score":0.8496651,"about_ca_system_score_codex":0.00025737486,"about_ca_system_score_gemma":0.00026678835,"threshold_uncertainty_score":0.9369314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026244862,0.0037940766,0.96808785,0.00008946511,0.0009761683,0.00033838855,0.00007174628,0.00026111837,0.00013635079],"genre_scores_gemma":[0.99777824,0.000025343308,0.0014898375,0.000081694874,0.00024853568,0.00003673657,0.000043952943,0.000072398434,0.00022329284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803454,0.000068454974,0.0009111698,0.0001533166,0.00053073623,0.00030180326],"domain_scores_gemma":[0.9987544,0.000092143295,0.0005649341,0.00013093861,0.0003871173,0.00007045867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887242,0.00021582017,0.0004322993,0.00041633367,0.00036211533,0.00016025861,0.00038169735,0.00020781907,0.000034431367],"category_scores_gemma":[0.00007301839,0.00020161542,0.00013585248,0.000607008,0.000047193505,0.0003109041,0.00004435819,0.0008589866,0.000001166041],"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.000067307104,0.00010032642,0.0003507525,0.00064690004,0.00007967205,0.000026658969,0.00029732985,0.97524184,0.0048615113,0.00021573306,0.00053227093,0.017579678],"study_design_scores_gemma":[0.0012523143,0.00023434316,0.000094444375,0.000370066,0.00006314639,0.00019797629,0.002977462,0.9826193,0.0011656093,0.00021058702,0.010537739,0.0002770042],"about_ca_topic_score_codex":0.000005390967,"about_ca_topic_score_gemma":0.0000032928913,"teacher_disagreement_score":0.97153336,"about_ca_system_score_codex":0.00040802467,"about_ca_system_score_gemma":0.0001332115,"threshold_uncertainty_score":0.8221638},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035837084,0.0040114946,0.9586743,0.0002445167,0.00058203284,0.000115004026,0.000001919185,0.00005902063,0.00047462116],"genre_scores_gemma":[0.89090246,0.000014063612,0.107248016,0.00031303344,0.0006314392,0.0000047451367,0.0000018782717,0.000034566197,0.000849782],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644053,0.0008398033,0.00093335175,0.00041589155,0.00091426156,0.00045619137],"domain_scores_gemma":[0.9964975,0.00013445618,0.0010066578,0.00030844563,0.0018169266,0.00023601703],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016260514,0.00032567038,0.00070031796,0.00024509017,0.00028034614,0.0011378152,0.0007882658,0.00012438529,0.000018331268],"category_scores_gemma":[0.000034172623,0.00022411539,0.00017654877,0.00089093065,0.00010298381,0.0014827433,0.00009831629,0.0004416559,0.000008139718],"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.0017380752,0.00062766223,0.0005700435,0.0007196639,0.0010908929,0.016201902,0.007944863,0.084275685,0.737526,0.004444367,0.0030989072,0.14176193],"study_design_scores_gemma":[0.007152126,0.0018591403,0.00030279427,0.003473219,0.00025976688,0.02412572,0.0005966001,0.65712786,0.29669207,0.005128809,0.0018631447,0.0014187475],"about_ca_topic_score_codex":0.000027348879,"about_ca_topic_score_gemma":0.0000012997656,"teacher_disagreement_score":0.8550654,"about_ca_system_score_codex":0.000120488905,"about_ca_system_score_gemma":0.0007844899,"threshold_uncertainty_score":0.9998991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018993877,0.01338036,0.96492714,0.00079210673,0.0010743844,0.00039909768,0.000014077692,0.000119716744,0.0002992377],"genre_scores_gemma":[0.97603005,0.000023571372,0.021203734,0.0003396322,0.0020603742,0.00006126147,0.000005587684,0.000032951066,0.00024282734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967504,0.00020675275,0.0010400614,0.00045107256,0.0009133436,0.0006383601],"domain_scores_gemma":[0.99735314,0.00017133256,0.0014514324,0.0002806333,0.0004678171,0.00027567527],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011579423,0.00027909636,0.00052784587,0.00013779271,0.0013011406,0.00035048806,0.0010283501,0.00007610332,0.000020869256],"category_scores_gemma":[0.000025101373,0.00026294374,0.000113864065,0.0013334559,0.000119386124,0.0008200003,0.00043542267,0.00076392246,0.000004315837],"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.000045922934,0.0001487018,0.00027396606,0.00008690919,0.00008267778,0.000057550318,0.00039981696,0.95710653,0.009781701,0.012930805,0.0117398035,0.007345629],"study_design_scores_gemma":[0.0017675225,0.00054175634,0.0012300904,0.00041798825,0.00006746894,0.0052916356,0.00034589664,0.9571659,0.00010771891,0.005612784,0.026803646,0.0006476161],"about_ca_topic_score_codex":0.0000146127395,"about_ca_topic_score_gemma":0.0000022511076,"teacher_disagreement_score":0.9570362,"about_ca_system_score_codex":0.0002264411,"about_ca_system_score_gemma":0.00042355715,"threshold_uncertainty_score":0.99999905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11775647,0.0005892902,0.88053274,0.00022568917,0.00046793846,0.00030184505,0.00000859226,0.000074139476,0.000043280445],"genre_scores_gemma":[0.96533895,0.0000020275018,0.03437749,0.00006985179,0.00012559528,0.000028526421,0.0000011735077,0.000015505479,0.000040874103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787587,0.00018758865,0.0008670152,0.00019505338,0.0006636799,0.0002107975],"domain_scores_gemma":[0.9969591,0.00021149317,0.0016978253,0.00016968083,0.0008977341,0.000064181106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024076567,0.00012928253,0.00037128833,0.00024365759,0.00031280817,0.00016020042,0.00072911626,0.000034611778,0.000008620681],"category_scores_gemma":[0.000054475353,0.00011975047,0.00013872552,0.00033900596,0.000024028692,0.0006775066,0.00017079012,0.00024823946,3.7775976e-7],"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.0011487205,0.0018101769,0.035696656,0.012211063,0.0009214909,0.00039872585,0.07143666,0.03772146,0.36572596,0.011160818,0.047057282,0.414711],"study_design_scores_gemma":[0.0054472466,0.0069363345,0.0030085777,0.0039064884,0.00040998255,0.005696957,0.035481784,0.63443446,0.28560942,0.011901137,0.005466419,0.0017011988],"about_ca_topic_score_codex":0.00007672663,"about_ca_topic_score_gemma":0.000009194778,"teacher_disagreement_score":0.84758246,"about_ca_system_score_codex":0.00020985525,"about_ca_system_score_gemma":0.0004122308,"threshold_uncertainty_score":0.48832825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009107321,0.0023764698,0.9863476,0.0007184567,0.0007674071,0.0005167197,0.000011394758,0.00009289338,0.00006172356],"genre_scores_gemma":[0.95646584,0.000018067167,0.04205057,0.00019639013,0.00056530925,0.00021844833,0.0000034759582,0.00003260066,0.0004492887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973607,0.00008062944,0.00095108507,0.0004130401,0.0007699462,0.00042460393],"domain_scores_gemma":[0.9969903,0.00032744443,0.001507413,0.00030417932,0.00070369756,0.0001669653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712728,0.00023832878,0.00045018172,0.0002167254,0.00079958525,0.00027881513,0.0012235068,0.00005865583,0.000006170504],"category_scores_gemma":[0.00007757212,0.00020730669,0.00012969186,0.0009769999,0.00006646833,0.00089626596,0.0002624289,0.0004939067,0.0000040164355],"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.00031216812,0.0019702727,0.0012936952,0.0014576435,0.00018800638,0.00015476067,0.0057230406,0.68430626,0.020177007,0.025815956,0.0061739828,0.25242722],"study_design_scores_gemma":[0.0030310468,0.0015479869,0.00032728113,0.00066645193,0.00006859641,0.0016062668,0.00083141215,0.9158578,0.0025031338,0.01634174,0.056275822,0.0009424799],"about_ca_topic_score_codex":0.000015695843,"about_ca_topic_score_gemma":0.000002456713,"teacher_disagreement_score":0.94735855,"about_ca_system_score_codex":0.00023210017,"about_ca_system_score_gemma":0.0005138032,"threshold_uncertainty_score":0.84537214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030719044,0.001061577,0.96689326,0.00039403094,0.00032717205,0.0003308153,0.0000015526332,0.00024262872,0.000029943023],"genre_scores_gemma":[0.96294963,0.00008996948,0.035777036,0.000023722117,0.0008255145,0.000010637103,0.000007395814,0.000024745903,0.00029134535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975028,0.00024011682,0.000986055,0.00028086852,0.00058158906,0.00040855943],"domain_scores_gemma":[0.99770284,0.00034578066,0.0010707674,0.00013880401,0.00066227163,0.00007952659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027950653,0.000157533,0.00040984398,0.00043036588,0.00023569257,0.00039257554,0.00046707055,0.000117193784,9.613935e-7],"category_scores_gemma":[0.00049621274,0.00013883437,0.000089733505,0.0020839756,0.000044873803,0.0019017986,0.00007919877,0.0004267491,0.0000035309013],"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.0056638876,0.00042029528,0.009912118,0.0026690627,0.00026352354,0.0024295424,0.0059384387,0.3262768,0.37676668,0.006403227,0.027475037,0.2357814],"study_design_scores_gemma":[0.0059133107,0.002957083,0.008486681,0.005373655,0.000084538966,0.0007844255,0.00091427396,0.8590748,0.078690626,0.032330137,0.0043311412,0.0010593346],"about_ca_topic_score_codex":0.000017693805,"about_ca_topic_score_gemma":7.799992e-7,"teacher_disagreement_score":0.9322306,"about_ca_system_score_codex":0.00015179299,"about_ca_system_score_gemma":0.0002097679,"threshold_uncertainty_score":0.5661501},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014408255,0.0006088213,0.983524,0.0007596452,0.0001543835,0.00006213648,2.8886188e-7,0.00008005164,0.0004023778],"genre_scores_gemma":[0.9945337,0.000007647657,0.005106904,0.000042951775,0.00009956199,0.0000029155324,5.2924867e-7,0.000009849399,0.00019590788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984505,0.000114570044,0.00045428227,0.00020979079,0.0005797578,0.00019106313],"domain_scores_gemma":[0.9989562,0.00011231855,0.00052987295,0.000112947055,0.0001751384,0.00011352398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751102,0.000115475064,0.00022756546,0.00077694934,0.00027478172,0.00081668,0.00041328702,0.00006927067,8.308247e-7],"category_scores_gemma":[0.000059177368,0.00009253401,0.00006168727,0.0011220105,0.000023090974,0.00052287587,0.00005932615,0.00034735055,0.000008426336],"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.000020974061,0.00008781042,0.00032265027,0.00050536805,0.000021864358,0.000038708058,0.0056590373,0.7639283,0.0022149482,0.0015790961,0.0001436872,0.22547756],"study_design_scores_gemma":[0.00020642247,0.00005656271,0.00019240132,0.00030529866,0.000006407393,0.000051218358,0.000465708,0.99780446,0.00017769575,0.00045109694,0.00017756653,0.00010514449],"about_ca_topic_score_codex":0.000003587205,"about_ca_topic_score_gemma":2.7483642e-7,"teacher_disagreement_score":0.9801255,"about_ca_system_score_codex":0.000049598933,"about_ca_system_score_gemma":0.00012112841,"threshold_uncertainty_score":0.7875264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898955,0.00017762173,0.008669655,0.0005847313,0.00013560674,0.00032267554,3.119726e-7,0.000073283154,0.00014059221],"genre_scores_gemma":[0.99945384,0.0000023627108,0.00034111776,0.00003196273,0.00004061232,0.00003457708,1.3312759e-7,0.000010145062,0.000085225845],"study_design_codex":"case_report","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815714,0.00012804248,0.00077195774,0.0002525374,0.0003566619,0.0003336811],"domain_scores_gemma":[0.9992717,0.000034119817,0.00025161327,0.00025933745,0.00011564278,0.00006761626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023060832,0.00013953377,0.00029999192,0.0010134595,0.00010670113,0.00015877423,0.00071676174,0.00020461249,0.000002884031],"category_scores_gemma":[0.000005904994,0.00010426937,0.00003873056,0.0013666359,0.000037159974,0.00019090007,0.00021024328,0.0008033141,0.000010695638],"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.00015951788,0.008776018,0.083948866,0.002049264,0.00053473446,0.41738376,0.10290366,0.09087144,0.006288949,0.013820292,0.0024217865,0.27084172],"study_design_scores_gemma":[0.009103552,0.0015654674,0.009456561,0.0033766767,0.00007556305,0.035785396,0.13355947,0.78629583,0.0033817242,0.013874859,0.0018580687,0.0016668089],"about_ca_topic_score_codex":0.000048111,"about_ca_topic_score_gemma":0.000019284254,"teacher_disagreement_score":0.69542444,"about_ca_system_score_codex":0.000103895625,"about_ca_system_score_gemma":0.00005965414,"threshold_uncertainty_score":0.42519817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061304606,0.009812795,0.96580863,0.016834743,0.00016621643,0.0005670534,8.776706e-7,0.00014311855,0.00053611235],"genre_scores_gemma":[0.99199796,0.00034655785,0.0070371036,0.00012749078,0.0002644803,0.00002823654,2.7900637e-7,0.000011447593,0.0001864288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986009,0.00031864483,0.0003773695,0.00018272422,0.00035794062,0.00016239147],"domain_scores_gemma":[0.99673724,0.0011452213,0.0013486117,0.00013003948,0.00060231914,0.000036587666],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004145177,0.00012040057,0.00018335847,0.00008403996,0.001338512,0.003075627,0.00049917516,0.000039438994,1.3163364e-7],"category_scores_gemma":[0.00045435035,0.00005241144,0.000047819754,0.00031572412,0.00016430196,0.0010078816,0.0000776461,0.0002466587,4.303183e-7],"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.001826945,0.0002776981,0.0004121526,0.0018375317,0.00045599445,0.00004729656,0.20880456,0.05617033,0.00573991,0.12146184,0.019577136,0.5833886],"study_design_scores_gemma":[0.00070990773,0.00018355102,0.00020324382,0.00049346645,0.000027348571,0.0001747726,0.009037959,0.98481125,0.0002765561,0.0022482197,0.0017202895,0.00011342923],"about_ca_topic_score_codex":0.000004599794,"about_ca_topic_score_gemma":7.6603374e-7,"teacher_disagreement_score":0.9858675,"about_ca_system_score_codex":0.000024764282,"about_ca_system_score_gemma":0.00017027497,"threshold_uncertainty_score":0.9999616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039249707,0.0017063152,0.95742494,0.0002734496,0.00074522366,0.000243488,0.0000018465613,0.00008116439,0.00027386827],"genre_scores_gemma":[0.90439487,0.000015592192,0.09513906,0.000055437566,0.00016181859,0.00000990705,4.891265e-7,0.0000119997185,0.00021082065],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980115,0.00013908224,0.0009951757,0.00021117322,0.00042215883,0.0002208656],"domain_scores_gemma":[0.99633324,0.00030998854,0.0016049666,0.00018601216,0.0015176077,0.000048169702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545851,0.00015631474,0.00047616722,0.00045936884,0.0001946875,0.00025317553,0.00077359506,0.00010455978,0.0000010189733],"category_scores_gemma":[0.0002112081,0.00013571078,0.00013969393,0.0005016965,0.00003164801,0.00072867353,0.000065961816,0.00018516692,2.694452e-7],"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.00031818225,0.00018479509,0.0025753416,0.0031269365,0.00022689404,0.000030126914,0.0025425972,0.006262705,0.70427245,0.21995826,0.0033776034,0.05712411],"study_design_scores_gemma":[0.0011289332,0.00044316513,0.000057309582,0.005303294,0.00008068102,0.00009192776,0.00034458423,0.7204256,0.23465934,0.0365606,0.00058268686,0.00032187894],"about_ca_topic_score_codex":0.000054749187,"about_ca_topic_score_gemma":0.00000606554,"teacher_disagreement_score":0.86514515,"about_ca_system_score_codex":0.00014987818,"about_ca_system_score_gemma":0.0004702437,"threshold_uncertainty_score":0.5534125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22240806,0.0018177673,0.77337223,0.00014152969,0.0006028036,0.00013852873,0.0000016782609,0.00006630145,0.0014511087],"genre_scores_gemma":[0.97271484,0.000010938227,0.02707745,0.000022799819,0.00010812937,0.0000018114316,3.6497687e-7,0.000012127635,0.000051512132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729145,0.00022278917,0.0013765583,0.00025184787,0.0006247949,0.00023254295],"domain_scores_gemma":[0.9953133,0.0005615628,0.002740481,0.00025297588,0.00106542,0.00006629603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020802203,0.0001896367,0.0006468259,0.00068690226,0.00021376461,0.00020321379,0.0009305976,0.0001014463,0.0000025532645],"category_scores_gemma":[0.00034282618,0.00017000409,0.00014473045,0.0008533172,0.00012896306,0.0007475695,0.00010878101,0.00036579015,3.2868888e-7],"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.00046777917,0.00060994056,0.027956089,0.0082619535,0.00033867394,0.00006715488,0.0075993934,0.04768048,0.6662772,0.06534105,0.0016277093,0.17377253],"study_design_scores_gemma":[0.0007487536,0.0006008093,0.0010162594,0.027556073,0.00007167731,0.00013001614,0.0005957094,0.7129534,0.2483503,0.007533689,0.000060667244,0.0003826646],"about_ca_topic_score_codex":0.00020563323,"about_ca_topic_score_gemma":0.000009997742,"teacher_disagreement_score":0.7503068,"about_ca_system_score_codex":0.00023737097,"about_ca_system_score_gemma":0.00044011776,"threshold_uncertainty_score":0.69325656},"labels":[],"label_agreement":null}]}