{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.213156,0.00031795542,0.76366097,0.0001707389,0.000059822436,0.00013138985,0.00013386276,0.0068295468,0.015539745],"genre_scores_gemma":[0.8261179,0.00018514035,0.16747805,0.00005453362,0.00001500523,0.00016388719,0.00021396497,0.00059487,0.00517679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998723,0.00002427049,0.0000059988033,0.000019885922,0.000049362156,0.000028146316],"domain_scores_gemma":[0.9998468,0.00006432143,0.000024273922,0.000024420133,0.0000356246,0.0000045058428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013111216,0.0004373832,0.0002456349,0.0003118817,0.00019760737,0.0002784663,0.0003674946,0.00019142748,0.0025984107],"category_scores_gemma":[0.00054901274,0.00011954259,0.00032720258,0.00032875568,0.00020737352,0.0002399146,0.00029667723,0.0003063257,0.00030095445],"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.00023451984,0.00016013313,0.0008731063,0.00021008695,0.00004270989,0.00019299837,0.00013623622,0.6535004,0.092748955,0.014578781,0.0024971128,0.23482497],"study_design_scores_gemma":[0.000041712916,0.00014191803,0.00024088402,0.000006428323,0.000020197593,0.000060486756,0.00003264958,0.9441022,0.046966985,0.003188877,0.005191591,0.000006053866],"about_ca_topic_score_codex":0.0011950441,"about_ca_topic_score_gemma":0.0011317278,"teacher_disagreement_score":0.0025984107,"about_ca_system_score_codex":0.00021992528,"about_ca_system_score_gemma":0.00046246403,"threshold_uncertainty_score":0.008692503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12226742,0.0019350235,0.71008074,0.0006050537,0.00063464127,0.0003572887,0.0015555397,0.09207809,0.07048616],"genre_scores_gemma":[0.6398512,0.000986099,0.33059803,0.0002617504,0.000083293686,0.00028124396,0.002175224,0.004368158,0.021394992],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906915,0.00017581625,0.00004221941,0.00016071458,0.0003742718,0.00017790095],"domain_scores_gemma":[0.9977448,0.0010899543,0.00010749371,0.00057946576,0.00039601658,0.00008219419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979911,0.0015034261,0.00048081393,0.0014828079,0.00044712,0.0017695592,0.0015608461,0.00057991565,0.03835133],"category_scores_gemma":[0.005115234,0.00053572713,0.00046550564,0.0008458549,0.000441144,0.0029146327,0.0015478801,0.0010032658,0.006180975],"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.0015382803,0.00018484799,0.00844498,0.0008768965,0.0001096095,0.0005117405,0.00045812665,0.063182175,0.05963715,0.039613646,0.066651225,0.7587913],"study_design_scores_gemma":[0.0005739012,0.0009121689,0.004911767,0.0002855032,0.0001553138,0.0013196121,0.00044089946,0.51564693,0.20735073,0.029190304,0.23904915,0.00016380267],"about_ca_topic_score_codex":0.0019184055,"about_ca_topic_score_gemma":0.002820398,"teacher_disagreement_score":0.03835133,"about_ca_system_score_codex":0.0009126711,"about_ca_system_score_gemma":0.0010654096,"threshold_uncertainty_score":0.12829798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013434651,0.00013957293,0.98122,0.000070222864,0.000023722298,0.00013885216,0.00010207646,0.003998903,0.00087190385],"genre_scores_gemma":[0.32380772,0.00019631934,0.672349,0.00018566873,0.000052693904,0.00041627086,0.0006675885,0.00089909445,0.0014256836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960771,0.0013193026,0.00041678658,0.00040745473,0.0015785376,0.00020076722],"domain_scores_gemma":[0.98291415,0.010089993,0.0017054474,0.00346316,0.001675047,0.00015216455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022699838,0.00094851514,0.0006675527,0.0018633788,0.00039913587,0.0008629145,0.0014201947,0.0007075138,0.0043084444],"category_scores_gemma":[0.015478094,0.0005327338,0.00079745,0.0014792898,0.0009236544,0.0014843802,0.0012550033,0.000971409,0.0010642974],"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.0009110226,0.0003498535,0.0037068285,0.00071877276,0.00014979746,0.0011832593,0.0007617172,0.12526734,0.1531346,0.044624586,0.005335247,0.663857],"study_design_scores_gemma":[0.00021354444,0.00078409316,0.002456336,0.00015488024,0.00016623578,0.0012985053,0.00015520597,0.7704379,0.17853554,0.031158552,0.014560146,0.00007904129],"about_ca_topic_score_codex":0.00083952956,"about_ca_topic_score_gemma":0.0009759738,"teacher_disagreement_score":0.0043084444,"about_ca_system_score_codex":0.0005710263,"about_ca_system_score_gemma":0.0006038521,"threshold_uncertainty_score":0.014413118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18792032,0.0005477214,0.79156095,0.00013791432,0.00003058848,0.00008072291,0.00017344006,0.00036310297,0.01918522],"genre_scores_gemma":[0.8619366,0.0003521743,0.13452663,0.000056439418,0.000028845054,0.00008274321,0.000110127454,0.00004937361,0.00285702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.00006958345,0.000025478226,0.00009732251,0.00013492293,0.00009319405],"domain_scores_gemma":[0.99958926,0.00015018893,0.000092143295,0.000071983966,0.00006856317,0.000027888984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043565777,0.0005160425,0.00055484334,0.0004077653,0.00033401928,0.000646948,0.00060245144,0.0004036189,0.0030394457],"category_scores_gemma":[0.0015389954,0.00034262237,0.00035848448,0.00044325794,0.00065388816,0.0013522215,0.0007814986,0.00038506696,0.00027400366],"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.00047645578,0.00007508795,0.0017907557,0.00032633194,0.00004480274,0.00014781965,0.00014804919,0.6327746,0.04337158,0.21103597,0.0017636728,0.10804481],"study_design_scores_gemma":[0.000049266368,0.00037038792,0.0008381919,0.00003732959,0.000039819806,0.00023512119,0.000039802188,0.90308475,0.0194264,0.07030918,0.005543408,0.00002634535],"about_ca_topic_score_codex":0.0010144231,"about_ca_topic_score_gemma":0.0020583565,"teacher_disagreement_score":0.0030394457,"about_ca_system_score_codex":0.0009744954,"about_ca_system_score_gemma":0.00069482176,"threshold_uncertainty_score":0.010167956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04782797,0.00017966106,0.94821125,0.00009685039,0.000012308144,0.000056091954,0.00006113377,0.00025328997,0.0033014123],"genre_scores_gemma":[0.5040058,0.0003658136,0.492933,0.000042671894,0.000026522379,0.00015668984,0.0002002592,0.000076567776,0.0021926912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976474,0.000061317776,0.000013618487,0.000042442323,0.000079380545,0.000038506954],"domain_scores_gemma":[0.9997278,0.00015368832,0.00005367491,0.00002304851,0.000033424876,0.000008434892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030169188,0.0004814714,0.0003826744,0.0004822844,0.00028138407,0.0004658352,0.0004712027,0.00036834867,0.0016867917],"category_scores_gemma":[0.0011424419,0.0003764582,0.0004775474,0.000580612,0.0003853545,0.00052460236,0.00030181644,0.00039408542,0.00021273577],"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.00007349032,0.000049290815,0.00034933342,0.00014627623,0.000014802298,0.00009168025,0.0000674793,0.86782426,0.022582432,0.030702619,0.0007460763,0.077352256],"study_design_scores_gemma":[0.000015968137,0.000052716347,0.00010105349,0.000008236258,0.000007543893,0.00002033831,0.000015343,0.984704,0.0053057503,0.008827141,0.00093794527,0.0000040302302],"about_ca_topic_score_codex":0.0022270903,"about_ca_topic_score_gemma":0.003970082,"teacher_disagreement_score":0.0022270903,"about_ca_system_score_codex":0.0007077981,"about_ca_system_score_gemma":0.0013178593,"threshold_uncertainty_score":0.0056428313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35377648,0.00060329924,0.6421938,0.0001309343,0.00007098173,0.00019471903,0.00012998353,0.0014689296,0.0014309123],"genre_scores_gemma":[0.8957478,0.00020227261,0.102824256,0.000061504026,0.000021921323,0.0001083368,0.0000871018,0.000058613386,0.00088822487],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988682,0.00025556076,0.00007195249,0.00013605686,0.000571071,0.00009713572],"domain_scores_gemma":[0.99627113,0.0016800212,0.0009964302,0.0004545541,0.0004905179,0.00010728991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354557,0.0006629384,0.0003350124,0.00083717925,0.0002484979,0.00050247874,0.0013094104,0.000532601,0.0016185682],"category_scores_gemma":[0.003964996,0.00038293828,0.0003041223,0.00048728526,0.0005160971,0.0014591813,0.00047386857,0.0004899402,0.0002461223],"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.0006088259,0.00015434882,0.0069551496,0.00045429193,0.000106168714,0.00044285975,0.0002297664,0.018170549,0.866829,0.0058656293,0.0006970458,0.099486426],"study_design_scores_gemma":[0.00017200081,0.0043605277,0.0041371356,0.000042430835,0.00013056412,0.001439095,0.00010071938,0.14912419,0.83018225,0.00279531,0.0074441857,0.00007164012],"about_ca_topic_score_codex":0.00040830055,"about_ca_topic_score_gemma":0.0007101619,"teacher_disagreement_score":0.0016185682,"about_ca_system_score_codex":0.00047678823,"about_ca_system_score_gemma":0.00049774745,"threshold_uncertainty_score":0.0054146647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13598458,0.0003805946,0.86120075,0.00014820686,0.000018690087,0.000015939073,0.00010721332,0.0013879508,0.0007560327],"genre_scores_gemma":[0.936299,0.0001980548,0.0625601,0.00004600121,0.000015928917,0.000033422322,0.00015094958,0.000079690166,0.00061677024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979514,0.000044568846,0.000009064923,0.00004802781,0.00007960363,0.000023635306],"domain_scores_gemma":[0.9994562,0.00024974524,0.00010421988,0.0000915878,0.000082270264,0.000015824764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040395244,0.0006193875,0.0003493077,0.0003467187,0.00020732192,0.0003543078,0.00057939073,0.00041227488,0.0005056978],"category_scores_gemma":[0.0016927264,0.0003695579,0.0003863156,0.00034525304,0.00030488058,0.00059593166,0.00036770452,0.0004588383,0.00018207887],"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.000039722887,0.00002285006,0.0013373211,0.000012488136,0.000014896522,0.000013979155,0.000009640159,0.96909374,0.007860116,0.0005064441,0.00015978962,0.020928944],"study_design_scores_gemma":[6.2762257e-7,0.0000075113044,0.00019766725,4.639465e-7,0.0000017120889,0.0000027213173,8.313522e-7,0.9976943,0.0018364637,0.00021722424,0.000038973467,0.0000015131988],"about_ca_topic_score_codex":0.0036363616,"about_ca_topic_score_gemma":0.005072102,"teacher_disagreement_score":0.0036363616,"about_ca_system_score_codex":0.0006973739,"about_ca_system_score_gemma":0.00058519596,"threshold_uncertainty_score":0.007230401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05021618,0.00017736411,0.9455443,0.00007197259,0.00005017888,0.00003052968,0.00003006078,0.0007026329,0.003176814],"genre_scores_gemma":[0.53934175,0.00028120974,0.4557886,0.00011841105,0.00002900288,0.00003844277,0.0001299151,0.00008807462,0.004184588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.000042180513,0.000012398612,0.00002830869,0.00006915884,0.000020718844],"domain_scores_gemma":[0.9998165,0.000053523247,0.000040254476,0.000048737096,0.00003155178,0.000009450064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018080694,0.00023525736,0.00018013996,0.00022391453,0.00021797899,0.00029401376,0.00058653246,0.00025425674,0.0015357748],"category_scores_gemma":[0.0003877734,0.00010881657,0.00020939537,0.00019697436,0.00017310784,0.00047173435,0.00022811574,0.00026111264,0.00026718128],"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.00024364675,0.00010179005,0.001335246,0.00026142932,0.00005571297,0.0006225026,0.000080938924,0.43895087,0.18371636,0.06997307,0.0034086606,0.30124977],"study_design_scores_gemma":[0.00002133585,0.00022503697,0.00025978827,0.000008499539,0.000021084223,0.00029522524,0.000015778001,0.94995415,0.03604026,0.007331014,0.00581325,0.0000145961885],"about_ca_topic_score_codex":0.000501949,"about_ca_topic_score_gemma":0.0014301166,"teacher_disagreement_score":0.0015357748,"about_ca_system_score_codex":0.00025193367,"about_ca_system_score_gemma":0.00032536045,"threshold_uncertainty_score":0.005137682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056986142,0.00041926728,0.9321358,0.0013961548,0.000067123656,0.00028930808,0.00055774633,0.0007400433,0.007408417],"genre_scores_gemma":[0.629181,0.0008628616,0.3628419,0.0005317029,0.00021539922,0.00039839666,0.0017712151,0.0003029637,0.0038945535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956874,0.0017159051,0.00026400163,0.00077948923,0.0011762368,0.00037694426],"domain_scores_gemma":[0.9798322,0.016362678,0.0013137491,0.0013506827,0.0009792257,0.00016154312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028414528,0.0011209148,0.000737768,0.0014545372,0.0010000688,0.0026532665,0.0014358665,0.0014892458,0.0071221096],"category_scores_gemma":[0.020875078,0.0010075081,0.0019446589,0.0017854288,0.0037055395,0.0070158476,0.0019294966,0.0026766493,0.0005631145],"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.00040090873,0.0002588165,0.0034535306,0.001076143,0.000262441,0.00090086006,0.00066619157,0.45049882,0.010503491,0.36306325,0.008603513,0.16031207],"study_design_scores_gemma":[0.00009265935,0.000109294204,0.00028978052,0.00008378255,0.00008268185,0.0002530996,0.0001687627,0.533931,0.008074993,0.45314503,0.0037335258,0.00003539631],"about_ca_topic_score_codex":0.0031087748,"about_ca_topic_score_gemma":0.0042424193,"teacher_disagreement_score":0.0071221096,"about_ca_system_score_codex":0.0018238235,"about_ca_system_score_gemma":0.002551785,"threshold_uncertainty_score":0.023825824},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015347325,0.041722193,0.39713994,0.008649098,0.05575876,0.0010108377,0.0048901928,0.0054067923,0.4700748],"genre_scores_gemma":[0.09022108,0.042162552,0.12907429,0.0020584604,0.0046398807,0.0005492987,0.010501817,0.0017623944,0.71903026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812573,0.00034696626,0.00019051712,0.0002248607,0.000960851,0.0001511483],"domain_scores_gemma":[0.99767405,0.0007057323,0.00007530133,0.00071429065,0.0006683514,0.0001622959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020203663,0.00126758,0.0012614795,0.0012833617,0.0004947416,0.0032101215,0.00086876954,0.0013342764,0.1892154],"category_scores_gemma":[0.0041309227,0.0005332472,0.00073553855,0.0015393449,0.0008420793,0.0016247536,0.0015206835,0.0022431337,0.052310415],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027750837,0.00014825676,0.0010196747,0.0005896625,0.00011949585,0.00023746736,0.00013504185,0.0041998033,0.0058983294,0.02468765,0.5102747,0.45241246],"study_design_scores_gemma":[0.000032404496,0.00012858587,0.0008666556,0.0001353795,0.000036636135,0.00032867602,0.00005264958,0.009208234,0.0019661146,0.01184679,0.9753812,0.000016607992],"about_ca_topic_score_codex":0.0015491843,"about_ca_topic_score_gemma":0.0026574982,"teacher_disagreement_score":0.1892154,"about_ca_system_score_codex":0.00058258785,"about_ca_system_score_gemma":0.00087834115,"threshold_uncertainty_score":0.6329886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031314185,0.000031407497,0.9941631,0.000024297668,0.000012728512,0.00001816212,0.000011774622,0.000689169,0.0019179932],"genre_scores_gemma":[0.16683127,0.00012240533,0.8275665,0.00009857038,0.000032351545,0.000092229995,0.000097297125,0.00046563038,0.004693753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999566,0.00008560329,0.000019866164,0.00010889316,0.00017359808,0.00004590836],"domain_scores_gemma":[0.9996426,0.00014184011,0.000047993064,0.00009534416,0.0000623525,0.000009895743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032729117,0.0009981142,0.00059207587,0.0007058198,0.0003428596,0.0006568184,0.0009942274,0.00040704914,0.0051876255],"category_scores_gemma":[0.0010338707,0.0003456466,0.0007363064,0.0005694724,0.0005341812,0.0008119096,0.0009977791,0.0008326255,0.0008443218],"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.00006255115,0.000047248835,0.00027497925,0.0001695003,0.00004171652,0.00020460143,0.00017389328,0.4315094,0.06276667,0.036498073,0.0030943225,0.465157],"study_design_scores_gemma":[0.000034463555,0.0001461763,0.00020928447,0.000014805299,0.000032974418,0.00030955058,0.000043422417,0.93079495,0.028218023,0.022071334,0.018097205,0.000027832517],"about_ca_topic_score_codex":0.001110073,"about_ca_topic_score_gemma":0.0015299969,"teacher_disagreement_score":0.0051876255,"about_ca_system_score_codex":0.0004949794,"about_ca_system_score_gemma":0.00049544126,"threshold_uncertainty_score":0.01735437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34192595,0.0036724615,0.634668,0.0004827813,0.0000706391,0.00010719957,0.00019558133,0.0014504316,0.01742701],"genre_scores_gemma":[0.9086273,0.00076817826,0.08656373,0.00008204864,0.000027802464,0.000082812265,0.00011987942,0.00020182587,0.0035265097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.00009496855,0.000014392796,0.00004229072,0.0001634587,0.000097632634],"domain_scores_gemma":[0.99954396,0.00018047485,0.000087564804,0.000048445996,0.000103837425,0.000035752408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068098126,0.0009870271,0.00040638904,0.00077002053,0.00037114514,0.00045564648,0.0006421954,0.00034595962,0.0016129968],"category_scores_gemma":[0.0015851469,0.00029965147,0.00037813236,0.00043998676,0.00037968595,0.0006710878,0.00078591827,0.0004318284,0.00024623543],"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.00007698086,0.000055550547,0.00059353403,0.00007507006,0.000021742708,0.000042679465,0.000022975873,0.92437685,0.014075081,0.0048115426,0.0006325706,0.055215374],"study_design_scores_gemma":[0.000013681565,0.00015316614,0.00043680333,0.000013463351,0.000023238726,0.0000359913,0.00002809286,0.9828283,0.008019032,0.006351313,0.0020886501,0.000008194261],"about_ca_topic_score_codex":0.001575092,"about_ca_topic_score_gemma":0.0029379004,"teacher_disagreement_score":0.0016129968,"about_ca_system_score_codex":0.0012561405,"about_ca_system_score_gemma":0.0011382038,"threshold_uncertainty_score":0.009113967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18807241,0.0004876152,0.7998728,0.00017474241,0.000055145098,0.00008012041,0.00013123335,0.0015203602,0.009605569],"genre_scores_gemma":[0.68681073,0.00025055135,0.3094696,0.000058411224,0.000024208899,0.00007866756,0.00025185948,0.00012234852,0.0029335779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970764,0.000050983665,0.000020911626,0.00007569916,0.000074417665,0.0000704123],"domain_scores_gemma":[0.999796,0.00008298667,0.000038848102,0.000041802243,0.000026797738,0.000013543752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002276553,0.00043683505,0.00028817588,0.00033523218,0.00027648063,0.00037752328,0.00056743657,0.00021701572,0.001725828],"category_scores_gemma":[0.00060732063,0.00024307497,0.00043898195,0.0004382906,0.00033333662,0.000587429,0.00032755898,0.00034787355,0.00019855739],"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.00020187774,0.000067221794,0.0008896669,0.00018202026,0.000022115199,0.00024633826,0.00011286342,0.73262143,0.062901,0.036951788,0.002011419,0.1637922],"study_design_scores_gemma":[0.00002455513,0.000106497646,0.0003863541,0.000010744983,0.000011311545,0.000068197434,0.000026075508,0.9733348,0.013184435,0.00997765,0.0028605412,0.000008875062],"about_ca_topic_score_codex":0.002775506,"about_ca_topic_score_gemma":0.0036128296,"teacher_disagreement_score":0.002775506,"about_ca_system_score_codex":0.00073127967,"about_ca_system_score_gemma":0.0008039519,"threshold_uncertainty_score":0.005773425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10117181,0.00026877422,0.8798111,0.000085052634,0.000029822875,0.00006852641,0.0001463995,0.00049909466,0.017919375],"genre_scores_gemma":[0.6987574,0.00033605774,0.2932516,0.00009709512,0.000032744785,0.00015257183,0.00050034176,0.00014745437,0.0067247013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997131,0.000052502968,0.000016425793,0.000055167915,0.0001018587,0.00006082649],"domain_scores_gemma":[0.9998585,0.000035608813,0.000025111838,0.000035432386,0.000034348832,0.000010998206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021782919,0.0004196235,0.00032882462,0.00048185958,0.00024211346,0.00039746612,0.00050113915,0.00027712033,0.0024045762],"category_scores_gemma":[0.00038435456,0.0002387376,0.0006553893,0.00037654958,0.0003444914,0.00058419484,0.00057203136,0.00036998215,0.00041097918],"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.00018302428,0.0000901106,0.00097030913,0.0003931529,0.00005245694,0.00029779127,0.00019491883,0.4519955,0.13410114,0.23736405,0.0038784374,0.17047912],"study_design_scores_gemma":[0.00002984449,0.00022057479,0.0007879156,0.00002717465,0.000041060408,0.0002278954,0.00006597514,0.9002508,0.027526015,0.05230218,0.018498909,0.000021655915],"about_ca_topic_score_codex":0.00084338215,"about_ca_topic_score_gemma":0.0014762221,"teacher_disagreement_score":0.0024045762,"about_ca_system_score_codex":0.0005494195,"about_ca_system_score_gemma":0.00036550115,"threshold_uncertainty_score":0.008044064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012490578,0.00036295704,0.9824232,0.00012085957,0.000024728832,0.00010327369,0.000035176065,0.0006574578,0.0037818248],"genre_scores_gemma":[0.2404155,0.00046215413,0.75233227,0.00018170159,0.00003185216,0.00019251602,0.00015128059,0.00018036841,0.006052378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976474,0.000056361372,0.000013768825,0.000039849736,0.00008873918,0.00003642766],"domain_scores_gemma":[0.9996785,0.00011702993,0.00004050491,0.000074358104,0.00007371496,0.000015829975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037761306,0.00052884145,0.00059141574,0.00078636175,0.0004609494,0.0007263608,0.0013607654,0.0005188616,0.0024605058],"category_scores_gemma":[0.0009366674,0.00027671296,0.00055038993,0.00056264905,0.00051816367,0.0011447498,0.00077511434,0.00062901597,0.000519265],"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.00019600187,0.00011517852,0.0012767607,0.00030591202,0.000059049624,0.0003238281,0.00024620158,0.3222698,0.039042175,0.076676056,0.005350239,0.5541389],"study_design_scores_gemma":[0.00004239322,0.00035628217,0.0004847189,0.000036528378,0.000056332363,0.0004217613,0.00006637347,0.94131917,0.01611133,0.023973562,0.017087972,0.000043593795],"about_ca_topic_score_codex":0.0018109418,"about_ca_topic_score_gemma":0.0042498503,"teacher_disagreement_score":0.0024605058,"about_ca_system_score_codex":0.0005618535,"about_ca_system_score_gemma":0.00077884743,"threshold_uncertainty_score":0.008231223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520302,0.0062902966,0.71881866,0.00057068607,0.0001646764,0.00037272772,0.00028187982,0.0023587737,0.019112114],"genre_scores_gemma":[0.56611085,0.0010005827,0.43031713,0.000108808745,0.000028404818,0.00031148567,0.00032719062,0.0002702121,0.0015253865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679536,0.0015300643,0.00019585063,0.00025210466,0.0010763508,0.00015036452],"domain_scores_gemma":[0.99067396,0.007163456,0.0003857945,0.0008380589,0.00081645016,0.00012232698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052413223,0.0016305735,0.00095858035,0.0018566967,0.00041720437,0.0011065698,0.0010460991,0.001258124,0.0021763658],"category_scores_gemma":[0.012017701,0.00039025844,0.0009857796,0.0013896128,0.0004961809,0.0014151218,0.00086545263,0.0009554552,0.00036556023],"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.0004527189,0.00033752137,0.0015537263,0.0005357601,0.00013990272,0.00002461924,0.00008559638,0.7563212,0.004070528,0.0058170385,0.00074023893,0.22992113],"study_design_scores_gemma":[0.00006454445,0.00056033843,0.00077049143,0.000051335606,0.000029984601,0.000045216584,0.000041795378,0.989435,0.005132971,0.001856193,0.001996178,0.000016039196],"about_ca_topic_score_codex":0.0008857602,"about_ca_topic_score_gemma":0.00130957,"teacher_disagreement_score":0.0052413223,"about_ca_system_score_codex":0.0010694076,"about_ca_system_score_gemma":0.0011674021,"threshold_uncertainty_score":0.02771908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01610445,0.00007333579,0.97418946,0.00013982486,0.000019353669,0.00017390834,0.00019263837,0.0062812134,0.0028257952],"genre_scores_gemma":[0.30795354,0.00007498978,0.6882015,0.00012967702,0.000018625144,0.00038415843,0.00083340093,0.0009052118,0.0014990206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990306,0.00030817644,0.000046106514,0.00020541826,0.00028631423,0.00012347536],"domain_scores_gemma":[0.99734443,0.0019345974,0.00011921335,0.00034633905,0.00020800837,0.00004731598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085341,0.0011494785,0.0005800492,0.0008581276,0.00053020875,0.0008574949,0.001565141,0.0006608388,0.008045942],"category_scores_gemma":[0.0041453363,0.0005577102,0.0010905437,0.0008085111,0.0008435578,0.0014739921,0.0015875159,0.0011090444,0.00088008534],"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.0003586006,0.0002358433,0.0015734197,0.0005464073,0.000076302575,0.00035978926,0.00024140737,0.46036783,0.03256376,0.039222833,0.008367286,0.45608655],"study_design_scores_gemma":[0.000060003505,0.000077338125,0.00012606628,0.000014233975,0.0000150179385,0.0000685472,0.00003296332,0.9611725,0.013543294,0.022352654,0.002527077,0.000010358311],"about_ca_topic_score_codex":0.002670042,"about_ca_topic_score_gemma":0.0067068106,"teacher_disagreement_score":0.008045942,"about_ca_system_score_codex":0.000947165,"about_ca_system_score_gemma":0.0017907176,"threshold_uncertainty_score":0.026916385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017679255,0.00005430929,0.97868025,0.00003707003,0.000011456139,0.00011114589,0.00008051047,0.0021073397,0.0012386019],"genre_scores_gemma":[0.30988675,0.00021675369,0.6866948,0.00007654863,0.000018023891,0.00017042844,0.00032278654,0.0005230159,0.0020908848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881244,0.0001877537,0.000088864166,0.00019541661,0.00060487987,0.00011077776],"domain_scores_gemma":[0.99740916,0.0011935618,0.00023978221,0.00084445206,0.0002843506,0.000028627279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010378477,0.0004935116,0.00033433692,0.00040150495,0.00046958018,0.00060726627,0.0014260508,0.0003593724,0.0031147434],"category_scores_gemma":[0.004233762,0.0005985196,0.0007402922,0.0002845231,0.00096175476,0.0013974028,0.0008855344,0.0011790247,0.0006602395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030305824,0.00013735377,0.0034958234,0.0010882502,0.00010396238,0.00045468836,0.0006624718,0.1669156,0.3352556,0.11554845,0.0035504529,0.3724843],"study_design_scores_gemma":[0.00014347128,0.00038839935,0.0011728919,0.00007409416,0.00012011184,0.0006361586,0.000085242995,0.37581095,0.53557193,0.046243247,0.039697044,0.00005649671],"about_ca_topic_score_codex":0.001933498,"about_ca_topic_score_gemma":0.0028945603,"teacher_disagreement_score":0.0031147434,"about_ca_system_score_codex":0.0006122607,"about_ca_system_score_gemma":0.0020910385,"threshold_uncertainty_score":0.010419786},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012558886,0.0053909775,0.038843352,0.010869292,0.0045165704,0.00031480775,0.0028935892,0.0028203123,0.9217922],"genre_scores_gemma":[0.22294338,0.0072080265,0.028321613,0.005876341,0.0018834873,0.00040155166,0.0053435396,0.0011031635,0.726919],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991658,0.0000820901,0.00003498261,0.00020014295,0.00038733578,0.0001295999],"domain_scores_gemma":[0.99948835,0.000060978502,0.00004432466,0.00010798205,0.00020233063,0.000096042044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047546436,0.00088276365,0.0005786099,0.0017124702,0.0018552417,0.0039351396,0.0014690505,0.0020593188,0.16763207],"category_scores_gemma":[0.0021921813,0.00029846138,0.0006919529,0.0014901225,0.0013959775,0.0027203655,0.0033854353,0.0013181424,0.06209917],"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.00018483063,0.00006187052,0.0023228857,0.0004869339,0.000033988163,0.0006688724,0.0006247658,0.0018577715,0.0055666086,0.33049217,0.3569663,0.30073303],"study_design_scores_gemma":[0.000022705273,0.000031168052,0.0010966321,0.00009205156,0.000009724804,0.00047491776,0.0002272088,0.0011135028,0.0010878599,0.029869441,0.9659535,0.000021273601],"about_ca_topic_score_codex":0.004257396,"about_ca_topic_score_gemma":0.0041024415,"teacher_disagreement_score":0.16763207,"about_ca_system_score_codex":0.00133656,"about_ca_system_score_gemma":0.0015267804,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011210448,0.001511265,0.9404839,0.0004502438,0.00014988038,0.00014495365,0.0008217554,0.001219532,0.044007987],"genre_scores_gemma":[0.82403034,0.0057947002,0.08406798,0.0005028995,0.00026983037,0.00068289,0.0015180559,0.0005812954,0.082552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979466,0.00003678817,0.000012357115,0.00003673404,0.000093244606,0.00002617928],"domain_scores_gemma":[0.99981517,0.00005548825,0.000020185082,0.000026265043,0.000076243545,0.000006662322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017793012,0.00074768596,0.0005490648,0.00044082874,0.00043287693,0.0010164352,0.0016258059,0.0010053158,0.008250108],"category_scores_gemma":[0.0012906479,0.00025538038,0.0006639817,0.0007216109,0.00028206312,0.0012770662,0.0005934231,0.0009886873,0.0031173725],"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.000045744746,0.00003357274,0.00043765505,0.00019116834,0.000017496754,0.00021816729,0.00014255894,0.9052375,0.006271329,0.036205728,0.006232366,0.044966776],"study_design_scores_gemma":[0.0000047242816,0.000024618917,0.00013303419,0.000020496795,0.000005953985,0.00007177429,0.00002442207,0.98087007,0.00091524044,0.009050807,0.008870434,0.000008347775],"about_ca_topic_score_codex":0.007463162,"about_ca_topic_score_gemma":0.005687069,"teacher_disagreement_score":0.008250108,"about_ca_system_score_codex":0.000816321,"about_ca_system_score_gemma":0.0005709172,"threshold_uncertainty_score":0.027599394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050739076,0.00035783334,0.9460776,0.00006370274,0.000023561275,0.0000495611,0.000035577377,0.00050858874,0.0021444848],"genre_scores_gemma":[0.51429486,0.00042317505,0.48357597,0.00005706699,0.000039047984,0.00016448252,0.00007762902,0.00012170437,0.0012461143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996307,0.00009965351,0.000027426391,0.0000632316,0.00012297506,0.000056066165],"domain_scores_gemma":[0.999595,0.00018885889,0.00009662291,0.000041912663,0.00006237499,0.000015294352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000505677,0.000646968,0.00042871982,0.0005727404,0.00026085635,0.00045771847,0.0006155423,0.00026302433,0.0011152575],"category_scores_gemma":[0.001108988,0.00036286275,0.00045237795,0.0005662185,0.000412818,0.0005430329,0.00034805448,0.00031794407,0.00017390806],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017245318,0.00008066347,0.0008157785,0.00028221792,0.000057158228,0.00011644611,0.00011455334,0.6641864,0.08953064,0.03970793,0.001143476,0.20379227],"study_design_scores_gemma":[0.000073418756,0.0002893705,0.00019466793,0.000013556633,0.000044229084,0.000049574865,0.000013556426,0.958975,0.023076776,0.014154677,0.0031041952,0.000010923739],"about_ca_topic_score_codex":0.00078596507,"about_ca_topic_score_gemma":0.0017755404,"teacher_disagreement_score":0.0011152575,"about_ca_system_score_codex":0.00059379387,"about_ca_system_score_gemma":0.0008866624,"threshold_uncertainty_score":0.004308343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03446812,0.0024052914,0.8989,0.0008424446,0.00018087034,0.00021230489,0.0017378462,0.0013448931,0.05990831],"genre_scores_gemma":[0.79625684,0.0043976433,0.10279456,0.0007542309,0.00015897902,0.0008246012,0.0019135529,0.0007017294,0.09219783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.00003702121,0.000011693685,0.00004341732,0.00014409628,0.00003744071],"domain_scores_gemma":[0.99976987,0.00009741571,0.000021761542,0.00003927836,0.00006308637,0.000008532059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023129971,0.000759689,0.00053205254,0.0004678694,0.0004674131,0.00074412575,0.0013828422,0.0011098181,0.007723582],"category_scores_gemma":[0.0010266795,0.0004595788,0.0009187708,0.00077771273,0.0003673405,0.0017089668,0.00035643607,0.0008088779,0.0022768257],"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.000016256981,0.000013662284,0.00013562539,0.000038613773,0.000010402741,0.000054996504,0.000020276066,0.9720334,0.0024528299,0.015012864,0.001653142,0.0085579],"study_design_scores_gemma":[0.000005548664,0.000029247589,0.0001177424,0.000005233123,0.0000063359084,0.000040792955,0.000004218388,0.99069864,0.0005570142,0.004770044,0.0037599697,0.0000051894976],"about_ca_topic_score_codex":0.0050430377,"about_ca_topic_score_gemma":0.005252803,"teacher_disagreement_score":0.007723582,"about_ca_system_score_codex":0.00089537376,"about_ca_system_score_gemma":0.0007048482,"threshold_uncertainty_score":0.025837898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028187234,0.00007516791,0.9589319,0.00008945398,0.000082591716,0.00016486639,0.00024627533,0.007231666,0.0049908394],"genre_scores_gemma":[0.51761305,0.00011190691,0.4762763,0.00012958175,0.000033827673,0.00038591228,0.00074300746,0.000813948,0.003892403],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858403,0.0003213707,0.00017059049,0.00022646926,0.000575147,0.00012230215],"domain_scores_gemma":[0.996443,0.0015961295,0.00026589146,0.00081901427,0.0008061152,0.00006997865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475917,0.00054092676,0.00041267634,0.00079502387,0.0004708291,0.0010442551,0.0008995703,0.000457571,0.0035853325],"category_scores_gemma":[0.00427346,0.00045379717,0.0008514694,0.00030722917,0.00089069887,0.0011812528,0.0008135181,0.0008462645,0.0011742449],"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.00065063604,0.00033567642,0.0029052866,0.0008812744,0.00015989084,0.00125305,0.00078687444,0.24137636,0.25497192,0.2433281,0.008455951,0.24489507],"study_design_scores_gemma":[0.00010015963,0.00017436894,0.0002736724,0.00006066623,0.00008985293,0.00018576333,0.000046089055,0.77187455,0.1838554,0.03144341,0.0118588405,0.000037268637],"about_ca_topic_score_codex":0.0011498694,"about_ca_topic_score_gemma":0.0021038884,"teacher_disagreement_score":0.0035853325,"about_ca_system_score_codex":0.00060427125,"about_ca_system_score_gemma":0.0014670962,"threshold_uncertainty_score":0.011994123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007500799,0.0015473859,0.98278666,0.0001455047,0.00009638346,0.00009822673,0.00009135102,0.0006065073,0.0071270904],"genre_scores_gemma":[0.123541,0.0032426515,0.8664134,0.00011138374,0.000112070884,0.00025768476,0.00020902844,0.0001686277,0.0059441384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.00006992972,0.00004707682,0.00007805526,0.0003527504,0.00003361805],"domain_scores_gemma":[0.9994848,0.00021665117,0.000083482904,0.00013030678,0.00007219402,0.000012553064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047855146,0.0006288712,0.00048497668,0.0009790909,0.00045340264,0.0005542091,0.0007890088,0.0005108441,0.0035192322],"category_scores_gemma":[0.001206037,0.00044712468,0.0006647726,0.00057671644,0.0005848004,0.0010240824,0.00049965887,0.00133843,0.0010099347],"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.00008781002,0.000076927376,0.0002684361,0.001295057,0.000075455515,0.00036347748,0.00029519893,0.063668825,0.2549432,0.20337811,0.0024650733,0.47308245],"study_design_scores_gemma":[0.00007122767,0.0004420803,0.0004814395,0.0002143916,0.00010171959,0.0020360854,0.00007682497,0.30749822,0.43803748,0.119053565,0.13186142,0.00012556106],"about_ca_topic_score_codex":0.00027713328,"about_ca_topic_score_gemma":0.0007207237,"teacher_disagreement_score":0.0035192322,"about_ca_system_score_codex":0.00062550016,"about_ca_system_score_gemma":0.0004031853,"threshold_uncertainty_score":0.01177305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3136017,0.001123452,0.67653143,0.00029997597,0.000021749793,0.00015235606,0.00018125026,0.0024416198,0.0056465184],"genre_scores_gemma":[0.8211796,0.00018634189,0.17657419,0.00006701102,0.000014739234,0.00008984622,0.0003469271,0.0001326168,0.0014085335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.00019323699,0.000026844564,0.000050991515,0.00012365916,0.00007943904],"domain_scores_gemma":[0.99902177,0.00048615277,0.00017301163,0.000094468094,0.00018732905,0.00003719163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607987,0.000675973,0.00047293803,0.0007637292,0.00023548312,0.00032270435,0.000555754,0.00024454668,0.0012693729],"category_scores_gemma":[0.0015184776,0.00019390674,0.00037352776,0.0007432983,0.00029930857,0.0005031082,0.00041286973,0.0003059854,0.00017150644],"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.0002780056,0.00010476658,0.002287839,0.00012957702,0.000039945142,0.0001308802,0.00007654543,0.6432803,0.05401881,0.0044069383,0.0018633555,0.29338306],"study_design_scores_gemma":[0.000025739155,0.00014889771,0.0010573205,0.000005282754,0.000021687132,0.00007774894,0.000024939513,0.9834221,0.012687175,0.0017059114,0.00081767316,0.0000054919487],"about_ca_topic_score_codex":0.0024851866,"about_ca_topic_score_gemma":0.004499582,"teacher_disagreement_score":0.0024851866,"about_ca_system_score_codex":0.00090899447,"about_ca_system_score_gemma":0.0008689719,"threshold_uncertainty_score":0.0065953135},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076861368,0.0006671055,0.9506609,0.00041196088,0.00027864752,0.00018346148,0.0008316903,0.016282814,0.02299725],"genre_scores_gemma":[0.16932596,0.0008834017,0.7987484,0.0005502161,0.00016180893,0.00018714005,0.0028164552,0.002994806,0.024331817],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898213,0.0001493256,0.00006996962,0.00022851402,0.00040916714,0.00016075178],"domain_scores_gemma":[0.9989291,0.00032967026,0.00007839823,0.0003952378,0.00022453448,0.000043056174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084043917,0.001197911,0.0010587389,0.0008332974,0.0007650495,0.0017059385,0.002458283,0.0012607318,0.029957322],"category_scores_gemma":[0.0027049105,0.0004958393,0.0012694147,0.0009408299,0.00065744127,0.0020933792,0.003003706,0.0011625738,0.010390888],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040235292,0.00011862451,0.0010463671,0.0009879811,0.00008346779,0.00038966135,0.00017058862,0.1262206,0.011114105,0.08982289,0.06451672,0.7051266],"study_design_scores_gemma":[0.00020055006,0.00039089596,0.00075325684,0.00018872053,0.00008021058,0.001175981,0.00027277632,0.6324929,0.038782015,0.13585912,0.1897023,0.00010130559],"about_ca_topic_score_codex":0.00174091,"about_ca_topic_score_gemma":0.0030721258,"teacher_disagreement_score":0.9700427,"about_ca_system_score_codex":0.0006608992,"about_ca_system_score_gemma":0.0011545093,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39951766,0.0012203287,0.5926948,0.00026577784,0.000044580967,0.00016565231,0.000106468746,0.0004899733,0.0054947427],"genre_scores_gemma":[0.83778685,0.00031061246,0.16041699,0.000044050223,0.000009517075,0.00008676258,0.00008368891,0.00007968094,0.0011818737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.00008599988,0.000012000994,0.000036547262,0.00006830885,0.00007984187],"domain_scores_gemma":[0.99956137,0.00024902518,0.00006786415,0.000029505185,0.000056124976,0.000036037876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567213,0.000965049,0.00057067815,0.0005473783,0.00040854423,0.0007011333,0.00066889735,0.0003824499,0.000897141],"category_scores_gemma":[0.0015800069,0.00031406197,0.00041349657,0.00052897324,0.00037251305,0.00070877286,0.00048014958,0.00034331865,0.00008895589],"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.00010418048,0.000070567774,0.00043753165,0.00009066597,0.0000233444,0.00005497449,0.000034329303,0.9628021,0.0063631767,0.0017614147,0.00026944902,0.027988382],"study_design_scores_gemma":[0.000020579006,0.00008981325,0.00023133484,0.0000061598807,0.000015494477,0.000017885319,0.00003364408,0.9943585,0.0034488454,0.0014387413,0.00033458404,0.0000044215767],"about_ca_topic_score_codex":0.0055744615,"about_ca_topic_score_gemma":0.008147874,"teacher_disagreement_score":0.0055744615,"about_ca_system_score_codex":0.00094698404,"about_ca_system_score_gemma":0.0017505324,"threshold_uncertainty_score":0.01108402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09430217,0.00097579026,0.90070677,0.00017680951,0.00007336477,0.0001210319,0.000044344033,0.0010431518,0.0025566218],"genre_scores_gemma":[0.61941516,0.00038369113,0.37811378,0.00006091609,0.000033347253,0.00008289361,0.00010275411,0.00011005502,0.00169733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993236,0.00024956666,0.000038325717,0.00010057522,0.00018210898,0.00010581203],"domain_scores_gemma":[0.9979971,0.0011563362,0.0003046354,0.0001823765,0.00026874107,0.0000906993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011387662,0.000700073,0.00038702923,0.0011409606,0.00077809155,0.00065736665,0.0008997452,0.00039072303,0.0017403506],"category_scores_gemma":[0.0037639188,0.00035994966,0.00032266192,0.0007031859,0.00046686656,0.0011223033,0.0006209263,0.00045637507,0.0002198364],"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.00050667115,0.00014400561,0.0024425392,0.00029220755,0.00008137994,0.00024288426,0.000346897,0.6648794,0.030645775,0.016780697,0.002164978,0.28147265],"study_design_scores_gemma":[0.000037134647,0.0001598855,0.0003577362,0.000016015585,0.000029632536,0.000100923666,0.00007180932,0.98077434,0.00706788,0.009374853,0.0019941824,0.00001567587],"about_ca_topic_score_codex":0.0024594222,"about_ca_topic_score_gemma":0.00441626,"teacher_disagreement_score":0.0024594222,"about_ca_system_score_codex":0.0009258347,"about_ca_system_score_gemma":0.0012944661,"threshold_uncertainty_score":0.0067174435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04454263,0.00012739009,0.94765127,0.00008977487,0.000039690978,0.00006764758,0.000073668125,0.0009698081,0.00643813],"genre_scores_gemma":[0.8307527,0.000088065775,0.16680138,0.00003821095,0.000010596144,0.000109058186,0.000093274226,0.00013355158,0.0019731962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00014960699,0.000028934017,0.00007294726,0.00018494095,0.00009339515],"domain_scores_gemma":[0.999311,0.00025470444,0.00011162085,0.00013113413,0.00015330446,0.00003824688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999645,0.00071799866,0.00039585412,0.00042956093,0.00030498902,0.0009065886,0.0013554352,0.0003954287,0.002569395],"category_scores_gemma":[0.0015832771,0.00034973156,0.0005013167,0.0002527811,0.0003393524,0.00078779616,0.0006199837,0.00069733994,0.00034356932],"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.00010005743,0.000042990847,0.0003762694,0.000053920856,0.00001668354,0.00005542141,0.000037097874,0.95154613,0.0075496417,0.017273081,0.00038675053,0.022561945],"study_design_scores_gemma":[0.0000100662555,0.000022630722,0.00003083307,0.0000025619217,0.000006004522,0.0000049374053,0.000004786944,0.99605125,0.0018731039,0.0014848061,0.00050664996,0.00000243254],"about_ca_topic_score_codex":0.003634168,"about_ca_topic_score_gemma":0.0062695285,"teacher_disagreement_score":0.003634168,"about_ca_system_score_codex":0.00080695096,"about_ca_system_score_gemma":0.0015070739,"threshold_uncertainty_score":0.008595526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5003409,0.0034837467,0.477207,0.0005937661,0.00024938097,0.00031920717,0.0005430575,0.012146863,0.0051160897],"genre_scores_gemma":[0.9711902,0.00024319832,0.026290448,0.00013105533,0.00003769282,0.000060572416,0.00024313896,0.000069903115,0.0017336069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999466,0.00006191695,0.000071118986,0.00008703291,0.00022344047,0.000090575886],"domain_scores_gemma":[0.998403,0.00022615759,0.00013348847,0.0005829258,0.00056598685,0.00008838832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004157656,0.0005325033,0.0004979885,0.00070112693,0.00071140524,0.000757856,0.002467834,0.00045986427,0.0011438074],"category_scores_gemma":[0.0015760883,0.00028973678,0.00025712873,0.0007941006,0.00037148618,0.0018101075,0.0010053704,0.00042820277,0.0003464139],"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.0017836164,0.00056836265,0.021102106,0.00062794343,0.00016072768,0.001223072,0.0007829198,0.0862698,0.4004885,0.009625407,0.015680265,0.46168736],"study_design_scores_gemma":[0.00012499458,0.00056975725,0.003932144,0.00004092624,0.00012944757,0.0010281926,0.00021156565,0.83080333,0.14763156,0.0030749016,0.012327084,0.00012606614],"about_ca_topic_score_codex":0.00350981,"about_ca_topic_score_gemma":0.0057190293,"teacher_disagreement_score":0.00350981,"about_ca_system_score_codex":0.0010660051,"about_ca_system_score_gemma":0.0010677014,"threshold_uncertainty_score":0.007734418},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028827884,0.000087383094,0.9946713,0.000061619336,0.000019073203,0.000028029483,0.000019579513,0.0005885141,0.0016418234],"genre_scores_gemma":[0.11236536,0.0001402109,0.8842909,0.00014362369,0.000033410535,0.00016254793,0.00016543933,0.00015441833,0.0025442145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.0000690061,0.0000195771,0.00008778184,0.00011215792,0.000050597235],"domain_scores_gemma":[0.9996953,0.00015317093,0.00004070277,0.000026292568,0.00006818915,0.000016328415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046983204,0.0008816482,0.00082478934,0.0007291718,0.00042404135,0.0009005573,0.0012094894,0.0006577812,0.004342258],"category_scores_gemma":[0.0009774044,0.0005003175,0.00064038043,0.00083563675,0.00032685618,0.0010207628,0.00080865866,0.0012112684,0.0007963489],"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.00011585132,0.00009797747,0.00037722327,0.000117580814,0.000039802784,0.000085205356,0.00005908851,0.67334896,0.008855174,0.013206185,0.0040242197,0.29967278],"study_design_scores_gemma":[0.00001221814,0.00002156703,0.000021498934,0.0000027587766,0.0000045865067,0.000012820116,0.0000052079495,0.9971649,0.0006579524,0.0014548363,0.00063822005,0.0000034360326],"about_ca_topic_score_codex":0.0031136863,"about_ca_topic_score_gemma":0.00402467,"teacher_disagreement_score":0.004342258,"about_ca_system_score_codex":0.0006312825,"about_ca_system_score_gemma":0.0010243537,"threshold_uncertainty_score":0.014526308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008126685,0.00006494866,0.9881517,0.00016288072,0.000014445421,0.00010754871,0.00008323181,0.00059421326,0.0026942932],"genre_scores_gemma":[0.44485447,0.00021926886,0.55097675,0.00025426343,0.00005751159,0.0003006071,0.00049791194,0.0004902374,0.0023489622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829286,0.00049948395,0.000099848876,0.00027138166,0.0006126208,0.0002238266],"domain_scores_gemma":[0.9939711,0.003981771,0.00048865954,0.0007680252,0.0006825025,0.00010797275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019621733,0.0011113881,0.00081473996,0.00066261156,0.00052214245,0.0013298121,0.0013758714,0.0009036909,0.004461053],"category_scores_gemma":[0.009039541,0.00049842446,0.0007680653,0.00074885285,0.0012685589,0.0019422383,0.0015101568,0.0016489743,0.0009820478],"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.00016073303,0.000092728595,0.0008111983,0.0002904636,0.000026486336,0.0002599631,0.00024296874,0.6921012,0.019424397,0.15912353,0.0043648626,0.12310145],"study_design_scores_gemma":[0.000047603397,0.00006494907,0.00011202711,0.000030457075,0.000007398621,0.00009138688,0.00004136249,0.9153509,0.015559084,0.06459988,0.004079537,0.000015425227],"about_ca_topic_score_codex":0.0017125999,"about_ca_topic_score_gemma":0.0016991785,"teacher_disagreement_score":0.004461053,"about_ca_system_score_codex":0.001181386,"about_ca_system_score_gemma":0.0019116811,"threshold_uncertainty_score":0.014923692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013954508,0.00017284225,0.98439467,0.00011480301,0.000019413532,0.000035218058,0.00010581255,0.0002498596,0.00095269986],"genre_scores_gemma":[0.86818117,0.0007509859,0.12435562,0.00015335131,0.00010460773,0.00047352482,0.00041702128,0.000102177764,0.0054614265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942195,0.00018317449,0.000029458279,0.00011598128,0.00016178648,0.0000877329],"domain_scores_gemma":[0.99818593,0.0012803747,0.00019787067,0.00011811545,0.00018017669,0.000037487804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096156914,0.00061390526,0.00079957297,0.00060927996,0.00035805823,0.0007001864,0.0015196104,0.0008249631,0.0025493745],"category_scores_gemma":[0.0036542309,0.0005513022,0.0011283467,0.00072389765,0.0007265253,0.0011242074,0.00056802825,0.001517708,0.0004393187],"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.000033853023,0.000014710574,0.00033828386,0.000022983651,0.000013224631,0.000030618005,0.000023753248,0.9795419,0.00090848375,0.013566028,0.00016636906,0.005339809],"study_design_scores_gemma":[0.0000020710281,0.000005430927,0.000032322114,0.0000013233423,0.0000031067702,0.0000033723998,9.132085e-7,0.99787366,0.00010009616,0.0018816122,0.00009417621,0.000001853005],"about_ca_topic_score_codex":0.009804136,"about_ca_topic_score_gemma":0.008649381,"teacher_disagreement_score":0.009804136,"about_ca_system_score_codex":0.00089355715,"about_ca_system_score_gemma":0.001349018,"threshold_uncertainty_score":0.019494116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024174964,0.00032911153,0.9206922,0.00026163046,0.00016258162,0.00038071058,0.0008403724,0.021891793,0.03126659],"genre_scores_gemma":[0.17947377,0.00027787764,0.7904039,0.00029761728,0.00004070373,0.00028390525,0.0028185323,0.0031514058,0.023252355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999577,0.000045975637,0.000027660739,0.000088925146,0.00020491488,0.00005545832],"domain_scores_gemma":[0.99938357,0.00018383122,0.000059875256,0.00016386407,0.00018874495,0.000020090309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040847628,0.0006907469,0.0003541729,0.00087361655,0.0003977434,0.00076239195,0.0012287111,0.00056175736,0.03046382],"category_scores_gemma":[0.0017417297,0.00026094588,0.0004378072,0.0004648999,0.00044347707,0.0010257951,0.0011037735,0.000609305,0.0043126335],"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.00029453222,0.00012449425,0.0014532356,0.000532722,0.000050813323,0.00043558815,0.0002577493,0.052637994,0.040572185,0.037921842,0.054546807,0.811172],"study_design_scores_gemma":[0.00024304603,0.0003069991,0.0012681033,0.00011633795,0.000058078316,0.0008295204,0.00025745088,0.6606183,0.13241136,0.030252807,0.17357983,0.000058142163],"about_ca_topic_score_codex":0.001986941,"about_ca_topic_score_gemma":0.005062892,"teacher_disagreement_score":0.03046382,"about_ca_system_score_codex":0.00060315494,"about_ca_system_score_gemma":0.001271008,"threshold_uncertainty_score":0.101911604},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021677203,0.0010771223,0.6697404,0.00045788128,0.00036156853,0.00056562957,0.005296599,0.24131043,0.0595131],"genre_scores_gemma":[0.15904161,0.0011742554,0.72862387,0.00075118913,0.000081258346,0.000873356,0.020197429,0.025973702,0.06328338],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996351,0.000043724907,0.000020408532,0.0000700625,0.0001809927,0.000049732193],"domain_scores_gemma":[0.99961025,0.00010422958,0.0000490392,0.000091903705,0.00012156271,0.00002302616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070998294,0.0013419208,0.0004056606,0.00085174455,0.00031896995,0.0011247332,0.0021580851,0.00073063286,0.0340159],"category_scores_gemma":[0.001653088,0.0007106223,0.00059510494,0.0006887705,0.00035266933,0.00095077255,0.00090996723,0.0012021719,0.011911317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007142699,0.00015074808,0.002151259,0.0009961431,0.00015696489,0.00028358688,0.00025248516,0.11521283,0.029792894,0.029340273,0.34647503,0.4744735],"study_design_scores_gemma":[0.0004788346,0.00057630945,0.001418755,0.00011096822,0.000056120447,0.00053970946,0.000078453944,0.5196009,0.05116452,0.016190281,0.4096885,0.000096587275],"about_ca_topic_score_codex":0.0030426956,"about_ca_topic_score_gemma":0.0046469974,"teacher_disagreement_score":0.0340159,"about_ca_system_score_codex":0.0007687873,"about_ca_system_score_gemma":0.0012422358,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020809278,0.00010624954,0.9762857,0.00003381548,0.000015317139,0.00003103867,0.000018917712,0.0010772093,0.0016223786],"genre_scores_gemma":[0.6554694,0.000099250894,0.3425164,0.000071404815,0.000020573903,0.000053755397,0.00006337317,0.00022261197,0.0014831793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000025409317,0.000009736536,0.00005215473,0.00012249054,0.000024629338],"domain_scores_gemma":[0.9996618,0.000105900544,0.00005249016,0.00012188008,0.00004629683,0.000011702904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022707628,0.00041928503,0.00036473415,0.00030038258,0.00020708525,0.00045318613,0.00085124554,0.00032145588,0.0011159122],"category_scores_gemma":[0.00081097445,0.00021274673,0.00033321013,0.00024979207,0.00036124224,0.0005159911,0.0005919035,0.0005000517,0.00021507815],"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.00006794152,0.000052178188,0.00052784366,0.00010600515,0.000024655481,0.00012118805,0.00009334727,0.54131925,0.18306449,0.0073387097,0.0011374467,0.2661469],"study_design_scores_gemma":[0.0000059802824,0.000028487375,0.00011402059,0.0000021397502,0.0000071515115,0.000043916534,0.000005179789,0.97433203,0.023226358,0.0012278394,0.0010012162,0.0000056319996],"about_ca_topic_score_codex":0.001702237,"about_ca_topic_score_gemma":0.002736631,"teacher_disagreement_score":0.001702237,"about_ca_system_score_codex":0.00048406588,"about_ca_system_score_gemma":0.00057125825,"threshold_uncertainty_score":0.0037330985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56425345,0.00028891905,0.42548957,0.00009220327,0.000059486414,0.000112460286,0.00007208401,0.0057028667,0.003928995],"genre_scores_gemma":[0.9297236,0.00006389481,0.06930817,0.000020265634,0.000008363498,0.000021179889,0.000042696505,0.00008394955,0.00072797964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975866,0.00004141045,0.000016997601,0.00005112796,0.00006596339,0.00006580882],"domain_scores_gemma":[0.99944276,0.00016034594,0.00008305187,0.00020887182,0.000060400664,0.00004451644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023141332,0.0005023815,0.00021891105,0.0005040889,0.00024927175,0.00042601695,0.00055512873,0.00025511195,0.0014152196],"category_scores_gemma":[0.0011679288,0.00015450429,0.00014110774,0.00028377917,0.00029847052,0.0008471064,0.0007730489,0.00030098628,0.00021175086],"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.0008728723,0.00013860583,0.008150114,0.00018444093,0.00003469259,0.0008006849,0.0004927646,0.054928023,0.6306142,0.006510606,0.0015197264,0.2957533],"study_design_scores_gemma":[0.00006956221,0.0011620683,0.0058972193,0.000028726718,0.00006540126,0.0011910159,0.00021827297,0.35702452,0.6191289,0.0035388495,0.011623975,0.000051466977],"about_ca_topic_score_codex":0.00042245147,"about_ca_topic_score_gemma":0.00076405023,"teacher_disagreement_score":0.0014152196,"about_ca_system_score_codex":0.00024966634,"about_ca_system_score_gemma":0.000307854,"threshold_uncertainty_score":0.004734397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0688232,0.022384943,0.67541105,0.0014901656,0.0019337517,0.0004004,0.0020343552,0.008123356,0.21939872],"genre_scores_gemma":[0.830093,0.011261868,0.09212065,0.000628186,0.00033831483,0.00034478476,0.001566581,0.0004164033,0.06323012],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978894,0.000027964446,0.000017436067,0.000057264355,0.00007120692,0.00003726721],"domain_scores_gemma":[0.99974483,0.00005245333,0.00002369679,0.00008850415,0.00007080061,0.000019701109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017412611,0.00048465177,0.0005823075,0.0005052386,0.00043374085,0.0012522843,0.0016008164,0.0006283332,0.011270642],"category_scores_gemma":[0.00060331705,0.00024969658,0.00039058694,0.0006927971,0.0003806088,0.0020104484,0.0010016026,0.0005285109,0.0042490736],"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.0004183441,0.000109144334,0.00172784,0.0018886195,0.00019179714,0.00090603554,0.00025983283,0.1525834,0.062187787,0.23173915,0.04024099,0.50774705],"study_design_scores_gemma":[0.000113996495,0.00052817573,0.0012437778,0.0003123008,0.00015339612,0.0023225064,0.00019791513,0.27935028,0.04441044,0.10799137,0.5632269,0.00014887583],"about_ca_topic_score_codex":0.0004849274,"about_ca_topic_score_gemma":0.000658894,"teacher_disagreement_score":0.011270642,"about_ca_system_score_codex":0.0004064336,"about_ca_system_score_gemma":0.00028494117,"threshold_uncertainty_score":0.03770405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008767131,0.00008009924,0.9889636,0.00006995194,0.00002206566,0.00008949225,0.000044514218,0.0005080313,0.0014550844],"genre_scores_gemma":[0.0919805,0.00009399479,0.9042928,0.00006695817,0.00001926026,0.00018104223,0.00020037369,0.00013838758,0.003026717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.000042454027,0.000015762931,0.000044979457,0.00012449596,0.000043610762],"domain_scores_gemma":[0.9996013,0.00019005021,0.00004146194,0.000040192113,0.00010795934,0.000019099074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041727303,0.0008513583,0.00065642135,0.001173578,0.0005206242,0.0007265478,0.0008384846,0.0008346837,0.0054674437],"category_scores_gemma":[0.0013705519,0.00043431678,0.00045295033,0.001002414,0.00044176428,0.00085648603,0.00071047473,0.0006617637,0.0011175914],"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.00017837576,0.00009903027,0.00061093323,0.00010594015,0.000027318907,0.000094968666,0.0000803096,0.56192756,0.020228598,0.016473232,0.0043474576,0.39582628],"study_design_scores_gemma":[0.000029499222,0.00007536204,0.000095388816,0.0000070206524,0.0000071783197,0.00004788411,0.000012984023,0.989005,0.0033335127,0.005142946,0.0022367302,0.0000065681643],"about_ca_topic_score_codex":0.0035742654,"about_ca_topic_score_gemma":0.006026529,"teacher_disagreement_score":0.0054674437,"about_ca_system_score_codex":0.0009137601,"about_ca_system_score_gemma":0.0014633469,"threshold_uncertainty_score":0.0182904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11159422,0.00072277954,0.8783755,0.0003845674,0.00007029395,0.0000634084,0.00017886075,0.006208847,0.0024015862],"genre_scores_gemma":[0.8240402,0.00029053024,0.17284457,0.0001060155,0.000039460763,0.00008983339,0.00028087062,0.00014536551,0.0021631706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996358,0.00009574553,0.000018568588,0.00008590189,0.00011389858,0.000049999013],"domain_scores_gemma":[0.9986064,0.00085578096,0.00016868564,0.00013362929,0.00020737255,0.00002812972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061925966,0.00091992086,0.0004498857,0.0006373601,0.00026140432,0.00068464974,0.0010057157,0.00055663055,0.0014349457],"category_scores_gemma":[0.0035507372,0.0003680726,0.00034718358,0.0004961622,0.0004063224,0.0009880894,0.0003950762,0.000832294,0.00036896687],"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.00007020385,0.000047473095,0.001648524,0.000038752987,0.000026892403,0.000029633455,0.000019092224,0.8905487,0.0028147395,0.0015271268,0.0009308198,0.10229805],"study_design_scores_gemma":[0.000002555638,0.000014501878,0.00014152784,0.0000021874127,0.0000027528192,0.0000054247625,0.0000023473312,0.99775773,0.0011398114,0.00078859524,0.00014033649,0.0000022206289],"about_ca_topic_score_codex":0.006766965,"about_ca_topic_score_gemma":0.008895172,"teacher_disagreement_score":0.006766965,"about_ca_system_score_codex":0.0011407178,"about_ca_system_score_gemma":0.0011770165,"threshold_uncertainty_score":0.0134551525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16090982,0.00041320515,0.8260866,0.00017109614,0.00010534233,0.0001046651,0.000087484244,0.003789116,0.008332768],"genre_scores_gemma":[0.78576535,0.00012352252,0.21025592,0.00014178494,0.000016513928,0.00004969536,0.00009600231,0.00017017228,0.0033810444],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978894,0.000028547016,0.000012667638,0.000049689304,0.00008906071,0.000031213618],"domain_scores_gemma":[0.99957603,0.00006474713,0.00009715524,0.00018229766,0.00006395284,0.00001582491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017004955,0.00043012816,0.00019797003,0.00030780205,0.00020907736,0.00046840176,0.00086395803,0.00032296104,0.00093036925],"category_scores_gemma":[0.00054799195,0.00014081218,0.00020029706,0.00023076311,0.0003200971,0.0005645585,0.0006976753,0.00034983477,0.00023236513],"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.00015770376,0.00011721181,0.0014118892,0.00024262637,0.000059402097,0.0006502487,0.00023259367,0.16822688,0.61238074,0.010227795,0.0018443587,0.2044486],"study_design_scores_gemma":[0.000032928157,0.0003155728,0.0013468433,0.000020803525,0.000060368893,0.0006646189,0.000057215235,0.63675135,0.3455155,0.00405694,0.011142114,0.00003567289],"about_ca_topic_score_codex":0.00062807096,"about_ca_topic_score_gemma":0.0013047558,"teacher_disagreement_score":0.00093036925,"about_ca_system_score_codex":0.00045438868,"about_ca_system_score_gemma":0.0004065603,"threshold_uncertainty_score":0.0032969117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018786348,0.0002344136,0.97468436,0.000065968925,0.00001549646,0.000034873454,0.000047670677,0.00055309106,0.005577819],"genre_scores_gemma":[0.40488845,0.00021923809,0.5922341,0.000066322,0.00001594122,0.00007756179,0.00014933212,0.00021360099,0.0021354752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981135,0.000039153838,0.000008924308,0.000028843591,0.00009457017,0.000017254908],"domain_scores_gemma":[0.9997873,0.00008292352,0.000038113896,0.000044487344,0.00003790398,0.000009235304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025477773,0.0006280949,0.00029458673,0.00046937048,0.00023732938,0.0004992763,0.0008885975,0.00034942827,0.0017441871],"category_scores_gemma":[0.0005155944,0.00023252184,0.0004666018,0.00049894187,0.0002792679,0.0006752389,0.0005468545,0.00047311815,0.00040401038],"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.000050383886,0.000052222098,0.0007699819,0.0001747478,0.00004089019,0.00009535449,0.00010361239,0.69446015,0.0962189,0.022977365,0.0018604033,0.18319586],"study_design_scores_gemma":[0.0000054108227,0.00005295095,0.0001391565,0.000007348724,0.000011288916,0.00008424218,0.000015074779,0.9758296,0.01673031,0.0039604837,0.0031580215,0.000006132575],"about_ca_topic_score_codex":0.0008091203,"about_ca_topic_score_gemma":0.0018501343,"teacher_disagreement_score":0.0017441871,"about_ca_system_score_codex":0.00052394747,"about_ca_system_score_gemma":0.0005798062,"threshold_uncertainty_score":0.0058348775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32075253,0.000648589,0.6685368,0.00020562824,0.00004614744,0.000036491743,0.00010823196,0.0011200833,0.00854557],"genre_scores_gemma":[0.94868344,0.00015448837,0.048662983,0.00003374508,0.000008042985,0.000029412839,0.000073136005,0.00005144289,0.0023033929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968386,0.000062929474,0.000016478247,0.00004655216,0.00014863897,0.00004158853],"domain_scores_gemma":[0.9994166,0.0001948613,0.000108623724,0.00015296678,0.00010452759,0.000022460024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020983229,0.0003612615,0.00030324445,0.0002274197,0.00031559996,0.00058147864,0.0007448533,0.00037663357,0.001091386],"category_scores_gemma":[0.0010287572,0.0001559538,0.00018877765,0.0002951273,0.0003493813,0.0010043766,0.0008504879,0.00038324777,0.00023459057],"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.00011642248,0.000039022092,0.00086500554,0.000106443214,0.000020021329,0.000117378564,0.00012704667,0.9068688,0.039013013,0.017663265,0.00068283896,0.034380846],"study_design_scores_gemma":[0.0000031380293,0.000059475016,0.00013316367,0.000004024974,0.0000058117084,0.000047563954,0.000021485439,0.986624,0.009389907,0.00278736,0.00091713044,0.00000695739],"about_ca_topic_score_codex":0.00081950164,"about_ca_topic_score_gemma":0.0013682793,"teacher_disagreement_score":0.001091386,"about_ca_system_score_codex":0.00068904494,"about_ca_system_score_gemma":0.00039749,"threshold_uncertainty_score":0.004999399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12884007,0.00041716138,0.8537134,0.0006173197,0.000090245965,0.00013575188,0.00041541737,0.0026765184,0.013094159],"genre_scores_gemma":[0.6014535,0.00021977413,0.39128786,0.00032366285,0.00005420015,0.00021335944,0.0012144936,0.00044285838,0.004790268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873537,0.00035482703,0.000056790086,0.00022024507,0.00035988583,0.00027282102],"domain_scores_gemma":[0.99640095,0.0026827394,0.00023197675,0.00032791335,0.0002822943,0.00007411757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011607015,0.0008659818,0.0006768313,0.0012373899,0.00057057344,0.0015942233,0.0014439739,0.001073405,0.007318717],"category_scores_gemma":[0.0077913697,0.0004883161,0.0011629343,0.0012730283,0.0011561139,0.0023478456,0.0011848808,0.0013210343,0.0008354504],"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.00027237146,0.00015167332,0.0015774163,0.00019759926,0.000057996927,0.00014494207,0.00013494132,0.8431844,0.008934094,0.03373186,0.004153672,0.10745908],"study_design_scores_gemma":[0.00001505869,0.000037519938,0.0001443044,0.000012209459,0.0000097280845,0.000021018315,0.000027018286,0.97939986,0.0021093104,0.017656907,0.00056116236,0.000005898818],"about_ca_topic_score_codex":0.0075908,"about_ca_topic_score_gemma":0.013707485,"teacher_disagreement_score":0.0075908,"about_ca_system_score_codex":0.001760588,"about_ca_system_score_gemma":0.0016952172,"threshold_uncertainty_score":0.024483502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005556986,0.00013403458,0.9890381,0.00007190499,0.000029533709,0.00004379835,0.0001121318,0.0044097225,0.0006037498],"genre_scores_gemma":[0.17401399,0.0002234438,0.8194242,0.00018581432,0.000035740846,0.00025528888,0.00079948886,0.0012775807,0.0037844155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997278,0.00004489559,0.000013261978,0.00006236632,0.00012137346,0.000030429374],"domain_scores_gemma":[0.999481,0.00019805429,0.00008529924,0.000078054254,0.00012778629,0.000029770923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007193863,0.0014888998,0.0006806951,0.0012530211,0.0003616685,0.001019293,0.0014438913,0.00089267764,0.0042741783],"category_scores_gemma":[0.0022636855,0.00074709865,0.0009623569,0.0006158019,0.00035978656,0.0012153884,0.001163608,0.0012750633,0.0007838398],"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.00015658574,0.00007513411,0.0017309734,0.00015058389,0.00013636478,0.00016904625,0.00016214332,0.5463351,0.017953245,0.0072185756,0.012145229,0.41376698],"study_design_scores_gemma":[0.000011400729,0.000019819441,0.00017446524,0.0000068064846,0.000008347126,0.00003998166,0.000009987687,0.9930139,0.0028674304,0.0017843276,0.0020499562,0.000013562827],"about_ca_topic_score_codex":0.004189654,"about_ca_topic_score_gemma":0.007705806,"teacher_disagreement_score":0.0042741783,"about_ca_system_score_codex":0.00087167666,"about_ca_system_score_gemma":0.0011523031,"threshold_uncertainty_score":0.014298618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023106059,0.0004696509,0.9550315,0.00024309025,0.000101638514,0.00026270415,0.0001730295,0.014641216,0.0059711607],"genre_scores_gemma":[0.18332171,0.00024018601,0.80977225,0.00020564113,0.000040367446,0.00027885032,0.00070004753,0.0011997962,0.004241177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792504,0.00047419922,0.00009065505,0.00028013848,0.0010107628,0.00021908616],"domain_scores_gemma":[0.9982393,0.00052280823,0.00021806665,0.0005635505,0.00034754738,0.0001085912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024389625,0.002097047,0.0009563272,0.0012409532,0.000680107,0.0016194793,0.0036117274,0.0012835994,0.0044566947],"category_scores_gemma":[0.0042470344,0.0009929215,0.001188999,0.00097376225,0.00064898405,0.0019911106,0.0026208113,0.0016982842,0.0015041499],"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.00032004013,0.00025709337,0.0022275331,0.00033612686,0.00012757961,0.0002707164,0.00020707761,0.5750328,0.022212373,0.017434562,0.02039218,0.36118194],"study_design_scores_gemma":[0.00004788186,0.00016563895,0.00030498134,0.00001841881,0.000027516437,0.00008015401,0.000031987158,0.9788174,0.00622475,0.0052628126,0.008994797,0.00002357366],"about_ca_topic_score_codex":0.0046748216,"about_ca_topic_score_gemma":0.008125604,"teacher_disagreement_score":0.0046748216,"about_ca_system_score_codex":0.0012717728,"about_ca_system_score_gemma":0.002954152,"threshold_uncertainty_score":0.014909148},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055592875,0.20591079,0.7536343,0.0010783832,0.0005967548,0.00013755287,0.00027142695,0.0009857013,0.031825878],"genre_scores_gemma":[0.102220796,0.30964947,0.5690834,0.0012941546,0.0014392063,0.0005168824,0.000821673,0.00069160573,0.014282813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886465,0.00023854942,0.00013124893,0.00017496693,0.0005208103,0.00006979904],"domain_scores_gemma":[0.99865973,0.0007811457,0.00009695535,0.00018084199,0.00025850002,0.000022942722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010096292,0.0016735218,0.0011868259,0.0018282196,0.0004937963,0.0021533903,0.0020067168,0.0012873668,0.008919506],"category_scores_gemma":[0.0043356665,0.0009558671,0.00084660196,0.003697096,0.0007908986,0.0029504336,0.0010130372,0.0018243375,0.0040274346],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017828551,0.00006766652,0.0004591355,0.0034894447,0.000082774655,0.00011908711,0.00012348547,0.04399943,0.008810098,0.14752641,0.015767636,0.77937645],"study_design_scores_gemma":[0.000120846526,0.00073979376,0.000581844,0.0024532713,0.0001746681,0.0018644888,0.00013011029,0.15937532,0.02299013,0.18325795,0.62817353,0.0001380241],"about_ca_topic_score_codex":0.00060607976,"about_ca_topic_score_gemma":0.000763025,"teacher_disagreement_score":0.008919506,"about_ca_system_score_codex":0.0009757599,"about_ca_system_score_gemma":0.001020883,"threshold_uncertainty_score":0.02983874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018292518,0.0007986176,0.8030402,0.0008131145,0.00034839366,0.00053374906,0.007907146,0.162097,0.0061691655],"genre_scores_gemma":[0.20286396,0.0007809312,0.73611414,0.0010915959,0.00011008832,0.0012876809,0.028594872,0.02246803,0.0066887587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847215,0.0004868041,0.00012979332,0.00034026662,0.00045399656,0.00011701676],"domain_scores_gemma":[0.9949809,0.0028901652,0.00025051576,0.001133195,0.0006451623,0.000100162986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001835361,0.0017518731,0.00048123783,0.0011610388,0.00035927,0.0013536775,0.0035335168,0.0012387678,0.013218997],"category_scores_gemma":[0.011622193,0.0010805267,0.0016987781,0.00065991265,0.0007661986,0.002691297,0.0015620951,0.002556879,0.007100868],"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.0008148248,0.00041456133,0.0057382374,0.00199781,0.00019676007,0.00048273272,0.0003032015,0.5134848,0.02077499,0.025783626,0.11363207,0.31637648],"study_design_scores_gemma":[0.00013230932,0.00013396356,0.00030086,0.00009573999,0.0000391655,0.00014693892,0.00002846925,0.94221276,0.0128105655,0.013173167,0.030894617,0.000031432297],"about_ca_topic_score_codex":0.0041107317,"about_ca_topic_score_gemma":0.008934466,"teacher_disagreement_score":0.013218997,"about_ca_system_score_codex":0.0011537666,"about_ca_system_score_gemma":0.0031564555,"threshold_uncertainty_score":0.044221938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04516262,0.00033578364,0.94966483,0.00020153237,0.000058100246,0.0000681492,0.000035689536,0.001372446,0.0031008525],"genre_scores_gemma":[0.87618864,0.00014770875,0.12023922,0.00020228863,0.000040638468,0.00010410176,0.00008824324,0.0001657546,0.0028234394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.00012388309,0.000022578675,0.00013211394,0.00012397552,0.000094397314],"domain_scores_gemma":[0.9985683,0.0007515297,0.00018814797,0.00016542897,0.00022937461,0.0000971336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317894,0.0010252681,0.0010365458,0.00047032087,0.00030266133,0.00071309914,0.0013810219,0.00078091345,0.0024536804],"category_scores_gemma":[0.0033032165,0.00038684774,0.00042444255,0.00027687024,0.0009927322,0.0011209704,0.0009427471,0.0012302223,0.0003742003],"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.000049610113,0.000053209926,0.00079108734,0.00003455469,0.000025224494,0.000042417876,0.000029259476,0.94551337,0.0016155682,0.0025061134,0.00067025505,0.048669238],"study_design_scores_gemma":[0.0000073055608,0.000034232133,0.00005303443,0.0000034562677,0.0000054738043,0.0000075002777,0.0000048682423,0.9976901,0.0005083712,0.0014621578,0.00022059106,0.0000030208755],"about_ca_topic_score_codex":0.003702812,"about_ca_topic_score_gemma":0.005444212,"teacher_disagreement_score":0.003702812,"about_ca_system_score_codex":0.0008384466,"about_ca_system_score_gemma":0.0014106642,"threshold_uncertainty_score":0.008208394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11761091,0.00032404825,0.8688999,0.00018428496,0.000065495486,0.00010874855,0.00032669853,0.010234607,0.0022453896],"genre_scores_gemma":[0.7942302,0.00019376003,0.19992648,0.00018008515,0.000023935605,0.00008718869,0.00083000096,0.00031487452,0.0042134225],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984944,0.000014204211,0.0000060072075,0.000046582525,0.000055407138,0.000028427245],"domain_scores_gemma":[0.99967,0.000092498005,0.00006628943,0.00009359842,0.000061287414,0.000016315036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000249971,0.00092011015,0.00034614617,0.00046188914,0.00011992931,0.00045107558,0.001402049,0.00056903646,0.002069755],"category_scores_gemma":[0.0008711544,0.0003536695,0.00046800228,0.00023312563,0.00032004277,0.0008140327,0.0007687565,0.00050511584,0.00034654638],"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.00042674568,0.0001626257,0.009070839,0.000297538,0.00023190796,0.00070894335,0.00015485492,0.40063298,0.10606581,0.0036663548,0.00600666,0.47257468],"study_design_scores_gemma":[0.000008875985,0.000057479618,0.001685279,0.0000084915955,0.000018148103,0.000122040445,0.000011124033,0.97100407,0.024976935,0.0010760223,0.0010212612,0.0000102579725],"about_ca_topic_score_codex":0.0027681869,"about_ca_topic_score_gemma":0.005881122,"teacher_disagreement_score":0.0027681869,"about_ca_system_score_codex":0.0006396037,"about_ca_system_score_gemma":0.0005270015,"threshold_uncertainty_score":0.0069239736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07267676,0.00049999636,0.7940378,0.00047076162,0.0002503981,0.0003566451,0.0012392187,0.12539399,0.005074264],"genre_scores_gemma":[0.45402566,0.0002452773,0.52631646,0.00036558183,0.000040812396,0.00042289196,0.004029249,0.01080023,0.0037538074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964275,0.0013035017,0.0002110654,0.00050121645,0.0013446742,0.00021213431],"domain_scores_gemma":[0.9863219,0.008923363,0.00058941956,0.0022297238,0.0016970596,0.0002385307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042972635,0.001848272,0.0007090073,0.0013982647,0.00039503627,0.0012843553,0.002441651,0.0008509111,0.0082140425],"category_scores_gemma":[0.025392218,0.0009376607,0.00088205317,0.00038997454,0.000744452,0.0018621455,0.002148386,0.0013899714,0.002503968],"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.0011010801,0.00074492756,0.007613587,0.0015919879,0.0001375042,0.0010187012,0.0012922586,0.2928575,0.08762082,0.009319791,0.024501208,0.5722007],"study_design_scores_gemma":[0.00016696326,0.00023169041,0.00048603406,0.000112991,0.00004962473,0.00022533133,0.00013524876,0.9221196,0.057569694,0.005340028,0.013507612,0.00005514761],"about_ca_topic_score_codex":0.0018135072,"about_ca_topic_score_gemma":0.003074389,"teacher_disagreement_score":0.0082140425,"about_ca_system_score_codex":0.000994117,"about_ca_system_score_gemma":0.002194519,"threshold_uncertainty_score":0.027478755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16660514,0.00068724086,0.5737775,0.002064864,0.00072865665,0.00049277645,0.007228108,0.20947744,0.0389383],"genre_scores_gemma":[0.59751534,0.0003554808,0.35924193,0.0013798763,0.00015080324,0.00031111087,0.006766778,0.013908708,0.020370072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872893,0.00028911937,0.0000944986,0.000353696,0.00043220547,0.00010155038],"domain_scores_gemma":[0.9951139,0.0023420972,0.00062316435,0.0009393045,0.00085693767,0.00012461112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183517,0.0008122718,0.00044794567,0.0017637778,0.0008439176,0.0015509415,0.0009331711,0.0014104901,0.011497361],"category_scores_gemma":[0.0072957953,0.00043678927,0.0005312415,0.0007421407,0.0014348844,0.0022458462,0.0010964157,0.0009359652,0.0046298564],"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.0013019285,0.00032809266,0.03539756,0.0011091385,0.00008458289,0.0019135167,0.003141028,0.012085612,0.06484856,0.05174919,0.109963045,0.7180779],"study_design_scores_gemma":[0.00016138973,0.0008087835,0.01721715,0.00046339782,0.00013263004,0.0041390485,0.0010882214,0.17751367,0.2168004,0.03244893,0.54885393,0.00037247353],"about_ca_topic_score_codex":0.0034927158,"about_ca_topic_score_gemma":0.0039725224,"teacher_disagreement_score":0.011497361,"about_ca_system_score_codex":0.000852202,"about_ca_system_score_gemma":0.0009201067,"threshold_uncertainty_score":0.03846246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034018822,0.0003900143,0.9392124,0.00021361951,0.000102033,0.0005872512,0.00026869812,0.017946107,0.0072610276],"genre_scores_gemma":[0.218417,0.00029632205,0.770647,0.00028869466,0.000038902293,0.0005704604,0.000716816,0.0021549286,0.0068698376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911743,0.00025259095,0.00004632169,0.00016343157,0.00026942228,0.0001507841],"domain_scores_gemma":[0.9983935,0.0007848052,0.00017235034,0.0003957721,0.00018939418,0.0000642283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013469177,0.0015429799,0.0004925545,0.0008821549,0.00060955936,0.000926983,0.0012076348,0.00061632245,0.007314132],"category_scores_gemma":[0.0026373558,0.00061059085,0.0009235629,0.0004129896,0.00060842,0.0012685922,0.0012153144,0.0011115654,0.0019210341],"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.00075904006,0.0003887245,0.0032585177,0.00055288954,0.00008959347,0.0005774737,0.00051288446,0.09716769,0.107158065,0.024919812,0.015993755,0.74862164],"study_design_scores_gemma":[0.00021593942,0.000764892,0.0022978086,0.00015378106,0.00010700609,0.00070814614,0.00021491385,0.7961702,0.09172076,0.03743504,0.070062764,0.00014884106],"about_ca_topic_score_codex":0.0011333855,"about_ca_topic_score_gemma":0.0022666922,"teacher_disagreement_score":0.007314132,"about_ca_system_score_codex":0.0006953951,"about_ca_system_score_gemma":0.0014888162,"threshold_uncertainty_score":0.024468243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048012254,0.0075624837,0.977414,0.0011546452,0.00007910494,0.000022835688,0.000071689115,0.00018229905,0.008711674],"genre_scores_gemma":[0.5659264,0.04298885,0.37722728,0.00069389143,0.0009148281,0.00023649198,0.00033868046,0.00020078961,0.0114728175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00015313833,0.00002082575,0.00005904223,0.0001723716,0.000024114099],"domain_scores_gemma":[0.9994773,0.00032841015,0.0000575564,0.000063093845,0.00006230552,0.000011348973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932187,0.00084522367,0.0008336858,0.00070857897,0.00023288392,0.0013575422,0.0009903135,0.0008793833,0.00119785],"category_scores_gemma":[0.0013939064,0.00041283647,0.00068297394,0.0009341723,0.0010266933,0.0013246667,0.0005721503,0.0011597213,0.00041549854],"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.000014853924,0.000026681128,0.0005549939,0.0002577712,0.000042099822,0.000045976598,0.000042913918,0.82417095,0.00213175,0.11132978,0.0012494124,0.06013283],"study_design_scores_gemma":[0.000002511175,0.000022111948,0.0001713147,0.00003438629,0.000009151657,0.000029579773,0.000010238888,0.947644,0.0007002557,0.04524135,0.0061269123,0.00000824238],"about_ca_topic_score_codex":0.0013865359,"about_ca_topic_score_gemma":0.0012200426,"teacher_disagreement_score":0.0013865359,"about_ca_system_score_codex":0.00057369017,"about_ca_system_score_gemma":0.0006840664,"threshold_uncertainty_score":0.004194975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011220354,0.000349026,0.88005143,0.00013001614,0.000060831604,0.00018058547,0.00034497355,0.105286956,0.0023758712],"genre_scores_gemma":[0.124616906,0.00029299126,0.85698456,0.00022519952,0.000034400367,0.00030471003,0.0020279074,0.010919088,0.004594175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986186,0.00021009006,0.00011448256,0.00033943958,0.0005528246,0.00016449083],"domain_scores_gemma":[0.9986174,0.0004555805,0.0001601454,0.00046287448,0.00024633674,0.000057751342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157048,0.0019443404,0.00063571753,0.001178973,0.0005028805,0.0010710352,0.0022387635,0.0009838018,0.00639942],"category_scores_gemma":[0.003557404,0.00083144824,0.001400259,0.0004791401,0.0010323662,0.0011410248,0.001943545,0.0017495238,0.0033370324],"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.00055298634,0.00024294615,0.003202178,0.0010865228,0.0001316116,0.0007970297,0.00078850245,0.13423176,0.15829782,0.020642437,0.033674035,0.64635223],"study_design_scores_gemma":[0.00014507922,0.0002957451,0.00092128007,0.00012926005,0.00007719678,0.0004251447,0.000089448426,0.755685,0.17975715,0.012644279,0.04970445,0.00012605086],"about_ca_topic_score_codex":0.0033493694,"about_ca_topic_score_gemma":0.0042874324,"teacher_disagreement_score":0.00639942,"about_ca_system_score_codex":0.00086321874,"about_ca_system_score_gemma":0.002037947,"threshold_uncertainty_score":0.0214082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.138199,0.00041460508,0.8559599,0.00024409615,0.000025723155,0.00019102769,0.0000937479,0.0011759803,0.0036959776],"genre_scores_gemma":[0.7141299,0.00020662136,0.28376427,0.000076920674,0.000012503157,0.00016735517,0.00015122164,0.00026870187,0.0012224722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989963,0.0003719779,0.00004619494,0.00013198551,0.00033646866,0.00011713313],"domain_scores_gemma":[0.997088,0.0016244368,0.0003681446,0.0004851877,0.0003439984,0.00009028424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851061,0.00092247326,0.00044026977,0.0007795336,0.00031702602,0.0007150794,0.0007370808,0.0006137895,0.0024383964],"category_scores_gemma":[0.00666014,0.00042275226,0.00069328194,0.00030264776,0.0009971472,0.0010957704,0.0010891566,0.00087217847,0.0002566981],"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.00014053786,0.00011053384,0.0071301963,0.00042834433,0.00007120306,0.0002772819,0.0003089493,0.7703897,0.034661494,0.028342076,0.0013760127,0.15676376],"study_design_scores_gemma":[0.000020022493,0.00020829921,0.00068517914,0.00003652264,0.000032366654,0.000084907886,0.0000705142,0.97076595,0.008498502,0.017403072,0.002184718,0.000009875772],"about_ca_topic_score_codex":0.0011651054,"about_ca_topic_score_gemma":0.0018151816,"teacher_disagreement_score":0.0024383964,"about_ca_system_score_codex":0.0007570985,"about_ca_system_score_gemma":0.0010201606,"threshold_uncertainty_score":0.009789467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003465806,0.000041660925,0.99425185,0.00004942453,0.000014245196,0.000017651233,0.000034413642,0.00038737842,0.0017375979],"genre_scores_gemma":[0.26065525,0.00024401143,0.73447984,0.000079116835,0.00002523657,0.00020320018,0.0002621122,0.0003725422,0.0036786764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997764,0.00004447736,0.000016672982,0.000030119896,0.00011823688,0.000014079829],"domain_scores_gemma":[0.9995296,0.00024387453,0.000047350015,0.00009815953,0.00006912361,0.000012021165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046851157,0.0006950307,0.0005155391,0.0004684169,0.00035375345,0.00060758204,0.0008564212,0.00048320935,0.0031470186],"category_scores_gemma":[0.0017372204,0.0004845818,0.00064683205,0.00028196874,0.00060845044,0.00122928,0.00091414544,0.0011045282,0.0008981999],"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.000032981723,0.000020442736,0.00046123544,0.00014597684,0.00002815287,0.000108990556,0.00014041655,0.8408632,0.012208081,0.066725254,0.0015049981,0.077760264],"study_design_scores_gemma":[0.0000024585354,0.0000049229197,0.000016241647,0.000004360908,0.0000021067106,0.000013044707,0.000004950693,0.9910155,0.0013521161,0.00633618,0.0012453534,0.0000027219478],"about_ca_topic_score_codex":0.0018825809,"about_ca_topic_score_gemma":0.0035685112,"teacher_disagreement_score":0.0031470186,"about_ca_system_score_codex":0.00059067097,"about_ca_system_score_gemma":0.0009383802,"threshold_uncertainty_score":0.01052779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26067248,0.0015053492,0.7157761,0.00048351983,0.00026530112,0.00007783536,0.0002129176,0.017663624,0.0033428832],"genre_scores_gemma":[0.90143645,0.00017899337,0.09569277,0.00014174172,0.000032097927,0.000051608476,0.0002144214,0.00017998875,0.0020719704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993069,0.00012274347,0.000058824306,0.00014140693,0.00027154802,0.0000985382],"domain_scores_gemma":[0.9981621,0.0006839864,0.0002982477,0.00043690842,0.00034296702,0.00007593087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828199,0.0007726504,0.0005083546,0.0007333045,0.0003859455,0.00066424155,0.0017052217,0.00048726966,0.0025684566],"category_scores_gemma":[0.0033696264,0.00037063277,0.00039505324,0.00042369365,0.0006028644,0.0013365268,0.00088589726,0.0008452318,0.00046170835],"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.0011561407,0.00022179322,0.007106963,0.00040165504,0.00013678038,0.0006327156,0.00022466201,0.5564315,0.05930057,0.010272083,0.008761428,0.3553538],"study_design_scores_gemma":[0.000023982297,0.00017613295,0.00056881306,0.000019701147,0.000026797034,0.00009326442,0.000026980535,0.9588631,0.03473813,0.0038295016,0.0016208049,0.000012898561],"about_ca_topic_score_codex":0.0024877377,"about_ca_topic_score_gemma":0.0035421688,"teacher_disagreement_score":0.0025684566,"about_ca_system_score_codex":0.0011168672,"about_ca_system_score_gemma":0.0011693303,"threshold_uncertainty_score":0.008592308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018478833,0.00034588244,0.97157955,0.0002240726,0.00007055869,0.00010336768,0.00018185019,0.0013114383,0.0077045057],"genre_scores_gemma":[0.37016046,0.0005450526,0.6194711,0.00033527956,0.000056234123,0.00022569716,0.00086658704,0.00037877305,0.007960812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999435,0.0000999086,0.000032615328,0.000104971456,0.0002451507,0.00008224875],"domain_scores_gemma":[0.99933004,0.0002103719,0.000068969974,0.00018393851,0.0001728277,0.00003387394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042489416,0.0008463145,0.00052951934,0.00090884935,0.000501278,0.00073289644,0.0009788964,0.0004298075,0.0070390985],"category_scores_gemma":[0.0013813943,0.00029987612,0.0009874367,0.00084250787,0.0004583732,0.0017263984,0.0008126562,0.0012783009,0.0009058504],"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.00029293585,0.00021923525,0.0011840946,0.0005335272,0.00010061703,0.00042675724,0.00018469912,0.22844023,0.14190777,0.13211204,0.012218312,0.48237976],"study_design_scores_gemma":[0.00006258204,0.0002198466,0.0004095605,0.00005757279,0.00009978908,0.0003376159,0.000057769244,0.8630363,0.054278158,0.059717372,0.021693649,0.000029882758],"about_ca_topic_score_codex":0.0021051192,"about_ca_topic_score_gemma":0.0045513003,"teacher_disagreement_score":0.0070390985,"about_ca_system_score_codex":0.0009543052,"about_ca_system_score_gemma":0.0014083284,"threshold_uncertainty_score":0.023548126},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037852395,0.0003649917,0.9536228,0.00013201359,0.000036974852,0.000092996976,0.00012967845,0.0022743838,0.005493707],"genre_scores_gemma":[0.31711727,0.00038717652,0.67659223,0.00010976876,0.000026153748,0.00017276921,0.0006879541,0.00022622303,0.004680435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998449,0.000019880219,0.0000092421715,0.000030594736,0.00006821848,0.000027093545],"domain_scores_gemma":[0.99982625,0.000044615357,0.000021934711,0.00004348764,0.000050551287,0.000013187481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020791184,0.00066182105,0.00048074976,0.0005606653,0.0003256944,0.00047577132,0.0007820957,0.00037215627,0.0019879616],"category_scores_gemma":[0.00051601866,0.00019470375,0.00041144763,0.00050196215,0.00024675575,0.0007954604,0.0007800834,0.00042812355,0.0004484571],"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.00010156106,0.00008092074,0.0010943498,0.00022664222,0.00003897864,0.00022009232,0.00011706061,0.40658525,0.06424259,0.021478876,0.0084834425,0.49733028],"study_design_scores_gemma":[0.000049443453,0.00024620953,0.00046065208,0.000021806185,0.000036763515,0.00018972946,0.000038336802,0.95611924,0.018618582,0.010991611,0.013206239,0.000021234926],"about_ca_topic_score_codex":0.0010747664,"about_ca_topic_score_gemma":0.002092875,"teacher_disagreement_score":0.0019879616,"about_ca_system_score_codex":0.0002563391,"about_ca_system_score_gemma":0.00088867027,"threshold_uncertainty_score":0.0066503882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025708623,0.00016683694,0.97087485,0.00012223105,0.00002351839,0.000067553025,0.000008002317,0.0003295043,0.0026989211],"genre_scores_gemma":[0.8523984,0.00012405573,0.14503725,0.000115633324,0.000017354092,0.00014521244,0.000020304744,0.00003114221,0.002110575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967384,0.00010017121,0.000013085007,0.00005721895,0.00010992499,0.000045767385],"domain_scores_gemma":[0.9994248,0.00030398648,0.000092721784,0.000036678455,0.00010487453,0.0000370685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092993095,0.0005416726,0.0005873879,0.00026409756,0.00026205662,0.0005853516,0.00072917354,0.00067768845,0.0011125766],"category_scores_gemma":[0.0017601615,0.00030695956,0.00028912476,0.00019801308,0.00063217274,0.00045469526,0.00049764116,0.00075098925,0.00020512735],"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.000041227213,0.00003519584,0.00028272523,0.00004188436,0.000012167952,0.000044576613,0.00003467696,0.9679759,0.0026359311,0.0029318058,0.00026984623,0.025694031],"study_design_scores_gemma":[0.0000068881022,0.000023765435,0.000028209424,0.0000019922993,0.000002456312,0.0000056490617,0.0000028405213,0.9988349,0.00046723944,0.000417166,0.00020723531,0.0000015909434],"about_ca_topic_score_codex":0.0024261165,"about_ca_topic_score_gemma":0.0022673837,"teacher_disagreement_score":0.0024261165,"about_ca_system_score_codex":0.00048097025,"about_ca_system_score_gemma":0.0011051265,"threshold_uncertainty_score":0.004918039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061643235,0.0005877437,0.9342121,0.0004231985,0.000049062983,0.000064231026,0.00021934445,0.0009500867,0.0018510465],"genre_scores_gemma":[0.9284223,0.00022364935,0.06754737,0.00016447347,0.00004383293,0.00013805955,0.0002708569,0.00009373704,0.0030957218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.00013726445,0.000034329667,0.00017255104,0.00014311477,0.00008831824],"domain_scores_gemma":[0.997396,0.0016456553,0.00033315178,0.00013928924,0.00041474102,0.00007115746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012042777,0.00085282954,0.00082284724,0.0005411196,0.0002839773,0.0007833615,0.0014779866,0.001052186,0.0018018906],"category_scores_gemma":[0.0044516837,0.00039330064,0.0006298732,0.0005174769,0.00062480633,0.00082876,0.00056544977,0.0014512291,0.00029501843],"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.0000309206,0.000011031096,0.0004348183,0.000014213624,0.000006614502,0.00003297947,0.000013039498,0.9908664,0.0004987791,0.0017736424,0.00015163253,0.006165835],"study_design_scores_gemma":[8.411516e-7,0.0000045330685,0.00003180083,9.264711e-7,0.0000012797269,0.000003138794,6.42327e-7,0.99922884,0.00012326006,0.00056255976,0.000041177518,9.537952e-7],"about_ca_topic_score_codex":0.0068545137,"about_ca_topic_score_gemma":0.004334767,"teacher_disagreement_score":0.0068545137,"about_ca_system_score_codex":0.001111915,"about_ca_system_score_gemma":0.0012930656,"threshold_uncertainty_score":0.013629198},"labels":[],"label_agreement":null}]}