{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":36,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":36,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"015f665a58ab","filters":{"venue":"IET Computers & Digital Techniques"}},"results":[{"id":"W3084828086","doi":"10.1049/iet-cdt.2019.0179","title":"High throughput and area‐efficient FPGA implementation of AES for high‐traffic applications","year":2020,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Advanced Encryption Standard; Loop unrolling; Throughput; Byte; AES implementations; Encryption; Parallel computing; Embedded system; Computer hardware; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01814031823590541,"gpt":0.2833424466529851,"spread":0.2652021284170797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588083,0.0001653208,0.0002178978,0.0001142606,0.0001260382,0.0002910941,0.0004291443,0.00004120755,0.000003435864],"category_scores_gemma":[0.000005039681,0.0001643918,0.00008444729,0.0004342699,0.00008929984,0.0004349293,0.0002483308,0.00005863024,7.626468e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002034362,"about_ca_system_score_gemma":0.00003767804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003127929,"about_ca_topic_score_gemma":0.000005770397,"domain_scores_codex":[0.9987602,0.00001417563,0.0003951562,0.0004214758,0.0001962155,0.000212775],"domain_scores_gemma":[0.9992194,0.0001088756,0.0001762581,0.0002708788,0.0001337537,0.00009082784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001048231,0.0001525724,0.0001579902,0.00008938184,0.00005095277,0.000001223417,0.001473681,0.0001257767,0.0004123277,0.2038768,0.005003572,0.7886453],"study_design_scores_gemma":[0.008300502,0.009886449,0.01383473,0.0003313143,0.0002771378,0.0001162831,0.004741882,0.1110179,0.4376731,0.2215382,0.1875568,0.004725768],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07164299,0.0000376117,0.9242778,0.002288851,0.00004496527,0.001058724,0.0001868511,0.0004260997,0.00003612256],"genre_scores_gemma":[0.8230153,0.00001775317,0.1762761,0.000350139,0.00003926237,0.0001974549,0.00009381927,0.000009465901,6.36845e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7839195,"threshold_uncertainty_score":0.6703702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1511491629","doi":"10.1049/iet-cdt.2010.0021","title":"Bit-serial and digit-serial GF(2 <sup> <i>m</i> </sup> ) Montgomery multipliers using linear feedback shift registers","year":2011,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Trinomial; GF(2); Arithmetic; Shift register; Multiplication (music); Computer science; Finite field; Parallel computing; Binary number; Numerical digit; Block (permutation group theory); Mathematics; Discrete mathematics; Chip; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02419302560343754,"gpt":0.2299707600941064,"spread":0.2057777344906689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002239,0.0005707032,0.0005563534,0.0004567797,0.0002882452,0.001101037,0.001387914,0.0002789278,0.000003648205],"category_scores_gemma":[0.00003296052,0.0005413414,0.0003104537,0.0007199214,0.0005756825,0.002607419,0.001087723,0.0003370869,0.0000109772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005884168,"about_ca_system_score_gemma":0.0000845137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001723726,"about_ca_topic_score_gemma":0.000005119555,"domain_scores_codex":[0.9970067,0.00007494197,0.0006416775,0.001061477,0.0004415981,0.0007735918],"domain_scores_gemma":[0.9981539,0.0001381654,0.0002508093,0.0009852224,0.0001015468,0.0003703559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001669887,0.00276897,0.02058693,0.0006126011,0.001201175,0.001447185,0.03155824,0.001162436,0.005422465,0.03027822,0.01732347,0.8859684],"study_design_scores_gemma":[0.01832105,0.01132731,0.01853624,0.004506577,0.0006385141,0.003845727,0.001993369,0.4399383,0.2234354,0.150927,0.1065081,0.02002233],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4241087,0.0001916695,0.5682952,0.0002548693,0.0009094139,0.0009031775,0.00005184723,0.00224214,0.003043049],"genre_scores_gemma":[0.725804,0.00005468608,0.2732425,0.0004099915,0.0003700462,0.00002400186,0.0000149406,0.00005648161,0.00002334049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8659461,"threshold_uncertainty_score":0.9999359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091507826","doi":"10.1049/iet-cdt:20060209","title":"Debug enhancements in assertion-checker generation","year":2007,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Assertion; Debugging; Computer science; Background debug mode interface; Set (abstract data type); Overhead (engineering); Programming language; Algorithmic program debugging; Embedded system; Computer architecture","retraction":null,"screen_n_in":null,"score":{"opus":0.006455475369999442,"gpt":0.2303529738590217,"spread":0.2238974984890222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889997,0.0001414411,0.0001164133,0.0001786325,0.00002218416,0.0001072046,0.0001325904,0.00008934384,0.000003681722],"category_scores_gemma":[0.00001274494,0.0001612291,0.00003657401,0.0002323311,0.00001541967,0.0005278126,0.00002022037,0.0001391188,0.00001606068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002934615,"about_ca_system_score_gemma":0.00001133955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004122324,"about_ca_topic_score_gemma":0.00001973236,"domain_scores_codex":[0.9991364,0.000008151369,0.0002602928,0.0001589173,0.0001503372,0.0002859115],"domain_scores_gemma":[0.9997048,0.00003476406,0.00002894036,0.0001610167,0.00002697332,0.00004352146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001683571,0.0001869574,0.002514838,0.00006021624,0.00007203216,0.00003534249,0.0003553718,0.03727764,0.05526133,0.002468181,0.02081364,0.8809376],"study_design_scores_gemma":[0.0002618622,0.000160197,0.003300295,0.00006753519,0.000004650853,0.00001419845,0.000006819711,0.4219237,0.5547445,0.001004844,0.0180091,0.0005022432],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3742278,0.00009589523,0.6192323,0.0000170896,0.0002684526,0.0002407271,0.000002023135,0.0009964602,0.004919236],"genre_scores_gemma":[0.9849826,0.00001842949,0.01463936,0.00008955033,0.0001430111,0.00002341011,0.00004285522,0.00003031334,0.00003047514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8804353,"threshold_uncertainty_score":0.6574733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169353951","doi":"10.1049/iet-cdt.2013.0017","title":"Unified multi‐objective mapping and architecture customisation of networks‐on‐chip","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Benchmark (surveying); Network on a chip; Reliability (semiconductor); Computer science; Network topology; Routing (electronic design automation); Network architecture; Computer architecture; Chip; Embedded system; Power (physics); Reliability engineering; Topology (electrical circuits); Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0130692556947012,"gpt":0.2169101794572758,"spread":0.2038409237625745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001562265,0.0002056977,0.0002621957,0.0002111084,0.00008163045,0.0004406389,0.0004227757,0.0001119973,0.000001809473],"category_scores_gemma":[0.00001743425,0.0001769763,0.0000877436,0.000287622,0.00007824661,0.0006625011,0.0002134336,0.0001952401,0.000005382864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000406384,"about_ca_system_score_gemma":0.00001499626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005318378,"about_ca_topic_score_gemma":0.000002313153,"domain_scores_codex":[0.9987907,0.00006633901,0.0003417893,0.0003903972,0.0001691416,0.0002415911],"domain_scores_gemma":[0.9990399,0.0001831193,0.000186302,0.0003629189,0.0001466577,0.00008110434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002200387,0.0001661559,0.0009842733,0.0000617288,0.00009914576,0.000008855522,0.002509967,0.003634417,0.0007983313,0.03193384,0.008064941,0.9517164],"study_design_scores_gemma":[0.0007445259,0.001024017,0.006531961,0.0009006414,0.000007550669,0.0001729947,0.0002287004,0.9596372,0.006153593,0.01611243,0.007522298,0.0009640848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01995263,0.00003616524,0.9757542,0.0002370558,0.0003007257,0.0005873004,0.000002217929,0.0005054272,0.002624253],"genre_scores_gemma":[0.9478672,0.000006672517,0.05158361,0.0002659725,0.0001296286,0.00004921086,0.000004300458,0.00001357005,0.00007978654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9560028,"threshold_uncertainty_score":0.7216884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068411283","doi":"10.1049/iet-cdt.2013.0053","title":"Sample preparation with multiple dilutions on digital microfluidic biochips","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Electrowetting and Microfluidic Technologies","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Indian Statistical Institute; Innovation, Science and Economic Development Canada","keywords":"Biochip; Microfluidics; Digital microfluidics; Serial dilution; Sample (material); Dilution; Sample preparation; Computer science; Computer hardware; Lab-on-a-chip; Nanotechnology; Electrowetting; Process engineering; Embedded system; Electrode; Materials science; Chromatography; Chemistry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005253316474402197,"gpt":0.1898671238417767,"spread":0.1846138073673745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003120425,0.0002851503,0.0001971499,0.0001923921,0.00009646267,0.0005412363,0.0002823297,0.0001299313,0.000003743733],"category_scores_gemma":[0.00004488738,0.0002475623,0.00007198085,0.0002502417,0.0001190939,0.0007697179,0.00006886318,0.0002159482,0.00007365453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001008732,"about_ca_system_score_gemma":0.00001568006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002772047,"about_ca_topic_score_gemma":9.294156e-7,"domain_scores_codex":[0.9989365,0.0000062727,0.0002333581,0.0002999903,0.0001393034,0.0003845478],"domain_scores_gemma":[0.9993128,0.0001432269,0.00004037207,0.0003786462,0.00005936035,0.00006563433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003958269,0.0002574846,0.002799529,0.00007238331,0.0001691063,0.00001039494,0.0002461913,0.00007310011,0.178259,0.001244878,0.3339439,0.4828844],"study_design_scores_gemma":[0.0002485068,0.0008927021,0.0004288833,0.0001939566,0.000009507953,0.00006104563,0.00005546086,0.0008658294,0.9388174,0.002505454,0.05529697,0.0006242621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6002837,0.000622261,0.3839211,0.0002527472,0.0001059033,0.0007584057,0.0001313818,0.01122685,0.002697589],"genre_scores_gemma":[0.9913754,0.0001093995,0.008026552,0.00006113426,0.00005257087,0.0001360046,0.0001341165,0.00005406529,0.00005079029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7605584,"threshold_uncertainty_score":0.9999977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124879637","doi":"10.1049/iet-cdt:20060074","title":"Optimised realisations of large integer multipliers and squarers using embedded blocks","year":2007,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Royal Military College of Canada","funders":"","keywords":"Multiplier (economics); Field-programmable gate array; Arithmetic; Integer (computer science); Multiplication (music); Computer science; Mathematics; Adder; Parallel computing; Computer hardware; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009338906035856749,"gpt":0.2439678919098013,"spread":0.2346289858739445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000224557,0.0002320307,0.0002601451,0.0003108413,0.00005593255,0.0000930704,0.0001905792,0.0001303705,0.00000480295],"category_scores_gemma":[0.00001566807,0.0002412322,0.00007308412,0.0002827739,0.0001088473,0.0005704383,0.0000764597,0.0001644974,0.000001432718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024586,"about_ca_system_score_gemma":0.00001646692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008885674,"about_ca_topic_score_gemma":0.000001987027,"domain_scores_codex":[0.9988501,0.000007718858,0.0003896085,0.0002119403,0.0001792983,0.0003613495],"domain_scores_gemma":[0.9993803,0.00009353564,0.00006851005,0.0002739432,0.00007283802,0.0001108773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005687943,0.001462346,0.02140493,0.001957255,0.001798062,0.0003669967,0.0334927,0.1004349,0.3066047,0.005474444,0.07394762,0.4524872],"study_design_scores_gemma":[0.00136376,0.0003596473,0.0009674061,0.0006424793,0.00006618305,0.00009884951,0.0008139816,0.5236167,0.4640977,0.0006147287,0.006000378,0.001358136],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3500984,0.0000608863,0.6452391,0.00001073393,0.0001639262,0.0003249346,0.00003893473,0.00108476,0.002978349],"genre_scores_gemma":[0.9096219,0.00001760091,0.09019194,0.00003555777,0.00004736567,0.000006676324,0.00002206214,0.00004561127,0.00001132065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5595235,"threshold_uncertainty_score":0.9837165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2590023945","doi":"10.1049/iet-cdt.2016.0100","title":"Area‐ and power‐efficient iterative single/double‐precision merged floating‐point multiplier on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Multiplier (economics); Field-programmable gate array; Digital signal processing; Computer science; Virtex; Application-specific integrated circuit; Clock rate; Computer hardware; Floating point; Double-precision floating-point format; Embedded system; Parallel computing; Algorithm; Chip; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03027444964146115,"gpt":0.2961824391776271,"spread":0.265907989536166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003607468,0.0003689145,0.000400361,0.0001555563,0.0005140544,0.002621131,0.001283491,0.0001105396,0.000003252784],"category_scores_gemma":[0.000148792,0.0002983896,0.0001415165,0.0001484414,0.0002125522,0.001078536,0.001219399,0.0002623198,0.00001223172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282733,"about_ca_system_score_gemma":0.00001933459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001159912,"about_ca_topic_score_gemma":3.049509e-7,"domain_scores_codex":[0.9978297,0.00005828822,0.0003923622,0.0008593866,0.0004372126,0.0004230207],"domain_scores_gemma":[0.9979159,0.0002632884,0.0003070424,0.001143579,0.0001458719,0.0002243012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004493219,0.0003237861,0.00007002358,0.000009338892,0.00002010522,0.00004995954,0.0007313796,0.00003061329,0.002032352,0.004142246,0.0009618742,0.9915834],"study_design_scores_gemma":[0.003618315,0.007920267,0.005480664,0.002224579,0.00002869361,0.0002305815,0.0001507009,0.352954,0.5209234,0.06613302,0.0364924,0.003843424],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02386239,0.00003730002,0.9649009,0.0009038572,0.0005766716,0.0004495313,0.00001227581,0.0007039555,0.008553104],"genre_scores_gemma":[0.5663103,0.00000423443,0.4332983,0.0002356788,0.00006147494,0.00001384226,0.000002168302,0.00001717103,0.00005685346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.98774,"threshold_uncertainty_score":0.9999468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103884101","doi":"10.1049/iet-cdt.2010.0005","title":"Dual-edge triggered sense amplifier flip-flop for resonant clock distribution networks","year":2010,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Flip-flop; Signal edge; Electronic engineering; Clock rate; Clock signal; Reduction (mathematics); Power (physics); Amplifier; Sense amplifier; Enhanced Data Rates for GSM Evolution; Clock network; Computer science; Electrical engineering; Engineering; Synchronous circuit; Voltage; Electronic circuit; CMOS; Physics; Telecommunications; Digital signal processing","retraction":null,"screen_n_in":null,"score":{"opus":0.005852492083715271,"gpt":0.2043902853105789,"spread":0.1985377932268636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002301999,0.0004016591,0.0003735521,0.0001218164,0.0001227586,0.0003987467,0.0002670105,0.0003257665,0.000005372228],"category_scores_gemma":[0.00003369252,0.0003883222,0.0001882222,0.0003120952,0.0001038184,0.0007145259,0.0001021788,0.0004514599,0.00002218624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173044,"about_ca_system_score_gemma":0.000027391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003835969,"about_ca_topic_score_gemma":0.000002730722,"domain_scores_codex":[0.9982585,0.00001327033,0.0004705456,0.0004004889,0.0002170276,0.0006401894],"domain_scores_gemma":[0.9988996,0.0001666743,0.00007637613,0.0005518553,0.0001311828,0.0001742469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001694967,0.0001998608,0.0002683037,0.0001631154,0.000169892,0.00007744745,0.0001964895,0.001717903,0.01213975,0.005340676,0.3995297,0.5800273],"study_design_scores_gemma":[0.0008311762,0.0003931654,0.0006946345,0.0001803315,0.00003824938,0.0001726731,0.00001113592,0.2803814,0.06756665,0.00145046,0.6470091,0.001270981],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164785,0.0001239566,0.8752953,0.00007932035,0.00175406,0.001083548,0.000315142,0.003922033,0.0009480759],"genre_scores_gemma":[0.9799355,0.0000553984,0.01825118,0.00007109477,0.0007429154,0.000176915,0.0005542609,0.000108423,0.000104294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.863457,"threshold_uncertainty_score":0.9998569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912351760","doi":"10.1049/iet-cdt.2018.5055","title":"KBMA: A knowledge‐based multi‐objective application mapping approach for 3D NoC","year":2019,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Particle swarm optimization; Network on a chip; Network topology; Computer architecture; Distributed computing; Computer engineering; Embedded system; Machine learning; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01925941181660942,"gpt":0.2558613399660693,"spread":0.2366019281494599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003094464,0.0002650965,0.0003316863,0.000232733,0.0001163758,0.0005820955,0.0008494565,0.0001482231,7.155174e-7],"category_scores_gemma":[0.0000119085,0.0002519923,0.0002069571,0.0004325999,0.00003896752,0.0008544875,0.0002255101,0.0001514828,0.00003498443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001477333,"about_ca_system_score_gemma":0.00005812987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001182345,"about_ca_topic_score_gemma":0.000001277946,"domain_scores_codex":[0.9983003,0.0000445508,0.0003850288,0.0007390542,0.0001708233,0.0003602172],"domain_scores_gemma":[0.9986143,0.0001785125,0.0001921891,0.0006513944,0.0002817111,0.0000819168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006729749,0.001243082,0.001285459,0.0005041619,0.0001745653,0.000003675468,0.002496134,0.00186091,0.002133067,0.05031776,0.01949611,0.9204178],"study_design_scores_gemma":[0.0003847005,0.0002250906,0.00007247584,0.00009907991,0.000002946698,0.00001831315,0.00004251816,0.9621558,0.001865158,0.0006962308,0.03408189,0.0003558164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004788603,0.00005183448,0.9845026,0.00006954271,0.0004719855,0.001869451,0.00001080955,0.001339322,0.01120559],"genre_scores_gemma":[0.5729601,7.748363e-7,0.4260326,0.0001699893,0.0001607419,0.0004048123,0.0000294608,0.00002098966,0.0002205256],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9602948,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2752065998","doi":"10.1049/iet-cdt.2016.0200","title":"High performance and energy efficient single‐precision and double‐precision merged floating‐point adder on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Adder; Field-programmable gate array; Double-precision floating-point format; Computer science; Single-precision floating-point format; Stratix; Computer hardware; Carry-save adder; Throughput; Efficient energy use; Parallel computing; Floating point; Embedded system; Algorithm; Engineering; Latency (audio); Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01911748253702997,"gpt":0.264125057771962,"spread":0.2450075752349321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003826089,0.0003353021,0.0003817149,0.0001578001,0.0005232135,0.001882938,0.0009895677,0.000117041,0.00000184236],"category_scores_gemma":[0.00006890424,0.0002692599,0.0000741751,0.0001405677,0.0001977817,0.001074935,0.001396672,0.0001917188,0.000003693691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004570019,"about_ca_system_score_gemma":0.00001514568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004051102,"about_ca_topic_score_gemma":4.611081e-7,"domain_scores_codex":[0.9979339,0.00004941491,0.0003744699,0.0008116589,0.0004480253,0.000382585],"domain_scores_gemma":[0.9982195,0.0002342772,0.0002625803,0.0009713036,0.0001039001,0.0002084048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004009889,0.0001155232,0.00004023297,0.0000100435,0.000008602849,0.00001226188,0.00009033153,0.00004335531,0.00090091,0.002763461,0.0005434477,0.9954317],"study_design_scores_gemma":[0.002752475,0.006553309,0.009919095,0.001657111,0.00002924159,0.0002519612,0.00003297168,0.4809599,0.4230925,0.03371375,0.03845056,0.002587205],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1469363,0.00007099205,0.84904,0.0005824798,0.0005826947,0.0001707146,0.00000572067,0.0004979545,0.002113103],"genre_scores_gemma":[0.6544247,0.00005096514,0.3451471,0.000180002,0.0001007334,0.00001038434,0.000002087047,0.00001698794,0.00006701385],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9928445,"threshold_uncertainty_score":0.999976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953295373","doi":"10.1049/iet-cdt.2019.0115","title":"Efficient spiking neural network training and inference with reduced precision memory and computing","year":2019,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Floating point; Computer science; Computer hardware; MNIST database; Fixed-point arithmetic; Spiking neural network; Integer (computer science); Memory footprint; Algorithm; Artificial neural network; Parallel computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01228700419381351,"gpt":0.2313508790151258,"spread":0.2190638748213123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001288649,0.0002659492,0.0003006634,0.00007704285,0.0001087608,0.0002234508,0.0001333453,0.00006341394,7.98463e-7],"category_scores_gemma":[0.0000124737,0.0002391413,0.00003186104,0.0001810943,0.00006692207,0.0002644766,0.0001945313,0.00027305,0.000001031568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002622137,"about_ca_system_score_gemma":0.000007700571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.268136e-7,"about_ca_topic_score_gemma":2.389324e-7,"domain_scores_codex":[0.9988505,0.00001726652,0.0002454271,0.0003635048,0.0001471112,0.000376178],"domain_scores_gemma":[0.9993407,0.0002885607,0.00006579016,0.0001767411,0.00002930605,0.00009887619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002465963,0.000009919303,0.0007381309,0.00008697851,0.00001748025,0.00002158767,0.0007408326,0.3890997,0.004540899,0.00009588784,0.00003616051,0.6045878],"study_design_scores_gemma":[0.0003706194,0.0004442211,0.001787172,0.001179655,0.00001064524,0.0002660753,0.0001421427,0.98375,0.01076359,0.0003926699,0.0002508088,0.0006424334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9093758,0.0001917385,0.08772051,0.00001458427,0.0001883566,0.0003302345,0.00000144822,0.001127292,0.001049991],"genre_scores_gemma":[0.976741,0.000008577709,0.02301167,0.00005806642,0.0001281215,0.000002997768,0.000003717173,0.00003875616,0.000007149277],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6039454,"threshold_uncertainty_score":0.9751899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995613452","doi":"10.1049/iet-cdt:20070120","title":"SC Build: a computer-aided design tool for design space exploration of embedded central processing unit cores for field-programmable gate arrays","year":2008,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Design space exploration; Computer science; Gate array; Field-programmable gate array; Field (mathematics); Genetic algorithm; Computer Aided Design; Design tool; Computer architecture; Space exploration; Core (optical fiber); Space (punctuation); Embedded system; Multi-core processor; Computer engineering; Computer hardware; Parallel computing; Engineering; Aerospace engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04922049004676316,"gpt":0.2587224714955857,"spread":0.2095019814488226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002474839,0.0004194104,0.0005305475,0.0002430096,0.0001607744,0.000256205,0.0003983323,0.0002202822,0.000001359794],"category_scores_gemma":[0.00004552902,0.000434653,0.0002102217,0.0003084575,0.00009545463,0.001476221,0.00005318322,0.0001485813,8.455383e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007260073,"about_ca_system_score_gemma":0.00008094771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004508902,"about_ca_topic_score_gemma":4.495837e-7,"domain_scores_codex":[0.9981446,0.00003786865,0.0005869342,0.0003938044,0.0002200566,0.0006167313],"domain_scores_gemma":[0.9987247,0.0003855684,0.000177422,0.0003281228,0.0002751468,0.0001090699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000851699,0.0005385081,0.0001828193,0.00155001,0.0002977689,0.00004276939,0.003034567,0.05244242,0.04070648,0.001623907,0.09550616,0.8032229],"study_design_scores_gemma":[0.0005548648,0.001797397,0.00001255938,0.0004139451,0.00003159656,0.00003839859,0.00002989013,0.3803195,0.6047333,0.008725984,0.002716853,0.0006257276],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002782861,0.0001107688,0.9904413,0.00004792666,0.0001367867,0.003149777,0.00003601332,0.003205944,0.00008868132],"genre_scores_gemma":[0.3481146,0.00005336806,0.650952,0.00004520017,0.0001388292,0.0005462658,0.00005218315,0.00007607584,0.00002136479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8025972,"threshold_uncertainty_score":0.9998105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093498840","doi":"10.1049/iet-cdt.2012.0088","title":"Customised soft processor design: a compromise between architecture description languages and parameterisable processors","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Datapath; Computer science; Computer architecture; Flexibility (engineering); Microarchitecture; Instruction set; Processor design; Process (computing); Set (abstract data type); Architecture; Design space exploration; Embedded system; Parallel computing; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01717081266265948,"gpt":0.2531135861739861,"spread":0.2359427735113266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002581664,0.0004316184,0.0004611367,0.0003075194,0.0002262078,0.00211781,0.001113486,0.0001919359,0.000003537448],"category_scores_gemma":[0.00007521323,0.0003874471,0.00009216317,0.0005058385,0.0001692087,0.002014045,0.0005070138,0.0002987855,0.00001928395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570684,"about_ca_system_score_gemma":0.00006089814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003255569,"about_ca_topic_score_gemma":3.350995e-7,"domain_scores_codex":[0.997773,0.0001001367,0.0004722006,0.0007894465,0.0003396227,0.0005256144],"domain_scores_gemma":[0.9985287,0.0002289571,0.000254989,0.0005466085,0.0002124008,0.0002283788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000371917,0.0002711788,0.002240251,0.0002960316,0.0001049038,0.00002456765,0.001733627,0.001543634,0.001571183,0.0007631436,0.02087852,0.9705358],"study_design_scores_gemma":[0.00246485,0.003375181,0.005330129,0.001739622,0.0000925268,0.0005451647,0.0001963711,0.6990702,0.1344397,0.1318914,0.01567725,0.005177661],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837238,0.0001456989,0.9741579,0.0006376623,0.00003660198,0.001401049,0.000006464233,0.004353942,0.0008883588],"genre_scores_gemma":[0.5100374,0.00001277803,0.4893257,0.0002396229,0.00005080215,0.0001833127,0.00001469412,0.00002667782,0.0001090435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9653581,"threshold_uncertainty_score":0.9998577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135842381","doi":"10.1049/cdt2.12026","title":"Low‐space bit‐serial systolic array architecture for interleaved multiplication over GF(2 <sup> <i>m</i> </sup> )","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Arithmetic; Application-specific integrated circuit; Systolic array; Computer science; Multiplication (music); GF(2); Binary number; Cryptography; Finite field; Computer hardware; Parallel computing; Mathematics; Algorithm; Embedded system; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.007820306266085804,"gpt":0.230148635912285,"spread":0.2223283296461992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002207147,0.0003814549,0.0003867233,0.0002446961,0.0001829329,0.001111255,0.00125502,0.0001734525,0.000003999387],"category_scores_gemma":[0.00006863709,0.0003789137,0.0004138566,0.0006948503,0.0001260753,0.0008921986,0.0004501264,0.000247765,0.00001007242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006549856,"about_ca_system_score_gemma":0.00007846986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003701693,"about_ca_topic_score_gemma":0.000002698954,"domain_scores_codex":[0.9978431,0.00009020586,0.0004030678,0.0008861112,0.0002840741,0.000493422],"domain_scores_gemma":[0.998036,0.0003417774,0.0001696218,0.001080928,0.0002063437,0.0001652963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003025624,0.0009508039,0.0002564772,0.0003660653,0.0002740633,0.00006772959,0.004016689,0.0004783607,0.0607854,0.1760024,0.02922011,0.7272794],"study_design_scores_gemma":[0.001621993,0.001072144,0.000135903,0.0009322526,0.00004475519,0.0003698431,0.0001126554,0.02241402,0.5732298,0.1536657,0.2445772,0.001823713],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02547587,0.00006831498,0.96944,0.001154238,0.000345024,0.0006463396,0.00005320935,0.001806411,0.001010526],"genre_scores_gemma":[0.7919886,0.00001109082,0.2062655,0.0009388737,0.0004015911,0.0001851303,0.00007591036,0.00004365991,0.00008960005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7665128,"threshold_uncertainty_score":0.9999257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3134549106","doi":"10.1049/cdt2.12012","title":"Reliable SRAM using NAND‐NOR Gate in beyond‐CMOS QCA technology","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"NAND gate; CMOS; Inverter; Logic gate; Electronic engineering; Computer science; Gate equivalent; Quantum dot cellular automaton; NAND logic; Electronic circuit; AND-OR-Invert; AND gate; Adder; Logic synthesis; Electrical engineering; Engineering; Logic family; Gate oxide; Transistor","retraction":null,"screen_n_in":null,"score":{"opus":0.01153176808702251,"gpt":0.2431194410620365,"spread":0.2315876729750139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002698925,0.0003996443,0.0005257981,0.0006329867,0.0001258166,0.0009232561,0.001854544,0.000290455,0.000006025684],"category_scores_gemma":[0.00006847666,0.000434568,0.0001558611,0.002156246,0.0001791594,0.001784879,0.001965783,0.0004466465,0.00004461065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002155087,"about_ca_system_score_gemma":0.0002562142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003368094,"about_ca_topic_score_gemma":0.000006627649,"domain_scores_codex":[0.9970534,0.0000557042,0.0006358991,0.00104945,0.0004216243,0.0007839623],"domain_scores_gemma":[0.9978656,0.00009329411,0.0001914387,0.001512756,0.0002028485,0.0001341301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005133439,0.002318185,0.01152314,0.0004225608,0.0002552631,0.01202617,0.001353635,0.001701477,0.06373607,0.2431601,0.02494529,0.6385068],"study_design_scores_gemma":[0.0008184629,0.0004195594,0.0003190577,0.000842791,0.00001695717,0.002153013,0.00006951969,0.3626006,0.4300674,0.1399198,0.06103254,0.00174036],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1399924,0.0006590071,0.8476125,0.001840178,0.0006898869,0.0005469295,0.00001409956,0.004449445,0.00419553],"genre_scores_gemma":[0.6880367,0.00003241207,0.3111061,0.0005140863,0.00005946572,0.00003300513,0.00001944648,0.00004948557,0.0001492666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6367664,"threshold_uncertainty_score":0.9998106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2341796638","doi":"10.1049/iet-cdt.2015.0058","title":"Decimal floating‐point fused multiply‐add with redundant internal encodings","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Rounding; Adder; Arithmetic; Decimal; Critical path method; Computer science; Floating point; Square root; Binary number; Division (mathematics); Parallel computing; Multiplier (economics); Multiplication algorithm; Algorithm; Mathematics; Engineering; Latency (audio)","retraction":null,"screen_n_in":null,"score":{"opus":0.02259920138639028,"gpt":0.2639737822558015,"spread":0.2413745808694112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004368147,0.0003588857,0.0004039982,0.0001713892,0.00009136964,0.00121024,0.00148627,0.00008596756,0.000002581682],"category_scores_gemma":[0.0001114973,0.0002764312,0.0001344487,0.0004780442,0.0001816491,0.001687499,0.0008467209,0.0003078207,0.00002240895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001292339,"about_ca_system_score_gemma":0.00009978561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005505449,"about_ca_topic_score_gemma":0.000001220253,"domain_scores_codex":[0.9976665,0.00007269305,0.0004384408,0.0007137902,0.0005809025,0.0005276072],"domain_scores_gemma":[0.9983111,0.0001988223,0.0002114458,0.0006243847,0.0002443885,0.0004098605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005922443,0.0002277381,0.0005799509,0.00001272996,0.00004506861,0.0002141254,0.0008800466,0.00001618186,0.0008998612,0.004696062,0.007617214,0.9847518],"study_design_scores_gemma":[0.004990817,0.01313814,0.001280191,0.001965858,0.00005300783,0.003079343,0.0005273924,0.3633964,0.2722431,0.1237127,0.2103394,0.005273547],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006371215,0.00003412008,0.9859297,0.0006167005,0.0003901909,0.0002972956,0.000007294861,0.001630067,0.004723405],"genre_scores_gemma":[0.2510099,0.000002670005,0.7482535,0.0004384167,0.0001707616,0.00001733893,0.000003286003,0.0000256594,0.00007848829],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9794782,"threshold_uncertainty_score":0.9999688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091655542","doi":"10.1049/iet-cdt.2019.0082","title":"Power efficient error correction coding for on‐chip interconnection links","year":2020,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Interconnection; Chip; Computer science; Coding (social sciences); Power (physics); Electronic engineering; Embedded system; Engineering; Telecommunications; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01470135790045721,"gpt":0.2245636549695623,"spread":0.2098622970691051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008652026,0.0002671642,0.00023563,0.0001601428,0.00007484212,0.0002303952,0.000221273,0.0001816378,0.000007365714],"category_scores_gemma":[0.00003844124,0.0002721001,0.0001355251,0.0002460742,0.00003343627,0.0003587235,0.0000516961,0.0003442458,0.00004691285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001611403,"about_ca_system_score_gemma":0.00001099344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.778958e-7,"about_ca_topic_score_gemma":2.413337e-7,"domain_scores_codex":[0.9989092,0.000009803592,0.0002954212,0.0003198055,0.0001648299,0.0003009151],"domain_scores_gemma":[0.9994729,0.0001144691,0.00005133902,0.0001869206,0.00006082346,0.0001135288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000597452,0.0004142298,0.0003756328,0.000570884,0.0003387998,0.00003810655,0.005583852,0.111681,0.02964209,0.002030265,0.4672208,0.3815069],"study_design_scores_gemma":[0.000419826,0.001469147,0.0001058373,0.000322615,0.00001408254,0.00002449861,0.0000890353,0.7520007,0.2060761,0.0001207459,0.03871501,0.0006423366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058506,0.00002120563,0.8815286,0.0002963786,0.002388264,0.0007395655,0.00002437266,0.004591674,0.004559329],"genre_scores_gemma":[0.9938423,0.000005254302,0.005223726,0.0004555147,0.0002654128,0.00008130939,0.0000271886,0.00007359061,0.0000257197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8879917,"threshold_uncertainty_score":0.9999731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970019860","doi":"10.1049/iet-cdt.2010.0024","title":"Reordering the assembly instructions in basic blocks to reduce switching activities on the instruction bus","year":2011,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Heuristics; Operand; Computer science; Parallel computing; Integer (computer science); Power (physics); Reduction (mathematics); Computation; Integer programming; Embedded system; Code (set theory); Dissipation; Computer hardware; Programming language; Algorithm; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02590197359389883,"gpt":0.2451128317876077,"spread":0.2192108581937089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242795,0.0002807312,0.0002147333,0.0003783627,0.0003861017,0.0007119133,0.001591106,0.00009440978,0.00000189168],"category_scores_gemma":[0.00007071158,0.0001975151,0.00009977022,0.001056175,0.00008006135,0.00102795,0.0006037247,0.0004459016,0.000005472293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218224,"about_ca_system_score_gemma":0.00005596899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009241726,"about_ca_topic_score_gemma":0.00001036192,"domain_scores_codex":[0.9983022,0.0001054159,0.0003877424,0.0005246782,0.0003050059,0.0003749554],"domain_scores_gemma":[0.9986039,0.0002178757,0.0001646984,0.0008654635,0.00007487891,0.00007320465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004628411,0.0002147893,0.0004700616,0.00001286003,0.00004262591,0.00001915209,0.006371224,0.001441814,0.0009758962,0.07860611,0.005687684,0.9061115],"study_design_scores_gemma":[0.001274726,0.003005517,0.0121002,0.002554011,0.00003584742,0.001198504,0.001970273,0.2207171,0.5659434,0.1504567,0.03655733,0.004186468],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2119716,0.00001194148,0.7729541,0.001426339,0.0004159072,0.0005240128,0.00000178829,0.00178552,0.01090876],"genre_scores_gemma":[0.8700283,0.0000141519,0.1290347,0.0006743234,0.00008601393,0.00009563253,0.00000117978,0.00002077139,0.00004494981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.901925,"threshold_uncertainty_score":0.8054431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1551456964","doi":"10.1049/iet-cdt.2011.0089","title":"Decimal floating-point antilogarithmic converter based on selection by rounding: algorithm and architecture","year":2012,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Decimal; CORDIC; Computer science; Critical path method; Parallel computing; Algorithm; Floating point; Double-precision floating-point format; Standard cell; Field-programmable gate array; Latency (audio); Architecture; Arithmetic; Computer hardware; Mathematics; Integrated circuit; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008669592829528056,"gpt":0.2506249088624793,"spread":0.2419553160329513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003371172,0.0003252978,0.0003098042,0.0001883414,0.0001543845,0.0006934577,0.0004734919,0.0001232178,0.000003352826],"category_scores_gemma":[0.0000351253,0.0002796279,0.0001032576,0.0003788604,0.0001062757,0.001074592,0.0002432957,0.0003291176,0.000007080365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000774189,"about_ca_system_score_gemma":0.00002392032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000152839,"about_ca_topic_score_gemma":7.8216e-8,"domain_scores_codex":[0.99819,0.0001012383,0.0002835298,0.00053248,0.0003360655,0.0005566255],"domain_scores_gemma":[0.9989685,0.0002804827,0.0001214963,0.0003169222,0.00005946425,0.0002531271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006732293,0.0001590758,0.0004031851,0.000009347913,0.00001217846,0.000004227707,0.0000803447,0.000003722014,0.0007630344,0.0007735061,0.002502571,0.9952821],"study_design_scores_gemma":[0.0006803789,0.002027668,0.0008719373,0.0002110393,0.00001624975,0.0003036503,0.00001553539,0.8758321,0.05573714,0.008352994,0.05468885,0.001262505],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008944098,0.00005521179,0.9962223,0.0006158672,0.0003621312,0.0002952989,0.00001592055,0.0009451659,0.0005936685],"genre_scores_gemma":[0.1410356,0.000004436317,0.857444,0.001216245,0.0002101614,0.00001758074,0.00001028627,0.00002481748,0.00003693848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9940196,"threshold_uncertainty_score":0.9999656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3168383044","doi":"10.1049/cdt2.12032","title":"Introducing <i>KeyRing</i> self‐timed microarchitecture and timing‐driven design flow","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","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","keywords":"Microarchitecture; Static timing analysis; Computer science; Design flow; Clock gating; Electronic design automation; Computer architecture; Standard cell; Circuit design; Processor design; Physical design; Embedded system; Integrated circuit design; Electronic circuit; Parallel computing; Integrated circuit; Clock skew; Clock signal; Engineering; Jitter","retraction":null,"screen_n_in":null,"score":{"opus":0.00612957763553337,"gpt":0.1850439377866857,"spread":0.1789143601511523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001264549,0.0003901326,0.000368694,0.0001845289,0.00009309821,0.0004803509,0.0002997918,0.0001584736,0.000008109922],"category_scores_gemma":[0.00002070022,0.0004059589,0.00008982191,0.0003452629,0.00007537609,0.0005867032,0.0002146054,0.0003584669,0.00002174429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000111153,"about_ca_system_score_gemma":0.00004358676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001587688,"about_ca_topic_score_gemma":5.104751e-7,"domain_scores_codex":[0.9984491,0.00003510546,0.0003212274,0.000497648,0.0002124817,0.0004844437],"domain_scores_gemma":[0.9991347,0.0001277619,0.00004307847,0.0004682957,0.00008062416,0.0001455588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005617233,0.0002496433,0.0007063441,0.0007802124,0.0006034584,0.0006594099,0.005200726,0.1115413,0.1246231,0.0001078854,0.1804652,0.5750065],"study_design_scores_gemma":[0.0004841201,0.0002300182,0.0001415784,0.0004360618,0.00004897359,0.0006422098,0.00003138311,0.3306027,0.6264269,0.0005056235,0.0393029,0.001147574],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04112367,0.0006862252,0.9498671,0.0002331687,0.0004196209,0.0004798553,0.00002355726,0.005292458,0.001874382],"genre_scores_gemma":[0.4850976,0.0001261528,0.514049,0.0001973339,0.0002905115,0.00003656473,0.0000341774,0.0001084095,0.00006024064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.573859,"threshold_uncertainty_score":0.9998392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3138924352","doi":"10.1049/cdt2.12021","title":"Static power model for CMOS and FPGA circuits","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spice; Computer science; Electronic engineering; Field-programmable gate array; CMOS; Transistor; Power (physics); Dynamic demand; Static timing analysis; Power consumption; Power analysis; Process (computing); Voltage; Embedded system; Engineering; Electrical engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01093328217127548,"gpt":0.2118650168010427,"spread":0.2009317346297672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006461135,0.0002291354,0.00024267,0.00009438501,0.00004570491,0.000292039,0.0001652593,0.00009049825,0.000003466783],"category_scores_gemma":[0.00001354338,0.0002433964,0.00006947472,0.0001469423,0.0000451299,0.0007103517,0.00007487602,0.0001142349,0.000006643478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006248299,"about_ca_system_score_gemma":0.00003401225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.633532e-7,"about_ca_topic_score_gemma":4.619898e-7,"domain_scores_codex":[0.9990107,0.000005623699,0.0002421684,0.0002709455,0.0001454547,0.0003251511],"domain_scores_gemma":[0.9994425,0.00007574115,0.00002711342,0.0002736242,0.00008396612,0.00009703719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002925555,0.0003037357,0.0004104488,0.001211391,0.0004316006,0.0001756719,0.00363213,0.02381614,0.0199041,0.004928895,0.2578901,0.6872666],"study_design_scores_gemma":[0.0004489217,0.0001990074,0.00009590535,0.0002216136,0.0000229335,0.00009278834,0.00003736289,0.8810127,0.09272269,0.008274063,0.01609273,0.0007793024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04012484,0.0001944509,0.9541255,0.0001008527,0.0001996345,0.0004085429,0.00008532695,0.001740018,0.003020802],"genre_scores_gemma":[0.9525006,0.00005252567,0.04683872,0.0002357477,0.00004103157,0.00007706633,0.00003635202,0.00006957555,0.0001483642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9123757,"threshold_uncertainty_score":0.9925416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3137786380","doi":"10.1049/cdt2.12019","title":"Fast and low‐power leading‐one detectors for energy‐efficient logarithmic computing","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Logarithm; Multiplexer; Computation; Multiplier (economics); Binary number; Detector; Algorithm; Multiplication (music); Computer science; Scaling; Arithmetic; Mathematics; Parallel computing; Multiplexing; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01212493118335639,"gpt":0.2584835012757158,"spread":0.2463585700923595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002285974,0.0002950298,0.0004237446,0.0001384354,0.0001852079,0.0009807812,0.0006140355,0.0001074094,0.000001660949],"category_scores_gemma":[0.00006914593,0.0002911795,0.0001688555,0.0004762846,0.0001322617,0.0004035885,0.0008450737,0.0001603178,0.000002787262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006195539,"about_ca_system_score_gemma":0.00005546239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005808437,"about_ca_topic_score_gemma":4.32294e-7,"domain_scores_codex":[0.9979681,0.00005844733,0.000380144,0.0008041515,0.0002747639,0.0005144082],"domain_scores_gemma":[0.9985899,0.0004091873,0.0001355699,0.0004690017,0.0001997181,0.0001966703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000050833,0.0001718258,0.00003094306,0.00002996786,0.00003117607,0.00003710555,0.0001363743,0.00007548567,0.002310186,0.01323845,0.0005023694,0.983431],"study_design_scores_gemma":[0.0007898489,0.00111034,0.0003633781,0.0005753743,0.00002161992,0.0003705086,0.00006534217,0.6995004,0.2394817,0.03009216,0.02603173,0.001597576],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005704779,0.0001767192,0.9914827,0.0003962214,0.0004243833,0.0002116158,0.00001469251,0.0008717596,0.0007171448],"genre_scores_gemma":[0.3309052,0.000008740915,0.6683868,0.0004830456,0.0001054101,0.00001729064,0.000006097147,0.00002396552,0.00006352541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9818335,"threshold_uncertainty_score":0.999954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007102977","doi":"10.1049/iet-cdt.2013.0016","title":"Temperature control in three‐network on chips using task migration","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Overhead (engineering); Network on a chip; Multiprocessing; Computer science; Chip; Interconnection; Reliability (semiconductor); Dissipation; Three-dimensional integrated circuit; System on a chip; Thermal management of electronic devices and systems; Integrated circuit; Embedded system; Power (physics); Parallel computing; Engineering; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.00968258682185651,"gpt":0.2142268469475301,"spread":0.2045442601256736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000218132,0.000254785,0.0003021249,0.0001718752,0.0001112226,0.001298545,0.0006012197,0.0001687337,0.000002979958],"category_scores_gemma":[0.00001035164,0.0002197666,0.0001168688,0.0004426125,0.0000354295,0.001378181,0.000113902,0.0002860921,0.00003052803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108016,"about_ca_system_score_gemma":0.00002756479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000125873,"about_ca_topic_score_gemma":0.00004423813,"domain_scores_codex":[0.9983956,0.00007275593,0.0004201785,0.0004674848,0.0002457366,0.0003982068],"domain_scores_gemma":[0.9990851,0.0001147119,0.0001389165,0.0004634626,0.0001144555,0.00008330002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001419064,0.001104338,0.03054598,0.0001310459,0.000292152,0.0002209592,0.002257991,0.04582201,0.01464966,0.1421038,0.3469634,0.4157667],"study_design_scores_gemma":[0.0006423123,0.000740941,0.003505305,0.0009145593,0.000005188032,0.0001458948,0.00002544883,0.9515799,0.001445714,0.03236494,0.007714585,0.0009152569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1333086,0.00007149108,0.8608753,0.0009057305,0.0009548264,0.0009367156,0.00000387227,0.0008403306,0.00210306],"genre_scores_gemma":[0.9846832,0.000003481296,0.01343187,0.001262076,0.0004916691,0.00006722518,0.000006660505,0.00001828784,0.00003549032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9057578,"threshold_uncertainty_score":0.9997382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2273070579","doi":"10.1049/iet-cdt.2015.0066","title":"Design of a novel energy efficient topology for maximum magnitude generator","year":2016,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multiplexer; Computer science; Least significant bit; 4-bit; Comparator; Algorithm; Parallel computing; Verilog; Generator (circuit theory); Mathematics; Topology (electrical circuits); Computer hardware; Electronic engineering; CMOS; Multiplexing; Field-programmable gate array; Power (physics); Engineering; Electrical engineering; Voltage","retraction":null,"screen_n_in":null,"score":{"opus":0.02859419346647149,"gpt":0.277706297829231,"spread":0.2491121043627595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813902,0.0002109711,0.0003290359,0.0001373369,0.00005101494,0.0001289832,0.0009782013,0.00009071708,0.000001711691],"category_scores_gemma":[0.00006437603,0.0001444763,0.0001364881,0.0002360923,0.000147114,0.000274598,0.0003820974,0.00004235185,0.000001492999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004232929,"about_ca_system_score_gemma":0.00005352611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000653658,"about_ca_topic_score_gemma":8.320777e-8,"domain_scores_codex":[0.9985395,0.00005662788,0.0003565928,0.0004823401,0.0001926898,0.0003722586],"domain_scores_gemma":[0.9984761,0.0005971285,0.0001554775,0.0004883859,0.0001698833,0.000113039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001647585,0.0002500428,0.000005029629,0.0000090701,0.0000211568,0.000004646534,0.0000262374,0.00005044706,0.03293094,0.04073872,0.001247709,0.9246995],"study_design_scores_gemma":[0.001194492,0.002437607,0.00002452988,0.0001725385,0.00001351701,0.00009623727,0.000005035684,0.2171445,0.6607939,0.08152859,0.03573707,0.0008520139],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002308483,0.0000497296,0.9977535,0.0007350978,0.0003373552,0.0002841803,0.00002928626,0.0004381215,0.0001418994],"genre_scores_gemma":[0.04608516,0.000009987052,0.953262,0.0003695704,0.0001090957,0.00008644955,0.000001390587,0.00001835736,0.00005801104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9238475,"threshold_uncertainty_score":0.5891574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991225420","doi":"10.1049/iet-cdt.2011.0173","title":"Contention‐aware selection strategy for application‐specific network‐on‐chip","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Routing (electronic design automation); Network on a chip; Static routing; Network packet; Selection algorithm; Adaptive routing; Routing protocol; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02258229929357752,"gpt":0.2455796995939078,"spread":0.2229974003003303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001887666,0.000254528,0.0002626959,0.0001259451,0.0002394537,0.001437106,0.0007151865,0.0001356934,0.000007769072],"category_scores_gemma":[0.000005539724,0.0002364805,0.0001922436,0.0003763232,0.0000419568,0.001246986,0.0001087174,0.0001581127,0.0001116783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070457,"about_ca_system_score_gemma":0.00002411919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934029,"about_ca_topic_score_gemma":0.00000309824,"domain_scores_codex":[0.9982785,0.00004138566,0.0004500785,0.0005907292,0.0002155523,0.0004237411],"domain_scores_gemma":[0.9987026,0.0001546281,0.0001963705,0.0004666391,0.0003701632,0.0001095347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001551995,0.0001208284,0.0001852174,0.00002166337,0.00004591416,0.000001044906,0.00005255091,0.00217795,0.00018354,0.1962371,0.3907506,0.410208],"study_design_scores_gemma":[0.0004637518,0.001354449,0.0006267666,0.0001941465,0.000005643713,0.00009765767,0.00003329955,0.6875526,0.002139445,0.0728164,0.2338984,0.000817424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007464906,0.00004133213,0.9902489,0.0004651892,0.0006298368,0.001457246,0.000006910427,0.001550233,0.004853829],"genre_scores_gemma":[0.9749926,0.000008784094,0.02222968,0.0004921894,0.0008285946,0.0008262922,0.00003619372,0.00002766992,0.0005579683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9742461,"threshold_uncertainty_score":0.9995995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031883009","doi":"10.1049/iet-cdt.2013.0055","title":"Challenges and advances in Toffoli network optimisation","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Template; Toffoli gate; Computer science; Heuristics; Matching (statistics); Combinatory logic; Computer engineering; Theoretical computer science; Algorithm; Quantum gate; Programming language; Mathematics; Quantum computer; Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.009906054993092708,"gpt":0.2286296666313555,"spread":0.2187236116382628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393767,0.0001999792,0.0002141319,0.0001216096,0.00006286578,0.0004753351,0.0005231158,0.00007097922,8.57625e-7],"category_scores_gemma":[0.00001406709,0.0001777772,0.00004387715,0.0002027416,0.00006386432,0.001666704,0.0004304566,0.0001622461,0.000006791176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002112608,"about_ca_system_score_gemma":0.0000137234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009111312,"about_ca_topic_score_gemma":0.00000311034,"domain_scores_codex":[0.9987409,0.00003511609,0.0002387212,0.0004686422,0.0001663387,0.0003502442],"domain_scores_gemma":[0.9992937,0.0001680037,0.00008169816,0.0003258018,0.00004393036,0.00008686813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.944445e-7,0.0000262089,0.00009437514,0.00001340127,0.000003209701,0.000006448568,0.0003034122,0.0006961225,0.000008827246,0.009280731,0.0004194606,0.9891468],"study_design_scores_gemma":[0.0003561759,0.0006152256,0.01107523,0.000554343,0.000002798866,0.0001895262,0.0000455678,0.6607994,0.0006191678,0.2816921,0.04309858,0.0009519379],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03640666,0.0133471,0.9294469,0.004539015,0.0004889938,0.0008171826,0.000001838531,0.002167404,0.01278485],"genre_scores_gemma":[0.6821725,0.001528283,0.3157524,0.0002872985,0.0001901675,0.00003772751,0.000002635688,0.00001422262,0.00001476388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9881949,"threshold_uncertainty_score":0.7249545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1041293701","doi":"10.1049/iet-cdt.2014.0188","title":"Accuracy‐aware processor customisation for fixed‐point arithmetic","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Latency (audio); Benchmark (surveying); Word (group theory); FLOPS; Microarchitecture; Fixed-point arithmetic; Fixed point; Parallel computing; Computer hardware; Floating point; Computer engineering; Arithmetic; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03926840565306616,"gpt":0.3119840696708274,"spread":0.2727156640177613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004214755,0.000260118,0.000312094,0.0001420806,0.00008818424,0.0008948247,0.001055552,0.0000994845,8.365109e-7],"category_scores_gemma":[0.0002921074,0.0002253785,0.0001441208,0.0004312175,0.00007225659,0.00182854,0.0003898803,0.0001413359,0.000015163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038611,"about_ca_system_score_gemma":0.0001205868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008441904,"about_ca_topic_score_gemma":2.397927e-7,"domain_scores_codex":[0.9982666,0.00004511837,0.0003736704,0.0005708805,0.0003479598,0.0003957674],"domain_scores_gemma":[0.9983163,0.0003674518,0.0001951169,0.0005122732,0.0003560716,0.0002527398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001201734,0.0001109867,0.00002912999,0.00003286549,0.00001301274,0.000007015959,0.000222573,0.00001209527,0.00007578283,0.004608532,0.0118013,0.9830747],"study_design_scores_gemma":[0.00119512,0.002242587,0.0001018979,0.000286906,0.00002260926,0.0001692215,0.0001165453,0.3333009,0.05380494,0.3571829,0.2500567,0.001519591],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002647531,0.00006523377,0.9942675,0.001766599,0.000406073,0.0007956185,0.00001809591,0.001457773,0.0009584003],"genre_scores_gemma":[0.08291347,0.000006090852,0.9158237,0.0006492037,0.0002365208,0.0002246117,0.00001696405,0.00002659656,0.000102815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9815551,"threshold_uncertainty_score":0.919067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108211345","doi":"10.1049/iet-cdt.2008.0155","title":"Skew compensation in energy recovery clock distribution networks","year":2009,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Clock skew; Digital clock manager; FLOPS; Clock domain crossing; Timing failure; Synchronous circuit; Clock signal; Skew; Clock network; Electronic engineering; Clock gating; Computer science; CPU multiplier; Jitter; Engineering; Parallel computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.003651611229473612,"gpt":0.1779241009638192,"spread":0.1742724897343456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009209839,0.0002377798,0.0002366367,0.0001426412,0.00003510934,0.0002119815,0.0002270567,0.0001568346,0.000002560736],"category_scores_gemma":[0.000005547528,0.0002591087,0.00007311135,0.0003779249,0.00002734999,0.0009506165,0.00003384012,0.0001828279,0.000008025274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002691739,"about_ca_system_score_gemma":0.00001136977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008656013,"about_ca_topic_score_gemma":0.000002941553,"domain_scores_codex":[0.9989042,0.00001612957,0.0003463895,0.0002293933,0.0001581937,0.0003456955],"domain_scores_gemma":[0.999557,0.00004398274,0.0000468839,0.0002518031,0.0000352217,0.00006513416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003692099,0.0001183803,0.0005428063,0.00002325243,0.00002599126,0.00003642846,0.00005944573,0.07187899,0.0005241822,0.005022509,0.05137261,0.8703585],"study_design_scores_gemma":[0.0006526976,0.0008656482,0.01241304,0.0005867908,0.00001530056,0.00007431813,0.000009046239,0.8576489,0.02679274,0.01230299,0.08716325,0.001475283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03535298,0.000250694,0.95837,0.00007999699,0.0003732186,0.0002100873,0.00002111353,0.00218881,0.003153149],"genre_scores_gemma":[0.9953076,0.0002432204,0.003737479,0.0001504837,0.0001662099,0.00001744359,0.000333203,0.0000273023,0.00001712173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9599546,"threshold_uncertainty_score":0.9999861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077045439","doi":"10.1049/iet-cdt.2012.0038","title":"High-performance low-power sensing scheme for nanoscale SRAMs","year":2012,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Advancements in Semiconductor Devices and Circuit Design","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Static random-access memory; CMOS; Dissipation; Process variation; Overhead (engineering); Computer science; Electronic engineering; Leakage (economics); Integrated circuit; Power (physics); Reduction (mathematics); Amplifier; Electronic circuit; Leakage power; Electrical engineering; Engineering; Transistor; Voltage; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0106758076462873,"gpt":0.2192411296463741,"spread":0.2085653220000868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008280217,0.0002425002,0.0002224043,0.00006325793,0.00006442405,0.0001243802,0.0001931828,0.000098671,0.000007183653],"category_scores_gemma":[0.000005195146,0.0002450861,0.0000716323,0.0001153668,0.00004662187,0.001140851,0.00004558124,0.0001186269,0.00002253964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008785946,"about_ca_system_score_gemma":0.000005710322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.120195e-7,"about_ca_topic_score_gemma":5.675432e-8,"domain_scores_codex":[0.9989197,0.000004333407,0.0002578523,0.0001870371,0.0001411533,0.0004899683],"domain_scores_gemma":[0.9994936,0.00004743781,0.00004675886,0.0002657428,0.00004652482,0.00009992902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003155687,0.0002208907,0.001799417,0.0005717959,0.0002257599,0.000006347453,0.0005607905,0.0006721163,0.1132514,0.002115628,0.04321657,0.8373277],"study_design_scores_gemma":[0.0004296008,0.000240364,0.0001640713,0.000458116,0.0000198984,0.00005133158,0.00005803799,0.01433777,0.7687368,0.001058482,0.2132694,0.001176093],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4888633,0.0002836763,0.5050974,0.00001102785,0.001184655,0.0004609337,0.00004617262,0.001842181,0.002210667],"genre_scores_gemma":[0.9301074,0.00002681423,0.0692657,0.0001334434,0.0002800858,0.00002379032,0.00003871812,0.00006597985,0.00005804554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8361516,"threshold_uncertainty_score":0.9994321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3163808675","doi":"10.1049/cdt2.12031","title":"Strengthened 32‐bit AES implementation: Architectural error correction configuration with a new voting scheme","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"South Health Campus","funders":"","keywords":"Computer science; Advanced Encryption Standard; Byte; Pipeline (software); Reliability (semiconductor); Fault tolerance; Resilience (materials science); Encryption; Error detection and correction; Embedded system; Computer engineering; Distributed computing; Computer network; Computer hardware; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01565170674294585,"gpt":0.2835020549238144,"spread":0.2678503481808685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001037269,0.0002411146,0.0002065624,0.0001859441,0.0002308238,0.001220638,0.0003659959,0.00005036603,0.00003298408],"category_scores_gemma":[0.00001403565,0.0002269532,0.00010648,0.0007198781,0.00005483062,0.001338535,0.0001878553,0.0001645094,0.000004253861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006282271,"about_ca_system_score_gemma":0.0002014687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001183584,"about_ca_topic_score_gemma":0.0002775716,"domain_scores_codex":[0.9983652,0.0000428556,0.000390359,0.0005165242,0.0003557735,0.0003293531],"domain_scores_gemma":[0.9990156,0.00009826043,0.0001886736,0.0003581669,0.0002155568,0.0001237326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002595732,0.0001291605,0.003792676,0.00002192887,0.0001005166,0.00005714029,0.002117648,0.00003815668,0.002251774,0.03611391,0.00721504,0.9481361],"study_design_scores_gemma":[0.007188613,0.005074011,0.0410713,0.001041105,0.0001464805,0.004056463,0.006348473,0.125594,0.6718397,0.03257246,0.09971932,0.005348069],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1060715,0.00002909194,0.890435,0.001249844,0.000257134,0.0003346083,0.00001405011,0.0008528769,0.0007558712],"genre_scores_gemma":[0.8308999,0.000003591968,0.1684156,0.0002959391,0.0001002013,0.00003038298,0.0001878637,0.00001421182,0.00005237389],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.942788,"threshold_uncertainty_score":0.9998162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2255454767","doi":"10.1049/iet-cdt.2015.0056","title":"Evaluating fault tolerance on asymmetric multicore systems‐on‐chip using iso‐metrics","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Seventh Framework Programme; European Commission; Queen's University; Ministerio de Economía y Competitividad; Federación Española de Enfermedades Raras; Engineering and Physical Sciences Research Council; Universidad Complutense de Madrid","keywords":"Emulation; Computer science; Multi-core processor; Embedded system; Fault tolerance; Frequency scaling; Implementation; Reliability (semiconductor); Energy consumption; Supercomputer; Reliability engineering; Power (physics); Distributed computing; Engineering; Parallel computing; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1009477074361123,"gpt":0.3472739787204626,"spread":0.2463262712843503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009918021,0.0005284268,0.0005582647,0.001267018,0.0002337733,0.001691249,0.00185524,0.0002235846,3.856341e-7],"category_scores_gemma":[0.00056453,0.00050438,0.0001805309,0.002589696,0.00008321897,0.001096359,0.0006089335,0.000438184,0.00003703541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004015599,"about_ca_system_score_gemma":0.00016271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003323497,"about_ca_topic_score_gemma":1.335311e-7,"domain_scores_codex":[0.9961658,0.0002047466,0.0007477137,0.001018354,0.001218325,0.0006451021],"domain_scores_gemma":[0.9968858,0.0005332826,0.0004549332,0.001170553,0.0006247167,0.0003307052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008450951,0.0008317388,0.0008898908,0.00009820615,0.00007944526,0.0001186416,0.0007074747,0.4115128,0.0001438681,0.02266181,0.02504311,0.5378285],"study_design_scores_gemma":[0.0003907342,0.001218763,0.00004682212,0.0004040375,0.000007402197,0.000072175,0.00001475743,0.9897388,0.003710641,0.001352401,0.002412756,0.0006307345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01926202,0.0002204998,0.9678507,0.0001351623,0.0008632432,0.0007483839,0.00001268221,0.004306141,0.006601118],"genre_scores_gemma":[0.5994316,0.000009792885,0.3996843,0.0005337273,0.0001869139,0.00002895449,0.00001030013,0.0000398947,0.00007452228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5801696,"threshold_uncertainty_score":0.9997408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011813090","doi":"10.1049/iet-cdt:20060199","title":"Bridging fault diagnostic tool based on Δ <i>I</i> <sub>DDQ</sub> probabilistic signatures, circuit layout parasitics and logic errors","year":2007,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"CMC Microsystems","keywords":"Bridging (networking); Iddq testing; Parasitic extraction; Probabilistic logic; Fault coverage; Fault (geology); Computer science; Algorithm; Logic gate; Stuck-at fault; Fault detection and isolation; Engineering; Electronic engineering; Computer engineering; Reliability engineering; Electronic circuit; Electrical engineering; Artificial intelligence; CMOS","retraction":null,"screen_n_in":null,"score":{"opus":0.01370878887806173,"gpt":0.2326612469149626,"spread":0.2189524580369008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005987869,0.0004895403,0.0004202439,0.0003243594,0.0002558532,0.0009802508,0.000948134,0.0002056084,5.320409e-7],"category_scores_gemma":[0.0007108848,0.0004788949,0.0001501668,0.0005883117,0.0002062171,0.0008238835,0.0002815326,0.0004926149,0.00001122019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001411399,"about_ca_system_score_gemma":0.00009335025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008297833,"about_ca_topic_score_gemma":0.00000362425,"domain_scores_codex":[0.9970162,0.00005904077,0.000566986,0.0009508941,0.0005733378,0.0008335276],"domain_scores_gemma":[0.9967836,0.001891458,0.0002199762,0.000693334,0.0001595456,0.0002521428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000365645,0.000355721,0.003612766,0.0001385593,0.00002771328,0.0008882431,0.0002352941,0.001911692,0.002646156,0.01672157,0.001736582,0.9717221],"study_design_scores_gemma":[0.0020548,0.00386118,0.02186437,0.004374616,0.0001338834,0.00103473,0.00006770661,0.7558026,0.1030664,0.09908395,0.00263805,0.0060177],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08400845,0.0001039099,0.9106061,0.0002857356,0.0002166142,0.0005982126,0.00002075305,0.002011564,0.002148676],"genre_scores_gemma":[0.9890416,0.000007967287,0.007495743,0.003173377,0.000179892,0.00002681292,0.00002777748,0.00004074717,0.000006043844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9657043,"threshold_uncertainty_score":0.9997663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130393477","doi":"10.1049/iet-cdt.2010.0167","title":"Effect of scaling on the area and performance of the H.264/AVC full-search fractional motion estimation algorithm on field-programmable gate arrays","year":2012,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Algorithm; Encoder; Scalability; Motion estimation; Block (permutation group theory); Encoding (memory); Virtex; Parallel computing; Data compression; Video quality; Computer hardware; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01510066130385711,"gpt":0.2567706746588784,"spread":0.2416700133550213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005169148,0.0001463057,0.0001638527,0.0001073907,0.0001614525,0.0001390215,0.0006283536,0.00008092907,9.322347e-7],"category_scores_gemma":[0.00007806478,0.00008318341,0.00007745923,0.0002639728,0.0001098055,0.0005422431,0.0003334788,0.0002425365,0.000001769898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002486728,"about_ca_system_score_gemma":0.00001070778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004881234,"about_ca_topic_score_gemma":4.199158e-8,"domain_scores_codex":[0.9989403,0.00007753973,0.0002080312,0.0002003136,0.000366364,0.0002074265],"domain_scores_gemma":[0.998688,0.0005920227,0.0001510448,0.0004753067,0.00006239464,0.00003117229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002781781,0.00006121637,0.0008017462,0.00003370726,0.00001045586,2.054235e-7,0.00008921025,0.0005162499,0.0003833776,0.001844648,0.0002871808,0.9959442],"study_design_scores_gemma":[0.00009756992,0.001455554,0.001038783,0.0004389996,0.000004696235,0.00001613709,0.00001096035,0.4526412,0.5428417,0.001214075,0.0001241063,0.0001161382],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4092075,0.00002496105,0.5894994,0.0004023382,0.0001235394,0.0002564595,0.00000210506,0.0002733166,0.0002104501],"genre_scores_gemma":[0.9796398,0.00001561783,0.0202058,0.00006034617,0.00002621608,0.00003555796,0.000001506494,0.000006269903,0.000008891877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.995828,"threshold_uncertainty_score":0.3392121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416306598","doi":"10.1049/cdt2/5384331","title":"A Systematic Literature Review on the Applications, Models, Limitations, and Future Directions of Generative Adversarial Networks","year":2025,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Adversarial system; Key (lock); Domain (mathematical analysis); Systematic review; Similarity (geometry); Generative grammar; Taxonomy (biology); Architecture","retraction":null,"screen_n_in":null,"score":{"opus":0.01106865353179942,"gpt":0.2506989948505807,"spread":0.2396303413187813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003522744,0.0002254322,0.0003802538,0.0001723522,0.0002450451,0.0003904599,0.0007641296,0.0001030279,3.390305e-7],"category_scores_gemma":[0.00008740672,0.00015886,0.0001196758,0.0009914699,0.00008733918,0.0007152668,0.000335521,0.0003459959,6.890606e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005030322,"about_ca_system_score_gemma":0.00004643149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001692721,"about_ca_topic_score_gemma":5.943445e-7,"domain_scores_codex":[0.9985839,0.0002099341,0.0004427811,0.0003894572,0.0002137885,0.000160146],"domain_scores_gemma":[0.9980871,0.0007432573,0.000256631,0.0006721639,0.0002007069,0.00004011195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000955835,0.00009161679,0.000005915605,0.005196001,0.0001491374,0.000003213819,0.0004991272,0.002572061,0.00000475135,0.8521579,0.009136678,0.130174],"study_design_scores_gemma":[0.0003883024,0.0003012017,0.00004165584,0.09602891,0.000202988,0.00007651778,0.0001712533,0.7730823,0.0001599487,0.06536436,0.06333899,0.0008435502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000478718,0.04116145,0.9491391,0.005116452,0.0002378156,0.001513575,0.000007907072,0.0003911313,0.002427792],"genre_scores_gemma":[0.118921,0.2059515,0.6563828,0.01266689,0.001618287,0.003697259,0.0001602108,0.00009231533,0.0005096391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7867935,"threshold_uncertainty_score":0.6478122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910067318","doi":"10.1049/iet-cdt.2018.5043","title":"Probabilistic timing analysis of time‐randomised caches with fault detection mechanisms","year":2019,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Cache; Probabilistic analysis of algorithms; Static timing analysis; Fault detection and isolation; Real-time computing; Reliability engineering; Algorithm; Parallel computing; Embedded system; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007505424122112765,"gpt":0.2105529691892059,"spread":0.2030475450670931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144176,0.0002914153,0.0006911911,0.0005943761,0.00005782635,0.000497264,0.0008549761,0.0001137865,0.000005511306],"category_scores_gemma":[0.00003438689,0.0002427548,0.0002622321,0.001434168,0.00005928109,0.001331412,0.000245764,0.0001352537,0.00002777162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043351,"about_ca_system_score_gemma":0.00005564108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005047597,"about_ca_topic_score_gemma":0.000005086886,"domain_scores_codex":[0.9979123,0.00007623988,0.0005399769,0.0006511557,0.0004982484,0.0003220479],"domain_scores_gemma":[0.9981559,0.0002714525,0.0003962285,0.0008555219,0.0002242829,0.00009663191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001226264,0.001139053,0.002008166,0.0009915248,0.007483008,0.0001358032,0.004908336,0.07158728,0.3290772,0.02139164,0.0003755225,0.5596762],"study_design_scores_gemma":[0.001219626,0.000827854,0.0002755503,0.0002814353,0.0002353327,0.00005941866,0.00003338545,0.8312417,0.1624417,0.002678414,0.0000824528,0.0006231439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155493,0.00001087031,0.8802955,0.00003029771,0.00008082316,0.0008870076,0.000005392365,0.0008570781,0.002283662],"genre_scores_gemma":[0.8621945,9.451169e-7,0.137602,0.00002448136,0.00001803251,0.00004504659,0.00001142421,0.00002161249,0.00008194213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7596545,"threshold_uncertainty_score":0.9899254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021731414","doi":"10.1049/iet-cdt.2013.0109","title":"Column selection solutions for <i>L</i> 1 data caches implemented using eight‐transistor cells","year":2014,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Cache; Computer science; Overhead (engineering); Transistor; Static random-access memory; Dissipation; Scaling; Selection (genetic algorithm); CPU cache; Column (typography); Voltage; Computer hardware; Embedded system; Parallel computing; Electrical engineering; Computer network; Engineering; Artificial intelligence; Mathematics; Operating system; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03887342976144327,"gpt":0.2441999563159854,"spread":0.2053265265545421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002544877,0.0002706241,0.0002658205,0.000170551,0.0002030427,0.0002752748,0.0005297955,0.0001090186,0.000003820582],"category_scores_gemma":[0.000009363917,0.0003022084,0.00008351426,0.0002695456,0.00005879289,0.001223614,0.0001362172,0.0001371602,0.00000768186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000195628,"about_ca_system_score_gemma":0.00003441996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003075149,"about_ca_topic_score_gemma":0.00001995008,"domain_scores_codex":[0.9985261,0.00001744686,0.0003610978,0.0003741143,0.0001738611,0.0005474102],"domain_scores_gemma":[0.9991494,0.00009351027,0.0000597458,0.0005215001,0.00008325409,0.00009253915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000060504,0.0002835351,0.0004316871,0.0005915395,0.0004197608,0.000003923205,0.0003828068,0.009438452,0.2189844,0.0008683674,0.5599821,0.208553],"study_design_scores_gemma":[0.0002780349,0.0001790294,0.00002618468,0.00007740808,0.0000456123,0.0000173969,0.000007224886,0.7015846,0.1003218,0.0002402943,0.19676,0.0004624284],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008640458,0.00004340798,0.9869434,0.00004789935,0.0004894314,0.0007049215,0.0003686773,0.002144477,0.0006173172],"genre_scores_gemma":[0.8613576,0.00002094894,0.1376665,0.00008503837,0.0002813703,0.00006449191,0.0004112654,0.00008966302,0.00002309604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8527172,"threshold_uncertainty_score":0.999943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}