{"meta":{"query_hash":"015f665a58ab","filters":{"venue":"IET Computers & Digital Techniques"},"cohort_total":36,"direct_labels_cover":0,"predictions_cover":36,"exported":36,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/015f665a58ab","api":"https://metacan.xera.ac/api/v1/cohort?venue=IET+Computers+%26+Digital+Techniques"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.039268405653066156,"score_gpt":0.3119840696708274,"score_spread":0.27271566401776126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1041293701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05723535,0.0006302336,0.934366,0.00007628865,0.00006682714,0.00009941303,0.00003798784,0.0021740012,0.0053139394],"genre_scores_gemma":[0.61850196,0.00037879808,0.37596735,0.00009379917,0.00004250536,0.00012522399,0.0001721101,0.00046386887,0.0042545227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993193,0.00010012871,0.00005100315,0.00011447224,0.00034618066,0.000068960086],"domain_scores_gemma":[0.9991516,0.0002551758,0.000115824914,0.00025830397,0.00020474859,0.000014419008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041836474,0.0006647314,0.00031828284,0.00057109626,0.00021875497,0.00050003716,0.0009276156,0.00036510482,0.0024163683],"category_scores_gemma":[0.0018382462,0.00027841295,0.00045280508,0.00052075624,0.00029230578,0.0008136263,0.0005173847,0.0006575916,0.0005359838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027549113,0.00008531324,0.0016322973,0.00028056916,0.000057771147,0.0001610637,0.00016638447,0.26097342,0.1631131,0.008590626,0.0019247566,0.5627392],"study_design_scores_gemma":[0.000060492002,0.0004323537,0.0018005689,0.00004521258,0.00007262239,0.0004461636,0.00005116899,0.82475656,0.14450552,0.0068248753,0.020956073,0.000048382568],"about_ca_topic_score_codex":0.0007079533,"about_ca_topic_score_gemma":0.001438245,"teacher_disagreement_score":0.0024163683,"about_ca_system_score_codex":0.00040975492,"about_ca_system_score_gemma":0.00047783766,"threshold_uncertainty_score":0.008083582},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02419302560343754,"score_gpt":0.22997076009410644,"score_spread":0.2057777344906689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511491629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23718473,0.0035207435,0.72883993,0.00043245652,0.0004152679,0.00017937094,0.00016703192,0.0017738056,0.027486632],"genre_scores_gemma":[0.64705014,0.001721215,0.33221373,0.00016127768,0.00018788246,0.00010189587,0.00025939007,0.00010440533,0.018200044],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998673,0.000023506427,0.000012139022,0.0000287814,0.000050325118,0.000017933931],"domain_scores_gemma":[0.9997873,0.000053747615,0.000047579844,0.000040348732,0.000058349327,0.0000127299845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019226104,0.00044648346,0.00022069534,0.00052266405,0.00028143774,0.0004892843,0.0004560065,0.00040032112,0.0033589178],"category_scores_gemma":[0.0005635585,0.00016307892,0.00033683187,0.00039736216,0.000248546,0.0011410145,0.00037323072,0.00043018768,0.0010594493],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080377277,0.00014504755,0.0018539414,0.00057180936,0.000095979354,0.00057888357,0.00032828175,0.019282453,0.37069106,0.075226665,0.0035251866,0.52689695],"study_design_scores_gemma":[0.00019341777,0.0020625603,0.0032486185,0.0002109,0.00018730575,0.0046794433,0.00018580098,0.15564996,0.6964868,0.027460758,0.10951198,0.00012239444],"about_ca_topic_score_codex":0.00015919338,"about_ca_topic_score_gemma":0.00047429788,"teacher_disagreement_score":0.0033589178,"about_ca_system_score_codex":0.0002876532,"about_ca_system_score_gemma":0.00029281926,"threshold_uncertainty_score":0.011236727},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008669592829528056,"score_gpt":0.25062490886247935,"score_spread":0.24195531603295128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551456964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046405856,0.0008895779,0.92953146,0.00022287836,0.00016225745,0.00020975796,0.00011562722,0.004835539,0.017627023],"genre_scores_gemma":[0.40439153,0.0007300668,0.5864415,0.00017150454,0.00008860467,0.00014126964,0.00030084053,0.00011499685,0.0076197055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.00003788875,0.00003116218,0.0000633705,0.00014143127,0.00003095641],"domain_scores_gemma":[0.9998149,0.000036897134,0.000017075736,0.000044139666,0.00007812755,0.000008800639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513782,0.0003420674,0.00036848316,0.0006762027,0.00036050702,0.0010774867,0.0010389903,0.00034670794,0.0035727476],"category_scores_gemma":[0.0005840982,0.00019348142,0.00026686484,0.0006312257,0.00029026158,0.0007521936,0.00032006964,0.0004575664,0.0016905867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005538376,0.00014038301,0.0014254302,0.00041338315,0.00005970432,0.00043339227,0.00022430487,0.02735047,0.15830193,0.055233877,0.0051166783,0.75074655],"study_design_scores_gemma":[0.00024369035,0.0011414883,0.001993835,0.00016552502,0.00014228295,0.004353511,0.00018210575,0.48792654,0.40649757,0.018283676,0.078923956,0.00014585309],"about_ca_topic_score_codex":0.00075151183,"about_ca_topic_score_gemma":0.0009937993,"teacher_disagreement_score":0.0035727476,"about_ca_system_score_codex":0.0003894709,"about_ca_system_score_gemma":0.00082881097,"threshold_uncertainty_score":0.011952102},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02590197359389883,"score_gpt":0.2451128317876077,"score_spread":0.21921085819370886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970019860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3394139,0.001062206,0.6426596,0.0005032287,0.00017252458,0.000506893,0.00019256255,0.0035222997,0.011966776],"genre_scores_gemma":[0.47403497,0.00068079913,0.5169892,0.00020861939,0.000048816175,0.00020057822,0.0005442808,0.0005150568,0.0067777685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000035001598,0.000016030186,0.000037799295,0.000050920906,0.000047431284],"domain_scores_gemma":[0.99933016,0.0002558099,0.00014803743,0.00013336088,0.00010871755,0.000023826431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022872597,0.0010253442,0.00060933805,0.00051379635,0.00028850988,0.0005305399,0.0006903862,0.0003906221,0.0035553155],"category_scores_gemma":[0.0010955809,0.00035202256,0.00045189072,0.0005470714,0.00028558954,0.00063331705,0.00024254089,0.0009184543,0.001077227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006163417,0.00043465602,0.0019108595,0.00049845566,0.000040989995,0.00031938372,0.00026178276,0.15823336,0.29962724,0.007809135,0.0033938794,0.52685386],"study_design_scores_gemma":[0.0002861058,0.0028589377,0.005475302,0.00011681184,0.00022363968,0.00077194255,0.00034204798,0.5869638,0.33515587,0.013837839,0.053875197,0.00009249809],"about_ca_topic_score_codex":0.0016486878,"about_ca_topic_score_gemma":0.0037676182,"teacher_disagreement_score":0.0035553155,"about_ca_system_score_codex":0.0003678411,"about_ca_system_score_gemma":0.0010540109,"threshold_uncertainty_score":0.011893749},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02258229929357752,"score_gpt":0.2455796995939078,"score_spread":0.22299740030033027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991225420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21235238,0.0012246263,0.7791389,0.0002596572,0.00013891625,0.00015853903,0.000052060914,0.0015233855,0.005151404],"genre_scores_gemma":[0.92472464,0.0002545466,0.07308242,0.000112447386,0.000041152358,0.000081551865,0.000075001466,0.000041478288,0.0015867949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997497,0.00007013016,0.00001871559,0.000037984082,0.00008468014,0.00003871412],"domain_scores_gemma":[0.9994555,0.00022540864,0.00005086563,0.00008831786,0.00013620841,0.000043730728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034512,0.0003794247,0.00023476845,0.00052974373,0.00038179677,0.00045924966,0.000789878,0.00021546466,0.0008870896],"category_scores_gemma":[0.0009503908,0.00013475664,0.00013074886,0.0004043221,0.00031325547,0.0005861544,0.00031611847,0.00032563074,0.000157701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005719829,0.00042027218,0.0044739996,0.0001654539,0.00009669892,0.00038694288,0.00023248311,0.1681086,0.2555892,0.01911729,0.005504639,0.5453324],"study_design_scores_gemma":[0.00008540374,0.00038453555,0.0016456847,0.000012728938,0.00006897703,0.0002502934,0.000065092434,0.9315095,0.056010444,0.004632894,0.0053007035,0.000033780365],"about_ca_topic_score_codex":0.0011350915,"about_ca_topic_score_gemma":0.0025354116,"teacher_disagreement_score":0.0011350915,"about_ca_system_score_codex":0.00043699704,"about_ca_system_score_gemma":0.0007285949,"threshold_uncertainty_score":0.0031706095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04922049004676316,"score_gpt":0.25872247149558575,"score_spread":0.2095019814488226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995613452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01122904,0.00018571081,0.9727208,0.0000815207,0.00003077361,0.0001378013,0.00027604436,0.011859609,0.0034785648],"genre_scores_gemma":[0.11347168,0.00027268162,0.881144,0.00009276756,0.000012783225,0.00064243353,0.00058216753,0.0010903578,0.0026911236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.00006831152,0.000016199248,0.000025258423,0.00015556908,0.000022009724],"domain_scores_gemma":[0.99892884,0.0007825927,0.00007452206,0.00005632161,0.00013651716,0.000021268517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079512584,0.0009933633,0.0005064083,0.00072672055,0.00033188998,0.00072251755,0.0010086155,0.00070100295,0.008583534],"category_scores_gemma":[0.0025274302,0.00053194707,0.00065698836,0.00048502238,0.0004130164,0.00049068825,0.0005044321,0.00092206243,0.00096335047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003082549,0.00010833713,0.0017628416,0.00079601567,0.00012252135,0.0003959464,0.0003490661,0.61720467,0.031922217,0.01722681,0.014747468,0.31505588],"study_design_scores_gemma":[0.00011815607,0.00010732041,0.0002333107,0.000047840407,0.00003022726,0.00013871257,0.000033101,0.9722454,0.008878654,0.003919122,0.014225077,0.000023063509],"about_ca_topic_score_codex":0.0030952294,"about_ca_topic_score_gemma":0.0061142445,"teacher_disagreement_score":0.008583534,"about_ca_system_score_codex":0.0005263002,"about_ca_system_score_gemma":0.0016358583,"threshold_uncertainty_score":0.028714836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00968258682185651,"score_gpt":0.21422684694753008,"score_spread":0.20454426012567356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007102977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40401086,0.0004664899,0.58786726,0.00022396952,0.00014661226,0.000086873915,0.000031718013,0.0010646041,0.0061015496],"genre_scores_gemma":[0.9689174,0.00007103435,0.02956369,0.000059031918,0.000008474899,0.000042641568,0.000015489033,0.00003180302,0.0012903598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998404,0.000044397693,0.0000073186816,0.00003935173,0.000031098418,0.00003745623],"domain_scores_gemma":[0.99978906,0.0000682256,0.00004114748,0.000035757763,0.000041121504,0.000024793779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029563083,0.00041903148,0.0003103941,0.00021190233,0.00037524517,0.0005349197,0.000628482,0.000360703,0.0007154036],"category_scores_gemma":[0.00047494212,0.00018045455,0.00031108852,0.00019856513,0.00034352246,0.00041861148,0.0005602094,0.00030637888,0.0001275649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024615857,0.00016473889,0.0011867105,0.0000586159,0.00004945693,0.00014130252,0.0001398917,0.8612925,0.06420513,0.0050291973,0.0009854591,0.06650087],"study_design_scores_gemma":[0.000015905638,0.00008199637,0.00038549508,0.0000025846803,0.000008272183,0.000021299691,0.0000145940385,0.99080515,0.0062257596,0.0015832429,0.0008475471,0.000008120699],"about_ca_topic_score_codex":0.002569301,"about_ca_topic_score_gemma":0.0026342773,"teacher_disagreement_score":0.002569301,"about_ca_system_score_codex":0.0005088261,"about_ca_system_score_gemma":0.00044832713,"threshold_uncertainty_score":0.005108714},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013708788878061725,"score_gpt":0.23266124691496257,"score_spread":0.21895245803690083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011813090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019009292,0.00013156327,0.9731002,0.00008048301,0.000028889124,0.00004791504,0.00011028277,0.0066811624,0.00081016956],"genre_scores_gemma":[0.31507516,0.0001069708,0.68283504,0.00009412101,0.000018053663,0.00010149441,0.0002179758,0.00015012235,0.0014010321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997688,0.000035764406,0.000015245283,0.000038352486,0.00012356388,0.000018293065],"domain_scores_gemma":[0.998979,0.00062317797,0.00009271454,0.000104083614,0.00016257404,0.00003843261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034626384,0.0006386039,0.0007328004,0.0013636858,0.00021261816,0.00052511785,0.0008605775,0.00075021497,0.003349352],"category_scores_gemma":[0.002028141,0.00025681366,0.0002900154,0.00051518047,0.00033607488,0.000717273,0.00062629924,0.00048938807,0.00050396903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004276985,0.0001369081,0.0035696563,0.00034610607,0.00013796767,0.00089770724,0.00016708503,0.13723373,0.11427465,0.011030984,0.005050858,0.7267267],"study_design_scores_gemma":[0.00006143708,0.00022902265,0.0008563013,0.000028401973,0.00004962177,0.0010698925,0.000028823168,0.93471736,0.054399975,0.0043266127,0.0041989232,0.000033662047],"about_ca_topic_score_codex":0.0007422567,"about_ca_topic_score_gemma":0.00095998374,"teacher_disagreement_score":0.003349352,"about_ca_system_score_codex":0.00036925258,"about_ca_system_score_gemma":0.00049002015,"threshold_uncertainty_score":0.01120472},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03887342976144327,"score_gpt":0.2441999563159854,"score_spread":0.20532652655454214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021731414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5695143,0.0057081757,0.40059862,0.0012190541,0.00041195884,0.00030588414,0.00055564457,0.0059401165,0.015746273],"genre_scores_gemma":[0.8648653,0.0009042362,0.12496839,0.00053208176,0.000102088794,0.00015303303,0.00039555857,0.00009911246,0.0079802135],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999871,0.0000192112,0.000014507903,0.000021099859,0.00003861082,0.000035450914],"domain_scores_gemma":[0.99960536,0.00007469096,0.00011146011,0.000072811854,0.00011185816,0.000023867293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011029132,0.0004816178,0.00023418562,0.000394579,0.00045567454,0.00053307135,0.0012605428,0.00035691788,0.0029571378],"category_scores_gemma":[0.00029293794,0.00022340019,0.00029123898,0.00058161083,0.0001908028,0.0007100567,0.0003101779,0.00035102924,0.00063529355],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009923354,0.00036024253,0.005498449,0.0007823924,0.0002212935,0.0007431685,0.00031102964,0.037557498,0.51718193,0.012865758,0.02097555,0.4025103],"study_design_scores_gemma":[0.00036411022,0.0029419132,0.0042731394,0.00010241503,0.0003763891,0.0013046615,0.00036584673,0.32967764,0.5943563,0.0072737504,0.05886309,0.000100711244],"about_ca_topic_score_codex":0.0016024978,"about_ca_topic_score_gemma":0.0061754915,"teacher_disagreement_score":0.0029571378,"about_ca_system_score_codex":0.00047292924,"about_ca_system_score_gemma":0.0005173326,"threshold_uncertainty_score":0.009892583},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009906054993092708,"score_gpt":0.2286296666313555,"score_spread":0.2187236116382628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031883009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020078514,0.19487236,0.64282507,0.01901975,0.0019638878,0.00009374444,0.00027409298,0.0008198504,0.12005275],"genre_scores_gemma":[0.3937776,0.21545988,0.3479271,0.003105354,0.0029130592,0.0002916413,0.0004985356,0.00065570156,0.035371147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885845,0.0003212981,0.000058376343,0.00017971563,0.00048509016,0.00009706717],"domain_scores_gemma":[0.9979273,0.0015050491,0.00008854915,0.00020644172,0.00021909397,0.00005349869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027156402,0.0007404664,0.0010240688,0.00084587064,0.00045221043,0.0019424214,0.001586737,0.0021248923,0.006411128],"category_scores_gemma":[0.0053218137,0.00052834617,0.00072898035,0.0010245651,0.0015085118,0.0045568966,0.0011464292,0.002551888,0.0022425295],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012697354,0.000075068645,0.00022865897,0.0014312109,0.00003925744,0.0001073657,0.00015405437,0.119099475,0.004959448,0.5577236,0.0075674024,0.30848753],"study_design_scores_gemma":[0.00003258453,0.00016485572,0.00016113806,0.00040005133,0.000021190968,0.00021328747,0.00011127803,0.24365136,0.006998531,0.5605897,0.18759668,0.00005940196],"about_ca_topic_score_codex":0.0006063097,"about_ca_topic_score_gemma":0.0006285285,"teacher_disagreement_score":0.006411128,"about_ca_system_score_codex":0.0017052151,"about_ca_system_score_gemma":0.00095132616,"threshold_uncertainty_score":0.02144736},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.005253316474402197,"score_gpt":0.18986712384177673,"score_spread":0.18461380736737454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068411283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5329868,0.001276148,0.45483413,0.000453972,0.00031778426,0.00059929484,0.00065660133,0.0019389848,0.0069362065],"genre_scores_gemma":[0.6680819,0.0010926228,0.32583314,0.00019779152,0.000049807342,0.0003205649,0.0004885323,0.00012302912,0.003812617],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997118,0.0000244981,0.000020649819,0.00008959878,0.00012701552,0.0000263711],"domain_scores_gemma":[0.9998037,0.000078237994,0.00002917641,0.00004752222,0.000030094876,0.00001113142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040241997,0.00046201656,0.000387422,0.00024957064,0.00026335908,0.00058530975,0.0007764702,0.00042771726,0.0017129342],"category_scores_gemma":[0.00045932672,0.00031052224,0.00035834353,0.00029261498,0.00029944413,0.00068531564,0.00046690748,0.00046328557,0.00068538944],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013645842,0.00006556813,0.0005087062,0.00015827341,0.00001876168,0.00007937036,0.0000387449,0.011233396,0.9666862,0.0019484074,0.000387215,0.018738858],"study_design_scores_gemma":[0.000023614737,0.00012250307,0.0002090352,0.0000056637764,0.000011737184,0.000037914444,0.0000069830066,0.035144288,0.9609987,0.0003750004,0.0030531194,0.000011515655],"about_ca_topic_score_codex":0.0003410745,"about_ca_topic_score_gemma":0.00041403735,"teacher_disagreement_score":0.0017129342,"about_ca_system_score_codex":0.00047872716,"about_ca_system_score_gemma":0.0002268283,"threshold_uncertainty_score":0.0057303905},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0106758076462873,"score_gpt":0.21924112964637413,"score_spread":0.20856532200008682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077045439","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51231223,0.0016267976,0.4771313,0.0005966088,0.0002224592,0.000094242096,0.00013914803,0.0020115806,0.005865608],"genre_scores_gemma":[0.96173483,0.00012311993,0.03697327,0.00009515795,0.000025388388,0.000012372558,0.000023502376,0.000011786853,0.0010005628],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998808,0.000017920767,0.000010509969,0.000032618766,0.00004696574,0.000011217483],"domain_scores_gemma":[0.9998148,0.00005232565,0.000042968695,0.00004478536,0.000037971997,0.000007109575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110927955,0.00015243585,0.00015386227,0.00012095905,0.00014214692,0.00026921002,0.0007303875,0.00032970577,0.0012811188],"category_scores_gemma":[0.00032529532,0.000100141704,0.00013344876,0.00011657523,0.0001494443,0.0006989228,0.0001823586,0.00018775286,0.00024046512],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022543193,0.00007547223,0.00093085045,0.00020678395,0.000030381083,0.00025348872,0.00010180005,0.009216677,0.8950029,0.0063577723,0.0011396579,0.086458795],"study_design_scores_gemma":[0.00007854502,0.0019773312,0.003182082,0.00004534493,0.00009933017,0.0019323502,0.000079795995,0.2543867,0.71900535,0.004201198,0.014967385,0.000044567816],"about_ca_topic_score_codex":0.00013493087,"about_ca_topic_score_gemma":0.0004906822,"teacher_disagreement_score":0.0012811188,"about_ca_system_score_codex":0.00017145314,"about_ca_system_score_gemma":0.00011529166,"threshold_uncertainty_score":0.004285753},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006455475369999442,"score_gpt":0.23035297385902168,"score_spread":0.22389749848902224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091507826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04644214,0.00023933042,0.90669274,0.00047629824,0.00027572154,0.0003326796,0.0004106012,0.040179525,0.0049509592],"genre_scores_gemma":[0.40970734,0.00016659149,0.5801618,0.00044911788,0.0001194627,0.00021944313,0.0008832403,0.0030551534,0.005237894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949961,0.0020495804,0.00047455833,0.0006249957,0.0014556925,0.00039900752],"domain_scores_gemma":[0.9686798,0.01673857,0.0011771799,0.009978812,0.0031342015,0.00029142998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060032397,0.0011991131,0.00061955105,0.0015574441,0.00039077946,0.0015243299,0.0023534098,0.0011866004,0.010035017],"category_scores_gemma":[0.033603903,0.0008180521,0.0008248436,0.0007722666,0.0006702569,0.0039420016,0.001875682,0.0019069588,0.0025775784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003598583,0.00079868926,0.017437564,0.0008030588,0.00016245511,0.0023676208,0.0013722315,0.04450743,0.111558974,0.06120304,0.019353708,0.7368366],"study_design_scores_gemma":[0.0006713366,0.0015178866,0.0034599628,0.00022088499,0.0003248766,0.0029543464,0.00023809964,0.5650336,0.3140382,0.034985676,0.076368295,0.00018686292],"about_ca_topic_score_codex":0.0007650542,"about_ca_topic_score_gemma":0.0014091328,"teacher_disagreement_score":0.010035017,"about_ca_system_score_codex":0.00044659348,"about_ca_system_score_gemma":0.0010980201,"threshold_uncertainty_score":0.03357047},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017170812662659483,"score_gpt":0.2531135861739861,"score_spread":0.23594277351132661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093498840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018062215,0.00029951346,0.97497433,0.00020525312,0.000032878103,0.00014687874,0.000049385544,0.00189753,0.0043319855],"genre_scores_gemma":[0.21667524,0.0007787703,0.77127254,0.0004624769,0.000030341054,0.00035149933,0.00026890825,0.00083579466,0.00932435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984357,0.00043836934,0.00017426597,0.0001949941,0.00064696744,0.00010965124],"domain_scores_gemma":[0.9972932,0.000906314,0.00019135456,0.0011759542,0.00036211975,0.00007098909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022489189,0.0005066937,0.00024834776,0.00045542378,0.00021638782,0.0014437621,0.0018509342,0.0005630632,0.0026663078],"category_scores_gemma":[0.0035847079,0.0005914944,0.0005055785,0.0004497776,0.0006388467,0.0025113537,0.0013982868,0.0018832809,0.00085408066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005763867,0.00021401154,0.001667447,0.0007653876,0.000104677805,0.0004865035,0.0007947058,0.08557766,0.17069922,0.11416291,0.003890052,0.62106097],"study_design_scores_gemma":[0.0002997847,0.00083040266,0.0012759413,0.00030235157,0.00015359579,0.001543203,0.0003405446,0.50054747,0.24017678,0.05485131,0.19951352,0.00016510228],"about_ca_topic_score_codex":0.00043777507,"about_ca_topic_score_gemma":0.0011273839,"teacher_disagreement_score":0.0026663078,"about_ca_system_score_codex":0.0005988582,"about_ca_system_score_gemma":0.0010445492,"threshold_uncertainty_score":0.011893511},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005852492083715271,"score_gpt":0.20439028531057887,"score_spread":0.1985377932268636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103884101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31008634,0.00061308435,0.68083733,0.00025425322,0.000115480136,0.000121949925,0.00010188248,0.0010112585,0.006858536],"genre_scores_gemma":[0.93092096,0.000101180674,0.067308076,0.000062392406,0.000014903072,0.000027948325,0.000029312116,0.000015634245,0.0015196226],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991214,0.00001627589,0.0000046609684,0.00002117289,0.000032581887,0.0000131526285],"domain_scores_gemma":[0.999871,0.000044298515,0.000023304528,0.000020266027,0.000031550066,0.0000094430125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014155895,0.00016523662,0.00011144928,0.00012249796,0.00018937908,0.00026110167,0.000650002,0.00021842463,0.0018043347],"category_scores_gemma":[0.0003216192,0.00010369489,0.00010604341,0.00009208693,0.00017092151,0.00035368296,0.00018396515,0.00018670208,0.00021828909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044192726,0.00007872298,0.0015955017,0.00018924198,0.000022556103,0.00034022488,0.00010219661,0.0222721,0.8213062,0.017756067,0.0015788262,0.13431638],"study_design_scores_gemma":[0.00012359324,0.0011127191,0.0020652495,0.000036662885,0.00006254459,0.0011983884,0.000052412888,0.38854486,0.58359283,0.0034642506,0.019712599,0.000033878663],"about_ca_topic_score_codex":0.00031351243,"about_ca_topic_score_gemma":0.0010343953,"teacher_disagreement_score":0.0018043347,"about_ca_system_score_codex":0.00027572276,"about_ca_system_score_gemma":0.0002782033,"threshold_uncertainty_score":0.006036043},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.003651611229473612,"score_gpt":0.17792410096381917,"score_spread":0.17427248973434556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108211345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1836023,0.00095495896,0.8103207,0.00017255262,0.0000602933,0.00005596474,0.000058616548,0.0005714076,0.004203198],"genre_scores_gemma":[0.896687,0.00039247744,0.1000264,0.0000669357,0.000034059358,0.00003956475,0.00006996129,0.000056462304,0.0026270824],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996705,0.000063877145,0.00001789352,0.0000669571,0.00013212068,0.000048591093],"domain_scores_gemma":[0.9994128,0.00023036776,0.00011768717,0.00008870887,0.00013002616,0.00002049364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047245252,0.00027837206,0.00024207491,0.00036659796,0.00031850897,0.0005043254,0.00054134737,0.0002320377,0.0013551712],"category_scores_gemma":[0.001618865,0.00013242252,0.00015074799,0.0005445197,0.00027100032,0.0010074745,0.00039565572,0.00032419965,0.000220809],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059132336,0.00008197625,0.0029729581,0.00018693836,0.000034247918,0.00020826815,0.00017000556,0.42091545,0.08845221,0.049812935,0.0012442399,0.43532947],"study_design_scores_gemma":[0.000045687717,0.00030798052,0.0007569866,0.000027122049,0.000031560034,0.00022878656,0.00005198519,0.90405387,0.07385608,0.013205078,0.007414551,0.00002028086],"about_ca_topic_score_codex":0.00052875327,"about_ca_topic_score_gemma":0.00074663316,"teacher_disagreement_score":0.0013551712,"about_ca_system_score_codex":0.000594784,"about_ca_system_score_gemma":0.00044854044,"threshold_uncertainty_score":0.0045334697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Royal Military College of Canada","funders":"","keywords":"Multiplier (economics); Field-programmable gate array; Arithmetic; Integer (computer science); Multiplication (music); Computer science; Mathematics; Adder; Parallel computing; Computer hardware; Combinatorics","score_opus":0.009338906035856749,"score_gpt":0.24396789190980128,"score_spread":0.23462898587394454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124879637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044461668,0.00053031195,0.9482471,0.000053433538,0.000060462382,0.000156088,0.00004123302,0.0011324234,0.0053172256],"genre_scores_gemma":[0.27667388,0.00032752182,0.71692765,0.000056411878,0.00003687401,0.00017425635,0.00012003413,0.00015691666,0.0055265147],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996865,0.00006059993,0.00002486869,0.000050565337,0.00013966877,0.000037756326],"domain_scores_gemma":[0.9996383,0.00012968271,0.00007607385,0.00004941734,0.000095665266,0.000010842606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037557268,0.0008200587,0.00030970862,0.00033909,0.00017520548,0.00061608665,0.00093439844,0.00031800257,0.0037693651],"category_scores_gemma":[0.0008246727,0.0003757519,0.00035445497,0.00026129917,0.00027691037,0.00063936174,0.0003318166,0.0005033404,0.0009239361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003544009,0.00012501255,0.0007270243,0.0008476328,0.00011170756,0.0005273741,0.0002160392,0.21810444,0.4313884,0.028914604,0.0020888704,0.31659445],"study_design_scores_gemma":[0.00018251534,0.0019151338,0.0011226524,0.00015256899,0.00013093687,0.0012311969,0.00010997373,0.6588594,0.28407833,0.009191827,0.042967454,0.00005803034],"about_ca_topic_score_codex":0.00032642146,"about_ca_topic_score_gemma":0.0011059095,"teacher_disagreement_score":0.0037693651,"about_ca_system_score_codex":0.00035058428,"about_ca_system_score_gemma":0.00047413443,"threshold_uncertainty_score":0.01260978},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015100661303857111,"score_gpt":0.2567706746588784,"score_spread":0.24167001335502125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130393477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98089087,0.0015921434,0.010584415,0.00020989245,0.0001261975,0.00003605812,0.00018664837,0.0007796316,0.0055942074],"genre_scores_gemma":[0.9903627,0.000312973,0.008122367,0.000055567332,0.000026430489,0.000026152351,0.00018160569,0.00006833791,0.00084375555],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946946,0.00009629298,0.00006551117,0.00010709597,0.00015734852,0.000104296225],"domain_scores_gemma":[0.9974789,0.0013154765,0.00030887438,0.00024162029,0.000565985,0.000089018286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041192723,0.0007505854,0.00034384223,0.0005495829,0.00019476967,0.00047198776,0.00051204703,0.00043296564,0.0023785003],"category_scores_gemma":[0.0035536638,0.00020102544,0.00020468891,0.00085560343,0.00021352139,0.0010283715,0.00026406458,0.00023186806,0.00039197152],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031532715,0.00043503128,0.011952579,0.0005257019,0.00015669924,0.0013778973,0.00036488782,0.21221969,0.53027093,0.0026559185,0.005560881,0.23132658],"study_design_scores_gemma":[0.00034919716,0.007512052,0.026498493,0.00013159115,0.0003004331,0.0017274178,0.0004056922,0.4361629,0.512006,0.0011260789,0.013654481,0.00012577117],"about_ca_topic_score_codex":0.001224873,"about_ca_topic_score_gemma":0.0009149846,"teacher_disagreement_score":0.0023785003,"about_ca_system_score_codex":0.00039380265,"about_ca_system_score_gemma":0.0003079914,"threshold_uncertainty_score":0.007956862},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013069255694701205,"score_gpt":0.21691017945727575,"score_spread":0.20384092376257454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169353951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07582686,0.00034532184,0.918832,0.000108693246,0.000028051716,0.00014917327,0.000038542617,0.00044452382,0.004226894],"genre_scores_gemma":[0.60095096,0.00023858543,0.39606696,0.00007925104,0.000017024893,0.0003255643,0.0001267062,0.00017935329,0.0020155255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993212,0.00029063004,0.000029669916,0.00008667162,0.00020062702,0.00007124479],"domain_scores_gemma":[0.9991721,0.0004091958,0.00013361436,0.00010859363,0.00015266969,0.000023828343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013734631,0.0008687004,0.0005853806,0.0010569834,0.0002974232,0.00064946857,0.0009134162,0.00060966425,0.0011948],"category_scores_gemma":[0.0026654126,0.0003765237,0.000666191,0.0006183502,0.00051432307,0.00061669643,0.000826562,0.00059607025,0.00015482299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001732272,0.000032447748,0.0003582916,0.00004495469,0.000026075306,0.000035915662,0.00003428489,0.9458477,0.004550769,0.0024462626,0.0002052512,0.04640074],"study_design_scores_gemma":[0.00000648023,0.00004679486,0.00017259063,0.000008013149,0.0000112416865,0.00001980295,0.000014639315,0.99387336,0.0025463372,0.0026910526,0.00060495606,0.0000047818417],"about_ca_topic_score_codex":0.0013726386,"about_ca_topic_score_gemma":0.0017473184,"teacher_disagreement_score":0.0013734631,"about_ca_system_score_codex":0.0007295471,"about_ca_system_score_gemma":0.00086930406,"threshold_uncertainty_score":0.0072636604},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10094770743611232,"score_gpt":0.34727397872046256,"score_spread":0.24632627128435025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255454767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94311965,0.00032993188,0.052263107,0.00008859821,0.00003155294,0.000047822916,0.00011500174,0.00037536083,0.003628846],"genre_scores_gemma":[0.9909016,0.000033923876,0.00864557,0.000008287234,0.0000031350064,0.000016251508,0.00008129762,0.000015917218,0.00029402843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993249,0.00022048964,0.000044750654,0.00008435229,0.00022076843,0.00010469957],"domain_scores_gemma":[0.99649733,0.0018992481,0.00040019804,0.00039184472,0.00066286477,0.00014848118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012350925,0.00057956256,0.00036717558,0.0009782363,0.0003310305,0.00052637124,0.0006764237,0.00040967175,0.0011026936],"category_scores_gemma":[0.0063937563,0.00016661036,0.00030541822,0.0007923074,0.00042615467,0.0006833477,0.00048766486,0.00029256367,0.00009269236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022271831,0.000071196046,0.0053062052,0.000059711143,0.000032965818,0.000039023824,0.000031724634,0.9582214,0.003625744,0.002299837,0.0003079507,0.029781718],"study_design_scores_gemma":[0.0000067135893,0.00018229973,0.0025181305,0.000004191584,0.0000072124794,0.00001598487,0.000021991882,0.9931999,0.0028752827,0.000977074,0.00018672788,0.0000046024657],"about_ca_topic_score_codex":0.0045867087,"about_ca_topic_score_gemma":0.004288526,"teacher_disagreement_score":0.0045867087,"about_ca_system_score_codex":0.00092016323,"about_ca_system_score_gemma":0.00069321255,"threshold_uncertainty_score":0.0091199875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028594193466471494,"score_gpt":0.277706297829231,"score_spread":0.24911210436275952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273070579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13941374,0.0010417021,0.82555246,0.00061722635,0.00028207686,0.00019747032,0.00047510426,0.0020796494,0.03034045],"genre_scores_gemma":[0.7854127,0.00030206877,0.20317732,0.00018582198,0.000065696564,0.00012299254,0.00024435064,0.00007077351,0.010418252],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998658,0.00002358107,0.000009688603,0.0000328206,0.000052870317,0.000015277383],"domain_scores_gemma":[0.9998585,0.000029678507,0.000037128255,0.000019127268,0.000044690336,0.0000109392495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011269975,0.00024169301,0.00028829073,0.00037632853,0.00028092705,0.000582403,0.0009363055,0.00041685754,0.0036294211],"category_scores_gemma":[0.00019935127,0.0001767047,0.00019139024,0.00043643694,0.00017063784,0.0006733843,0.00024223007,0.00021551727,0.00082437607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005076373,0.0001467816,0.001584126,0.00077027787,0.000117196716,0.0009440936,0.00031809814,0.03786797,0.61764824,0.05085553,0.010052216,0.27918783],"study_design_scores_gemma":[0.00022891235,0.0023202933,0.0026870861,0.00013514064,0.00016370336,0.004797431,0.00015297603,0.4472658,0.41685274,0.013140124,0.11214833,0.00010745188],"about_ca_topic_score_codex":0.00020193256,"about_ca_topic_score_gemma":0.0005825326,"teacher_disagreement_score":0.0036294211,"about_ca_system_score_codex":0.00034537635,"about_ca_system_score_gemma":0.00028402277,"threshold_uncertainty_score":0.012141585},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.022599201386390284,"score_gpt":0.2639737822558015,"score_spread":0.2413745808694112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341796638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14769378,0.0022023371,0.8105761,0.00039586134,0.0005503546,0.00014133485,0.00037288305,0.005449246,0.032618184],"genre_scores_gemma":[0.57500833,0.0008261665,0.4087049,0.00021872857,0.00016064369,0.00011827152,0.00055928336,0.0001335828,0.014270032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.000036574802,0.000037515423,0.000057721998,0.00015309217,0.000049364615],"domain_scores_gemma":[0.9996327,0.000055331762,0.00006324204,0.000098796474,0.0001357452,0.000014123391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023684518,0.00065810035,0.000420926,0.00089968165,0.000433862,0.0008768343,0.00093428313,0.00035394658,0.0036720692],"category_scores_gemma":[0.00069372513,0.00028857673,0.00052039645,0.000820618,0.00029598645,0.0010119987,0.00044436977,0.00049796735,0.0016193327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074270234,0.00015676467,0.0011654012,0.00074985146,0.00011200219,0.00088516274,0.00029801807,0.030351749,0.24890445,0.0701834,0.008868823,0.6375817],"study_design_scores_gemma":[0.00014011764,0.0013635062,0.0020751648,0.0002411745,0.00029750488,0.0035246355,0.00012679126,0.28274116,0.56539655,0.019952226,0.1240022,0.00013889326],"about_ca_topic_score_codex":0.0005379376,"about_ca_topic_score_gemma":0.0011203373,"teacher_disagreement_score":0.0036720692,"about_ca_system_score_codex":0.00044911567,"about_ca_system_score_gemma":0.000626952,"threshold_uncertainty_score":0.012284279},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030274449641461147,"score_gpt":0.2961824391776271,"score_spread":0.26590798953616596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590023945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34699824,0.0021899028,0.61846775,0.00020354996,0.00015186345,0.00014919782,0.00019836804,0.0024295931,0.029211536],"genre_scores_gemma":[0.80481625,0.00062489137,0.1844367,0.00006716158,0.00003177927,0.000079660196,0.0001991373,0.000040180348,0.00970427],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999021,0.000013011979,0.000006061551,0.00001915141,0.000041528085,0.00001814034],"domain_scores_gemma":[0.9999379,0.000010820378,0.000011011925,0.000009824219,0.00002702976,0.0000034277912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083581755,0.00028933928,0.00017136423,0.0003027843,0.00023079349,0.00028770973,0.00055358955,0.00018660437,0.0023986367],"category_scores_gemma":[0.00016498221,0.000118623946,0.00016232354,0.00031599976,0.00008330334,0.00040918597,0.00013043854,0.00018768948,0.0004872706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048696197,0.0000868253,0.0015481642,0.00041243745,0.000096014315,0.0005750606,0.0001451033,0.038227364,0.5290868,0.014274304,0.0047178334,0.41034317],"study_design_scores_gemma":[0.00017858823,0.0021517521,0.0063549224,0.00011147547,0.00012496882,0.0022178798,0.00012700036,0.43396845,0.4909028,0.003663587,0.060119983,0.00007865811],"about_ca_topic_score_codex":0.0007364907,"about_ca_topic_score_gemma":0.0014142138,"teacher_disagreement_score":0.0023986367,"about_ca_system_score_codex":0.00023621216,"about_ca_system_score_gemma":0.00041367047,"threshold_uncertainty_score":0.008024275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01911748253702997,"score_gpt":0.26412505777196205,"score_spread":0.24500757523493208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752065998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30880782,0.006015766,0.62881756,0.00057408743,0.0007954567,0.00032699632,0.0011152191,0.008508508,0.045038603],"genre_scores_gemma":[0.7141592,0.001135838,0.26979735,0.00015428057,0.00008093995,0.00011059687,0.00087591313,0.000068385496,0.013617474],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998642,0.000011694473,0.000011708735,0.000020007905,0.00006898775,0.000023384273],"domain_scores_gemma":[0.9999167,0.000013230826,0.000012265395,0.000013158019,0.000037808048,0.0000068293375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105158986,0.0004144532,0.00032280528,0.0005464449,0.00033214258,0.00053019385,0.00066664576,0.00027136694,0.0027567595],"category_scores_gemma":[0.00018078419,0.00019368369,0.00023780821,0.00044179038,0.00010898459,0.00070981175,0.00025044187,0.0002883045,0.00060677214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007765735,0.0001033072,0.0011230271,0.0007507248,0.00015319182,0.0010497153,0.000099257886,0.035185546,0.38920668,0.021671815,0.016962904,0.5329172],"study_design_scores_gemma":[0.0002624624,0.0014546646,0.0049594175,0.00016383051,0.00024024374,0.003856783,0.00011814739,0.35685882,0.5211678,0.006305279,0.10445235,0.00016011905],"about_ca_topic_score_codex":0.0008460327,"about_ca_topic_score_gemma":0.0021325946,"teacher_disagreement_score":0.0027567595,"about_ca_system_score_codex":0.0003321334,"about_ca_system_score_gemma":0.00059821934,"threshold_uncertainty_score":0.009222209},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; 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","score_opus":0.007505424122112765,"score_gpt":0.21055296918920588,"score_spread":0.2030475450670931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910067318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0950266,0.00035567296,0.90303963,0.000086564396,0.000022804776,0.00003382031,0.00005102066,0.0005096991,0.0008741568],"genre_scores_gemma":[0.955422,0.000137178,0.04358093,0.000039704424,0.000022702303,0.000045745473,0.000063534375,0.00004072405,0.00064744835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793893,0.0006061027,0.00012037392,0.00028440426,0.0008564815,0.00019356915],"domain_scores_gemma":[0.9896902,0.0070492118,0.0012890823,0.0008877249,0.0009711628,0.00011258055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020980781,0.000576507,0.00062418735,0.00083566894,0.00031935272,0.0007921065,0.0013270887,0.00081115024,0.0008391289],"category_scores_gemma":[0.011817658,0.00043986496,0.00069827295,0.0006688722,0.0006659767,0.0011755588,0.00062509876,0.0008081175,0.00013622845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095559815,0.00002047905,0.00085798703,0.000034737408,0.000025040084,0.000029667317,0.00003238055,0.9753151,0.0037178271,0.00550587,0.00008022277,0.014285104],"study_design_scores_gemma":[0.0000023950836,0.000022075395,0.0001386381,0.0000020367638,0.000006370283,0.00001229098,0.0000016428579,0.99716645,0.0013025205,0.001269613,0.00007221158,0.0000037005996],"about_ca_topic_score_codex":0.0043144235,"about_ca_topic_score_gemma":0.0027406383,"teacher_disagreement_score":0.0043144235,"about_ca_system_score_codex":0.0011551072,"about_ca_system_score_gemma":0.0014346384,"threshold_uncertainty_score":0.011095881},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019259411816609416,"score_gpt":0.2558613399660693,"score_spread":0.23660192814945988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912351760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018153949,0.0003638825,0.9760572,0.00017494523,0.00006660245,0.000091151334,0.00004329434,0.00034384805,0.004705284],"genre_scores_gemma":[0.53064334,0.0003360399,0.46319333,0.00024495707,0.000044440825,0.00054738874,0.000108404216,0.00009984378,0.004782252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983215,0.000053228952,0.000007722651,0.000024528423,0.00006236712,0.000019936715],"domain_scores_gemma":[0.999796,0.000111533685,0.000026165639,0.000014896365,0.0000387281,0.000012711485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042802744,0.0006270339,0.00047674033,0.0006437562,0.00040662775,0.00060468196,0.0011744989,0.0009575941,0.0020571572],"category_scores_gemma":[0.0008301863,0.00031122204,0.0006694596,0.00039636466,0.00035509418,0.0005321649,0.0009646395,0.000610464,0.00022947368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003093185,0.000050533323,0.000302837,0.00008740022,0.000060679733,0.00006313727,0.000057277706,0.92055297,0.005078995,0.004917558,0.0007413407,0.06805634],"study_design_scores_gemma":[0.0000055844366,0.000029099065,0.00006863203,0.000005106721,0.00000623229,0.000018084675,0.000009537573,0.9970259,0.0005506346,0.0015526636,0.0007242505,0.0000041788257],"about_ca_topic_score_codex":0.003040605,"about_ca_topic_score_gemma":0.0031705345,"teacher_disagreement_score":0.003040605,"about_ca_system_score_codex":0.0004253626,"about_ca_system_score_gemma":0.00072704506,"threshold_uncertainty_score":0.0068818927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012287004193813508,"score_gpt":0.23135087901512577,"score_spread":0.21906387482131226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953295373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238574,0.0010074053,0.8850702,0.00038226403,0.00017743137,0.000064520464,0.0002067441,0.0028259698,0.007879645],"genre_scores_gemma":[0.74480414,0.0005372458,0.24887234,0.0001946152,0.000032644435,0.000114017996,0.0004363772,0.00015653692,0.0048520123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997503,0.000022598264,0.000022454607,0.000058413316,0.000107954314,0.000038330607],"domain_scores_gemma":[0.9996043,0.00013689706,0.00004313976,0.000096660966,0.00010758103,0.000011389494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035676686,0.00058287865,0.00036114082,0.0003014587,0.00026206012,0.00068673794,0.0012931273,0.00045531936,0.0026217077],"category_scores_gemma":[0.0017092394,0.00024223677,0.00032538743,0.0005022161,0.00028584778,0.0015261475,0.00047044532,0.00075263914,0.0005870523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004505048,0.00015787037,0.0027467136,0.00037852285,0.00013439299,0.00029010538,0.00013389306,0.3983294,0.07398041,0.018726308,0.0038099827,0.5008618],"study_design_scores_gemma":[0.000016406355,0.00008780646,0.0006428326,0.000019737648,0.00002962927,0.00009434895,0.000025373824,0.9525233,0.037830994,0.0054209633,0.0032953843,0.00001317786],"about_ca_topic_score_codex":0.0037731456,"about_ca_topic_score_gemma":0.00669061,"teacher_disagreement_score":0.0037731456,"about_ca_system_score_codex":0.00057329907,"about_ca_system_score_gemma":0.001001637,"threshold_uncertainty_score":0.008770466},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01814031823590541,"score_gpt":0.28334244665298514,"score_spread":0.26520212841707974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084828086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29928955,0.0023535755,0.645144,0.00045505638,0.00038271348,0.00033956012,0.0003672364,0.0059887646,0.045679525],"genre_scores_gemma":[0.8966403,0.00052545354,0.09108788,0.00011841701,0.00005658912,0.00007230642,0.0003609406,0.000080781116,0.01105734],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999764,0.000032798926,0.000017758202,0.00003241084,0.00010973118,0.000043256947],"domain_scores_gemma":[0.9998274,0.00002370033,0.000030875348,0.00002986278,0.00007915841,0.000008988041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014319895,0.00044714555,0.00016383703,0.00045673235,0.00020089286,0.00037828664,0.00059194217,0.00021302074,0.0035097953],"category_scores_gemma":[0.00028963046,0.00013907981,0.00022543139,0.00028014553,0.00011095948,0.0006407694,0.00016825761,0.00028818822,0.0010611098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011737809,0.0002850066,0.004122538,0.00060851465,0.00017337095,0.0013300179,0.00016238552,0.049271602,0.49487498,0.017147599,0.013583406,0.4172668],"study_design_scores_gemma":[0.00025988795,0.0020191444,0.0055888286,0.00007544217,0.00015959065,0.002911583,0.00010290689,0.29376557,0.6187433,0.00285574,0.073434494,0.00008354821],"about_ca_topic_score_codex":0.00071452186,"about_ca_topic_score_gemma":0.0010298849,"teacher_disagreement_score":0.0035097953,"about_ca_system_score_codex":0.0003097972,"about_ca_system_score_gemma":0.0003952921,"threshold_uncertainty_score":0.0117414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01470135790045721,"score_gpt":0.22456365496956227,"score_spread":0.20986229706910506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091655542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30098513,0.0010602289,0.67913055,0.0003471768,0.00020995457,0.00016431,0.00037856173,0.0031701212,0.014553944],"genre_scores_gemma":[0.8971064,0.00036073755,0.095005035,0.000116562434,0.0000326926,0.00008428288,0.00033409733,0.0001415595,0.0068186377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000033830765,0.000012353833,0.00003038311,0.00012700286,0.000030823543],"domain_scores_gemma":[0.9993906,0.00012800208,0.00012072701,0.000116062176,0.00023088545,0.0000137741235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017040921,0.0003357724,0.00015245823,0.00047493534,0.00024003196,0.00041048348,0.000666232,0.00031912842,0.0015566576],"category_scores_gemma":[0.00085095887,0.000094801195,0.00012587289,0.0004952852,0.00018488168,0.00041185535,0.00030656092,0.00032354752,0.0003294538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034783504,0.00018478595,0.0022696971,0.00039371484,0.00006024905,0.00050828425,0.0002530445,0.17036726,0.30461714,0.031712323,0.007801255,0.48148438],"study_design_scores_gemma":[0.00003574479,0.0003384925,0.0016543946,0.00006618622,0.00004066741,0.0005050772,0.00003635179,0.67108476,0.3047914,0.0037286212,0.017679634,0.00003863098],"about_ca_topic_score_codex":0.00110295,"about_ca_topic_score_gemma":0.0027001025,"teacher_disagreement_score":0.0015566576,"about_ca_system_score_codex":0.00044484893,"about_ca_system_score_gemma":0.00059558783,"threshold_uncertainty_score":0.0052075386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011531768087022514,"score_gpt":0.24311944106203645,"score_spread":0.23158767297501393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134549106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982195,0.002115463,0.07511518,0.0009783905,0.0003624553,0.00008749429,0.0009011498,0.0015222727,0.020697974],"genre_scores_gemma":[0.9838652,0.00018144329,0.014232435,0.00003838611,0.0000129096115,0.000016421129,0.00009005218,0.000017308676,0.0015458352],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988306,0.000010415074,0.000008359414,0.0000266374,0.00005314877,0.000018338844],"domain_scores_gemma":[0.9997174,0.000054660584,0.000051287396,0.000044495948,0.00011546666,0.000016716529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012183616,0.00018374849,0.00033437964,0.000170069,0.00034513834,0.00063443254,0.00077444065,0.00041654214,0.0017472428],"category_scores_gemma":[0.00026450504,0.000101574515,0.00021786346,0.00027435133,0.00026003094,0.0005807345,0.00021749051,0.00018414696,0.00037135198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006202816,0.00018794701,0.003637384,0.00054760074,0.00008700304,0.0018816894,0.00021560273,0.056372356,0.84679794,0.035854276,0.0043133134,0.049484536],"study_design_scores_gemma":[0.000113374044,0.00090913527,0.0026245783,0.000060027935,0.00009853264,0.0008098063,0.000084681546,0.50300515,0.46970746,0.006389164,0.01611985,0.000078208875],"about_ca_topic_score_codex":0.0018264384,"about_ca_topic_score_gemma":0.002675879,"teacher_disagreement_score":0.0018264384,"about_ca_system_score_codex":0.00059435447,"about_ca_system_score_gemma":0.0004278351,"threshold_uncertainty_score":0.0058451295},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007820306266085804,"score_gpt":0.230148635912285,"score_spread":0.2223283296461992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135842381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19162787,0.0006607727,0.78864574,0.0003587925,0.00023752818,0.00010989808,0.000198558,0.002514027,0.015646758],"genre_scores_gemma":[0.6398074,0.00043374283,0.34807798,0.00018309025,0.00011145302,0.00010658396,0.00040531118,0.00005411162,0.010820353],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999119,0.000020362115,0.000009225345,0.000014662896,0.000033167264,0.000010788938],"domain_scores_gemma":[0.99987423,0.000015617214,0.000022084334,0.000019443576,0.000058941056,0.000009737465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012324264,0.000299195,0.00015526266,0.00039075324,0.00027637678,0.0003763662,0.0006755196,0.00022959361,0.003196349],"category_scores_gemma":[0.00021777458,0.00011456877,0.00017848118,0.00055671675,0.00016228687,0.00045156776,0.00018420754,0.00027472668,0.0012399234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006192101,0.00015599362,0.0019501704,0.00030960506,0.00008670305,0.00048779862,0.00017059341,0.022525314,0.5460081,0.044146437,0.006692581,0.37684754],"study_design_scores_gemma":[0.00034227702,0.0026843378,0.0027343284,0.000087010296,0.0002020366,0.002149472,0.00013439376,0.43736863,0.471709,0.015849328,0.066652775,0.000086391636],"about_ca_topic_score_codex":0.0003970836,"about_ca_topic_score_gemma":0.0009881783,"teacher_disagreement_score":0.003196349,"about_ca_system_score_codex":0.00025097563,"about_ca_system_score_gemma":0.0005207758,"threshold_uncertainty_score":0.010692894},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012124931183356386,"score_gpt":0.25848350127571584,"score_spread":0.24635857009235945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137786380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042617846,0.0011339559,0.94011724,0.00041252165,0.0002027284,0.000074861084,0.00007117821,0.0017535992,0.013616072],"genre_scores_gemma":[0.63634974,0.0005136288,0.35214263,0.00035984232,0.00007470686,0.00009528464,0.00008673763,0.000103462466,0.010274027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999624,0.000089303525,0.000022043252,0.00005795678,0.00015567357,0.000051019575],"domain_scores_gemma":[0.9994981,0.00021151683,0.000061792765,0.000077411605,0.00012343799,0.000027680828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048751337,0.00051284,0.0003263583,0.00063091866,0.00043324064,0.001152076,0.00095981825,0.00036704136,0.0045404527],"category_scores_gemma":[0.001723731,0.00021624178,0.00022808656,0.00059484947,0.0005994173,0.0013541211,0.00071761763,0.00086047826,0.0010943776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010117291,0.00025011235,0.0022954775,0.00045609113,0.000054314878,0.0004262909,0.0002985932,0.07389732,0.19964607,0.20749843,0.0108095845,0.5033559],"study_design_scores_gemma":[0.0001063381,0.00041704523,0.0004641877,0.000088296474,0.000035177723,0.00037431158,0.00006280037,0.775093,0.14677303,0.041530866,0.03498873,0.00006616646],"about_ca_topic_score_codex":0.00067814137,"about_ca_topic_score_gemma":0.0015760042,"teacher_disagreement_score":0.0045404527,"about_ca_system_score_codex":0.00095226115,"about_ca_system_score_gemma":0.0009042705,"threshold_uncertainty_score":0.01518929},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010933282171275475,"score_gpt":0.21186501680104272,"score_spread":0.20093173462976724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138924352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0430878,0.0009298816,0.9265613,0.0003129047,0.000082715706,0.00010065114,0.0005911533,0.0011559675,0.027177695],"genre_scores_gemma":[0.92337865,0.0009987034,0.03395658,0.00027021888,0.00007450462,0.00031688492,0.00057522685,0.00022568072,0.040203486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.000044786437,0.000010640999,0.00005513945,0.00012369199,0.000030767915],"domain_scores_gemma":[0.9997807,0.00008883807,0.000029810195,0.00003398177,0.00006088475,0.0000057287834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021080606,0.000685156,0.0003937182,0.00066297885,0.00025540547,0.00045771367,0.0010857229,0.00077163876,0.005381726],"category_scores_gemma":[0.0007577524,0.00032758774,0.00074980396,0.00048369737,0.00029019016,0.0007676354,0.00031592266,0.0005537094,0.0013130902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024214572,0.00001804902,0.00027936333,0.00004210654,0.000018360965,0.000070163005,0.000024381647,0.9715778,0.0059949714,0.0090348525,0.00069753005,0.0122181],"study_design_scores_gemma":[0.0000015403729,0.000014470347,0.000110243716,0.0000029987873,0.000004715641,0.000016784632,0.0000022485083,0.9976223,0.00064264523,0.0010241524,0.0005561101,0.0000018562272],"about_ca_topic_score_codex":0.0038753615,"about_ca_topic_score_gemma":0.0037975013,"teacher_disagreement_score":0.005381726,"about_ca_system_score_codex":0.0007189374,"about_ca_system_score_gemma":0.00041965127,"threshold_uncertainty_score":0.018003702},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01565170674294585,"score_gpt":0.28350205492381436,"score_spread":0.2678503481808685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163808675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059538,0.00040439775,0.37843817,0.00045301675,0.00040753276,0.00021256658,0.0001454058,0.004360718,0.009624361],"genre_scores_gemma":[0.96218973,0.000036024896,0.035385605,0.00004902082,0.000017717528,0.000023307293,0.000050699087,0.000030794952,0.0022172248],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944407,0.000100270605,0.0000727536,0.00011541659,0.00017823641,0.00008919809],"domain_scores_gemma":[0.9992817,0.00006313585,0.00010436239,0.00030754655,0.00021549288,0.000027792585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003253316,0.00036287485,0.00026356327,0.00053424,0.0003713405,0.0005373529,0.0011216587,0.00044783275,0.0022986913],"category_scores_gemma":[0.00082756125,0.00014450685,0.00024497678,0.00031997077,0.0003245797,0.00071663246,0.00042062232,0.0003787897,0.0005464658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015703519,0.00022405239,0.0039419876,0.00020654614,0.00012470632,0.00093346,0.0003062502,0.07056403,0.70032287,0.026508214,0.003175991,0.19212155],"study_design_scores_gemma":[0.00014667257,0.0010818293,0.0017848782,0.000030366704,0.00009840962,0.00081871735,0.000059742215,0.44694555,0.5312788,0.0039838874,0.013705204,0.000066006745],"about_ca_topic_score_codex":0.00062055216,"about_ca_topic_score_gemma":0.0008354831,"teacher_disagreement_score":0.0022986913,"about_ca_system_score_codex":0.00042634175,"about_ca_system_score_gemma":0.00050279347,"threshold_uncertainty_score":0.0076898336},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0061295776355333705,"score_gpt":0.1850439377866857,"score_spread":0.17891436015115234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168383044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024485169,0.0003232182,0.96556973,0.00011257711,0.00006298691,0.00013277,0.00005119901,0.0014658597,0.007796383],"genre_scores_gemma":[0.2951126,0.00033421212,0.6990665,0.00018872722,0.000037045647,0.00013045366,0.000113005735,0.00015443903,0.0048629614],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997634,0.000054784177,0.000025390707,0.000036300928,0.00008798319,0.000032131833],"domain_scores_gemma":[0.9997284,0.00007096778,0.000050335835,0.00007435133,0.000066165645,0.000009886385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047882687,0.00026859986,0.000116754236,0.00035535594,0.00015052334,0.000556276,0.00049065624,0.00022435049,0.0016180512],"category_scores_gemma":[0.00046275771,0.00020485312,0.00023812494,0.00022857117,0.0003576533,0.00051958807,0.00029186188,0.00035767202,0.00028779724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013195047,0.00008984546,0.00118768,0.00045788533,0.000046210123,0.0003270714,0.00030044751,0.0890169,0.2962253,0.2742684,0.0033849054,0.33456334],"study_design_scores_gemma":[0.00008263233,0.0006897546,0.0011319091,0.00010777812,0.00007308541,0.00061350793,0.000054160864,0.56611824,0.26713216,0.039909396,0.124036215,0.000050997518],"about_ca_topic_score_codex":0.00075700716,"about_ca_topic_score_gemma":0.0012737578,"teacher_disagreement_score":0.0016180512,"about_ca_system_score_codex":0.00044329662,"about_ca_system_score_gemma":0.0006261965,"threshold_uncertainty_score":0.005412936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01106865353179942,"score_gpt":0.2506989948505807,"score_spread":0.2396303413187813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416306598","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011687397,0.9863491,0.0074181366,0.0019901865,0.00025347134,0.00008317796,0.00028765787,0.00005960992,0.0023899232],"genre_scores_gemma":[0.00884216,0.98411554,0.0050477074,0.00096588145,0.00020264035,0.00009905454,0.00026473656,0.000021015963,0.00044131285],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9981668,0.00059382885,0.00041478456,0.0002553477,0.00051335053,0.00005586166],"domain_scores_gemma":[0.97689307,0.020166742,0.0010284835,0.00041026674,0.001379708,0.00012161976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004635305,0.0012146842,0.0016065263,0.004893013,0.00040406836,0.0019810344,0.0013277277,0.0013994543,0.004199964],"category_scores_gemma":[0.02008803,0.0007067837,0.001986419,0.004639529,0.0008336012,0.0026859997,0.0010413463,0.001293684,0.0008456704],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011439673,0.00008213351,0.001583152,0.13329268,0.00077980745,0.00017802819,0.00028127563,0.0055978685,0.00094669196,0.019230498,0.02059213,0.81732136],"study_design_scores_gemma":[0.000060951497,0.0005434885,0.0047463235,0.26088405,0.0047572153,0.0014252054,0.0006711712,0.007818473,0.0024632774,0.035211004,0.6812523,0.00016654561],"about_ca_topic_score_codex":0.0034613046,"about_ca_topic_score_gemma":0.006974874,"teacher_disagreement_score":0.004893013,"about_ca_system_score_codex":0.0011549988,"about_ca_system_score_gemma":0.0052415854,"threshold_uncertainty_score":0.024514139},"labels":[],"label_agreement":null}]}