{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004436456,0.000228378,0.0002665369,0.00009492645,0.0002649678,0.00007927288,0.00008768544,0.00016533,0.000003692598],"category_scores_gemma":[0.000008536133,0.0001602757,0.00007365141,0.0001310869,0.00007100977,0.0002062305,0.000001268916,0.0003049282,0.00001071094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001169603,"about_ca_system_score_gemma":0.000009163139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004184917,"about_ca_topic_score_gemma":0.000201096,"domain_scores_codex":[0.9989735,0.0001012393,0.0003209293,0.0001997548,0.0001880616,0.0002164471],"domain_scores_gemma":[0.9993083,0.0002723569,0.00005392138,0.0002519274,0.00004940851,0.00006403861],"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.002809599,0.0006852028,0.002699005,0.004624898,0.0009759672,0.00002393651,0.009603751,0.2574735,0.404028,0.0006478162,0.002380759,0.3140476],"study_design_scores_gemma":[0.001468877,0.00109782,0.001236086,0.0006231469,0.00008238578,0.00007234038,0.0002705002,0.07715348,0.9172012,0.00002866854,0.0004184428,0.0003470868],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.616466,0.000178067,0.3819433,0.00002549095,0.0004823825,0.0004678368,0.00001791062,0.0001737772,0.0002452389],"genre_scores_gemma":[0.9991997,0.000339894,0.0001172456,0.00001993033,0.00004174826,0.000104121,0.000002114485,0.00002935458,0.0001459042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5131732,"threshold_uncertainty_score":0.6535851,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001727078,0.0001493441,0.0002204168,0.0004536507,0.0001322594,0.00002965606,0.0002030405,0.0003315021,0.00005000022],"category_scores_gemma":[0.00001499023,0.0001426099,0.00003308242,0.0002907206,0.0000702644,0.00007400882,0.000001079243,0.0003103186,0.00008060407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168499,"about_ca_system_score_gemma":0.000004287764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000114676,"about_ca_topic_score_gemma":0.000004772993,"domain_scores_codex":[0.9993156,0.00002465767,0.0001995924,0.0001828525,0.00005726251,0.0002200934],"domain_scores_gemma":[0.9993563,0.00007394087,0.0000203836,0.0004793888,0.00002304967,0.00004695755],"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.00001439256,0.00006874966,0.0002820407,0.0003120829,0.0001983371,0.000008479079,0.000110543,0.004666308,0.02856763,0.02711511,0.002358809,0.9362975],"study_design_scores_gemma":[0.001915451,0.001343444,0.0003337314,0.0007017879,0.0001680161,0.0009789389,0.001162349,0.1088449,0.4798623,0.06038823,0.3421101,0.002190828],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05421798,0.001892951,0.8906686,0.0006301847,0.001050373,0.0005089177,0.00001757774,0.006704004,0.04430946],"genre_scores_gemma":[0.9980326,0.0002903655,0.0006097318,0.00002764166,0.0000211753,0.0001377155,0.000001282914,0.00002561898,0.0008538351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9438146,"threshold_uncertainty_score":0.5815462,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006412454,0.0001440863,0.0002173469,0.0002343,0.0001023491,0.00002743022,0.0002064738,0.0002880804,0.00007996885],"category_scores_gemma":[0.00001273083,0.0001408609,0.00003400012,0.000386439,0.00005793764,0.00007970641,0.000001300852,0.0003469572,0.0000967754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000166414,"about_ca_system_score_gemma":0.000006488265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000059984,"about_ca_topic_score_gemma":0.000001482918,"domain_scores_codex":[0.9993493,0.00001463148,0.0001962939,0.0001908531,0.00005560389,0.0001933492],"domain_scores_gemma":[0.9995599,0.00003888609,0.00001823093,0.0002898506,0.00001971162,0.00007336726],"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.00006323887,0.0001066876,0.0004956776,0.000983078,0.0005884796,0.00009189886,0.0007807845,0.01134523,0.1216425,0.01643923,0.01075937,0.8367039],"study_design_scores_gemma":[0.001858482,0.001561653,0.0001340717,0.0004331431,0.0001754144,0.0006082713,0.002956776,0.09137698,0.6512625,0.0117706,0.2358291,0.002033],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06466382,0.006737002,0.8749754,0.006157776,0.0009886749,0.001092343,0.00007121055,0.01356607,0.03174773],"genre_scores_gemma":[0.9985615,0.0004600487,0.0004854608,0.00009798873,0.00002288574,0.0001080078,0.000001386975,0.00002516547,0.0002375286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9338977,"threshold_uncertainty_score":0.574414,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003149538,0.00006053099,0.00005931261,0.00002067558,0.00001908726,0.00001125105,0.00005547351,0.00003271479,0.001859443],"category_scores_gemma":[0.000001476065,0.00005526243,0.00002949198,0.00002733362,0.00000461493,0.00003635464,0.000002764466,0.00002644637,0.0001055369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001859184,"about_ca_system_score_gemma":0.000002079999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002038472,"about_ca_topic_score_gemma":0.000001571715,"domain_scores_codex":[0.9997014,0.000001901805,0.00007394951,0.00006180069,0.00003856125,0.0001223172],"domain_scores_gemma":[0.99986,0.00001629118,0.000002725839,0.00008671283,0.000006803182,0.00002738969],"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.00002244878,0.00005124892,0.00006876425,0.0001284896,0.00007868258,0.000003992607,0.0004407842,0.04939502,0.01739954,0.002992177,0.5083338,0.421085],"study_design_scores_gemma":[0.0004740646,0.0001335625,0.00005766222,0.00002684814,0.00001796781,0.000004574836,0.00003097516,0.3063343,0.1540237,0.001022512,0.5375215,0.0003522558],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02424883,0.00009637981,0.6233036,0.00008855998,0.00008710975,0.0005482415,0.000009476274,0.002370942,0.3492468],"genre_scores_gemma":[0.9299089,0.0000807832,0.05518069,0.0001629774,0.0001029775,0.0001680041,0.00001177752,0.00003739137,0.01434654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.90566,"threshold_uncertainty_score":0.999053,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003611766,0.00005742691,0.00006035362,0.00007420057,0.000008965036,0.0000141432,0.00002917566,0.00003603578,0.0001601379],"category_scores_gemma":[0.000005205162,0.00005326625,0.0000121013,0.00004903415,0.00001293359,0.0001166082,0.00001041392,0.00005632877,0.00001406809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000345751,"about_ca_system_score_gemma":0.000001429842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001681894,"about_ca_topic_score_gemma":0.0001666735,"domain_scores_codex":[0.9997332,0.000005274013,0.00007526871,0.00006751918,0.00003411118,0.00008463593],"domain_scores_gemma":[0.9999032,0.00002307586,0.000003346897,0.00004425015,0.000005111671,0.00002102998],"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.000007407454,0.00006821834,0.005121606,0.00003046711,0.00002551855,0.000009338426,0.0005980478,0.001113551,0.1549732,0.001711128,0.01241494,0.8239266],"study_design_scores_gemma":[0.0006208016,0.0001210466,0.0165537,0.00009563739,0.000008870604,0.00006290938,0.00009871532,0.05798471,0.803653,0.001750775,0.118445,0.0006048481],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8288995,0.0009553229,0.04027796,0.0002302098,0.0001274451,0.000139971,0.000002372964,0.001490907,0.1278763],"genre_scores_gemma":[0.9940059,0.00006639981,0.005503117,0.00005842482,0.00005483536,0.000006709305,7.559052e-7,0.000009377794,0.0002944641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8233217,"threshold_uncertainty_score":0.2172135,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000435294,0.00005185704,0.00004918806,0.00002824233,0.00001189517,0.00001265045,0.00003257786,0.00002928319,0.0003169247],"category_scores_gemma":[0.000005937506,0.00004329966,0.0000189119,0.00005461034,0.000004629574,0.00004846239,0.000002158578,0.00003795332,0.00005074466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000919786,"about_ca_system_score_gemma":0.000001696396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001957482,"about_ca_topic_score_gemma":0.000004629467,"domain_scores_codex":[0.9997591,0.000005485001,0.00005568968,0.0000443697,0.0000380919,0.00009726128],"domain_scores_gemma":[0.9998739,0.000008845458,0.000002674524,0.00008666836,0.000005784673,0.00002213519],"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.000002200045,0.00005862088,0.007506283,0.00008531634,0.0001085834,0.0000420097,0.0005345219,0.002620682,0.3825709,0.2588746,0.1840094,0.1635869],"study_design_scores_gemma":[0.0001877774,0.00003510897,0.0007592121,0.00001711013,0.000008240558,0.00001406685,0.00007951547,0.004104986,0.755017,0.004540285,0.2348773,0.000359382],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02146567,0.0002871007,0.2194748,0.00001079378,0.0001051585,0.00006265509,5.004215e-7,0.0017651,0.7568282],"genre_scores_gemma":[0.9920401,0.000022953,0.006466558,0.00003349884,0.00001691628,0.000005483971,4.163603e-7,0.00001369948,0.001400406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9705744,"threshold_uncertainty_score":0.3470104,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441055,0.0001532386,0.0002273548,0.00005942488,0.00005727411,0.0001115624,0.00004991549,0.00009708544,0.000006950193],"category_scores_gemma":[0.00001399374,0.0001291928,0.00002340526,0.0001034444,0.00003348688,0.00006281229,0.00001952,0.00013016,0.000007927736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001367112,"about_ca_system_score_gemma":0.00001181919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002022231,"about_ca_topic_score_gemma":0.00000488561,"domain_scores_codex":[0.9992262,0.00003527014,0.0002079758,0.0002083527,0.0001243818,0.0001978021],"domain_scores_gemma":[0.9996157,0.00003118527,0.0000270651,0.0001810479,0.00004271512,0.0001022316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004070387,0.00005338854,0.002953096,0.002474265,0.0001139077,0.0003597046,0.0008572116,0.001355761,0.5781508,0.002081599,0.006079667,0.4055165],"study_design_scores_gemma":[0.002755191,0.0005036798,0.03644855,0.00355122,0.000188323,0.005589879,0.0003061128,0.06439535,0.234219,0.001937882,0.6472826,0.002822223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7394922,0.07114468,0.1334575,0.0001966038,0.002133702,0.001265444,0.00006712366,0.002416207,0.04982655],"genre_scores_gemma":[0.998244,0.0005231958,0.000184412,0.00001778352,0.000186056,0.00003790695,0.000006514831,0.00003057913,0.0007694887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6412029,"threshold_uncertainty_score":0.5268331,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004455288,0.00002800707,0.00003407963,0.00002491664,0.000009497179,0.000004582857,0.00001587901,0.00001646905,0.00006710408],"category_scores_gemma":[0.00000167437,0.00002694696,0.00000515867,0.00002451487,0.0000068996,0.00004705871,0.000003213983,0.00001864477,0.000004762614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007337231,"about_ca_system_score_gemma":0.000001083899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001804247,"about_ca_topic_score_gemma":0.000001494073,"domain_scores_codex":[0.9998257,0.000002393629,0.0000697639,0.0000313624,0.00002907055,0.00004176531],"domain_scores_gemma":[0.9999237,0.000005492399,0.000007044578,0.00004367523,0.000007103267,0.00001295318],"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.00001218752,0.00008255281,0.009777831,0.0002655066,0.00008587725,0.000001523007,0.002950191,0.06312608,0.605272,0.05824671,0.05094843,0.2092311],"study_design_scores_gemma":[0.0002134608,0.000050525,0.004233479,0.00004194764,0.00001126165,0.000004409307,0.0001584912,0.1410869,0.8358629,0.0003596937,0.01781359,0.0001633452],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4656536,0.0005728325,0.4289759,0.00009776292,0.00003373108,0.0001535359,0.000002621438,0.0007794158,0.1037306],"genre_scores_gemma":[0.9865119,0.0000499398,0.01325299,0.00001137003,0.00001606023,0.000005948636,0.000002628759,0.00000394645,0.0001451919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5208583,"threshold_uncertainty_score":0.1098865,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433162,0.0001717765,0.0001740428,0.0001426107,0.0004882486,0.0001240036,0.0001659552,0.0000853161,0.00001854837],"category_scores_gemma":[0.00001247878,0.0001532319,0.00008698393,0.000127473,0.00002708771,0.0004683333,0.00002208854,0.0006620475,0.00002151511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513339,"about_ca_system_score_gemma":0.0000172539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003205534,"about_ca_topic_score_gemma":3.114904e-7,"domain_scores_codex":[0.9989081,0.00001329906,0.0004287314,0.00008504619,0.000239166,0.0003256373],"domain_scores_gemma":[0.9995917,0.00006920268,0.00009347664,0.00008618681,0.00004049051,0.0001189094],"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.00001757093,0.00003730164,0.001027683,0.00004412722,0.0000866449,0.0001378351,0.001893515,0.3203484,0.01210221,0.0002724077,0.01963478,0.6443975],"study_design_scores_gemma":[0.0009531308,0.0003167785,0.001052844,0.0004296831,0.00001105728,0.003466548,0.0002707487,0.9306058,0.05684577,0.0005042321,0.004814328,0.0007291266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3886323,0.0001035518,0.6046931,0.00001974062,0.0002489967,0.00005052701,7.965825e-7,0.0003863407,0.005864686],"genre_scores_gemma":[0.9913801,0.00006204363,0.007946875,0.0002997747,0.0002674339,7.588507e-7,0.000004781108,0.00002909132,0.000009150888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6436684,"threshold_uncertainty_score":0.6248617,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660426,0.0002378476,0.0002433159,0.0005031791,0.0008155538,0.0007559576,0.0004365449,0.00009307417,0.00003784534],"category_scores_gemma":[0.00008109077,0.0002191888,0.0001740687,0.0007109793,0.00007994679,0.0002684142,0.00007598732,0.0006403809,0.000105929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003286074,"about_ca_system_score_gemma":0.00007803552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004712422,"about_ca_topic_score_gemma":0.000004040577,"domain_scores_codex":[0.9979899,0.00003434648,0.0005274065,0.0003037089,0.0005833955,0.0005612358],"domain_scores_gemma":[0.9991723,0.00008348253,0.0001427401,0.0002583978,0.0001307692,0.0002123457],"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.00003835795,0.0002927952,0.000940425,0.0003092055,0.0002209641,0.001005015,0.01334503,0.4022429,0.1819001,0.004212248,0.01327511,0.3822178],"study_design_scores_gemma":[0.004893904,0.001129139,0.003089186,0.005704013,0.0002149072,0.007980947,0.003268594,0.4212023,0.3741685,0.07890786,0.09487782,0.004562846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9315506,0.001015194,0.06022849,0.0001235788,0.002732255,0.0001537074,0.000002227171,0.0006868243,0.003507119],"genre_scores_gemma":[0.9810358,0.0000265934,0.01816037,0.00004687679,0.0006156671,0.000001012337,0.000002729909,0.00004090978,0.00006998938],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.377655,"threshold_uncertainty_score":0.893826,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002496999,0.00006006414,0.00005506292,0.00003990403,0.00002312043,0.00003037019,0.00004938633,0.00003862176,0.0008496076],"category_scores_gemma":[0.000003153703,0.00005314003,0.0000251904,0.00006636637,0.00001042212,0.0001378848,0.000005907272,0.00005263961,0.0004862584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007832078,"about_ca_system_score_gemma":0.000001139904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004383759,"about_ca_topic_score_gemma":0.000005814992,"domain_scores_codex":[0.999697,0.000003885198,0.00007898263,0.00005669855,0.00003821666,0.0001252014],"domain_scores_gemma":[0.9998406,0.000008271905,0.000004336293,0.00009317431,0.00001491488,0.00003869562],"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":[9.743923e-7,0.00008293591,0.006366633,0.0000896442,0.00008868612,0.000007597047,0.0005205144,0.001737573,0.6961716,0.006125583,0.2133995,0.07540882],"study_design_scores_gemma":[0.0006089725,0.00006520934,0.02886036,0.00005746777,0.00001714195,0.00001468774,0.0002175413,0.2073717,0.74027,0.01390317,0.007761291,0.00085244],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06797847,0.0002028924,0.8765237,0.00007105144,0.0001350853,0.0002854077,0.000001144215,0.004378212,0.05042403],"genre_scores_gemma":[0.9564337,0.00002376929,0.0428906,0.00006020254,0.00002194375,0.0000793596,0.000002496333,0.00001413044,0.0004737711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8884553,"threshold_uncertainty_score":0.9302608,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111719,0.0001526707,0.0001584261,0.00005212376,0.00005921646,0.00005210841,0.0001353283,0.00009856714,0.0002950896],"category_scores_gemma":[0.00005274629,0.0001343578,0.00004870696,0.00009768928,0.00002348645,0.0000643839,0.00002616136,0.00008622979,0.00000757315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002721412,"about_ca_system_score_gemma":0.000002274146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005514697,"about_ca_topic_score_gemma":0.000004470935,"domain_scores_codex":[0.9992867,0.000004532804,0.000170384,0.0002023444,0.00007507539,0.0002609797],"domain_scores_gemma":[0.9995763,0.0001283778,0.00001572221,0.0001891548,0.00002389352,0.00006654926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002478337,0.002093758,0.0252925,0.005361964,0.0005166671,0.0001594924,0.005274483,0.1371414,0.1472278,0.01896267,0.3905674,0.267154],"study_design_scores_gemma":[0.0004720561,0.0001366161,0.00005739811,0.00003831992,0.00001350796,0.000006191924,0.00001325342,0.9793212,0.01655589,0.001310503,0.001819552,0.0002555564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09628887,0.0005870793,0.8634665,0.0002863886,0.0001152872,0.0007343623,0.000008963113,0.002293369,0.0362192],"genre_scores_gemma":[0.9846057,0.00003883032,0.0140738,0.0003552676,0.00004051872,0.00007809717,0.00000173751,0.00002800142,0.0007780453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8883168,"threshold_uncertainty_score":0.547895,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009059413,0.00007757781,0.00009652853,0.00008266863,0.00001604797,0.00001870061,0.00006486808,0.0001026505,0.0009335221],"category_scores_gemma":[0.00000731932,0.00007089842,0.00001086466,0.00008260859,0.000009497797,0.0001537112,0.0000239215,0.0002007435,0.00003673562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001994448,"about_ca_system_score_gemma":0.000002263223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008111302,"about_ca_topic_score_gemma":0.00002748587,"domain_scores_codex":[0.9995386,0.000006937446,0.0001246415,0.00008474801,0.00004795242,0.0001971071],"domain_scores_gemma":[0.9998432,0.00002350077,0.000006219756,0.00007423238,0.000008674097,0.00004412579],"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.000004535926,0.00005920154,0.0660862,0.0003810252,0.00005568461,0.00002653248,0.002639774,0.0003273088,0.4652727,0.02794531,0.3415295,0.09567229],"study_design_scores_gemma":[0.001768867,0.0001221156,0.1930993,0.0002494678,0.000019962,0.00004265759,0.001070105,0.5756376,0.04499292,0.0201634,0.1610929,0.001740772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8029617,0.002926475,0.03225457,0.0002958369,0.0001473168,0.0007006421,0.000006865434,0.001321207,0.1593854],"genre_scores_gemma":[0.9972026,0.0002772258,0.002165532,0.0001118453,0.00002811874,0.0000235048,0.000006704609,0.00001221029,0.0001723047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5753103,"threshold_uncertainty_score":0.9999797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003546156,0.00008674042,0.00008652716,0.000054778,0.00002637382,0.00001402954,0.0000599231,0.00007083566,0.0005180666],"category_scores_gemma":[0.00001364293,0.0000734792,0.0000477917,0.00006288439,0.00000915575,0.00004073098,0.000005205211,0.0000533885,0.0001086613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159922,"about_ca_system_score_gemma":6.332587e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001059102,"about_ca_topic_score_gemma":0.00000155181,"domain_scores_codex":[0.99963,0.000005200384,0.00009410489,0.00008527954,0.00004772461,0.0001376439],"domain_scores_gemma":[0.9997977,0.00004145348,0.000008036888,0.0001089488,0.00001471968,0.00002914417],"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.00001404563,0.00006930353,0.00004809851,0.0001519553,0.00006498566,0.00000376274,0.0007957835,0.06625947,0.4111846,0.001467192,0.1924461,0.3274947],"study_design_scores_gemma":[0.0002992649,0.00006957955,0.00007053331,0.00000994455,0.000009059931,0.000005053983,0.000004609187,0.9181111,0.04694211,0.003758388,0.03050002,0.0002203068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005910314,0.0002273678,0.9622959,0.0001636573,0.00006708251,0.0005773907,0.00001019199,0.002729785,0.02801828],"genre_scores_gemma":[0.933912,0.00001537565,0.06333153,0.0001189829,0.00009606595,0.00007152335,0.00001331024,0.00003026517,0.002410911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9280017,"threshold_uncertainty_score":0.5672466,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002200666,0.0002595807,0.0004411981,0.0009223826,0.00006951434,0.00005264114,0.0001388162,0.0002948918,0.000002639026],"category_scores_gemma":[0.000004990964,0.0002539835,0.00006568387,0.0006295838,0.00005358439,0.00007495539,4.79944e-7,0.000211661,9.682038e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001169233,"about_ca_system_score_gemma":0.00004702307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008566275,"about_ca_topic_score_gemma":0.00001129225,"domain_scores_codex":[0.9986364,0.00006685512,0.0006484041,0.0002638648,0.0001232064,0.0002612861],"domain_scores_gemma":[0.9992388,0.0002374092,0.00009489035,0.0002111691,0.0001767937,0.00004091765],"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.00001588314,0.0001242591,0.0000318819,0.0002757687,0.00004145557,0.000007431781,0.00005242815,0.9370815,0.02816165,0.0002636754,0.0005731602,0.03337087],"study_design_scores_gemma":[0.0006836384,0.0002803442,0.00002088107,0.0005197821,0.00002144198,0.00001724258,0.00006647057,0.9351156,0.06259564,0.0002343652,0.0001967981,0.0002477846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005772795,0.000260673,0.991865,0.00001412694,0.0004954495,0.0009083319,0.00007727401,0.0005408596,0.00006542492],"genre_scores_gemma":[0.987101,0.00003747429,0.01251374,0.00001088496,0.00003503163,0.0002153451,0.00001702066,0.00004456186,0.00002500587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9813281,"threshold_uncertainty_score":0.9999912,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001156525,0.000096353,0.00009664962,0.00003736543,0.00002732499,0.0000541599,0.0002800036,0.00006426763,0.0006242416],"category_scores_gemma":[0.000003958353,0.00007826495,0.00001799743,0.00006497683,0.000008918407,0.0003580511,0.00005710166,0.000107551,0.00008355422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001914166,"about_ca_system_score_gemma":0.000003486794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000334632,"about_ca_topic_score_gemma":0.00001212959,"domain_scores_codex":[0.9995363,0.0000129911,0.00008051866,0.00007387683,0.0000627114,0.0002335903],"domain_scores_gemma":[0.9996325,0.00001134807,0.000006238,0.0002312678,0.000006961164,0.0001116714],"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.00002070071,0.0002906569,0.003213792,0.0001054567,0.000114989,0.00001083204,0.002935275,0.001218044,0.1620544,0.02770214,0.2501677,0.552166],"study_design_scores_gemma":[0.0005091645,0.0002492694,0.01124134,0.00003342295,0.00002808873,0.00007157472,0.0001292789,0.002723193,0.3809232,0.006294025,0.5967329,0.001064633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0539709,0.0004834877,0.2619957,0.00009011885,0.0003862849,0.0005275045,0.000009420964,0.003135833,0.6794007],"genre_scores_gemma":[0.9817455,0.00001087047,0.01687922,0.0001484251,0.0001658306,0.00002419268,0.000006222892,0.00003032874,0.0009893526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9277747,"threshold_uncertainty_score":0.6835008,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002996408,0.0002446141,0.0001748653,0.0001775759,0.00007582938,0.0001917532,0.0004553256,0.0001045827,0.0005545891],"category_scores_gemma":[0.00003578176,0.0001922491,0.00008149338,0.0001045242,0.00003267115,0.0001706068,0.00002446007,0.0004005331,0.000296946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001444165,"about_ca_system_score_gemma":0.0000308702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006658226,"about_ca_topic_score_gemma":5.732785e-7,"domain_scores_codex":[0.9987544,0.0001308526,0.0002787629,0.0002654412,0.0003549062,0.000215655],"domain_scores_gemma":[0.999014,0.0004401541,0.00005759894,0.0002740842,0.0001468085,0.00006737442],"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.0001117633,0.0002814434,0.0002838653,0.00002819277,0.0008372982,0.00009236953,0.001031419,0.03830557,0.004135748,0.5866717,0.1378013,0.2304193],"study_design_scores_gemma":[0.0009354964,0.001226628,0.0007962607,0.0005248375,0.00003324959,0.00005993009,0.0001314927,0.776378,0.1174288,0.08582254,0.01549725,0.001165544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003350201,0.000007435939,0.9725028,0.000392107,0.001197836,0.0002755516,0.00001844126,0.0004625872,0.02179309],"genre_scores_gemma":[0.9939247,0.00001905193,0.005186769,0.0004367154,0.0001866898,0.00005296064,0.00001454904,0.0000330529,0.0001454964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9905745,"threshold_uncertainty_score":0.783969,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001396408,0.0001532123,0.0002210113,0.0004554969,0.00008978477,0.00003189329,0.0002150453,0.0003340421,0.00003144263],"category_scores_gemma":[0.00001509073,0.00014814,0.00003000099,0.0003215007,0.00006971294,0.0001024126,0.000001646955,0.0003065861,0.0001063473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005470674,"about_ca_system_score_gemma":0.00001452809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001510356,"about_ca_topic_score_gemma":0.000007287936,"domain_scores_codex":[0.9992979,0.00001941672,0.0002033426,0.0001803088,0.00007732939,0.0002217402],"domain_scores_gemma":[0.9993794,0.00003681384,0.0000228028,0.0004307697,0.00004440894,0.00008581849],"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.0001186033,0.0004139734,0.00193704,0.0008981314,0.001229506,0.000215925,0.001701554,0.05687067,0.04822657,0.03350738,0.04708743,0.8077932],"study_design_scores_gemma":[0.004501792,0.002870094,0.0001895287,0.001221033,0.00036553,0.002763259,0.008919503,0.1830355,0.3665639,0.05008023,0.375773,0.003716732],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1199193,0.00747653,0.7601476,0.001602375,0.002925149,0.001507568,0.00009474461,0.01418588,0.09214085],"genre_scores_gemma":[0.9974933,0.0001974733,0.001048484,0.00001772515,0.00001978962,0.0001324692,0.000002587888,0.00002769892,0.0010605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.877574,"threshold_uncertainty_score":0.6040975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009377203,0.00008634578,0.00009610636,0.00003430613,0.00002173535,0.000009290191,0.0002488685,0.00003222946,0.00003227071],"category_scores_gemma":[0.00001806988,0.0000435749,0.00005997138,0.00008095094,0.00003220766,0.00009079252,0.00005384014,0.00004150758,0.00001566625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004624658,"about_ca_system_score_gemma":0.000002995871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002279832,"about_ca_topic_score_gemma":2.193135e-7,"domain_scores_codex":[0.9995028,9.398415e-7,0.0001342984,0.00007969975,0.0001360479,0.0001462549],"domain_scores_gemma":[0.9998153,0.00001147158,0.0000324705,0.00007259651,0.00003951891,0.00002858953],"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.000003392463,0.00001222803,0.001836824,0.000050289,0.00002255357,9.198606e-8,0.00008398108,0.0000019067,0.9541004,0.005848942,0.02010002,0.01793931],"study_design_scores_gemma":[0.0001403723,0.00002390145,0.0008005056,0.00008881865,0.000009032894,0.000003433562,0.00001515884,0.00002841203,0.9833267,0.004602714,0.01088259,0.00007836067],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.789663,0.0006491404,0.002996189,0.0017219,0.0006808917,0.0009463807,0.00001776669,0.001648944,0.2016758],"genre_scores_gemma":[0.9985104,0.0001075808,0.0007772231,0.00002501738,0.00004595014,0.0000392309,4.504066e-8,0.000015685,0.0004789241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2088473,"threshold_uncertainty_score":0.1776933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001038465,0.00008691129,0.0001159826,0.00003799679,0.00002754966,0.00002235423,0.00004748007,0.00004849731,0.00002955053],"category_scores_gemma":[0.000007941351,0.00006055797,0.00003282855,0.00002208278,0.000008151032,0.00008434551,0.000012122,0.00001428476,0.00000129328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001740252,"about_ca_system_score_gemma":0.00000765981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003907021,"about_ca_topic_score_gemma":5.123708e-7,"domain_scores_codex":[0.9995868,0.000005662735,0.0001068386,0.0001148488,0.00002836938,0.0001574652],"domain_scores_gemma":[0.9996303,0.0002101409,0.00001138518,0.00007410304,0.00001755221,0.00005646905],"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.000009744667,0.00000273422,0.00004522967,0.00003610761,0.00003257701,1.490564e-7,0.00009025548,0.000007513474,0.3254711,0.007911488,0.02069391,0.6456992],"study_design_scores_gemma":[0.0007489706,0.0001029948,0.000005086599,0.00003356849,0.000009257873,0.000007862183,0.00002472487,0.01251193,0.970414,0.00583829,0.01015096,0.0001524017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003345767,0.0000783029,0.9976088,0.00003577591,0.00009877111,0.0004103138,0.000005314177,0.0005511817,0.0008769684],"genre_scores_gemma":[0.01297834,0.000006989262,0.9861914,0.00004944106,0.000115152,0.00008659947,7.047916e-7,0.00002331445,0.0005480549],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6455469,"threshold_uncertainty_score":0.2469482,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005440372,0.0001099131,0.0001251152,0.00005186167,0.00003372762,0.0000350353,0.00008976262,0.00007682601,0.0003281273],"category_scores_gemma":[0.000007872486,0.00009911249,0.00005873031,0.0000698317,0.00001094252,0.0001297765,0.000003850301,0.00005018907,0.0001080927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002947644,"about_ca_system_score_gemma":0.00000447012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002532573,"about_ca_topic_score_gemma":0.000005409434,"domain_scores_codex":[0.9994933,0.000005284534,0.000141737,0.0000968664,0.0000556631,0.0002071715],"domain_scores_gemma":[0.9997295,0.00004345055,0.000008201307,0.0001247282,0.00003873882,0.00005539993],"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.000004568779,0.0000316953,0.00003684405,0.0002869345,0.00007673223,0.000002072251,0.0002997663,0.0005913897,0.525927,0.001598895,0.3989999,0.07214422],"study_design_scores_gemma":[0.0004280306,0.00007744328,0.0003156831,0.0000339872,0.00002218263,0.000006397052,0.00005478557,0.585524,0.3701493,0.001102586,0.0418653,0.0004202932],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05690064,0.0004856438,0.8777198,0.000249657,0.0003257332,0.001379943,0.00001374334,0.02112245,0.04180241],"genre_scores_gemma":[0.9645441,0.00001695336,0.03429956,0.0001070691,0.00005356684,0.0002603321,0.000008220495,0.00004253406,0.0006676646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9076434,"threshold_uncertainty_score":0.404169,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007245281,0.00006450522,0.00006890165,0.00002764088,0.00001487668,0.000008785616,0.00004377238,0.00003898028,0.0001822323],"category_scores_gemma":[0.000004280674,0.00005529788,0.00004125265,0.00002733935,0.000005815521,0.00004685477,0.000007607577,0.00002714139,0.00004312249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002657009,"about_ca_system_score_gemma":0.000001467963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.814355e-7,"about_ca_topic_score_gemma":4.892105e-7,"domain_scores_codex":[0.9996094,0.000002665515,0.00008099666,0.0000451263,0.00004640601,0.0002154392],"domain_scores_gemma":[0.9998083,0.0000203459,0.00000350431,0.00008954179,0.000007862212,0.00007051348],"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.00008508344,0.000548431,0.007652237,0.0005460884,0.0007402014,0.00001010393,0.0009727206,0.02416912,0.03745436,0.08618002,0.7021414,0.1395002],"study_design_scores_gemma":[0.0004857619,0.0001922549,0.0001878527,0.00001220277,0.00006109264,0.00003104069,0.00003996427,0.2870882,0.4463539,0.0007125736,0.2642909,0.0005442137],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03590662,0.0003521984,0.9279589,0.00003283081,0.0002159092,0.0003165041,0.000006064882,0.00117524,0.03403569],"genre_scores_gemma":[0.9906472,0.00001013219,0.008606801,0.00006571721,0.0001212801,0.00004976864,0.000003601305,0.00001670262,0.0004787952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547406,"threshold_uncertainty_score":0.2254982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005600105,0.0001071442,0.0001100813,0.00006712555,0.00003779417,0.00002888843,0.0000398616,0.00004628517,0.00002279497],"category_scores_gemma":[0.000004164847,0.00007676935,0.00001334509,0.00003135976,0.00004416462,0.00007594639,0.00001547253,0.00006904866,2.16666e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008175392,"about_ca_system_score_gemma":0.000001733251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002057165,"about_ca_topic_score_gemma":0.00004634461,"domain_scores_codex":[0.9996384,0.000007216623,0.0000741593,0.0001169024,0.00003065223,0.0001326822],"domain_scores_gemma":[0.9998369,0.00002462893,0.000009287377,0.00007371647,0.00001515239,0.00004037374],"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.0003709111,0.0001094672,0.006106095,0.001018459,0.0003254426,0.00002507351,0.01128219,0.000605789,0.4035067,0.05381565,0.003025979,0.5198082],"study_design_scores_gemma":[0.003379958,0.004429102,0.0107917,0.0005790223,0.0002199235,0.0006900806,0.002224945,0.3981146,0.3114415,0.2605946,0.005113451,0.002421089],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773179,0.0001610103,0.816642,0.00001529799,0.000009462896,0.0002239716,0.000003009712,0.0004019527,0.005225362],"genre_scores_gemma":[0.8917249,0.00004278752,0.1080882,0.00004317826,0.0000155269,0.00002908132,0.000002997793,0.00001660396,0.00003673347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7144069,"threshold_uncertainty_score":0.3130563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006586244,0.00008136182,0.00007767166,0.00004646648,0.00003089735,0.00003212055,0.00007032834,0.00005449655,0.000234154],"category_scores_gemma":[0.000004171503,0.00007528416,0.00002576808,0.0001084658,0.00001586557,0.000105468,0.00001055661,0.00007185688,0.00005580449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000291846,"about_ca_system_score_gemma":0.000005301026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003427472,"about_ca_topic_score_gemma":0.00001092523,"domain_scores_codex":[0.9995963,0.000004488064,0.0001097801,0.00007470223,0.00006256071,0.0001521912],"domain_scores_gemma":[0.9998003,0.000006181007,0.000007522034,0.0001321853,0.00001118185,0.00004262221],"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.00002232834,0.00009078259,0.0167539,0.0001077069,0.0001222549,0.0003443298,0.001380826,0.09950203,0.7965476,0.01268635,0.03554508,0.0368968],"study_design_scores_gemma":[0.0003661226,0.00004582569,0.001020694,0.00005428092,0.00002305395,0.0002298498,0.0001199215,0.6337184,0.3345381,0.003843455,0.02533041,0.0007098267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4910069,0.0001391452,0.4134709,0.00001193121,0.0002031985,0.0001014892,0.000001219667,0.002027445,0.09303781],"genre_scores_gemma":[0.9653919,0.00002775815,0.03360501,0.00006132368,0.00005570904,0.000003208612,8.305856e-7,0.00002425656,0.0008299476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5342164,"threshold_uncertainty_score":0.3069999,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006964168,0.000732669,0.0005315059,0.0004693142,0.0002211008,0.000453565,0.001202464,0.0003541713,0.0009173207],"category_scores_gemma":[0.0003711668,0.0006240353,0.0001674226,0.000640269,0.0001154728,0.0004755651,0.00006462296,0.0009598013,0.001358759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005470323,"about_ca_system_score_gemma":0.0002214539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003696441,"about_ca_topic_score_gemma":0.000003190566,"domain_scores_codex":[0.9965256,0.0003551504,0.0007995083,0.0007696476,0.0008895851,0.0006604755],"domain_scores_gemma":[0.9966683,0.0006880112,0.0002175911,0.0007589929,0.001428495,0.0002385619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003298198,0.0008668609,0.0006169373,0.0001364851,0.002002477,0.0002782798,0.002031098,0.03089083,0.0241266,0.2055031,0.6448852,0.0883323],"study_design_scores_gemma":[0.00113712,0.001371059,0.0005484708,0.001048288,0.00008399179,0.00009952549,0.0001337211,0.8613105,0.09596314,0.008167095,0.02818209,0.001954988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007868177,0.00001883234,0.9610234,0.0003794926,0.006554014,0.00101085,0.0001280895,0.001021767,0.02199536],"genre_scores_gemma":[0.972106,0.0001263712,0.02378012,0.001283355,0.0009483138,0.0002523618,0.0000911442,0.0001527967,0.001259518],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9642379,"threshold_uncertainty_score":0.9999959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001095575,0.0001503438,0.000202076,0.0004879705,0.0001122372,0.00001540133,0.0002184392,0.0003358616,0.0001583287],"category_scores_gemma":[0.000006109497,0.0001435323,0.00003377945,0.0003076027,0.00007919647,0.00009357664,0.000001180371,0.0003043602,0.00008585497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002117358,"about_ca_system_score_gemma":0.000005796888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002849127,"about_ca_topic_score_gemma":0.000005927901,"domain_scores_codex":[0.9993336,0.00001543905,0.0002042062,0.0001756237,0.00004897451,0.0002221848],"domain_scores_gemma":[0.9994226,0.00002842986,0.00002061855,0.0004575275,0.00002366485,0.00004713342],"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.00006588856,0.0002826028,0.001157959,0.0005838305,0.0006902947,0.0001013897,0.00120927,0.0007272207,0.04099264,0.0425451,0.003328164,0.9083157],"study_design_scores_gemma":[0.001335886,0.00119268,0.0006901355,0.0005241015,0.0001758483,0.001247827,0.002736849,0.009417679,0.8811238,0.05427881,0.04549074,0.00178564],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357331,0.006269759,0.6631701,0.0002968402,0.002071699,0.001234496,0.00005399675,0.0135518,0.1776182],"genre_scores_gemma":[0.9974106,0.0004921768,0.001080215,0.0000151661,0.00001008092,0.0001642249,8.749693e-7,0.00002584679,0.000800812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.90653,"threshold_uncertainty_score":0.5853077,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007560381,0.00006013825,0.00008705206,0.00003971549,0.00001115082,0.000006551423,0.00007262981,0.00004165274,0.0004063522],"category_scores_gemma":[0.000009478045,0.00005567622,0.00002377126,0.00007955173,0.000008695925,0.00005301555,0.000005773092,0.00004599077,0.00003849113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001619052,"about_ca_system_score_gemma":0.000001277402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004842099,"about_ca_topic_score_gemma":2.039988e-7,"domain_scores_codex":[0.9996604,0.000005248271,0.0001177649,0.00005235575,0.00005633144,0.0001078888],"domain_scores_gemma":[0.9998228,0.00003019737,0.00001025169,0.0001052632,0.00001061969,0.00002089351],"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.000001344807,0.00004202132,0.00123303,0.0001201728,0.000077274,0.000007827735,0.001327497,0.01154913,0.7846755,0.007464272,0.03418594,0.159316],"study_design_scores_gemma":[0.0001102219,0.00004624344,0.0001902272,0.00002994412,0.000009908504,0.000006890249,0.00004951741,0.305474,0.6915942,0.001766129,0.0005181874,0.0002046305],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003060428,0.0002155702,0.9172256,0.000004955348,0.00002932573,0.00007447841,4.187356e-7,0.000866186,0.07852305],"genre_scores_gemma":[0.9916593,0.00005220874,0.007840664,0.00001305073,0.00001965166,0.000005317697,1.739424e-7,0.00001428213,0.0003953841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9885988,"threshold_uncertainty_score":0.4449272,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202923,0.00005816322,0.00007330772,0.0001621611,0.0002889748,0.00005355705,0.0002204253,0.00003806523,0.00008303539],"category_scores_gemma":[0.00003301184,0.00004283642,0.00004252242,0.0003134352,0.00009213248,0.0001050701,0.00001606404,0.0001264926,0.000008248219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005912706,"about_ca_system_score_gemma":0.00002461622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050349,"about_ca_topic_score_gemma":0.00002964633,"domain_scores_codex":[0.9992294,0.00006272864,0.0001656778,0.0001001503,0.000201854,0.0002401826],"domain_scores_gemma":[0.9991231,0.00008397788,0.000005315881,0.0002553157,0.0004830297,0.00004924818],"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.00002849236,0.0009361677,0.0001076322,0.0002232886,0.0003217211,0.000005417849,0.01157872,0.3523674,0.05111108,0.09277878,0.02786426,0.462677],"study_design_scores_gemma":[0.00007189998,0.0002685682,0.0002333571,0.00002344878,0.00000514884,0.000001302508,0.000280186,0.8035454,0.1927314,0.001918901,0.0008393413,0.00008099098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01820221,0.0006909059,0.9758065,0.0002322979,0.00004456684,0.001122236,0.00003954297,0.0001793429,0.003682409],"genre_scores_gemma":[0.9445738,0.0002558506,0.05436609,0.00001841217,0.00004194152,0.0006407353,0.00001088421,0.00001848092,0.00007381877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9263716,"threshold_uncertainty_score":0.222259,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005584057,0.00007281823,0.00006720296,0.00004798947,0.00003174892,0.00001578791,0.00004863823,0.00004646699,0.0000361811],"category_scores_gemma":[0.00001040148,0.0000644215,0.0000401005,0.00005121813,0.000005901316,0.00001891575,0.000002369059,0.00006125128,0.000004368348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001545845,"about_ca_system_score_gemma":0.000002289237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001516769,"about_ca_topic_score_gemma":4.200509e-7,"domain_scores_codex":[0.9996478,0.000003637754,0.00009369831,0.00007728127,0.00004403979,0.0001335483],"domain_scores_gemma":[0.9998503,0.00001205783,0.000008160212,0.00009014416,0.0000138851,0.00002541781],"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.00001667403,0.00003129684,0.00001874605,0.00004301943,0.0000269004,0.000001438105,0.0006861968,0.01042751,0.4555888,0.007194174,0.05159927,0.4743659],"study_design_scores_gemma":[0.0002052318,0.0002574976,0.000637134,0.00002751908,0.000009235138,0.00002976654,0.00006982625,0.01282293,0.9462805,0.03051982,0.008835716,0.0003047644],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2061235,0.000323766,0.7003546,0.0003425508,0.000289579,0.0005499884,0.000003864532,0.003791224,0.08822083],"genre_scores_gemma":[0.9672593,0.000003279581,0.03228058,0.0000628352,0.0001037227,0.00001454831,0.000001932875,0.00001233615,0.0002614233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7611358,"threshold_uncertainty_score":0.2627032,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008810822,0.0001155628,0.0001260526,0.0002015858,0.00003877367,0.00001357914,0.000104337,0.0001527938,0.000170188],"category_scores_gemma":[0.00002902341,0.0001120166,0.00005066316,0.0002149928,0.0000189002,0.00003977132,0.000005163662,0.00008559111,0.00002523622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003579015,"about_ca_system_score_gemma":0.00001335654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.016531e-7,"about_ca_topic_score_gemma":0.00000125452,"domain_scores_codex":[0.9994481,0.000005392457,0.0001316005,0.0001230367,0.00004749206,0.0002443567],"domain_scores_gemma":[0.9996923,0.00003002619,0.0000110014,0.000201744,0.00003199441,0.00003296077],"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.00001975905,0.0002394958,0.002897242,0.0008966133,0.0002322545,0.00005374429,0.0003726229,0.006589707,0.4127663,0.2784794,0.2334737,0.06397917],"study_design_scores_gemma":[0.0004683666,0.0001126782,0.000024453,0.00003842733,0.000007383351,0.00001084122,0.0002012455,0.01672536,0.6998399,0.008431645,0.2737379,0.0004017637],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004550197,0.0001488504,0.9621053,0.0001171497,0.0001141482,0.0002781254,0.0000047648,0.002731444,0.02994998],"genre_scores_gemma":[0.9381806,0.000005791942,0.06122793,0.0001115125,0.00001057608,0.0001190524,0.000003070835,0.00003467929,0.0003067791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9336304,"threshold_uncertainty_score":0.4567905,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001216746,0.0001570036,0.000205297,0.00004597026,0.0000954298,0.00001473385,0.0001408038,0.00007813911,0.0001014881],"category_scores_gemma":[0.00002200233,0.0001426323,0.00007234772,0.00003884669,0.00002643608,0.00004513584,0.00002018462,0.00008842042,0.00005618786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006117072,"about_ca_system_score_gemma":0.000009087273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001742985,"about_ca_topic_score_gemma":0.00001236026,"domain_scores_codex":[0.9992468,0.00001861048,0.0002233377,0.0001491457,0.0001343668,0.0002277626],"domain_scores_gemma":[0.9994949,0.0001296053,0.00002043588,0.0002583219,0.00002743294,0.00006930537],"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.0003017946,0.000585362,0.001028248,0.0009249403,0.0002687002,0.000107228,0.0008334136,0.04419479,0.008650518,0.07820074,0.8403373,0.02456702],"study_design_scores_gemma":[0.01168516,0.004647621,0.02106784,0.000448982,0.0002033856,0.0001710332,0.0002620678,0.1959932,0.4649107,0.03838365,0.2563291,0.005897221],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09827968,0.00003681844,0.8857078,0.0001123375,0.000305036,0.0007962608,0.0001108584,0.002012034,0.01263915],"genre_scores_gemma":[0.9762853,0.00003527509,0.02215304,0.0002193118,0.00008715136,0.0001871231,0.0000416986,0.00003144722,0.0009596543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8780056,"threshold_uncertainty_score":0.5816378,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109361,0.0001463925,0.0002308671,0.0004531491,0.00007597783,0.00002693847,0.0001987859,0.0003304955,0.0001821838],"category_scores_gemma":[0.000004813191,0.0001400674,0.00003427154,0.0003114746,0.00004505374,0.00008909716,0.000001175026,0.0003247182,0.0002939869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000280031,"about_ca_system_score_gemma":0.000006653786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000010398,"about_ca_topic_score_gemma":0.000002526596,"domain_scores_codex":[0.9993297,0.0000148726,0.0001905202,0.0001889955,0.00006053164,0.0002153339],"domain_scores_gemma":[0.9993651,0.00005626985,0.00002010561,0.0004973747,0.00002237271,0.00003877772],"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.00007078728,0.0002193291,0.003727919,0.001431427,0.0008397597,0.00005110801,0.0003745695,0.01510089,0.1978847,0.03928079,0.006415865,0.7346029],"study_design_scores_gemma":[0.00296334,0.001735709,0.0006868807,0.001085245,0.0001680423,0.001314839,0.002814981,0.05708344,0.6542261,0.02440107,0.2508923,0.002628089],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6526063,0.007165462,0.2189596,0.0009675942,0.003460394,0.002164614,0.00007058102,0.01240221,0.1022033],"genre_scores_gemma":[0.9967395,0.0003786387,0.0002710804,0.00002226381,0.00001026321,0.0001127324,0.000001669894,0.00002562233,0.002438244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7319748,"threshold_uncertainty_score":0.5711781,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008871416,0.0001113963,0.0001043856,0.00004770211,0.00004598267,0.00002131531,0.00005350712,0.00005725988,0.00003117344],"category_scores_gemma":[0.000005937014,0.00009369475,0.00002492586,0.0001186636,0.000007741932,0.00005716352,0.000002943861,0.00004618883,0.000008052204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004853555,"about_ca_system_score_gemma":0.000008472288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005896202,"about_ca_topic_score_gemma":0.000006884486,"domain_scores_codex":[0.9994889,0.000006984112,0.000132839,0.000129622,0.00007298862,0.0001686496],"domain_scores_gemma":[0.9997091,0.00002667457,0.00001751176,0.0001560091,0.00004794676,0.00004276949],"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.0001296648,0.0001806466,0.001078699,0.0004872382,0.000342784,0.000005402655,0.0005042634,0.668144,0.1946854,0.01082704,0.01336472,0.1102502],"study_design_scores_gemma":[0.001170018,0.0002089657,0.0001892812,0.00004123266,0.00004272706,0.000008025143,0.0001475727,0.4028131,0.5413576,0.0003124157,0.05323093,0.0004781552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008558071,0.00004556571,0.9793341,0.0000111877,0.00002502931,0.0006304738,0.000005941683,0.001055566,0.01033409],"genre_scores_gemma":[0.9733914,0.000006271499,0.02598686,0.00003825578,0.00001457294,0.0001457805,0.00003083369,0.000034332,0.0003517562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9648333,"threshold_uncertainty_score":0.3820761,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000656667,0.00009362731,0.0001301276,0.00008394122,0.000008481959,0.000008582937,0.00007669006,0.00005828299,0.0004097828],"category_scores_gemma":[0.00001098965,0.00008975709,0.00003625836,0.0001269008,0.000005463163,0.0001227325,0.00001075214,0.00006772942,0.00002969244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325983,"about_ca_system_score_gemma":0.000004887294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008337735,"about_ca_topic_score_gemma":0.000008545295,"domain_scores_codex":[0.9995257,0.000003113389,0.0001545868,0.00006989452,0.00007338745,0.0001733158],"domain_scores_gemma":[0.9997674,0.00002646857,0.00001001258,0.0001346906,0.00002162812,0.00003975994],"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.000008331465,0.00003806011,0.0003647175,0.0001993842,0.0001035158,0.000003084441,0.0003038929,0.09848584,0.844999,0.002109661,0.02673524,0.02664925],"study_design_scores_gemma":[0.0001128122,0.00001250882,0.0001296687,0.00001850498,0.00000660379,0.000002831874,0.00000699305,0.322139,0.6651704,0.00003054065,0.0122416,0.0001284948],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2003865,0.001021669,0.6655496,0.00004684116,0.0001489144,0.0004290731,0.00001222183,0.009383779,0.1230214],"genre_scores_gemma":[0.9502302,0.0000354925,0.0479986,0.00001152966,0.00004371908,0.00001610244,0.000001915809,0.00002890075,0.001633508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7498438,"threshold_uncertainty_score":0.4486834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2897505503","doi":"10.1145/3233244","title":"GPlace3.0","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Router; Parallel computing; Routing (electronic design automation); Reduction (mathematics); Benchmark (surveying); Embedded system; Computer engineering; Algorithm; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01641232852791342,"gpt":0.232863703928349,"spread":0.2164513754004356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454802,0.0001611845,0.0002063325,0.0002574954,0.00008231545,0.00002612624,0.0002559004,0.0001313707,0.0001461457],"category_scores_gemma":[0.00001524589,0.0001635674,0.00006643689,0.0003419121,0.00004617769,0.0001634085,0.000001128387,0.0001511672,0.0001731247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001864383,"about_ca_system_score_gemma":0.00004734579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001172749,"about_ca_topic_score_gemma":0.000003205481,"domain_scores_codex":[0.9988996,0.00008617914,0.0003516242,0.0001517403,0.0002066067,0.0003042454],"domain_scores_gemma":[0.9991947,0.0001359397,0.00006119482,0.0004695884,0.00009408311,0.0000445044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000209741,0.0004364561,0.0000201594,0.0007094403,0.001058294,0.000004594452,0.001981679,0.3613797,0.3839213,0.01256344,0.02402907,0.2136861],"study_design_scores_gemma":[0.0004704187,0.001115723,0.00004594811,0.0001506487,0.00005536844,0.00004236954,0.00007566571,0.5074853,0.4840004,0.001822643,0.004377157,0.0003583945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002990474,0.0002804968,0.9929577,0.00002493279,0.0003044591,0.0004559235,0.000005257516,0.001304521,0.001676289],"genre_scores_gemma":[0.9938956,0.00007317639,0.005440502,0.0000108937,0.00006673197,0.000129601,0.000002603887,0.00003727107,0.000343594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9909052,"threshold_uncertainty_score":0.6670086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007409065,0.0001104607,0.0001137932,0.0000499256,0.00005479136,0.00003787605,0.0001082465,0.00007524595,0.0001989589],"category_scores_gemma":[0.00003318771,0.00009381204,0.00007002104,0.00007123797,0.00001221356,0.00001884801,0.00001208793,0.0001478524,0.00001530702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000108196,"about_ca_system_score_gemma":0.00000147779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005629675,"about_ca_topic_score_gemma":0.000006273679,"domain_scores_codex":[0.9993745,0.000007058539,0.0001338132,0.0001193209,0.000066591,0.0002987058],"domain_scores_gemma":[0.9996864,0.0000989257,0.00000896604,0.0001358889,0.00001152416,0.00005832686],"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.0000151337,0.00006574339,0.0003226864,0.0002027507,0.00007551188,0.00000969976,0.0008333717,0.006556594,0.01298438,0.005896715,0.04620051,0.9268369],"study_design_scores_gemma":[0.0003504025,0.0002788985,0.00003570307,0.00003952136,0.00001507817,0.00001789965,0.00002522756,0.7888394,0.1658664,0.01162533,0.03248784,0.0004183584],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01886322,0.0001672643,0.917601,0.0002960677,0.00009994237,0.0004984626,0.000003063399,0.002418433,0.06005257],"genre_scores_gemma":[0.9366431,0.00001117003,0.06206375,0.0001575774,0.0001288293,0.0001157674,0.00000173298,0.00002768391,0.0008503317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9264185,"threshold_uncertainty_score":0.3825544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005739526,0.00007792269,0.00007788369,0.0000323584,0.00003006329,0.00003319318,0.00003805846,0.00004897752,0.0001989768],"category_scores_gemma":[0.00001110949,0.00006620973,0.00001863099,0.00004872171,0.000006386787,0.00005355427,0.000006793688,0.00005532327,0.000005059155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001321837,"about_ca_system_score_gemma":8.961135e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006850705,"about_ca_topic_score_gemma":0.00000504277,"domain_scores_codex":[0.9996356,0.000002978941,0.0000916886,0.00008332363,0.00003450613,0.0001519525],"domain_scores_gemma":[0.9998387,0.00003023333,0.000006793251,0.00007565362,0.00001438776,0.00003424317],"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.00002894983,0.00007199936,0.0002459541,0.0004330997,0.0001152125,0.000008208977,0.001189749,0.001221242,0.04197097,0.003051538,0.2964395,0.6552235],"study_design_scores_gemma":[0.0003533661,0.0002914541,0.000003703343,0.00005411644,0.0000152849,0.000005920946,0.0001562812,0.6980168,0.2089155,0.0006408843,0.09128796,0.0002586847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008839051,0.0003465276,0.95498,0.000152332,0.00007450036,0.000562369,0.000002753789,0.001318105,0.0337244],"genre_scores_gemma":[0.8815672,0.0002250153,0.1143925,0.0001442706,0.0000425752,0.0002207032,0.000006060678,0.00003077529,0.003370901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8727282,"threshold_uncertainty_score":0.2699954,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002625594,0.0002472762,0.0002161705,0.0002320046,0.0001874718,0.00003672968,0.0001465619,0.0001482501,0.000005913527],"category_scores_gemma":[0.0000209242,0.0002784049,0.00009656926,0.0002762171,0.00007400846,0.0002081987,0.00003912517,0.0001782821,0.00004046664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006367581,"about_ca_system_score_gemma":0.00006294069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003060666,"about_ca_topic_score_gemma":0.000004070431,"domain_scores_codex":[0.9986438,0.00008125087,0.0003072433,0.0003233137,0.0002572416,0.0003872015],"domain_scores_gemma":[0.9993624,0.0001933326,0.00003446858,0.0001354164,0.0001744355,0.00009991862],"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.00001369841,0.00004975439,0.00000891306,0.0000724475,0.0000375192,0.000007278313,0.0002280069,0.8079615,0.00190738,0.00002884419,0.0001991274,0.1894855],"study_design_scores_gemma":[0.001175358,0.0002918268,0.008049383,0.00006465291,0.00002593915,0.00005291772,0.00005235766,0.9815669,0.006271571,0.002076031,0.00005474306,0.0003183415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001920321,0.0005851784,0.9946311,0.00003358817,0.0003490764,0.001580629,0.00003472888,0.0008302969,0.00003509611],"genre_scores_gemma":[0.4869851,0.00001591658,0.5125206,0.00001699873,0.000118097,0.0002393369,0.00004763043,0.00004267523,0.00001362813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4850648,"threshold_uncertainty_score":0.9999668,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009395096,0.00005875839,0.00007644989,0.00004752888,0.00001483611,0.00001873514,0.00004246675,0.00005120552,0.00002522964],"category_scores_gemma":[0.000004990072,0.00005638077,0.000008331994,0.00006195351,0.00001199596,0.0002515552,0.000004702756,0.00002875069,0.000002738309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001793852,"about_ca_system_score_gemma":0.000004862615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008958178,"about_ca_topic_score_gemma":0.000001293832,"domain_scores_codex":[0.9996854,0.00001339436,0.0001162869,0.00006486419,0.0000444813,0.00007555226],"domain_scores_gemma":[0.999819,0.00001342727,0.00001358023,0.000108761,0.00001811601,0.00002710086],"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.000003674013,0.00001763872,0.00004368855,0.00002511711,0.00001085814,5.913386e-7,0.0002181346,0.02375371,0.9016786,0.000161728,0.0003101319,0.07377615],"study_design_scores_gemma":[0.00004608331,0.00001638668,0.0004280573,0.000005734852,0.000004065662,0.000002989399,0.00001017426,0.5954747,0.403835,0.0000266377,0.00009903185,0.00005118526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4816648,0.00009025124,0.5151646,0.000006425385,0.00001392748,0.0001281964,0.00000185908,0.001699936,0.001229955],"genre_scores_gemma":[0.8443482,0.00001309915,0.155583,0.00001016392,0.00001541718,0.000003158634,0.000002837739,0.00001111086,0.00001295838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.571721,"threshold_uncertainty_score":0.2299141,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008387574,0.00007697105,0.00007446151,0.0000387513,0.00002375649,0.00001530067,0.00006004101,0.0000335206,0.0001746488],"category_scores_gemma":[0.000005049374,0.00006674571,0.00003674808,0.00003964929,0.000005601681,0.00002437946,0.000006629524,0.00003185889,0.00007640807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005084841,"about_ca_system_score_gemma":0.000003721435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001472717,"about_ca_topic_score_gemma":0.000004754229,"domain_scores_codex":[0.99959,0.00000306931,0.0001133679,0.00007473256,0.0000631949,0.0001556046],"domain_scores_gemma":[0.9998097,0.00002559976,0.000006350236,0.0001095006,0.00001296516,0.00003585438],"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.00001766579,0.0001776845,0.00003245702,0.0002568641,0.00008325747,0.000002029845,0.0008439796,0.4853266,0.05372544,0.01987455,0.2767827,0.1628767],"study_design_scores_gemma":[0.0002754577,0.0000570084,0.00001749809,0.00001461825,0.00001039897,0.000001885962,0.00004045017,0.7095678,0.2075217,0.0001498777,0.08216179,0.0001815563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01868008,0.0002212547,0.9515095,0.0001535523,0.0000871806,0.0004297603,0.00000353327,0.001117914,0.02779716],"genre_scores_gemma":[0.9566281,0.00001179129,0.04183317,0.0001358526,0.0001027109,0.0001284609,0.000003877749,0.00002086424,0.001135221],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.937948,"threshold_uncertainty_score":0.2721811,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006983195,0.0000762198,0.00006382522,0.0000521015,0.00002822435,0.00001128481,0.0000544495,0.00004775561,0.0002188025],"category_scores_gemma":[0.00001478409,0.00006606268,0.00004084284,0.00003816143,0.000009740907,0.0000845,0.000009237832,0.00004293742,0.00006797608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002103231,"about_ca_system_score_gemma":0.000001875875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003317698,"about_ca_topic_score_gemma":8.188554e-7,"domain_scores_codex":[0.999643,0.000003736365,0.00006894294,0.00004861041,0.0000535737,0.0001821965],"domain_scores_gemma":[0.9998038,0.00003345866,0.000006993656,0.00009462341,0.00001032939,0.00005077292],"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.00006686696,0.0001770668,0.002308885,0.0002909136,0.000222838,0.000002467348,0.005457827,0.02022581,0.04396763,0.02296407,0.4818266,0.422489],"study_design_scores_gemma":[0.001325105,0.0002457422,0.006558432,0.00005269654,0.0001051544,0.00002529688,0.0003827013,0.1235152,0.6676368,0.01014547,0.1886292,0.001378343],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0333884,0.0001609249,0.9352224,0.00002456936,0.0003141018,0.0002561693,0.000008945904,0.001161509,0.02946291],"genre_scores_gemma":[0.9597791,0.000003243277,0.03989144,0.00005001334,0.00005166846,0.00002971048,0.000006282589,0.00001654023,0.0001720052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9263907,"threshold_uncertainty_score":0.2693958,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005286605,0.0004124327,0.0006749264,0.0006367221,0.0003647028,0.00008001992,0.0002917025,0.0001572412,0.0001576045],"category_scores_gemma":[0.000005803107,0.0003586059,0.0001041394,0.0007103943,0.0001010426,0.0001542646,0.000002994236,0.0007966707,0.000004719009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002946019,"about_ca_system_score_gemma":0.0000863091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003330468,"about_ca_topic_score_gemma":0.000009423682,"domain_scores_codex":[0.9976722,0.0004637582,0.0006904596,0.0004060343,0.0003607539,0.0004067744],"domain_scores_gemma":[0.9988242,0.0003844621,0.0001576917,0.0003281143,0.000173619,0.0001319134],"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.00004717797,0.00007592356,0.00001437548,0.0001002521,0.0003433468,0.00003689552,0.0004707494,0.9381946,0.01058574,0.0003311753,0.0001479008,0.04965186],"study_design_scores_gemma":[0.0005339165,0.002063817,0.00001046656,0.0002539979,0.0001225661,0.000335804,0.001214459,0.9700952,0.02422221,0.00003467198,0.0006004804,0.0005124755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006305539,0.0002883101,0.9907889,0.000008008887,0.0006024474,0.0007005233,0.00002646627,0.0007184723,0.0005613592],"genre_scores_gemma":[0.9983985,0.0001569627,0.0007105783,0.00002716722,0.00003005746,0.0004582289,0.00001412388,0.00007203033,0.0001323201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.992093,"threshold_uncertainty_score":0.9998866,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005166231,0.00007894485,0.00009488063,0.00002597788,0.00003923321,0.0000229064,0.00007400173,0.00004060634,0.0001369787],"category_scores_gemma":[0.00002879163,0.00007852165,0.00004695155,0.00007689621,0.000004793802,0.00006697528,0.00001201416,0.0000860085,0.00002623253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002118557,"about_ca_system_score_gemma":0.00000324059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002271286,"about_ca_topic_score_gemma":8.211288e-7,"domain_scores_codex":[0.9995662,0.000003727831,0.0001231823,0.0000884909,0.00005852215,0.0001598798],"domain_scores_gemma":[0.9998272,0.00002735549,0.00001057617,0.00005621555,0.00001545622,0.000063201],"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.000008943939,0.00000574548,0.0004465527,0.000321976,0.00009832291,0.000006651336,0.001556075,0.791176,0.08280159,0.01778419,0.008726686,0.09706732],"study_design_scores_gemma":[0.0001369481,0.00009876161,0.00002268692,0.000007358435,0.000009135445,7.701818e-7,0.00008702465,0.9389051,0.03109872,0.000260938,0.02922253,0.0001500011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002742865,0.0001147375,0.9542472,0.00006373885,0.00002890429,0.000160356,1.102865e-7,0.001193129,0.04391759],"genre_scores_gemma":[0.9953299,0.00003212495,0.003952845,0.0002970927,0.00009010367,0.00003533412,0.000007743025,0.0000233207,0.0002315631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9950556,"threshold_uncertainty_score":0.320202,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007680181,0.00008249212,0.0000726373,0.00007031315,0.0000292579,0.00003598902,0.00005648964,0.00003659081,0.00001178913],"category_scores_gemma":[0.000004523751,0.00006509182,0.00001926463,0.00009745944,0.00001061781,0.0004854396,0.00001116064,0.00009279497,0.0000328846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003544011,"about_ca_system_score_gemma":0.0000044867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349456,"about_ca_topic_score_gemma":0.000006500899,"domain_scores_codex":[0.999585,0.000001896096,0.000098902,0.00004558675,0.00009713417,0.000171519],"domain_scores_gemma":[0.9998088,0.00001910465,0.00001657989,0.00009287274,0.00002393474,0.00003864625],"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.0000188741,0.00002800964,0.001114832,0.0001666863,0.00004403619,0.00001254636,0.002543625,0.005258443,0.06062326,0.003199561,0.001823283,0.9251668],"study_design_scores_gemma":[0.0004010207,0.0001864868,0.002343005,0.00006070242,0.00002318961,0.00002279273,0.0003993966,0.377106,0.6140003,0.0002299477,0.004699617,0.0005276023],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08917005,0.000004098938,0.8723131,0.000005536046,0.00002745204,0.0000916388,5.698799e-7,0.001058597,0.03732889],"genre_scores_gemma":[0.9841961,0.000001262225,0.01564485,0.00004202919,0.00006779083,0.000004587193,0.000004455735,0.00001233523,0.00002655654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9246392,"threshold_uncertainty_score":0.2654367,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452919,0.0002374516,0.0003050777,0.0001524917,0.0002141822,0.00007674744,0.0002150225,0.0001321202,0.000007391267],"category_scores_gemma":[0.0000388481,0.0002388847,0.0001021068,0.0001774243,0.00009598116,0.0002914869,0.0000255654,0.0001425535,9.36034e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005796499,"about_ca_system_score_gemma":0.00006718477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006034729,"about_ca_topic_score_gemma":9.163984e-7,"domain_scores_codex":[0.9986545,0.000005116042,0.0005091742,0.0002854197,0.0002795751,0.0002661731],"domain_scores_gemma":[0.9991144,0.0000903145,0.0001796057,0.00006087376,0.0004247132,0.0001301124],"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.0009410967,0.002195121,0.04701219,0.005640419,0.001185558,0.00003052794,0.005506186,0.075074,0.5504491,0.008731439,0.07882733,0.224407],"study_design_scores_gemma":[0.002790892,0.0001461899,0.009007657,0.0004930208,0.00007344143,0.00004331696,0.0001085746,0.9282164,0.0504272,0.006894164,0.001058241,0.0007409182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09121837,0.0001385956,0.9069359,0.0002037004,0.0002161991,0.0002541497,0.0003665287,0.0004250623,0.0002414391],"genre_scores_gemma":[0.9150246,0.00006788603,0.08428211,0.0000476638,0.0001960752,0.00006239552,0.0002437281,0.00002866419,0.00004684735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8531424,"threshold_uncertainty_score":0.9741434,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001023776,0.0001308344,0.0001255103,0.00006455524,0.0001244235,0.00001599278,0.00009507574,0.0000729782,0.00001900183],"category_scores_gemma":[0.000009261326,0.000117665,0.00004452463,0.00005745844,0.000008166116,0.00005866908,0.00001768509,0.000101151,0.00000763953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003435015,"about_ca_system_score_gemma":0.00001572527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001161723,"about_ca_topic_score_gemma":0.000009596656,"domain_scores_codex":[0.9993411,0.000004645383,0.0001846576,0.0001284421,0.00008599458,0.0002552133],"domain_scores_gemma":[0.9997845,0.00002131201,0.00000874668,0.0001096848,0.00002252522,0.00005320134],"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.00001918119,0.00003179413,0.001181125,0.0002232112,0.0001168354,0.00002359393,0.006385929,0.9132438,0.01218269,0.0007616236,0.001270744,0.06455947],"study_design_scores_gemma":[0.0002709017,0.00002698367,0.0002567432,0.00003447639,0.000005833365,0.00001590557,0.00004243863,0.8905969,0.1042308,0.0003378892,0.003808987,0.0003721601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2963392,0.00005816071,0.70013,0.000005898911,0.0000311295,0.0001695508,0.000001315093,0.0007401217,0.00252454],"genre_scores_gemma":[0.8523575,0.00001589582,0.1468345,0.00002951962,0.00004928511,0.00005092876,0.000004244826,0.00003182464,0.0006262998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5560183,"threshold_uncertainty_score":0.4798239,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000406704,0.0002837694,0.0003864524,0.0003592941,0.0001216209,0.00006068171,0.0001754339,0.0002430416,0.00003083204],"category_scores_gemma":[0.00001272679,0.0002685078,0.0002019671,0.0002587142,0.00003248055,0.0004162453,6.639965e-7,0.0002023586,0.000025315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002407581,"about_ca_system_score_gemma":0.00004032351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004942511,"about_ca_topic_score_gemma":0.00006440005,"domain_scores_codex":[0.9985057,0.00008191293,0.0006367796,0.0002692127,0.0002318444,0.0002745783],"domain_scores_gemma":[0.9991547,0.0001443897,0.00009978491,0.0003058866,0.0002210239,0.00007418889],"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.0000814575,0.0002517651,9.002772e-7,0.0002440966,0.0001500662,0.000001244233,0.001276405,0.8364415,0.1505422,0.0005731606,0.000289169,0.0101481],"study_design_scores_gemma":[0.0008163942,0.0002560478,0.000003148309,0.0003271569,0.000067606,0.00001057652,0.0004035889,0.3509498,0.6463414,0.0002260902,0.0003403086,0.0002579143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003089458,0.00015201,0.9929678,0.0000149154,0.001377831,0.001362783,0.0002057504,0.0006711695,0.0001582983],"genre_scores_gemma":[0.9870596,0.00009342236,0.01180598,0.00001929951,0.00006540944,0.0006438149,0.00003356506,0.0000710527,0.0002078669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9839701,"threshold_uncertainty_score":0.9999767,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009020785,0.00006347483,0.00006300239,0.00002815526,0.00002087904,0.00001884896,0.00007250519,0.00005574105,0.0004388693],"category_scores_gemma":[0.000008232378,0.00005485982,0.00002931502,0.00003323354,0.000007383907,0.00004669897,0.000008668387,0.00006887002,0.00003312667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009809293,"about_ca_system_score_gemma":0.00000569874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007116607,"about_ca_topic_score_gemma":0.00001331766,"domain_scores_codex":[0.9996732,0.000001191099,0.00007353193,0.00006522673,0.00004776467,0.0001391223],"domain_scores_gemma":[0.9998083,0.00001167881,0.000004064512,0.0001190369,0.00001838777,0.00003855675],"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.000008317645,0.00003992718,0.0001052155,0.0001266515,0.00003951175,0.000001319134,0.0001091198,0.000478702,0.5127382,0.03130456,0.3450883,0.1099601],"study_design_scores_gemma":[0.0001896376,0.00003902191,0.00005935057,0.00000445343,0.000005881573,0.000002254456,0.00001153993,0.03083469,0.7616283,0.002574314,0.204501,0.0001495759],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02222616,0.00002972989,0.7734612,0.00009734069,0.0004420103,0.0003634254,0.000007216428,0.001597118,0.2017759],"genre_scores_gemma":[0.8924627,0.0000105177,0.1042262,0.00008092116,0.0001219192,0.0001423248,0.00000546309,0.0000263402,0.002923574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8702366,"threshold_uncertainty_score":0.4805312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983950263","doi":"10.1145/348019.348101","title":"Timing-driven routing for symmetrical array-based FPGAs","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto; National Science Council; University of Texas at Austin","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Router; Static routing; Multipath routing; Equal-cost multi-path routing; Link-state routing protocol; Placement; Dynamic Source Routing; Parallel computing; Computer network; Embedded system; Routing protocol; Physical design; Circuit design","retraction":null,"screen_n_in":null,"score":{"opus":0.02679862810034436,"gpt":0.2481109895829867,"spread":0.2213123614826423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024697,0.0002159306,0.000314914,0.0003569465,0.0001197414,0.00004089362,0.0002768112,0.0001798166,0.0001208407],"category_scores_gemma":[0.00003124529,0.0002271573,0.0001560302,0.0004977072,0.00002280448,0.0001453683,4.687712e-7,0.000193145,0.000040502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003088376,"about_ca_system_score_gemma":0.00007828324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215958,"about_ca_topic_score_gemma":0.000001201683,"domain_scores_codex":[0.9985086,0.00009666873,0.0005112887,0.000218996,0.0002396111,0.0004248401],"domain_scores_gemma":[0.9988631,0.0005071472,0.00007881036,0.0004142512,0.00007551805,0.00006117994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004282939,0.00008265226,0.000002376049,0.0001430644,0.00009067004,4.046184e-7,0.00008985311,0.9320243,0.01610345,0.0003264683,0.0004726574,0.05062126],"study_design_scores_gemma":[0.0005467748,0.0004898149,0.00001157202,0.0001282791,0.00006119904,0.000009448078,0.00001972372,0.8775274,0.1195249,0.0002895748,0.001157742,0.0002336522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002456667,0.0001779677,0.9944888,0.00004709656,0.0001158704,0.001019768,0.00001593124,0.001180439,0.0004974061],"genre_scores_gemma":[0.9722694,0.00003840262,0.02690162,0.00001693652,0.00004353347,0.0004583299,0.00001293287,0.00005649268,0.0002024262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9698126,"threshold_uncertainty_score":0.9263206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001257069,0.00002703231,0.00002462504,0.00001656568,0.000005753742,0.000006155723,0.00002536513,0.00001789167,0.000153955],"category_scores_gemma":[3.363829e-7,0.00002367959,0.00001066907,0.00003115316,0.000003103878,0.00002416265,0.000002099123,0.00001901822,0.00007903572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000508428,"about_ca_system_score_gemma":5.543983e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001788235,"about_ca_topic_score_gemma":0.000004421531,"domain_scores_codex":[0.9998636,8.683257e-7,0.00003496149,0.00002364971,0.00002188121,0.00005507208],"domain_scores_gemma":[0.9999381,0.000002839606,0.000001163017,0.0000477829,0.000002895051,0.000007193058],"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":[4.362283e-7,0.00001425171,0.001127387,0.00001804833,0.000006458944,0.000008456111,0.00001389259,0.0009954653,0.1151932,0.06499222,0.7902844,0.02734583],"study_design_scores_gemma":[0.000121802,0.00001867993,0.004299654,0.000006134595,0.000004192341,0.000008218126,0.000007895363,0.01669596,0.6945201,0.02715311,0.2568779,0.0002863846],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01183952,0.0001048445,0.1694024,0.00001203012,0.00004176049,0.00002871286,4.534457e-7,0.001911638,0.8166587],"genre_scores_gemma":[0.9931168,0.000004846513,0.005014264,0.00001727753,0.00004117309,0.000003658158,0.000001172845,0.000006818388,0.001793981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9812773,"threshold_uncertainty_score":0.1685699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}