{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":62,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":62,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"695272c38598","filters":{"venue":"ACM Transactions on Design Automation of Electronic Systems"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04508213604149722,"gpt":0.2920347453643743,"spread":0.2469526093228771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760014,0.0001408238,0.0001772773,0.0002298384,0.0001262276,0.000140201,0.0004562941,0.00009892727,0.000008056596],"category_scores_gemma":[0.00002425146,0.0001399162,0.0001027999,0.0002886883,0.000009119257,0.0004471364,0.000004928545,0.0001222967,0.00002244577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002445274,"about_ca_system_score_gemma":0.0003049562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001046714,"about_ca_topic_score_gemma":0.00001379855,"domain_scores_codex":[0.9985763,0.00009951138,0.000374785,0.0003700557,0.0002576262,0.0003217397],"domain_scores_gemma":[0.9990116,0.0001474476,0.00007735099,0.0006447906,0.00007961434,0.00003916686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001059245,0.00005752675,1.697726e-7,0.0001333886,0.00007432968,9.598012e-7,0.001803829,0.8884711,0.02946724,0.06345707,0.0003329708,0.0161908],"study_design_scores_gemma":[0.0002688377,0.0001540174,6.157679e-7,0.00005179518,0.0000223962,0.00001174019,0.00003684933,0.9841501,0.01338395,0.001437543,0.0003539745,0.0001281595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00173295,0.0009884716,0.9951492,0.0002750774,0.0005598754,0.000736535,0.00002979298,0.0004969325,0.00003115079],"genre_scores_gemma":[0.9271117,0.00002482285,0.0717257,0.00003663055,0.0000679914,0.0003064772,0.00001247906,0.00001938024,0.0006947449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9253788,"threshold_uncertainty_score":0.5705617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01513613627712711,"gpt":0.2484756168493447,"spread":0.2333394805722176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828098,0.0001255956,0.0002172297,0.0001944756,0.0001895744,0.00003245576,0.0008286936,0.00008989692,0.000002714026],"category_scores_gemma":[0.00008439454,0.00009344256,0.0001324078,0.0005136226,0.00004061679,0.0001095497,0.000007172667,0.0001427784,0.000001067748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007506376,"about_ca_system_score_gemma":0.00009404338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000361999,"about_ca_topic_score_gemma":0.000003455079,"domain_scores_codex":[0.9986975,0.0001170295,0.0004292982,0.000207846,0.0002335122,0.0003148594],"domain_scores_gemma":[0.995424,0.00345564,0.0002769137,0.0006754262,0.000138092,0.00002987322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004476438,0.00009838114,0.000001677424,0.00007733671,0.0001326554,3.663911e-7,0.0002383573,0.5072809,0.001715541,0.01018045,0.0002543822,0.4799751],"study_design_scores_gemma":[0.0001172252,0.0003405443,0.00003137878,0.0001195584,0.00003016739,0.0000162439,0.00003480347,0.9250978,0.07253963,0.0009676048,0.0006073298,0.00009769883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003550276,0.0003968505,0.9977594,0.0003044778,0.0002303059,0.0007098964,0.000002403852,0.0001979042,0.00004375002],"genre_scores_gemma":[0.9003886,0.00004099822,0.09935494,0.00001994124,0.0000453227,0.00007645299,4.197919e-7,0.00001067913,0.00006266699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9000335,"threshold_uncertainty_score":0.3810477,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01639255976864738,"gpt":0.2306119995168358,"spread":0.2142194397481884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004874851,0.0002786841,0.0003527695,0.000305709,0.0001269931,0.00005487249,0.0003534573,0.0001966185,0.00006980712],"category_scores_gemma":[0.00002537086,0.0002844558,0.0001557791,0.0003415418,0.00001898736,0.0004522767,0.00000175208,0.0002256172,0.00008572391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003735756,"about_ca_system_score_gemma":0.0001203035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004338355,"about_ca_topic_score_gemma":0.0000162683,"domain_scores_codex":[0.998183,0.00005525607,0.0006041988,0.000258822,0.0002836307,0.0006150808],"domain_scores_gemma":[0.9987988,0.0002699144,0.0001150899,0.000612904,0.0001239032,0.00007941531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006149051,0.00006749738,0.000001296358,0.0001152316,0.0001406368,1.689042e-7,0.0003209566,0.9823738,0.008816274,0.0004885286,0.0007254634,0.006888693],"study_design_scores_gemma":[0.0009082983,0.000412151,0.000003288642,0.00007280833,0.00006033272,0.000009589502,0.00004001749,0.9421146,0.05479726,0.0002919674,0.001021129,0.0002685916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01055288,0.0003996774,0.9861587,0.0001140069,0.0002769375,0.001416092,0.00001090595,0.0008014767,0.0002693757],"genre_scores_gemma":[0.9634247,0.00007476804,0.03489328,0.00002946605,0.00004378649,0.000850172,0.000007002413,0.00007220335,0.0006045854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9528719,"threshold_uncertainty_score":0.9999608,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06655507728057433,"gpt":0.2663195237633659,"spread":0.1997644464827915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201593,0.000208965,0.0003798268,0.0004504342,0.0001985857,0.00003170403,0.0009871849,0.0001463973,0.00001778281],"category_scores_gemma":[0.0002908677,0.0001921071,0.0001421392,0.0008098874,0.000110787,0.0006706444,0.000006102125,0.0001680835,0.00003931637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002489648,"about_ca_system_score_gemma":0.000509897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005735584,"about_ca_topic_score_gemma":0.000001172828,"domain_scores_codex":[0.997209,0.0006566201,0.0008199369,0.0003447257,0.0006369159,0.0003328443],"domain_scores_gemma":[0.9973876,0.0004104616,0.0005206737,0.001301785,0.000323852,0.00005559448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003814278,0.002042847,0.000092067,0.001143459,0.0005327975,0.000004433131,0.002223308,0.7452021,0.1290819,0.04945309,0.0003867944,0.06945579],"study_design_scores_gemma":[0.0002383792,0.0002936248,0.0003829256,0.0001255369,0.00002171121,0.00002713541,0.00002539135,0.5953087,0.403247,0.0001361463,0.00005784726,0.0001355756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0149637,0.000163944,0.9832833,0.0001361464,0.0002542188,0.0006619225,0.000003752026,0.0004042228,0.0001288159],"genre_scores_gemma":[0.755522,0.00002820885,0.2440411,0.00001328652,0.000009294362,0.0002778798,0.000001145482,0.00001568698,0.00009137563],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7405583,"threshold_uncertainty_score":0.7833902,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01641232852791342,"gpt":0.232863703928349,"spread":0.2164513754004356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454802,0.0001611845,0.0002063325,0.0002574954,0.00008231545,0.00002612624,0.0002559004,0.0001313707,0.0001461457],"category_scores_gemma":[0.00001524589,0.0001635674,0.00006643689,0.0003419121,0.00004617769,0.0001634085,0.000001128387,0.0001511672,0.0001731247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001864383,"about_ca_system_score_gemma":0.00004734579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001172749,"about_ca_topic_score_gemma":0.000003205481,"domain_scores_codex":[0.9988996,0.00008617914,0.0003516242,0.0001517403,0.0002066067,0.0003042454],"domain_scores_gemma":[0.9991947,0.0001359397,0.00006119482,0.0004695884,0.00009408311,0.0000445044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000209741,0.0004364561,0.0000201594,0.0007094403,0.001058294,0.000004594452,0.001981679,0.3613797,0.3839213,0.01256344,0.02402907,0.2136861],"study_design_scores_gemma":[0.0004704187,0.001115723,0.00004594811,0.0001506487,0.00005536844,0.00004236954,0.00007566571,0.5074853,0.4840004,0.001822643,0.004377157,0.0003583945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002990474,0.0002804968,0.9929577,0.00002493279,0.0003044591,0.0004559235,0.000005257516,0.001304521,0.001676289],"genre_scores_gemma":[0.9938956,0.00007317639,0.005440502,0.0000108937,0.00006673197,0.000129601,0.000002603887,0.00003727107,0.000343594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9909052,"threshold_uncertainty_score":0.6670086,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04243979017234586,"gpt":0.2555399393723056,"spread":0.2131001491999598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00113491,0.0003813754,0.0004881258,0.0008116656,0.0001868243,0.00006987729,0.0005414458,0.0002207716,0.00002686696],"category_scores_gemma":[0.00009857485,0.0003935153,0.0001317514,0.001484739,0.00002630967,0.0001972096,0.000004013415,0.0001900946,0.0002179011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005010341,"about_ca_system_score_gemma":0.0001398878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001923156,"about_ca_topic_score_gemma":0.00003913975,"domain_scores_codex":[0.9972886,0.0002362452,0.0006895956,0.0004853572,0.000502362,0.0007978636],"domain_scores_gemma":[0.9972092,0.001571481,0.0001191585,0.0008062382,0.0001579884,0.0001359579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005897695,0.00009202741,0.00000468266,0.00007149757,0.0001821441,8.77422e-7,0.0004178882,0.9565151,0.02180534,0.000157614,0.001969969,0.01872386],"study_design_scores_gemma":[0.0009388091,0.0006986656,0.000435539,0.0001381227,0.00004116869,0.000001951262,0.00004683299,0.9209054,0.07571883,0.0001642113,0.0005088566,0.0004015715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01306512,0.0001339921,0.9827083,0.00003310894,0.0008766474,0.001498625,0.0002333222,0.001393675,0.00005723787],"genre_scores_gemma":[0.9947816,0.00006033459,0.003172987,0.00003049925,0.00006646839,0.001313486,0.0001304813,0.0001289286,0.000315192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9817165,"threshold_uncertainty_score":0.9998516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02679862810034436,"gpt":0.2481109895829867,"spread":0.2213123614826423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024697,0.0002159306,0.000314914,0.0003569465,0.0001197414,0.00004089362,0.0002768112,0.0001798166,0.0001208407],"category_scores_gemma":[0.00003124529,0.0002271573,0.0001560302,0.0004977072,0.00002280448,0.0001453683,4.687712e-7,0.000193145,0.000040502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003088376,"about_ca_system_score_gemma":0.00007828324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215958,"about_ca_topic_score_gemma":0.000001201683,"domain_scores_codex":[0.9985086,0.00009666873,0.0005112887,0.000218996,0.0002396111,0.0004248401],"domain_scores_gemma":[0.9988631,0.0005071472,0.00007881036,0.0004142512,0.00007551805,0.00006117994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004282939,0.00008265226,0.000002376049,0.0001430644,0.00009067004,4.046184e-7,0.00008985311,0.9320243,0.01610345,0.0003264683,0.0004726574,0.05062126],"study_design_scores_gemma":[0.0005467748,0.0004898149,0.00001157202,0.0001282791,0.00006119904,0.000009448078,0.00001972372,0.8775274,0.1195249,0.0002895748,0.001157742,0.0002336522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002456667,0.0001779677,0.9944888,0.00004709656,0.0001158704,0.001019768,0.00001593124,0.001180439,0.0004974061],"genre_scores_gemma":[0.9722694,0.00003840262,0.02690162,0.00001693652,0.00004353347,0.0004583299,0.00001293287,0.00005649268,0.0002024262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9698126,"threshold_uncertainty_score":0.9263206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01921829519063999,"gpt":0.2417965468462166,"spread":0.2225782516555766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004048172,0.0002160945,0.0003561303,0.0004557515,0.00005940206,0.00005119271,0.0005045971,0.0001973276,0.0002161476],"category_scores_gemma":[0.0000292215,0.0002204457,0.00007347277,0.0004975561,0.00003125984,0.00032084,0.000002573744,0.0003921431,0.0006599204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005233961,"about_ca_system_score_gemma":0.00006442276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001818069,"about_ca_topic_score_gemma":0.000001115752,"domain_scores_codex":[0.9982074,0.0001201977,0.0005082984,0.0002608774,0.0003622091,0.0005410464],"domain_scores_gemma":[0.9984003,0.0004194553,0.00009760364,0.0009423513,0.00009475982,0.00004555417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000162036,0.00002744159,0.00001029995,0.0002898881,0.0001109309,7.699128e-7,0.00002998019,0.9571544,0.03547828,0.0004075715,0.0004587688,0.006015488],"study_design_scores_gemma":[0.0006832612,0.0005468579,0.0000545942,0.0003186755,0.00002292565,0.0000607708,0.0003578527,0.9021115,0.09159378,0.0003809653,0.003474676,0.0003941896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02681833,0.0008569426,0.967078,0.00006452754,0.0008150336,0.001296399,0.00001292857,0.001337779,0.00172011],"genre_scores_gemma":[0.997035,0.0001793802,0.0007459061,0.000005836913,0.00001835669,0.000302731,0.000006060483,0.00005645771,0.001650333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9702166,"threshold_uncertainty_score":0.8989515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01515586658912994,"gpt":0.2190371016718792,"spread":0.2038812350827493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003226266,0.000167512,0.0002136596,0.0002424611,0.0000504118,0.00001762973,0.0002329298,0.0001349886,0.0001775432],"category_scores_gemma":[0.00001810234,0.0001291383,0.00007980857,0.0002332979,0.00002656633,0.0002094763,0.000001091228,0.000106529,0.0001262352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002664904,"about_ca_system_score_gemma":0.00004538818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007084663,"about_ca_topic_score_gemma":0.000001599366,"domain_scores_codex":[0.998862,0.0000943292,0.0003636251,0.0001564993,0.0002130076,0.0003104916],"domain_scores_gemma":[0.9991031,0.0002688465,0.00006393427,0.0004652324,0.00005140925,0.00004744648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007235008,0.0001534942,0.00001400917,0.0002474278,0.0004278286,0.000002491943,0.0002824233,0.09224038,0.500372,0.004180956,0.004446466,0.3975602],"study_design_scores_gemma":[0.00134606,0.0009078667,0.0001083509,0.0006305625,0.00009367491,0.00006805448,0.00006212446,0.1161819,0.8689765,0.003849176,0.00710487,0.0006708182],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001798196,0.0004305294,0.9952655,0.00007556629,0.0002203399,0.0004528294,0.00001002061,0.001223415,0.0005236455],"genre_scores_gemma":[0.9959738,0.0002675251,0.002632149,0.000007613419,0.00002946489,0.0001972133,0.000001194447,0.00003999968,0.0008510462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9941756,"threshold_uncertainty_score":0.5266106,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03160563532945789,"gpt":0.269428785904522,"spread":0.2378231505750641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004417096,0.0002248778,0.0003523488,0.0004368155,0.0001159637,0.00005486338,0.0004293329,0.0001897629,0.00001380343],"category_scores_gemma":[0.00005071601,0.000235262,0.00009323261,0.0003989855,0.00001906929,0.0003315161,0.000001945864,0.0002754612,0.0000206133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004523629,"about_ca_system_score_gemma":0.00006333923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009252711,"about_ca_topic_score_gemma":8.931949e-7,"domain_scores_codex":[0.9982004,0.00004609972,0.0005802612,0.0002582583,0.0003134774,0.0006014665],"domain_scores_gemma":[0.9987794,0.0002621954,0.00008778391,0.0006842348,0.0001371249,0.00004923675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002274105,0.00003706535,5.805059e-7,0.0001582018,0.00006445621,6.213208e-7,0.00002554082,0.9696947,0.02061108,0.0008385486,0.0002623237,0.008284132],"study_design_scores_gemma":[0.0004004851,0.0004055027,0.00000307723,0.0001271674,0.00002219875,0.00001788722,0.0001351685,0.9824951,0.01435373,0.001496064,0.0003353668,0.0002082116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004149179,0.0009383251,0.9918415,0.00006380468,0.0002553882,0.00137367,0.00001975299,0.001215406,0.0001430063],"genre_scores_gemma":[0.9947843,0.0001273027,0.004219236,0.000009520615,0.00003479183,0.0004556685,0.00001205503,0.00004614287,0.000311015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906351,"threshold_uncertainty_score":0.9593707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Electronic circuit; Algorithm; Iterative method; Computer engineering; Time complexity; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01542639401836413,"gpt":0.2255704286877004,"spread":0.2101440346693363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004457156,0.0001598991,0.0002161588,0.0002157078,0.00006510258,0.00002235649,0.0001803918,0.0001246409,0.00007548283],"category_scores_gemma":[0.00002567499,0.0001649161,0.00007880183,0.0003234461,0.00002066246,0.0001400977,4.741422e-7,0.0001805292,0.00005180562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001892338,"about_ca_system_score_gemma":0.00005182712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008585549,"about_ca_topic_score_gemma":0.000001551233,"domain_scores_codex":[0.9988742,0.0001569323,0.0003413359,0.0001422108,0.0001974759,0.0002878834],"domain_scores_gemma":[0.9992534,0.0001507765,0.00005758556,0.0004387881,0.00005433093,0.00004511679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003461451,0.0003136939,0.00002209106,0.0004461633,0.000454679,0.000003296356,0.0004747078,0.7823825,0.134678,0.03585589,0.003201116,0.04213327],"study_design_scores_gemma":[0.0008583309,0.0007747822,0.00008384243,0.0001773229,0.000102503,0.00009812932,0.0001314143,0.201603,0.7769831,0.01168281,0.006841012,0.0006638199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002689606,0.0004863659,0.9937742,0.0000101944,0.0002165717,0.0004663196,0.000004433995,0.0009396715,0.001412572],"genre_scores_gemma":[0.9935064,0.0001084363,0.005971024,0.000006254286,0.00001056731,0.000148917,0.00000214918,0.00003198677,0.0002142263],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9908168,"threshold_uncertainty_score":0.6725083,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03766661338923844,"gpt":0.2763364236044197,"spread":0.2386698102151812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00114075,0.0002361393,0.0004077443,0.0005691421,0.0002054305,0.00007207481,0.0009612057,0.0001737879,0.00001181465],"category_scores_gemma":[0.00009872107,0.0002507835,0.0001110423,0.0009114599,0.00005555263,0.0004660173,0.00001362207,0.000207232,0.00000517002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002748686,"about_ca_system_score_gemma":0.0004008332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004388825,"about_ca_topic_score_gemma":3.278344e-7,"domain_scores_codex":[0.9975162,0.0004665284,0.0007954118,0.0003914816,0.000421168,0.0004091917],"domain_scores_gemma":[0.9976561,0.0005397318,0.0005621546,0.0008412472,0.0003406326,0.00006010728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000144394,0.0001130715,0.000006498767,0.00003959696,0.00005005916,0.000001744927,0.0002349486,0.9604809,0.004345665,0.0004639033,0.00003816676,0.03421104],"study_design_scores_gemma":[0.0002307119,0.0006375705,0.000008647316,0.0002628477,0.00002687893,0.0001193,0.00002433201,0.937924,0.06005267,0.0004532712,0.00003778639,0.0002219318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009677709,0.000347583,0.9965647,0.00003057488,0.0001229866,0.0007538057,0.000001793513,0.001163953,0.00004685017],"genre_scores_gemma":[0.524151,0.00007256472,0.4756567,0.0000099813,0.00001393995,0.0000417414,0.000001154825,0.00001589182,0.0000370808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5231832,"threshold_uncertainty_score":0.9999945,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01372837880318961,"gpt":0.2208525644390823,"spread":0.2071241856358927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006498416,0.0002389872,0.0003317601,0.0002167646,0.00009306594,0.00002579676,0.0002687917,0.000181074,0.00005059176],"category_scores_gemma":[0.00002881829,0.0002470028,0.0001198871,0.0004198378,0.00004659118,0.0002435748,0.000002013697,0.0002530813,0.00003863248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007958916,"about_ca_system_score_gemma":0.00008749927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009702417,"about_ca_topic_score_gemma":0.00001297205,"domain_scores_codex":[0.9983281,0.000148489,0.0005841529,0.0002586852,0.0002929879,0.0003875695],"domain_scores_gemma":[0.9988801,0.0001583639,0.00009378704,0.0007019475,0.00009648148,0.00006929478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003119417,0.0002125,0.000008937011,0.0002529624,0.0001480727,7.250075e-7,0.0003841136,0.945714,0.03979697,0.0004859198,0.00004876007,0.01291588],"study_design_scores_gemma":[0.00160816,0.001188622,0.0006379412,0.000258016,0.0001123168,0.00005820886,0.0001501727,0.4745181,0.5000036,0.02064072,0.0001190252,0.0007051353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01569395,0.0002503175,0.9810951,0.00005167388,0.0002172491,0.001061983,0.0000144915,0.001472182,0.0001429853],"genre_scores_gemma":[0.9943501,0.0000516703,0.005185965,0.000008805564,0.00002148364,0.0003110746,0.000008050873,0.00003834022,0.00002454386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9786561,"threshold_uncertainty_score":0.9999982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02098426207336195,"gpt":0.2216165025986767,"spread":0.2006322405253148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004631365,0.0001600536,0.0002079936,0.0001170356,0.00009680413,0.00003017216,0.00009964965,0.00009300593,0.00001302956],"category_scores_gemma":[0.00002549172,0.0001676174,0.00004770682,0.0001704859,0.00001896659,0.0001512904,0.000002127038,0.0001718895,0.000003303639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001835446,"about_ca_system_score_gemma":0.00001638378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006355113,"about_ca_topic_score_gemma":0.000001310673,"domain_scores_codex":[0.998897,0.0001062829,0.000414233,0.0002132996,0.0001752588,0.0001939874],"domain_scores_gemma":[0.9994948,0.0001356193,0.00009130056,0.0001724731,0.00004911394,0.00005671381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001077314,0.00003888306,0.00002653305,0.0006423699,0.0001728476,2.464062e-7,0.000485866,0.973732,0.005553925,0.0007182414,0.00009549731,0.01842585],"study_design_scores_gemma":[0.0006589204,0.0009034951,0.00008967514,0.00009068402,0.00008860053,0.000005108635,0.0001432909,0.9763062,0.0206948,0.0003060465,0.00057333,0.0001398452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003136834,0.0005283433,0.9936058,0.00007729208,0.0001095456,0.0015363,0.00001899682,0.0009127024,0.00007421045],"genre_scores_gemma":[0.9920716,0.0002357222,0.007046757,0.00001136409,0.0000216487,0.0005000193,0.00002337503,0.00002899973,0.00006054928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9889348,"threshold_uncertainty_score":0.683524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02945589091723973,"gpt":0.2916100862890081,"spread":0.2621541953717684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537231,0.0001994341,0.0002428914,0.0007279046,0.0002414311,0.0001141087,0.0006335735,0.000160776,0.0000149888],"category_scores_gemma":[0.00002747248,0.0002079294,0.0001058282,0.001241621,0.00003368574,0.0007768817,0.000005115906,0.0001845324,0.000006875318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003145744,"about_ca_system_score_gemma":0.0001556461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003016483,"about_ca_topic_score_gemma":0.000001675243,"domain_scores_codex":[0.9978661,0.0002236564,0.0007317882,0.0003052448,0.0004531845,0.0004200509],"domain_scores_gemma":[0.9984667,0.0002065431,0.0003663154,0.0006192877,0.0002709503,0.00007024412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001672596,0.0001295789,7.006157e-7,0.00002621502,0.00002921405,4.076788e-7,0.0003399373,0.897506,0.0003515362,0.002121161,0.00001898457,0.09945955],"study_design_scores_gemma":[0.0003585642,0.0004128323,0.00001589889,0.00007077055,0.00001991978,0.00003444674,0.00004842212,0.982656,0.01579743,0.000277858,0.0001128404,0.0001949968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004662373,0.0001176914,0.9961952,0.00008887233,0.000241488,0.0008786418,0.000001158304,0.001377364,0.0006333466],"genre_scores_gemma":[0.5550622,0.00002135085,0.4447527,0.00001824285,0.00001695622,0.00004073649,0.000005320074,0.00001333081,0.00006919074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5545959,"threshold_uncertainty_score":0.8479116,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01092210371300435,"gpt":0.2083514887250244,"spread":0.1974293850120201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887296,0.0001461175,0.0001821025,0.0001204171,0.00009151443,0.00002805619,0.000115743,0.0001608817,0.000008772087],"category_scores_gemma":[0.0001102312,0.0001328478,0.00003078732,0.0001057019,0.00003346031,0.0001301498,0.000001550884,0.000164521,0.000002800305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008759316,"about_ca_system_score_gemma":0.00002457607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008600015,"about_ca_topic_score_gemma":0.000002204304,"domain_scores_codex":[0.999134,0.00003192525,0.0002875363,0.0001656632,0.0001434675,0.0002373907],"domain_scores_gemma":[0.9992052,0.0004159809,0.00005340572,0.000231026,0.00006422502,0.00003018302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001676906,0.0001742347,0.00001991144,0.001093133,0.0004465408,3.415259e-7,0.0006017569,0.5800781,0.172411,0.008360527,0.0006118538,0.2360349],"study_design_scores_gemma":[0.0007507049,0.001196747,0.0002997694,0.0001085961,0.00007647771,0.000009318198,0.0002487827,0.9471827,0.04888868,0.0005192403,0.0005350017,0.0001839864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03611911,0.0002655776,0.9620078,0.00006420587,0.0001758061,0.0006789541,0.00003850408,0.0005805708,0.00006943964],"genre_scores_gemma":[0.9888799,0.00006740604,0.01058976,0.00001050112,0.00003158692,0.0003362549,0.00001143591,0.00002424986,0.00004886111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9527608,"threshold_uncertainty_score":0.5417376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01522359722551002,"gpt":0.2358766055533257,"spread":0.2206530083278157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007577754,0.000230851,0.0003112699,0.000299082,0.0001273301,0.00004571582,0.0001737544,0.0001912724,0.00002268946],"category_scores_gemma":[0.0002188395,0.0002535363,0.00008210503,0.0003107428,0.00003359348,0.0001910754,0.000001086376,0.0001895676,0.000008149883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004003446,"about_ca_system_score_gemma":0.00007891405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009289828,"about_ca_topic_score_gemma":0.000004941727,"domain_scores_codex":[0.9985586,0.0001999022,0.0003989868,0.0002442429,0.0002117584,0.0003865585],"domain_scores_gemma":[0.9970962,0.002189141,0.0001359224,0.0003888643,0.0001243979,0.00006545231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004299253,0.00003710167,0.000001448388,0.0001893893,0.00009297363,3.788328e-8,0.00006314992,0.9687781,0.001281421,0.0005798674,0.000126956,0.02880655],"study_design_scores_gemma":[0.0009105004,0.0007951501,0.00002659092,0.00009167124,0.00007776502,0.000004982573,0.00001272736,0.9790016,0.01798802,0.0001942227,0.0006764905,0.0002202274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002180362,0.0003411922,0.9930049,0.00007682994,0.000294254,0.003515661,0.00001420373,0.0004915735,0.00008109423],"genre_scores_gemma":[0.9815683,0.00003814115,0.01606225,0.00003079263,0.00005039189,0.002125929,0.00001957545,0.00006479848,0.00003986105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9793879,"threshold_uncertainty_score":0.9999917,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1576475775791615,"gpt":0.3476167720200399,"spread":0.1899691944408783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003316886,0.0003354271,0.0006225714,0.000616139,0.0002455903,0.00006391557,0.0007034468,0.0001709052,0.00001092405],"category_scores_gemma":[0.0004544739,0.0003442721,0.0001350337,0.0009922796,0.00008358007,0.001372557,0.00001002803,0.0001797124,0.00001441341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006884316,"about_ca_system_score_gemma":0.0005378428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004017302,"about_ca_topic_score_gemma":0.000009559769,"domain_scores_codex":[0.9953926,0.001663393,0.000942888,0.0006439728,0.0009432433,0.0004139108],"domain_scores_gemma":[0.9938418,0.001729524,0.000972324,0.0008973261,0.002482691,0.00007638356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007466527,0.0003287997,3.467599e-7,0.00003374026,0.0001504441,4.89088e-8,0.00150651,0.9470512,0.003805498,0.005380664,0.00002076408,0.04164732],"study_design_scores_gemma":[0.003019705,0.001221059,0.00006640451,0.00008173463,0.0001012015,0.000005655234,0.0002641176,0.8802745,0.1083422,0.006342471,0.00001198611,0.0002689584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00013694,0.0001207093,0.994769,0.00008536281,0.0004591524,0.004152516,0.00002809563,0.0002255534,0.00002272069],"genre_scores_gemma":[0.5152164,0.0000108965,0.4835468,0.000008898801,0.00002119259,0.001103169,0.00001464784,0.00001959121,0.00005836812],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5150795,"threshold_uncertainty_score":0.9999009,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0452735509172989,"gpt":0.2365789759006835,"spread":0.1913054249833846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000877629,0.0002313619,0.0003277629,0.0004045771,0.0003040827,0.0001202151,0.0007085829,0.0001795527,0.00006202549],"category_scores_gemma":[0.00002948939,0.0002317149,0.0001744484,0.0007365945,0.00002942267,0.0005303275,0.000004834699,0.0001768609,0.00004298325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004159058,"about_ca_system_score_gemma":0.000099921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003673614,"about_ca_topic_score_gemma":0.000002029704,"domain_scores_codex":[0.9976938,0.0004035392,0.0006225831,0.0004625366,0.0003487681,0.0004688183],"domain_scores_gemma":[0.9980679,0.0004129671,0.0003526764,0.0008049448,0.0002853094,0.00007622503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007419648,0.0002746891,6.029888e-7,0.00007015243,0.0002433152,0.000001284836,0.001050296,0.9280814,0.007574474,0.01411254,0.007999592,0.04051745],"study_design_scores_gemma":[0.0007056863,0.001041836,0.000001970566,0.00007239464,0.00003518563,0.0001350586,0.0001299409,0.9841778,0.01065807,0.0008053565,0.002002471,0.0002342567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004987821,0.0005226181,0.9953495,0.000342806,0.00145851,0.001284463,0.000002833256,0.0003789907,0.0001615284],"genre_scores_gemma":[0.9656523,0.00007027966,0.0313369,0.00002037597,0.0001340928,0.0003247437,0.000002106341,0.00002479987,0.002434442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9651535,"threshold_uncertainty_score":0.944906,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01995503269910463,"gpt":0.2521383259182732,"spread":0.2321832932191685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001613093,0.0002918143,0.0004129118,0.0004932776,0.0003312143,0.0002465693,0.0007997936,0.0002487887,0.00004448912],"category_scores_gemma":[0.0002517193,0.0002952785,0.0001024047,0.000547622,0.00005765848,0.000726952,0.000007512509,0.0005729539,0.00007810504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001554772,"about_ca_system_score_gemma":0.0002393055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007604512,"about_ca_topic_score_gemma":0.00001415823,"domain_scores_codex":[0.9973031,0.0003772495,0.0007572611,0.0005819271,0.0004844892,0.0004960307],"domain_scores_gemma":[0.9971448,0.0008159468,0.0004172455,0.001238573,0.0002676866,0.0001157519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002338134,0.0009961423,0.0001130123,0.0008400662,0.0006307525,0.00001947396,0.002880282,0.2181619,0.4710242,0.1618753,0.001972917,0.1412521],"study_design_scores_gemma":[0.0009784262,0.001373942,0.00009469358,0.0007131831,0.0000521919,0.00020529,0.00008776656,0.580786,0.404824,0.009237613,0.0009800249,0.0006668983],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008620093,0.0001511354,0.9880104,0.0002763597,0.0005069168,0.0009427776,0.000005104144,0.001163641,0.0003235486],"genre_scores_gemma":[0.869818,0.00002677785,0.1293542,0.00004711202,0.00004878896,0.0002748632,0.000003810272,0.00003131387,0.0003950888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8611979,"threshold_uncertainty_score":0.9999499,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02188672287728989,"gpt":0.2495763181611718,"spread":0.2276895952838819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473269,0.0002517816,0.0003225872,0.0003555785,0.0002169658,0.00003924296,0.0002343072,0.0001559464,0.00002094173],"category_scores_gemma":[0.00005094081,0.0002436204,0.00009523853,0.0005905302,0.00008832417,0.0003618262,0.000002312107,0.0002441912,0.000003799919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000365311,"about_ca_system_score_gemma":0.00007579357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001635585,"about_ca_topic_score_gemma":0.00002334797,"domain_scores_codex":[0.9983466,0.00009008743,0.0005077934,0.0003082015,0.0002802743,0.0004670284],"domain_scores_gemma":[0.9987439,0.0002895478,0.0001658464,0.0004681771,0.000274039,0.00005849255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002747315,0.0001586747,0.0001144712,0.0003887334,0.0004840053,0.000001009859,0.0003005084,0.9658011,0.01039063,0.0008575266,0.0003584103,0.02087016],"study_design_scores_gemma":[0.0004724812,0.001380029,0.00009389982,0.0002968697,0.0001085172,0.00003158196,0.0001593789,0.9010323,0.09554468,0.0003383937,0.0002437105,0.0002982178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004115317,0.0001350611,0.9924024,0.00001550948,0.0004047662,0.001492774,0.00001403016,0.001113741,0.0003064526],"genre_scores_gemma":[0.9074347,0.00002791253,0.09177499,0.0000075563,0.00006725045,0.0005563156,0.00001611416,0.00005788634,0.00005725408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033194,"threshold_uncertainty_score":0.9934551,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02651266147675879,"gpt":0.2594698317725862,"spread":0.2329571702958274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052119,0.0002935383,0.0004139278,0.0004874298,0.0002898964,0.00009999239,0.001461189,0.0002082244,0.000003249501],"category_scores_gemma":[0.0001434907,0.0002336852,0.0001057751,0.0004111869,0.00006447302,0.001359011,0.00001051353,0.000165122,0.00001807574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006549321,"about_ca_system_score_gemma":0.0003062601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003135283,"about_ca_topic_score_gemma":0.000008222986,"domain_scores_codex":[0.9974034,0.0003961026,0.0005883615,0.0006231311,0.0004449777,0.0005440405],"domain_scores_gemma":[0.9964334,0.001067855,0.0004708429,0.001658124,0.0002891166,0.00008061637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001433518,0.0002101623,6.820397e-7,0.0001436607,0.0001470378,0.000003851298,0.0001868396,0.7266812,0.09338751,0.1502606,0.0001303324,0.02870473],"study_design_scores_gemma":[0.00124148,0.001931657,0.00000335291,0.0002688999,0.00003692663,0.00002603631,0.0001349479,0.8774019,0.1101479,0.008383785,0.00009120754,0.000331936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001891421,0.0002327193,0.9941404,0.0001878703,0.0005298408,0.001679256,0.00004867543,0.001276921,0.00001283511],"genre_scores_gemma":[0.904966,0.00001630468,0.09406589,0.00001873513,0.00002574285,0.0007347114,0.000004184454,0.00003255804,0.0001358926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9030746,"threshold_uncertainty_score":0.9529408,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0343571888096782,"gpt":0.2681399171626417,"spread":0.2337827283529635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131199,0.0003914979,0.0005787727,0.0004351275,0.0004653654,0.0001732877,0.000979614,0.0002149967,0.0000305577],"category_scores_gemma":[0.0001344117,0.0002661042,0.00016892,0.0006922662,0.00007438239,0.001125888,0.00001118782,0.0001904878,0.0001678101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006486363,"about_ca_system_score_gemma":0.0006449716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004288595,"about_ca_topic_score_gemma":0.00001215175,"domain_scores_codex":[0.9966034,0.0002011342,0.0009922236,0.0008017541,0.000677311,0.0007241805],"domain_scores_gemma":[0.995006,0.002099189,0.0006997907,0.001595242,0.0004335984,0.0001661357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002434068,0.002048353,0.00005983418,0.001503567,0.001540792,0.00001027088,0.002698684,0.5505698,0.2811399,0.04108606,0.0005027948,0.1164059],"study_design_scores_gemma":[0.00670852,0.00353811,0.0001735616,0.001937755,0.0001745065,0.0001239223,0.0004527207,0.8404753,0.143043,0.001934192,0.0003431886,0.001095327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01653903,0.0000442468,0.9787272,0.0003481775,0.0001691247,0.003377478,0.00002755098,0.0006697715,0.0000974668],"genre_scores_gemma":[0.782316,0.00004182425,0.2142021,0.00002077139,0.00009180591,0.002287426,0.00001025366,0.00005641582,0.0009734214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7657769,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Verilog; Computer architecture; Embedded system; Parallel computing; Field-programmable gate array","retraction":null,"screen_n_in":null,"score":{"opus":0.03001254172624539,"gpt":0.2764101130795037,"spread":0.2463975713532583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060391,0.0002177909,0.0002898885,0.0006617482,0.000216438,0.00021743,0.0008700136,0.0001566995,0.00001752763],"category_scores_gemma":[0.0004437644,0.0002309016,0.0001056541,0.001213161,0.00003586126,0.0004761198,0.00001294595,0.0002647601,0.00002479285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007980801,"about_ca_system_score_gemma":0.001074844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005988227,"about_ca_topic_score_gemma":0.000002685067,"domain_scores_codex":[0.9976088,0.0003044074,0.0006156593,0.0004327024,0.0005510838,0.0004873154],"domain_scores_gemma":[0.9972607,0.001168522,0.0001620886,0.00109042,0.0002636614,0.00005462359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001841753,0.0001612659,0.00001794727,0.0002204733,0.00009049794,0.000001382816,0.00007444136,0.9007902,0.0661629,0.004773436,0.0001127187,0.02757637],"study_design_scores_gemma":[0.0005316193,0.0002627229,0.000208257,0.0001417266,0.00002418079,0.000007877081,0.000007885174,0.950222,0.04814051,0.0002339122,0.00004343154,0.0001759454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02141879,0.000158885,0.9761227,0.0001926755,0.0005939996,0.0007999814,0.000002348665,0.0006893464,0.00002127429],"genre_scores_gemma":[0.8697078,0.000003561174,0.1299355,0.00003511231,0.00003010017,0.0001311095,0.000003224009,0.0000183192,0.0001352726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.848289,"threshold_uncertainty_score":0.9415893,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01784580412577238,"gpt":0.2380836591198523,"spread":0.2202378549940799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470774,0.0001765848,0.0002264721,0.0002723981,0.00008737158,0.00003205523,0.0002728904,0.0001442504,0.000186779],"category_scores_gemma":[0.00001560768,0.0001773165,0.00007817373,0.0003677946,0.00005128647,0.0001957537,0.000001264195,0.0001615429,0.0001761296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001911032,"about_ca_system_score_gemma":0.00005123125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001832911,"about_ca_topic_score_gemma":0.000003586895,"domain_scores_codex":[0.9987934,0.00009463054,0.0003877902,0.0001662323,0.0002296724,0.0003282434],"domain_scores_gemma":[0.9991457,0.0001172515,0.00006653518,0.0005138681,0.0001082966,0.00004830778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002202762,0.0005446855,0.00002392199,0.000850995,0.001376745,0.000006352048,0.002424628,0.2823444,0.4547756,0.0205586,0.03407747,0.2027963],"study_design_scores_gemma":[0.0005842936,0.001196831,0.00006116905,0.0001912215,0.00007718896,0.00005206702,0.00007760625,0.4372786,0.548233,0.002441244,0.009346448,0.0004603459],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002353876,0.0003225489,0.9930903,0.00002974328,0.0003516586,0.0004806403,0.000005905152,0.001324159,0.002041209],"genre_scores_gemma":[0.9938015,0.00007497507,0.005400153,0.00001466603,0.00007623803,0.0001483588,0.000002991392,0.00004278122,0.0004383343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9914476,"threshold_uncertainty_score":0.7230755,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03096008423381525,"gpt":0.2810010768775404,"spread":0.2500409926437251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145059,0.0001658625,0.0002027882,0.0001372617,0.0003533025,0.0001001917,0.0008398349,0.00007112831,0.000003879903],"category_scores_gemma":[0.0001223705,0.00009820156,0.00004399479,0.0005842582,0.0001207466,0.0006010001,0.000008255011,0.0001932974,0.000003140756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001227302,"about_ca_system_score_gemma":0.0001865178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002743239,"about_ca_topic_score_gemma":0.000003055193,"domain_scores_codex":[0.9977309,0.0007824074,0.0005618791,0.0002535153,0.0004245328,0.0002467376],"domain_scores_gemma":[0.9973115,0.0009716611,0.0005335356,0.0009401875,0.0002151447,0.000027958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005412623,0.00003314794,0.00000860025,0.0000757115,0.00008402428,8.427624e-8,0.002330724,0.7557992,0.009966333,0.03003398,0.00002437958,0.2015897],"study_design_scores_gemma":[0.0002477478,0.0002723791,0.0005551413,0.00006646011,0.00003243031,0.00005488332,0.0001910892,0.956721,0.04097818,0.0007005862,0.00007343675,0.0001066486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01177468,0.0003253422,0.9860481,0.0006265769,0.0001021551,0.0009477803,0.000001346757,0.0001528194,0.00002122803],"genre_scores_gemma":[0.6691791,0.00002046686,0.3306343,0.00001848037,0.0000196687,0.00009880343,6.144035e-7,0.000009149237,0.000019452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6574044,"threshold_uncertainty_score":0.4004543,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04635780958773395,"gpt":0.2758682475496357,"spread":0.2295104379619017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327947,0.0001813315,0.0002574696,0.0001967471,0.0002441091,0.0000665511,0.0005542384,0.00009055409,0.000003735639],"category_scores_gemma":[0.000615633,0.0001381595,0.00008143167,0.0004361036,0.00004622474,0.000202139,0.000004526005,0.0002600841,9.120341e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008378976,"about_ca_system_score_gemma":0.0001421944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002866462,"about_ca_topic_score_gemma":0.000003483176,"domain_scores_codex":[0.9985305,0.000131766,0.000468328,0.000303634,0.0002845587,0.0002812187],"domain_scores_gemma":[0.9945938,0.004296322,0.0003853323,0.0004270782,0.0002537025,0.00004376869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001215564,0.0001286303,0.00002599199,0.00006364243,0.00003898126,5.084262e-7,0.0005358593,0.7639616,0.01434407,0.002392255,0.00001639125,0.2184799],"study_design_scores_gemma":[0.0004977412,0.001934785,0.0003434871,0.0004203874,0.00003610198,0.00004652082,0.00007232031,0.979927,0.01307352,0.003513912,0.000002786475,0.0001314259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007429584,0.0002252002,0.9910542,0.000264541,0.00008721885,0.0007437541,0.000006907432,0.0001537832,0.00003481689],"genre_scores_gemma":[0.9680982,0.00001154755,0.03171704,0.00006183892,0.00003226512,0.00004633374,0.000001774725,0.000009903583,0.00002113267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9606686,"threshold_uncertainty_score":0.5633982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04396500316172459,"gpt":0.2605274146914718,"spread":0.2165624115297472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001070119,0.0004556309,0.0007540786,0.0003897326,0.0001966978,0.00007742274,0.0003823159,0.0002672758,0.00003316709],"category_scores_gemma":[0.0001830735,0.0004733101,0.0002032359,0.0006469336,0.00007371627,0.0001455093,0.000003572149,0.0004309753,0.00001305328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003178318,"about_ca_system_score_gemma":0.0001983496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003177932,"about_ca_topic_score_gemma":0.000001436862,"domain_scores_codex":[0.997058,0.0005317142,0.0008741976,0.0005326719,0.0003173843,0.0006859885],"domain_scores_gemma":[0.9973181,0.001615287,0.0001733591,0.0004977755,0.0002095645,0.0001858953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000619374,0.00006979774,0.000004426479,0.0004807582,0.0002014946,0.00000318196,0.0005636985,0.9607652,0.02504845,0.0001813414,0.0005702391,0.01204951],"study_design_scores_gemma":[0.0009390696,0.0008273212,0.000003740451,0.0001787917,0.0001718157,0.00004242776,0.0003213231,0.8931054,0.1033599,0.0001612675,0.0005178925,0.0003710543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01642274,0.0008391017,0.9790002,0.0002051557,0.00008687699,0.001802615,0.0001341809,0.001459578,0.00004951534],"genre_scores_gemma":[0.9838037,0.00006395198,0.01511894,0.0001686427,0.00006258679,0.0005951255,0.00006465203,0.0001022551,0.00002012601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.967381,"threshold_uncertainty_score":0.9997718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02099592348424774,"gpt":0.2264472093870163,"spread":0.2054512859027686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484635,0.0001929193,0.000266442,0.0002487884,0.00009993382,0.0000471881,0.0002825869,0.0001429305,0.00005985973],"category_scores_gemma":[0.00003650002,0.0001969706,0.00008276147,0.0002949248,0.00001973183,0.0002087185,0.000001456802,0.0002166442,0.00005419723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001748574,"about_ca_system_score_gemma":0.000035683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001482541,"about_ca_topic_score_gemma":0.000002791971,"domain_scores_codex":[0.9986462,0.0001546842,0.0004536854,0.0001752397,0.0002314477,0.0003387342],"domain_scores_gemma":[0.9990183,0.0002954968,0.00008708704,0.0004800555,0.00006814762,0.00005096477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001963601,0.00009056008,0.000007089056,0.0002822973,0.0001869701,5.958716e-7,0.0003313135,0.7443129,0.08609031,0.004031291,0.00140207,0.163245],"study_design_scores_gemma":[0.0003153275,0.0003581395,0.00003569058,0.0001197652,0.00003427072,0.00001966215,0.00003770214,0.7932305,0.203164,0.001296231,0.001134657,0.0002540848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003433349,0.0002297592,0.9927421,0.00002678914,0.0002072618,0.0004556665,0.000002719871,0.001434782,0.00146764],"genre_scores_gemma":[0.9897504,0.0000584641,0.009742033,0.00001502498,0.00004838231,0.000184517,0.000004031216,0.00004556311,0.000151539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9863171,"threshold_uncertainty_score":0.8032227,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02284596657267662,"gpt":0.2574228208277125,"spread":0.2345768542550359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006390199,0.0002716691,0.0003532969,0.0003418759,0.0003336702,0.0001076233,0.0004954532,0.000205032,0.00002192075],"category_scores_gemma":[0.00006631799,0.0002655665,0.0001470238,0.0001846268,0.00006995202,0.0002330822,0.000003561663,0.0005085416,0.00002528377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000327035,"about_ca_system_score_gemma":0.0001002174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005219644,"about_ca_topic_score_gemma":0.000005548763,"domain_scores_codex":[0.9982655,0.00016244,0.0004790961,0.0002815408,0.0003502766,0.0004611206],"domain_scores_gemma":[0.9984909,0.0002868646,0.0001933803,0.0008455795,0.000103845,0.00007946317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007797116,0.0001915829,0.000007467977,0.00009979432,0.0001994937,0.000006170395,0.0002598177,0.470132,0.002934056,0.0008412455,0.00009275911,0.5251576],"study_design_scores_gemma":[0.00045474,0.0008341072,0.00005026732,0.0003265038,0.00004117725,0.00001059091,0.00005733149,0.9786587,0.01897444,0.0001941531,0.0001553886,0.0002426352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004155011,0.00006185264,0.9970661,0.00005561962,0.0001913332,0.0008374181,0.00001431191,0.0009102906,0.0004476008],"genre_scores_gemma":[0.9437996,0.00001564107,0.05568183,0.00001112876,0.00006484537,0.0002878584,0.000007824362,0.00005419256,0.00007710754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9433841,"threshold_uncertainty_score":0.9999797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01853224643952146,"gpt":0.2364378355477912,"spread":0.2179055891082698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054996,0.0001431851,0.0002355183,0.0006200247,0.00007470443,0.00002863804,0.00009175613,0.0001429571,0.000004412888],"category_scores_gemma":[0.00002552936,0.0001538955,0.00001664757,0.0006712985,0.00002850711,0.0001706266,0.000003384396,0.0001744065,0.000004856826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001465508,"about_ca_system_score_gemma":0.00002618162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001149738,"about_ca_topic_score_gemma":0.000009089279,"domain_scores_codex":[0.9990184,0.00006335754,0.0003618666,0.000182873,0.0001117907,0.000261715],"domain_scores_gemma":[0.9995251,0.0001695092,0.00005353018,0.0001896529,0.00003566412,0.00002656674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001514289,0.0000207701,0.0003776064,0.0001793346,0.0000664085,0.000001189955,0.00042769,0.8922083,0.04078475,0.0007264691,0.00003518819,0.0651571],"study_design_scores_gemma":[0.0007834515,0.0003850884,0.001143851,0.0003119581,0.00003073937,0.00001500709,0.0005582354,0.9441545,0.05190739,0.0004195741,0.00004036569,0.0002498435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1563759,0.0002965018,0.8417908,0.00006307757,0.00003716031,0.0005598476,0.000005665474,0.0008332611,0.00003772983],"genre_scores_gemma":[0.996076,0.0003153294,0.003286493,0.000002233942,0.00000927756,0.0002303979,0.000008429965,0.00002474851,0.00004702328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8397001,"threshold_uncertainty_score":0.6275676,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03796342581928601,"gpt":0.272911710833078,"spread":0.234948285013792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006975207,0.0002097393,0.0002480299,0.0004000572,0.000257391,0.0002013881,0.000554778,0.0001492658,0.00001314775],"category_scores_gemma":[0.0006094017,0.0002055627,0.0001056713,0.000510391,0.00002993058,0.0005992,0.000003439201,0.0001490858,0.00002604867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003198873,"about_ca_system_score_gemma":0.0002392892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000161662,"about_ca_topic_score_gemma":0.000004254512,"domain_scores_codex":[0.9983096,0.0001379798,0.0005345448,0.0003653703,0.0003173595,0.0003351564],"domain_scores_gemma":[0.9955892,0.002706799,0.0003374765,0.0008073164,0.0004987252,0.00006051227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004758293,0.003045791,0.0007232117,0.0005763308,0.0001954779,0.000001136823,0.0004646321,0.1269794,0.3747484,0.006651944,0.05184115,0.434725],"study_design_scores_gemma":[0.0002355545,0.001118246,0.0001802484,0.00009937031,0.00001652295,0.0000112175,0.000003818268,0.8384647,0.1554948,0.004050916,0.0001371024,0.000187538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005797112,0.00004977937,0.9904862,0.00058991,0.0001686635,0.001693784,0.000006129074,0.006390461,0.00003537821],"genre_scores_gemma":[0.722854,0.000004381279,0.2756839,0.00006403009,0.00004198764,0.001243147,0.00001186195,0.0000185194,0.00007826219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7222742,"threshold_uncertainty_score":0.8382602,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04535847245118739,"gpt":0.3110048256251456,"spread":0.2656463531739582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908666,0.0001724163,0.000248768,0.0002501653,0.0004091478,0.0001142843,0.0002815464,0.0001154862,0.000001632756],"category_scores_gemma":[0.0004691544,0.000180098,0.00006636584,0.0008119101,0.00002137925,0.0004512457,0.000008683659,0.0001687065,0.00001161724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002622015,"about_ca_system_score_gemma":0.0001331295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001528782,"about_ca_topic_score_gemma":0.00001744742,"domain_scores_codex":[0.9980883,0.0004048518,0.0004671232,0.0003805267,0.0002693643,0.00038981],"domain_scores_gemma":[0.9982309,0.0009661904,0.0003154163,0.0002802337,0.0001494451,0.00005786937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003196305,0.00003070405,0.00003992258,0.00007118803,0.00003552236,4.514505e-7,0.0002407476,0.7745385,0.001601749,0.004253915,0.000008233519,0.2191759],"study_design_scores_gemma":[0.0006831394,0.0003065136,0.0005223897,0.0001478531,0.00004072945,0.00004856769,0.00005754375,0.9964514,0.0006075921,0.0009500284,0.00002646542,0.0001577684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054912,0.0002113425,0.9968375,0.0002385908,0.0001850842,0.0006861858,0.000008089737,0.0007652792,0.00001300443],"genre_scores_gemma":[0.8121279,0.00002236646,0.1875744,0.00001046269,0.00001797541,0.0001464239,0.00001871487,0.0000121358,0.00006965448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8110729,"threshold_uncertainty_score":0.7344181,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02369118164859067,"gpt":0.238357428117454,"spread":0.2146662464688633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373212,0.0002085165,0.0002775384,0.0005281988,0.0001233059,0.00004219698,0.0002474285,0.0001227309,0.00001246985],"category_scores_gemma":[0.00003539353,0.0002360249,0.0000687139,0.0006599975,0.00002075571,0.0001472303,0.00000209475,0.0002292355,0.00001570672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008322601,"about_ca_system_score_gemma":0.00005325858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003331892,"about_ca_topic_score_gemma":0.00001553529,"domain_scores_codex":[0.9983575,0.0001270411,0.0004888538,0.0002835819,0.0002470361,0.000496021],"domain_scores_gemma":[0.9988715,0.0005259259,0.00007041146,0.0003980341,0.00005595262,0.00007819718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000120706,0.0001203054,0.000008248152,0.0001638798,0.00005029882,4.371128e-8,0.0002820173,0.9902824,0.001944407,0.001657749,0.00004913895,0.005429402],"study_design_scores_gemma":[0.0007609986,0.0002682915,0.0000545215,0.00005022495,0.00002703666,0.000004921995,0.00009905821,0.9896532,0.008525562,0.00008409093,0.0002730136,0.0001990775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02609739,0.0003672889,0.9701787,0.0000637475,0.00006650342,0.002712333,0.00001775731,0.0002910355,0.0002052223],"genre_scores_gemma":[0.9867156,0.00002015869,0.01102561,0.00001747035,0.00002486788,0.00206977,0.00001729546,0.00005349763,0.00005578037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9606181,"threshold_uncertainty_score":0.9624817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01468913515383251,"gpt":0.2231362424112235,"spread":0.208447107257391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002280369,0.0002017569,0.0003245985,0.0001168236,0.0000756378,0.00004720398,0.0002477013,0.0001229922,0.0002032419],"category_scores_gemma":[0.00002755739,0.0002033328,0.0001210136,0.0004088065,0.00003093593,0.0001911619,0.00000292797,0.0002295247,0.00007339934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003288162,"about_ca_system_score_gemma":0.0001459022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001032097,"about_ca_topic_score_gemma":0.00001805192,"domain_scores_codex":[0.9985751,0.0001098944,0.0004531809,0.0002385677,0.0002351455,0.0003881445],"domain_scores_gemma":[0.9989399,0.0002827618,0.00006834623,0.0005432106,0.00009911838,0.00006660549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008070208,0.0002946636,0.00000483515,0.001337204,0.0007527226,0.00001928445,0.0006310946,0.9009987,0.06430239,0.01434504,0.0002488569,0.01698449],"study_design_scores_gemma":[0.0004389698,0.0001394055,0.00001741329,0.0002396647,0.00005574534,0.0000474021,0.0002346558,0.8292603,0.1672424,0.0007054658,0.00137547,0.0002431325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01093659,0.002116806,0.9842583,0.00004371155,0.0004426469,0.0003607371,0.00001625219,0.0004910462,0.001333935],"genre_scores_gemma":[0.9975311,0.0003983682,0.001489892,0.00001588691,0.00001559032,0.000163229,0.0000128411,0.00003805027,0.0003350856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9865944,"threshold_uncertainty_score":0.829167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01096016990690089,"gpt":0.232513131831324,"spread":0.2215529619244231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008860713,0.0003308069,0.0003778924,0.001315636,0.0003113821,0.0002539182,0.0006376245,0.0001642628,0.000009641421],"category_scores_gemma":[0.00009418646,0.0003123064,0.0001751651,0.003174534,0.00009318976,0.0009702721,0.000007959849,0.0002749527,0.00002402247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005396295,"about_ca_system_score_gemma":0.000496731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001587331,"about_ca_topic_score_gemma":0.0001012405,"domain_scores_codex":[0.9971495,0.000453468,0.0006277824,0.000623568,0.0006087253,0.0005370181],"domain_scores_gemma":[0.9974518,0.0005358421,0.0003696065,0.001179187,0.0003759951,0.00008753064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002726268,0.000318293,0.0000539929,0.0002974524,0.0002349202,0.000004553324,0.000246089,0.9058211,0.003371848,0.009025483,0.00003048298,0.08032312],"study_design_scores_gemma":[0.001615272,0.001561348,0.0001244854,0.000372889,0.00008629583,0.00002380186,0.0001195948,0.8902427,0.1034395,0.001414443,0.0006699538,0.0003297457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008811391,0.0001647764,0.987597,0.0001075401,0.0006227919,0.001301647,0.000004254193,0.0008580408,0.0005325624],"genre_scores_gemma":[0.9910614,0.00001090967,0.007738027,0.00006705196,0.00001828331,0.0005037963,0.000007539865,0.00002928662,0.0005636403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822501,"threshold_uncertainty_score":0.9999329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02432252241982122,"gpt":0.2569261122839225,"spread":0.2326035898641013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391934,0.0001425154,0.0002745542,0.0004103523,0.0001358207,0.00005354686,0.0003793801,0.00008421422,0.000001778272],"category_scores_gemma":[0.00007205937,0.0001300444,0.00004169481,0.0005307787,0.00003499072,0.0001468852,0.000007293811,0.00007410548,2.803982e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001167792,"about_ca_system_score_gemma":0.0001583444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002674734,"about_ca_topic_score_gemma":0.000001562028,"domain_scores_codex":[0.9987423,0.0001367393,0.0004327084,0.0002872975,0.0002003957,0.0002006033],"domain_scores_gemma":[0.9982297,0.0007346842,0.0002732178,0.0004747566,0.0002604006,0.0000271911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004071199,0.00007351933,0.000003403374,0.0001219716,0.00006465866,8.402359e-8,0.0000989522,0.9846889,0.0005326986,0.008727815,0.00003367547,0.005613563],"study_design_scores_gemma":[0.0003944415,0.0003102915,0.0000327186,0.0003315043,0.00003739953,0.000004721162,0.0000200936,0.9415607,0.05693258,0.0002434375,0.00002077001,0.0001112863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001038699,0.0001461383,0.9975606,0.0001559089,0.00009641976,0.0006950484,0.00001005333,0.0002645684,0.00003252635],"genre_scores_gemma":[0.6193499,0.00002934505,0.3804125,0.000006374649,0.000003344953,0.0001200957,0.000001610785,0.000007096261,0.0000697092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6183112,"threshold_uncertainty_score":0.5303056,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01700343201307812,"gpt":0.2571991733860228,"spread":0.2401957413729447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206382,0.0001912211,0.0002433976,0.0003653082,0.00007602261,0.0001090163,0.0001554546,0.000108708,0.00001566832],"category_scores_gemma":[0.0000337179,0.0002099938,0.00004586176,0.0007427731,0.000008611267,0.0001891959,0.000005117416,0.0002730009,0.00004938491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006857581,"about_ca_system_score_gemma":0.00005545969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000152576,"about_ca_topic_score_gemma":0.00003043136,"domain_scores_codex":[0.998575,0.0000913881,0.0004718093,0.000251186,0.0002247644,0.0003858235],"domain_scores_gemma":[0.999485,0.0001411266,0.00003476198,0.0002283242,0.00003080201,0.00007996857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001341648,0.000009937634,0.00001645099,0.0001679932,0.0000479229,0.000002305438,0.0006708665,0.9292531,0.007090792,0.0006317399,0.000105906,0.06198958],"study_design_scores_gemma":[0.0002087331,0.0006300387,0.00004850531,0.0008555211,0.00003471057,0.00002482003,0.0005514191,0.9855709,0.008360795,0.0001774796,0.003242303,0.0002947924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009231001,0.0005885605,0.9870925,0.00007484984,0.0001622311,0.001310543,0.000003665794,0.000869832,0.0006668253],"genre_scores_gemma":[0.9954464,0.00008282887,0.003456846,0.00001801336,0.00002784192,0.0006683042,0.000004296865,0.00003344402,0.0002619834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9862154,"threshold_uncertainty_score":0.85633,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02873167955612287,"gpt":0.2860068122052232,"spread":0.2572751326491003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159626,0.0002443535,0.0005065242,0.000340821,0.0001150755,0.00006126043,0.0007706753,0.0001369672,0.00002756511],"category_scores_gemma":[0.00007420898,0.000198088,0.0001623962,0.0004773557,0.00006716981,0.001498027,0.00001205354,0.0001266873,0.00003058371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005546949,"about_ca_system_score_gemma":0.0004513594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004058275,"about_ca_topic_score_gemma":0.000009143493,"domain_scores_codex":[0.9964314,0.000877995,0.001123274,0.0004969832,0.0005911146,0.0004792839],"domain_scores_gemma":[0.996561,0.00113402,0.0006350694,0.001126669,0.0004518969,0.00009135238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002092253,0.0005729961,0.00001295556,0.0003749501,0.0007129443,0.000003619926,0.001918149,0.523592,0.2390322,0.07016461,0.00006973793,0.1633366],"study_design_scores_gemma":[0.002284823,0.0006875793,0.000117027,0.0003260151,0.00006471032,0.0000402529,0.0004075982,0.7129102,0.2777155,0.005126477,0.00001106091,0.0003087551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01141788,0.0001157751,0.9863973,0.0002721896,0.0002935056,0.001159886,0.00001696502,0.000236394,0.0000900771],"genre_scores_gemma":[0.9232467,0.00003415631,0.07639421,0.000006441833,0.0000178207,0.000224931,0.000002362762,0.00002099707,0.00005233803],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9118289,"threshold_uncertainty_score":0.8077795,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07235459296917826,"gpt":0.308379183978513,"spread":0.2360245910093347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906792,0.0001827871,0.0004600917,0.0003684649,0.0005374913,0.0002090417,0.001918952,0.0001011594,0.000003324845],"category_scores_gemma":[0.0001604321,0.0001445085,0.0002408199,0.0004303839,0.00007994219,0.0008194616,0.000009388312,0.000122382,0.00000205823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002033617,"about_ca_system_score_gemma":0.0003190195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002824257,"about_ca_topic_score_gemma":0.00007139942,"domain_scores_codex":[0.9979514,0.0002742872,0.0006492893,0.000394594,0.0004054977,0.0003249138],"domain_scores_gemma":[0.9952923,0.001093676,0.0008801529,0.002335955,0.0003456454,0.00005224812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003640625,0.00007227914,0.000005434729,0.0000530894,0.0007089167,1.034007e-7,0.0007660593,0.9801163,0.002167962,0.006936748,0.000005691057,0.009130977],"study_design_scores_gemma":[0.0002587146,0.0003538358,0.0002642926,0.00006692608,0.0005285155,0.00000360725,0.0001331387,0.994908,0.002393534,0.0009537356,0.000001654096,0.0001340582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003418106,0.0001213592,0.9947428,0.0001331879,0.0001297634,0.001300551,0.00001274297,0.00009683363,0.00004463778],"genre_scores_gemma":[0.925565,0.000007774492,0.07391425,0.000004063518,0.00001562026,0.0003625483,0.000002454806,0.00001471127,0.0001135448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9221469,"threshold_uncertainty_score":0.5892887,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01256107005848065,"gpt":0.2705259506802324,"spread":0.2579648806217518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007277188,0.0003141814,0.0004616049,0.001284794,0.0002057972,0.0001220831,0.0008889184,0.0001719186,0.00001230007],"category_scores_gemma":[0.00007170616,0.0002969909,0.00008046031,0.002088641,0.00007391623,0.0009840002,0.00001693979,0.0004469291,0.0000104947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000763236,"about_ca_system_score_gemma":0.0004748081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008904278,"about_ca_topic_score_gemma":0.0001415559,"domain_scores_codex":[0.9974047,0.0003801871,0.0007252789,0.0005828972,0.0004163896,0.0004905775],"domain_scores_gemma":[0.99786,0.0005148586,0.0003170735,0.0009871086,0.0002695527,0.00005144797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005154784,0.0008769442,0.0002173631,0.0004550865,0.0005422948,0.00002709345,0.002764755,0.6459645,0.04185758,0.2213317,0.0005041939,0.08494299],"study_design_scores_gemma":[0.002190953,0.002172991,0.0004551938,0.001056804,0.00005584179,0.00009872131,0.0003310657,0.4327054,0.5452016,0.01324964,0.001736231,0.0007455797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00320512,0.0002180329,0.9934869,0.0006451779,0.0002331438,0.001091483,0.000004630648,0.0008041813,0.0003112885],"genre_scores_gemma":[0.9395658,0.0000443991,0.05890155,0.0001161027,0.00001291338,0.0005684731,0.000002809788,0.00002171478,0.0007662802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9363607,"threshold_uncertainty_score":0.9999482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02351480804271863,"gpt":0.270037699977881,"spread":0.2465228919351623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187719,0.0002597021,0.0003427611,0.000395332,0.0002942545,0.0001420593,0.0007596185,0.000134182,0.000004201243],"category_scores_gemma":[0.0001615858,0.0002449782,0.00006396906,0.000869502,0.00003315449,0.000256676,0.00001134921,0.0001679535,0.00006171226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007466807,"about_ca_system_score_gemma":0.0001947934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006878715,"about_ca_topic_score_gemma":0.000009060972,"domain_scores_codex":[0.9970583,0.0006645227,0.0006525982,0.0005706201,0.0006371341,0.0004168091],"domain_scores_gemma":[0.9973079,0.0004610396,0.0004707674,0.001296171,0.0003568262,0.0001072923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003575836,0.00008365246,0.000002813971,0.0000602912,0.00003491093,3.204439e-7,0.0003075849,0.9364561,0.04094454,0.006329359,0.000006288506,0.01573832],"study_design_scores_gemma":[0.0004117313,0.0008617337,0.00002183887,0.0001086428,0.00003810238,0.00005028488,0.0000232968,0.9790823,0.01895695,0.00007135633,0.0001207975,0.0002529978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02439445,0.00004254079,0.9730625,0.00005556323,0.0003340463,0.001717463,0.000003921895,0.000347433,0.00004210004],"genre_scores_gemma":[0.6993201,0.000002145827,0.3003646,0.00002943643,0.00004352315,0.0001820918,0.000004792462,0.00002137765,0.00003196478],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6749256,"threshold_uncertainty_score":0.998992,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01082779726984855,"gpt":0.2334949140387263,"spread":0.2226671167688778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005800955,0.0002331186,0.0003809164,0.0004964565,0.00003428273,0.00004247232,0.0003289861,0.0001559422,0.0001582587],"category_scores_gemma":[0.000005875856,0.0002481044,0.00006991516,0.0004481795,0.000009218364,0.0002433742,0.000001866357,0.0002115994,0.0001663984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005242497,"about_ca_system_score_gemma":0.00006737524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003026488,"about_ca_topic_score_gemma":0.00001006569,"domain_scores_codex":[0.998319,0.0001807333,0.0005385374,0.0002658759,0.0002767458,0.000419084],"domain_scores_gemma":[0.998988,0.0001615428,0.00006870356,0.0006313179,0.00006091084,0.00008956601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004112554,0.00009109968,0.000002470447,0.00005440055,0.00004714416,7.536796e-7,0.0002026098,0.9101994,0.06421139,0.00002174653,0.0001216397,0.02500621],"study_design_scores_gemma":[0.0008153568,0.0005627109,0.00001724884,0.0001154723,0.00001790333,0.000004746129,0.00008636886,0.8171002,0.1808492,0.00003570418,0.0001786604,0.0002164769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007923501,0.00009466415,0.9883927,0.00001480175,0.0002858097,0.002457999,0.00002081455,0.0006596394,0.0001501449],"genre_scores_gemma":[0.9151698,0.00006142309,0.08386758,0.00001504142,0.00001736105,0.0006381763,0.00001341535,0.000052339,0.0001648865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9072463,"threshold_uncertainty_score":0.9999971,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0525912628983535,"gpt":0.2403003780804701,"spread":0.1877091151821166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006569765,0.0002165408,0.0003013735,0.0007835362,0.000109714,0.00003167572,0.0002857051,0.0001666095,0.00006596727],"category_scores_gemma":[0.00003359909,0.0002264812,0.0001090024,0.001080712,0.00002770157,0.0002511092,0.000002178231,0.0002474321,0.00001851521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002873302,"about_ca_system_score_gemma":0.00005523358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008561785,"about_ca_topic_score_gemma":0.00000231495,"domain_scores_codex":[0.9984095,0.0001254799,0.0005471309,0.0002075058,0.0002574989,0.000452958],"domain_scores_gemma":[0.9991407,0.0001272017,0.0001416697,0.0004338899,0.00009682633,0.00005973916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008921194,0.0004395983,0.0002112938,0.0009652696,0.0009627054,0.00001303271,0.002464992,0.646629,0.07728231,0.001314612,0.0002497117,0.2693783],"study_design_scores_gemma":[0.0003945071,0.0005873898,0.0001438925,0.000245817,0.000145174,0.00007517545,0.0002255459,0.8299023,0.1669984,0.0005232634,0.0002725584,0.0004860153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01304298,0.0008116668,0.9837035,0.000002584482,0.0001812119,0.0006522966,0.000003737587,0.001172027,0.0004299833],"genre_scores_gemma":[0.949946,0.00005667038,0.04977311,0.000003495495,0.00002510532,0.000103117,0.000003576597,0.00005067924,0.00003824089],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.936903,"threshold_uncertainty_score":0.9235635,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02192229964876055,"gpt":0.2600297292290031,"spread":0.2381074295802426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009900777,0.0002574156,0.0003864833,0.0006021091,0.0004902384,0.0002097242,0.0005237224,0.0001784185,0.00001138822],"category_scores_gemma":[0.0001468272,0.0002606755,0.0001111508,0.001116993,0.00005050708,0.001176528,0.000009491165,0.0001974601,0.00001225556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003579347,"about_ca_system_score_gemma":0.0004385264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003689201,"about_ca_topic_score_gemma":0.000005697475,"domain_scores_codex":[0.9976241,0.0005173986,0.0005859744,0.000551885,0.0003073185,0.0004133399],"domain_scores_gemma":[0.9976515,0.0008234606,0.0002617064,0.0008504239,0.0003231472,0.00008975283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002209122,0.0009351095,0.000004267099,0.0005350152,0.0003554488,8.749691e-7,0.0009528521,0.6882437,0.005338165,0.07131255,0.002186353,0.2299148],"study_design_scores_gemma":[0.000933268,0.0007801938,0.0001141878,0.0001184764,0.00009534949,0.00001114721,0.00004647015,0.973057,0.004272627,0.01972062,0.0006335794,0.000217089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008602897,0.0002310569,0.9955244,0.0004215577,0.0006004814,0.001716897,0.000008616774,0.0005649452,0.00007173066],"genre_scores_gemma":[0.8817225,0.00006204814,0.1168584,0.00006842153,0.00004787156,0.0007156233,0.00001881347,0.00002100501,0.0004853272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8808622,"threshold_uncertainty_score":0.9999846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02187675245786297,"gpt":0.2302995635067415,"spread":0.2084228110488786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266983,0.000195739,0.0002311454,0.0001885432,0.0002949068,0.00005030951,0.00022836,0.0001474638,0.00000315926],"category_scores_gemma":[0.00002186173,0.0001708528,0.00007055118,0.0002523321,0.00004927795,0.0001300567,0.000002103473,0.0001675801,0.000002480306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000265067,"about_ca_system_score_gemma":0.00006235671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092336,"about_ca_topic_score_gemma":0.00001203631,"domain_scores_codex":[0.998745,0.00009747839,0.0003727251,0.0001834647,0.0001848221,0.0004165196],"domain_scores_gemma":[0.9983469,0.001039501,0.00009745324,0.0003486058,0.0001059014,0.00006162989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007821337,0.0002704052,0.00001270592,0.0005171024,0.001264947,0.00000935498,0.001621799,0.6558017,0.2059952,0.004743755,0.004279223,0.1247016],"study_design_scores_gemma":[0.0007187224,0.0007193556,0.00007505954,0.00007040144,0.0001036192,0.00008009152,0.0002816151,0.7596679,0.2352235,0.001839855,0.0009006619,0.0003191581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006991167,0.001079302,0.9899744,0.00003658492,0.000197587,0.001151235,0.000003851081,0.0005087256,0.00005717385],"genre_scores_gemma":[0.9918937,0.0002828069,0.007513945,0.000007383913,0.00003838283,0.0001042475,0.000002915131,0.00003641616,0.0001201722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9849026,"threshold_uncertainty_score":0.6967176,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05556856255126132,"gpt":0.2667102895176049,"spread":0.2111417269663436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521612,0.0002171811,0.0003062246,0.0003119096,0.0004565589,0.0001110969,0.0007424266,0.0001084626,0.00002504866],"category_scores_gemma":[0.00007559503,0.0002232415,0.0001032755,0.0007337466,0.00007533418,0.001028129,0.000008876656,0.0002054159,0.00001852575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004794955,"about_ca_system_score_gemma":0.0002978952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000186901,"about_ca_topic_score_gemma":0.00001643079,"domain_scores_codex":[0.9975885,0.0004457227,0.0005607628,0.0005049484,0.0003873897,0.00051275],"domain_scores_gemma":[0.9981084,0.0002962754,0.0003001799,0.0009457831,0.0002489843,0.0001003033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005736251,0.001010725,0.00006859229,0.0003166726,0.0004286733,0.00001042912,0.0053791,0.3862893,0.2688152,0.005030239,0.0000188657,0.3325748],"study_design_scores_gemma":[0.0004640451,0.0008971738,0.0004233076,0.0001512336,0.00002725546,0.00009230253,0.0001182085,0.9137501,0.08316749,0.0006331512,0.00001677871,0.0002590183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1445526,0.0001413478,0.8541512,0.00002316746,0.0002529418,0.0003829894,0.000002092064,0.0004045761,0.00008905775],"genre_scores_gemma":[0.9915486,0.000007753035,0.00825873,0.00001143399,0.00008870092,0.00003426023,8.283072e-7,0.00001961313,0.00003005841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8469959,"threshold_uncertainty_score":0.9103525,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02352055691225017,"gpt":0.2606866833356658,"spread":0.2371661264234156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359894,0.0001605849,0.0002154456,0.0003856145,0.0001225644,0.0000643321,0.000126894,0.0001250776,0.00001532676],"category_scores_gemma":[0.00001576106,0.0001734315,0.00003188368,0.0003633868,0.00004120128,0.0002627363,0.000002325149,0.0001702842,0.000001195572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000181574,"about_ca_system_score_gemma":0.00006317192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003943633,"about_ca_topic_score_gemma":0.000009769603,"domain_scores_codex":[0.9989768,0.0001128307,0.0003577892,0.0002257902,0.0001252302,0.000201528],"domain_scores_gemma":[0.9994345,0.0001235965,0.00004461964,0.0002329046,0.000121053,0.00004327455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001734956,0.00003028488,6.912672e-7,0.00005639473,0.00006641387,3.034801e-7,0.0002974851,0.9659894,0.002702614,0.01184672,0.000007246739,0.01898513],"study_design_scores_gemma":[0.0000683995,0.0002143088,0.000002606199,0.00009138355,0.00004857861,0.00001152961,0.0007914462,0.9654205,0.02205659,0.01115576,0.000002668696,0.0001362344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00348775,0.001229695,0.9941396,0.00004660296,0.00008640397,0.0004349278,0.000004552965,0.0004361122,0.0001343865],"genre_scores_gemma":[0.9828131,0.0003393855,0.01669894,0.000006875189,0.00001630901,0.00008551434,0.000003380114,0.00001798272,0.0000185225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9793254,"threshold_uncertainty_score":0.707233,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01730272150217334,"gpt":0.2342947791502734,"spread":0.2169920576481001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001087971,0.001032856,0.001432208,0.001459822,0.0004065988,0.0001758944,0.0008887283,0.001312183,0.0005082306],"category_scores_gemma":[0.00006964861,0.001122148,0.0005346385,0.0008700385,0.00006388348,0.0004718058,0.000002648471,0.001089095,0.0001714329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002386516,"about_ca_system_score_gemma":0.000672565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008743911,"about_ca_topic_score_gemma":0.00003033013,"domain_scores_codex":[0.9944695,0.0005185406,0.002018658,0.0008647116,0.0009679605,0.001160669],"domain_scores_gemma":[0.9961,0.0008998402,0.001064832,0.001330721,0.0004495464,0.0001550721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003412037,0.0002344248,4.643464e-8,0.00197376,0.0006510229,4.084667e-7,0.0002955127,0.9740915,0.001726502,0.0001487271,0.006886593,0.01365032],"study_design_scores_gemma":[0.002494885,0.003521501,0.00001017062,0.001801528,0.0008319339,0.00005106584,0.0001571694,0.9250806,0.04516179,0.000296519,0.01916577,0.001427059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001677883,0.001441332,0.9859291,0.00006317493,0.005095782,0.004892306,0.0002177015,0.0006799164,0.001512945],"genre_scores_gemma":[0.9592405,0.004210571,0.009564403,0.0000323033,0.002203434,0.003426643,0.0007613954,0.0005223409,0.02003842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9763647,"threshold_uncertainty_score":0.9999843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02020754906208097,"gpt":0.2543627845838141,"spread":0.2341552355217331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001358284,0.0002370225,0.0003503705,0.0003350638,0.0003545066,0.0001059016,0.0008200937,0.0001988318,0.00002968717],"category_scores_gemma":[0.00006003312,0.0001872952,0.0001701575,0.0004979813,0.00003157092,0.0005565899,0.000007221825,0.0001510449,0.000102879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006181493,"about_ca_system_score_gemma":0.0002412554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008128094,"about_ca_topic_score_gemma":0.00001539989,"domain_scores_codex":[0.9973986,0.0006350801,0.0007071198,0.0004443273,0.0003890259,0.0004258063],"domain_scores_gemma":[0.9965678,0.001354528,0.0004644527,0.001123473,0.0004208608,0.00006883694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001118193,0.001849309,0.00005778889,0.0006808661,0.001119028,0.000001484147,0.002548801,0.1639679,0.1394554,0.4052382,0.01923361,0.2647294],"study_design_scores_gemma":[0.001872337,0.002927194,0.00007873643,0.0008390543,0.00004471666,0.00005576267,0.00006311949,0.9631309,0.02324766,0.003511211,0.003752119,0.0004772002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001906085,0.00005116145,0.9947328,0.0006877883,0.0004785067,0.001369426,0.00001110722,0.0005012641,0.0002618608],"genre_scores_gemma":[0.9890449,0.000116298,0.008330832,0.00003753712,0.00007711017,0.0005444324,0.000006136692,0.00002941647,0.001813346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9871388,"threshold_uncertainty_score":0.7637675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}