{"meta":{"query_hash":"695272c38598","filters":{"venue":"ACM Transactions on Design Automation of Electronic Systems"},"cohort_total":62,"direct_labels_cover":0,"predictions_cover":62,"exported":62,"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/695272c38598","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Design+Automation+of+Electronic+Systems"},"results":[{"id":"W1965979241","doi":"10.1145/1278349.1278356","title":"MPSoC memory optimization using program transformation","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"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 Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; MPSoC; Parallel computing; Cache; Multiprocessing; Code (set theory); Computer architecture; System on a chip; Loop tiling; Embedded system; Compiler; Programming language","score_opus":0.029455890917239734,"score_gpt":0.2916100862890081,"score_spread":0.2621541953717684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965979241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046623734,0.000117691445,0.9961952,0.00008887233,0.00024148801,0.00087864185,0.0000011583043,0.0013773642,0.00063334656],"genre_scores_gemma":[0.5550622,0.000021350847,0.4447527,0.000018242854,0.000016956224,0.000040736486,0.0000053200743,0.000013330807,0.00006919074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978661,0.00022365639,0.0007317882,0.0003052448,0.00045318448,0.00042005093],"domain_scores_gemma":[0.9984667,0.00020654309,0.00036631545,0.00061928766,0.0002709503,0.00007024412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015372306,0.00019943409,0.00024289144,0.0007279046,0.00024143113,0.00011410866,0.0006335735,0.00016077598,0.000014988801],"category_scores_gemma":[0.000027472477,0.00020792942,0.00010582816,0.0012416206,0.000033685737,0.0007768817,0.000005115906,0.00018453244,0.000006875318],"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.000016725957,0.0001295789,7.0061566e-7,0.000026215024,0.000029214052,4.076788e-7,0.00033993725,0.897506,0.0003515362,0.0021211605,0.00001898457,0.09945955],"study_design_scores_gemma":[0.00035856417,0.00041283228,0.000015898888,0.000070770555,0.000019919782,0.000034446744,0.000048422124,0.982656,0.015797429,0.00027785802,0.00011284037,0.00019499678],"about_ca_topic_score_codex":0.000030164829,"about_ca_topic_score_gemma":0.0000016752432,"teacher_disagreement_score":0.55459595,"about_ca_system_score_codex":0.0003145744,"about_ca_system_score_gemma":0.00015564606,"threshold_uncertainty_score":0.8479116},"labels":[],"label_agreement":null},{"id":"W1966105387","doi":"10.1145/2566668","title":"Accelerating FPGA debug","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"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 British Columbia","funders":"","keywords":"Computer science; Debugging; Multiplexer; Field-programmable gate array; Embedded system; Computer hardware; Routing (electronic design automation); TRACE (psycholinguistics); Real-time computing; Multiplexing; Operating system","score_opus":0.020995923484247735,"score_gpt":0.2264472093870163,"score_spread":0.20545128590276857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966105387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034333488,0.00022975916,0.99274206,0.000026789137,0.00020726184,0.00045566654,0.0000027198707,0.001434782,0.00146764],"genre_scores_gemma":[0.98975044,0.0000584641,0.009742033,0.000015024976,0.00004838231,0.00018451703,0.000004031216,0.000045563105,0.00015153899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986462,0.00015468422,0.0004536854,0.00017523966,0.00023144769,0.00033873424],"domain_scores_gemma":[0.99901825,0.0002954968,0.00008708704,0.00048005546,0.000068147616,0.000050964773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484635,0.00019291928,0.000266442,0.00024878845,0.00009993382,0.000047188096,0.00028258693,0.00014293048,0.000059859733],"category_scores_gemma":[0.000036500016,0.00019697058,0.00008276147,0.00029492477,0.000019731833,0.00020871848,0.0000014568022,0.00021664423,0.00005419723],"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.00001963601,0.00009056008,0.000007089056,0.00028229726,0.00018697008,5.958716e-7,0.00033131352,0.7443129,0.08609031,0.0040312908,0.0014020696,0.163245],"study_design_scores_gemma":[0.00031532746,0.0003581395,0.00003569058,0.000119765224,0.00003427072,0.000019662153,0.00003770214,0.79323053,0.20316395,0.0012962312,0.0011346572,0.0002540848],"about_ca_topic_score_codex":0.000014825411,"about_ca_topic_score_gemma":0.000002791971,"teacher_disagreement_score":0.9863171,"about_ca_system_score_codex":0.00017485743,"about_ca_system_score_gemma":0.000035683,"threshold_uncertainty_score":0.8032227},"labels":[],"label_agreement":null},{"id":"W1971159340","doi":"10.1145/2534397","title":"Test compaction techniques for assertion-based test generation","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Software Testing and Debugging Techniques","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":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Assertion; Computer science; Compaction; Test (biology); Automatic test pattern generation; Path (computing); Scheme (mathematics); Reduction (mathematics); Test case; Cluster analysis; Algorithm; Programming language; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03796342581928601,"score_gpt":0.272911710833078,"score_spread":0.234948285013792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971159340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057971117,0.000049779374,0.9904862,0.00058991,0.00016866348,0.0016937844,0.000006129074,0.006390461,0.00003537821],"genre_scores_gemma":[0.72285396,0.000004381279,0.27568388,0.000064030086,0.00004198764,0.0012431471,0.000011861947,0.000018519404,0.00007826219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983096,0.00013797979,0.0005345448,0.0003653703,0.0003173595,0.0003351564],"domain_scores_gemma":[0.9955892,0.002706799,0.0003374765,0.00080731645,0.0004987252,0.000060512273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069752074,0.00020973934,0.00024802994,0.0004000572,0.00025739105,0.00020138806,0.00055477803,0.0001492658,0.000013147751],"category_scores_gemma":[0.0006094017,0.00020556267,0.000105671315,0.00051039096,0.000029930585,0.00059919996,0.0000034392008,0.00014908583,0.00002604867],"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.00004758293,0.0030457906,0.0007232117,0.00057633076,0.00019547793,0.0000011368234,0.00046463215,0.12697937,0.37474844,0.006651944,0.051841147,0.43472496],"study_design_scores_gemma":[0.00023555449,0.0011182461,0.00018024843,0.000099370314,0.00001652295,0.000011217505,0.000003818268,0.8384647,0.15549476,0.004050916,0.0001371024,0.00018753801],"about_ca_topic_score_codex":0.00016166198,"about_ca_topic_score_gemma":0.000004254512,"teacher_disagreement_score":0.72227424,"about_ca_system_score_codex":0.0003198873,"about_ca_system_score_gemma":0.00023928922,"threshold_uncertainty_score":0.83826023},"labels":[],"label_agreement":null},{"id":"W1972041243","doi":"10.1145/1230800.1230811","title":"The exact channel density and compound design for generic universal switch blocks","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","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":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"USB; Block (permutation group theory); USB hub; Computer science; eXtensible Host Controller Interface (xHCI); Routing (electronic design automation); Channel (broadcasting); Disjoint sets; Combinatorics; Discrete mathematics; Topology (electrical circuits); Physics; Mathematics; Embedded system; Computer network; Operating system; Software","score_opus":0.02187675245786297,"score_gpt":0.23029956350674152,"score_spread":0.20842281104887855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972041243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069911666,0.0010793017,0.9899744,0.000036584916,0.00019758695,0.001151235,0.0000038510807,0.0005087256,0.00005717385],"genre_scores_gemma":[0.9918937,0.00028280687,0.007513945,0.0000073839133,0.00003838283,0.00010424755,0.0000029151308,0.000036416157,0.00012017219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874496,0.00009747839,0.0003727251,0.00018346474,0.00018482207,0.00041651956],"domain_scores_gemma":[0.9983469,0.0010395009,0.000097453245,0.00034860577,0.0001059014,0.000061629886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012669833,0.00019573903,0.00023114536,0.00018854323,0.00029490684,0.00005030951,0.00022835996,0.00014746384,0.0000031592597],"category_scores_gemma":[0.000021861726,0.00017085281,0.00007055118,0.0002523321,0.000049277947,0.00013005671,0.0000021034732,0.00016758015,0.000002480306],"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.0007821337,0.00027040523,0.000012705916,0.0005171024,0.0012649469,0.00000935498,0.0016217993,0.6558017,0.20599525,0.0047437553,0.004279223,0.1247016],"study_design_scores_gemma":[0.0007187224,0.0007193556,0.000075059535,0.00007040144,0.00010361919,0.00008009152,0.00028161512,0.75966793,0.23522353,0.001839855,0.0009006619,0.0003191581],"about_ca_topic_score_codex":0.00002092336,"about_ca_topic_score_gemma":0.00001203631,"teacher_disagreement_score":0.98490256,"about_ca_system_score_codex":0.000265067,"about_ca_system_score_gemma":0.00006235671,"threshold_uncertainty_score":0.69671756},"labels":[],"label_agreement":null},{"id":"W1972225499","doi":"10.1145/1059876.1059877","title":"Scheduling and optimal register placement for synchronous circuits derived using software pipelining techniques","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","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":"Polytechnique Montréal; Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Computer science; Retiming; Clock skew; Software pipelining; Parallel computing; Scheduling (production processes); Electronic circuit; Timing failure; Shift register; Time complexity; Schedule; Register allocation; Algorithm; Clock signal; Software; Mathematical optimization; Mathematics; Compiler","score_opus":0.02407876059217706,"score_gpt":0.2515028027498793,"score_spread":0.22742404215770223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972225499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07543943,0.0009431454,0.9214248,0.00002368752,0.00016238225,0.0012294101,0.000008298657,0.0007515572,0.000017258826],"genre_scores_gemma":[0.80272925,0.000091523274,0.19671553,0.00001109926,0.00007102321,0.0002812665,0.0000054322163,0.000063459454,0.00003139985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983287,0.000066919616,0.00061067584,0.00028196268,0.00023402704,0.00047773615],"domain_scores_gemma":[0.99899787,0.00027403762,0.00015933423,0.00039078016,0.00011291781,0.00006505097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056430924,0.00027333302,0.00034698512,0.00035050765,0.00018834721,0.00006889709,0.00020381859,0.00017435662,0.000015221256],"category_scores_gemma":[0.000034452398,0.0002994721,0.00007618965,0.00021592763,0.0000373971,0.00046177025,0.0000033026497,0.00020093055,0.0000066857606],"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.00002633154,0.00003294761,0.0000035966223,0.0002687969,0.00011587369,3.035631e-7,0.00038820814,0.91655004,0.051946715,0.000031017415,0.000026429774,0.030609751],"study_design_scores_gemma":[0.00062053814,0.00032087843,0.000007494,0.0003373234,0.00008271226,0.00004474012,0.0001235157,0.8351381,0.1628086,0.000015923404,0.00022269093,0.00027750814],"about_ca_topic_score_codex":0.0000067884057,"about_ca_topic_score_gemma":0.000002358628,"teacher_disagreement_score":0.7272898,"about_ca_system_score_codex":0.0006530384,"about_ca_system_score_gemma":0.0001224005,"threshold_uncertainty_score":0.99994576},"labels":[],"label_agreement":null},{"id":"W1974526541","doi":"10.1145/944027.944034","title":"Testing high-performance pipelined circuits with slow-speed testers","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Pipeline (software); Static timing analysis; Clock skew; Electronic circuit; Computer hardware; Synchronous circuit; CMOS; Clock rate; Clock signal; CPU multiplier; Digital clock manager; Shift register; Clock gating; Embedded system; Electronic engineering; Electrical engineering; Chip; Jitter","score_opus":0.017369536304139815,"score_gpt":0.19856246203930938,"score_spread":0.18119292573516957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974526541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28798535,0.00021866363,0.7087972,0.000014597487,0.0004289593,0.00089947006,0.000005593432,0.00096889935,0.0006812325],"genre_scores_gemma":[0.9925004,0.000043302472,0.0068839793,0.0000145700715,0.000035462363,0.00015938346,0.0000063923417,0.00010936226,0.00024713474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997475,0.00016793954,0.0007365446,0.0003559112,0.0005319239,0.0007326242],"domain_scores_gemma":[0.9982031,0.00048620318,0.0001994229,0.0007863434,0.00021860372,0.0001063259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006810968,0.00041555424,0.00046047324,0.0004880017,0.00019062767,0.00006815532,0.0003843221,0.0001760262,0.000042690277],"category_scores_gemma":[0.000071909584,0.00039016022,0.000057004603,0.0012936766,0.00005763707,0.000610622,0.0000015583801,0.0003742442,0.00011686876],"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.000024123381,0.000071913615,0.00010016017,0.0002504283,0.00015250011,0.0000018763064,0.00017111252,0.951739,0.040500704,0.00018508706,0.00009618817,0.006706895],"study_design_scores_gemma":[0.0022671754,0.0014810702,0.0011662276,0.0006107746,0.00014978752,0.00017207081,0.0001247156,0.7697223,0.2231785,0.00006757245,0.00026595796,0.00079385174],"about_ca_topic_score_codex":0.000019075273,"about_ca_topic_score_gemma":0.0000023653013,"teacher_disagreement_score":0.70451504,"about_ca_system_score_codex":0.0005116914,"about_ca_system_score_gemma":0.00023672447,"threshold_uncertainty_score":0.99985504},"labels":[],"label_agreement":null},{"id":"W1981141412","doi":"10.1145/2633606","title":"Statistical Peak Temperature Prediction and Thermal Yield Improvement for 3D Chip Multiprocessors","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"3D IC and TSV technologies","field":"Engineering","cited_by":20,"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 Waterloo","funders":"Division of Computer and Network Systems; Intel Corporation","keywords":"Computer science; Chip; Thermal; Fabrication; Yield (engineering); Leakage power; Process (computing); Three-dimensional integrated circuit; Integrated circuit; Matching (statistics); Electronic circuit; Power (physics); Materials science; Optoelectronics; Electrical engineering; Power consumption; Composite material; Telecommunications","score_opus":0.010922103713004346,"score_gpt":0.2083514887250244,"score_spread":0.19742938501202006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981141412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03611911,0.0002655776,0.9620078,0.000064205866,0.00017580608,0.00067895406,0.000038504077,0.0005805708,0.000069439644],"genre_scores_gemma":[0.9888799,0.00006740604,0.010589761,0.000010501123,0.00003158692,0.00033625486,0.000011435905,0.000024249863,0.000048861115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.000031925247,0.00028753627,0.0001656632,0.00014346749,0.00023739068],"domain_scores_gemma":[0.9992052,0.00041598093,0.00005340572,0.00023102597,0.000064225016,0.000030183015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887296,0.00014611747,0.00018210254,0.0001204171,0.00009151443,0.000028056194,0.00011574295,0.00016088174,0.000008772087],"category_scores_gemma":[0.00011023119,0.0001328478,0.000030787316,0.000105701874,0.000033460306,0.00013014981,0.0000015508841,0.00016452101,0.0000028003046],"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.00016769057,0.0001742347,0.000019911437,0.001093133,0.00044654083,3.4152595e-7,0.0006017569,0.58007807,0.17241102,0.0083605265,0.0006118538,0.23603493],"study_design_scores_gemma":[0.0007507049,0.0011967474,0.0002997694,0.000108596076,0.000076477714,0.000009318198,0.00024878272,0.9471827,0.048888683,0.0005192403,0.0005350017,0.0001839864],"about_ca_topic_score_codex":0.000008600015,"about_ca_topic_score_gemma":0.0000022043039,"teacher_disagreement_score":0.9527608,"about_ca_system_score_codex":0.00008759316,"about_ca_system_score_gemma":0.000024576073,"threshold_uncertainty_score":0.5417376},"labels":[],"label_agreement":null},{"id":"W1983950263","doi":"10.1145/348019.348101","title":"Timing-driven routing for symmetrical array-based FPGAs","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":46,"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":"University of Toronto; National Science Council; University of Texas at Austin","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Router; Static routing; Multipath routing; Equal-cost multi-path routing; Link-state routing protocol; Placement; Dynamic Source Routing; Parallel computing; Computer network; Embedded system; Routing protocol; Physical design; Circuit design","score_opus":0.026798628100344363,"score_gpt":0.24811098958298666,"score_spread":0.2213123614826423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983950263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024566674,0.00017796767,0.99448884,0.00004709656,0.000115870425,0.0010197684,0.00001593124,0.0011804389,0.00049740606],"genre_scores_gemma":[0.97226936,0.00003840262,0.02690162,0.00001693652,0.000043533473,0.00045832986,0.000012932871,0.000056492685,0.0002024262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985086,0.00009666873,0.0005112887,0.000218996,0.00023961114,0.0004248401],"domain_scores_gemma":[0.9988631,0.0005071472,0.000078810364,0.00041425123,0.00007551805,0.00006117994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040246974,0.00021593059,0.00031491398,0.00035694652,0.00011974143,0.000040893618,0.00027681122,0.00017981656,0.00012084075],"category_scores_gemma":[0.000031245294,0.00022715729,0.00015603022,0.0004977072,0.00002280448,0.00014536828,4.6877116e-7,0.000193145,0.000040501996],"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.00004282939,0.00008265226,0.0000023760495,0.00014306442,0.00009067004,4.0461842e-7,0.00008985311,0.9320243,0.016103446,0.00032646832,0.00047265735,0.05062126],"study_design_scores_gemma":[0.00054677477,0.0004898149,0.000011572024,0.00012827906,0.00006119904,0.000009448078,0.000019723715,0.87752736,0.11952486,0.00028957485,0.001157742,0.00023365217],"about_ca_topic_score_codex":0.000012159581,"about_ca_topic_score_gemma":0.0000012016832,"teacher_disagreement_score":0.96981263,"about_ca_system_score_codex":0.00030883757,"about_ca_system_score_gemma":0.000078283236,"threshold_uncertainty_score":0.92632055},"labels":[],"label_agreement":null},{"id":"W1999343232","doi":"10.1145/1027084.1027090","title":"Segmented channel routability via satisfiability","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","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":"University of Waterloo; Université de Montréal","funders":"","keywords":"Routing (electronic design automation); Computer science; Channel (broadcasting); Field-programmable gate array; Satisfiability; Constraint (computer-aided design); Boolean satisfiability problem; Algorithm; Electronic design automation; Network routing; Parallel computing; Embedded system; Mathematics; Computer network","score_opus":0.013728378803189613,"score_gpt":0.22085256443908233,"score_spread":0.20712418563589272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999343232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015693953,0.00025031753,0.98109514,0.00005167388,0.00021724912,0.0010619827,0.000014491496,0.0014721825,0.00014298531],"genre_scores_gemma":[0.9943501,0.000051670304,0.0051859645,0.000008805564,0.000021483638,0.0003110746,0.0000080508735,0.000038340222,0.000024543862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983281,0.00014848898,0.00058415293,0.00025868518,0.00029298794,0.00038756948],"domain_scores_gemma":[0.99888015,0.00015836388,0.00009378704,0.00070194755,0.00009648148,0.00006929478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064984156,0.00023898718,0.00033176012,0.00021676459,0.000093065944,0.000025796757,0.00026879174,0.00018107399,0.00005059176],"category_scores_gemma":[0.00002881829,0.0002470028,0.00011988706,0.00041983777,0.00004659118,0.00024357483,0.0000020136972,0.00025308126,0.00003863248],"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.000031194166,0.00021249997,0.0000089370105,0.00025296237,0.00014807274,7.2500745e-7,0.0003841136,0.945714,0.039796967,0.0004859198,0.000048760074,0.012915876],"study_design_scores_gemma":[0.0016081599,0.0011886216,0.00063794124,0.000258016,0.00011231682,0.00005820886,0.00015017271,0.47451806,0.50000364,0.020640722,0.00011902516,0.00070513535],"about_ca_topic_score_codex":0.00009702417,"about_ca_topic_score_gemma":0.000012972047,"teacher_disagreement_score":0.9786561,"about_ca_system_score_codex":0.0007958916,"about_ca_system_score_gemma":0.00008749927,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2026122999","doi":"10.1145/1640457.1640466","title":"ACM Transactions on Design Automation of Electronic Systems (TODAES) special section call for papers","year":2009,"lang":"en","type":"paratext","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"Science North","funders":"","keywords":"Computer science; Section (typography); Special section; Automation; Electronic design automation; Software engineering; Operating system; Embedded system","score_opus":0.017302721502173345,"score_gpt":0.2342947791502734,"score_spread":0.21699205764810006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026122999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016778833,0.0014413318,0.9859291,0.00006317493,0.005095782,0.004892306,0.00021770147,0.00067991635,0.0015129446],"genre_scores_gemma":[0.9592405,0.0042105713,0.009564403,0.0000323033,0.0022034345,0.003426643,0.00076139544,0.00052234094,0.020038417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446946,0.00051854056,0.002018658,0.00086471165,0.00096796046,0.0011606688],"domain_scores_gemma":[0.9961,0.0008998402,0.0010648322,0.0013307213,0.00044954644,0.00015507208],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010879706,0.0010328557,0.0014322076,0.0014598216,0.00040659885,0.00017589435,0.0008887283,0.0013121829,0.00050823065],"category_scores_gemma":[0.00006964861,0.0011221478,0.0005346385,0.00087003846,0.000063883475,0.00047180578,0.000002648471,0.0010890949,0.00017143287],"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.00034120367,0.00023442484,4.6434643e-8,0.0019737596,0.0006510229,4.0846672e-7,0.00029551267,0.9740915,0.0017265019,0.00014872714,0.0068865926,0.01365032],"study_design_scores_gemma":[0.0024948847,0.003521501,0.000010170617,0.0018015284,0.0008319339,0.00005106584,0.00015716942,0.9250806,0.04516179,0.00029651902,0.01916577,0.0014270588],"about_ca_topic_score_codex":0.00008743911,"about_ca_topic_score_gemma":0.000030330131,"teacher_disagreement_score":0.9763647,"about_ca_system_score_codex":0.0023865164,"about_ca_system_score_gemma":0.000672565,"threshold_uncertainty_score":0.9999843},"labels":[],"label_agreement":null},{"id":"W2039730318","doi":"10.1145/2003695.2003710","title":"Analog layout retargeting using geometric programming","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Computer science; Geometric programming; Initialization; Retargeting; Transformation (genetics); Mathematical optimization; Convex optimization; Netlist; Nonlinear programming; Computer engineering; Algorithm; Nonlinear system; Regular polygon; Artificial intelligence; Computer hardware; Mathematics","score_opus":0.0525912628983535,"score_gpt":0.2403003780804701,"score_spread":0.1877091151821166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039730318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013042983,0.0008116668,0.9837035,0.000002584482,0.00018121194,0.0006522966,0.0000037375867,0.0011720271,0.00042998334],"genre_scores_gemma":[0.949946,0.000056670382,0.049773112,0.000003495495,0.00002510532,0.000103116974,0.0000035765968,0.00005067924,0.00003824089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840945,0.00012547986,0.00054713094,0.0002075058,0.00025749893,0.000452958],"domain_scores_gemma":[0.9991407,0.00012720171,0.00014166966,0.00043388992,0.000096826334,0.000059739155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065697654,0.00021654078,0.00030137348,0.00078353623,0.000109713976,0.00003167572,0.00028570506,0.00016660948,0.00006596727],"category_scores_gemma":[0.00003359909,0.00022648119,0.0001090024,0.001080712,0.000027701568,0.00025110922,0.0000021782314,0.00024743206,0.000018515208],"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.00008921194,0.00043959825,0.00021129381,0.0009652696,0.0009627054,0.0000130327135,0.0024649922,0.646629,0.07728231,0.0013146116,0.0002497117,0.26937827],"study_design_scores_gemma":[0.0003945071,0.0005873898,0.00014389247,0.000245817,0.00014517404,0.00007517545,0.00022554593,0.8299023,0.16699839,0.0005232634,0.0002725584,0.0004860153],"about_ca_topic_score_codex":0.00008561785,"about_ca_topic_score_gemma":0.0000023149503,"teacher_disagreement_score":0.936903,"about_ca_system_score_codex":0.00028733024,"about_ca_system_score_gemma":0.000055233577,"threshold_uncertainty_score":0.9235635},"labels":[],"label_agreement":null},{"id":"W2043270555","doi":"10.1145/2535575","title":"Cost-effective lifetime and yield optimization for NoC-based MPSoCs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":19,"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":"Semiconductor Research Corporation","keywords":"Computer science; Yield (engineering); Multi-objective optimization; Pareto principle; Component (thermodynamics); Mathematical optimization; Reliability engineering; Mathematics","score_opus":0.015223597225510024,"score_gpt":0.2358766055533257,"score_spread":0.22065300832781568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043270555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021803621,0.00034119218,0.99300486,0.00007682994,0.00029425396,0.003515661,0.000014203732,0.00049157353,0.00008109423],"genre_scores_gemma":[0.9815683,0.000038141152,0.016062248,0.000030792635,0.000050391885,0.002125929,0.000019575447,0.00006479848,0.00003986105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985586,0.00019990225,0.0003989868,0.0002442429,0.00021175841,0.00038655853],"domain_scores_gemma":[0.99709624,0.0021891415,0.00013592235,0.00038886425,0.00012439786,0.00006545231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007577754,0.00023085097,0.00031126986,0.000299082,0.00012733006,0.000045715817,0.00017375441,0.00019127237,0.000022689455],"category_scores_gemma":[0.00021883949,0.00025353633,0.000082105034,0.0003107428,0.00003359348,0.00019107539,0.0000010863764,0.00018956755,0.000008149883],"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.000042992535,0.00003710167,0.0000014483877,0.00018938935,0.000092973634,3.7883282e-8,0.00006314992,0.96877813,0.0012814208,0.0005798674,0.00012695597,0.028806547],"study_design_scores_gemma":[0.00091050036,0.0007951501,0.00002659092,0.00009167124,0.00007776502,0.0000049825726,0.000012727355,0.97900164,0.017988024,0.00019422274,0.0006764905,0.00022022739],"about_ca_topic_score_codex":0.000009289828,"about_ca_topic_score_gemma":0.0000049417267,"teacher_disagreement_score":0.9793879,"about_ca_system_score_codex":0.00040034455,"about_ca_system_score_gemma":0.00007891405,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W2056291785","doi":"10.1145/1698759.1698763","title":"Hardware/software partitioning and pipelined scheduling on runtime reconfigurable FPGAs","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Computer science; Field-programmable gate array; Parallel computing; Scheduling (production processes); Reconfigurable computing; Scalability; Reconfigurability; Schedule; Embedded system; Operating system","score_opus":0.019955032699104633,"score_gpt":0.2521383259182732,"score_spread":0.23218329321916853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056291785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008620093,0.00015113542,0.9880104,0.00027635967,0.00050691684,0.0009427776,0.0000051041443,0.0011636411,0.00032354862],"genre_scores_gemma":[0.86981803,0.000026777845,0.12935422,0.000047112022,0.000048788956,0.0002748632,0.0000038102717,0.000031313873,0.0003950888],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730307,0.00037724953,0.0007572611,0.0005819271,0.00048448922,0.00049603067],"domain_scores_gemma":[0.9971448,0.0008159468,0.0004172455,0.0012385733,0.00026768658,0.000115751885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016130928,0.00029181427,0.0004129118,0.00049327756,0.00033121428,0.00024656934,0.00079979363,0.00024878865,0.00004448912],"category_scores_gemma":[0.0002517193,0.0002952785,0.00010240471,0.00054762204,0.000057658483,0.00072695204,0.000007512509,0.0005729539,0.00007810504],"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.00023381342,0.0009961423,0.00011301233,0.0008400662,0.00063075253,0.000019473962,0.002880282,0.21816188,0.47102422,0.16187531,0.0019729172,0.14125215],"study_design_scores_gemma":[0.0009784262,0.0013739424,0.00009469358,0.00071318314,0.0000521919,0.00020529004,0.00008776656,0.580786,0.40482396,0.009237613,0.0009800249,0.0006668983],"about_ca_topic_score_codex":0.00007604512,"about_ca_topic_score_gemma":0.000014158229,"teacher_disagreement_score":0.86119795,"about_ca_system_score_codex":0.00015547722,"about_ca_system_score_gemma":0.00023930547,"threshold_uncertainty_score":0.99994993},"labels":[],"label_agreement":null},{"id":"W2056928920","doi":"10.1145/605440.605443","title":"Reduction design for generic universal switch blocks","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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 Lethbridge; University of Victoria","funders":"","keywords":"Computer science; Routing (electronic design automation); Scalability; Field-programmable gate array; Reduction (mathematics); Block (permutation group theory); Parallel computing; Embedded system; Mathematics","score_opus":0.0452735509172989,"score_gpt":0.23657897590068347,"score_spread":0.19130542498338457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056928920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004987821,0.0005226181,0.99534947,0.000342806,0.00145851,0.0012844634,0.0000028332563,0.00037899066,0.0001615284],"genre_scores_gemma":[0.9656523,0.00007027966,0.031336896,0.000020375968,0.00013409281,0.00032474365,0.0000021063408,0.000024799867,0.0024344418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976938,0.00040353922,0.0006225831,0.0004625366,0.00034876808,0.00046881827],"domain_scores_gemma":[0.99806786,0.0004129671,0.0003526764,0.0008049448,0.0002853094,0.000076225035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000877629,0.0002313619,0.00032776294,0.00040457715,0.00030408273,0.00012021515,0.00070858287,0.00017955274,0.000062025494],"category_scores_gemma":[0.000029489387,0.0002317149,0.00017444839,0.00073659455,0.000029422672,0.0005303275,0.0000048346988,0.0001768609,0.000042983254],"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.000074196476,0.00027468905,6.0298885e-7,0.00007015243,0.0002433152,0.0000012848363,0.0010502964,0.9280814,0.007574474,0.014112538,0.007999592,0.040517453],"study_design_scores_gemma":[0.0007056863,0.0010418363,0.0000019705665,0.000072394636,0.00003518563,0.00013505858,0.00012994089,0.98417777,0.010658066,0.00080535654,0.002002471,0.00023425666],"about_ca_topic_score_codex":0.00003673614,"about_ca_topic_score_gemma":0.0000020297039,"teacher_disagreement_score":0.96515346,"about_ca_system_score_codex":0.00041590576,"about_ca_system_score_gemma":0.000099921,"threshold_uncertainty_score":0.944906},"labels":[],"label_agreement":null},{"id":"W2061217021","doi":"10.1145/605440.605449","title":"A search-based bump-and-refit approach to incremental routing for ECO applications in FPGAs","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Netlist; Computer science; Routing (electronic design automation); Place and route; Process (computing); Field-programmable gate array; Physical design; Context (archaeology); Placement; Multipath routing; Parallel computing; Distributed computing; Static routing; Embedded system; Circuit design; Routing protocol","score_opus":0.023691181648590673,"score_gpt":0.238357428117454,"score_spread":0.21466624646886334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061217021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026097389,0.0003672889,0.9701787,0.000063747495,0.00006650342,0.0027123326,0.000017757311,0.00029103554,0.00020522227],"genre_scores_gemma":[0.98671556,0.000020158686,0.011025609,0.000017470345,0.000024867883,0.0020697704,0.000017295464,0.000053497628,0.000055780365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983575,0.0001270411,0.0004888538,0.0002835819,0.0002470361,0.000496021],"domain_scores_gemma":[0.9988715,0.0005259259,0.00007041146,0.00039803406,0.000055952616,0.000078197176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063732115,0.00020851655,0.00027753843,0.00052819884,0.00012330592,0.00004219698,0.00024742854,0.00012273087,0.000012469853],"category_scores_gemma":[0.000035393532,0.00023602493,0.0000687139,0.00065999746,0.00002075571,0.00014723025,0.00000209475,0.0002292355,0.000015706724],"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.000012070596,0.00012030541,0.000008248152,0.00016387975,0.00005029882,4.3711278e-8,0.00028201728,0.9902824,0.0019444068,0.0016577492,0.00004913895,0.0054294015],"study_design_scores_gemma":[0.0007609986,0.0002682915,0.0000545215,0.000050224953,0.000027036664,0.000004921995,0.00009905821,0.9896532,0.0085255625,0.000084090934,0.0002730136,0.00019907752],"about_ca_topic_score_codex":0.00003331892,"about_ca_topic_score_gemma":0.000015535294,"teacher_disagreement_score":0.96061814,"about_ca_system_score_codex":0.0008322601,"about_ca_system_score_gemma":0.000053258576,"threshold_uncertainty_score":0.96248174},"labels":[],"label_agreement":null},{"id":"W2061895663","doi":"10.1145/2566669","title":"A comparative evaluation of multi-objective exploration algorithms for high-level design","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":16,"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; Benchmark (surveying); Scalability; Algorithm; Set (abstract data type); Heuristic; Evolutionary algorithm; Transformation (genetics); Computer engineering; Machine learning; Artificial intelligence","score_opus":0.15764757757916154,"score_gpt":0.3476167720200399,"score_spread":0.18996919444087834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061895663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013694004,0.00012070927,0.994769,0.00008536281,0.00045915236,0.004152516,0.00002809563,0.00022555342,0.000022720686],"genre_scores_gemma":[0.5152164,0.000010896496,0.48354682,0.000008898801,0.000021192589,0.0011031687,0.000014647839,0.000019591209,0.000058368118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953926,0.0016633933,0.00094288803,0.0006439728,0.00094324327,0.00041391078],"domain_scores_gemma":[0.99384177,0.0017295236,0.000972324,0.0008973261,0.002482691,0.000076383556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033168863,0.00033542706,0.0006225714,0.00061613903,0.00024559035,0.00006391557,0.0007034468,0.00017090517,0.000010924048],"category_scores_gemma":[0.00045447392,0.00034427206,0.00013503371,0.0009922796,0.000083580075,0.0013725574,0.000010028027,0.00017971238,0.000014413415],"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.00007466527,0.00032879968,3.467599e-7,0.000033740256,0.0001504441,4.89088e-8,0.0015065097,0.9470512,0.003805498,0.0053806636,0.000020764075,0.041647315],"study_design_scores_gemma":[0.003019705,0.001221059,0.000066404515,0.00008173463,0.0001012015,0.0000056552335,0.00026411755,0.88027453,0.10834218,0.006342471,0.000011986107,0.0002689584],"about_ca_topic_score_codex":0.000040173025,"about_ca_topic_score_gemma":0.000009559769,"teacher_disagreement_score":0.5150795,"about_ca_system_score_codex":0.0006884316,"about_ca_system_score_gemma":0.0005378428,"threshold_uncertainty_score":0.99990094},"labels":[],"label_agreement":null},{"id":"W2063008354","doi":"10.1145/2651400","title":"Efficient Coverage-Driven Stimulus Generation Using Simultaneous SAT Solving, with Application to SystemVerilog","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","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 British Columbia","funders":"National Science Council","keywords":"Computer science; Universal asynchronous receiver/transmitter; Exploit; Boolean satisfiability problem; Complement (music); Benchmark (surveying); Algorithm; Speedup; Theoretical computer science; Parallel computing","score_opus":0.02351480804271863,"score_gpt":0.27003769997788096,"score_spread":0.24652289193516233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063008354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024394447,0.000042540785,0.97306246,0.000055563225,0.0003340463,0.0017174631,0.000003921895,0.00034743297,0.00004210004],"genre_scores_gemma":[0.6993201,0.0000021458266,0.30036458,0.000029436427,0.00004352315,0.00018209184,0.0000047924623,0.000021377646,0.000031964784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705833,0.0006645227,0.0006525982,0.00057062006,0.0006371341,0.00041680905],"domain_scores_gemma":[0.9973079,0.0004610396,0.00047076738,0.0012961706,0.00035682617,0.00010729226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011877189,0.00025970206,0.00034276108,0.00039533197,0.00029425445,0.0001420593,0.0007596185,0.00013418199,0.0000042012425],"category_scores_gemma":[0.00016158578,0.00024497818,0.000063969055,0.00086950196,0.00003315449,0.000256676,0.000011349212,0.00016795348,0.00006171226],"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.000035758356,0.000083652456,0.000002813971,0.0000602912,0.000034910932,3.2044386e-7,0.00030758494,0.93645614,0.040944535,0.0063293595,0.000006288506,0.015738318],"study_design_scores_gemma":[0.00041173128,0.0008617337,0.000021838869,0.0001086428,0.000038102382,0.00005028488,0.000023296796,0.9790823,0.01895695,0.000071356335,0.00012079753,0.00025299776],"about_ca_topic_score_codex":0.00006878715,"about_ca_topic_score_gemma":0.000009060972,"teacher_disagreement_score":0.6749256,"about_ca_system_score_codex":0.0007466807,"about_ca_system_score_gemma":0.00019479336,"threshold_uncertainty_score":0.99899197},"labels":[],"label_agreement":null},{"id":"W2065518690","doi":"10.1145/1109118.1109123","title":"Simplifying the design and automating the verification of pipelines with structural hazards","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Waterloo","funders":"","keywords":"Computer science; Datapath; Correctness; Pipeline (software); Microprocessor; Pipeline transport; Computer architecture; Formal verification; Embedded system; Programming language","score_opus":0.03096008423381525,"score_gpt":0.2810010768775404,"score_spread":0.25004099264372515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065518690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011774677,0.00032534223,0.9860481,0.0006265769,0.000102155056,0.0009477803,0.000001346757,0.00015281941,0.000021228028],"genre_scores_gemma":[0.6691791,0.000020466861,0.3306343,0.000018480374,0.000019668696,0.00009880343,6.144035e-7,0.000009149237,0.000019451998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977309,0.0007824074,0.00056187913,0.00025351535,0.00042453283,0.00024673765],"domain_scores_gemma":[0.99731153,0.00097166107,0.0005335356,0.0009401875,0.00021514474,0.000027958002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021450594,0.00016586253,0.00020278823,0.00013726173,0.0003533025,0.00010019167,0.0008398349,0.000071128314,0.0000038799026],"category_scores_gemma":[0.00012237049,0.000098201555,0.000043994794,0.0005842582,0.000120746634,0.0006010001,0.000008255011,0.00019329741,0.0000031407558],"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.00005412623,0.00003314794,0.00000860025,0.000075711505,0.00008402428,8.427624e-8,0.002330724,0.7557992,0.009966333,0.030033981,0.000024379578,0.20158973],"study_design_scores_gemma":[0.00024774778,0.00027237908,0.0005551413,0.00006646011,0.000032430307,0.00005488332,0.00019108923,0.956721,0.040978182,0.00070058624,0.00007343675,0.00010664859],"about_ca_topic_score_codex":0.000027432388,"about_ca_topic_score_gemma":0.0000030551935,"teacher_disagreement_score":0.65740436,"about_ca_system_score_codex":0.00012273015,"about_ca_system_score_gemma":0.00018651779,"threshold_uncertainty_score":0.4004543},"labels":[],"label_agreement":null},{"id":"W2079078065","doi":"10.1145/785411.785413","title":"Gravity","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Electronic circuit; Algorithm; Iterative method; Computer engineering; Time complexity; Electrical engineering","score_opus":0.015426394018364126,"score_gpt":0.2255704286877004,"score_spread":0.21014403466933626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079078065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002689606,0.00048636587,0.99377424,0.000010194404,0.00021657175,0.00046631962,0.000004433995,0.00093967153,0.0014125722],"genre_scores_gemma":[0.99350643,0.00010843625,0.005971024,0.0000062542863,0.000010567313,0.00014891704,0.0000021491796,0.00003198677,0.00021422628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988742,0.00015693228,0.0003413359,0.00014221085,0.00019747586,0.00028788345],"domain_scores_gemma":[0.9992534,0.0001507765,0.000057585563,0.00043878812,0.00005433093,0.000045116794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044571562,0.00015989906,0.00021615879,0.0002157078,0.00006510258,0.000022356495,0.00018039184,0.00012464085,0.00007548283],"category_scores_gemma":[0.000025674988,0.0001649161,0.00007880183,0.0003234461,0.00002066246,0.00014009773,4.7414224e-7,0.00018052918,0.000051805622],"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.000034614506,0.0003136939,0.000022091064,0.0004461633,0.000454679,0.0000032963558,0.0004747078,0.7823825,0.13467798,0.035855886,0.0032011159,0.042133268],"study_design_scores_gemma":[0.0008583309,0.00077478215,0.00008384243,0.00017732293,0.00010250298,0.00009812932,0.00013141429,0.20160297,0.7769831,0.011682808,0.006841012,0.0006638199],"about_ca_topic_score_codex":0.000008585549,"about_ca_topic_score_gemma":0.0000015512329,"teacher_disagreement_score":0.99081683,"about_ca_system_score_codex":0.00018923379,"about_ca_system_score_gemma":0.00005182712,"threshold_uncertainty_score":0.6725083},"labels":[],"label_agreement":null},{"id":"W2086633088","doi":"10.1145/1497561.1497572","title":"Battery voltage modeling for portable systems","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Battery Technologies Research","field":"Engineering","cited_by":41,"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":"Battery (electricity); Computer science; Voltage; Automotive engineering; State of charge; Electrical engineering; Simulation; Power (physics); Engineering","score_opus":0.03160563532945789,"score_gpt":0.269428785904522,"score_spread":0.23782315057506412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086633088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004149179,0.0009383251,0.9918415,0.00006380468,0.00025538824,0.0013736698,0.00001975299,0.0012154061,0.00014300633],"genre_scores_gemma":[0.9947843,0.00012730272,0.004219236,0.000009520615,0.000034791832,0.0004556685,0.000012055026,0.00004614287,0.000311015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982004,0.00004609972,0.00058026117,0.00025825834,0.00031347745,0.0006014665],"domain_scores_gemma":[0.9987794,0.00026219536,0.00008778391,0.0006842348,0.00013712492,0.000049236754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044170965,0.00022487776,0.00035234884,0.00043681552,0.00011596372,0.000054863383,0.00042933287,0.00018976288,0.000013803433],"category_scores_gemma":[0.000050716008,0.00023526204,0.00009323261,0.00039898552,0.000019069288,0.0003315161,0.0000019458637,0.00027546118,0.000020613295],"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.00002274105,0.00003706535,5.8050585e-7,0.00015820176,0.00006445621,6.213208e-7,0.000025540823,0.96969473,0.020611076,0.00083854864,0.0002623237,0.008284132],"study_design_scores_gemma":[0.0004004851,0.00040550274,0.0000030772296,0.00012716744,0.000022198754,0.000017887223,0.00013516849,0.9824951,0.014353725,0.0014960642,0.00033536676,0.00020821158],"about_ca_topic_score_codex":0.000009252711,"about_ca_topic_score_gemma":8.931949e-7,"teacher_disagreement_score":0.9906351,"about_ca_system_score_codex":0.00045236293,"about_ca_system_score_gemma":0.000063339234,"threshold_uncertainty_score":0.95937073},"labels":[],"label_agreement":null},{"id":"W2088808707","doi":"10.1145/502175.502180","title":"Optimal design of synchronous circuits using software pipelining techniques","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"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; Université de Montréal","funders":"","keywords":"Retiming; Computer science; Software pipelining; Parallel computing; Combinational logic; Clock skew; Electronic circuit; Scheduling (production processes); Algorithm; Software; Clock signal; Logic gate; Mathematical optimization; Mathematics","score_opus":0.03766661338923844,"score_gpt":0.2763364236044197,"score_spread":0.23866981021518124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088808707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096777093,0.00034758303,0.9965647,0.00003057488,0.00012298662,0.0007538057,0.0000017935131,0.0011639526,0.000046850175],"genre_scores_gemma":[0.52415097,0.00007256472,0.47565666,0.0000099813,0.000013939952,0.000041741398,0.0000011548253,0.000015891817,0.000037080805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975162,0.0004665284,0.0007954118,0.00039148162,0.000421168,0.00040919168],"domain_scores_gemma":[0.9976561,0.0005397318,0.00056215463,0.0008412472,0.00034063263,0.00006010728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011407505,0.00023613931,0.00040774434,0.00056914205,0.0002054305,0.000072074814,0.0009612057,0.00017378794,0.000011814652],"category_scores_gemma":[0.00009872107,0.00025078352,0.00011104234,0.00091145985,0.000055552635,0.00046601729,0.000013622068,0.00020723199,0.0000051700204],"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.000014439397,0.00011307148,0.0000064987667,0.00003959696,0.00005005916,0.0000017449269,0.0002349486,0.96048087,0.004345665,0.00046390333,0.000038166756,0.034211036],"study_design_scores_gemma":[0.00023071187,0.0006375705,0.000008647316,0.00026284772,0.00002687893,0.0001193,0.00002433201,0.937924,0.060052674,0.00045327123,0.000037786394,0.00022193178],"about_ca_topic_score_codex":0.00004388825,"about_ca_topic_score_gemma":3.278344e-7,"teacher_disagreement_score":0.5231832,"about_ca_system_score_codex":0.00027486862,"about_ca_system_score_gemma":0.00040083323,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W2095558812","doi":"10.1145/1059876.1059881","title":"A detailed power model for field-programmable gate arrays","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":167,"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 British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; Logic block; CAD; Reconfigurable computing; Embedded system; Power (physics); Block (permutation group theory); Dynamic demand; Power optimization; Dissipation; Power analysis; Field (mathematics); Design space exploration; Power domains; Computer architecture; Power consumption; Engineering; Algorithm","score_opus":0.016392559768647383,"score_gpt":0.23061199951683578,"score_spread":0.2142194397481884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095558812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010552882,0.0003996774,0.98615867,0.00011400691,0.00027693747,0.0014160916,0.00001090595,0.0008014767,0.0002693757],"genre_scores_gemma":[0.96342474,0.00007476804,0.034893278,0.000029466051,0.000043786495,0.000850172,0.000007002413,0.00007220335,0.0006045854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998183,0.00005525607,0.0006041988,0.00025882196,0.00028363065,0.0006150808],"domain_scores_gemma":[0.9987988,0.0002699144,0.00011508991,0.00061290397,0.00012390323,0.00007941531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004874851,0.00027868414,0.0003527695,0.000305709,0.00012699314,0.00005487249,0.00035345732,0.00019661854,0.000069807116],"category_scores_gemma":[0.000025370859,0.00028445583,0.0001557791,0.00034154183,0.000018987363,0.00045227667,0.00000175208,0.00022561723,0.000085723914],"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.000061490515,0.00006749738,0.0000012963579,0.00011523164,0.00014063677,1.6890422e-7,0.00032095658,0.9823738,0.008816274,0.0004885286,0.00072546344,0.0068886927],"study_design_scores_gemma":[0.0009082983,0.000412151,0.0000032886423,0.000072808325,0.000060332724,0.000009589502,0.00004001749,0.9421146,0.054797262,0.0002919674,0.001021129,0.0002685916],"about_ca_topic_score_codex":0.000004338355,"about_ca_topic_score_gemma":0.000016268295,"teacher_disagreement_score":0.95287186,"about_ca_system_score_codex":0.0003735756,"about_ca_system_score_gemma":0.00012030346,"threshold_uncertainty_score":0.9999608},"labels":[],"label_agreement":null},{"id":"W2105167627","doi":"10.1145/1297666.1297670","title":"Automata-based assertion-checker synthesis of PSL properties","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":94,"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; Computer science; Programming language; Automaton; Debugging; Modular design; Operator (biology); Emulation; Set (abstract data type); Theoretical computer science; Büchi automaton; Deterministic automaton","score_opus":0.06655507728057433,"score_gpt":0.2663195237633659,"score_spread":0.19976444648279154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105167627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014963701,0.00016394397,0.9832833,0.00013614638,0.0002542188,0.0006619225,0.0000037520263,0.0004042228,0.0001288159],"genre_scores_gemma":[0.755522,0.000028208846,0.2440411,0.000013286524,0.000009294362,0.00027787976,0.0000011454824,0.000015686983,0.00009137563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720895,0.00065662013,0.0008199369,0.00034472567,0.00063691585,0.00033284427],"domain_scores_gemma":[0.99738765,0.0004104616,0.0005206737,0.0013017845,0.00032385197,0.000055594483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201593,0.000208965,0.00037982676,0.00045043416,0.00019858572,0.00003170403,0.0009871849,0.0001463973,0.000017782811],"category_scores_gemma":[0.00029086767,0.00019210714,0.00014213924,0.00080988737,0.00011078705,0.0006706444,0.000006102125,0.00016808348,0.00003931637],"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.00038142785,0.0020428475,0.000092067,0.0011434591,0.00053279754,0.0000044331314,0.0022233082,0.74520206,0.1290819,0.049453087,0.0003867944,0.06945579],"study_design_scores_gemma":[0.0002383792,0.00029362476,0.00038292562,0.0001255369,0.000021711212,0.000027135406,0.00002539135,0.5953087,0.40324703,0.00013614634,0.000057847257,0.00013557557],"about_ca_topic_score_codex":0.00005735584,"about_ca_topic_score_gemma":0.0000011728283,"teacher_disagreement_score":0.7405583,"about_ca_system_score_codex":0.00024896482,"about_ca_system_score_gemma":0.000509897,"threshold_uncertainty_score":0.78339016},"labels":[],"label_agreement":null},{"id":"W2116385615","doi":"10.1145/1278349.1278355","title":"Techniques for the synthesis of reversible Toffoli networks","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":188,"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; University of New Brunswick; University of Waterloo","funders":"","keywords":"Computer science; Toffoli gate; Template; Benchmark (surveying); Realization (probability); Algorithm; Complement (music); Sequence (biology); High-level synthesis; Field-programmable gate array; Quantum gate; Computer hardware; Programming language; Mathematics","score_opus":0.015136136277127111,"score_gpt":0.2484756168493447,"score_spread":0.23333948057221757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116385615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035502756,0.00039685055,0.9977594,0.00030447784,0.00023030587,0.00070989644,0.000002403852,0.00019790423,0.000043750017],"genre_scores_gemma":[0.9003886,0.00004099822,0.09935494,0.000019941244,0.000045322697,0.00007645299,4.1979195e-7,0.00001067913,0.00006266699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869746,0.00011702952,0.0004292982,0.00020784598,0.0002335122,0.00031485938],"domain_scores_gemma":[0.99542403,0.0034556398,0.0002769137,0.0006754262,0.00013809204,0.000029873221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018280983,0.00012559557,0.0002172297,0.00019447564,0.00018957436,0.000032455762,0.0008286936,0.00008989692,0.000002714026],"category_scores_gemma":[0.00008439454,0.00009344256,0.00013240777,0.0005136226,0.00004061679,0.00010954969,0.000007172667,0.00014277844,0.0000010677478],"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.00004476438,0.00009838114,0.0000016774236,0.00007733671,0.00013265539,3.663911e-7,0.0002383573,0.50728095,0.001715541,0.010180454,0.0002543822,0.47997513],"study_design_scores_gemma":[0.00011722524,0.00034054427,0.00003137878,0.00011955839,0.000030167388,0.0000162439,0.000034803466,0.9250978,0.07253963,0.0009676048,0.0006073298,0.00009769883],"about_ca_topic_score_codex":0.000036199897,"about_ca_topic_score_gemma":0.000003455079,"teacher_disagreement_score":0.90003353,"about_ca_system_score_codex":0.00007506376,"about_ca_system_score_gemma":0.00009404338,"threshold_uncertainty_score":0.3810477},"labels":[],"label_agreement":null},{"id":"W2158004857","doi":"10.1145/1455229.1455233","title":"SOC test-architecture optimization for the testing of embedded cores and signal-integrity faults on core-external interconnects","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":9,"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":"Ministry of Science and Technology of the People's Republic of China; Research Grants Council, University Grants Committee; McMaster University","keywords":"Computer science; Interconnection; Automatic test pattern generation; Embedded system; Core (optical fiber); System on a chip; Test compression; Signal integrity; Design for testing; Multi-core processor; Parallel computing; Reliability engineering; Testability; Electronic circuit; Engineering; Electrical engineering","score_opus":0.04635780958773395,"score_gpt":0.2758682475496357,"score_spread":0.22951043796190174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158004857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074295844,0.00022520022,0.9910542,0.00026454104,0.000087218854,0.00074375415,0.0000069074317,0.0001537832,0.000034816887],"genre_scores_gemma":[0.96809816,0.000011547546,0.03171704,0.000061838924,0.000032265125,0.000046333742,0.0000017747245,0.000009903583,0.000021132673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985305,0.00013176598,0.00046832795,0.000303634,0.00028455872,0.0002812187],"domain_scores_gemma":[0.9945938,0.0042963224,0.00038533227,0.00042707822,0.0002537025,0.000043768694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327947,0.00018133153,0.0002574696,0.00019674715,0.00024410906,0.000066551096,0.0005542384,0.000090554095,0.000003735639],"category_scores_gemma":[0.000615633,0.00013815952,0.000081431666,0.00043610355,0.00004622474,0.00020213897,0.000004526005,0.0002600841,9.120341e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012155638,0.00012863034,0.000025991989,0.00006364243,0.000038981263,5.0842624e-7,0.00053585926,0.76396155,0.01434407,0.0023922555,0.000016391254,0.21847993],"study_design_scores_gemma":[0.00049774116,0.0019347852,0.00034348713,0.0004203874,0.000036101977,0.000046520818,0.00007232031,0.979927,0.013073524,0.0035139115,0.0000027864749,0.00013142587],"about_ca_topic_score_codex":0.000028664617,"about_ca_topic_score_gemma":0.0000034831755,"teacher_disagreement_score":0.96066856,"about_ca_system_score_codex":0.00008378976,"about_ca_system_score_gemma":0.00014219442,"threshold_uncertainty_score":0.5633982},"labels":[],"label_agreement":null},{"id":"W2336236367","doi":"10.1145/2899381","title":"Eh?Placer","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Chinese University of Hong Kong; University of Hong Kong; Alberta Innovates - Technology Futures","keywords":"Placer mining; Computer science; Variety (cybernetics); Process (computing); Physical design; Focus (optics); Margin (machine learning); Industrial engineering; Geology; Artificial intelligence; Programming language; Integrated circuit; Machine learning","score_opus":0.015155866589129945,"score_gpt":0.21903710167187923,"score_spread":0.20388123508274927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336236367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017981959,0.00043052936,0.9952655,0.00007556629,0.00022033988,0.00045282938,0.0000100206125,0.0012234146,0.00052364555],"genre_scores_gemma":[0.99597377,0.00026752506,0.0026321493,0.0000076134193,0.000029464885,0.00019721333,0.0000011944472,0.00003999968,0.0008510462],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998862,0.0000943292,0.00036362512,0.00015649931,0.00021300757,0.00031049157],"domain_scores_gemma":[0.9991031,0.00026884652,0.00006393427,0.00046523238,0.000051409246,0.000047446476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003226266,0.00016751196,0.0002136596,0.00024246106,0.000050411796,0.000017629734,0.00023292981,0.00013498864,0.00017754319],"category_scores_gemma":[0.000018102335,0.00012913828,0.00007980857,0.0002332979,0.000026566326,0.0002094763,0.0000010912279,0.00010652896,0.00012623516],"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.00007235008,0.00015349415,0.000014009172,0.00024742784,0.0004278286,0.000002491943,0.0002824233,0.09224038,0.500372,0.004180956,0.0044464665,0.39756018],"study_design_scores_gemma":[0.0013460601,0.0009078667,0.00010835094,0.00063056254,0.000093674906,0.000068054476,0.00006212446,0.11618189,0.86897653,0.0038491762,0.0071048704,0.0006708182],"about_ca_topic_score_codex":0.000007084663,"about_ca_topic_score_gemma":0.0000015993662,"teacher_disagreement_score":0.9941756,"about_ca_system_score_codex":0.00026649045,"about_ca_system_score_gemma":0.000045388184,"threshold_uncertainty_score":0.5266106},"labels":[],"label_agreement":null},{"id":"W2384806434","doi":"10.1145/2846096","title":"Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"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":"National Natural Science Foundation of China","keywords":"Computer science; Preemption; Multi-core processor; Scheduling (production processes); Parallel computing; Fixed-priority pre-emptive scheduling; Dynamic priority scheduling; Integer programming; Fair-share scheduling; Distributed computing; Earliest deadline first scheduling; Rate-monotonic scheduling; Algorithm; Operating system; Mathematical optimization; Quality of service; Computer network","score_opus":0.0343571888096782,"score_gpt":0.2681399171626417,"score_spread":0.2337827283529635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2384806434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016539032,0.000044246797,0.97872716,0.0003481775,0.00016912469,0.0033774779,0.000027550985,0.0006697715,0.0000974668],"genre_scores_gemma":[0.78231597,0.00004182425,0.21420209,0.00002077139,0.00009180591,0.0022874256,0.000010253658,0.000056415818,0.00097342144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660337,0.00020113421,0.0009922236,0.0008017541,0.000677311,0.00072418054],"domain_scores_gemma":[0.995006,0.0020991892,0.0006997907,0.0015952417,0.0004335984,0.00016613565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131199,0.00039149786,0.00057877274,0.00043512747,0.0004653654,0.00017328768,0.000979614,0.00021499669,0.0000305577],"category_scores_gemma":[0.00013441172,0.00026610418,0.00016892001,0.0006922662,0.00007438239,0.0011258881,0.00001118782,0.0001904878,0.00016781008],"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.002434068,0.0020483527,0.000059834183,0.0015035671,0.0015407922,0.000010270879,0.0026986843,0.55056983,0.28113985,0.041086055,0.0005027948,0.11640587],"study_design_scores_gemma":[0.00670852,0.00353811,0.00017356161,0.0019377547,0.00017450648,0.00012392229,0.00045272073,0.84047526,0.14304295,0.001934192,0.00034318856,0.001095327],"about_ca_topic_score_codex":0.00004288595,"about_ca_topic_score_gemma":0.000012151749,"teacher_disagreement_score":0.76577693,"about_ca_system_score_codex":0.0006486363,"about_ca_system_score_gemma":0.0006449716,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W2482041307","doi":"10.1145/2866572","title":"Path Selection for Real-Time Communication on Priority-Aware NoCs","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Interconnection Networks and Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Multiprocessing; Heuristics; Distributed computing; Selection algorithm; Router; Network on a chip; Routing (electronic design automation); Path (computing); Computer network; Selection (genetic algorithm); Parallel computing","score_opus":0.020207549062080967,"score_gpt":0.25436278458381406,"score_spread":0.2341552355217331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482041307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019060853,0.00005116145,0.9947328,0.0006877883,0.00047850667,0.0013694256,0.000011107216,0.0005012641,0.0002618608],"genre_scores_gemma":[0.9890449,0.000116298004,0.008330832,0.00003753712,0.00007711017,0.0005444324,0.0000061366923,0.000029416471,0.0018133456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973986,0.0006350801,0.0007071198,0.00044432728,0.0003890259,0.00042580627],"domain_scores_gemma":[0.99656785,0.0013545282,0.0004644527,0.0011234728,0.00042086083,0.00006883694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013582837,0.00023702251,0.0003503705,0.00033506384,0.00035450663,0.000105901585,0.00082009373,0.00019883177,0.000029687175],"category_scores_gemma":[0.000060033122,0.00018729515,0.00017015752,0.0004979813,0.00003157092,0.0005565899,0.0000072218254,0.00015104492,0.000102878985],"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.0011181933,0.0018493088,0.000057788893,0.00068086607,0.0011190284,0.0000014841472,0.0025488012,0.16396794,0.13945541,0.40523815,0.019233607,0.26472944],"study_design_scores_gemma":[0.001872337,0.002927194,0.000078736426,0.0008390543,0.000044716664,0.000055762674,0.000063119485,0.9631309,0.023247663,0.0035112107,0.0037521191,0.0004772002],"about_ca_topic_score_codex":0.000081280945,"about_ca_topic_score_gemma":0.000015399888,"teacher_disagreement_score":0.9871388,"about_ca_system_score_codex":0.0006181493,"about_ca_system_score_gemma":0.00024125539,"threshold_uncertainty_score":0.7637675},"labels":[],"label_agreement":null},{"id":"W2561253484","doi":"10.1145/2968445","title":"Optimized Implementation of Multirate Mixed-Criticality Synchronous Reactive Models","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"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":"National Natural Science Foundation of China","keywords":"Computer science; Mixed criticality; Scheduling (production processes); Criticality; Distributed computing; Certification; Mathematical optimization","score_opus":0.028731679556122866,"score_gpt":0.28600681220522317,"score_spread":0.2572751326491003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561253484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011417876,0.00011577512,0.9863973,0.00027218962,0.00029350558,0.0011598862,0.000016965016,0.00023639403,0.000090077105],"genre_scores_gemma":[0.92324674,0.00003415631,0.07639421,0.0000064418327,0.000017820701,0.00022493099,0.0000023627617,0.00002099707,0.00005233803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643135,0.00087799504,0.0011232737,0.0004969832,0.00059111457,0.0004792839],"domain_scores_gemma":[0.996561,0.0011340198,0.00063506945,0.0011266691,0.00045189686,0.000091352376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015962601,0.00024435355,0.0005065242,0.00034082105,0.00011507551,0.000061260434,0.00077067525,0.00013696717,0.000027565107],"category_scores_gemma":[0.00007420898,0.00019808802,0.00016239616,0.0004773557,0.00006716981,0.0014980275,0.000012053535,0.00012668733,0.000030583713],"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.0002092253,0.0005729961,0.000012955557,0.0003749501,0.00071294425,0.000003619926,0.0019181491,0.523592,0.23903218,0.07016461,0.00006973793,0.16333662],"study_design_scores_gemma":[0.002284823,0.00068757933,0.00011702699,0.0003260151,0.00006471032,0.000040252897,0.0004075982,0.71291023,0.27771547,0.005126477,0.000011060909,0.00030875514],"about_ca_topic_score_codex":0.00040582748,"about_ca_topic_score_gemma":0.000009143493,"teacher_disagreement_score":0.9118289,"about_ca_system_score_codex":0.0005546949,"about_ca_system_score_gemma":0.00045135943,"threshold_uncertainty_score":0.8077795},"labels":[],"label_agreement":null},{"id":"W2567395862","doi":"10.1145/2947658","title":"An Adaptive Demand-Based Caching Mechanism for NAND Flash Memory Storage Systems","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Hong Kong Polytechnic University; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Flash file system; Cache; NAND gate; Embedded system; Flash memory; Exploit; Overhead (engineering); Locality of reference; Memory footprint; Locality; Overlay; Parallel computing; Computer hardware; Distributed computing; Operating system; Computer memory; Computer network; Semiconductor memory","score_opus":0.02651266147675879,"score_gpt":0.2594698317725862,"score_spread":0.2329571702958274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567395862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018914206,0.0002327193,0.99414045,0.00018787032,0.00052984076,0.0016792562,0.000048675432,0.0012769214,0.000012835108],"genre_scores_gemma":[0.904966,0.00001630468,0.09406589,0.00001873513,0.000025742855,0.00073471136,0.000004184454,0.000032558044,0.00013589258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974034,0.00039610255,0.00058836146,0.00062313105,0.00044497766,0.0005440405],"domain_scores_gemma":[0.99643344,0.0010678548,0.00047084288,0.0016581244,0.0002891166,0.00008061637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052119,0.00029353832,0.00041392783,0.00048742982,0.00028989644,0.000099992394,0.001461189,0.00020822437,0.0000032495007],"category_scores_gemma":[0.00014349075,0.00023368525,0.00010577511,0.00041118695,0.00006447302,0.0013590106,0.000010513532,0.00016512204,0.000018075738],"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.00014335179,0.00021016228,6.8203974e-7,0.00014366074,0.00014703778,0.000003851298,0.00018683962,0.72668123,0.09338751,0.15026061,0.00013033242,0.028704727],"study_design_scores_gemma":[0.0012414798,0.001931657,0.0000033529104,0.00026889986,0.000036926634,0.000026036312,0.00013494787,0.8774019,0.11014789,0.008383785,0.00009120754,0.000331936],"about_ca_topic_score_codex":0.000031352833,"about_ca_topic_score_gemma":0.000008222986,"teacher_disagreement_score":0.90307456,"about_ca_system_score_codex":0.00065493205,"about_ca_system_score_gemma":0.00030626007,"threshold_uncertainty_score":0.95294076},"labels":[],"label_agreement":null},{"id":"W2619603071","doi":"10.1145/3035464","title":"A Fast Hierarchical Adaptive Analog Routing Algorithm Based on Integer Linear Programming","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Multipath routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Routing (electronic design automation); Dynamic Source Routing; Integer programming; Distributed computing; Algorithm; Computer network; Routing protocol","score_opus":0.022845966572676617,"score_gpt":0.2574228208277125,"score_spread":0.23457685425503588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619603071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041550107,0.00006185264,0.9970661,0.000055619617,0.00019133321,0.00083741813,0.000014311909,0.00091029063,0.0004476008],"genre_scores_gemma":[0.94379956,0.00001564107,0.055681832,0.000011128756,0.00006484537,0.0002878584,0.000007824362,0.00005419256,0.000077107536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982655,0.00016243997,0.0004790961,0.00028154082,0.0003502766,0.0004611206],"domain_scores_gemma":[0.99849087,0.00028686455,0.00019338031,0.00084557955,0.00010384503,0.00007946317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006390199,0.00027166907,0.00035329693,0.00034187586,0.00033367018,0.00010762325,0.0004954532,0.00020503199,0.00002192075],"category_scores_gemma":[0.00006631799,0.00026556654,0.0001470238,0.00018462676,0.00006995202,0.00023308222,0.000003561663,0.00050854165,0.000025283765],"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.000077971155,0.00019158292,0.0000074679765,0.00009979432,0.00019949372,0.000006170395,0.00025981772,0.470132,0.0029340559,0.00084124546,0.00009275911,0.52515763],"study_design_scores_gemma":[0.00045473996,0.0008341072,0.000050267325,0.0003265038,0.000041177253,0.000010590907,0.00005733149,0.9786587,0.01897444,0.0001941531,0.00015538855,0.00024263523],"about_ca_topic_score_codex":0.000052196443,"about_ca_topic_score_gemma":0.000005548763,"teacher_disagreement_score":0.94338405,"about_ca_system_score_codex":0.00032703497,"about_ca_system_score_gemma":0.000100217396,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W2627054467","doi":"10.1145/3054746","title":"Generating Current Constraints to Guarantee RLC Power Grid Safety","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Grid; Floorplan; Voltage drop; Power (physics); Key (lock); Voltage; Electronic engineering; Distributed computing; Electrical engineering; Embedded system","score_opus":0.01868960324126465,"score_gpt":0.2543799068200354,"score_spread":0.23569030357877077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2627054467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037645213,0.00047164178,0.9571886,0.000091430884,0.0024994868,0.0011049731,0.000042084423,0.00050852523,0.0004480261],"genre_scores_gemma":[0.99520606,0.00016287553,0.004147328,0.000013235526,0.00011320886,0.0001903373,0.000007805967,0.00006339717,0.0000957762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774086,0.00011952334,0.00075611065,0.00033047193,0.00044119867,0.0006118093],"domain_scores_gemma":[0.9981082,0.00016725213,0.00022097223,0.0012593133,0.00014427383,0.00010000369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073913106,0.00033333333,0.0004236573,0.00033315923,0.00048524144,0.00016417686,0.0007386763,0.00014077149,0.0001418147],"category_scores_gemma":[0.00007572643,0.0003419229,0.00012362913,0.00021007686,0.00007980573,0.00050261855,0.0000065328004,0.0003553729,0.0002648706],"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.000047013185,0.00007515737,0.000012373345,0.00013763703,0.00018227207,0.0000018276041,0.0004635855,0.9180683,0.02947978,0.0006216333,0.0009987085,0.049911704],"study_design_scores_gemma":[0.0018856261,0.00073539664,0.00061455864,0.00079083844,0.00011249851,0.00007520105,0.0001545122,0.90262985,0.08661464,0.00013606872,0.0053053717,0.0009454049],"about_ca_topic_score_codex":0.000015110076,"about_ca_topic_score_gemma":0.000007486688,"teacher_disagreement_score":0.95756084,"about_ca_system_score_codex":0.00048509723,"about_ca_system_score_gemma":0.00015702454,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W2752742484","doi":"10.1145/3123877","title":"An Adaptive Markov Model for the Timing Analysis of Probabilistic Caches","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"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; Markov chain; State space; Cache; State (computer science); Markov model; Markov process; Computation; Parallel computing; Algorithm; Artificial intelligence; Mathematics","score_opus":0.07235459296917826,"score_gpt":0.308379183978513,"score_spread":0.23602459100933473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752742484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034181061,0.000121359175,0.9947428,0.00013318786,0.00012976337,0.0013005509,0.000012742967,0.00009683363,0.000044637778],"genre_scores_gemma":[0.925565,0.000007774492,0.07391425,0.000004063518,0.000015620262,0.00036254834,0.000002454806,0.000014711268,0.0001135448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979514,0.0002742872,0.0006492893,0.00039459404,0.00040549767,0.00032491382],"domain_scores_gemma":[0.9952923,0.0010936761,0.00088015286,0.0023359547,0.00034564536,0.000052248117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019067918,0.0001827871,0.00046009166,0.00036846488,0.0005374913,0.00020904171,0.0019189524,0.00010115938,0.000003324845],"category_scores_gemma":[0.00016043212,0.00014450854,0.00024081992,0.00043038387,0.00007994219,0.0008194616,0.000009388312,0.000122382,0.0000020582304],"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.00003640625,0.000072279145,0.000005434729,0.000053089396,0.00070891675,1.0340072e-7,0.0007660593,0.9801163,0.0021679623,0.0069367476,0.0000056910567,0.009130977],"study_design_scores_gemma":[0.0002587146,0.00035383584,0.00026429258,0.00006692608,0.0005285155,0.0000036072504,0.00013313869,0.994908,0.0023935337,0.00095373555,0.0000016540964,0.0001340582],"about_ca_topic_score_codex":0.00028242567,"about_ca_topic_score_gemma":0.00007139942,"teacher_disagreement_score":0.9221469,"about_ca_system_score_codex":0.00020336172,"about_ca_system_score_gemma":0.00031901945,"threshold_uncertainty_score":0.5892887},"labels":[],"label_agreement":null},{"id":"W2800418272","doi":"10.1145/3158215","title":"Eh?Legalizer","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Alberta Innovates - Technology Futures; CMC Microsystems","keywords":"Legalization; Computer science; Robustness (evolution); Scalability; Routing (electronic design automation); Standard cell; Floorplan; Mathematical optimization; Process (computing); Parallel computing; Algorithm; Embedded system; Mathematics; Integrated circuit","score_opus":0.017845804125772382,"score_gpt":0.23808365911985227,"score_spread":0.22023785499407988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800418272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023538757,0.00032254888,0.9930903,0.000029743276,0.0003516586,0.00048064033,0.0000059051517,0.0013241591,0.0020412095],"genre_scores_gemma":[0.9938015,0.00007497507,0.005400153,0.000014666026,0.00007623803,0.00014835878,0.000002991392,0.000042781216,0.0004383343],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987934,0.000094630544,0.00038779018,0.00016623235,0.00022967244,0.00032824345],"domain_scores_gemma":[0.99914575,0.00011725152,0.00006653518,0.00051386806,0.0001082966,0.00004830778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470774,0.00017658478,0.00022647205,0.00027239806,0.00008737158,0.000032055228,0.00027289044,0.00014425041,0.00018677904],"category_scores_gemma":[0.000015607677,0.00017731645,0.000078173725,0.00036779462,0.000051286468,0.00019575372,0.0000012641948,0.00016154288,0.00017612962],"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.00022027621,0.00054468546,0.000023921988,0.000850995,0.0013767448,0.0000063520483,0.0024246275,0.28234443,0.4547756,0.020558603,0.03407747,0.2027963],"study_design_scores_gemma":[0.0005842936,0.0011968312,0.00006116905,0.00019122145,0.00007718896,0.00005206702,0.00007760625,0.43727857,0.54823303,0.0024412437,0.009346448,0.00046034594],"about_ca_topic_score_codex":0.00001832911,"about_ca_topic_score_gemma":0.0000035868945,"teacher_disagreement_score":0.9914476,"about_ca_system_score_codex":0.00019110322,"about_ca_system_score_gemma":0.000051231247,"threshold_uncertainty_score":0.7230755},"labels":[],"label_agreement":null},{"id":"W2897505503","doi":"10.1145/3233244","title":"GPlace3.0","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":60,"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 Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Router; Parallel computing; Routing (electronic design automation); Reduction (mathematics); Benchmark (surveying); Embedded system; Computer engineering; Algorithm; Computer network; Mathematics","score_opus":0.01641232852791342,"score_gpt":0.232863703928349,"score_spread":0.21645137540043558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897505503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029904735,0.00028049675,0.99295765,0.000024932793,0.0003044591,0.00045592352,0.0000052575156,0.0013045206,0.0016762894],"genre_scores_gemma":[0.99389565,0.00007317639,0.005440502,0.000010893702,0.00006673197,0.00012960105,0.0000026038867,0.000037271067,0.000343594],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988996,0.00008617914,0.00035162418,0.0001517403,0.00020660665,0.00030424536],"domain_scores_gemma":[0.9991947,0.00013593966,0.00006119482,0.0004695884,0.00009408311,0.0000445044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034548025,0.00016118448,0.00020633246,0.00025749544,0.00008231545,0.000026126243,0.0002559004,0.0001313707,0.0001461457],"category_scores_gemma":[0.000015245885,0.00016356743,0.000066436885,0.0003419121,0.000046177694,0.00016340853,0.0000011283865,0.00015116722,0.00017312469],"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.000209741,0.00043645612,0.000020159398,0.0007094403,0.0010582936,0.0000045944516,0.0019816794,0.36137968,0.38392133,0.012563436,0.024029074,0.21368611],"study_design_scores_gemma":[0.0004704187,0.0011157232,0.000045948105,0.00015064866,0.000055368437,0.000042369542,0.00007566571,0.5074853,0.48400038,0.001822643,0.004377157,0.00035839452],"about_ca_topic_score_codex":0.000011727495,"about_ca_topic_score_gemma":0.0000032054813,"teacher_disagreement_score":0.99090517,"about_ca_system_score_codex":0.00018643825,"about_ca_system_score_gemma":0.000047345795,"threshold_uncertainty_score":0.66700864},"labels":[],"label_agreement":null},{"id":"W2899985657","doi":"10.1145/3236624","title":"PV-Aware Analog Sizing for Robust Analog Layout Retargeting with Optical Proximity Correction","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advancements in Photolithography Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Retargeting; Computer science; Sizing; Distortion (music); Wafer; Optical proximity correction; Electronic engineering; Lithography; Process (computing); Analogue electronics; Electronic circuit; Artificial intelligence; Electrical engineering; Materials science; Engineering; Telecommunications","score_opus":0.02188672287728989,"score_gpt":0.24957631816117185,"score_spread":0.22768959528388194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899985657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004115317,0.00013506107,0.9924024,0.000015509477,0.0004047662,0.0014927739,0.0000140301645,0.0011137408,0.00030645257],"genre_scores_gemma":[0.9074347,0.000027912534,0.09177499,0.0000075563,0.00006725045,0.00055631564,0.000016114158,0.000057886344,0.00005725408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983466,0.00009008743,0.0005077934,0.0003082015,0.00028027434,0.00046702835],"domain_scores_gemma":[0.9987439,0.00028954778,0.0001658464,0.00046817705,0.00027403896,0.000058492555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054732687,0.00025178163,0.00032258718,0.00035557846,0.00021696583,0.000039242965,0.00023430723,0.00015594643,0.000020941734],"category_scores_gemma":[0.000050940806,0.00024362038,0.00009523853,0.0005905302,0.000088324174,0.00036182615,0.0000023121072,0.00024419124,0.0000037999189],"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.00027473146,0.0001586747,0.000114471164,0.00038873337,0.00048400534,0.0000010098586,0.00030050837,0.9658011,0.010390625,0.0008575266,0.0003584103,0.020870162],"study_design_scores_gemma":[0.0004724812,0.001380029,0.00009389982,0.00029686972,0.00010851718,0.00003158196,0.00015937889,0.90103227,0.09554468,0.0003383937,0.00024371054,0.0002982178],"about_ca_topic_score_codex":0.000016355847,"about_ca_topic_score_gemma":0.000023347966,"teacher_disagreement_score":0.9033194,"about_ca_system_score_codex":0.00036531096,"about_ca_system_score_gemma":0.00007579357,"threshold_uncertainty_score":0.99345505},"labels":[],"label_agreement":null},{"id":"W2905522727","doi":"10.1145/3241045","title":"Rapid Triggering Capability Using an Adaptive Overlay during FPGA Debug","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and Analog Circuit Testing","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":"University of British Columbia","funders":"","keywords":"Debugging; Computer science; Field-programmable gate array; Overlay; Embedded system; Background debug mode interface; Computer hardware; Electronic circuit; Computer architecture; Operating system; Engineering","score_opus":0.05556856255126132,"score_gpt":0.2667102895176049,"score_spread":0.21114172696634356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905522727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14455265,0.00014134776,0.8541512,0.000023167458,0.0002529418,0.00038298944,0.000002092064,0.00040457613,0.00008905775],"genre_scores_gemma":[0.9915486,0.000007753035,0.00825873,0.0000114339855,0.000088700916,0.00003426023,8.2830724e-7,0.000019613131,0.00003005841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758846,0.00044572266,0.00056076277,0.0005049484,0.00038738974,0.00051275],"domain_scores_gemma":[0.99810845,0.0002962754,0.0003001799,0.0009457831,0.00024898435,0.00010030329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095216115,0.00021718106,0.00030622457,0.00031190962,0.00045655892,0.00011109692,0.0007424266,0.000108462584,0.00002504866],"category_scores_gemma":[0.00007559503,0.00022324151,0.00010327546,0.0007337466,0.00007533418,0.0010281294,0.000008876656,0.00020541591,0.000018525752],"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.00005736251,0.0010107246,0.00006859229,0.00031667264,0.0004286733,0.000010429119,0.0053791003,0.3862893,0.26881522,0.0050302395,0.000018865703,0.33257484],"study_design_scores_gemma":[0.00046404512,0.0008971738,0.0004233076,0.00015123363,0.000027255455,0.00009230253,0.00011820849,0.91375005,0.083167486,0.0006331512,0.000016778713,0.00025901833],"about_ca_topic_score_codex":0.00018690103,"about_ca_topic_score_gemma":0.000016430791,"teacher_disagreement_score":0.84699595,"about_ca_system_score_codex":0.00047949547,"about_ca_system_score_gemma":0.0002978952,"threshold_uncertainty_score":0.91035247},"labels":[],"label_agreement":null},{"id":"W2921018162","doi":"10.1145/3301301","title":"Reconfigurable Battery Systems","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Battery Technologies Research","field":"Engineering","cited_by":45,"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; Battery (electricity); Flexibility (engineering); Network topology; Key (lock); Field-programmable gate array; Embedded system; Battery pack; Scheduling (production processes); Software; Distributed computing; Computer architecture; Computer network; Operating system","score_opus":0.019218295190639993,"score_gpt":0.24179654684621663,"score_spread":0.22257825165557663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921018162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026818328,0.0008569426,0.967078,0.000064527536,0.00081503356,0.0012963988,0.000012928565,0.0013377789,0.0017201104],"genre_scores_gemma":[0.99703497,0.00017938018,0.00074590615,0.0000058369133,0.000018356694,0.00030273103,0.0000060604825,0.000056457713,0.0016503326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982074,0.00012019766,0.0005082984,0.00026087736,0.00036220913,0.00054104644],"domain_scores_gemma":[0.9984003,0.00041945532,0.00009760364,0.0009423513,0.00009475982,0.00004555417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040481717,0.0002160945,0.00035613033,0.00045575146,0.00005940206,0.00005119271,0.0005045971,0.00019732762,0.00021614764],"category_scores_gemma":[0.000029221505,0.0002204457,0.000073472766,0.0004975561,0.000031259842,0.00032084002,0.0000025737443,0.00039214312,0.00065992045],"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.000016203603,0.00002744159,0.0000102999475,0.0002898881,0.000110930865,7.699128e-7,0.000029980194,0.9571544,0.035478283,0.0004075715,0.00045876883,0.006015488],"study_design_scores_gemma":[0.0006832612,0.0005468579,0.0000545942,0.00031867553,0.000022925651,0.000060770803,0.00035785267,0.9021115,0.09159378,0.00038096527,0.003474676,0.00039418958],"about_ca_topic_score_codex":0.00001818069,"about_ca_topic_score_gemma":0.0000011157523,"teacher_disagreement_score":0.97021663,"about_ca_system_score_codex":0.00052339607,"about_ca_system_score_gemma":0.00006442276,"threshold_uncertainty_score":0.8989515},"labels":[],"label_agreement":null},{"id":"W2925797319","doi":"10.1145/3317575","title":"An Optimized Cost Flow Algorithm to Spread Cells in Detailed Placement","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Placement; Algorithm; Very-large-scale integration; Design flow; Electronic circuit; Physical design; Circuit design; Embedded system; Electrical engineering","score_opus":0.010827797269848546,"score_gpt":0.23349491403872633,"score_spread":0.2226671167688778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925797319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007923501,0.00009466415,0.98839265,0.000014801754,0.00028580974,0.002457999,0.000020814552,0.0006596394,0.00015014487],"genre_scores_gemma":[0.9151698,0.00006142309,0.08386758,0.00001504142,0.00001736105,0.00063817634,0.000013415347,0.000052339004,0.00016488647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831903,0.00018073327,0.0005385374,0.00026587586,0.0002767458,0.000419084],"domain_scores_gemma":[0.998988,0.00016154283,0.00006870356,0.0006313179,0.000060910843,0.000089566005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005800955,0.00023311863,0.00038091643,0.00049645646,0.000034282726,0.000042472322,0.00032898612,0.00015594221,0.00015825873],"category_scores_gemma":[0.0000058758555,0.00024810436,0.00006991516,0.00044817946,0.000009218364,0.0002433742,0.0000018663575,0.00021159941,0.00016639841],"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.00004112554,0.00009109968,0.000002470447,0.00005440055,0.000047144164,7.5367956e-7,0.00020260981,0.9101994,0.06421139,0.000021746535,0.000121639736,0.025006207],"study_design_scores_gemma":[0.00081535685,0.0005627109,0.00001724884,0.00011547228,0.000017903329,0.0000047461294,0.00008636886,0.81710017,0.18084921,0.00003570418,0.00017866035,0.00021647694],"about_ca_topic_score_codex":0.000030264877,"about_ca_topic_score_gemma":0.000010065687,"teacher_disagreement_score":0.9072463,"about_ca_system_score_codex":0.00052424974,"about_ca_system_score_gemma":0.00006737524,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W3041521987","doi":"10.1145/3373269","title":"Machine Learning for Congestion Management and Routability Prediction within FPGA Placement","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"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 Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Router; Convolutional neural network; Computer engineering; Deep learning; Gate array; Parallel computing; Embedded system; Algorithm; Artificial intelligence; Computer network","score_opus":0.020984262073361945,"score_gpt":0.22161650259867668,"score_spread":0.20063224052531475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041521987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031368337,0.0005283433,0.9936058,0.00007729208,0.00010954563,0.0015362998,0.000018996821,0.00091270235,0.000074210446],"genre_scores_gemma":[0.99207157,0.0002357222,0.007046757,0.000011364091,0.000021648695,0.00050001935,0.000023375034,0.000028999732,0.000060549282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.00010628295,0.000414233,0.00021329962,0.00017525877,0.00019398742],"domain_scores_gemma":[0.9994948,0.00013561932,0.00009130056,0.00017247305,0.000049113936,0.000056713812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046313653,0.00016005356,0.00020799355,0.00011703564,0.00009680413,0.000030172165,0.000099649646,0.000093005925,0.000013029565],"category_scores_gemma":[0.00002549172,0.00016761741,0.00004770682,0.0001704859,0.000018966588,0.00015129035,0.0000021270375,0.0001718895,0.0000033036386],"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.0001077314,0.000038883056,0.000026533045,0.00064236985,0.00017284765,2.4640622e-7,0.00048586604,0.973732,0.005553925,0.00071824144,0.000095497315,0.018425852],"study_design_scores_gemma":[0.0006589204,0.0009034951,0.000089675144,0.00009068402,0.00008860053,0.0000051086354,0.00014329088,0.9763062,0.020694798,0.0003060465,0.00057333,0.00013984517],"about_ca_topic_score_codex":0.0000063551133,"about_ca_topic_score_gemma":0.0000013106734,"teacher_disagreement_score":0.98893476,"about_ca_system_score_codex":0.00018354462,"about_ca_system_score_gemma":0.000016383785,"threshold_uncertainty_score":0.68352395},"labels":[],"label_agreement":null},{"id":"W3051664773","doi":"10.1145/3398190","title":"LDE-aware Analog Layout Migration with OPC-inclusive Routing","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advancements in Photolithography Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Retargeting; Computer science; Routing (electronic design automation); Router; Process (computing); Scheme (mathematics); Integrated circuit layout; Page layout; Floorplan; Lithography; Fidelity; Analogue electronics; Electronic circuit; Computer engineering; Electronic engineering; Integrated circuit; Embedded system; Artificial intelligence; Computer network; Electrical engineering; Engineering; Telecommunications","score_opus":0.014706358928408554,"score_gpt":0.2370374931630765,"score_spread":0.22233113423466797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3051664773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075193536,0.00018967885,0.9897992,0.000117540985,0.00007774883,0.0008935437,0.000019734272,0.0011913651,0.00019185584],"genre_scores_gemma":[0.9876621,0.00006643005,0.011874045,0.000035298945,0.00003039728,0.00024381603,0.00001750662,0.000050744122,0.000019682964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855113,0.00010263243,0.0004544521,0.00024671233,0.00032226735,0.00032281273],"domain_scores_gemma":[0.9991653,0.00012983441,0.00015460949,0.00036405187,0.000114726405,0.00007148629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001845021,0.00023343122,0.00028476227,0.00020852736,0.0001166967,0.000032505846,0.00026547574,0.00010451727,0.00003202846],"category_scores_gemma":[0.000018967068,0.00022734843,0.0000742779,0.00065610016,0.000032336106,0.00030753517,0.0000029724645,0.0002446147,0.000009293231],"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.00007524562,0.000052494415,0.00006234309,0.00021056281,0.000293922,0.0000027531019,0.0010364864,0.977649,0.012153262,0.00079000153,0.00018426217,0.0074896836],"study_design_scores_gemma":[0.000575908,0.0009282873,0.00006478882,0.00023881943,0.00010010351,0.000020506724,0.0005977198,0.89533913,0.10106178,0.00029985237,0.00041063523,0.00036246682],"about_ca_topic_score_codex":0.00002821236,"about_ca_topic_score_gemma":0.000016823664,"teacher_disagreement_score":0.9801427,"about_ca_system_score_codex":0.00025774067,"about_ca_system_score_gemma":0.00006566671,"threshold_uncertainty_score":0.9271},"labels":[],"label_agreement":null},{"id":"W3097021646","doi":"10.1145/3416946","title":"Efficient Parasitic-aware <i> g <sup>m</sup> </i> / <i> I <sup>D</sup> - </i> based Hybrid Sizing Methodology for Analog and RF Integrated Circuits","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Floorplan; Parasitic extraction; Sizing; Computer science; Integrated circuit; Piecewise; Electronic engineering; Analogue electronics; Nonlinear programming; Electronic circuit; Mathematical optimization; Algorithm; Nonlinear system; Electrical engineering; Mathematics; Embedded system; Engineering; Physics","score_opus":0.043965003161724595,"score_gpt":0.2605274146914718,"score_spread":0.2165624115297472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097021646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016422737,0.00083910173,0.9790002,0.00020515571,0.000086876986,0.0018026148,0.00013418087,0.0014595784,0.00004951534],"genre_scores_gemma":[0.98380375,0.00006395198,0.015118935,0.00016864274,0.00006258679,0.00059512554,0.00006465203,0.00010225507,0.00002012601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705803,0.0005317142,0.0008741976,0.0005326719,0.00031738429,0.0006859885],"domain_scores_gemma":[0.9973181,0.0016152874,0.00017335915,0.0004977755,0.00020956446,0.0001858953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001070119,0.00045563094,0.00075407856,0.0003897326,0.00019669776,0.00007742274,0.00038231586,0.00026727575,0.000033167093],"category_scores_gemma":[0.00018307353,0.00047331006,0.00020323595,0.00064693356,0.00007371627,0.0001455093,0.000003572149,0.00043097528,0.000013053278],"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.0000619374,0.000069797745,0.000004426479,0.00048075817,0.00020149461,0.00000318196,0.0005636985,0.9607652,0.02504845,0.00018134143,0.0005702391,0.012049514],"study_design_scores_gemma":[0.0009390696,0.0008273212,0.0000037404513,0.00017879167,0.00017181566,0.000042427757,0.00032132308,0.8931054,0.1033599,0.00016126751,0.00051789253,0.0003710543],"about_ca_topic_score_codex":0.00003177932,"about_ca_topic_score_gemma":0.0000014368622,"teacher_disagreement_score":0.967381,"about_ca_system_score_codex":0.00031783184,"about_ca_system_score_gemma":0.00019834959,"threshold_uncertainty_score":0.99977183},"labels":[],"label_agreement":null},{"id":"W3210723043","doi":"10.1145/3484309","title":"Distance-aware Approximate Nanophotonic Interconnect","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Photonic and Optical Devices","field":"Engineering","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":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Efficient energy use; Energy consumption; Overhead (engineering); Optical interconnect; Scalability; Bandwidth (computing); Interconnection; Transmission (telecommunications); Telecommunications; Electrical engineering","score_opus":0.01468913515383251,"score_gpt":0.22313624241122348,"score_spread":0.20844710725739096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210723043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936592,0.0021168056,0.9842583,0.000043711545,0.00044264688,0.0003607371,0.000016252192,0.00049104623,0.0013339346],"genre_scores_gemma":[0.99753106,0.00039836823,0.0014898918,0.000015886908,0.000015590322,0.00016322904,0.000012841097,0.00003805027,0.0003350856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985751,0.00010989438,0.00045318087,0.00023856766,0.00023514553,0.0003881445],"domain_scores_gemma":[0.99893993,0.00028276182,0.000068346235,0.0005432106,0.00009911838,0.00006660549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002280369,0.00020175688,0.00032459848,0.00011682357,0.0000756378,0.000047203983,0.0002477013,0.00012299225,0.00020324189],"category_scores_gemma":[0.000027557391,0.00020333278,0.00012101358,0.00040880655,0.00003093593,0.00019116195,0.0000029279704,0.0002295247,0.000073399344],"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.000080702084,0.0002946636,0.00000483515,0.001337204,0.00075272255,0.000019284455,0.0006310946,0.9009987,0.06430239,0.014345037,0.00024885693,0.016984487],"study_design_scores_gemma":[0.0004389698,0.00013940553,0.000017413293,0.00023966469,0.000055745342,0.000047402096,0.00023465583,0.8292603,0.16724238,0.0007054658,0.0013754704,0.0002431325],"about_ca_topic_score_codex":0.00001032097,"about_ca_topic_score_gemma":0.00001805192,"teacher_disagreement_score":0.98659444,"about_ca_system_score_codex":0.00032881615,"about_ca_system_score_gemma":0.00014590222,"threshold_uncertainty_score":0.829167},"labels":[],"label_agreement":null},{"id":"W4322397474","doi":"10.1145/3585074","title":"Optimal Pattern Retargeting in IEEE 1687 Networks: A SAT-based Upper-Bound Computation","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Upper and lower bounds; Computation; Satisfiability; Distributed computing; Bounded function; Theoretical computer science; Algorithm; Mathematics","score_opus":0.03149180253073142,"score_gpt":0.2612826725885759,"score_spread":0.2297908700578445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322397474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05134294,0.00010413529,0.94691503,0.00020650434,0.00033904696,0.00044850173,0.0000024552294,0.0006204679,0.000020895886],"genre_scores_gemma":[0.995896,0.000010343396,0.0038442214,0.00004390299,0.00003950076,0.00009888963,0.000018664337,0.000021514727,0.000027000398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754125,0.00043356628,0.0006579668,0.00041490537,0.0003962523,0.0005560609],"domain_scores_gemma":[0.9981884,0.0009121835,0.00028742227,0.00044523375,0.000108980465,0.000057830875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013839881,0.00019769861,0.00029088854,0.000635447,0.00019842772,0.00014262312,0.0005626448,0.00011765885,0.00000564102],"category_scores_gemma":[0.00006338726,0.00021451207,0.00010166797,0.0017209171,0.000026637592,0.00038374335,0.0000051586812,0.00027668852,0.000059314196],"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.0000021056005,0.000052662348,0.00015385578,0.000046236604,0.000021211377,0.0000046708083,0.00023731202,0.9455593,0.00082729757,0.000087779576,0.000039603798,0.05296794],"study_design_scores_gemma":[0.0005335817,0.00028956888,0.0010202613,0.00025307253,0.000010962125,0.000013992503,0.00006843994,0.9964503,0.0009870481,0.00016807398,0.000010476178,0.00019419538],"about_ca_topic_score_codex":0.000103267135,"about_ca_topic_score_gemma":0.00001650812,"teacher_disagreement_score":0.944553,"about_ca_system_score_codex":0.00027808198,"about_ca_system_score_gemma":0.00023165176,"threshold_uncertainty_score":0.87475485},"labels":[],"label_agreement":null},{"id":"W4362453037","doi":"10.1145/3590768","title":"MEDUSA: A Multi-Resolution Machine Learning Congestion Estimation Method for 2D and 3D Global Routing","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and Analog Circuit Testing","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Tsing Hua University; Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Convolutional neural network; Router; Routing (electronic design automation); Network congestion; Real-time computing; Computer network; Artificial intelligence","score_opus":0.04535847245118739,"score_gpt":0.3110048256251456,"score_spread":0.2656463531739582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362453037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001054912,0.00021134251,0.9968375,0.00023859084,0.0001850842,0.0006861858,0.000008089737,0.00076527917,0.000013004426],"genre_scores_gemma":[0.8121279,0.000022366463,0.1875744,0.000010462688,0.000017975413,0.00014642387,0.00001871487,0.000012135802,0.00006965448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980883,0.00040485177,0.00046712317,0.0003805267,0.00026936427,0.00038981004],"domain_scores_gemma":[0.9982309,0.0009661904,0.00031541634,0.00028023368,0.0001494451,0.000057869365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019086656,0.00017241627,0.00024876796,0.00025016532,0.0004091478,0.00011428429,0.00028154638,0.000115486226,0.0000016327558],"category_scores_gemma":[0.00046915436,0.00018009795,0.00006636584,0.00081191014,0.000021379248,0.00045124572,0.000008683659,0.00016870654,0.000011617241],"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.0000031963045,0.00003070405,0.00003992258,0.00007118803,0.00003552236,4.5145055e-7,0.00024074764,0.77453846,0.001601749,0.004253915,0.000008233519,0.2191759],"study_design_scores_gemma":[0.0006831394,0.00030651363,0.00052238966,0.00014785313,0.000040729454,0.00004856769,0.00005754375,0.99645144,0.00060759205,0.0009500284,0.000026465415,0.00015776839],"about_ca_topic_score_codex":0.00015287822,"about_ca_topic_score_gemma":0.000017447415,"teacher_disagreement_score":0.81107295,"about_ca_system_score_codex":0.00026220153,"about_ca_system_score_gemma":0.00013312946,"threshold_uncertainty_score":0.7344181},"labels":[],"label_agreement":null},{"id":"W4362638787","doi":"10.1145/3590962","title":"CRP2.0: A Fast and Robust Cooperation between Routing and Placement in Advanced Technology Nodes","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Policy-based routing; Static routing; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Placement; Physical design; Multipath routing; Interdependence; Dynamic Source Routing; Computer network; Routing protocol; Embedded system","score_opus":0.018532246439521463,"score_gpt":0.23643783554779124,"score_spread":0.2179055891082698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362638787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15637594,0.00029650176,0.8417908,0.00006307757,0.000037160313,0.0005598476,0.0000056654744,0.0008332611,0.00003772983],"genre_scores_gemma":[0.99607605,0.00031532935,0.003286493,0.000002233942,0.00000927756,0.00023039793,0.000008429965,0.00002474851,0.000047023277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990184,0.00006335754,0.00036186664,0.00018287299,0.00011179071,0.000261715],"domain_scores_gemma":[0.99952507,0.00016950919,0.00005353018,0.00018965288,0.00003566412,0.00002656674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040549957,0.00014318511,0.00023551831,0.00062002474,0.000074704425,0.000028638044,0.00009175613,0.00014295707,0.000004412888],"category_scores_gemma":[0.00002552936,0.0001538955,0.000016647571,0.0006712985,0.000028507107,0.00017062663,0.0000033843965,0.00017440651,0.0000048568263],"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.000015142893,0.0000207701,0.00037760643,0.00017933457,0.0000664085,0.0000011899549,0.00042768999,0.89220834,0.040784754,0.0007264691,0.00003518819,0.0651571],"study_design_scores_gemma":[0.00078345154,0.00038508844,0.0011438506,0.00031195805,0.00003073937,0.00001500709,0.00055823545,0.9441545,0.051907387,0.00041957406,0.00004036569,0.00024984355],"about_ca_topic_score_codex":0.000011497385,"about_ca_topic_score_gemma":0.000009089279,"teacher_disagreement_score":0.8397001,"about_ca_system_score_codex":0.00014655077,"about_ca_system_score_gemma":0.000026181619,"threshold_uncertainty_score":0.62756765},"labels":[],"label_agreement":null},{"id":"W4385214089","doi":"10.1145/3610291","title":"A Survey on Approximate Multiplier Designs for Energy Efficiency: From Algorithms to Circuits","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":47,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Multiplier (economics); Efficient energy use; Computation; Electronic circuit; Computer engineering; Algorithm; Electrical engineering","score_opus":0.042439790172345865,"score_gpt":0.2555399393723056,"score_spread":0.21310014919995976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385214089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01306512,0.00013399214,0.9827083,0.000033108936,0.0008766474,0.0014986247,0.00023332216,0.0013936752,0.000057237867],"genre_scores_gemma":[0.9947816,0.000060334594,0.0031729874,0.000030499246,0.00006646839,0.0013134859,0.0001304813,0.00012892859,0.00031519195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972886,0.00023624516,0.0006895956,0.00048535716,0.000502362,0.0007978636],"domain_scores_gemma":[0.9972092,0.0015714809,0.00011915849,0.00080623815,0.00015798841,0.00013595793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00113491,0.0003813754,0.00048812578,0.0008116656,0.00018682427,0.000069877286,0.0005414458,0.0002207716,0.000026866961],"category_scores_gemma":[0.00009857485,0.0003935153,0.00013175138,0.0014847385,0.000026309666,0.00019720959,0.0000040134155,0.00019009464,0.00021790109],"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.00005897695,0.00009202741,0.0000046826603,0.00007149757,0.00018214408,8.77422e-7,0.00041788816,0.95651513,0.021805337,0.00015761396,0.001969969,0.018723862],"study_design_scores_gemma":[0.0009388091,0.0006986656,0.00043553903,0.0001381227,0.000041168685,0.0000019512618,0.000046832985,0.9209054,0.075718835,0.00016421132,0.00050885655,0.0004015715],"about_ca_topic_score_codex":0.00019231557,"about_ca_topic_score_gemma":0.000039139748,"teacher_disagreement_score":0.9817165,"about_ca_system_score_codex":0.0005010341,"about_ca_system_score_gemma":0.00013988778,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W4391681217","doi":"10.1145/3643681","title":"VeriGen: A Large Language Model for Verilog Code Generation","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":191,"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 Calgary","funders":"Army Research Office; National Science Foundation","keywords":"Computer science; Verilog; Correctness; Programming language; Set (abstract data type); Scripting language; Code (set theory); Hardware description language; Compiler; Embedded system; Field-programmable gate array","score_opus":0.04508213604149722,"score_gpt":0.29203474536437435,"score_spread":0.24695260932287713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391681217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017329504,0.0009884716,0.9951492,0.0002750774,0.0005598754,0.000736535,0.000029792982,0.00049693254,0.000031150794],"genre_scores_gemma":[0.92711174,0.000024822853,0.071725704,0.000036630554,0.0000679914,0.00030647722,0.00001247906,0.000019380237,0.00069474493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985763,0.00009951138,0.00037478496,0.0003700557,0.0002576262,0.00032173967],"domain_scores_gemma":[0.99901164,0.00014744757,0.00007735099,0.0006447906,0.000079614336,0.00003916686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067600136,0.0001408238,0.00017727725,0.00022983844,0.00012622765,0.00014020104,0.00045629407,0.000098927274,0.000008056596],"category_scores_gemma":[0.000024251463,0.0001399162,0.00010279988,0.00028868826,0.000009119257,0.00044713638,0.000004928545,0.00012229674,0.000022445773],"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.000010592448,0.000057526755,1.697726e-7,0.00013338856,0.00007432968,9.598012e-7,0.0018038286,0.8884711,0.029467242,0.06345707,0.00033297078,0.016190797],"study_design_scores_gemma":[0.00026883767,0.00015401735,6.1576793e-7,0.000051795178,0.000022396196,0.000011740187,0.00003684933,0.9841501,0.013383953,0.001437543,0.00035397452,0.00012815946],"about_ca_topic_score_codex":0.000010467138,"about_ca_topic_score_gemma":0.000013798545,"teacher_disagreement_score":0.9253788,"about_ca_system_score_codex":0.0002445274,"about_ca_system_score_gemma":0.00030495622,"threshold_uncertainty_score":0.5705617},"labels":[],"label_agreement":null},{"id":"W4396976032","doi":"10.1145/3664286","title":"Applying reinforcement learning to learn best net to rip and re-route in global routing","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","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":"University of Alberta; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute","keywords":"Computer science; Reinforcement learning; Net (polyhedron); Routing (electronic design automation); Artificial intelligence; Machine learning; Computer network","score_opus":0.017003432013078117,"score_gpt":0.25719917338602283,"score_spread":0.24019574137294472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396976032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009231001,0.0005885605,0.9870925,0.00007484984,0.00016223114,0.0013105433,0.0000036657943,0.000869832,0.0006668253],"genre_scores_gemma":[0.99544644,0.00008282887,0.0034568463,0.000018013365,0.000027841921,0.00066830416,0.0000042968654,0.000033444023,0.00026198343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857503,0.0000913881,0.00047180933,0.00025118602,0.00022476436,0.00038582354],"domain_scores_gemma":[0.999485,0.00014112658,0.00003476198,0.00022832419,0.00003080201,0.00007996857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206382,0.00019122112,0.00024339759,0.0003653082,0.00007602261,0.00010901627,0.0001554546,0.00010870803,0.000015668322],"category_scores_gemma":[0.0000337179,0.00020999383,0.00004586176,0.00074277306,0.000008611267,0.00018919588,0.000005117416,0.00027300091,0.00004938491],"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.000013416485,0.000009937634,0.000016450993,0.00016799322,0.0000479229,0.0000023054383,0.0006708665,0.9292531,0.007090792,0.0006317399,0.00010590601,0.061989583],"study_design_scores_gemma":[0.00020873305,0.0006300387,0.00004850531,0.00085552107,0.000034710567,0.000024820032,0.0005514191,0.9855709,0.008360795,0.00017747963,0.0032423032,0.00029479244],"about_ca_topic_score_codex":0.00015257597,"about_ca_topic_score_gemma":0.000030431358,"teacher_disagreement_score":0.9862154,"about_ca_system_score_codex":0.00068575813,"about_ca_system_score_gemma":0.000055459688,"threshold_uncertainty_score":0.85633},"labels":[],"label_agreement":null},{"id":"W4408024913","doi":"10.1145/3721129","title":"LithoExp: Explainable Two-stage CNN-based Lithographic Hotspot Detection with Layout Defect Localization","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Digital Media Forensic Detection","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":"University of Calgary","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Computer science; Hotspot (geology); Lithography; Stage (stratigraphy); Artificial intelligence; Pattern recognition (psychology); Optoelectronics; Materials science; Geology","score_opus":0.010960169906900886,"score_gpt":0.232513131831324,"score_spread":0.22155296192442311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408024913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008811391,0.00016477637,0.987597,0.00010754009,0.00062279194,0.0013016474,0.0000042541933,0.00085804076,0.00053256244],"genre_scores_gemma":[0.99106145,0.000010909665,0.0077380273,0.00006705196,0.00001828331,0.0005037963,0.0000075398652,0.000029286617,0.0005636403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714947,0.00045346798,0.0006277824,0.00062356796,0.0006087253,0.0005370181],"domain_scores_gemma":[0.99745184,0.00053584215,0.00036960645,0.0011791871,0.00037599512,0.00008753064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008860713,0.00033080686,0.00037789243,0.0013156362,0.00031138214,0.00025391823,0.00063762453,0.0001642628,0.000009641421],"category_scores_gemma":[0.000094186464,0.00031230642,0.00017516514,0.0031745343,0.00009318976,0.0009702721,0.0000079598485,0.00027495273,0.000024022473],"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.00027262678,0.000318293,0.000053992895,0.00029745244,0.00023492021,0.000004553324,0.00024608895,0.90582114,0.0033718485,0.009025483,0.000030482981,0.08032312],"study_design_scores_gemma":[0.0016152716,0.001561348,0.00012448536,0.00037288902,0.00008629583,0.000023801864,0.00011959481,0.8902427,0.10343945,0.0014144432,0.0006699538,0.00032974573],"about_ca_topic_score_codex":0.00015873306,"about_ca_topic_score_gemma":0.000101240475,"teacher_disagreement_score":0.9822501,"about_ca_system_score_codex":0.00053962955,"about_ca_system_score_gemma":0.00049673097,"threshold_uncertainty_score":0.9999329},"labels":[],"label_agreement":null},{"id":"W4408844959","doi":"10.1145/3723876","title":"Automatically Improving LLM-based Verilog Generation using EDA Tool Feedback","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Software Engineering Research","field":"Computer Science","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 Calgary","funders":"","keywords":"Computer science; Verilog; Computer architecture; Embedded system; Parallel computing; Field-programmable gate array","score_opus":0.03001254172624539,"score_gpt":0.2764101130795037,"score_spread":0.2463975713532583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408844959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021418793,0.00015888498,0.9761227,0.0001926755,0.00059399963,0.00079998135,0.0000023486646,0.0006893464,0.000021274293],"genre_scores_gemma":[0.86970776,0.0000035611736,0.12993552,0.000035112313,0.000030100171,0.0001311095,0.0000032240093,0.000018319204,0.00013527261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760884,0.00030440744,0.0006156593,0.00043270242,0.00055108377,0.00048731538],"domain_scores_gemma":[0.9972607,0.0011685224,0.00016208862,0.0010904196,0.00026366138,0.00005462359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010603911,0.00021779088,0.00028988853,0.0006617482,0.00021643795,0.00021743,0.0008700136,0.00015669948,0.000017527633],"category_scores_gemma":[0.00044376435,0.00023090158,0.000105654115,0.0012131609,0.000035861263,0.00047611984,0.000012945949,0.00026476014,0.000024792853],"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.00001841753,0.00016126587,0.000017947274,0.00022047333,0.00009049794,0.0000013828155,0.000074441356,0.90079015,0.0661629,0.004773436,0.00011271873,0.027576372],"study_design_scores_gemma":[0.0005316193,0.00026272293,0.000208257,0.00014172663,0.000024180787,0.000007877081,0.000007885174,0.95022196,0.048140515,0.00023391224,0.000043431544,0.00017594542],"about_ca_topic_score_codex":0.000059882273,"about_ca_topic_score_gemma":0.0000026850666,"teacher_disagreement_score":0.848289,"about_ca_system_score_codex":0.00079808006,"about_ca_system_score_gemma":0.0010748444,"threshold_uncertainty_score":0.9415893},"labels":[],"label_agreement":null},{"id":"W4410519228","doi":"10.1145/3736411","title":"FLAG: <u>F</u> inding <u>L</u> ine <u>A</u> nomalies (in RTL code) with <u>G</u> enerative AI","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":5,"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 Calgary","funders":"","keywords":"Flag (linear algebra); Computer science; Code (set theory); Parallel computing; Programming language; Algebra over a field; Mathematics","score_opus":0.01256107005848065,"score_gpt":0.27052595068023244,"score_spread":0.25796488062175177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410519228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032051196,0.00021803295,0.99348694,0.0006451779,0.00023314376,0.0010914833,0.000004630648,0.00080418127,0.00031128852],"genre_scores_gemma":[0.9395658,0.000044399098,0.058901552,0.00011610273,0.000012913381,0.0005684731,0.0000028097877,0.000021714784,0.0007662802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974047,0.00038018706,0.00072527886,0.00058289716,0.00041638964,0.00049057754],"domain_scores_gemma":[0.99785995,0.0005148586,0.00031707349,0.0009871086,0.0002695527,0.00005144797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007277188,0.0003141814,0.00046160488,0.0012847936,0.00020579716,0.00012208306,0.0008889184,0.00017191858,0.00001230007],"category_scores_gemma":[0.00007170616,0.00029699085,0.00008046031,0.0020886406,0.00007391623,0.0009840002,0.000016939792,0.0004469291,0.000010494704],"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.0005154784,0.0008769442,0.00021736314,0.0004550865,0.0005422948,0.000027093449,0.0027647554,0.6459645,0.041857578,0.22133169,0.0005041939,0.08494299],"study_design_scores_gemma":[0.0021909531,0.0021729912,0.00045519377,0.0010568043,0.000055841792,0.000098721306,0.00033106573,0.43270537,0.5452016,0.013249638,0.0017362313,0.00074557966],"about_ca_topic_score_codex":0.00008904278,"about_ca_topic_score_gemma":0.00014155588,"teacher_disagreement_score":0.93636066,"about_ca_system_score_codex":0.00076323596,"about_ca_system_score_gemma":0.0004748081,"threshold_uncertainty_score":0.9999482},"labels":[],"label_agreement":null},{"id":"W4410964457","doi":"10.1145/3737287","title":"ARIANNA: An Automatic Design Flow for Fabric Customization and eFPGA Redaction","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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 Calgary","funders":"","keywords":"Computer science; Redaction; Personalization; Design flow; Flow (mathematics); Computer architecture; Embedded system; Engineering drawing; World Wide Web","score_opus":0.021922299648760555,"score_gpt":0.26002972922900314,"score_spread":0.23810742958024259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410964457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086028967,0.00023105685,0.9955244,0.0004215577,0.0006004814,0.0017168971,0.000008616774,0.0005649452,0.00007173066],"genre_scores_gemma":[0.8817225,0.00006204814,0.11685839,0.000068421534,0.000047871556,0.00071562326,0.00001881347,0.000021005008,0.00048532718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976241,0.00051739864,0.0005859744,0.000551885,0.00030731852,0.00041333993],"domain_scores_gemma":[0.9976515,0.00082346064,0.00026170642,0.00085042394,0.0003231472,0.00008975283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009900777,0.00025741555,0.00038648333,0.00060210907,0.0004902384,0.00020972417,0.0005237224,0.00017841852,0.000011388217],"category_scores_gemma":[0.0001468272,0.0002606755,0.000111150825,0.0011169935,0.000050507082,0.0011765284,0.000009491165,0.0001974601,0.000012255562],"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.00022091219,0.0009351095,0.000004267099,0.0005350152,0.00035544878,8.749691e-7,0.0009528521,0.6882437,0.0053381654,0.07131255,0.0021863526,0.2299148],"study_design_scores_gemma":[0.00093326805,0.00078019383,0.000114187795,0.00011847636,0.00009534949,0.000011147207,0.00004647015,0.973057,0.0042726267,0.019720623,0.0006335794,0.00021708898],"about_ca_topic_score_codex":0.000036892012,"about_ca_topic_score_gemma":0.0000056974754,"teacher_disagreement_score":0.88086224,"about_ca_system_score_codex":0.00035793474,"about_ca_system_score_gemma":0.00043852636,"threshold_uncertainty_score":0.99998456},"labels":[],"label_agreement":null},{"id":"W4412695933","doi":"10.1145/3754339","title":"Analog and Mixed-Signal IC Modeling and Optimization: An Artificial Intelligence Perspective","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Mixed-signal integrated circuit; Perspective (graphical); Artificial intelligence; Domain (mathematical analysis); Machine learning; Categorization; Analogue electronics; Integrated circuit; Computer engineering; Electronic circuit","score_opus":0.023520556912250166,"score_gpt":0.2606866833356658,"score_spread":0.23716612642341564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412695933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034877504,0.0012296954,0.99413955,0.00004660296,0.00008640397,0.0004349278,0.0000045529655,0.0004361122,0.00013438649],"genre_scores_gemma":[0.9828131,0.0003393855,0.016698938,0.000006875189,0.00001630901,0.000085514344,0.000003380114,0.000017982722,0.000018522496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989768,0.0001128307,0.00035778916,0.0002257902,0.00012523019,0.00020152799],"domain_scores_gemma":[0.99943453,0.00012359653,0.000044619635,0.00023290457,0.000121053,0.000043274547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033598943,0.00016058492,0.00021544556,0.00038561455,0.0001225644,0.000064332104,0.00012689397,0.00012507758,0.000015326763],"category_scores_gemma":[0.000015761065,0.00017343147,0.000031883683,0.00036338682,0.000041201278,0.0002627363,0.0000023251487,0.00017028421,0.000001195572],"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.000017349561,0.00003028488,6.9126725e-7,0.00005639473,0.00006641387,3.0348008e-7,0.00029748506,0.96598935,0.0027026138,0.011846716,0.0000072467387,0.018985126],"study_design_scores_gemma":[0.0000683995,0.00021430882,0.0000026061987,0.000091383554,0.00004857861,0.000011529607,0.0007914462,0.9654205,0.022056587,0.011155759,0.0000026686964,0.00013623438],"about_ca_topic_score_codex":0.00003943633,"about_ca_topic_score_gemma":0.000009769603,"teacher_disagreement_score":0.97932535,"about_ca_system_score_codex":0.00018157404,"about_ca_system_score_gemma":0.00006317192,"threshold_uncertainty_score":0.707233},"labels":[],"label_agreement":null},{"id":"W4412960910","doi":"10.1145/3749986","title":"HLSRewriter: Efficient Refactoring and Optimization of C/C++ Code with LLMs for High-Level Synthesis","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","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":"Artificial Intelligence in Medicine (Canada)","funders":"International Graduate School of Science and Engineering; Deutsche Forschungsgemeinschaft","keywords":"Code refactoring; Computer science; High-level synthesis; Pipeline (software); Code generation; Code (set theory); Process (computing); Programming language; Parallel computing; Embedded system; Software; Operating system; Field-programmable gate array","score_opus":0.02432252241982122,"score_gpt":0.25692611228392254,"score_spread":0.23260358986410132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412960910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010386987,0.00014613832,0.9975606,0.00015590894,0.00009641976,0.0006950484,0.000010053333,0.0002645684,0.00003252635],"genre_scores_gemma":[0.6193499,0.000029345054,0.38041255,0.000006374649,0.0000033449533,0.00012009566,0.0000016107847,0.0000070962615,0.000069709204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987423,0.00013673933,0.0004327084,0.00028729747,0.00020039573,0.00020060332],"domain_scores_gemma":[0.99822974,0.00073468423,0.00027321777,0.00047475658,0.00026040064,0.000027191105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391934,0.00014251543,0.0002745542,0.0004103523,0.00013582071,0.000053546864,0.0003793801,0.00008421422,0.0000017782716],"category_scores_gemma":[0.000072059374,0.00013004438,0.000041694813,0.0005307787,0.000034990724,0.00014688521,0.0000072938114,0.000074105476,2.8039818e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004071199,0.00007351933,0.0000034033735,0.00012197158,0.00006465866,8.402359e-8,0.0000989522,0.98468894,0.0005326986,0.008727815,0.00003367547,0.005613563],"study_design_scores_gemma":[0.0003944415,0.00031029148,0.0000327186,0.0003315043,0.00003739953,0.000004721162,0.000020093603,0.94156075,0.056932576,0.00024343752,0.000020770012,0.00011128635],"about_ca_topic_score_codex":0.000026747344,"about_ca_topic_score_gemma":0.0000015620277,"teacher_disagreement_score":0.61831117,"about_ca_system_score_codex":0.00011677922,"about_ca_system_score_gemma":0.00015834444,"threshold_uncertainty_score":0.53030556},"labels":[],"label_agreement":null},{"id":"W4413876901","doi":"10.1145/3762185","title":"Patchability-Driven Design Exploration for System-on-Chip Patching Architectures","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","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":"University of Calgary","funders":"Intel Corporation; Semiconductor Research Corporation","keywords":"Computer science; Computer architecture; Chip; System on a chip; Embedded system; Telecommunications","score_opus":0.028498550755950338,"score_gpt":0.26252169948173043,"score_spread":0.2340231487257801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413876901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014912295,0.000100799,0.99388,0.0006176171,0.0007747802,0.002313899,0.000019529098,0.00065467163,0.00014751802],"genre_scores_gemma":[0.97022325,0.000009529105,0.028230863,0.00006751718,0.00006243133,0.0012215588,0.000011225243,0.00002026169,0.0001533583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969204,0.00078590517,0.00070184894,0.0006435627,0.00044918014,0.00049907295],"domain_scores_gemma":[0.99600595,0.002152397,0.00028581833,0.001184992,0.00029225496,0.00007860601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010831438,0.00031136928,0.0004618179,0.0005689032,0.000527851,0.00016329788,0.00089063303,0.00015934506,0.0000036537747],"category_scores_gemma":[0.00014129326,0.00029222385,0.0002418381,0.0008996636,0.00004579638,0.00043949237,0.000012465238,0.0003179903,0.00002290443],"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.00020318248,0.0003865365,0.0000026919417,0.00045248857,0.0001893006,5.723609e-7,0.0006712837,0.8318698,0.0025138003,0.1397194,0.00025564973,0.023735322],"study_design_scores_gemma":[0.00093104865,0.0013417192,0.000047351194,0.0004989167,0.00006986513,0.0000062954196,0.00017374032,0.9384011,0.017932603,0.039863266,0.00043953906,0.00029454907],"about_ca_topic_score_codex":0.00005375403,"about_ca_topic_score_gemma":0.000009959064,"teacher_disagreement_score":0.968732,"about_ca_system_score_codex":0.0005693735,"about_ca_system_score_gemma":0.0004727562,"threshold_uncertainty_score":0.999953},"labels":[],"label_agreement":null},{"id":"W4414513777","doi":"10.1145/3765904","title":"Accurate Analytic Equation Generation for Compact Modeling with Physics-Assisted Kolmogorov-Arnold Networks","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Artificial neural network; Similarity (geometry); CLARITY; Variable (mathematics); Similitude; Physical system","score_opus":0.07040958155573551,"score_gpt":0.294038443940688,"score_spread":0.2236288623849525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414513777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005612655,0.00012453733,0.9923332,0.00017385343,0.00027956127,0.0011804893,0.000010279638,0.00010601318,0.000179467],"genre_scores_gemma":[0.9971896,0.00001620192,0.0016941839,0.000020799924,0.00017869695,0.000261619,0.000108522836,0.00002564868,0.00050476065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984108,0.00017581003,0.00053659873,0.00033707128,0.00019961303,0.00034008842],"domain_scores_gemma":[0.9987166,0.0002334738,0.000297945,0.00043669526,0.00026841238,0.000046882164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034145082,0.00023683783,0.0003508426,0.0001861208,0.00029408257,0.0000933409,0.00018077117,0.00008614975,0.000032666718],"category_scores_gemma":[0.000005768607,0.00021502562,0.00014851685,0.000564559,0.000024280685,0.00029211026,0.0000017416529,0.00020833546,0.0000031971902],"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.000120437464,0.00012922025,0.000007442404,0.000031975997,0.00027064644,3.2667128e-8,0.000035269033,0.9719808,0.0013671803,0.011877485,0.00018519723,0.013994319],"study_design_scores_gemma":[0.0010002181,0.00023595933,0.000010544189,0.00015042131,0.00018836623,0.0000010487709,0.000087766566,0.99340814,0.0033633148,0.0013413765,0.000028666964,0.00018415543],"about_ca_topic_score_codex":0.000077811164,"about_ca_topic_score_gemma":0.000004645266,"teacher_disagreement_score":0.9915769,"about_ca_system_score_codex":0.00017432905,"about_ca_system_score_gemma":0.00020035572,"threshold_uncertainty_score":0.876849},"labels":[],"label_agreement":null},{"id":"W4414934603","doi":"10.1145/3770920","title":"Runtime Fault Localization in Deep Neural Network Accelerators","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Adversarial Robustness in Machine Learning","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":"University of Calgary","funders":"Semiconductor Research Corporation","keywords":"Dataflow; Robustness (evolution); Checksum; Fault detection and isolation; Fault tolerance; Artificial neural network; Fault coverage; Overhead (engineering); Systolic array","score_opus":0.01294349680915495,"score_gpt":0.26092095627620343,"score_spread":0.24797745946704847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414934603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012146715,0.00027491566,0.9964114,0.00032391722,0.00068477256,0.00059959816,3.7681158e-7,0.0002932334,0.00019714108],"genre_scores_gemma":[0.98504734,0.000015566176,0.014562531,0.00009304169,0.00002993391,0.00009597471,0.0000032789874,0.000013775184,0.00013852755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976646,0.0005892309,0.000616444,0.00037971095,0.00031767052,0.00043237323],"domain_scores_gemma":[0.99843824,0.0004938305,0.00023635394,0.00067902304,0.000117411,0.000035127203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082071073,0.00019415827,0.00029946995,0.0004893094,0.00020283762,0.000108308675,0.00088580267,0.0001484186,0.000018413617],"category_scores_gemma":[0.000101036334,0.00020556094,0.0000730536,0.0020134512,0.000030333813,0.00058025663,0.000015649792,0.00034304263,0.000015217008],"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.00001975014,0.000051857005,0.00013536257,0.00003229514,0.000035196517,9.902354e-7,0.00017795777,0.96712214,0.00008109188,0.014672939,0.00006596011,0.017604452],"study_design_scores_gemma":[0.00054010825,0.000117397045,0.00027479028,0.000104930106,0.00001618823,0.0000046890605,0.000040723626,0.9957352,0.0005882873,0.0022437684,0.000184382,0.00014951425],"about_ca_topic_score_codex":0.00007940695,"about_ca_topic_score_gemma":0.000025078778,"teacher_disagreement_score":0.9838327,"about_ca_system_score_codex":0.0003787671,"about_ca_system_score_gemma":0.00019218225,"threshold_uncertainty_score":0.8382532},"labels":[],"label_agreement":null},{"id":"W4415028235","doi":"10.1145/3771280","title":"Advanced And-Inverter Graph Decomposition Technique for Reducing Circuit Complexity","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and Analog Circuit Testing","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":"Cybernet Systems Corporation (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Circuit complexity; Parameterized complexity; Computational complexity theory; Benchmark (surveying); Upper and lower bounds; Scalability; Electronic design automation; Reduction (mathematics); Decomposition; Treewidth","score_opus":0.03414227269556842,"score_gpt":0.2868559670828685,"score_spread":0.25271369438730007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415028235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007955601,0.0002253816,0.996944,0.00029462873,0.00017225044,0.0011174129,0.000003844344,0.00029304274,0.00015386935],"genre_scores_gemma":[0.97251743,0.00001785737,0.026872883,0.000052183314,0.000009490614,0.00044592415,0.000004121153,0.000008807229,0.000071327144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998644,0.00015503692,0.0004136973,0.00035096362,0.00014861082,0.00028769905],"domain_scores_gemma":[0.99868655,0.0004778661,0.00017675383,0.0004761593,0.00014543836,0.00003723789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012706,0.00014769363,0.00024310545,0.0003947518,0.0002834998,0.00007440435,0.0004154697,0.000087660665,0.0000021377148],"category_scores_gemma":[0.000045464993,0.00015676046,0.00008500761,0.00056222116,0.000040537358,0.00036540962,0.000005467211,0.00013461035,0.0000015852147],"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.000014473292,0.00027565536,0.00002196781,0.0006528211,0.00021175185,9.156103e-7,0.0004654824,0.03854717,0.3741193,0.193746,0.00018868518,0.39175576],"study_design_scores_gemma":[0.0009715977,0.0006150488,0.00023813377,0.00081169215,0.000058147114,0.00005793276,0.000058961476,0.78412515,0.11822484,0.094431266,0.000093696195,0.00031353708],"about_ca_topic_score_codex":0.00003124343,"about_ca_topic_score_gemma":0.000003498311,"teacher_disagreement_score":0.9717218,"about_ca_system_score_codex":0.00016634521,"about_ca_system_score_gemma":0.00014518271,"threshold_uncertainty_score":0.63925064},"labels":[],"label_agreement":null},{"id":"W4415104276","doi":"10.1145/3769005","title":"A High Efficient and Scalable Obstacle-Avoiding VLSI Global Routing Flow","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Interconnection Networks and Systems","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":"Advanced Micro Devices (Canada)","funders":"National Natural Science Foundation of China","keywords":"Scalability; Very-large-scale integration; Routing (electronic design automation); Benchmark (surveying); Steiner tree problem; Tree (set theory); Network topology; Obstacle","score_opus":0.012184330506875382,"score_gpt":0.23621870231564815,"score_spread":0.22403437180877278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415104276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015859988,0.0004963501,0.9809134,0.00027482113,0.0012882174,0.00058012235,0.0000035417754,0.0003078563,0.00027567695],"genre_scores_gemma":[0.9908135,0.000015911977,0.00857307,0.000042284035,0.000031594962,0.000088622015,0.000001304333,0.000008390658,0.00042530405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771625,0.00046539295,0.0006336121,0.00043826297,0.00030916478,0.00043733176],"domain_scores_gemma":[0.9984267,0.0005019434,0.00022199783,0.000626157,0.00016469805,0.000058498295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012390165,0.00020257977,0.00034117742,0.0002361489,0.00041894437,0.00022732938,0.00050546415,0.00013436287,0.000008882961],"category_scores_gemma":[0.00006647344,0.00019680611,0.00009270132,0.0009123089,0.00003150135,0.00025245486,0.000015215507,0.00021497488,0.000015764723],"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.000024284021,0.00009466288,0.000019011,0.00009043302,0.00013035072,0.0000012804985,0.00024654457,0.88586277,0.0006406525,0.08581619,0.00021836793,0.026855456],"study_design_scores_gemma":[0.00054956094,0.00019816068,0.00009699048,0.00035536854,0.000025385709,0.000041716983,0.00017050539,0.9942946,0.0026858603,0.0013011292,0.000121307734,0.00015943385],"about_ca_topic_score_codex":0.00018467617,"about_ca_topic_score_gemma":0.000012068272,"teacher_disagreement_score":0.97495353,"about_ca_system_score_codex":0.00051932357,"about_ca_system_score_gemma":0.0001936347,"threshold_uncertainty_score":0.802552},"labels":[],"label_agreement":null},{"id":"W4417065140","doi":"10.1145/3779435","title":"Multi-Agent Reinforcement Learning in Designing the Low-Dropout Regulator Circuits","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Excellence Research Chairs, Government of Canada","keywords":"Sizing; Reinforcement learning; Automation; Particle swarm optimization; Electronic design automation; Process (computing); Rendering (computer graphics); Engineering design process","score_opus":0.015634768870744924,"score_gpt":0.2408618695294796,"score_spread":0.2252271006587347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417065140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003804396,0.0007388007,0.99308366,0.000051908715,0.00021432072,0.0011040401,7.93712e-7,0.0007178689,0.00028418924],"genre_scores_gemma":[0.9965909,0.00016157384,0.001963337,0.000018030649,0.000012321022,0.00043108684,0.000003446061,0.000031396496,0.0007879207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982507,0.00025644802,0.0006413084,0.00020871544,0.00024663194,0.00039618788],"domain_scores_gemma":[0.99899405,0.0003205433,0.00010796668,0.00047915755,0.000066323206,0.000031948402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090066536,0.00021806477,0.00028249077,0.00046764145,0.00015115216,0.000048778576,0.00035262707,0.00014951866,0.000023788598],"category_scores_gemma":[0.000051136947,0.00019447689,0.000091796785,0.0006596824,0.000032291147,0.00015561866,0.0000036604881,0.00040939343,0.000017821378],"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.000008675461,0.00003830833,0.000017809127,0.00015247051,0.000095263706,7.8155307e-7,0.00035679073,0.93001586,0.056191143,0.00041198634,0.00013306514,0.0125778355],"study_design_scores_gemma":[0.00053804193,0.00013932645,0.00015708656,0.00048550015,0.00003681548,0.000005490093,0.00022776847,0.86431366,0.13348016,0.0001377352,0.0002946309,0.00018380333],"about_ca_topic_score_codex":0.000035994977,"about_ca_topic_score_gemma":0.000007639937,"teacher_disagreement_score":0.99278647,"about_ca_system_score_codex":0.00061865617,"about_ca_system_score_gemma":0.00012576356,"threshold_uncertainty_score":0.79305375},"labels":[],"label_agreement":null},{"id":"W4417361392","doi":"10.1145/3785294","title":"Machine Learning-Driven Flip-Flop Timing Model and its Application in Resolving Marginal Timing Violations","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Low-power high-performance VLSI design","field":"Engineering","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":"Microsemi (Canada)","funders":"Semiconductor Research Corporation","keywords":"Leverage (statistics); Static timing analysis; Benchmark (surveying); Waiver; Monte Carlo method; Limit (mathematics)","score_opus":0.016348809361330874,"score_gpt":0.23853613289864317,"score_spread":0.2221873235373123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417361392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04559264,0.001274092,0.95133555,0.000069559974,0.000110292654,0.0008665046,0.000005810833,0.0004269298,0.00031864803],"genre_scores_gemma":[0.99427676,0.00033713828,0.004653135,0.000007789845,0.000014142195,0.00033255917,0.000015253424,0.000040592677,0.00032262216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983753,0.00012873232,0.00059386436,0.00029085143,0.00022676057,0.0003844926],"domain_scores_gemma":[0.9991435,0.0002794874,0.00011589254,0.000332446,0.00008376763,0.00004493948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005317872,0.00023624509,0.00030690653,0.0008277883,0.00019306267,0.000044392258,0.00023303214,0.00016360528,0.000010628803],"category_scores_gemma":[0.00004106028,0.00027092724,0.000048788374,0.0007905286,0.000020208468,0.00041027198,0.0000056942094,0.00043901085,0.000016995642],"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.000022595228,0.000031339274,0.000090894,0.00017326619,0.000054503795,3.0998243e-7,0.00032822473,0.9697169,0.023216782,0.0011097739,0.000014678314,0.0052407244],"study_design_scores_gemma":[0.00056239613,0.00007560294,0.0002940046,0.00030181216,0.000047364138,0.000006824241,0.00005320131,0.9923612,0.0057919812,0.00018761831,0.00011315671,0.00020482205],"about_ca_topic_score_codex":0.00003194816,"about_ca_topic_score_gemma":0.000029796824,"teacher_disagreement_score":0.94868416,"about_ca_system_score_codex":0.00050988916,"about_ca_system_score_gemma":0.00011361971,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null}]}