{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":673,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":673,"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","author_layer_release":"2026-06-26"},"query_hash":"9213d3870a3a","filters":{"topic":"VLSI and FPGA Design Techniques"}},"results":[{"id":"W2113645429","doi":"10.1109/tvlsi.2004.824300","title":"The effect of LUT and cluster size on deep-submicron FPGA performance and density","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":416,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lookup table; Field-programmable gate array; Computer science; Parallel computing; Benchmark (surveying); Cluster (spacecraft); Cluster analysis; Context (archaeology); Logic block; Logic synthesis; Logic gate; Algorithm; Computer hardware; Artificial intelligence","authors":[{"name":"Elias Ahmed","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00342918692884033,"gpt":0.1893602428445608,"spread":0.1859310559157205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501721,0.0005558931,0.0003501532,0.0005168171,0.0002432788,0.0005361445,0.000712792,0.0003392486,0.002225998],"category_scores_gemma":[0.006022823,0.0002937885,0.0001868253,0.0006499689,0.0002691572,0.001444104,0.0003852491,0.0003407165,0.0003443077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005585931,"about_ca_system_score_gemma":0.000365062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001347016,"about_ca_topic_score_gemma":0.003155575,"domain_scores_codex":[0.9993624,0.000113394,0.00005825949,0.0001256023,0.0002056508,0.0001347648],"domain_scores_gemma":[0.9939262,0.004011982,0.0006056342,0.0006696108,0.000642462,0.0001442332],"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.001642186,0.0003859536,0.03899241,0.0009728523,0.0001671275,0.0008246576,0.0003227295,0.4216937,0.3482884,0.005243535,0.002834004,0.1786325],"study_design_scores_gemma":[0.0001365372,0.004761676,0.06751497,0.00008978478,0.000256625,0.001106219,0.0003246289,0.3394176,0.5778132,0.002734896,0.00572387,0.000119864],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9775043,0.001045542,0.01603705,0.000240615,0.00004982096,0.00003362466,0.0002384276,0.0007409513,0.004109538],"genre_scores_gemma":[0.9895501,0.0002641388,0.009074811,0.00006248612,0.00001436231,0.00001770311,0.0002247762,0.00009688013,0.0006948473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002225998,"threshold_uncertainty_score":0.007446706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005602803","doi":"10.1145/2617593","title":"VTR 7.0","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":362,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Texas Instruments; Semiconductor Research Corporation","keywords":"Computer science; Netlist; Adder; Verilog; Design flow; Computer architecture; Static timing analysis; Field-programmable gate array; Compiler; Routing (electronic design automation); Embedded system; Electronic design automation; Electronic circuit; Architecture; Operating system","authors":[{"name":"Jason Luu","is_ca":true},{"name":"Jeffrey Goeders","is_ca":true},{"name":"Michael Wainberg","is_ca":true},{"name":"Andrew Somerville","is_ca":true},{"name":"Thien Yu","is_ca":true},{"name":"Konstantin Nasartschuk","is_ca":true},{"name":"Miad Nasr","is_ca":true},{"name":"Sen Wang","is_ca":true},{"name":"Tim Liu","is_ca":true},{"name":"Nooruddin Ahmed","is_ca":true},{"name":"Kenneth B. Kent","is_ca":true},{"name":"Jason H. Anderson","is_ca":true},{"name":"Jonathan Rose","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01091939259929031,"gpt":0.2032694107926043,"spread":0.192350018193314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750251,0.002157605,0.001046378,0.001603354,0.0004309663,0.002876847,0.006144736,0.001794017,0.1841848],"category_scores_gemma":[0.004826624,0.001912365,0.002235467,0.0009739826,0.0005365057,0.003185743,0.001877959,0.002740301,0.08498552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009659087,"about_ca_system_score_gemma":0.001255401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002586507,"about_ca_topic_score_gemma":0.002465936,"domain_scores_codex":[0.9986554,0.0001852751,0.0001137305,0.0001562931,0.0006926315,0.0001966121],"domain_scores_gemma":[0.9987112,0.0003665712,0.0001042287,0.0003692457,0.0003746658,0.0000741613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001126845,0.0002547515,0.001702152,0.00178083,0.0002360919,0.0006102312,0.0002433069,0.01871631,0.01736627,0.04108322,0.7363533,0.1805266],"study_design_scores_gemma":[0.0008813773,0.0005068493,0.0013379,0.0004214962,0.0001090259,0.001369878,0.00007580371,0.07900281,0.030192,0.02953782,0.8563473,0.0002175763],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.004151877,0.001394098,0.2538206,0.0004608808,0.0005706166,0.0005299532,0.02404206,0.6085458,0.1064841],"genre_scores_gemma":[0.09596279,0.003539486,0.2948714,0.002062196,0.0003815811,0.001881063,0.1510239,0.2781618,0.1721159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1841848,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033033241","doi":"10.1145/3388617","title":"VTR 8","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":293,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Toronto","funders":"New Brunswick Innovation Foundation; Semiconductor Research Corporation","keywords":"Computer science; Field-programmable gate array; Verilog; Routing (electronic design automation); Embedded system; Computer architecture; Process (computing); Footprint; Implementation; Design flow; Memory footprint; CAD; Electronic design automation; Computer hardware; Operating system; Software engineering","authors":[{"name":"Kevin E. Murray","is_ca":true},{"name":"Oleg Petelin","is_ca":true},{"name":"Sheng Zhong","is_ca":true},{"name":"Jia Min Wang","is_ca":true},{"name":"Mohamed Eldafrawy","is_ca":true},{"name":"Jean-Philippe Legault","is_ca":true},{"name":"Eugene Sha","is_ca":true},{"name":"Aaron G. Graham","is_ca":true},{"name":"Jean Wu","is_ca":true},{"name":"Matthew Walker","is_ca":true},{"name":"Hanqing Zeng","is_ca":true},{"name":"Panagiotis Patros","is_ca":true},{"name":"Jason Luu","is_ca":false},{"name":"Kenneth B. Kent","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02123967216127599,"gpt":0.2098367586667318,"spread":0.1885970865054558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435658,0.0007834078,0.0003212203,0.001019684,0.0003505549,0.001916926,0.001874492,0.001074003,0.1370609],"category_scores_gemma":[0.002758794,0.0006054366,0.0007668754,0.0005103768,0.0003045666,0.001478167,0.00123707,0.001066099,0.06529628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007708512,"about_ca_system_score_gemma":0.001106221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247824,"about_ca_topic_score_gemma":0.001881827,"domain_scores_codex":[0.9988272,0.0001261807,0.00008045925,0.0001914943,0.0006609797,0.0001137276],"domain_scores_gemma":[0.9987885,0.0001857517,0.00008713489,0.0003927918,0.0004879932,0.00005770744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003751511,0.0001309814,0.0009961317,0.0005900135,0.00004663962,0.0003325917,0.000179305,0.01459734,0.04626794,0.05684018,0.2965377,0.583106],"study_design_scores_gemma":[0.0001162904,0.0002066368,0.0004745012,0.00009146481,0.00002387555,0.0006621002,0.00002673531,0.03266139,0.02605021,0.01111493,0.928524,0.00004784908],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.009329676,0.001024327,0.5078312,0.000971428,0.001083094,0.0005741727,0.00755951,0.1371291,0.3344975],"genre_scores_gemma":[0.1440085,0.00166874,0.3094819,0.001963651,0.0003386429,0.0007802437,0.04019507,0.03611394,0.4654494],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1370609,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094806828","doi":"10.1145/329166.329208","title":"Timing-driven placement for FPGAs","year":2000,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":284,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Simulated annealing; Static timing analysis; Path (computing); Field-programmable gate array; Placement; Critical path method; Algorithm; Connection (principal bundle); Embedded system; Physical design; Mathematics; Engineering; Circuit design","authors":[{"name":"Alexander Marquardt","is_ca":true},{"name":"Vaughn Betz","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01804566893611995,"gpt":0.2319327823255951,"spread":0.2138871133894751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002361176,0.0004443588,0.0003095117,0.0003219985,0.0003047199,0.0003326702,0.0005687331,0.0004046386,0.002703016],"category_scores_gemma":[0.0007777928,0.0002947705,0.0003636528,0.0002853441,0.0002559864,0.000368813,0.0003110351,0.0005106355,0.0006367189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006114312,"about_ca_system_score_gemma":0.0006479612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001281281,"about_ca_topic_score_gemma":0.002669051,"domain_scores_codex":[0.9997366,0.0000645966,0.00001241221,0.00003568302,0.0001306823,0.00001996934],"domain_scores_gemma":[0.9997669,0.00009646826,0.00002824278,0.00004074845,0.0000588097,0.000008840441],"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.0000806406,0.00003259169,0.0003928975,0.0001658385,0.00004584088,0.00009775274,0.00006455131,0.7263219,0.0381606,0.03830589,0.002274363,0.1940572],"study_design_scores_gemma":[0.00002166222,0.00007694404,0.0002316831,0.00001471727,0.00001258856,0.0001047357,0.00001223668,0.9634789,0.01288122,0.01159899,0.01155426,0.00001220262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006270541,0.0001111949,0.9904643,0.00004706564,0.00003880652,0.00002889334,0.00002168839,0.0005995815,0.002417896],"genre_scores_gemma":[0.1705623,0.0002414727,0.8249385,0.00008005762,0.00002929986,0.0001008509,0.0001214467,0.0001946942,0.003731315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002703016,"threshold_uncertainty_score":0.009042501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138840350","doi":"10.1109/fpt.2004.1393249","title":"Directional and single-driver wires in FPGA interconnect","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":242,"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; Interconnection; Capacitance; Computer science; Electronic circuit; Embedded system; Electronic engineering; Electrical engineering; Engineering; Telecommunications; Physics","authors":[{"name":"Guy Lemieux","is_ca":true},{"name":"E. Lee","is_ca":true},{"name":"Marvin Tom","is_ca":true},{"name":"Aopei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009816520485855242,"gpt":0.1937798356413951,"spread":0.1839633151555399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002989541,0.0002683567,0.000124485,0.0003526443,0.000251957,0.0008540623,0.0003312148,0.000257806,0.001189077],"category_scores_gemma":[0.0007974344,0.0002490187,0.0000959075,0.0004088413,0.0002378694,0.001011022,0.000279134,0.0002528189,0.00036726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003733652,"about_ca_system_score_gemma":0.0002920462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005966642,"about_ca_topic_score_gemma":0.00280346,"domain_scores_codex":[0.999692,0.00007578891,0.00001636097,0.0000556199,0.0001186885,0.00004165317],"domain_scores_gemma":[0.9995875,0.0001514976,0.00009451419,0.00006954446,0.00007333139,0.00002371666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007184732,0.0001490742,0.008505989,0.0007561992,0.00005371889,0.0005895408,0.0003484749,0.07760772,0.3235832,0.09428129,0.002424446,0.4909818],"study_design_scores_gemma":[0.00008717713,0.002503672,0.01537748,0.0001942631,0.0002562476,0.00359728,0.0008444273,0.2608459,0.5683935,0.05120477,0.09655786,0.0001374342],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8309226,0.0109,0.111339,0.0005172259,0.0001640875,0.00004318027,0.0001257252,0.0003879514,0.04560025],"genre_scores_gemma":[0.9481995,0.003461999,0.03944864,0.00007871914,0.00003836365,0.00001824601,0.00006653141,0.00006152892,0.008626511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.001189077,"threshold_uncertainty_score":0.003977895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967786783","doi":"10.5555/644108.644154","title":"Packing Steiner trees","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":204,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Graph; Packing problems; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","authors":[{"name":"Kamal Jain","is_ca":false},{"name":"Mohammad Mahdian","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009445759865425845,"gpt":0.1908248521865506,"spread":0.1813790923211247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488912,0.0005405489,0.0009985414,0.0009331542,0.0009478597,0.001325563,0.0008369165,0.001169186,0.008084097],"category_scores_gemma":[0.002934059,0.0005714829,0.0006615644,0.002474206,0.0005259818,0.002959401,0.001345321,0.0006643182,0.001377573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005342168,"about_ca_system_score_gemma":0.0004538653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006704672,"about_ca_topic_score_gemma":0.0008326625,"domain_scores_codex":[0.9992973,0.0001508535,0.00007935878,0.000166802,0.0001950738,0.000110581],"domain_scores_gemma":[0.9991339,0.0003936184,0.000119463,0.0002291839,0.00008136359,0.00004256117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005664959,0.0001606131,0.001543139,0.0006937614,0.00009064357,0.0005798769,0.0004010538,0.2459272,0.01667695,0.2330055,0.01628651,0.4840682],"study_design_scores_gemma":[0.00009551069,0.0003297726,0.001376377,0.0001435156,0.00005791745,0.001792961,0.0003234075,0.6361281,0.01605802,0.2897612,0.05388336,0.00004997046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07577511,0.001623271,0.898296,0.000425864,0.0001290137,0.000133774,0.0006530933,0.0006784648,0.02228531],"genre_scores_gemma":[0.4543133,0.002478879,0.5324391,0.0002097481,0.000119486,0.0001298273,0.002177635,0.0002146881,0.00791737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008084097,"threshold_uncertainty_score":0.027044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3166559827","doi":"10.1109/mcas.2021.3071607","title":"FPGA Architecture: Principles and Progression","year":2021,"lang":"en","type":"article","venue":"IEEE Circuits and Systems Magazine","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"Vector Institute","keywords":"Reconfigurability; Field-programmable gate array; Computer architecture; Reconfigurable computing; Embedded system; Computer science; Architecture; Key (lock); Process (computing); Telecommunications; Operating system","authors":[{"name":"Andrew Boutros","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02337800119548627,"gpt":0.2348529428261991,"spread":0.2114749416307129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019747,0.0007344542,0.0002971684,0.001297768,0.0004122928,0.002460785,0.0009330546,0.001298076,0.003624347],"category_scores_gemma":[0.001217313,0.0006253953,0.0002947713,0.001197977,0.001310558,0.002057177,0.0007115537,0.002099787,0.002938245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077906,"about_ca_system_score_gemma":0.001010008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001509466,"about_ca_topic_score_gemma":0.001194806,"domain_scores_codex":[0.9993404,0.0001119846,0.00006434172,0.0001127354,0.0003206574,0.0000498672],"domain_scores_gemma":[0.9994944,0.0001331874,0.00003371355,0.00006529781,0.0002350144,0.00003842967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008998562,0.00005139162,0.0009608524,0.001158809,0.00002433226,0.0002639686,0.0003518485,0.01052384,0.007012872,0.3740832,0.0222096,0.5832694],"study_design_scores_gemma":[0.00002699099,0.0001734169,0.001092926,0.0006476812,0.00001826481,0.001663687,0.0001118931,0.01389553,0.004136058,0.07670366,0.9014597,0.00007024183],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01122352,0.2830787,0.4797003,0.006118957,0.00201995,0.000380498,0.0003884095,0.001205557,0.2158841],"genre_scores_gemma":[0.1457471,0.3019758,0.4674012,0.00273653,0.002420518,0.0005715495,0.0008143151,0.000413064,0.07791989],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003624347,"threshold_uncertainty_score":0.01212466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1525696892","doi":"10.1109/iccad.2004.1382639","title":"Unification of partitioning, placement and floorplanning","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":170,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Floorplan; Computer science; Scalability; Application-specific integrated circuit; Placement; Integrated circuit layout; Physical design; Macro; Parallel computing; Very-large-scale integration; Undo; Computer engineering; Algorithm; Integrated circuit; Circuit design; Embedded system","authors":[{"name":"Saurabh Adya","is_ca":false},{"name":"Shashank Chaturvedi","is_ca":true},{"name":"Jarrod A. Roy","is_ca":false},{"name":"David Papa","is_ca":false},{"name":"Igor L. Markov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009212084357099467,"gpt":0.2125116465322438,"spread":0.2032995621751443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335258,0.001124101,0.0009591294,0.0006460937,0.00035684,0.001371563,0.001172055,0.0007268036,0.001387089],"category_scores_gemma":[0.002641834,0.0007831839,0.000653011,0.0009970024,0.001388174,0.001540246,0.001143594,0.00126938,0.0004826806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006936963,"about_ca_system_score_gemma":0.001791463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001882603,"about_ca_topic_score_gemma":0.002337914,"domain_scores_codex":[0.998827,0.0003932698,0.00008569988,0.0002264192,0.0003646049,0.0001029482],"domain_scores_gemma":[0.9989126,0.0005038048,0.0001042883,0.0003145561,0.0001307227,0.00003398142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008511751,0.00004133952,0.0005850607,0.0006501136,0.00005721161,0.0001536767,0.000267901,0.3524334,0.01277747,0.139465,0.002187177,0.4912966],"study_design_scores_gemma":[0.00006824619,0.0002852886,0.001946274,0.0002985104,0.0001119081,0.0007018124,0.0001406118,0.6934116,0.02092718,0.2228876,0.05914215,0.00007887802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002077518,0.0009309918,0.9937757,0.0000922012,0.00004312837,0.00007191848,0.00002146818,0.000306218,0.002680823],"genre_scores_gemma":[0.1024232,0.002915608,0.8913036,0.0001195686,0.0001211619,0.000225995,0.000193642,0.0002909068,0.002406397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001882603,"threshold_uncertainty_score":0.00706166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129946839","doi":"10.1287/ijoc.1080.0296","title":"Accelerating Benders Decomposition by Local Branching","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Branching (polymer chemistry); Mathematical optimization; Branch and bound; Mathematics; Decomposition; Upper and lower bounds; Algorithm; Computer science","authors":[{"name":"Walter Rei","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Patrick Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0160819075541137,"gpt":0.2410822944355039,"spread":0.2250003868813902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214803,0.001080465,0.000792387,0.0008763766,0.0004806558,0.0008942551,0.0009226952,0.0008045803,0.006894668],"category_scores_gemma":[0.00285783,0.0004890675,0.0007149936,0.0009558161,0.0007374939,0.001584388,0.001541527,0.002030561,0.00147533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006671899,"about_ca_system_score_gemma":0.0007641245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194873,"about_ca_topic_score_gemma":0.002127141,"domain_scores_codex":[0.9993137,0.0002009491,0.00002682367,0.0001052484,0.0002520899,0.0001012055],"domain_scores_gemma":[0.99892,0.0006066598,0.00009054548,0.000186585,0.0001381067,0.00005815522],"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.0002476094,0.0001376728,0.0004994628,0.0001605813,0.0000395988,0.0001123048,0.0001734924,0.6437176,0.03446115,0.07101348,0.002199779,0.2472373],"study_design_scores_gemma":[0.00005339406,0.00008159406,0.0001092461,0.00002127591,0.00001722824,0.00005505215,0.00002915753,0.9592335,0.009821321,0.02697084,0.003594232,0.0000131268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01217367,0.0001022206,0.9833236,0.00005894151,0.0000186471,0.00003183913,0.00001243497,0.0006268627,0.003651816],"genre_scores_gemma":[0.1975884,0.0002696165,0.7980997,0.00009966326,0.00003473536,0.0001322378,0.00009403498,0.0003517302,0.00332999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006894668,"threshold_uncertainty_score":0.02306497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996309908","doi":"10.1137/s1064827502401953","title":"Permuting Sparse Rectangular Matrices into Block-Diagonal Form","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Diagonal; Bipartite graph; Sparse matrix; Block matrix; Factorization; Combinatorics; Vertex (graph theory); Graph; Algorithm; Eigenvalues and eigenvectors; Gaussian","authors":[{"name":"Cevdet Aykanat","is_ca":false},{"name":"Ali Pınar","is_ca":false},{"name":"Ümit V. Çatalyürek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0130859972809326,"gpt":0.2427284259525517,"spread":0.2296424286716191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005036963,0.0006312155,0.0005221616,0.0003691906,0.0002638607,0.000611541,0.0005112409,0.0004237914,0.004822391],"category_scores_gemma":[0.001758305,0.0002391935,0.0004106674,0.0006524159,0.0005546361,0.0009842747,0.0005933999,0.0005781824,0.00144585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000217673,"about_ca_system_score_gemma":0.0005304936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259871,"about_ca_topic_score_gemma":0.00197989,"domain_scores_codex":[0.9996392,0.00009913528,0.00001959445,0.0001012593,0.00009535483,0.00004554327],"domain_scores_gemma":[0.9990942,0.0004140743,0.0001223026,0.000194664,0.0001371232,0.00003757058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000255975,0.0001449858,0.0008122845,0.0003630847,0.00007341977,0.0003752432,0.000222237,0.4597385,0.0781095,0.1123773,0.004881454,0.342646],"study_design_scores_gemma":[0.00003641064,0.0001981802,0.0001731837,0.00001191015,0.00001718764,0.0001174383,0.00007237835,0.9349142,0.02260551,0.03552129,0.006315547,0.00001681971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01609107,0.0000687621,0.9814836,0.00008877421,0.0000429701,0.00003885726,0.00005244167,0.0003054562,0.001828126],"genre_scores_gemma":[0.1904935,0.0002576894,0.8034393,0.000130811,0.00004733239,0.00009778156,0.000242903,0.0001548918,0.00513595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004822391,"threshold_uncertainty_score":0.01613253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166604263","doi":"10.1109/ipdps.2013.50","title":"Multi-threaded Graph Partitioning","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry; National Science Foundation","keywords":"Computer science; Parallel computing; Thread (computing); Speedup; Graph partition; Threading (protein sequence); Graph; Synchronization (alternating current); Multithreading; Theoretical computer science; Distributed computing; Programming language","authors":[{"name":"Dominique LaSalle","is_ca":false},{"name":"George Karypis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01698447838718365,"gpt":0.206530447974196,"spread":0.1895459695870123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009034498,0.0003151688,0.0004175075,0.0003670228,0.000427759,0.0007366514,0.001599608,0.000481186,0.003426388],"category_scores_gemma":[0.002115625,0.0002943655,0.0003976037,0.000334608,0.0004254695,0.001338433,0.001013695,0.0007411484,0.0004941956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007282565,"about_ca_system_score_gemma":0.0008961565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001082646,"about_ca_topic_score_gemma":0.002078989,"domain_scores_codex":[0.9992831,0.0001524255,0.00004226802,0.0001388653,0.0002880888,0.00009525572],"domain_scores_gemma":[0.9989247,0.0003616716,0.00009319421,0.0003270181,0.0002194326,0.00007389846],"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.0005854513,0.0003502047,0.003526567,0.0004177467,0.0001484126,0.0002984642,0.0006760893,0.3230805,0.126424,0.04413039,0.005300794,0.4950614],"study_design_scores_gemma":[0.00007799718,0.0001840914,0.0006679407,0.00001816971,0.00002458887,0.0001213009,0.0000744551,0.937857,0.03676037,0.01189849,0.01229575,0.00001982834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04602244,0.0001941264,0.9476002,0.0001445802,0.00005919747,0.0001109838,0.00003501222,0.002563015,0.003270391],"genre_scores_gemma":[0.2958476,0.0001376443,0.6994515,0.0001088057,0.00002232653,0.0001703416,0.0001326049,0.0003737556,0.003755485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003426388,"threshold_uncertainty_score":0.01146245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150281391","doi":"10.1109/cicc.1997.606687","title":"Cluster-based logic blocks for FPGAs: area-efficiency vs. input sharing and size","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Logic block; Computer science; Lookup table; Cluster (spacecraft); Key (lock); Parallel computing; Routing (electronic design automation); Cluster size; Block (permutation group theory); Logic gate; Logic synthesis; Logic optimization; Computer architecture; Arithmetic; Computer hardware; Embedded system; Algorithm; Mathematics; Computer network; Operating system","authors":[{"name":"Vaughn Betz","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02618504134952716,"gpt":0.2205974323639577,"spread":0.1944123910144306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641532,0.0004386512,0.0003285395,0.0004979278,0.0003462249,0.000602245,0.0008611833,0.0003335178,0.003033811],"category_scores_gemma":[0.003128344,0.0002176563,0.0002256303,0.0008615802,0.0003058886,0.001711649,0.0003630316,0.0003249779,0.0004392182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007436642,"about_ca_system_score_gemma":0.0003549896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009379516,"about_ca_topic_score_gemma":0.002567152,"domain_scores_codex":[0.9995561,0.0001213306,0.00002602735,0.00004707549,0.0001693634,0.0000801662],"domain_scores_gemma":[0.9979059,0.001387604,0.0002116876,0.0002619803,0.0001894588,0.00004339012],"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.001461501,0.0001606752,0.00596646,0.0005560726,0.0001608153,0.0003015925,0.0001554851,0.5558084,0.1603174,0.0412272,0.002853131,0.2310312],"study_design_scores_gemma":[0.0002438945,0.002683647,0.01214232,0.0001089099,0.0002720925,0.001662857,0.0002898178,0.619772,0.3169575,0.03048231,0.01530352,0.00008117269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.743051,0.003598684,0.2294115,0.0008902561,0.00004961843,0.000130725,0.0002146119,0.0009726149,0.02168106],"genre_scores_gemma":[0.9188041,0.000916953,0.07760871,0.0000987334,0.00002941916,0.00005222053,0.0001302451,0.0001351678,0.002224408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003033811,"threshold_uncertainty_score":0.01014912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164340799","doi":"10.1109/fpl.2013.6645503","title":"Titan: Enabling large and complex benchmarks in academic CAD","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stratix; Field-programmable gate array; Computer science; Benchmark (surveying); Titan (rocket family); Computer architecture; CAD; Architecture; Electronic design automation; Parallel computing; Software; Embedded system; Operating system; Engineering","authors":[{"name":"Kevin E. Murray","is_ca":true},{"name":"Scott Whitty","is_ca":true},{"name":"Suya Liu","is_ca":true},{"name":"Jason Luu","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01999264766098574,"gpt":0.2453339856911479,"spread":0.2253413380301622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003531791,0.001299082,0.0005134999,0.001745912,0.0005174376,0.001546911,0.002186802,0.0006679348,0.008817283],"category_scores_gemma":[0.01088233,0.0005275709,0.0006277182,0.002036351,0.0006436208,0.002017523,0.001494623,0.001200739,0.001626627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188217,"about_ca_system_score_gemma":0.001404607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004002929,"about_ca_topic_score_gemma":0.004936828,"domain_scores_codex":[0.9966444,0.0009852344,0.0001990262,0.0002387376,0.001677354,0.0002553502],"domain_scores_gemma":[0.994829,0.002694475,0.0003288492,0.00102907,0.0009722736,0.0001463965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00108797,0.000974248,0.009824053,0.00134679,0.0001454679,0.0007433966,0.0008120352,0.2087329,0.06735394,0.09188839,0.08638512,0.5307057],"study_design_scores_gemma":[0.0005241139,0.001094488,0.005900872,0.0002883073,0.00007844912,0.0006154628,0.0003903667,0.6263888,0.1407915,0.03201259,0.1917474,0.0001675578],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1153104,0.001233876,0.7483985,0.0005695837,0.000360223,0.0009850537,0.003301186,0.07103868,0.0588025],"genre_scores_gemma":[0.3514145,0.0008224742,0.6203389,0.0003071706,0.00009587436,0.001226952,0.00994283,0.007400561,0.008450734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008817283,"threshold_uncertainty_score":0.02949673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128239317","doi":"10.1109/cicc.1995.518231","title":"A time-multiplexed FPGA architecture for logic emulation","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Emulation; Logic family; Computer science; Logic synthesis; Logic optimization; USable; Field-programmable gate array; Logic gate; Programmable logic device; Computer architecture; Programmable logic array; Pass transistor logic; Embedded system; Sequential logic; Digital electronics; Resistor–transistor logic; Electronic circuit; Engineering; Electrical engineering; Algorithm","authors":[{"name":"D. H. Jones","is_ca":true},{"name":"David Lewis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02150966527785809,"gpt":0.2157802822445578,"spread":0.1942706169666997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743933,0.0003850567,0.0001423851,0.000391787,0.000287619,0.000525958,0.0007354677,0.0003146356,0.005180635],"category_scores_gemma":[0.0002665086,0.0001330837,0.0001674088,0.0002527893,0.0002116305,0.0005904996,0.0002137161,0.000395566,0.001047268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003540482,"about_ca_system_score_gemma":0.0002666703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004600447,"about_ca_topic_score_gemma":0.00101975,"domain_scores_codex":[0.9998738,0.00002297648,0.000006135509,0.00002365775,0.00005676293,0.00001680061],"domain_scores_gemma":[0.9998904,0.00002573898,0.00001255986,0.00002555257,0.00003321869,0.00001252864],"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.00051343,0.0001482026,0.0006860254,0.0002780063,0.00007556575,0.0007052956,0.0001137613,0.02562422,0.3798539,0.08587556,0.008776275,0.4973497],"study_design_scores_gemma":[0.0001958956,0.001444651,0.001326092,0.00009579674,0.0001547944,0.003515765,0.00004249232,0.3353267,0.4333252,0.01409316,0.2103894,0.00009004534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03102059,0.001061236,0.9418004,0.0002179158,0.0002587229,0.0001264997,0.000104943,0.00338462,0.02202511],"genre_scores_gemma":[0.4321594,0.0009940549,0.5408245,0.0002436368,0.0001561859,0.0001273554,0.0002131913,0.0001215919,0.0251601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005180635,"threshold_uncertainty_score":0.01733094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150787480","doi":"10.1109/tcad.2006.882119","title":"Heuristics for Area Minimization in LUT-Based FPGA Technology Mapping","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Lookup table; Computer science; Heuristic; Field-programmable gate array; Minification; Enhanced Data Rates for GSM Evolution; Parallel computing; Node (physics); Algorithm; Computer hardware; Artificial intelligence","authors":[{"name":"Valavan Manohararajah","is_ca":true},{"name":"Stephen D. Brown","is_ca":true},{"name":"Z.G. Vranesic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02621289587570975,"gpt":0.2087986320457632,"spread":0.1825857361700534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006886208,0.00102693,0.0006552216,0.001199086,0.0004891143,0.0007201346,0.001159902,0.0005455727,0.003838496],"category_scores_gemma":[0.002083336,0.0005749261,0.0005999351,0.0009810855,0.0004005906,0.0008414772,0.000601893,0.0005027793,0.0007690393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008715737,"about_ca_system_score_gemma":0.001393956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224637,"about_ca_topic_score_gemma":0.004518439,"domain_scores_codex":[0.999551,0.0001704571,0.00002649142,0.00005414252,0.0001254797,0.00007243674],"domain_scores_gemma":[0.998814,0.0008364983,0.0001068503,0.00009952482,0.0001182221,0.00002494514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001716938,0.0001299905,0.0009555413,0.0004094158,0.0000708337,0.0001476697,0.0001569702,0.6462622,0.009476564,0.01624894,0.003724943,0.3222452],"study_design_scores_gemma":[0.00008393132,0.0001657718,0.0004232264,0.0000511763,0.00005465516,0.0001284489,0.00008561855,0.9688652,0.008967756,0.01576757,0.005381626,0.00002504277],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02926999,0.0007766818,0.9628206,0.00007841975,0.0000329822,0.0001949846,0.00011483,0.001619247,0.005092331],"genre_scores_gemma":[0.1567681,0.0003974573,0.8405058,0.00007525985,0.00001831838,0.0002755307,0.0002255547,0.0001950875,0.001539015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003838496,"threshold_uncertainty_score":0.01284111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150022482","doi":"10.1109/fccm.2012.25","title":"ZUMA: An Open FPGA Overlay Architecture","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"TRIUMF","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Netlist; Overlay; Architecture; Embedded system; Computer architecture; Suite; Benchmark (surveying); Compiler; Bitstream; Computer hardware; Operating system; Decoding methods; Telecommunications","authors":[{"name":"Alexander Brant","is_ca":true},{"name":"Guy Lemieux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01969399256680202,"gpt":0.2574165092262353,"spread":0.2377225166594333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727761,0.0005078006,0.0003458945,0.0008532672,0.0003888547,0.0009090893,0.001429167,0.0004155716,0.01025574],"category_scores_gemma":[0.0008245753,0.0003153449,0.0004315393,0.0005588697,0.000302234,0.001367289,0.001503105,0.0006801352,0.002429134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006537028,"about_ca_system_score_gemma":0.0007009121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001412714,"about_ca_topic_score_gemma":0.002366339,"domain_scores_codex":[0.9996117,0.00006673941,0.00002417035,0.00005450915,0.0001610801,0.0000817858],"domain_scores_gemma":[0.9997619,0.00003751639,0.00002510319,0.00007239207,0.00005823777,0.00004476975],"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.002684619,0.0004324864,0.004937963,0.0009004537,0.0002282691,0.001241891,0.0004285278,0.120951,0.09140027,0.08092674,0.07295637,0.6229115],"study_design_scores_gemma":[0.0005698025,0.002132162,0.003984417,0.0001652708,0.0002119545,0.001802089,0.0002338208,0.5506531,0.08544639,0.03415631,0.3204518,0.0001928456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1823509,0.002341843,0.6355199,0.0005149966,0.0004850842,0.0004568737,0.00127366,0.07070519,0.1063516],"genre_scores_gemma":[0.7048007,0.000701539,0.2592849,0.0002685522,0.00006743416,0.0002629716,0.003229899,0.001800244,0.02958371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01025574,"threshold_uncertainty_score":0.03430879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101356024","doi":"10.5555/996070.1009965","title":"On the Interaction Between Power-Aware FPGA CAD Algorithms","year":2003,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":108,"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; CAD; Cluster analysis; Routing (electronic design automation); Power analysis; Algorithm; Design flow; Energy consumption; Electronic design automation; Power (physics); Embedded system; Power optimization; FPGA prototype; Energy (signal processing); Field (mathematics); Reconfigurable computing; Power consumption; Artificial intelligence; Engineering; Electrical engineering","authors":[{"name":"Julien Lamoureux","is_ca":true},{"name":"Steven J. E. Wilton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07563059520384806,"gpt":0.2878558569216994,"spread":0.2122252617178513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066642,0.0006569796,0.000437299,0.0007328877,0.0002813436,0.001358243,0.000695824,0.0005338503,0.002040835],"category_scores_gemma":[0.005966728,0.0004431549,0.0003175951,0.000600111,0.0003272013,0.001314661,0.0003992036,0.0004541957,0.0003772523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006195469,"about_ca_system_score_gemma":0.000512369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002517048,"about_ca_topic_score_gemma":0.006852989,"domain_scores_codex":[0.9992728,0.0002208967,0.00003359058,0.00007985014,0.0003406077,0.00005238004],"domain_scores_gemma":[0.996777,0.002494658,0.0001568832,0.0002241882,0.0003196955,0.00002769502],"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.0002102778,0.0001232881,0.002756278,0.0001008762,0.00006259081,0.00009796319,0.00007354799,0.5589318,0.01665858,0.01298313,0.0008938127,0.4071079],"study_design_scores_gemma":[0.00002143045,0.0001029728,0.0007238481,0.00001265411,0.00002414109,0.00007223905,0.00001980825,0.9858329,0.007523181,0.003468054,0.002188054,0.00001074802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1112254,0.001112514,0.8742136,0.0003771146,0.00006433811,0.00009054079,0.00003594902,0.001366785,0.01151374],"genre_scores_gemma":[0.5626099,0.001069769,0.4299234,0.0002165543,0.0000421643,0.00007364174,0.00008281161,0.000261433,0.005720233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002517048,"threshold_uncertainty_score":0.006827295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023428606","doi":"10.1145/2629579","title":"Timing-Driven Titan","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Texas Instruments","keywords":"Stratix; Field-programmable gate array; Computer science; Titan (rocket family); Benchmark (surveying); Parallel computing; Computer architecture; Architecture; Embedded system","authors":[{"name":"Kevin E. Murray","is_ca":true},{"name":"Scott Whitty","is_ca":true},{"name":"Suya Liu","is_ca":true},{"name":"Jason Luu","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03874766694699842,"gpt":0.2399423007596565,"spread":0.2011946338126581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006644271,0.0007038497,0.0002508924,0.0006935734,0.0003536528,0.0004687633,0.001044222,0.0002737214,0.006366674],"category_scores_gemma":[0.002115119,0.0002352233,0.0004004276,0.0009559683,0.0002585053,0.0004671098,0.0003754355,0.0005381707,0.0006616993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009183721,"about_ca_system_score_gemma":0.001185235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005871461,"about_ca_topic_score_gemma":0.01163957,"domain_scores_codex":[0.999465,0.0001026989,0.00002450443,0.00007753752,0.0002391982,0.00009097818],"domain_scores_gemma":[0.999064,0.0002957687,0.00009048353,0.0001718027,0.0003415884,0.0000363152],"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.0006865608,0.0004910423,0.009758138,0.0007690793,0.00009724817,0.0005602664,0.0003140827,0.5535194,0.07494296,0.0492745,0.07311749,0.2364693],"study_design_scores_gemma":[0.0001122825,0.0005490964,0.004354284,0.00003997172,0.00003256118,0.0002757604,0.00006832328,0.8610368,0.06933399,0.006777662,0.05737917,0.00004011508],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.627004,0.0009058935,0.2297138,0.0005336233,0.0004597474,0.000693025,0.0112109,0.02026406,0.109215],"genre_scores_gemma":[0.7850251,0.0003735588,0.1739541,0.0002912564,0.00005011779,0.0008047434,0.01788926,0.002214254,0.01939764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006366674,"threshold_uncertainty_score":0.02129865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2301743601","doi":"10.14778/2904483.2904486","title":"Leopard","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Graph; Space partitioning; Vertex (graph theory); Algorithm; Theoretical computer science","authors":[{"name":"Jiewen Huang","is_ca":false},{"name":"Daniel J. Abadi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005755987320689607,"gpt":0.165789516692164,"spread":0.1600335293714744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165445,0.0007336564,0.0005107598,0.001020997,0.0009231182,0.001741742,0.001660209,0.0008015404,0.05232141],"category_scores_gemma":[0.001090623,0.0004097563,0.000541923,0.00080649,0.0004008535,0.001635468,0.001724607,0.001022017,0.02448227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007756401,"about_ca_system_score_gemma":0.0008213957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003020869,"about_ca_topic_score_gemma":0.005101326,"domain_scores_codex":[0.9994909,0.00004982489,0.00002531981,0.0001331683,0.0002393183,0.00006142884],"domain_scores_gemma":[0.9995421,0.00006643276,0.00002120512,0.0001831965,0.0001367425,0.00005031278],"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.0005969793,0.0001310079,0.001340573,0.0003632906,0.00005307454,0.0004232337,0.0002456598,0.01593347,0.02990586,0.05783994,0.1391491,0.7540178],"study_design_scores_gemma":[0.00008980252,0.0001861433,0.001111761,0.00007617205,0.00002793968,0.0007978191,0.0001244092,0.08816254,0.02427983,0.01729182,0.8677877,0.00006403474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01725239,0.001563006,0.6695555,0.001018135,0.0009159789,0.0004892748,0.002886362,0.05155236,0.254767],"genre_scores_gemma":[0.155492,0.001264074,0.5487882,0.0008712166,0.0001595604,0.0004044976,0.01001806,0.006759912,0.2762425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05232141,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101215367","doi":"","title":"A NEW AND FLEXIBLE METHOD FOR CONSTRUCTING DESIGNS FOR COMPUTER EXPERIMENTS","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Simon Fraser University","funders":"","keywords":"Latin hypercube sampling; Hypercube; Orthogonal array; Construct (python library); Computer experiment; Mathematics; Feature (linguistics); Power of two; Computer science; Theoretical computer science; Algorithm; Mathematical optimization; Discrete mathematics; Statistics; Monte Carlo method; Programming language","authors":[{"name":"C. Devon Lin","is_ca":true},{"name":"Derek Bingham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05746213606325693,"gpt":0.3228053845310089,"spread":0.2653432484677519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299305,0.001265325,0.0006857119,0.001456184,0.0006675505,0.001013106,0.001212133,0.0006556191,0.01150786],"category_scores_gemma":[0.01100195,0.0008529847,0.001083522,0.0009057019,0.001588152,0.001627424,0.001415257,0.00222558,0.00269562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006589897,"about_ca_system_score_gemma":0.001281708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004051843,"about_ca_topic_score_gemma":0.0006674115,"domain_scores_codex":[0.9967675,0.001447323,0.0002068338,0.0004548287,0.001013958,0.0001095834],"domain_scores_gemma":[0.9936447,0.003430428,0.0003626111,0.001684534,0.0007590638,0.00011866],"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.000259247,0.0001691344,0.0008365357,0.0007539495,0.0001202886,0.0001945754,0.000349052,0.06988467,0.05212567,0.4003374,0.007182051,0.4677874],"study_design_scores_gemma":[0.0003873308,0.0009346373,0.0005608142,0.0002242905,0.0001285264,0.0007312575,0.0001230081,0.298871,0.05877114,0.4982687,0.140847,0.0001521997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005482788,0.00002690571,0.9977058,0.0000286231,0.00002286873,0.00006593934,0.00002477089,0.0003112211,0.001265669],"genre_scores_gemma":[0.01591084,0.00006212049,0.9816305,0.00005862348,0.00003105916,0.0005458422,0.00005111578,0.0001682802,0.001541663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01150786,"threshold_uncertainty_score":0.03849763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095258817","doi":"10.1109/fpt.2013.6718327","title":"COFFE: Fully-automated transistor sizing for FPGAs","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Transistor; Computer science; Sizing; Process (computing); Routing (electronic design automation); Electronic engineering; Embedded system; Engineering; Electrical engineering; Voltage","authors":[{"name":"Charles Chiasson","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007361591502590679,"gpt":0.1950858410826184,"spread":0.1877242495800278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004138222,0.00109779,0.0004818401,0.0008238731,0.0003219306,0.0007672507,0.001016225,0.000429865,0.01004956],"category_scores_gemma":[0.002048369,0.000512658,0.0007125499,0.0004264891,0.0002862852,0.0009792639,0.0005109722,0.0005444,0.001182573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005512757,"about_ca_system_score_gemma":0.0009238374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177645,"about_ca_topic_score_gemma":0.00680786,"domain_scores_codex":[0.9996728,0.00005655777,0.00002011071,0.00004158117,0.0001795141,0.00002952643],"domain_scores_gemma":[0.9989336,0.0006776461,0.00008634724,0.0001421507,0.0001395498,0.00002073846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002400464,0.00006464156,0.003429114,0.0006395148,0.0001171753,0.0003359195,0.0002181088,0.4229514,0.05065514,0.02215437,0.02681565,0.4723789],"study_design_scores_gemma":[0.00005654888,0.00008286415,0.0007316559,0.00004938578,0.000023762,0.0002165393,0.00003167914,0.9456673,0.0222544,0.008811679,0.02204235,0.0000319116],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01732976,0.0003334838,0.9599662,0.0001116273,0.00004531994,0.00008219548,0.0007035559,0.01618251,0.005245285],"genre_scores_gemma":[0.2416124,0.0003204039,0.7484655,0.0001559421,0.00003280166,0.0002635659,0.001537855,0.003038527,0.004572878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01004956,"threshold_uncertainty_score":0.03361911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075137913","doi":"10.1109/fpl.2012.6339278","title":"Analytical placement for heterogeneous FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Speedup; Computer science; Lookup table; Placement; Logic block; Parallel computing; Simulated annealing; Placer mining; Application-specific integrated circuit; Multiplier (economics); Computer hardware; Algorithm; Embedded system; Physical design; Circuit design","authors":[{"name":"Marcel Gort","is_ca":true},{"name":"Jason H. Anderson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02502333018816553,"gpt":0.2584584849067553,"spread":0.2334351547185898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000229854,0.0006520642,0.0004097653,0.0007095548,0.0004697453,0.0006715098,0.0009204114,0.0003535612,0.002325376],"category_scores_gemma":[0.0009220229,0.0003414586,0.0003678917,0.0005968863,0.0004033208,0.0006197291,0.0006327701,0.0003379688,0.0004470043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009582593,"about_ca_system_score_gemma":0.001004306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003109663,"about_ca_topic_score_gemma":0.005839031,"domain_scores_codex":[0.9997619,0.00004003708,0.00001074358,0.00004318171,0.0001052642,0.0000388864],"domain_scores_gemma":[0.999739,0.0000955951,0.00004319732,0.00004864751,0.00005643813,0.00001717707],"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.000107066,0.00002679458,0.0006989737,0.00008289597,0.00002536349,0.0002287912,0.00007268782,0.8876511,0.01725711,0.01580549,0.001360858,0.07668274],"study_design_scores_gemma":[0.00001151213,0.00004158518,0.0001515035,0.000007338904,0.0000089252,0.000079077,0.00003815587,0.9849331,0.007451359,0.00464294,0.002628185,0.000006390718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03979414,0.0001966352,0.952315,0.00007299263,0.00003086793,0.00003557156,0.0000562881,0.001340185,0.006158199],"genre_scores_gemma":[0.5489709,0.0003196191,0.4454963,0.0000680665,0.00002845018,0.00007093371,0.0001447402,0.0002192776,0.004681665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003109663,"threshold_uncertainty_score":0.007779181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155316178","doi":"10.1145/1950413.1950457","title":"Architecture description and packing for logic blocks with hierarchy, modes and complex interconnect","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Logic block; Block (permutation group theory); Verilog; Field-programmable gate array; Computer architecture; Logic synthesis; Hierarchy; Interconnection; Theoretical computer science; Key (lock); Parallel computing; Logic gate; Embedded system; Algorithm; Mathematics","authors":[{"name":"Jason Luu","is_ca":true},{"name":"Jason H. Anderson","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06117116452925328,"gpt":0.2131873254817999,"spread":0.1520161609525467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006106624,0.0005375571,0.0003076128,0.0005642927,0.0003204809,0.000990732,0.0009781235,0.0004964856,0.003919119],"category_scores_gemma":[0.001124596,0.0003595875,0.0006965363,0.0005585859,0.0006737749,0.001748027,0.0006068263,0.0007446972,0.0007734461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869698,"about_ca_system_score_gemma":0.0006310834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001526576,"about_ca_topic_score_gemma":0.003455966,"domain_scores_codex":[0.9996403,0.00008922548,0.00004841538,0.00004369937,0.0001364457,0.0000419496],"domain_scores_gemma":[0.9996023,0.0001577206,0.00005336969,0.0001242998,0.00005246861,0.000009983287],"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.0002295093,0.00007487914,0.001647447,0.0007695763,0.00003499996,0.0007481887,0.0008386063,0.2405537,0.04894793,0.4750694,0.009011275,0.2220745],"study_design_scores_gemma":[0.0000578268,0.0001337875,0.0003842048,0.00009132567,0.00004098192,0.00060209,0.0001447276,0.7944221,0.04045161,0.08593658,0.07769362,0.00004119827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01440994,0.0001619708,0.9815486,0.00008232175,0.00001349537,0.0000565761,0.0002715451,0.001134347,0.002321112],"genre_scores_gemma":[0.1379509,0.0004443076,0.852917,0.0001564189,0.00001514696,0.0002309218,0.001370499,0.0005786829,0.006336149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003919119,"threshold_uncertainty_score":0.01311076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072249022","doi":"10.1145/360276.360299","title":"Using sparse crossbars within LUT","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Crossbar switch; Lookup table; Computer science; Parallel computing; Spare part; Overhead (engineering); Path (computing); Routing (electronic design automation); Field-programmable gate array; Cluster (spacecraft); Sparse matrix; Block (permutation group theory); Embedded system; Computer network; Engineering; Mathematics; Telecommunications; Operating system","authors":[{"name":"Guy Lemieux","is_ca":true},{"name":"David Lewis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05195777177682509,"gpt":0.2667234553208874,"spread":0.2147656835440623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039714,0.0005274183,0.0002420039,0.00037626,0.0002508316,0.0006741674,0.0006379429,0.0002151846,0.004143067],"category_scores_gemma":[0.000610808,0.0002450529,0.000231028,0.000612794,0.0003020862,0.00110207,0.0005014901,0.0002572619,0.000770201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003365672,"about_ca_system_score_gemma":0.0003789018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001786951,"about_ca_topic_score_gemma":0.00458981,"domain_scores_codex":[0.9998098,0.0000456374,0.00001510789,0.00004616277,0.00004989386,0.000033387],"domain_scores_gemma":[0.9995582,0.0001292443,0.00008245814,0.0001298818,0.0000778184,0.00002245644],"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.0006333336,0.0001768287,0.003226436,0.0006596463,0.0001745903,0.0004232427,0.0002288907,0.1754909,0.3777777,0.04184918,0.005132118,0.3942272],"study_design_scores_gemma":[0.0001816163,0.002737722,0.004352481,0.0001514819,0.0002772221,0.001356417,0.0002003742,0.4540026,0.4150697,0.03221262,0.08935817,0.00009957018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3135034,0.001600929,0.6645116,0.0003181698,0.0002253227,0.0001016644,0.0002927679,0.006204611,0.01324161],"genre_scores_gemma":[0.8046517,0.0006120185,0.1871383,0.0001333392,0.0000568892,0.00004642541,0.0003148276,0.0001393455,0.006907182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004143067,"threshold_uncertainty_score":0.01385993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241249008","doi":"10.1109/iccad.2003.159755","title":"On the interaction between power-aware FPGA CAD Algorithms","year":2003,"lang":"en","type":"article","venue":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":71,"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; CAD; Cluster analysis; Routing (electronic design automation); Power analysis; Design flow; Energy consumption; Power (physics); Embedded system; Algorithm; Power optimization; Electronic design automation; Energy (signal processing); FPGA prototype; Reconfigurable computing; Field (mathematics); Power consumption; Artificial intelligence; Engineering; Electrical engineering","authors":[{"name":"Julien Lamoureux","is_ca":true},{"name":"Steven J. E. Wilton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06249537015885398,"gpt":0.2823761649429857,"spread":0.2198807947841318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120578,0.0006833914,0.0004555317,0.0007717127,0.0002908153,0.001487264,0.0007505943,0.0005670946,0.002130125],"category_scores_gemma":[0.006280598,0.0004766338,0.0003385665,0.0006275055,0.0003517007,0.001391522,0.0004563657,0.0004972421,0.0004166509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006355809,"about_ca_system_score_gemma":0.0005214747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00238821,"about_ca_topic_score_gemma":0.006260859,"domain_scores_codex":[0.9992181,0.0002400048,0.00003631194,0.00008740254,0.0003647299,0.0000534041],"domain_scores_gemma":[0.9967003,0.002541696,0.0001663517,0.0002431028,0.0003191263,0.0000293147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000205606,0.0001197651,0.002536708,0.0001035161,0.000061595,0.00009585188,0.0000793172,0.534023,0.01550899,0.01460854,0.0009740002,0.431683],"study_design_scores_gemma":[0.00002309522,0.00009924905,0.000645066,0.00001392411,0.00002391539,0.00007435084,0.00001964463,0.9855112,0.006873457,0.004300387,0.002404873,0.00001089643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08857738,0.001194087,0.8974617,0.0003588987,0.00006173112,0.00008586101,0.00003290399,0.001418381,0.01080902],"genre_scores_gemma":[0.5168613,0.001230895,0.475296,0.0002341638,0.00004676127,0.0000816556,0.00009084408,0.0002990241,0.00585935],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00238821,"threshold_uncertainty_score":0.007125974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014316444","doi":"10.1145/2068716.2068718","title":"VPR 5.0","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Computer science; Logic block; Computer architecture; Routing (electronic design automation); Field-programmable gate array; Robustness (evolution); Granularity; Architecture; Block (permutation group theory); Software; Key (lock); Embedded system; Computer engineering; Distributed computing; Operating system","authors":[{"name":"Jason Luu","is_ca":true},{"name":"Ian Kuon","is_ca":true},{"name":"Peter Jamieson","is_ca":true},{"name":"Ted Campbell","is_ca":true},{"name":"Andy Ye","is_ca":true},{"name":"Wei Mark Fang","is_ca":true},{"name":"Kenneth B. Kent","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02815876805467116,"gpt":0.2066578639327918,"spread":0.1784990958781207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001876111,0.001742275,0.001025384,0.001387028,0.0003590271,0.001894676,0.004146051,0.00126947,0.09323378],"category_scores_gemma":[0.003980237,0.001392812,0.001351986,0.0008003848,0.0004966536,0.002129581,0.001571186,0.002505691,0.03615823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000601285,"about_ca_system_score_gemma":0.001043347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001782507,"about_ca_topic_score_gemma":0.001501212,"domain_scores_codex":[0.998903,0.0001882373,0.00009780831,0.0001377178,0.0005182865,0.000154948],"domain_scores_gemma":[0.9990014,0.0004278559,0.00009550799,0.00018916,0.0002385671,0.00004749939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001115505,0.000296201,0.003165633,0.003041759,0.0003381957,0.0009870919,0.0003842992,0.04631748,0.02147686,0.06716739,0.5721064,0.2836031],"study_design_scores_gemma":[0.0006359406,0.0004707994,0.002125803,0.0004513855,0.0001107902,0.001431973,0.00008770931,0.1093587,0.039432,0.0366294,0.809051,0.0002145646],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.007006646,0.001901018,0.4808242,0.0003302225,0.0004968617,0.0006401805,0.02196818,0.4215635,0.06526919],"genre_scores_gemma":[0.1278795,0.004340012,0.5196465,0.001376837,0.0002768371,0.003139783,0.09410796,0.1558043,0.0934282],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.09323378,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150098004","doi":"10.1145/503048.503052","title":"Circuit design of routing switches","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Computer science; Benchmark (surveying); Very-large-scale integration; Electronic circuit; Transistor; Logic gate; Degradation (telecommunications); Electronic engineering; Embedded system; Electrical engineering; Engineering; Algorithm; Telecommunications; Voltage","authors":[{"name":"Guy Lemieux","is_ca":true},{"name":"David Lewis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05313668384039964,"gpt":0.1946461583508473,"spread":0.1415094745104476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760752,0.0002475884,0.0001344398,0.0002198947,0.0002080642,0.0005695913,0.000731723,0.0002001518,0.003632573],"category_scores_gemma":[0.0003656639,0.0001366901,0.0001557048,0.0001809796,0.0001644985,0.0004468937,0.0001353128,0.0002188766,0.0005889893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004301879,"about_ca_system_score_gemma":0.0003520773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000404721,"about_ca_topic_score_gemma":0.0008769672,"domain_scores_codex":[0.999889,0.000019771,0.000009013196,0.00002652056,0.00003476499,0.00002075715],"domain_scores_gemma":[0.9998689,0.00003754428,0.00001618402,0.00001900848,0.00004919984,0.000009169358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004750188,0.00009107869,0.002203186,0.0007160598,0.0001143794,0.0004366823,0.0001764945,0.116052,0.3808052,0.1062519,0.006400668,0.3862773],"study_design_scores_gemma":[0.0001840928,0.001341225,0.002020246,0.0001211273,0.0002053915,0.001032302,0.0001281238,0.4532131,0.4109972,0.02704416,0.1036619,0.0000512213],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08900059,0.0008557393,0.8792195,0.0002745168,0.0002906729,0.0001974555,0.0002052551,0.001651615,0.02830459],"genre_scores_gemma":[0.7283198,0.000702633,0.2628416,0.0002192384,0.00006578703,0.0001332223,0.0002270459,0.0001243098,0.007366365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003632573,"threshold_uncertainty_score":0.01215219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999993900","doi":"10.1007/s10479-011-0983-3","title":"An efficient memetic algorithm for the graph partitioning problem","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Memetic algorithm; Crossover; Graph partition; Tabu search; Theory of computation; Computer science; Partition (number theory); Mathematical optimization; Vertex (graph theory); Graph; Operator (biology); Algorithm; Mathematics; Local search (optimization); Theoretical computer science; Combinatorics; Artificial intelligence","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Zied Boujbel","is_ca":true},{"name":"Michael Coutinho Fernandes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2813694063939959,"gpt":0.4229850109156691,"spread":0.1416156045216732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007605,0.0007478195,0.0009300497,0.001041146,0.000764481,0.000829862,0.001452176,0.001331167,0.003513575],"category_scores_gemma":[0.001630498,0.0003983234,0.0006695607,0.001004413,0.0005130033,0.0009380432,0.0009002931,0.0008505101,0.000500479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006232947,"about_ca_system_score_gemma":0.001084817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722356,"about_ca_topic_score_gemma":0.002739417,"domain_scores_codex":[0.9997041,0.0001119145,0.00001352227,0.00004329603,0.00008399144,0.00004321242],"domain_scores_gemma":[0.9995489,0.0002633849,0.00003437479,0.00004836102,0.00008037016,0.00002471427],"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.0002925199,0.0002511094,0.0005043678,0.0002008589,0.0001228592,0.0001607164,0.0001263435,0.6127664,0.006587296,0.03034098,0.009958427,0.3386881],"study_design_scores_gemma":[0.00009227756,0.0000747782,0.0001380284,0.0000128364,0.00002244713,0.00008292677,0.00002646152,0.9836321,0.0009113498,0.01238053,0.002617491,0.000008762067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03969314,0.0007916242,0.9461948,0.0007724066,0.0002994026,0.0001710428,0.0001025691,0.0005033266,0.01147174],"genre_scores_gemma":[0.2460758,0.0004184265,0.7442639,0.0003044996,0.0001572657,0.0004080116,0.0002183107,0.0001116192,0.008042097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003513575,"threshold_uncertainty_score":0.0117541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069460396","doi":"10.1109/fpl.2009.5272538","title":"Clock gating architectures for FPGA power reduction","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Clock gating; Digital clock manager; Clock network; Clock domain crossing; CPU multiplier; Field-programmable gate array; Computer science; Gating; Clock skew; Clock signal; Power gating; Reduction (mathematics); Computer hardware; Application-specific integrated circuit; Synchronous circuit; Electronic engineering; Embedded system; Engineering; Jitter; Electrical engineering; Transistor; Voltage; Telecommunications","authors":[{"name":"Safeen Huda","is_ca":true},{"name":"Muntasir Mallick","is_ca":true},{"name":"Jason H. Anderson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007858428311754624,"gpt":0.227722390367063,"spread":0.2198639620553083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001343001,0.0003567102,0.0001406544,0.0003071545,0.0001711954,0.0004048973,0.0004436479,0.0001711019,0.003693795],"category_scores_gemma":[0.000360231,0.0001102484,0.0001188663,0.0005354515,0.0001676714,0.0005118228,0.0001572154,0.0002913067,0.0003212435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000322359,"about_ca_system_score_gemma":0.0002694704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006350644,"about_ca_topic_score_gemma":0.001756886,"domain_scores_codex":[0.9998959,0.0000261461,0.000006222124,0.00001511175,0.00003537011,0.00002115949],"domain_scores_gemma":[0.9998558,0.00005028424,0.0000237271,0.00003101537,0.00003189683,0.000007248754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004557685,0.0001605623,0.001368219,0.0003057172,0.00004672212,0.0002760469,0.0001000038,0.1173442,0.318517,0.04512677,0.008124707,0.5081744],"study_design_scores_gemma":[0.0001731342,0.001396104,0.003638967,0.0001018009,0.0001320456,0.0008751612,0.00008509979,0.5780595,0.3177077,0.02014956,0.07762353,0.00005737097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445115,0.003130053,0.721119,0.0004191459,0.0001581363,0.0001535106,0.0001731876,0.002984178,0.02735126],"genre_scores_gemma":[0.8334278,0.001439647,0.1564085,0.0001914007,0.00006883201,0.00008297194,0.0001831988,0.000140478,0.00805712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003693795,"threshold_uncertainty_score":0.01235694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480203124","doi":"10.1109/fpt.2002.1188684","title":"Power-aware technology mapping for LUT-based FPGAs","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lookup table; Computer science; Field-programmable gate array; Routing (electronic design automation); Replication (statistics); Logic gate; Power (physics); Logic synthesis; Computer architecture; Embedded system; Algorithm","authors":[{"name":"James H. Anderson","is_ca":true},{"name":"Farid N. Najm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01027635164221018,"gpt":0.2083733573793583,"spread":0.1980970057371481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001186642,0.0003379371,0.0002122186,0.0003620602,0.0002453753,0.0003085186,0.0004460668,0.0001625905,0.001584165],"category_scores_gemma":[0.0006726551,0.0001370331,0.0002002501,0.0004269954,0.0001513637,0.0006587137,0.000225723,0.0002275438,0.0002374785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002262747,"about_ca_system_score_gemma":0.0002669621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004680092,"about_ca_topic_score_gemma":0.001484389,"domain_scores_codex":[0.9998978,0.00002321551,0.00001081703,0.00001589568,0.0000364267,0.00001577232],"domain_scores_gemma":[0.9997411,0.00007926973,0.00004487826,0.00008878788,0.0000362125,0.000009661432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000202976,0.00008085424,0.002073496,0.000223025,0.00004470278,0.0004325899,0.0002059223,0.1841443,0.274905,0.009611229,0.001910537,0.5261653],"study_design_scores_gemma":[0.00007063975,0.0005383301,0.003045055,0.00003407169,0.00007902808,0.0009971188,0.0001001883,0.665239,0.3016724,0.01287179,0.01531775,0.0000346595],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3361291,0.0008491743,0.6550897,0.0001372915,0.00007757985,0.00007420491,0.00009580144,0.002399208,0.005147858],"genre_scores_gemma":[0.7425436,0.0002767955,0.2544991,0.0000400913,0.0000186213,0.00004127497,0.0001039386,0.00008183681,0.002394808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001584165,"threshold_uncertainty_score":0.005299568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023462222","doi":"10.1145/1344671.1344676","title":"High-quality, deterministic parallel placement for FPGAs on commodity hardware","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Computer science; Parallel computing; Field-programmable gate array; Reduction (mathematics); Embedded system; Mathematics","authors":[{"name":"Adrian Ludwin","is_ca":true},{"name":"Vaughn Betz","is_ca":true},{"name":"Ketan Padalia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06598406236287854,"gpt":0.2889352279422001,"spread":0.2229511655793215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004098465,0.0005209431,0.0002938479,0.0004277365,0.000503079,0.0006789814,0.0008414508,0.0003011729,0.004014445],"category_scores_gemma":[0.001393063,0.0003638638,0.0002653909,0.0006886012,0.0003549874,0.000641057,0.0004910907,0.000424255,0.001154663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006325919,"about_ca_system_score_gemma":0.001145844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002958778,"about_ca_topic_score_gemma":0.009452277,"domain_scores_codex":[0.9994965,0.00009165947,0.0000279253,0.00006294786,0.0002754197,0.00004558617],"domain_scores_gemma":[0.9995454,0.0001041585,0.00005652118,0.0001798149,0.00009804815,0.0000161052],"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.0004601814,0.000087566,0.002122947,0.0003679403,0.00005839192,0.0004439843,0.0001403346,0.3384249,0.05751706,0.04211828,0.01057115,0.5476874],"study_design_scores_gemma":[0.0001985115,0.0005194694,0.002174932,0.00004650428,0.00003740611,0.0006930054,0.0001640578,0.8670226,0.06465694,0.03339192,0.03104403,0.0000505198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02926448,0.0002278516,0.9622263,0.0001271915,0.00005875299,0.0000807413,0.00006307376,0.002461479,0.005490121],"genre_scores_gemma":[0.2624975,0.0002343503,0.7325377,0.00005377308,0.00002627563,0.00007052401,0.0001770007,0.0002336603,0.004169157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004014445,"threshold_uncertainty_score":0.01342964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911751195","doi":"10.1145/3301298","title":"COFFE 2","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Lookup table; Block (permutation group theory); Embedded system; Computer architecture; Interface (matter); Computer hardware; Parallel computing; Operating system","authors":[{"name":"Sadegh Yazdanshenas","is_ca":true},{"name":"Vaughn Betz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009955210054345838,"gpt":0.2020108655535977,"spread":0.1920556554992519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004874128,0.001244236,0.000388369,0.0008772852,0.0003463586,0.001235439,0.001341336,0.0007820224,0.06598276],"category_scores_gemma":[0.001837161,0.0006176184,0.0008405633,0.000488963,0.0003161791,0.001198043,0.0007815381,0.0008217957,0.01143964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007429938,"about_ca_system_score_gemma":0.0008556565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001982463,"about_ca_topic_score_gemma":0.004245189,"domain_scores_codex":[0.9995988,0.00004625225,0.00002876352,0.00008016909,0.0001843842,0.00006169071],"domain_scores_gemma":[0.9993912,0.0002468737,0.00004692716,0.000118532,0.0001667732,0.00002960218],"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.001247915,0.0002245029,0.005426362,0.002269478,0.0001928019,0.001020577,0.0003468634,0.09747601,0.06016266,0.06833924,0.3338374,0.4294561],"study_design_scores_gemma":[0.0004622868,0.0004000808,0.002323836,0.0002946072,0.0001013038,0.00140859,0.00008665989,0.3149294,0.07859244,0.02254621,0.5787143,0.0001401904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03937072,0.001793657,0.6137586,0.0005228008,0.0005125829,0.0005864614,0.01770103,0.1692217,0.1565323],"genre_scores_gemma":[0.3709217,0.001571141,0.411746,0.00127338,0.0001331494,0.00123106,0.04806228,0.02831477,0.1367465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06598276,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100412947","doi":"10.1145/611817.611824","title":"Hardware-assisted simulated annealing with application for fast FPGA placement","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Office of Naval Research; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Netlist; Field-programmable gate array; Simulated annealing; Computer science; Placement; Exploit; Lookup table; Routing (electronic design automation); Parallel computing; Reconfigurable computing; Computer hardware; Embedded system; Computer engineering; Physical design; Algorithm; Circuit design","authors":[{"name":"Michael G. Wrighton","is_ca":false},{"name":"André DeHon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01206994597413021,"gpt":0.2269248086341153,"spread":0.214854862659985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555101,0.0005151866,0.0003431107,0.0003504204,0.0002896084,0.0003831983,0.000541867,0.0006335739,0.003141481],"category_scores_gemma":[0.001542803,0.0003930087,0.0003509844,0.000460661,0.0003779669,0.0002812124,0.0004172366,0.0007038021,0.0005291608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004941737,"about_ca_system_score_gemma":0.0006444873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536061,"about_ca_topic_score_gemma":0.002555426,"domain_scores_codex":[0.9996939,0.0001373566,0.00001036909,0.00002418862,0.0001131656,0.00002103793],"domain_scores_gemma":[0.9994714,0.0003014204,0.00004214101,0.00008355227,0.00008709473,0.00001444755],"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.0001253502,0.00003266652,0.0004233884,0.0001228131,0.0000420398,0.00008169618,0.0001133742,0.8498318,0.0254726,0.01697244,0.001620317,0.1051615],"study_design_scores_gemma":[0.00001869559,0.00003921921,0.00008837738,0.000005162916,0.000006290484,0.00001981044,0.000006504317,0.9891835,0.00552341,0.002128509,0.002975684,0.000004783594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02452085,0.0002549124,0.9664715,0.0001983326,0.00007402719,0.00007120986,0.00002591862,0.003322762,0.005060556],"genre_scores_gemma":[0.2528697,0.0001822735,0.7436461,0.00006665198,0.00002495667,0.000219366,0.00004963445,0.0002839741,0.002657369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003141481,"threshold_uncertainty_score":0.01050931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1607353855","doi":"10.1109/iccad.2004.1382642","title":"Engineering details of a stable force-directed placer","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":61,"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":"Placer mining; Computation; Computer science; Stability (learning theory); Computational science; Placement; Computer engineering; Physical design; Simulation; Parallel computing; Mathematical optimization; Algorithm; Geology; Mathematics; Circuit design; Embedded system","authors":[{"name":"Kristofer Vorwerk","is_ca":true},{"name":"Andrew Kennings","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005709059116641306,"gpt":0.1810944321271153,"spread":0.175385373010474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751322,0.0004444922,0.0003083933,0.0003584408,0.0003340664,0.000670967,0.001059254,0.0006784578,0.008267843],"category_scores_gemma":[0.001342325,0.0004451053,0.0002772337,0.0002876837,0.0002400171,0.0006683831,0.0004277416,0.000680953,0.002982022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003463074,"about_ca_system_score_gemma":0.0008685622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007978129,"about_ca_topic_score_gemma":0.001102296,"domain_scores_codex":[0.9995607,0.00003843698,0.00003148065,0.00004831788,0.0002850485,0.00003605587],"domain_scores_gemma":[0.9994848,0.0001669489,0.00005520009,0.0001572476,0.0001162772,0.000019593],"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.0002500714,0.000154811,0.0008667383,0.0003980006,0.00004093614,0.0007092469,0.0002107357,0.2249211,0.4152892,0.06262378,0.008859896,0.2856755],"study_design_scores_gemma":[0.0001268024,0.0006397152,0.0006160829,0.0000296351,0.00003474644,0.001021043,0.00005232845,0.6792749,0.2424503,0.01130449,0.0643898,0.00006018213],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01996789,0.0001058676,0.9654959,0.0002035978,0.00006386724,0.0001224972,0.0001702467,0.004228174,0.009641952],"genre_scores_gemma":[0.2488423,0.0001454608,0.743078,0.00009548572,0.0000329774,0.0001933141,0.0001532693,0.0004272418,0.007031932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008267843,"threshold_uncertainty_score":0.0276587,"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","authors":[{"name":"Ziad Abuowaimer","is_ca":true},{"name":"Dani Maarouf","is_ca":true},{"name":"Timothy J. Martin","is_ca":true},{"name":"Jeremy Foxcroft","is_ca":true},{"name":"Gary Gréwal","is_ca":true},{"name":"Shawki Areibi","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007099829,0.001341921,0.0004056606,0.0008517446,0.0003189699,0.001124733,0.002158085,0.0007306329,0.0340159],"category_scores_gemma":[0.001653088,0.0007106223,0.0005951049,0.0006887705,0.0003526693,0.0009507725,0.0009099672,0.001202172,0.01191132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007687873,"about_ca_system_score_gemma":0.001242236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003042696,"about_ca_topic_score_gemma":0.004646997,"domain_scores_codex":[0.9996351,0.00004372491,0.00002040853,0.0000700625,0.0001809927,0.00004973219],"domain_scores_gemma":[0.9996102,0.0001042296,0.0000490392,0.0000919037,0.0001215627,0.00002302616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007142699,0.0001507481,0.002151259,0.0009961431,0.0001569649,0.0002835869,0.0002524852,0.1152128,0.02979289,0.02934027,0.346475,0.4744735],"study_design_scores_gemma":[0.0004788346,0.0005763095,0.001418755,0.0001109682,0.00005612045,0.0005397095,0.00007845394,0.5196009,0.05116452,0.01619028,0.4096885,0.00009658728],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.0216772,0.001077122,0.6697404,0.0004578813,0.0003615685,0.0005656296,0.005296599,0.2413104,0.0595131],"genre_scores_gemma":[0.1590416,0.001174255,0.7286239,0.0007511891,0.00008125835,0.000873356,0.02019743,0.0259737,0.06328338],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.0340159,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157958003","doi":"10.1109/iccd.1994.331954","title":"Routing architectures for hierarchical field programmable gate arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Granularity; Computer science; Architecture; Set (abstract data type); Electronic circuit; Hierarchical routing; Computer architecture; Programmable logic array; Programmable Array Logic; Logic gate; Gate array; Logic synthesis; Parallel computing; Embedded system; Computer engineering; Routing protocol; Static routing; Engineering; Logic family; Algorithm; Electrical engineering","authors":[{"name":"Aneesh Aggarwal","is_ca":true},{"name":"David Lewis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01690598915460076,"gpt":0.2206926497709923,"spread":0.2037866606163916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002009952,0.000195022,0.0001036813,0.000295156,0.0002314713,0.00045263,0.0003818261,0.0002032145,0.00369781],"category_scores_gemma":[0.0004352302,0.00008648002,0.0002055163,0.0002775608,0.0002077575,0.0006159475,0.0001880953,0.0002094768,0.0004798298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006211814,"about_ca_system_score_gemma":0.0004077577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001873413,"about_ca_topic_score_gemma":0.003986111,"domain_scores_codex":[0.9998529,0.00003553462,0.000009991268,0.00001849492,0.00005682517,0.00002614164],"domain_scores_gemma":[0.999851,0.00003723801,0.00002475774,0.0000336148,0.00004377533,0.000009615705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002025364,0.00006893233,0.001196965,0.0003295296,0.00004806116,0.0001968663,0.00009862008,0.3919695,0.08551199,0.1550587,0.007547047,0.3577713],"study_design_scores_gemma":[0.0001188218,0.0008047462,0.002369937,0.0000822176,0.00007636143,0.0004693608,0.0001078213,0.8173159,0.04641765,0.06505862,0.06712569,0.00005286043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2569681,0.002026368,0.6832888,0.0004611493,0.0002046783,0.0001815356,0.0003252897,0.002873423,0.05367072],"genre_scores_gemma":[0.7233603,0.0005806625,0.2667331,0.0001681114,0.00004365839,0.00007498907,0.0003501456,0.00007990169,0.008609158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00369781,"threshold_uncertainty_score":0.01237041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152362440","doi":"10.1145/503048.503059","title":"Integrated retiming and placement for field programmable gate arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Retiming; Computer science; Field-programmable gate array; Routing (electronic design automation); Gate array; Combinational logic; Parallel computing; Electronic circuit; Algorithm; Logic gate; Embedded system; Engineering","authors":[{"name":"Deshanand P. Singh","is_ca":true},{"name":"Stephen D. Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02197769162648592,"gpt":0.2116866932996694,"spread":0.1897090016731834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003084654,0.0004254835,0.0001927914,0.0004371468,0.0003766063,0.0004279707,0.0005423408,0.0003896519,0.002752461],"category_scores_gemma":[0.001181819,0.0002281016,0.0002637921,0.0004333941,0.0002524453,0.0005371794,0.0002569976,0.000506291,0.0006261987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009369887,"about_ca_system_score_gemma":0.0007033931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003302532,"about_ca_topic_score_gemma":0.007325274,"domain_scores_codex":[0.9997167,0.00006346905,0.00001258574,0.0000484407,0.0001351506,0.00002359411],"domain_scores_gemma":[0.9996731,0.00009878474,0.00005902606,0.00007398896,0.00008251137,0.00001260892],"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.0001952415,0.0000634268,0.0008757153,0.0002074958,0.00005773755,0.00024222,0.0001284766,0.3005138,0.07099521,0.03658126,0.005647487,0.5844919],"study_design_scores_gemma":[0.00007044362,0.0004954762,0.0009881112,0.00005315589,0.00005553519,0.0003495798,0.00004259538,0.8904282,0.05138692,0.02186716,0.03422193,0.00004076133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0178843,0.001179923,0.9733854,0.0001574939,0.0001349122,0.00005888383,0.00004478846,0.002082697,0.005071626],"genre_scores_gemma":[0.3844106,0.0008579182,0.6063173,0.0002715307,0.00008011284,0.0001028318,0.0001735872,0.0001991339,0.007586935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003302532,"threshold_uncertainty_score":0.009207845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011407463","doi":"10.1162/1063656041774947","title":"Effective Memetic Algorithms for VLSI Design = Genetic Algorithms + Local Search + Multi-Level Clustering","year":2004,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":54,"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":"Memetic algorithm; Local search (optimization); Cluster analysis; Computer science; Very-large-scale integration; Algorithm; sort; Population; Genetic algorithm; Tabu search; Constructive; Evolutionary algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Process (computing)","authors":[{"name":"Shawki Areibi","is_ca":true},{"name":"Zhen Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05058610068939799,"gpt":0.2879042889180118,"spread":0.2373181882286139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004682914,0.0007065806,0.0006354062,0.000653378,0.0003344823,0.001117178,0.00091958,0.00113583,0.004582126],"category_scores_gemma":[0.0009868762,0.0002476106,0.0004687917,0.001268819,0.0007335728,0.001051432,0.0005438459,0.0009309984,0.001875177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005947622,"about_ca_system_score_gemma":0.0004772575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007550746,"about_ca_topic_score_gemma":0.000993547,"domain_scores_codex":[0.9997264,0.00009092251,0.00001005248,0.00004067865,0.0001161983,0.00001587662],"domain_scores_gemma":[0.9997744,0.0001090613,0.00002491537,0.00003775194,0.00004779676,0.000006089798],"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.00004255283,0.00005508163,0.0004169225,0.0005911448,0.0001133148,0.0001328533,0.0001156225,0.3849849,0.007948953,0.1271233,0.01094824,0.4675271],"study_design_scores_gemma":[0.00006401434,0.00009869632,0.0004990897,0.0001485553,0.00005481811,0.000535202,0.00005230202,0.7795419,0.007912289,0.1328207,0.07823411,0.00003830759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005123288,0.006934913,0.9648207,0.000970651,0.0002710402,0.00009690051,0.00005962681,0.0006465343,0.02107643],"genre_scores_gemma":[0.2158294,0.009299618,0.7498239,0.0006967965,0.0003851573,0.0004967304,0.000231808,0.000238373,0.02299829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004582126,"threshold_uncertainty_score":0.01532876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111427553","doi":"10.1145/1046192.1046220","title":"Design, layout and verification of an FPGA using automated tools","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Field-programmable gate array; Computer science; Process (computing); Embedded system; Electronic design automation; Architecture; Design layout record; FPGA prototype; Design flow; Automation; Computer architecture; Set (abstract data type); Integrated circuit layout; Reconfigurable computing; Computer hardware; Integrated circuit; Engineering; Operating system; Circuit extraction","authors":[{"name":"Ian Kuon","is_ca":true},{"name":"Aaron Egier","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04524113431800826,"gpt":0.2662992822355516,"spread":0.2210581479175434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110027,0.0008038109,0.000405865,0.0009493573,0.0006318932,0.001088421,0.00100125,0.0004706651,0.006278527],"category_scores_gemma":[0.003250305,0.000459017,0.0006690338,0.0004293511,0.0006019225,0.0008887804,0.0004884511,0.0007238318,0.001994507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006959119,"about_ca_system_score_gemma":0.001642691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996888,"about_ca_topic_score_gemma":0.003415006,"domain_scores_codex":[0.9985651,0.0002893298,0.0001019158,0.0001621163,0.0007764556,0.0001050363],"domain_scores_gemma":[0.9968501,0.001202937,0.0003144393,0.001060184,0.0005328819,0.00003953097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001649735,0.0001518417,0.002875531,0.000991385,0.0001356203,0.001424287,0.0005086253,0.1349517,0.2316946,0.03371121,0.01065862,0.5827316],"study_design_scores_gemma":[0.0002365765,0.001265596,0.00652455,0.000366501,0.0001441486,0.002853887,0.0003414765,0.3709144,0.4129934,0.02362526,0.1805413,0.0001928752],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01518252,0.00019841,0.9722809,0.00008741672,0.00006158317,0.0001696233,0.0002442885,0.006069575,0.00570573],"genre_scores_gemma":[0.1448153,0.0003086557,0.8490753,0.0000983982,0.00003287655,0.0002816618,0.0006523929,0.0005678075,0.004167627],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006278527,"threshold_uncertainty_score":0.02100372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138206217","doi":"10.1109/fpl.2005.1515784","title":"QPF: efficient quadratic placement for FPGAs","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Field-programmable gate array; Quadratic equation; Computer science; Electronic circuit; Process (computing); Algorithm; Chip; Mathematical optimization; Mathematics; Embedded system; Engineering; Telecommunications; Geometry; Electrical engineering","authors":[{"name":"XU Yong-hong","is_ca":true},{"name":"Mohammed Khalid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009972897050443194,"gpt":0.2240620837684011,"spread":0.214089186717958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007759838,0.0008611366,0.0006323071,0.0009206649,0.0005446523,0.0006383854,0.001399914,0.0005792091,0.01197326],"category_scores_gemma":[0.002435236,0.0005339592,0.0004827632,0.0007801987,0.0005292847,0.001155581,0.000840796,0.0006904477,0.002394526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000607706,"about_ca_system_score_gemma":0.0008340664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003288839,"about_ca_topic_score_gemma":0.004350911,"domain_scores_codex":[0.9992768,0.0001606393,0.00003924937,0.00008911914,0.0003592906,0.00007501028],"domain_scores_gemma":[0.9993252,0.0003272301,0.00007233099,0.0001162928,0.0001317173,0.0000272213],"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.0002457678,0.00007017129,0.0006273175,0.0003889598,0.0000333031,0.0002439935,0.0001480041,0.3331717,0.02191118,0.02174539,0.01469491,0.6067194],"study_design_scores_gemma":[0.00009249899,0.0002734392,0.0003061059,0.00003441761,0.000009711082,0.0003408755,0.00003992883,0.958085,0.0102411,0.01418914,0.01635831,0.00002949667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004240925,0.0001078605,0.9914389,0.00005506559,0.00002508758,0.00003483611,0.0000558944,0.002513268,0.00152818],"genre_scores_gemma":[0.1197445,0.0002313993,0.874506,0.00008454849,0.00003540811,0.0001123294,0.0002971677,0.0007323802,0.00425629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01197326,"threshold_uncertainty_score":0.04005456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967128905","doi":"10.1109/fpt.2012.6412139","title":"VersaPower: Power estimation for diverse FPGA architectures","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":48,"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; Routing (electronic design automation); Embedded system; Spice; CAD; Computer architecture; Power (physics); Gate array; Logic gate; Interconnection; Logic synthesis; Architecture; Electronic engineering; Engineering; Telecommunications","authors":[{"name":"Jeffrey Goeders","is_ca":true},{"name":"Steven J. E. Wilton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01196902767517066,"gpt":0.2378588849344367,"spread":0.2258898572592661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666317,0.001161472,0.000370789,0.001635055,0.0003140344,0.0005804828,0.0009700865,0.0003297809,0.006506772],"category_scores_gemma":[0.001750089,0.0004246481,0.0005526561,0.0009153142,0.0001770639,0.001303887,0.0003560089,0.0002948382,0.000590013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005268598,"about_ca_system_score_gemma":0.0003361191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002805792,"about_ca_topic_score_gemma":0.004605041,"domain_scores_codex":[0.9996722,0.00006048267,0.00001827161,0.00006316046,0.0001607188,0.00002524336],"domain_scores_gemma":[0.9994395,0.0002882139,0.00006620396,0.00009980106,0.00009493396,0.00001127921],"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.0002173608,0.00005769549,0.006734739,0.0002552758,0.00008729316,0.0001519195,0.00007680721,0.7735782,0.01006865,0.005158958,0.005160737,0.1984524],"study_design_scores_gemma":[0.00002183179,0.0001320852,0.001950971,0.000020667,0.00002398285,0.0001315847,0.00002280499,0.9809079,0.01029292,0.001725109,0.00474861,0.0000215731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2755252,0.001019668,0.6809772,0.0002062827,0.0000778316,0.0001811846,0.003474091,0.01461904,0.02391949],"genre_scores_gemma":[0.8719172,0.0004821734,0.119946,0.00005096641,0.00001955958,0.000163223,0.002410562,0.000763818,0.004246476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006506772,"threshold_uncertainty_score":0.02176732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213423202","doi":"10.1109/tcad.2022.3153437","title":"Analog Integrated Circuit Topology Synthesis With Deep Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":48,"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":"Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Network topology; Computer science; Reinforcement learning; Operational amplifier; Topology (electrical circuits); Circuit design; Computer engineering; Physical design; Electronic engineering; Computer architecture; Amplifier; Artificial intelligence; Engineering; Electrical engineering; CMOS; Embedded system","authors":[{"name":"Zhenxin Zhao","is_ca":true},{"name":"Lihong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02171433789641446,"gpt":0.2026833602531747,"spread":0.1809690223567602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004323785,0.0006965844,0.0004497868,0.0004442708,0.0002336194,0.0004103546,0.0008785927,0.0004869142,0.002771278],"category_scores_gemma":[0.0009311674,0.0003261051,0.0005196889,0.0003028691,0.0003941254,0.0005337071,0.0005605684,0.0007364398,0.0003825898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006423564,"about_ca_system_score_gemma":0.0007546782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001930321,"about_ca_topic_score_gemma":0.002938525,"domain_scores_codex":[0.999755,0.00004749797,0.00001414806,0.00005732409,0.00009679481,0.00002922138],"domain_scores_gemma":[0.9996419,0.0001595731,0.0000398184,0.00005838805,0.00008318566,0.00001717898],"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.00004285854,0.00004044883,0.0003391442,0.00009400726,0.0000322882,0.0000651711,0.00003643224,0.8003977,0.01246319,0.007013777,0.0008128582,0.1786621],"study_design_scores_gemma":[0.000008413676,0.000026086,0.00003357507,0.000003687646,0.000005693602,0.00001486,0.00000293942,0.9945985,0.002241363,0.002318832,0.000743277,0.000002684266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008165795,0.0001342722,0.9882128,0.00004481749,0.00002019971,0.00003593607,0.00002461869,0.0008231772,0.002538454],"genre_scores_gemma":[0.5288992,0.0001551405,0.4672507,0.0001015544,0.00002559536,0.000183723,0.0001453462,0.0001857041,0.003053026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002771278,"threshold_uncertainty_score":0.009270906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089997764","doi":"10.1109/iscas45731.2020.9181149","title":"Deep Reinforcement Learning for Analog Circuit Sizing","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Reinforcement learning; Sizing; Task (project management); Filter (signal processing); Reliability (semiconductor); Artificial intelligence; Computer engineering; Deep learning; Polynomial; Machine learning; Engineering; Mathematics","authors":[{"name":"Zhenxin Zhao","is_ca":true},{"name":"Lihong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02906838200091587,"gpt":0.2217929692400638,"spread":0.1927245872391479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007914474,0.0006078777,0.0005317967,0.000364169,0.0002243169,0.0004647911,0.0008894531,0.0005072994,0.002007936],"category_scores_gemma":[0.002172009,0.0002963976,0.0002996783,0.0002535885,0.0006153753,0.0006166903,0.000565674,0.0009161714,0.0002300206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007466975,"about_ca_system_score_gemma":0.0008965646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996831,"about_ca_topic_score_gemma":0.0031308,"domain_scores_codex":[0.9997237,0.00006330169,0.00001441714,0.00006032966,0.00009989306,0.00003830357],"domain_scores_gemma":[0.9991907,0.0004514554,0.0001062544,0.00008826525,0.0001322873,0.00003094229],"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.00005040988,0.000069282,0.0008103746,0.00006695551,0.00002918616,0.00003765303,0.00003424364,0.8664572,0.006461396,0.005494882,0.0005772567,0.1199111],"study_design_scores_gemma":[0.000004277061,0.00002150259,0.00004194153,0.000002357935,0.000003089104,0.000005682409,0.000001386511,0.9972413,0.001027821,0.001463069,0.0001858715,0.000001634757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03143751,0.0002025272,0.9649719,0.0001156864,0.00002359282,0.00003764392,0.00001799694,0.0007616876,0.002431463],"genre_scores_gemma":[0.8542147,0.00007998809,0.1438394,0.00009694753,0.00001681605,0.00007131127,0.00003700621,0.0000646999,0.001579157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002007936,"threshold_uncertainty_score":0.006717205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151614223","doi":"10.1109/fpl.2007.4380635","title":"Improving Timing-Driven FPGA Packing with Physical Information","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","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 Waterloo","funders":"","keywords":"Field-programmable gate array; Computer science; Cluster analysis; Path (computing); Placement; Critical path method; Parallel computing; Computer engineering; Embedded system; Physical design; Computer network; Artificial intelligence; Engineering; Circuit design","authors":[{"name":"Doris T. Chen","is_ca":true},{"name":"Kristofer Vorwerk","is_ca":true},{"name":"Andrew Kennings","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006557993342052479,"gpt":0.2022791075788165,"spread":0.195721114236764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005915493,0.0007468523,0.0006261843,0.001000329,0.0004820562,0.0008914809,0.001264236,0.0005926469,0.002103967],"category_scores_gemma":[0.004311944,0.0004866057,0.0003100726,0.001605376,0.0004682787,0.0017353,0.0008587463,0.0005613779,0.0006666646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006876388,"about_ca_system_score_gemma":0.000985802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009217638,"about_ca_topic_score_gemma":0.002714873,"domain_scores_codex":[0.9993321,0.000121934,0.00004984882,0.00008286507,0.0003254153,0.00008776351],"domain_scores_gemma":[0.9979393,0.0006209509,0.000423128,0.0006093357,0.0003384508,0.00006880354],"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.0005069524,0.0003183155,0.00289691,0.0002596272,0.00004473257,0.0002794149,0.0001681096,0.430595,0.1448993,0.01106981,0.003790491,0.4051713],"study_design_scores_gemma":[0.00007328774,0.0007114284,0.002425399,0.00002961055,0.00004585477,0.0004273656,0.00006354452,0.8615583,0.1232723,0.004686655,0.006656034,0.00005020634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1329991,0.0006623454,0.85655,0.0002163764,0.00008530754,0.00008466846,0.00005656505,0.003819778,0.005525881],"genre_scores_gemma":[0.5834259,0.0002515291,0.4133773,0.0001258134,0.00005532074,0.00004666414,0.0001662125,0.0002872065,0.002263932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002103967,"threshold_uncertainty_score":0.007038414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108099581","doi":"10.1109/ipdps.2008.4536237","title":"A new diffusion-based multilevel algorithm for computing graph partitions of very high quality","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Partition (number theory); Graph; Heuristic; Algorithm; Vertex (graph theory); Theoretical computer science; Parallel computing; Mathematics; Combinatorics; Artificial intelligence","authors":[{"name":"Henning Meyerhenke","is_ca":false},{"name":"Burkhard Monien","is_ca":false},{"name":"Thomas Sauerwald","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02703650070891606,"gpt":0.2740699131351771,"spread":0.2470334124262611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004103618,0.0008922678,0.0009974726,0.001638816,0.0007682443,0.001102831,0.001914809,0.001161776,0.005492136],"category_scores_gemma":[0.001608787,0.0005833591,0.0009067294,0.00136337,0.0006112532,0.00149705,0.002057438,0.001524894,0.001300785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001511151,"about_ca_system_score_gemma":0.001416619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009084282,"about_ca_topic_score_gemma":0.01914002,"domain_scores_codex":[0.999587,0.00004502372,0.00001989567,0.00007885272,0.0002208503,0.00004843035],"domain_scores_gemma":[0.9996105,0.000111244,0.00004045953,0.0000709919,0.000124252,0.00004249741],"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.0003680059,0.0001297662,0.001004214,0.0004318414,0.0001799319,0.0001565775,0.0002610931,0.2944503,0.05389294,0.05365765,0.02171265,0.573755],"study_design_scores_gemma":[0.00005901363,0.00005267349,0.0001777332,0.0000165176,0.00001658226,0.00005887563,0.00002036535,0.9819483,0.003618882,0.007143358,0.006872573,0.00001520003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005649091,0.0002204459,0.9900513,0.0001934716,0.00005719559,0.00006742476,0.000122818,0.001382764,0.002255441],"genre_scores_gemma":[0.04579958,0.0001381522,0.9502555,0.0001285392,0.00002838517,0.0001690921,0.0004187662,0.0002755856,0.002786391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009084282,"threshold_uncertainty_score":0.01837295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989477191","doi":"10.1145/1344671.1344694","title":"Modeling routing demand for early-stage FPGA architecture development","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer architecture; Computer science; Benchmark (surveying); Architecture; Field-programmable gate array; Routing (electronic design automation); Simple (philosophy); Embedded system; Space-based architecture; Interconnection; Reference architecture; Computer network; Software architecture; Operating system; Software","authors":[{"name":"Wei Mark Fang","is_ca":true},{"name":"Jonathan Rose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02588892912811181,"gpt":0.2199167076937532,"spread":0.1940277785656414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007155355,0.0006517699,0.0003861777,0.000853005,0.0004666621,0.001518766,0.001614504,0.001364906,0.0114798],"category_scores_gemma":[0.005694405,0.0007639345,0.0004434695,0.000846383,0.0004553166,0.002930309,0.0005803209,0.001213876,0.00169197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002653143,"about_ca_system_score_gemma":0.00116046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00920352,"about_ca_topic_score_gemma":0.0120279,"domain_scores_codex":[0.999527,0.0001097493,0.00002244559,0.00008649374,0.0001355173,0.0001188707],"domain_scores_gemma":[0.9975763,0.001451065,0.0002034306,0.0001907147,0.0004421572,0.0001363431],"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.0001236547,0.00007615808,0.003234164,0.00006621615,0.00000788849,0.0001608814,0.00009687249,0.9553514,0.001928403,0.02830929,0.001558222,0.00908687],"study_design_scores_gemma":[0.000006458308,0.00002821538,0.0005326946,0.000005731214,0.000004850196,0.00003261167,0.00003960131,0.9919538,0.0006375323,0.005478846,0.001272833,0.000006755571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7149801,0.0005264828,0.1749572,0.001717576,0.00007669759,0.0001924421,0.002706715,0.0006944587,0.1041484],"genre_scores_gemma":[0.9638528,0.000364087,0.01959683,0.00008424416,0.00001830937,0.0001144236,0.0008395903,0.0001801841,0.01494967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0114798,"threshold_uncertainty_score":0.03840375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147506855","doi":"10.1109/tvlsi.2004.827562","title":"Design of FPGA interconnect for multilevel metallization","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Interconnection; Routing (electronic design automation); Computer science; Exploit; Gate array; Topology (electrical circuits); Embedded system; Arity; Engineering; Electrical engineering; Computer network","authors":[{"name":"André DeHon","is_ca":false},{"name":"Raphael Rubin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02608449495973388,"gpt":0.2430953538035635,"spread":0.2170108588438296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006889644,0.000165006,0.000121016,0.0002304283,0.0002074447,0.0003484044,0.0003638462,0.000176348,0.001931545],"category_scores_gemma":[0.0002175322,0.00009232547,0.0001160034,0.0001993034,0.0001129432,0.0002235414,0.0001771472,0.0001594878,0.0004005922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000445176,"about_ca_system_score_gemma":0.0002888851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008486083,"about_ca_topic_score_gemma":0.003456668,"domain_scores_codex":[0.9999304,0.00001200203,0.000003796967,0.00001248877,0.00002247241,0.00001877753],"domain_scores_gemma":[0.9999304,0.00001107457,0.00001470232,0.00001425683,0.00002325349,0.000006424529],"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.000293547,0.00008157284,0.005713023,0.0005038675,0.000101296,0.0008317446,0.0002525528,0.2470516,0.3385097,0.05696657,0.01456243,0.3351322],"study_design_scores_gemma":[0.000103068,0.0009319584,0.004443416,0.00008663088,0.00008296593,0.000819417,0.0001827226,0.7832662,0.1310716,0.01169132,0.06727706,0.00004361482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4344103,0.001147483,0.4975041,0.0007261955,0.000170035,0.0001429619,0.00031917,0.002593549,0.06298624],"genre_scores_gemma":[0.8815921,0.000273656,0.1134695,0.00008851833,0.00002229277,0.00006299552,0.0001379544,0.00004676985,0.004306211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001931545,"threshold_uncertainty_score":0.00646168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023788229","doi":"10.1145/1723112.1723140","title":"Towards scalable placement for FPGAs","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Placement; Simulated annealing; Speedup; Application-specific integrated circuit; Parallel computing; Context (archaeology); Computer architecture; Matching (statistics); Embedded system; Physical design; Algorithm; Circuit design; Database","authors":[{"name":"Huimin Bian","is_ca":true},{"name":"Andrew C. Ling","is_ca":true},{"name":"Alexander Choong","is_ca":true},{"name":"Jianwen Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01024213100546707,"gpt":0.2300675408683493,"spread":0.2198254098628822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006681892,0.0006839575,0.0006260817,0.0006246479,0.0003816392,0.0009298468,0.0009131892,0.0008091778,0.004815037],"category_scores_gemma":[0.001718053,0.0005328709,0.0005954335,0.0009071126,0.0005624876,0.001153892,0.001031374,0.0009262224,0.001080232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007952114,"about_ca_system_score_gemma":0.001098642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002435816,"about_ca_topic_score_gemma":0.004878975,"domain_scores_codex":[0.9994847,0.0001427423,0.00002997278,0.00006822629,0.0002065751,0.00006774398],"domain_scores_gemma":[0.9995298,0.0001585077,0.00005196824,0.000147849,0.00008478353,0.00002703884],"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.000106011,0.00003897471,0.0004757865,0.0002409061,0.00004141701,0.0001444617,0.00007981068,0.7942362,0.01811166,0.03689932,0.005801841,0.1438235],"study_design_scores_gemma":[0.0000445679,0.00009631368,0.0002412224,0.00002988423,0.00001253992,0.00008896819,0.0000642564,0.9510404,0.006924133,0.02895758,0.01248949,0.00001066444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03546319,0.0006104719,0.9528929,0.0004893823,0.00009167918,0.00008811817,0.000133606,0.003159525,0.007071216],"genre_scores_gemma":[0.2270685,0.0007019377,0.7674608,0.0001308805,0.00005224271,0.0001113694,0.000277534,0.0002742346,0.003922429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004815037,"threshold_uncertainty_score":0.01610792,"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","authors":[{"name":"Yao‐Wen Chang","is_ca":false},{"name":"Kai Zhu","is_ca":false},{"name":"Martin D. F. Wong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808069,0.0002352574,0.00018014,0.0002239145,0.000217979,0.0002940138,0.0005865325,0.0002542567,0.001535775],"category_scores_gemma":[0.0003877734,0.0001088166,0.0002093954,0.0001969744,0.0001731078,0.0004717344,0.0002281157,0.0002611126,0.0002671813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002519337,"about_ca_system_score_gemma":0.0003253605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000501949,"about_ca_topic_score_gemma":0.001430117,"domain_scores_codex":[0.9998273,0.00004218051,0.00001239861,0.00002830869,0.00006915884,0.00002071884],"domain_scores_gemma":[0.9998165,0.00005352325,0.00004025448,0.0000487371,0.00003155178,0.000009450064],"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.0002436467,0.0001017901,0.001335246,0.0002614293,0.00005571297,0.0006225026,0.00008093892,0.4389509,0.1837164,0.06997307,0.003408661,0.3012498],"study_design_scores_gemma":[0.00002133585,0.000225037,0.0002597883,0.000008499539,0.00002108422,0.0002952252,0.000015778,0.9499542,0.03604026,0.007331014,0.00581325,0.00001459619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05021618,0.0001773641,0.9455443,0.00007197259,0.00005017888,0.00003052968,0.00003006078,0.0007026329,0.003176814],"genre_scores_gemma":[0.5393417,0.0002812097,0.4557886,0.0001184111,0.00002900288,0.00003844277,0.0001299151,0.00008807462,0.004184588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001535775,"threshold_uncertainty_score":0.005137682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015033143","doi":"10.1145/1118299.1118499","title":"TAPHS","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","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":"Queen's University","funders":"","keywords":"Floorplan; Physical design; Computer science; Thermal; Chip; Electronic engineering; Integrated circuit design; Voltage; Power (physics); Circuit design; Reliability engineering; Embedded system; Engineering; Electrical engineering","authors":[{"name":"Zhenyu Gu","is_ca":false},{"name":"Yonghong Yang","is_ca":true},{"name":"Jia Wang","is_ca":false},{"name":"Robert P. Dick","is_ca":false},{"name":"Li Shang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.002018548958097644,"gpt":0.1438051885981824,"spread":0.1417866396400848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007091616,0.00106233,0.0007186531,0.001936881,0.001445896,0.003725783,0.001442383,0.002033325,0.6865618],"category_scores_gemma":[0.002225518,0.0004592308,0.0005168631,0.001522741,0.0005728413,0.00285015,0.003191154,0.001353414,0.4828779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041141,"about_ca_system_score_gemma":0.001580372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476775,"about_ca_topic_score_gemma":0.001634247,"domain_scores_codex":[0.9989954,0.000114472,0.00006709047,0.0002660973,0.0004194755,0.0001375435],"domain_scores_gemma":[0.998494,0.0002137293,0.00007163631,0.0003267784,0.0005774038,0.0003164322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003243014,0.0001632122,0.001543113,0.0005883853,0.00002461015,0.0006089654,0.0002798076,0.0009439224,0.006008697,0.03354354,0.3858946,0.5700769],"study_design_scores_gemma":[0.00002119151,0.00004734081,0.0005729818,0.00009278947,0.000007464113,0.0003907779,0.00009097931,0.0007874148,0.001365625,0.004273896,0.992337,0.00001254243],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005245382,0.003910723,0.02555145,0.003878715,0.003826007,0.000303558,0.00620869,0.008952374,0.9421231],"genre_scores_gemma":[0.0351578,0.003252278,0.01006023,0.001456326,0.0007009518,0.0002016955,0.006536322,0.001822055,0.9408123],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3134382,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}