{"meta":{"query_hash":"9213d3870a3a","filters":{"topic":"VLSI and FPGA Design Techniques"},"cohort_total":673,"direct_labels_cover":0,"predictions_cover":673,"exported":673,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9213d3870a3a","api":"https://metacan.xera.ac/api/v1/cohort?topic=VLSI+and+FPGA+Design+Techniques"},"results":[{"id":"W1013700976","doi":"10.1007/978-3-319-20071-2_1","title":"Sizing Digital Circuits Using Convex Optimization Techniques","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Regular polygon; Electronic circuit; Computer science; Digital electronics; Electronic engineering; Mathematics; Electrical engineering; Engineering; Chemistry; Geometry","score_opus":0.0478437612850758,"score_gpt":0.23195979614192846,"score_spread":0.18411603485685266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1013700976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013063576,0.001538784,0.9498926,0.00017965036,0.00014458653,0.00004455029,0.000095458,0.0006437879,0.046154298],"genre_scores_gemma":[0.054733947,0.005941916,0.8659218,0.00029401729,0.00026409584,0.00016271559,0.0004857151,0.0011842543,0.071011625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996991,0.000030215899,0.000014674616,0.000044579912,0.00019046383,0.000020985186],"domain_scores_gemma":[0.99981695,0.00008445396,0.000014381009,0.00003957119,0.000039939823,0.0000047453536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002868412,0.0015843343,0.00073719665,0.00067420944,0.00025332224,0.0011660412,0.0010438777,0.0004355762,0.016668634],"category_scores_gemma":[0.00062795635,0.0006646598,0.000800423,0.0011652296,0.00046728482,0.0010405513,0.0005944326,0.0015752284,0.0058162967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002989037,0.00003114403,0.000088644796,0.0005536365,0.0000649028,0.000061221544,0.000042100553,0.2085096,0.022703357,0.10701291,0.025619958,0.6352826],"study_design_scores_gemma":[0.000030916028,0.00011149207,0.0002504706,0.00018585032,0.00006614196,0.0003099002,0.00003403878,0.64299506,0.03436581,0.11573019,0.20587759,0.000042541782],"about_ca_topic_score_codex":0.00078151096,"about_ca_topic_score_gemma":0.0021912802,"teacher_disagreement_score":0.016668634,"about_ca_system_score_codex":0.00071411446,"about_ca_system_score_gemma":0.0005339536,"threshold_uncertainty_score":0.05576217},"labels":[],"label_agreement":null},{"id":"W10199753","doi":"10.1210/jcem.84.4.5617","title":"The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Obstacle; Combinatorics; Mathematics; Set (abstract data type); Computer science; Discrete mathematics; Mathematical optimization; Geography","score_opus":0.04271413218695374,"score_gpt":0.23622477898947547,"score_spread":0.19351064680252172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10199753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7744617,0.0015493854,0.18040012,0.0006552964,0.00014073419,0.00012698352,0.00066666084,0.00037896086,0.0416202],"genre_scores_gemma":[0.94183457,0.0006118335,0.055035956,0.00003849954,0.000030629064,0.000042963515,0.00040437948,0.0000696815,0.0019313442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994911,0.00014131945,0.000046598972,0.00006379367,0.00018823118,0.000068883004],"domain_scores_gemma":[0.998659,0.00080791605,0.0002557471,0.000098820514,0.00010698628,0.0000714365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048900035,0.0003717735,0.00031304886,0.0013021309,0.0003429585,0.0007723818,0.00059309055,0.00038822577,0.0040520974],"category_scores_gemma":[0.004254074,0.00021342348,0.00034824104,0.0010489373,0.00050319236,0.001320457,0.00078929897,0.0003913797,0.0005791691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013398852,0.000106119915,0.01836432,0.0005641496,0.00013237768,0.003222606,0.0006818341,0.25823966,0.025077978,0.44534484,0.009906891,0.23701923],"study_design_scores_gemma":[0.00016426295,0.0008938328,0.0127359275,0.00008843913,0.00008565539,0.012163229,0.0009117616,0.6102403,0.0129669495,0.32989022,0.019745938,0.00011352215],"about_ca_topic_score_codex":0.00033392347,"about_ca_topic_score_gemma":0.0005451896,"teacher_disagreement_score":0.0040520974,"about_ca_system_score_codex":0.0003221317,"about_ca_system_score_gemma":0.0002338556,"threshold_uncertainty_score":0.013555646},"labels":[],"label_agreement":null},{"id":"W114833178","doi":"","title":"An addition structure on incidence matrices of a BIB design.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.0063139874599083224,"score_gpt":0.21114655383359515,"score_spread":0.20483256637368683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114833178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09278709,0.0004919064,0.7255684,0.0006696198,0.00053659244,0.00018319601,0.00072501047,0.0011483103,0.17788985],"genre_scores_gemma":[0.69320667,0.000788095,0.2412714,0.00054404826,0.00031867131,0.00022864921,0.001135738,0.00036600608,0.06214068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.00012724832,0.000048088394,0.00008537917,0.00023418637,0.00011328316],"domain_scores_gemma":[0.99911946,0.00026746897,0.00012599613,0.00016874188,0.00022118176,0.00009719111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045773634,0.00050955877,0.00030122572,0.0011998323,0.0008271005,0.0019507972,0.0005175731,0.00039854992,0.018565565],"category_scores_gemma":[0.0018688962,0.00032953577,0.00032538062,0.0012572028,0.00079956383,0.0016637612,0.001024854,0.001033519,0.004287532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021635284,0.000095768606,0.00063430046,0.00018924536,0.000018583341,0.00034960546,0.00025418846,0.009289341,0.018165918,0.8611326,0.010528296,0.099125646],"study_design_scores_gemma":[0.00007654459,0.00032272053,0.00090832607,0.00013425604,0.000043460994,0.0010464395,0.00023123129,0.07051019,0.028475521,0.8317868,0.06640279,0.0000617296],"about_ca_topic_score_codex":0.0006476951,"about_ca_topic_score_gemma":0.0016243142,"teacher_disagreement_score":0.018565565,"about_ca_system_score_codex":0.0006116119,"about_ca_system_score_gemma":0.00062458246,"threshold_uncertainty_score":0.06210798},"labels":[],"label_agreement":null},{"id":"W117982534","doi":"","title":"Inducing regularization of graphs, multigraphs and pseudographs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regularization (linguistics); Combinatorics; Artificial intelligence; Computer science","score_opus":0.009950917027663106,"score_gpt":0.1897302259514448,"score_spread":0.1797793089237817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117982534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070534915,0.00081039744,0.8836663,0.0009538017,0.00015817648,0.00005724179,0.00030513792,0.0007589829,0.042755008],"genre_scores_gemma":[0.53248256,0.0011342376,0.41622868,0.0006615369,0.0002594903,0.00019296726,0.0009961434,0.0005733752,0.047471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993499,0.0002427203,0.000027740301,0.00013292329,0.00020050844,0.000046145582],"domain_scores_gemma":[0.99762446,0.0011732795,0.00027475605,0.000520057,0.00025481498,0.00015260426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059133203,0.0003470398,0.00033480418,0.0008508871,0.0006549369,0.0009900725,0.0006535371,0.00064080505,0.004670442],"category_scores_gemma":[0.0036898928,0.00039172065,0.000407831,0.00076208834,0.0009290273,0.0016129991,0.0015010844,0.0018509192,0.00087103614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065688735,0.00006290844,0.0008741359,0.0001674756,0.00002782784,0.00013745931,0.0002279037,0.024677759,0.010665477,0.8628935,0.010637056,0.089562766],"study_design_scores_gemma":[0.000018367891,0.000056943936,0.00080317183,0.00006336502,0.000023138839,0.00039058394,0.00015339463,0.12852325,0.009232201,0.8249036,0.03581084,0.00002120852],"about_ca_topic_score_codex":0.0005341575,"about_ca_topic_score_gemma":0.002292303,"teacher_disagreement_score":0.004670442,"about_ca_system_score_codex":0.00069193676,"about_ca_system_score_gemma":0.00047534838,"threshold_uncertainty_score":0.015624166},"labels":[],"label_agreement":null},{"id":"W139568493","doi":"10.1023/a:1019258807615","title":"A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems","year":2001,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Overhead (engineering); Scheme (mathematics); Mathematical optimization; Optimization algorithm; Mathematics","score_opus":0.025049053546780962,"score_gpt":0.24733264465686508,"score_spread":0.2222835911100841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139568493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024935673,0.00007578188,0.99337643,0.0001269259,0.000024633366,0.000041454772,0.00003834272,0.0023499415,0.0014728815],"genre_scores_gemma":[0.10226159,0.0002534956,0.89164066,0.00017380061,0.000042659398,0.00016297282,0.00014886641,0.0006202619,0.004695639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988055,0.0003875619,0.000089328154,0.0001601942,0.0004130945,0.00014434174],"domain_scores_gemma":[0.9981844,0.00067673984,0.00010726298,0.0006432876,0.000248837,0.00013956909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014325168,0.00079908397,0.0006992935,0.0013832005,0.0010864788,0.0032733185,0.004031214,0.0013663417,0.011188525],"category_scores_gemma":[0.004280206,0.0008957552,0.0011921149,0.0015735833,0.0018174854,0.0036192155,0.002444275,0.0018030179,0.0017880421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008693324,0.00025997826,0.0010634952,0.00051711383,0.0001175873,0.00041394006,0.00082881696,0.13688557,0.028627174,0.40602264,0.01289436,0.4115],"study_design_scores_gemma":[0.00022812036,0.00019358216,0.00037236337,0.00010903036,0.0001934637,0.0003911131,0.00018965449,0.7390787,0.031751897,0.17828555,0.049111966,0.000094586576],"about_ca_topic_score_codex":0.004588507,"about_ca_topic_score_gemma":0.009088657,"teacher_disagreement_score":0.011188525,"about_ca_system_score_codex":0.0009799014,"about_ca_system_score_gemma":0.0009788806,"threshold_uncertainty_score":0.037429392},"labels":[],"label_agreement":null},{"id":"W147160966","doi":"10.1007/978-1-4419-0739-4_3","title":"Measuring the Gap","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Block (permutation group theory); Power consumption; Dimension (graph theory); Computer science; Power (physics); Architecture; Bandgap voltage reference; Measure (data warehouse); Key (lock); Process (computing); Electronic engineering; Embedded system; Engineering; Electrical engineering; Mathematics; Data mining; Computer security","score_opus":0.03896632148578915,"score_gpt":0.19272237947438048,"score_spread":0.15375605798859132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147160966","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066357285,0.035417676,0.077719025,0.025618467,0.0038900462,0.00011171282,0.003190577,0.0012022109,0.78649294],"genre_scores_gemma":[0.6957019,0.023611678,0.09763344,0.007581379,0.0012724245,0.00030128958,0.004009958,0.0016381948,0.1682497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99634004,0.0007146524,0.00011875531,0.00064896763,0.001911807,0.0002657773],"domain_scores_gemma":[0.9923614,0.003864078,0.00040895026,0.0008712278,0.0020490545,0.00044520397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029548893,0.00047845,0.000653548,0.0028623396,0.0012101717,0.0054496005,0.0012086275,0.0017047452,0.036287498],"category_scores_gemma":[0.0191715,0.00027939415,0.0002569932,0.0041916138,0.0021299203,0.010990435,0.0030686506,0.001737442,0.012197815],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023782726,0.000090652815,0.008233153,0.00052038947,0.00004641552,0.000117668875,0.0012817368,0.001896599,0.0020233493,0.3537547,0.123447075,0.5083505],"study_design_scores_gemma":[0.000029712319,0.00020258459,0.010387918,0.0009847977,0.00004823834,0.00052995986,0.0052539706,0.006710919,0.005497684,0.42868474,0.54160684,0.000062707586],"about_ca_topic_score_codex":0.0017541518,"about_ca_topic_score_gemma":0.0023177413,"teacher_disagreement_score":0.036287498,"about_ca_system_score_codex":0.0018853488,"about_ca_system_score_gemma":0.0017344862,"threshold_uncertainty_score":0.12139374},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010276351642210182,"score_gpt":0.20837335737935833,"score_spread":0.19809700573714814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480203124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361291,0.00084917434,0.65508974,0.00013729153,0.00007757985,0.00007420491,0.000095801435,0.002399208,0.005147858],"genre_scores_gemma":[0.74254364,0.00027679547,0.2544991,0.000040091305,0.0000186213,0.000041274965,0.000103938575,0.00008183681,0.0023948075],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989784,0.000023215514,0.000010817034,0.000015895675,0.000036426703,0.00001577232],"domain_scores_gemma":[0.99974114,0.00007926973,0.000044878256,0.00008878788,0.0000362125,0.000009661432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118664226,0.00033793706,0.00021221857,0.0003620602,0.00024537533,0.00030851862,0.00044606676,0.00016259046,0.0015841646],"category_scores_gemma":[0.00067265506,0.00013703307,0.00020025008,0.00042699536,0.00015136373,0.00065871375,0.00022572304,0.00022754377,0.00023747854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020297599,0.00008085424,0.0020734956,0.00022302504,0.00004470278,0.00043258988,0.00020592226,0.18414432,0.27490497,0.009611229,0.0019105374,0.5261653],"study_design_scores_gemma":[0.00007063975,0.0005383301,0.003045055,0.000034071694,0.000079028076,0.0009971188,0.00010018833,0.665239,0.3016724,0.012871793,0.015317747,0.000034659504],"about_ca_topic_score_codex":0.00046800924,"about_ca_topic_score_gemma":0.0014843894,"teacher_disagreement_score":0.0015841646,"about_ca_system_score_codex":0.00022627467,"about_ca_system_score_gemma":0.00026696207,"threshold_uncertainty_score":0.005299568},"labels":[],"label_agreement":null},{"id":"W1481821439","doi":"10.1109/fpt.2002.1188685","title":"Synthesizing datapath circuits for FPGAs with emphasis on area minimization","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datapath; Computer science; Field-programmable gate array; Overhead (engineering); Reconfigurability; Routing (electronic design automation); Algorithm; Parallel computing; High-level synthesis; Logic synthesis; Minification; Logic gate; Computer hardware; Embedded system; Telecommunications","score_opus":0.026393417415445077,"score_gpt":0.21226093705659838,"score_spread":0.1858675196411533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481821439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083588876,0.00048980786,0.907522,0.00013149148,0.00007162395,0.00021976391,0.00022827086,0.0011231869,0.0066250623],"genre_scores_gemma":[0.35200915,0.0007453323,0.64161813,0.00016396357,0.000041270647,0.00018654947,0.0006298729,0.0001558682,0.004449827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999136,0.000011225009,0.000008594841,0.000016094225,0.000035997327,0.000014575462],"domain_scores_gemma":[0.99983454,0.0000620571,0.00002565716,0.000028438888,0.00004253492,0.000006732788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013479096,0.000480319,0.00015775423,0.00042802704,0.00024538,0.00035706168,0.00036591463,0.0001817909,0.0015926082],"category_scores_gemma":[0.00050669484,0.00018576166,0.0002935785,0.00048471944,0.00020787735,0.00053618895,0.00018104156,0.00024644283,0.00042705948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017565223,0.00010036655,0.0018296638,0.0007398243,0.00008144629,0.00043619948,0.00021132754,0.11621634,0.31534564,0.033618014,0.004024299,0.5272212],"study_design_scores_gemma":[0.00013706637,0.0010685337,0.0030678494,0.00009626585,0.00016931079,0.000958118,0.0001886864,0.46031532,0.4451383,0.034149077,0.054667715,0.000043716056],"about_ca_topic_score_codex":0.0011266319,"about_ca_topic_score_gemma":0.0030479494,"teacher_disagreement_score":0.0015926082,"about_ca_system_score_codex":0.00033655504,"about_ca_system_score_gemma":0.00049245945,"threshold_uncertainty_score":0.005327821},"labels":[],"label_agreement":null},{"id":"W1487603704","doi":"10.1109/fpt.2003.1275743","title":"Placement and routing for FPGA architectures supporting wide shallow memories","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; Block (permutation group theory); Routing (electronic design automation); Overhead (engineering); Embedded system; Logic block; Parallel computing; Computer architecture; Computer hardware; Operating system","score_opus":0.00990387147175848,"score_gpt":0.23488831309120417,"score_spread":0.2249844416194457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487603704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32339478,0.00058034644,0.6669967,0.0001543089,0.000037649348,0.00006610837,0.00009039778,0.0012077615,0.007471939],"genre_scores_gemma":[0.6300425,0.00032928726,0.36608618,0.00004334965,0.000013514031,0.000036156005,0.00013570566,0.00003800339,0.003275363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999298,0.000015454465,0.0000070735796,0.000010415819,0.00002389939,0.000013447332],"domain_scores_gemma":[0.9998528,0.000050235773,0.000033347955,0.000032191452,0.00002065482,0.000010737675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012516852,0.00022037259,0.00014265803,0.000279441,0.00016348637,0.0003194642,0.00039345777,0.00017958824,0.0014235162],"category_scores_gemma":[0.00034888185,0.00014086106,0.000109503366,0.00029534096,0.0001657452,0.00039271882,0.0002670672,0.00017791352,0.0003052878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000370262,0.00005667829,0.0029978196,0.00025385973,0.00004187062,0.0003942971,0.00017705557,0.18153931,0.13798298,0.024676425,0.0036565508,0.64785284],"study_design_scores_gemma":[0.00014245474,0.0008127125,0.0039471486,0.00005587974,0.00007001054,0.00072977424,0.00023017895,0.8355179,0.10464867,0.029439416,0.024364272,0.000041503845],"about_ca_topic_score_codex":0.001226726,"about_ca_topic_score_gemma":0.004091947,"teacher_disagreement_score":0.0014235162,"about_ca_system_score_codex":0.00028573224,"about_ca_system_score_gemma":0.0004126272,"threshold_uncertainty_score":0.004762113},"labels":[],"label_agreement":null},{"id":"W1489478894","doi":"10.1007/978-3-540-72586-2_37","title":"Formal Verification of Analog and Mixed Signal Designs in Mathematica","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Computer science; Formal verification; Stability (learning theory); SIGNAL (programming language); Theoretical computer science; Algorithm; Programming language","score_opus":0.029025233853063846,"score_gpt":0.24249520464161056,"score_spread":0.2134699707885467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489478894","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057045044,0.00051738176,0.9786347,0.00059083133,0.00015067455,0.000053995253,0.0001725207,0.00073631434,0.013439015],"genre_scores_gemma":[0.37743124,0.0009116589,0.60866165,0.0004373324,0.0002669851,0.00027894022,0.0004514963,0.00044831506,0.011112382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752647,0.0009693085,0.00020348874,0.00027006873,0.00089914375,0.00013161018],"domain_scores_gemma":[0.99563,0.0029927676,0.00018711908,0.0006076095,0.00052492606,0.000057537516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033176579,0.0007793197,0.0007225888,0.0009918564,0.0008630444,0.0024343738,0.0019038289,0.00084400404,0.007972736],"category_scores_gemma":[0.009085093,0.0007981753,0.0019340373,0.0007403102,0.002933031,0.004168916,0.0016530164,0.0027636609,0.0016681149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050888324,0.000032166317,0.00014377748,0.00019088664,0.000025020403,0.00006993575,0.00016909103,0.01891627,0.0018759862,0.95039284,0.0019310368,0.026202137],"study_design_scores_gemma":[0.000043515745,0.000022651757,0.00008475025,0.000064799446,0.00002347606,0.00005791494,0.000028034692,0.083596304,0.0028338768,0.89856595,0.014660202,0.000018605482],"about_ca_topic_score_codex":0.001674141,"about_ca_topic_score_gemma":0.0017083812,"teacher_disagreement_score":0.007972736,"about_ca_system_score_codex":0.001552875,"about_ca_system_score_gemma":0.0012160966,"threshold_uncertainty_score":0.02667147},"labels":[],"label_agreement":null},{"id":"W1491808832","doi":"10.1007/3-540-46117-5_16","title":"On Optimum Designs of Universal Switch Blocks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"USB; Routing (electronic design automation); Computer science; Field-programmable gate array; Crossbar switch; Topology (electrical circuits); Router; Disjoint sets; Block (permutation group theory); Parallel computing; Embedded system; Discrete mathematics; Mathematics; Combinatorics; Computer network; Telecommunications; Software; Operating system","score_opus":0.0181107179656469,"score_gpt":0.21278239772383703,"score_spread":0.19467167975819014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491808832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034872904,0.0037494928,0.9367348,0.0001741224,0.000119804914,0.00007573547,0.00013684815,0.0007760176,0.023360323],"genre_scores_gemma":[0.3665711,0.0034310985,0.6185509,0.00019676858,0.00017337497,0.00018619622,0.00027647003,0.00029929308,0.010314869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.00018485374,0.0000452899,0.00009546377,0.00020938004,0.0001001815],"domain_scores_gemma":[0.99947566,0.0003092658,0.00004957473,0.00008149316,0.00006991064,0.000014123435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006853199,0.0007292836,0.0007316484,0.000732084,0.0003614243,0.0009019128,0.0010040404,0.0005047238,0.008046593],"category_scores_gemma":[0.0018784041,0.00070622383,0.0005076569,0.00080414914,0.0004121794,0.0012758437,0.00063442957,0.0007454899,0.0012016332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007406611,0.00007665156,0.0005076208,0.0007709205,0.00009688501,0.00009677752,0.00021249308,0.13925435,0.050452396,0.25184253,0.00782377,0.54812497],"study_design_scores_gemma":[0.00032771286,0.0007807356,0.0010011764,0.00034041065,0.00025373875,0.00068464654,0.00011607177,0.5903847,0.052642345,0.28682667,0.066573046,0.00006860851],"about_ca_topic_score_codex":0.0004783253,"about_ca_topic_score_gemma":0.0015055736,"teacher_disagreement_score":0.008046593,"about_ca_system_score_codex":0.00074591633,"about_ca_system_score_gemma":0.00056364684,"threshold_uncertainty_score":0.02691853},"labels":[],"label_agreement":null},{"id":"W1495668040","doi":"10.1109/iwsoc.2004.9","title":"A fully automated approach for analog circuit reuse","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Parasitic extraction; Computer science; Matching (statistics); Reuse; Electronic engineering; Electronic design automation; Computer engineering; Engineering; Embedded system","score_opus":0.02889572553905778,"score_gpt":0.2860026249815629,"score_spread":0.25710689944250514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495668040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021208818,0.00013451157,0.99030566,0.00006809146,0.000019207251,0.00006385989,0.00008215246,0.0043269945,0.0028785819],"genre_scores_gemma":[0.12632349,0.00030768756,0.8636463,0.0001625479,0.000043227035,0.0001792632,0.00059514935,0.00090972753,0.007832465],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883455,0.00019952003,0.00006466449,0.0002759875,0.00050483836,0.000120404424],"domain_scores_gemma":[0.99871886,0.00032076798,0.00005029762,0.0007321744,0.0001570501,0.000020956051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049953145,0.0010955256,0.0007401747,0.0012174834,0.0007565641,0.0014389203,0.0017917652,0.00061728567,0.01137928],"category_scores_gemma":[0.001702848,0.0005023676,0.0014436686,0.000774434,0.00088566693,0.0017851033,0.0020636467,0.0010720652,0.0033308181],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014214416,0.00009530411,0.0004088198,0.00030721183,0.000106004656,0.00023293006,0.00023947365,0.030144082,0.053291716,0.05128496,0.006561028,0.85718644],"study_design_scores_gemma":[0.00014389587,0.00029583267,0.001014857,0.00014221278,0.00017160518,0.001299626,0.00022823254,0.49120164,0.13366161,0.21823615,0.15346771,0.00013663394],"about_ca_topic_score_codex":0.002178617,"about_ca_topic_score_gemma":0.0030507194,"teacher_disagreement_score":0.01137928,"about_ca_system_score_codex":0.0006467914,"about_ca_system_score_gemma":0.001237543,"threshold_uncertainty_score":0.03806746},"labels":[],"label_agreement":null},{"id":"W1506142730","doi":"10.1109/fpl.2005.1515716","title":"Measuring and utilizing the correlation between signal connectivity and signal positioning for FPGAs containing multi-bit building blocks","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Logic block; Computer science; Routing (electronic design automation); Block (permutation group theory); Computer hardware; SIGNAL (programming language); Digital signal processing; Process (computing); Computer architecture; Embedded system; Parallel computing","score_opus":0.04143324172942033,"score_gpt":0.25040704558706095,"score_spread":0.2089738038576406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506142730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8045945,0.00027782924,0.19137736,0.00008295762,0.00002509382,0.00004502609,0.00007809351,0.0006201127,0.002899027],"genre_scores_gemma":[0.96599036,0.000083733205,0.033568162,0.000017722912,0.0000058014098,0.000015559277,0.000042874875,0.000016978822,0.00025891652],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997085,0.00007705075,0.000011701329,0.00005033488,0.00012329384,0.000029114928],"domain_scores_gemma":[0.99885917,0.0005895646,0.00027860975,0.000103678445,0.00013841887,0.00003055484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031481593,0.00029495655,0.00014598794,0.0008468191,0.0002197972,0.00036734153,0.00031788315,0.00030334017,0.00083597767],"category_scores_gemma":[0.0017125313,0.00017686821,0.00008242419,0.0007091042,0.00027755953,0.00062737725,0.00020317265,0.0002540079,0.00016668344],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006948341,0.00018864013,0.041475907,0.0002912521,0.000065148655,0.00073930575,0.0003623694,0.05424904,0.69034976,0.006970463,0.0005675995,0.20404562],"study_design_scores_gemma":[0.000054307522,0.0023344927,0.06302153,0.00003770478,0.00010290132,0.0018919836,0.00018367161,0.34362584,0.5840066,0.0016451647,0.0030168833,0.000078966805],"about_ca_topic_score_codex":0.00045737677,"about_ca_topic_score_gemma":0.0012392717,"teacher_disagreement_score":0.0008468191,"about_ca_system_score_codex":0.00035759207,"about_ca_system_score_gemma":0.00023404698,"threshold_uncertainty_score":0.00279665},"labels":[],"label_agreement":null},{"id":"W1506990881","doi":"","title":"Search for quasi-optimal current return paths in a composite environment","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Fuselage; Ground; Computer science; Lightning (connector); Composite number; Lightning strike; Current (fluid); Set (abstract data type); Path (computing); Reliability engineering; Engineering; Electrical engineering; Aerospace engineering; Computer network; Algorithm","score_opus":0.02353851625463755,"score_gpt":0.23498265044788272,"score_spread":0.21144413419324518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506990881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21698023,0.0003912974,0.7729082,0.00045172137,0.000039874514,0.000052695388,0.00010883983,0.0005791766,0.00848799],"genre_scores_gemma":[0.78000116,0.00023622082,0.21456844,0.00008109266,0.00003337622,0.000057625613,0.000110727364,0.00013649213,0.0047750035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998411,0.0000380448,0.0000049837145,0.000034339522,0.000042059142,0.000039374172],"domain_scores_gemma":[0.9984804,0.0011630917,0.000100423866,0.000056264922,0.00012945544,0.00007035752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005897167,0.00057799474,0.00082560873,0.00076813076,0.00049491593,0.001052134,0.00084754714,0.0010748683,0.0046177027],"category_scores_gemma":[0.0030551504,0.00051701564,0.00035302676,0.0006316162,0.0007394179,0.0012847595,0.000903001,0.0006375457,0.0003849989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005165884,0.00008058491,0.0006403426,0.00013708361,0.000040658368,0.00016203032,0.0000932321,0.94164735,0.005927481,0.01753567,0.0012123926,0.03200665],"study_design_scores_gemma":[0.000041190364,0.000115750954,0.00013573565,0.000006627614,0.000011716092,0.00004083803,0.000033624783,0.9868175,0.001402157,0.010985209,0.000403192,0.000006465953],"about_ca_topic_score_codex":0.0011301027,"about_ca_topic_score_gemma":0.0013931845,"teacher_disagreement_score":0.0046177027,"about_ca_system_score_codex":0.000504173,"about_ca_system_score_gemma":0.00075661414,"threshold_uncertainty_score":0.015447736},"labels":[],"label_agreement":null},{"id":"W1508131846","doi":"","title":"Modeling of flip chip bump patterns to minimize crosstalk on a BU-BGA package design.","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada)","funders":"","keywords":"Flip chip; Ball grid array; Crosstalk; Chip-scale package; Computer science; Interconnection; Package design; Package on package; Integrated circuit design; Die (integrated circuit); Integrated circuit packaging; Electronic engineering; Chip; Embedded system; Computer architecture; Engineering; Electrical engineering; Engineering drawing; Materials science; Telecommunications; Operating system; Soldering","score_opus":0.027331205766830045,"score_gpt":0.2419917204332337,"score_spread":0.21466051466640365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508131846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057000328,0.00034346053,0.91337365,0.00017411345,0.00007169602,0.00007825793,0.00041298833,0.001459662,0.027085904],"genre_scores_gemma":[0.7151427,0.00056559563,0.26983297,0.0001040432,0.000021434582,0.00023064093,0.0004698819,0.00045805037,0.013174743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991524,0.000023411663,0.0000024118126,0.000009905523,0.00003841056,0.0000106733605],"domain_scores_gemma":[0.9999262,0.000020789143,0.000013043204,0.000014569046,0.000021416661,0.0000040097634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015818774,0.0005796443,0.00020293491,0.00022015942,0.00018189424,0.0004025691,0.00063864456,0.00052960665,0.0033020396],"category_scores_gemma":[0.00035508655,0.00032363666,0.00030970154,0.00023498142,0.00013840116,0.0003330961,0.0001464694,0.00029098918,0.0011263277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003359102,0.000026802507,0.00035410555,0.000086715416,0.000023469911,0.00007046612,0.000051695617,0.9268626,0.044710863,0.0113109825,0.0016560797,0.014812583],"study_design_scores_gemma":[0.000005199275,0.000043868327,0.0001931523,0.0000065952486,0.000012983849,0.000036180554,0.0000061482506,0.9866724,0.0080941105,0.0014330677,0.003491744,0.000004538938],"about_ca_topic_score_codex":0.0016903847,"about_ca_topic_score_gemma":0.0027703964,"teacher_disagreement_score":0.0033020396,"about_ca_system_score_codex":0.00032033277,"about_ca_system_score_gemma":0.00044944976,"threshold_uncertainty_score":0.01104641},"labels":[],"label_agreement":null},{"id":"W1522095270","doi":"10.1109/fpt.2003.1275756","title":"Performance-driven recursive multi-level clustering","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Netlist; Computer science; Benchmark (surveying); Field-programmable gate array; Parallel computing; Node (physics); Overhead (engineering); Algorithm; Minification; Cluster (spacecraft); Embedded system; Engineering; Artificial intelligence; Computer network","score_opus":0.038291347616171395,"score_gpt":0.23351299292682404,"score_spread":0.19522164531065264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522095270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0302345,0.00018049467,0.96294504,0.000110039524,0.000027458742,0.00007512701,0.000046398294,0.0023529888,0.004028045],"genre_scores_gemma":[0.41008487,0.00012182732,0.583655,0.000084653315,0.00002425927,0.00011972166,0.0003604248,0.00053568353,0.005013592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915445,0.000110736975,0.000035238634,0.00015174135,0.00041696773,0.00013081532],"domain_scores_gemma":[0.9991511,0.00016369572,0.00007786309,0.00026889282,0.00030143818,0.00003697155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045032307,0.0005776159,0.0005487436,0.00073063915,0.0006967955,0.00070415734,0.0018059278,0.0004683562,0.0025322107],"category_scores_gemma":[0.001917742,0.00030842598,0.00046651688,0.00072004605,0.00042986198,0.0009590649,0.0010718885,0.00071161677,0.0010461705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001786386,0.00010364016,0.0016040143,0.0001789897,0.00005780807,0.000099780096,0.00027806233,0.44242457,0.07219805,0.01832543,0.0057701273,0.45878085],"study_design_scores_gemma":[0.00001869529,0.00011738311,0.0007098331,0.000009199453,0.000021313785,0.0001313026,0.000038338665,0.94956833,0.035686105,0.005022748,0.008651278,0.00002548295],"about_ca_topic_score_codex":0.0022421277,"about_ca_topic_score_gemma":0.004813826,"teacher_disagreement_score":0.0025322107,"about_ca_system_score_codex":0.0011787978,"about_ca_system_score_gemma":0.0009950674,"threshold_uncertainty_score":0.008552849},"labels":[],"label_agreement":null},{"id":"W1525466953","doi":"10.1109/mwscas.2002.1187292","title":"Congestion based mathematical programming models for global routing","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Routing (electronic design automation); Flexibility (engineering); Computer science; Mathematical optimization; Channel (broadcasting); Multipath routing; Static routing; Distributed computing; Routing protocol; Computer network; Mathematics","score_opus":0.026407556137569087,"score_gpt":0.25168891983740815,"score_spread":0.22528136369983906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525466953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011184798,0.00034466322,0.99451303,0.00021740892,0.000029451003,0.00001551509,0.000037793125,0.000049288188,0.0036742713],"genre_scores_gemma":[0.34208944,0.0051036775,0.61264557,0.0007188949,0.00052640785,0.0010865051,0.0004406269,0.00040371696,0.036985204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991592,0.00031465624,0.00003120699,0.000121922014,0.0002837747,0.000089241745],"domain_scores_gemma":[0.9980714,0.0013794237,0.00016290105,0.00009795259,0.00023865087,0.000049770453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021282122,0.0015995267,0.000949043,0.00086457195,0.00051162695,0.0017298006,0.0017822888,0.0014053909,0.005387421],"category_scores_gemma":[0.0046785926,0.0007812205,0.0014869757,0.0013182297,0.0013116953,0.0034163422,0.0012378573,0.0038223134,0.0012955768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014994581,0.000023388806,0.000088174704,0.000067658395,0.000018572622,0.000053004238,0.000069029295,0.5651826,0.00045063763,0.42065462,0.002049363,0.011327954],"study_design_scores_gemma":[0.000005798169,0.00001550993,0.000024778983,0.000012464433,0.00000710824,0.000023138638,0.000011517825,0.8655862,0.0001491741,0.13069573,0.0034607747,0.000007788981],"about_ca_topic_score_codex":0.0019618818,"about_ca_topic_score_gemma":0.0017363143,"teacher_disagreement_score":0.005387421,"about_ca_system_score_codex":0.0014682399,"about_ca_system_score_gemma":0.0012673633,"threshold_uncertainty_score":0.018022716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009212084357099467,"score_gpt":0.2125116465322438,"score_spread":0.20329956217514433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525696892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020775178,0.0009309918,0.9937757,0.000092201204,0.000043128366,0.00007191848,0.00002146818,0.000306218,0.002680823],"genre_scores_gemma":[0.10242322,0.002915608,0.8913036,0.00011956864,0.000121161895,0.00022599504,0.000193642,0.0002909068,0.0024063967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.00039326982,0.00008569988,0.0002264192,0.00036460487,0.000102948194],"domain_scores_gemma":[0.9989126,0.00050380477,0.00010428832,0.00031455606,0.00013072268,0.00003398142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013352578,0.0011241013,0.0009591294,0.0006460937,0.00035683997,0.0013715632,0.0011720551,0.0007268036,0.0013870893],"category_scores_gemma":[0.0026418336,0.0007831839,0.00065301097,0.0009970024,0.0013881737,0.0015402458,0.0011435944,0.0012693801,0.0004826806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085117514,0.000041339525,0.00058506074,0.0006501136,0.000057211608,0.00015367671,0.00026790096,0.35243338,0.012777469,0.13946505,0.0021871768,0.4912966],"study_design_scores_gemma":[0.00006824619,0.00028528864,0.0019462744,0.00029851042,0.0001119081,0.0007018124,0.00014061181,0.6934116,0.020927176,0.22288759,0.059142154,0.00007887802],"about_ca_topic_score_codex":0.0018826026,"about_ca_topic_score_gemma":0.0023379137,"teacher_disagreement_score":0.0018826026,"about_ca_system_score_codex":0.0006936963,"about_ca_system_score_gemma":0.0017914625,"threshold_uncertainty_score":0.0070616603},"labels":[],"label_agreement":null},{"id":"W1531949859","doi":"10.1109/icm.2004.1434259","title":"A genetic local search hybrid architecture for VLSI circuit partitioning","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Very-large-scale integration; Computer science; Speedup; Genetic algorithm; Computer architecture; Parallel computing; Software; Computer engineering; Embedded system","score_opus":0.015238657689246616,"score_gpt":0.22280336025368694,"score_spread":0.20756470256444032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531949859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058349863,0.0004582574,0.93082637,0.00015316697,0.000045974284,0.000078493686,0.000032098193,0.0014183561,0.008637427],"genre_scores_gemma":[0.41336372,0.00025137624,0.5797866,0.0001427779,0.000027897046,0.00018211381,0.00010925667,0.000078568046,0.00605772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998865,0.000028437627,0.0000033585181,0.000018424735,0.000051096136,0.00001213532],"domain_scores_gemma":[0.9999418,0.000019488778,0.00000765114,0.000010494735,0.000016079477,0.00000444439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017645198,0.00028182118,0.00025239697,0.00048073442,0.00023525892,0.00033596982,0.00076418533,0.0004540815,0.0017455766],"category_scores_gemma":[0.0002644526,0.00014320551,0.00027358602,0.0005050922,0.0002771671,0.00027259762,0.0002525917,0.0002861679,0.0004562013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013240457,0.000117340765,0.0006255214,0.000094234536,0.000093571936,0.00015086535,0.00009624989,0.56005764,0.08177345,0.019514175,0.0025857005,0.33475888],"study_design_scores_gemma":[0.000039624156,0.00013955725,0.00031585695,0.0000067477145,0.00002185182,0.00010461421,0.000012964838,0.9854542,0.0070509417,0.0026075414,0.0042352513,0.00001082276],"about_ca_topic_score_codex":0.002508332,"about_ca_topic_score_gemma":0.0046062367,"teacher_disagreement_score":0.002508332,"about_ca_system_score_codex":0.000431098,"about_ca_system_score_gemma":0.0003629456,"threshold_uncertainty_score":0.0058395267},"labels":[],"label_agreement":null},{"id":"W1536432301","doi":"10.1007/s00453-001-0050-6","title":"Grade of Service Steiner Minimum Trees in the Euclidean Plane","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Approximation algorithm; Generalization; Path (computing); Spanning tree; Terminal (telecommunication); Discrete mathematics; Point (geometry); Computer science; Geometry","score_opus":0.015221349186748603,"score_gpt":0.22216447856601942,"score_spread":0.2069431293792708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536432301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48076022,0.0010532805,0.48102304,0.0010251566,0.000079901394,0.00008147825,0.0009089984,0.00059273944,0.034475215],"genre_scores_gemma":[0.8571574,0.0009312281,0.12989062,0.00008067697,0.00003778492,0.000046324996,0.0007254795,0.00013726376,0.010993203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999694,0.000076406584,0.000025713465,0.00003565232,0.0001096669,0.000058599726],"domain_scores_gemma":[0.9994481,0.00018807252,0.00011858759,0.000078675024,0.00011646681,0.000050034792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039626,0.0003446478,0.0005918615,0.0007661723,0.00043248982,0.0016116942,0.00068168156,0.00062050094,0.004189065],"category_scores_gemma":[0.0019211841,0.00024527172,0.0002600188,0.001360803,0.00033601563,0.0017338904,0.00063478213,0.00056459295,0.00088383246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011140081,0.00011775352,0.0041034943,0.00039787663,0.00006355949,0.00035340257,0.00040067188,0.21567568,0.01547697,0.51668143,0.012896672,0.23271842],"study_design_scores_gemma":[0.00013779676,0.00040158458,0.002970539,0.00007328318,0.00006480127,0.0007457443,0.00046300673,0.47698373,0.011026993,0.48555356,0.021541934,0.000037023743],"about_ca_topic_score_codex":0.0011792667,"about_ca_topic_score_gemma":0.002665211,"teacher_disagreement_score":0.004189065,"about_ca_system_score_codex":0.00080903934,"about_ca_system_score_gemma":0.00052774645,"threshold_uncertainty_score":0.014013827},"labels":[],"label_agreement":null},{"id":"W1552511991","doi":"10.1007/978-3-540-30205-6_7","title":"Crosstalk Cancellation for Realistic PCB Buses","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Crosstalk; Bandwidth (computing); Electronic engineering; Linear programming; Algorithm; Telecommunications; Engineering","score_opus":0.017302427688834044,"score_gpt":0.24195073129676462,"score_spread":0.22464830360793056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552511991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028723732,0.0008292872,0.8629723,0.00028823514,0.00030903364,0.00006001424,0.000119610435,0.0015567215,0.105141014],"genre_scores_gemma":[0.6788942,0.0015136991,0.23302867,0.0002997999,0.00021884247,0.00008531773,0.0004432547,0.0007080023,0.08480817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973947,0.00005216322,0.000008703758,0.000034838446,0.00012599428,0.00003890255],"domain_scores_gemma":[0.99955064,0.00020235464,0.000043515556,0.00008743929,0.000098774515,0.000017266295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030216743,0.000772076,0.00033987904,0.00044511893,0.00042274964,0.0007966088,0.00072376966,0.00057662796,0.010706023],"category_scores_gemma":[0.0015222273,0.00034683524,0.0003733117,0.00052776205,0.00036511474,0.00088360556,0.00037652784,0.000721503,0.0020863425],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005328174,0.00018474238,0.0005971041,0.00091428956,0.000076645796,0.000733742,0.0002721461,0.31081328,0.18881185,0.2627717,0.022559796,0.21173188],"study_design_scores_gemma":[0.00006132712,0.00036541896,0.00057788164,0.00013411192,0.000084112835,0.0013402913,0.00008978116,0.79953015,0.07343074,0.08374905,0.0405825,0.00005462772],"about_ca_topic_score_codex":0.0005833702,"about_ca_topic_score_gemma":0.0013398661,"teacher_disagreement_score":0.010706023,"about_ca_system_score_codex":0.0006209388,"about_ca_system_score_gemma":0.0003555435,"threshold_uncertainty_score":0.03581524},"labels":[],"label_agreement":null},{"id":"W1565289258","doi":"10.1023/a:1014847925683","title":"A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics","score_opus":0.012512469230286226,"score_gpt":0.2189235804871578,"score_spread":0.20641111125687156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565289258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018368999,0.000093796225,0.9953992,0.00008604,0.00007067852,0.000022698883,0.000024846913,0.00025045243,0.0022155298],"genre_scores_gemma":[0.038458884,0.00034942597,0.952703,0.00013139164,0.00016722146,0.00011589533,0.00012732873,0.0003668951,0.0075799427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.00016277184,0.000029211476,0.00008264679,0.000253943,0.000053341897],"domain_scores_gemma":[0.9992575,0.0003612708,0.000051700667,0.00010568088,0.0001702185,0.00005357297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006232119,0.001257392,0.00077325443,0.0011990886,0.00086056395,0.00075852184,0.001175771,0.00072322675,0.009142227],"category_scores_gemma":[0.0026366324,0.00056435534,0.00083420984,0.001859595,0.0006921867,0.0017181507,0.001559858,0.0016483951,0.0026964121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002061941,0.0002609699,0.0005598942,0.00035396565,0.00008492214,0.00025218417,0.00019804564,0.10674984,0.056957543,0.22710092,0.019634005,0.5876415],"study_design_scores_gemma":[0.00010060113,0.00019509124,0.00034318792,0.000044626922,0.00005149682,0.00045099977,0.00007698452,0.8166252,0.012743404,0.14247006,0.026849197,0.000049231578],"about_ca_topic_score_codex":0.0013844168,"about_ca_topic_score_gemma":0.0043506837,"teacher_disagreement_score":0.009142227,"about_ca_system_score_codex":0.00032513004,"about_ca_system_score_gemma":0.0008745831,"threshold_uncertainty_score":0.030583799},"labels":[],"label_agreement":null},{"id":"W1566266975","doi":"10.1109/sbac-pad.2004.18","title":"Graph Partitioning with the Party Library: Helpful-Sets in Practice","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Graph; Partition (number theory); Theoretical computer science; Heuristic; Permutation (music); Algorithm; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.00670996929657694,"score_gpt":0.20202801468888962,"score_spread":0.19531804539231268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566266975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16436863,0.0008364606,0.7225856,0.0006354627,0.00012941801,0.0006077212,0.0015384572,0.05564058,0.053657632],"genre_scores_gemma":[0.28711978,0.0004948503,0.69456863,0.00024213362,0.000032408152,0.00040971747,0.0024695862,0.0053752516,0.009287713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977609,0.00069236563,0.0001448884,0.00023031447,0.0009532851,0.00021819072],"domain_scores_gemma":[0.9928392,0.0034433673,0.00028562653,0.0025613396,0.0007304156,0.00014006616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021523212,0.0010392878,0.0008458195,0.0017593865,0.0008329489,0.0016219328,0.003384668,0.0016982228,0.013771681],"category_scores_gemma":[0.01151731,0.00081056374,0.00068116985,0.0026710301,0.0008153621,0.0039105937,0.0018262654,0.0013348616,0.0033923343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020337857,0.0010168947,0.0037636147,0.0011767696,0.000107544576,0.00031649772,0.00060308893,0.13931392,0.026414558,0.050770175,0.03424161,0.7402416],"study_design_scores_gemma":[0.0005308338,0.001132155,0.0023065396,0.00014436757,0.00014042729,0.0009052585,0.00045577352,0.76072174,0.104818664,0.050048884,0.07869545,0.00009998238],"about_ca_topic_score_codex":0.002535285,"about_ca_topic_score_gemma":0.0060801525,"teacher_disagreement_score":0.013771681,"about_ca_system_score_codex":0.0011538095,"about_ca_system_score_gemma":0.001303403,"threshold_uncertainty_score":0.046070874},"labels":[],"label_agreement":null},{"id":"W1569525708","doi":"10.1109/fpt.2002.1188686","title":"The effect of cluster packing and node duplication control in delay driven clustering","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Cluster analysis; Node (physics); Cluster (spacecraft); Set (abstract data type); Algorithm; Degradation (telecommunications); Logic gate; Parallel computing; Cluster size; Computer network; Engineering; Artificial intelligence","score_opus":0.00350512009967066,"score_gpt":0.20304698058741644,"score_spread":0.19954186048774578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569525708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8812299,0.0006701284,0.11426474,0.00018379142,0.000058652186,0.0000740956,0.00003678248,0.00089525257,0.0025866434],"genre_scores_gemma":[0.9557367,0.00010394842,0.043412957,0.0000540988,0.0000174918,0.000016812974,0.000035144298,0.000052038267,0.0005706517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00019776198,0.000058320566,0.000111190515,0.00025382827,0.00010347012],"domain_scores_gemma":[0.9962637,0.0022635865,0.00046439664,0.00042916808,0.00043178338,0.00014738206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007731822,0.00050008006,0.0002765684,0.00053924957,0.00041150546,0.0004941749,0.0010911215,0.00054338214,0.0005758694],"category_scores_gemma":[0.0052907136,0.0003543414,0.000205107,0.0008663594,0.00044344034,0.0010698426,0.00040824292,0.00027381303,0.00011194732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018419222,0.0004947899,0.007315137,0.00020070818,0.00012426615,0.00035822782,0.00030033043,0.53804,0.18467765,0.0058964333,0.0012733241,0.2594772],"study_design_scores_gemma":[0.00014919469,0.0015570918,0.004361715,0.000015462412,0.00011399045,0.0004916469,0.00009878137,0.7397058,0.249994,0.0017433821,0.0017219163,0.000047032005],"about_ca_topic_score_codex":0.0020498966,"about_ca_topic_score_gemma":0.002754912,"teacher_disagreement_score":0.0020498966,"about_ca_system_score_codex":0.0008608178,"about_ca_system_score_gemma":0.00066748046,"threshold_uncertainty_score":0.0062457323},"labels":[],"label_agreement":null},{"id":"W1570456368","doi":"10.1109/ccece.2001.933590","title":"An efficient rectilinear Steiner tree algorithm for VLSI global routing","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Very-large-scale integration; Heuristics; Computer science; Algorithm; Tree (set theory); Spanning tree; Integrated circuit layout; Mathematics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Integrated circuit; Computer network","score_opus":0.015681855594630686,"score_gpt":0.23717898243789454,"score_spread":0.22149712684326384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570456368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012347795,0.00054563,0.9818827,0.00016178442,0.000029593515,0.000073165764,0.0002286573,0.0012005114,0.003530123],"genre_scores_gemma":[0.06360963,0.00032827284,0.9321579,0.000043382028,0.000014006448,0.00009393728,0.0006931381,0.00014444729,0.00291523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997826,0.000056756133,0.000017077107,0.000049423103,0.000067262874,0.00002691024],"domain_scores_gemma":[0.9998492,0.000051599774,0.000017146082,0.000035730634,0.000037762504,0.000008448218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027435238,0.0006561511,0.00060637615,0.00072754687,0.00041230576,0.00046813124,0.00068327796,0.00053361704,0.004639753],"category_scores_gemma":[0.00063979084,0.00040654925,0.00057213,0.0012228523,0.00026998372,0.0012924463,0.0006394144,0.0005103593,0.0014431346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023662059,0.0000665963,0.000465112,0.0002673276,0.000059836122,0.00015915115,0.00014857172,0.33823323,0.021859156,0.034005553,0.016072314,0.5884266],"study_design_scores_gemma":[0.00009831089,0.00015681911,0.00032387988,0.000020069818,0.000024340105,0.00020965292,0.00004322638,0.95092666,0.00538922,0.024914363,0.017870069,0.000023437002],"about_ca_topic_score_codex":0.0021721097,"about_ca_topic_score_gemma":0.0045499695,"teacher_disagreement_score":0.004639753,"about_ca_system_score_codex":0.0004730988,"about_ca_system_score_gemma":0.0008328278,"threshold_uncertainty_score":0.015521467},"labels":[],"label_agreement":null},{"id":"W1590281904","doi":"10.1109/fccm.2015.33","title":"Measuring the Accuracy of Minimum Width Transistor Area in Estimating FPGA Layout Area","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Lookup table; Computer science; Field-programmable gate array; Transistor; Process (computing); Electronic engineering; Computer hardware; Electrical engineering; Multiplexing; Engineering; Voltage; Telecommunications","score_opus":0.0735690504194493,"score_gpt":0.2430810140555435,"score_spread":0.1695119636360942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590281904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5408385,0.0014450806,0.44874588,0.0001333799,0.00008617182,0.00004113634,0.00076822535,0.0026970373,0.0052445205],"genre_scores_gemma":[0.9299823,0.00036766287,0.068596914,0.000022701428,0.000009262402,0.00002237609,0.00029399036,0.00012530209,0.00057948765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.00036281464,0.00008962727,0.00019320223,0.000511298,0.00008202657],"domain_scores_gemma":[0.9902698,0.0064663016,0.0009442458,0.0013170872,0.0009198837,0.000082666134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001229985,0.0006259549,0.00036820633,0.0014947975,0.00023592246,0.0009681525,0.0007715774,0.00062625326,0.0013387512],"category_scores_gemma":[0.01188562,0.0003459931,0.0004501171,0.0008763958,0.00023916137,0.0016933735,0.00049551635,0.00035192573,0.0006554992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005325357,0.00010136363,0.069249526,0.00045476272,0.00025257174,0.0002879705,0.00032177923,0.5745838,0.11903271,0.0045099254,0.0009608289,0.22971222],"study_design_scores_gemma":[0.0000149889665,0.00059128116,0.02322072,0.000086401684,0.00009040426,0.0006498321,0.00019237323,0.86163646,0.10758182,0.0026493785,0.0032087902,0.00007755617],"about_ca_topic_score_codex":0.001466006,"about_ca_topic_score_gemma":0.0032112356,"teacher_disagreement_score":0.0014947975,"about_ca_system_score_codex":0.000396884,"about_ca_system_score_gemma":0.0003502467,"threshold_uncertainty_score":0.0065048933},"labels":[],"label_agreement":null},{"id":"W1598286413","doi":"10.1002/9780470932025.ch14","title":"Case Study: Multirate Decimators and Interpolators","year":2011,"lang":"en","type":"other","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Polyphase system; Mathematics; Graph; Implementation; Algorithm; Arithmetic; Computer science; Discrete mathematics; Electronic engineering; Engineering; Programming language","score_opus":0.018275716998225725,"score_gpt":0.22559755946600518,"score_spread":0.20732184246777946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598286413","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55519354,0.0023526875,0.21457458,0.0013937136,0.0003662715,0.0004059119,0.0008666253,0.003026448,0.22182024],"genre_scores_gemma":[0.8787936,0.00068823755,0.0705263,0.00020831561,0.00006455096,0.000067795554,0.00025281232,0.00019560615,0.049202815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939823,0.00011429474,0.000034559125,0.00007328765,0.00027753113,0.000101984246],"domain_scores_gemma":[0.9991142,0.00040360214,0.000068036905,0.0001727154,0.00018395297,0.000057496658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000495174,0.00066505995,0.0003386459,0.00061562995,0.0007780441,0.0013127432,0.0007002782,0.0014272261,0.01390521],"category_scores_gemma":[0.0019398513,0.0002378792,0.00037854913,0.0010175868,0.00039323,0.0014978638,0.0005536186,0.0006744402,0.0022140972],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031948544,0.0013980599,0.022190051,0.0014743701,0.00013852402,0.04605417,0.0016331061,0.19854134,0.065354824,0.12850153,0.030973908,0.5005452],"study_design_scores_gemma":[0.00040291273,0.0016942887,0.0112555185,0.00031979248,0.00025336564,0.033477623,0.0023795974,0.40190062,0.26099443,0.033642035,0.25351015,0.0001697542],"about_ca_topic_score_codex":0.0017562623,"about_ca_topic_score_gemma":0.0033621807,"teacher_disagreement_score":0.01390521,"about_ca_system_score_codex":0.0005034536,"about_ca_system_score_gemma":0.00044460283,"threshold_uncertainty_score":0.04651749},"labels":[],"label_agreement":null},{"id":"W1600237807","doi":"10.1109/ccece.2015.7129165","title":"Enhanced placement algorithm for FPGAs using sparse circuit","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Field-programmable gate array; Simulated annealing; Computer science; Placement; Logic block; Gate array; Logic synthesis; Logic gate; Block (permutation group theory); Parallel computing; Algorithm; Electronic engineering; Circuit design; Computer hardware; Physical design; Embedded system; Engineering; Mathematics","score_opus":0.07382310947229188,"score_gpt":0.27171638198452064,"score_spread":0.19789327251222877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600237807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01574748,0.00008336758,0.98195904,0.000045026347,0.00002342535,0.0000376169,0.00002506617,0.0004437758,0.001635216],"genre_scores_gemma":[0.1772128,0.00014784365,0.8193689,0.00004191396,0.000023051176,0.00008093125,0.00013939633,0.00005759401,0.0029276044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999032,0.000017320383,0.0000064827364,0.000017179435,0.00004354676,0.000012398594],"domain_scores_gemma":[0.9998944,0.000030435662,0.0000119206525,0.000018941164,0.00003902374,0.0000052969513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014475799,0.00032560932,0.00036724805,0.00039463447,0.00022593577,0.0002898114,0.00051789527,0.00036657017,0.0024045887],"category_scores_gemma":[0.00037691966,0.00021076085,0.0002838831,0.00044893185,0.00018686395,0.00035014085,0.00030233024,0.00033981667,0.00047974815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019455512,0.00006118535,0.0007284235,0.00018260942,0.000036277987,0.00019441008,0.0000998043,0.47622538,0.07847891,0.01957306,0.0034942077,0.4207312],"study_design_scores_gemma":[0.00003804421,0.00014010727,0.00033381427,0.000010356802,0.000012818076,0.00018959674,0.000013768717,0.98100626,0.01019658,0.0038235604,0.0042267777,0.000008283442],"about_ca_topic_score_codex":0.0013207034,"about_ca_topic_score_gemma":0.0024609517,"teacher_disagreement_score":0.0024045887,"about_ca_system_score_codex":0.00027357138,"about_ca_system_score_gemma":0.00044508054,"threshold_uncertainty_score":0.008044183},"labels":[],"label_agreement":null},{"id":"W1600592838","doi":"10.1007/978-3-540-24855-2_123","title":"An Island-Based GA Implementation for VLSI Standard-Cell Placement","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Speedup; Computer science; Asynchronous communication; Parallel computing; Very-large-scale integration; Scheme (mathematics); Convergence (economics); Computation; Algorithm; Embedded system; Mathematics; Telecommunications","score_opus":0.011983564087182179,"score_gpt":0.26375240782384834,"score_spread":0.2517688437366662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600592838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04061378,0.00024102934,0.9440368,0.00011216572,0.00013349627,0.00008351363,0.000065984495,0.0027301772,0.011983088],"genre_scores_gemma":[0.31998143,0.00013951986,0.6717407,0.00010657097,0.00001699878,0.000122038065,0.0001473691,0.00015643898,0.007588939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993026,0.000014491726,0.0000035667497,0.000010376047,0.000028811994,0.000012454938],"domain_scores_gemma":[0.99985874,0.000037641552,0.000007433071,0.000032027325,0.000053619777,0.000010593044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013056384,0.0003088547,0.00034914305,0.00035542998,0.00030290466,0.00036194664,0.0015684263,0.00052245805,0.005199017],"category_scores_gemma":[0.00037901962,0.00018615316,0.0002555884,0.00040665525,0.00016728467,0.0003259513,0.0003703854,0.0005460987,0.0009443761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025066154,0.00027402822,0.0007954977,0.0001753769,0.00009630686,0.00021286702,0.00013400335,0.34126174,0.104523204,0.020198496,0.0075677317,0.5245101],"study_design_scores_gemma":[0.000040864452,0.00013110177,0.0002359753,0.000011611334,0.00002953025,0.00009358329,0.000016947433,0.981205,0.011955398,0.0029539082,0.0033146518,0.000011424397],"about_ca_topic_score_codex":0.003416029,"about_ca_topic_score_gemma":0.010097639,"teacher_disagreement_score":0.005199017,"about_ca_system_score_codex":0.0003069098,"about_ca_system_score_gemma":0.0004727296,"threshold_uncertainty_score":0.017392457},"labels":[],"label_agreement":null},{"id":"W1601965867","doi":"","title":"Proceedings of the 2003 international workshop on System-level interconnect prediction","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interconnection; IBM; Computer science; Microarchitecture; Architecture; Chip; Field-programmable gate array; Computer architecture; Embedded system; Engineering; Telecommunications","score_opus":0.017311693925840015,"score_gpt":0.20437045416639313,"score_spread":0.18705876024055312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601965867","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040398628,0.04488201,0.7313146,0.03837895,0.027022218,0.0005495173,0.006431414,0.012470712,0.09855195],"genre_scores_gemma":[0.27719977,0.035810612,0.3928663,0.00911663,0.011925588,0.0011398047,0.03283571,0.0041883737,0.23491724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986639,0.0003728466,0.00010230076,0.00029080806,0.00043677032,0.00013344431],"domain_scores_gemma":[0.99639267,0.0013750249,0.00015653163,0.0007692357,0.0009609415,0.00034562201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032737262,0.0018144422,0.0016089956,0.0010357655,0.0009783854,0.0040545054,0.003194318,0.0021345539,0.027398292],"category_scores_gemma":[0.008758585,0.0010223303,0.0012075205,0.001420648,0.0011148889,0.0041146474,0.0019193791,0.003916501,0.009405021],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006621445,0.00037969643,0.0027767662,0.00041094475,0.0001675427,0.0005280174,0.00031764284,0.04513424,0.0033628412,0.027326856,0.58826715,0.33066612],"study_design_scores_gemma":[0.00012788415,0.0003595583,0.0029729083,0.00041758985,0.0001497079,0.0005876369,0.00030707655,0.26899552,0.0056499476,0.06432455,0.6560289,0.00007859645],"about_ca_topic_score_codex":0.005842212,"about_ca_topic_score_gemma":0.0075658257,"teacher_disagreement_score":0.027398292,"about_ca_system_score_codex":0.001745374,"about_ca_system_score_gemma":0.0022199177,"threshold_uncertainty_score":0.09165639},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005709059116641306,"score_gpt":0.18109443212711526,"score_spread":0.17538537301047397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607353855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019967891,0.00010586759,0.96549594,0.00020359781,0.00006386724,0.00012249718,0.00017024673,0.004228174,0.009641952],"genre_scores_gemma":[0.24884233,0.0001454608,0.743078,0.00009548572,0.0000329774,0.00019331407,0.00015326931,0.00042724182,0.0070319325],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956065,0.00003843698,0.000031480653,0.000048317885,0.00028504847,0.000036055866],"domain_scores_gemma":[0.9994848,0.00016694887,0.000055200093,0.00015724759,0.0001162772,0.000019592999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751322,0.00044449218,0.00030839333,0.00035844077,0.00033406643,0.000670967,0.0010592544,0.0006784578,0.008267843],"category_scores_gemma":[0.0013423248,0.00044510534,0.0002772337,0.00028768368,0.00024001708,0.00066838315,0.00042774156,0.000680953,0.0029820222],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025007143,0.00015481097,0.0008667383,0.00039800061,0.00004093614,0.0007092469,0.00021073574,0.22492108,0.41528922,0.06262378,0.008859896,0.28567547],"study_design_scores_gemma":[0.0001268024,0.0006397152,0.00061608286,0.0000296351,0.00003474644,0.0010210429,0.000052328447,0.6792749,0.24245034,0.0113044875,0.0643898,0.00006018213],"about_ca_topic_score_codex":0.00079781294,"about_ca_topic_score_gemma":0.001102296,"teacher_disagreement_score":0.008267843,"about_ca_system_score_codex":0.0003463074,"about_ca_system_score_gemma":0.0008685622,"threshold_uncertainty_score":0.027658701},"labels":[],"label_agreement":null},{"id":"W1608848694","doi":"10.1109/iscas.1995.521446","title":"Floorplanning with datapath optimization","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Datapath; Floorplan; Computer science; Routing (electronic design automation); High-level synthesis; Schedule; Network topology; Parallel computing; Placement; Critical path method; Path (computing); Field-programmable gate array; Mathematical optimization; Physical design; Embedded system; Engineering; Circuit design; Mathematics; Computer network","score_opus":0.011565315885679793,"score_gpt":0.15727271957349406,"score_spread":0.14570740368781426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608848694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038126744,0.00022692233,0.9921137,0.000051660485,0.00003289965,0.000051879793,0.000091066286,0.000510718,0.0031085499],"genre_scores_gemma":[0.15366301,0.00048412458,0.8395161,0.00011481609,0.00004495285,0.00029681093,0.00048105043,0.00037502893,0.0050240634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954945,0.00015151642,0.000020724368,0.00006763043,0.00015733951,0.00005330258],"domain_scores_gemma":[0.9995332,0.00028357946,0.0000472949,0.00005104706,0.00006649898,0.000018449658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000606708,0.0011417342,0.0006857132,0.0007507853,0.00035901184,0.0006268194,0.0006287349,0.00050255103,0.0055649118],"category_scores_gemma":[0.0014074215,0.00049046054,0.00087285397,0.0007794711,0.00057632354,0.0006155314,0.00065938017,0.00089375733,0.00088448834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023646826,0.000014935985,0.000117710304,0.00005993489,0.000015866328,0.000026636404,0.000017917831,0.94229704,0.0013570602,0.008535502,0.00078719907,0.046746556],"study_design_scores_gemma":[0.000023316908,0.000046644516,0.00008610912,0.000013725525,0.000013730631,0.000028183556,0.000010027665,0.9785857,0.0018489823,0.013833328,0.0055016,0.000008720407],"about_ca_topic_score_codex":0.00374772,"about_ca_topic_score_gemma":0.0048591974,"teacher_disagreement_score":0.0055649118,"about_ca_system_score_codex":0.0006465277,"about_ca_system_score_gemma":0.0010493806,"threshold_uncertainty_score":0.018616438},"labels":[],"label_agreement":null},{"id":"W1624781543","doi":"10.1109/ccece.2003.1226354","title":"A new partitioning method for LUT-based FPGAS","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Lookup table; Field-programmable gate array; Benchmark (surveying); Computer science; Combinational logic; Parallel computing; XOR gate; Boolean function; Programmable logic array; Electronic circuit; Path (computing); Gate array; Algorithm; Functional decomposition; Logic gate; Computer engineering; Computer hardware; Engineering","score_opus":0.01600305731224017,"score_gpt":0.27043342273614907,"score_spread":0.2544303654239089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624781543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006524055,0.0008611062,0.98720866,0.00006634786,0.0001333074,0.000057678,0.00004499007,0.00072754326,0.0043763435],"genre_scores_gemma":[0.085584216,0.0008658023,0.9063833,0.00009142676,0.00007263058,0.00011052452,0.00022351323,0.0001651154,0.006503505],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974066,0.00003578455,0.000023651062,0.000051027277,0.00012631842,0.000022645982],"domain_scores_gemma":[0.99983656,0.000044194072,0.000013541408,0.000044883393,0.000052885665,0.000007776674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017064775,0.0004851505,0.00031865327,0.00075267005,0.00029423868,0.0004178924,0.00061039714,0.00023797901,0.0032374233],"category_scores_gemma":[0.00047282514,0.0002449389,0.00037335797,0.0005062676,0.00026353917,0.00085714937,0.00042340538,0.0003651466,0.0010057555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011517092,0.000029208773,0.00034043423,0.00035652492,0.00004326198,0.00019528129,0.00018380127,0.0245268,0.13834652,0.039501064,0.0054306225,0.7909313],"study_design_scores_gemma":[0.00014818092,0.0005872135,0.0017408744,0.00017381877,0.00014413586,0.0028359918,0.00018037959,0.4575244,0.21254265,0.029171668,0.29478726,0.00016347755],"about_ca_topic_score_codex":0.00068127434,"about_ca_topic_score_gemma":0.0014165282,"teacher_disagreement_score":0.0032374233,"about_ca_system_score_codex":0.0003108487,"about_ca_system_score_gemma":0.00029396106,"threshold_uncertainty_score":0.010830283},"labels":[],"label_agreement":null},{"id":"W1636696700","doi":"10.1109/iscas.1999.780103","title":"VLSI concentric partitioning using interior point quadratic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quadratic programming; Very-large-scale integration; Quadratic equation; Mathematical optimization; Computer science; Fixed point; Point (geometry); Moment (physics); Boundary (topology); Algorithm; Mathematics; Parallel computing; Embedded system; Geometry; Mathematical analysis","score_opus":0.018500592423677846,"score_gpt":0.2361099254195097,"score_spread":0.21760933299583185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636696700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027489003,0.000103940816,0.9949964,0.00004257281,0.00001101923,0.000018292536,0.00001382978,0.00014010834,0.0019248172],"genre_scores_gemma":[0.14181766,0.00030538478,0.8527865,0.000081234255,0.00003632487,0.00016528368,0.00014323657,0.00016193661,0.004502418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948955,0.0001668567,0.000017675244,0.00006325427,0.0002190449,0.000043722543],"domain_scores_gemma":[0.99965966,0.00016499637,0.00003972872,0.000038932994,0.00008107518,0.000015730233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892354,0.0007505446,0.0008736786,0.00047383737,0.00035159494,0.0006503716,0.0010772331,0.00055617525,0.0025285387],"category_scores_gemma":[0.0011451168,0.00044173608,0.00056114275,0.00062988704,0.00052331435,0.0008065615,0.0009196632,0.00073061057,0.0008296991],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039617848,0.00003013941,0.00012972267,0.00009149937,0.000019344156,0.00004782887,0.000052210646,0.8902133,0.00507839,0.017566238,0.001698262,0.085033484],"study_design_scores_gemma":[0.0000083435825,0.000029544623,0.000028620341,0.0000045464876,0.0000030293938,0.000024598177,0.000006969064,0.99232167,0.0009162825,0.0047991937,0.0018538662,0.000003381751],"about_ca_topic_score_codex":0.0015916586,"about_ca_topic_score_gemma":0.002207995,"teacher_disagreement_score":0.0025285387,"about_ca_system_score_codex":0.00057092815,"about_ca_system_score_gemma":0.0008443153,"threshold_uncertainty_score":0.008458853},"labels":[],"label_agreement":null},{"id":"W1642572343","doi":"10.1007/3-540-70734-4_18","title":"A Local Refinement Algorithm for Data Partitioning","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Workload; Context (archaeology); Algorithm; Space partitioning; Graph partition; Parallel computing; Enhanced Data Rates for GSM Evolution; Metis; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03256385869187683,"score_gpt":0.25787329483221677,"score_spread":0.22530943614033994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642572343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021219903,0.00020181449,0.99490225,0.00004098128,0.000029552411,0.000048714952,0.000047983485,0.0011982255,0.0014083823],"genre_scores_gemma":[0.02477253,0.00016620397,0.97035295,0.000052456548,0.000020061787,0.00010664489,0.0002564113,0.00035944767,0.0039131944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995179,0.000074751406,0.00003417535,0.0000878691,0.00023891815,0.00004637739],"domain_scores_gemma":[0.9991842,0.00024820678,0.000031572054,0.0002879092,0.00022226438,0.000025912845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051025744,0.00086006394,0.0010047322,0.0010697712,0.0007924572,0.0007498111,0.0017701379,0.00060386903,0.01176773],"category_scores_gemma":[0.0019067316,0.00053717324,0.0007682373,0.0017732319,0.00066229113,0.0013394909,0.0015467044,0.0012243621,0.0035150878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026074518,0.00006298838,0.00024361766,0.00022295615,0.00004971409,0.000058949965,0.00015546926,0.038873527,0.03603309,0.020127442,0.012066023,0.8918455],"study_design_scores_gemma":[0.00020858082,0.0002632716,0.0005958107,0.00006135927,0.000105758074,0.00044006231,0.00013189096,0.85444903,0.055698633,0.039862793,0.048117172,0.00006574194],"about_ca_topic_score_codex":0.0044350764,"about_ca_topic_score_gemma":0.008928937,"teacher_disagreement_score":0.01176773,"about_ca_system_score_codex":0.0005034133,"about_ca_system_score_gemma":0.0008657883,"threshold_uncertainty_score":0.0393669},"labels":[],"label_agreement":null},{"id":"W1648726702","doi":"10.1007/s10589-015-9779-8","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Semidefinite programming; Maximum cut; Eigenvalues and eigenvectors; Quadratic programming; Adjacency matrix; Graph partition; Combinatorics; Laplacian matrix; Vertex (graph theory); Quadratic equation; Mathematical optimization; Graph","score_opus":0.02330850243936596,"score_gpt":0.2572272012488267,"score_spread":0.23391869880946073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648726702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420896,0.0004007917,0.9815776,0.0007970717,0.00009892722,0.000049954044,0.000120884695,0.000088645575,0.008445292],"genre_scores_gemma":[0.29076487,0.001335819,0.6862729,0.00071519014,0.00046045912,0.0006143929,0.00060896616,0.00054957846,0.018677816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882525,0.00055224076,0.00004219236,0.00017239281,0.00031576294,0.00009212399],"domain_scores_gemma":[0.9961003,0.0031071897,0.00020389663,0.00014823176,0.00031812218,0.00012232228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025500208,0.0014775243,0.0012414231,0.0009609189,0.00067821535,0.0019920138,0.0013530873,0.0018573285,0.005823901],"category_scores_gemma":[0.0077733765,0.0006978043,0.0009765066,0.0013225948,0.0014615406,0.0021803062,0.0014102719,0.0035427492,0.0006836483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020992699,0.00029100289,0.00040125378,0.00043555957,0.00006168547,0.00018362024,0.0002094213,0.6729216,0.0029053579,0.2463779,0.013925675,0.062076975],"study_design_scores_gemma":[0.000026107235,0.00004628291,0.000121986224,0.000027477032,0.000010502604,0.00006886998,0.00004311438,0.9142911,0.00034186308,0.083393306,0.0016155463,0.0000137965935],"about_ca_topic_score_codex":0.0021633995,"about_ca_topic_score_gemma":0.0027486219,"teacher_disagreement_score":0.005823901,"about_ca_system_score_codex":0.0009921683,"about_ca_system_score_gemma":0.0012990785,"threshold_uncertainty_score":0.01948291},"labels":[],"label_agreement":null},{"id":"W1669114967","doi":"10.1109/fpl.2015.7293955","title":"Synthesizable FPGA fabrics targetable by the Verilog-to-Routing (VTR) CAD flow","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Verilog; Computer science; FPGA prototype; Bitstream; Embedded system; Routing (electronic design automation); Application-specific integrated circuit; Computer architecture; Computer hardware","score_opus":0.018248094371866,"score_gpt":0.20826393290052303,"score_spread":0.19001583852865703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669114967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08215919,0.00032184512,0.8901413,0.00015562432,0.000096219854,0.00028146594,0.00080698315,0.0051232367,0.020914156],"genre_scores_gemma":[0.52439773,0.00043867092,0.4684943,0.00011321362,0.000022580167,0.00024290672,0.0007575294,0.0004616317,0.005071442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974805,0.000046449957,0.000017827488,0.000027545975,0.0001251456,0.00003491092],"domain_scores_gemma":[0.9996371,0.00015016936,0.00005274201,0.0000914661,0.000060747552,0.000007693977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033569624,0.00048663164,0.00020019854,0.00028328694,0.00019032184,0.0005760089,0.0006336823,0.00027015648,0.0045324815],"category_scores_gemma":[0.00083777145,0.00019162269,0.00026021595,0.00015161624,0.00028090805,0.00044788612,0.00017853685,0.00035640073,0.00071789534],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021814709,0.00015931143,0.0015773711,0.0009163623,0.000059766746,0.00069915835,0.00015658297,0.48561215,0.25341824,0.08179635,0.0052091917,0.17017744],"study_design_scores_gemma":[0.00010780624,0.0005037983,0.0008044658,0.000109699715,0.000060610317,0.0006265073,0.000051602037,0.64094967,0.2962166,0.012011634,0.048528176,0.000029457187],"about_ca_topic_score_codex":0.0009540742,"about_ca_topic_score_gemma":0.0019444877,"teacher_disagreement_score":0.0045324815,"about_ca_system_score_codex":0.00046309904,"about_ca_system_score_gemma":0.0006580537,"threshold_uncertainty_score":0.015162706},"labels":[],"label_agreement":null},{"id":"W1669973258","doi":"10.1109/fpl.2015.7294008","title":"Wotan: A tool for rapid evaluation of FPGA architecture routability without benchmarks","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Routing (electronic design automation); Computer science; Field-programmable gate array; Lookup table; Parallel computing; CAD; Very-large-scale integration; Suite; Path (computing); Electronic design automation; Design flow; Embedded system; Engineering","score_opus":0.042004343270136545,"score_gpt":0.2853053944184735,"score_spread":0.24330105114833697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669973258","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04522033,0.00053426105,0.5579686,0.00012337703,0.00026331228,0.00053916406,0.012235515,0.37297374,0.010141666],"genre_scores_gemma":[0.26623735,0.00057918305,0.66328263,0.00021882408,0.0000616113,0.0022447514,0.032591138,0.026719254,0.00806528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998494,0.00027411265,0.00017954885,0.00017035581,0.00076783885,0.00011418893],"domain_scores_gemma":[0.99565566,0.00261456,0.00046104632,0.00057397626,0.00060360593,0.000091202644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021964763,0.0024613463,0.0007643743,0.004009166,0.0003710158,0.0012937536,0.0018350885,0.0006575233,0.016358148],"category_scores_gemma":[0.009652186,0.0008386376,0.0007777313,0.0020433578,0.00033919167,0.0015805328,0.001112591,0.0011316189,0.0029371043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012549062,0.00056317076,0.020489613,0.0027925703,0.0006413005,0.00087930803,0.00049430475,0.13598439,0.04053687,0.02115795,0.18146084,0.59374475],"study_design_scores_gemma":[0.00034067495,0.0004607431,0.0064747715,0.00021720669,0.00009297876,0.00032354845,0.00014735872,0.87016237,0.051591363,0.009631644,0.060400624,0.00015662397],"about_ca_topic_score_codex":0.0023177753,"about_ca_topic_score_gemma":0.003518408,"teacher_disagreement_score":0.016358148,"about_ca_system_score_codex":0.00060382043,"about_ca_system_score_gemma":0.0012477278,"threshold_uncertainty_score":0.05472344},"labels":[],"label_agreement":null},{"id":"W1719971006","doi":"10.3233/ica-2005-12406","title":"Macro-cell placement for analog physical designs using a hybrid genetic algorithm with simulated annealing","year":2005,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Simulated annealing; Macro; Algorithm; Genetic algorithm; Computer science; Electronic engineering; Engineering; Machine learning; Programming language","score_opus":0.01192997485710373,"score_gpt":0.2155752214681823,"score_spread":0.20364524661107858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719971006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017648088,0.00014420359,0.977187,0.00007367152,0.000041343243,0.00005809158,0.00001977509,0.0005139872,0.0043138675],"genre_scores_gemma":[0.2982782,0.00012881467,0.6982786,0.0000868377,0.00002369478,0.00016460147,0.000040755476,0.000091535825,0.0029068908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998553,0.000040022114,0.0000056173208,0.000023196599,0.00006333097,0.000012627189],"domain_scores_gemma":[0.99983525,0.00008534875,0.000017116128,0.00002624434,0.000025510737,0.000010474639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023996376,0.00040973848,0.00039430996,0.00036335512,0.00026356,0.0003984521,0.00073205144,0.0006066256,0.0019005863],"category_scores_gemma":[0.00047349086,0.00022061035,0.0003617085,0.00030470014,0.00036772326,0.00029051848,0.00048283933,0.00035017796,0.00033943818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045676046,0.0000525874,0.00040850003,0.000049557904,0.000041092273,0.00008288337,0.000058690614,0.8917516,0.021217093,0.011289347,0.0008228729,0.07418009],"study_design_scores_gemma":[0.000012683054,0.000036222045,0.00007918417,0.0000025830861,0.000005025086,0.000021280588,0.0000049377472,0.99580884,0.0016859218,0.0012976162,0.0010420555,0.000003675916],"about_ca_topic_score_codex":0.0013664204,"about_ca_topic_score_gemma":0.0033027472,"teacher_disagreement_score":0.0019005863,"about_ca_system_score_codex":0.00043606077,"about_ca_system_score_gemma":0.00054737285,"threshold_uncertainty_score":0.006358087},"labels":[],"label_agreement":null},{"id":"W1727049600","doi":"10.1002/9780470050118.ecse312","title":"<scp>VLSI</scp>Circuit Layout","year":2008,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Computer Science and Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Very-large-scale integration; Floorplan; Physical design; Routing (electronic design automation); Computer science; Computer architecture; Process (computing); Electronic engineering; Circuit design; Computer engineering; Engineering; Embedded system","score_opus":0.006744121841082527,"score_gpt":0.18103792858716716,"score_spread":0.17429380674608463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727049600","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022965937,0.009312935,0.58675826,0.0026954412,0.0032294157,0.00034408603,0.002786919,0.01199972,0.38057664],"genre_scores_gemma":[0.062018827,0.016611781,0.44546583,0.0020761425,0.0015565716,0.000573052,0.008723332,0.0028515588,0.46012288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993124,0.000119758835,0.000045047942,0.00008433257,0.0004015407,0.00003685071],"domain_scores_gemma":[0.9991027,0.00018561757,0.00004641143,0.00025423546,0.0003749333,0.00003605454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042159762,0.0008199262,0.0005189652,0.0013149086,0.0005927074,0.002201777,0.0015327579,0.0009693968,0.11344934],"category_scores_gemma":[0.0014473337,0.00041647186,0.00038652503,0.0033559422,0.0006752477,0.0009946044,0.00097481674,0.0008961982,0.063213296],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003769669,0.000018487704,0.00018203346,0.000688474,0.000018007413,0.00038829123,0.00004755869,0.011131116,0.009044591,0.046387095,0.37851363,0.55354303],"study_design_scores_gemma":[0.000012081396,0.000028662038,0.00029918272,0.00014553286,0.0000084533785,0.00087265857,0.000024181429,0.02153389,0.004337326,0.019520387,0.9532,0.000017667468],"about_ca_topic_score_codex":0.002642756,"about_ca_topic_score_gemma":0.005168263,"teacher_disagreement_score":0.11344934,"about_ca_system_score_codex":0.0009096044,"about_ca_system_score_gemma":0.0012700309,"threshold_uncertainty_score":0.37952584},"labels":[],"label_agreement":null},{"id":"W1734210446","doi":"10.1109/ccece.2001.933559","title":"Unified simulator: an alternative to traditional simulation techniques","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Toronto Metropolitan University","funders":"","keywords":"Computer science; Component (thermodynamics); Electronic circuit simulation; Electronic circuit; Point (geometry); Simple (philosophy); Circuit extraction; Analogue electronics; Electronic engineering; Simulation modeling; Simulation; Computer engineering; Equivalent circuit; Engineering; Electrical engineering; Mathematics","score_opus":0.06586304742031587,"score_gpt":0.26363719960755355,"score_spread":0.19777415218723768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734210446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028320951,0.00022779463,0.98843724,0.000082035,0.00007114354,0.000052805703,0.000071514,0.0030197666,0.005205479],"genre_scores_gemma":[0.18310577,0.0015467767,0.8039698,0.00016667649,0.000102399084,0.00041221283,0.000571928,0.001027464,0.009097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00026049017,0.000049955906,0.00006883069,0.0003715126,0.00006185354],"domain_scores_gemma":[0.99896944,0.00045883,0.00005777583,0.00027100314,0.00019844872,0.000044577075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083457684,0.0006006254,0.0007523363,0.00091906806,0.00038268807,0.0009469849,0.0019477718,0.00086763495,0.008032613],"category_scores_gemma":[0.0027095,0.0005193796,0.00079628517,0.00083722913,0.00037312025,0.0017995979,0.001143199,0.0012249489,0.00190775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023842255,0.00012696687,0.0014852051,0.0003606095,0.0002110732,0.0002298001,0.00028149708,0.53126824,0.02002807,0.19641015,0.011102058,0.2382579],"study_design_scores_gemma":[0.000041130494,0.00008072299,0.00011044999,0.00003488171,0.000036846504,0.00014181911,0.000022530516,0.9351297,0.005680533,0.015658682,0.043039173,0.00002352363],"about_ca_topic_score_codex":0.0015647545,"about_ca_topic_score_gemma":0.0021434736,"teacher_disagreement_score":0.008032613,"about_ca_system_score_codex":0.0005134869,"about_ca_system_score_gemma":0.0009927659,"threshold_uncertainty_score":0.0268718},"labels":[],"label_agreement":null},{"id":"W1750273152","doi":"10.1109/iscas.1993.394055","title":"Circuit partitioning using a Tabu search approach","year":2002,"lang":"en","type":"article","venue":"1993 IEEE International Symposium on Circuits and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tabu search; Netlist; Simulated annealing; Guided Local Search; Hill climbing; Computer science; Mathematical optimization; Job shop scheduling; Algorithm; Theoretical computer science; Mathematics; Schedule","score_opus":0.08049535451018379,"score_gpt":0.2574485584508043,"score_spread":0.17695320394062047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750273152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019083135,0.0013013475,0.95505685,0.00023126471,0.00007347969,0.0003139593,0.00033707626,0.0031317298,0.020471176],"genre_scores_gemma":[0.16792737,0.0008423805,0.8224336,0.00021424903,0.000034130146,0.0006003693,0.00088379753,0.0006218992,0.0064421287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999353,0.00027424013,0.00002693744,0.00008138655,0.00017698121,0.00008745361],"domain_scores_gemma":[0.99945253,0.00023514329,0.000040187628,0.00009808599,0.00015614805,0.000017859857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055205333,0.0008350401,0.0008789012,0.0025596921,0.0010706991,0.0014651136,0.0012227433,0.000983143,0.010496369],"category_scores_gemma":[0.0017584983,0.00055741845,0.00093558145,0.00294446,0.0005652248,0.0010962897,0.00056131335,0.00062756863,0.0021863824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010652644,0.000093490606,0.0005605442,0.00027671465,0.000104883606,0.000095852636,0.00017623609,0.571093,0.010818746,0.02757922,0.009956211,0.37913865],"study_design_scores_gemma":[0.00003969433,0.00009064304,0.0002884627,0.000047749993,0.000043949058,0.00013351164,0.00009541163,0.9590922,0.006126127,0.017783772,0.016232869,0.000025553076],"about_ca_topic_score_codex":0.0053382404,"about_ca_topic_score_gemma":0.007253717,"teacher_disagreement_score":0.010496369,"about_ca_system_score_codex":0.001244017,"about_ca_system_score_gemma":0.0015694369,"threshold_uncertainty_score":0.03511387},"labels":[],"label_agreement":null},{"id":"W175193922","doi":"","title":"Further constructions for BIB designs with nested rows and columns.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Row; Row and column spaces; Arithmetic; Computer science; Programming language","score_opus":0.017321915887473123,"score_gpt":0.2063566414762262,"score_spread":0.1890347255887531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175193922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020354098,0.0015784054,0.7998742,0.00095176505,0.0010357542,0.0002721049,0.0010124029,0.004232934,0.17068842],"genre_scores_gemma":[0.24681056,0.0015444561,0.67735964,0.0014155557,0.0003564972,0.0004330136,0.0019187753,0.001154125,0.06900739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00011784198,0.00005136649,0.00006351868,0.00022503462,0.00010703001],"domain_scores_gemma":[0.9992931,0.00017798833,0.00007255355,0.0002425545,0.00013528505,0.000078487625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065460027,0.0008158696,0.00057061366,0.0010805741,0.0010013179,0.0017221394,0.0008620811,0.0005620776,0.029976131],"category_scores_gemma":[0.0016788968,0.0005255703,0.0009027317,0.0012574148,0.00092052104,0.0017980189,0.0015850639,0.0017446987,0.009756984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040404353,0.0001761527,0.00069189986,0.0012020884,0.000072447234,0.0006583362,0.0003727844,0.007985885,0.04445147,0.68274635,0.049475074,0.21176353],"study_design_scores_gemma":[0.00020914586,0.0003871954,0.00083004346,0.00039573293,0.000107453714,0.0023343826,0.00030112296,0.037983198,0.0690873,0.52601516,0.36222565,0.000123613],"about_ca_topic_score_codex":0.0004341957,"about_ca_topic_score_gemma":0.0017136919,"teacher_disagreement_score":0.029976131,"about_ca_system_score_codex":0.00071605155,"about_ca_system_score_gemma":0.0006986367,"threshold_uncertainty_score":0.100280166},"labels":[],"label_agreement":null},{"id":"W177835669","doi":"10.1007/978-3-319-05960-0_7","title":"Faster FPGA Debug: Efficiently Coupling Trace Instruments with User Circuitry","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Debugging; Field-programmable gate array; Computer science; Observability; Embedded system; Background debug mode interface; Process (computing); TRACE (psycholinguistics); Construct (python library); Computer hardware; Operating system; Programming language","score_opus":0.010258751835662924,"score_gpt":0.2026206263339288,"score_spread":0.19236187449826586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177835669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033471305,0.0011215776,0.9046519,0.00021512057,0.00022972962,0.00011137566,0.00025567456,0.04151449,0.018428786],"genre_scores_gemma":[0.41822708,0.00074757275,0.5182359,0.00041483485,0.00011138095,0.00019467436,0.00096885883,0.008035593,0.05306406],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993111,0.00013704655,0.00003255395,0.00010752413,0.0003266773,0.00008512474],"domain_scores_gemma":[0.99876666,0.00051156693,0.00008654697,0.0004284584,0.00015925334,0.000047477002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766409,0.0016448434,0.0005451695,0.0011702948,0.00042264807,0.0018020468,0.0025931688,0.000982914,0.033280224],"category_scores_gemma":[0.0026572996,0.0009180304,0.00039189492,0.0009612756,0.00053928065,0.0034174446,0.0019902836,0.0015126329,0.005552989],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010185172,0.00018171428,0.0027131708,0.00046063965,0.00009386198,0.00034587947,0.00046281936,0.017188534,0.06920199,0.027802352,0.03277954,0.8477509],"study_design_scores_gemma":[0.00043792074,0.0010452238,0.0024720682,0.00030764155,0.00020303769,0.0017989106,0.00038847057,0.3592831,0.40394726,0.047680944,0.18227015,0.00016519353],"about_ca_topic_score_codex":0.00086674956,"about_ca_topic_score_gemma":0.0019324761,"teacher_disagreement_score":0.033280224,"about_ca_system_score_codex":0.0005845741,"about_ca_system_score_gemma":0.00069959747,"threshold_uncertainty_score":0.11133343},"labels":[],"label_agreement":null},{"id":"W1827007993","doi":"10.1109/isqed.2005.125","title":"Toward Quality EDA Tools and Tool Flows Through High-Performance Computing","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Binghamton University; University of Waterloo; Purdue University","keywords":"Computer science; Leverage (statistics); Bottleneck; Electronic design automation; Automation; Turnaround time; Quality (philosophy); Time to market; Design flow; Pareto principle; Computer engineering; Software engineering; Embedded system; Operating system; Engineering","score_opus":0.04092748868379135,"score_gpt":0.2640521434784959,"score_spread":0.22312465479470459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827007993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030202093,0.00017253782,0.99196637,0.0006552599,0.000026293437,0.00014444492,0.00006210302,0.0025894572,0.0013633001],"genre_scores_gemma":[0.017383046,0.00026050681,0.9808646,0.00010198121,0.0000216369,0.00014340773,0.00018848253,0.000528113,0.000508284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9815972,0.0072755697,0.0017277244,0.0011299776,0.0074709156,0.00079857593],"domain_scores_gemma":[0.934484,0.02457547,0.003985804,0.023002282,0.012996568,0.0009558146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03139851,0.0022136748,0.0012199159,0.0043066777,0.001112041,0.009674304,0.0051579783,0.00219222,0.0039577526],"category_scores_gemma":[0.07210506,0.0019121733,0.0018226063,0.0037016056,0.0034194705,0.013072127,0.0041951244,0.006230202,0.0020760768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031470077,0.00041111585,0.0036687956,0.0007566148,0.000116173294,0.00020979789,0.0012499505,0.1253041,0.009104115,0.3250424,0.010425746,0.52339655],"study_design_scores_gemma":[0.00033041826,0.00027687094,0.0011529007,0.00059632864,0.000104236344,0.0002620424,0.0005324488,0.5708104,0.02870185,0.3248576,0.07223478,0.00014011959],"about_ca_topic_score_codex":0.003293297,"about_ca_topic_score_gemma":0.0026723372,"teacher_disagreement_score":0.03139851,"about_ca_system_score_codex":0.0029609785,"about_ca_system_score_gemma":0.008649336,"threshold_uncertainty_score":0.16605318},"labels":[],"label_agreement":null},{"id":"W1827532909","doi":"10.1007/s00453-002-0964-7","title":"Budget Management with Applications","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Theory of computation; Directed graph; Vertex (graph theory); Directed acyclic graph; Graph; Set (abstract data type); Mathematical optimization; Path (computing); Transitive relation; Sensitivity (control systems); Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.005821349516441284,"score_gpt":0.17402018645245723,"score_spread":0.16819883693601595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827532909","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026793102,0.0071222456,0.34536865,0.007081902,0.0017268469,0.00027226732,0.001115435,0.0015999697,0.60891956],"genre_scores_gemma":[0.5747416,0.0059418646,0.1339894,0.0010339423,0.0009427238,0.00041569408,0.0010956222,0.000939457,0.28089964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988512,0.00039253832,0.00004756232,0.00022126858,0.0003283525,0.00015910878],"domain_scores_gemma":[0.9988343,0.00032039903,0.00012878134,0.0003210695,0.00028177132,0.000113705064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397119,0.0009552826,0.00050468196,0.0016934486,0.0013702608,0.0041898987,0.0011743249,0.0006869884,0.044329457],"category_scores_gemma":[0.0068051363,0.0003802188,0.00035092203,0.002719979,0.0007984347,0.003090297,0.0018575408,0.0011608552,0.0054498278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016454393,0.00006813229,0.0014849012,0.00023782595,0.00003724597,0.00013650932,0.00027323584,0.02015213,0.0018539991,0.51549023,0.052838884,0.40726233],"study_design_scores_gemma":[0.00002794013,0.00008108975,0.0017095152,0.00022675471,0.000054324286,0.00035545664,0.00040737953,0.061628964,0.004474622,0.38874704,0.5422492,0.00003770905],"about_ca_topic_score_codex":0.0024207882,"about_ca_topic_score_gemma":0.002985573,"teacher_disagreement_score":0.044329457,"about_ca_system_score_codex":0.0018044895,"about_ca_system_score_gemma":0.0018748385,"threshold_uncertainty_score":0.14829683},"labels":[],"label_agreement":null},{"id":"W1857907604","doi":"10.1109/ccece.2000.849631","title":"Genetic algorithm for the assignment of cells to switches in personal communication networks","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Convergence (economics); Heuristic; Genetic algorithm; Mathematical optimization; Adaptation (eye); Resolution (logic); Distributed computing; Artificial intelligence; Mathematics; Machine learning","score_opus":0.01725618145104338,"score_gpt":0.2049110638133634,"score_spread":0.18765488236232003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857907604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017675903,0.0004045761,0.9778701,0.0001733054,0.0000504897,0.000061065395,0.000019989708,0.00022513744,0.0035194554],"genre_scores_gemma":[0.2955563,0.0007595336,0.6972336,0.00014291833,0.000046794863,0.000305666,0.00011211542,0.000078770514,0.0057642576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.00007420382,0.0000059891063,0.00002723726,0.0000612298,0.000027002525],"domain_scores_gemma":[0.999819,0.00011632328,0.000017008811,0.000011608873,0.000027536715,0.00000855366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004677026,0.00042689283,0.0004844439,0.00049309665,0.00039902536,0.0005082316,0.00074852246,0.0008297241,0.0018604685],"category_scores_gemma":[0.0011232505,0.00023129443,0.0003892024,0.0006521974,0.0006457812,0.00042202888,0.0003210935,0.0007810218,0.00028263486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039927596,0.000031034313,0.00027525536,0.000034590423,0.00002694848,0.000051110706,0.000051267947,0.9177128,0.0015510612,0.018356651,0.0011346336,0.060734745],"study_design_scores_gemma":[0.000025465115,0.000036603138,0.000120037555,0.000009677191,0.000011490501,0.000028655946,0.000016174145,0.98767906,0.000629648,0.009455179,0.001981814,0.000006260058],"about_ca_topic_score_codex":0.005817389,"about_ca_topic_score_gemma":0.0046331715,"teacher_disagreement_score":0.005817389,"about_ca_system_score_codex":0.0006538193,"about_ca_system_score_gemma":0.0009750518,"threshold_uncertainty_score":0.011567056},"labels":[],"label_agreement":null},{"id":"W1890393032","doi":"10.1109/newcas.2004.1359111","title":"A fast adaptive heuristic for FPGA placement","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Simulated annealing; Heuristic; Computation; Routing (electronic design automation); Placement; Compiler; Compile time; Parallel computing; Convergence (economics); Embedded system; Computer engineering; Algorithm; Physical design; Artificial intelligence; Circuit design","score_opus":0.033041792017859124,"score_gpt":0.2513717674783745,"score_spread":0.21832997546051536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890393032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013580917,0.00037972652,0.9815864,0.00009953937,0.00008350674,0.00009245249,0.0000515923,0.0009984846,0.0031273875],"genre_scores_gemma":[0.20085658,0.0002871816,0.7946831,0.00015186655,0.00006392975,0.00023034026,0.00024092555,0.00022795325,0.0032581189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.00012914409,0.000025299476,0.00009968866,0.00017815035,0.00006874796],"domain_scores_gemma":[0.99942625,0.0002926108,0.000054224376,0.00008870093,0.00011015285,0.000028094988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055887667,0.00080610707,0.00060150475,0.0009503057,0.0005687377,0.0005831542,0.0011803011,0.00080806745,0.003262406],"category_scores_gemma":[0.0018216496,0.00042127483,0.0006122531,0.0009440126,0.0005063446,0.0006210124,0.0007126032,0.000734645,0.0007836519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021705752,0.00008177631,0.00072181516,0.00014325728,0.0000661775,0.00012964688,0.0000768638,0.54900455,0.0137865795,0.011278396,0.006156057,0.4183378],"study_design_scores_gemma":[0.000050528593,0.000091152055,0.0002411688,0.000013575705,0.000020100708,0.00011437337,0.000023202834,0.9850299,0.0033312354,0.0058143088,0.0052534617,0.000017087956],"about_ca_topic_score_codex":0.0028780852,"about_ca_topic_score_gemma":0.0051801107,"teacher_disagreement_score":0.003262406,"about_ca_system_score_codex":0.0006985612,"about_ca_system_score_gemma":0.0010810163,"threshold_uncertainty_score":0.010913789},"labels":[],"label_agreement":null},{"id":"W1894282346","doi":"10.1002/nme.5003","title":"A multilevel tabu search algorithm for balanced partitioning of unstructured grids","year":2015,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Partition (number theory); Grid; Algorithm; Cluster analysis; Unstructured grid; Computer science; Graph partition; Iterative method; Search algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics; Geometry; Graph","score_opus":0.05758514904295582,"score_gpt":0.4068624143791758,"score_spread":0.34927726533622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894282346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010998789,0.00013540371,0.9857531,0.00006930825,0.000020413814,0.000051984433,0.00006138485,0.0005053516,0.0024043077],"genre_scores_gemma":[0.16785522,0.0001182779,0.82927847,0.000066753826,0.00001645364,0.00024401589,0.0003245587,0.00021430847,0.0018819529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954623,0.00012849047,0.000023898587,0.00005364536,0.00019216951,0.000055517892],"domain_scores_gemma":[0.99955827,0.00018987428,0.000039503793,0.000054502812,0.00013535091,0.000022428872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117786,0.00046518623,0.00065923814,0.0009924571,0.0007444772,0.00080893724,0.0010163157,0.00066895253,0.004450703],"category_scores_gemma":[0.0022833918,0.00032689856,0.0005781815,0.00095597556,0.0004192099,0.00058656326,0.0010424133,0.0007357572,0.0010472399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016034661,0.000051245606,0.0007595957,0.00013872754,0.00004984675,0.000073689655,0.00022121184,0.71703386,0.013663771,0.024593206,0.004326255,0.23892815],"study_design_scores_gemma":[0.000021192729,0.000025714293,0.00009615619,0.000009463379,0.000005614989,0.000018999357,0.00001826795,0.99263614,0.0015882993,0.0037961158,0.0017785666,0.000005558068],"about_ca_topic_score_codex":0.003843088,"about_ca_topic_score_gemma":0.003862176,"teacher_disagreement_score":0.004450703,"about_ca_system_score_codex":0.00066561665,"about_ca_system_score_gemma":0.00087919267,"threshold_uncertainty_score":0.014889121},"labels":[],"label_agreement":null},{"id":"W1899813288","doi":"10.1109/iscas.2004.1329462","title":"A placement algorithm for implementation of analog LSI/VLSI systems","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simulated annealing; Nondeterministic algorithm; Computer science; Very-large-scale integration; Algorithm; Analogue electronics; Placement; Adder; Floorplan; Electronic circuit; Mathematical optimization; Physical design; Circuit design; Mathematics; Engineering; Embedded system","score_opus":0.011896560394724249,"score_gpt":0.2670548869184798,"score_spread":0.25515832652375553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899813288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044618784,0.00013323936,0.9910466,0.00006992814,0.000033000164,0.000061370556,0.000038480783,0.00068952586,0.0034659207],"genre_scores_gemma":[0.11746174,0.00018371324,0.87777656,0.00005062633,0.000020907037,0.00016133882,0.00011433981,0.00007908441,0.0041515967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998933,0.000024394036,0.0000084059475,0.00002146968,0.0000399644,0.000012450393],"domain_scores_gemma":[0.99992144,0.00002289531,0.000011453732,0.000013447578,0.000026252434,0.0000045220904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002062295,0.0005880077,0.0002810476,0.00035136892,0.00039013443,0.00047660831,0.00054288126,0.00042604297,0.00509812],"category_scores_gemma":[0.0004113086,0.00020997759,0.00026767363,0.00041447332,0.00023043639,0.00035888678,0.00027684463,0.00045272824,0.001128755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075622775,0.00005414772,0.0002411138,0.00022273601,0.000032243843,0.00011986407,0.00008373161,0.37803423,0.030417595,0.04883161,0.004581612,0.53730553],"study_design_scores_gemma":[0.000029477937,0.00011624289,0.00017940908,0.000022198212,0.000017296099,0.00012790281,0.000021616042,0.96190083,0.010697549,0.012468967,0.014409699,0.000008920802],"about_ca_topic_score_codex":0.0010602473,"about_ca_topic_score_gemma":0.0015746707,"teacher_disagreement_score":0.00509812,"about_ca_system_score_codex":0.00048654078,"about_ca_system_score_gemma":0.00051849295,"threshold_uncertainty_score":0.017054975},"labels":[],"label_agreement":null},{"id":"W1912498744","doi":"10.1109/cicc.1998.694976","title":"Computational field programmable architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Architecture; Computer architecture; Field-programmable gate array; Computer science; Space-based architecture; Field (mathematics); Applications architecture; Reference architecture; Database-centric architecture; Embedded system; Signal processing; Computer hardware; Software architecture; Digital signal processing; Software; Operating system","score_opus":0.009117569358791003,"score_gpt":0.19043217393903963,"score_spread":0.18131460458024862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912498744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019809952,0.0074004414,0.78352547,0.0017589033,0.0011747081,0.00015196003,0.00027435113,0.0018231838,0.18408105],"genre_scores_gemma":[0.37575042,0.00942706,0.5625053,0.000985976,0.0006199669,0.00038564162,0.0007293057,0.00019915031,0.049397163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982446,0.000028944878,0.000009441924,0.000035248984,0.000076683165,0.000025318239],"domain_scores_gemma":[0.9998317,0.000055614408,0.000009268547,0.000052346644,0.00003526225,0.000015749212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002759029,0.0003634887,0.00028755973,0.00047069942,0.0004398266,0.0012868642,0.0006511447,0.00047081857,0.009598593],"category_scores_gemma":[0.00072052964,0.00016863925,0.00042123767,0.00040860695,0.0008364652,0.0013609208,0.00063964544,0.0010385682,0.0019331282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040319883,0.000022784494,0.00019458422,0.00013620398,0.000023234676,0.00009182256,0.00005856692,0.014531662,0.005032299,0.86540306,0.007871948,0.10659345],"study_design_scores_gemma":[0.00007299638,0.0000969589,0.00025391424,0.00009752478,0.00002638233,0.00042347427,0.000028449158,0.09872528,0.006833583,0.48565465,0.40775144,0.000035258672],"about_ca_topic_score_codex":0.0005606445,"about_ca_topic_score_gemma":0.0009742475,"teacher_disagreement_score":0.009598593,"about_ca_system_score_codex":0.00062498293,"about_ca_system_score_gemma":0.0006628996,"threshold_uncertainty_score":0.032110453},"labels":[],"label_agreement":null},{"id":"W1917545295","doi":"10.1109/ismvl.1998.679449","title":"Multiple-valued logic minimization using universal literals and cost tables","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Minification; Computer science; Table (database); Simulated annealing; Truth table; Logic synthesis; Algorithm; Mathematical optimization; Logic gate; Mathematics; Data mining; Programming language","score_opus":0.0377711171309873,"score_gpt":0.227321084198357,"score_spread":0.1895499670673697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917545295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013087005,0.00018782131,0.984143,0.000085290434,0.000023247741,0.000030545063,0.00003922146,0.00042588176,0.0019779906],"genre_scores_gemma":[0.13730106,0.0001446992,0.8608014,0.00006466395,0.000014008373,0.00007312614,0.00007833963,0.00013777937,0.0013849094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995177,0.00013422249,0.000033314976,0.00005568599,0.00022525096,0.0000338159],"domain_scores_gemma":[0.999503,0.0002610015,0.00003832039,0.00008622401,0.00010011838,0.000011285886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060910784,0.0004782562,0.0006108001,0.0006770116,0.0003186353,0.0007314417,0.0010805741,0.00044496974,0.0026319444],"category_scores_gemma":[0.0016731676,0.00039834788,0.00059771066,0.00089894695,0.00035149336,0.0013487592,0.0005426697,0.0005328079,0.0003621698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014379661,0.000076136654,0.000854466,0.0002725295,0.000107586064,0.00013185493,0.00007586985,0.4290578,0.027858911,0.14736342,0.002986133,0.3910715],"study_design_scores_gemma":[0.000030185327,0.00008104457,0.00020114178,0.000021382913,0.000038137496,0.000118707045,0.000015332012,0.9211237,0.01975914,0.053289574,0.0053024013,0.000019403675],"about_ca_topic_score_codex":0.0007823596,"about_ca_topic_score_gemma":0.001698115,"teacher_disagreement_score":0.0026319444,"about_ca_system_score_codex":0.0004891829,"about_ca_system_score_gemma":0.000593304,"threshold_uncertainty_score":0.008804679},"labels":[],"label_agreement":null},{"id":"W1940302780","doi":"10.1109/iscas.1999.777927","title":"PARC: a new pyramidal FPGA architecture based on a RISC processor","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; VHDL; Computer science; Routing (electronic design automation); Reduced instruction set computing; Embedded system; Logic synthesis; Electronic design automation; Computer architecture; Clock rate; Place and route; Controller (irrigation); Computer hardware; Logic gate; Instruction set; Chip","score_opus":0.008156673063613229,"score_gpt":0.20201550860394196,"score_spread":0.19385883554032873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940302780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14855796,0.0029737852,0.73547804,0.00049903436,0.00047108822,0.00038488573,0.001032298,0.022792416,0.087810494],"genre_scores_gemma":[0.37493306,0.0007085356,0.60677546,0.00050910824,0.00013046252,0.00015454809,0.0013517095,0.00034772904,0.015089297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998406,0.000016655393,0.000008213955,0.000038467664,0.00006616355,0.000029912684],"domain_scores_gemma":[0.9998728,0.00001620852,0.000013171078,0.000034663462,0.000043126536,0.000019877665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011404069,0.00030053811,0.00029575487,0.0004027345,0.00020989691,0.00046803796,0.0008585667,0.0003228878,0.004529784],"category_scores_gemma":[0.00020608245,0.00019186,0.00023283064,0.00032739385,0.00022527194,0.00051925215,0.00036883974,0.00041574618,0.0018055127],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078044535,0.00009273221,0.0017999277,0.0004748867,0.00008411577,0.00082211406,0.00007962295,0.024464272,0.31735608,0.030863991,0.040088058,0.5830938],"study_design_scores_gemma":[0.00054080575,0.0042190924,0.010043793,0.00011459044,0.00024394257,0.008330779,0.000076109216,0.37624925,0.20209132,0.00830662,0.3895559,0.00022777014],"about_ca_topic_score_codex":0.00090127497,"about_ca_topic_score_gemma":0.0016264266,"teacher_disagreement_score":0.004529784,"about_ca_system_score_codex":0.0003426299,"about_ca_system_score_gemma":0.00039068298,"threshold_uncertainty_score":0.015153587},"labels":[],"label_agreement":null},{"id":"W1963318846","doi":"10.1109/mwscas.1993.343096","title":"Odd-cycle inequalities, via minimization and LP-completeness","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Relaxation (psychology); Planar graph; Minification; Mathematics; Combinatorics; Time complexity; Graph; Running time; Discrete mathematics; Planar; Linear programming relaxation; Linear programming; Plane (geometry); Mathematical optimization; Computer science; Geometry","score_opus":0.021101018426208165,"score_gpt":0.1913923561511974,"score_spread":0.17029133772498922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963318846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032432415,0.00039900182,0.9399842,0.0008351924,0.000047119003,0.00014986575,0.0007586708,0.00044744465,0.024945954],"genre_scores_gemma":[0.36356464,0.00080057496,0.61852056,0.0005818788,0.00011563806,0.000579437,0.002729424,0.0005329354,0.012575008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888724,0.00032088847,0.00004559016,0.00023138555,0.0003088218,0.00020609515],"domain_scores_gemma":[0.9978886,0.001427289,0.00018487171,0.00021774032,0.00021428832,0.000067219895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355943,0.0010779795,0.0006174181,0.0007006834,0.00065149047,0.0015319661,0.0016323366,0.00064247055,0.008445475],"category_scores_gemma":[0.005336119,0.00054967665,0.0010887987,0.0011831721,0.0010506191,0.0031324897,0.0016158413,0.002547033,0.0007553765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026001275,0.0002339221,0.0017499726,0.0007339783,0.00011442584,0.00022966383,0.00030387467,0.36666253,0.00707795,0.4406679,0.017535891,0.16442984],"study_design_scores_gemma":[0.00005428554,0.00008505559,0.00047720486,0.000059260645,0.000044606953,0.00013282018,0.00010379323,0.59712917,0.008548085,0.37721118,0.01613211,0.000022377226],"about_ca_topic_score_codex":0.002529537,"about_ca_topic_score_gemma":0.0037679172,"teacher_disagreement_score":0.008445475,"about_ca_system_score_codex":0.0010244122,"about_ca_system_score_gemma":0.0011242202,"threshold_uncertainty_score":0.0282529},"labels":[],"label_agreement":null},{"id":"W1963695813","doi":"10.1007/s10878-012-9591-7","title":"Algorithms for the minimum diameter terminal Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"University of Alberta","keywords":"Steiner tree problem; Terminal (telecommunication); Theory of computation; Combinatorics; Mathematics; Computer science; Tree (set theory); Mathematical optimization; Discrete mathematics; Algorithm; Computer network","score_opus":0.010906366297011227,"score_gpt":0.2224046219714752,"score_spread":0.21149825567446398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963695813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022843903,0.00085768045,0.95953083,0.00074798625,0.00014856059,0.00016309843,0.00034851432,0.0008929316,0.014466446],"genre_scores_gemma":[0.15334448,0.0010558099,0.8363085,0.00025493497,0.00016001193,0.00030474705,0.0011642831,0.00035418296,0.0070530856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.00016773649,0.00004463362,0.0001530444,0.00021950464,0.00011285862],"domain_scores_gemma":[0.9979532,0.0013189717,0.00015000119,0.00024135763,0.0002309812,0.00010541951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518964,0.0012071293,0.0012798029,0.0015282204,0.0009644483,0.0023923123,0.002549418,0.0019725077,0.009239484],"category_scores_gemma":[0.0054737427,0.0007383293,0.00123203,0.0024891153,0.0007309922,0.00400264,0.0020165297,0.0022434965,0.0017780251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055100035,0.0003820949,0.0009177789,0.00050821685,0.00010164769,0.00012470975,0.00022858409,0.49172515,0.0038752211,0.11141069,0.02164661,0.36852822],"study_design_scores_gemma":[0.00018858475,0.000093018076,0.00024095894,0.000054647102,0.000044065735,0.00011997286,0.00008490249,0.8859146,0.0013139211,0.106533095,0.0053961696,0.000015964059],"about_ca_topic_score_codex":0.0020356064,"about_ca_topic_score_gemma":0.0037039574,"teacher_disagreement_score":0.009239484,"about_ca_system_score_codex":0.0015459675,"about_ca_system_score_gemma":0.0016843796,"threshold_uncertainty_score":0.03090918},"labels":[],"label_agreement":null},{"id":"W1963908543","doi":"10.1145/1233501.1233643","title":"Un/DoPack","year":2006,"lang":"en","type":"article","venue":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interconnection; Computer science; Benchmark (surveying); Routing (electronic design automation); Place and route; Field-programmable gate array; Electronic circuit; Electronic design automation; Logic synthesis; Design flow; Channel (broadcasting); Physical design; Electronic engineering; Logic gate; Embedded system; Circuit design; Electrical engineering; Engineering; Telecommunications; Algorithm","score_opus":0.0304033614034512,"score_gpt":0.25759690438206634,"score_spread":0.22719354297861513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963908543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1582372,0.0010759741,0.58147234,0.00081216893,0.00082604506,0.0010063476,0.0035456829,0.032457754,0.2205665],"genre_scores_gemma":[0.5260309,0.0006809364,0.36087134,0.001213825,0.00011503252,0.00056068436,0.0062564765,0.006697727,0.09757313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952877,0.000053332948,0.00002160614,0.000095329124,0.00020967577,0.000091270165],"domain_scores_gemma":[0.9993401,0.00020721363,0.0000758547,0.00019472919,0.00015845902,0.00002360858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494756,0.000991137,0.00040367086,0.0007277178,0.00043251706,0.0014304795,0.00094937586,0.00053961005,0.03615466],"category_scores_gemma":[0.0015426103,0.0005044088,0.00041440185,0.00037777907,0.0004725525,0.0011092087,0.00079428,0.00065176154,0.00568999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052930665,0.00023624088,0.004692446,0.0007368836,0.000055400993,0.00060264405,0.00031432917,0.07350125,0.0499431,0.049946528,0.07605991,0.7433821],"study_design_scores_gemma":[0.00020152479,0.0007738732,0.0040091067,0.00013810939,0.000069385256,0.0010006101,0.000271837,0.4565829,0.11653717,0.0361414,0.3841558,0.000118136966],"about_ca_topic_score_codex":0.0028429895,"about_ca_topic_score_gemma":0.0048220064,"teacher_disagreement_score":0.03615466,"about_ca_system_score_codex":0.00068867137,"about_ca_system_score_gemma":0.0008598406,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1965195759","doi":"10.1145/1391732.1391733","title":"On the trade-off between power and flexibility of FPGA clock networks","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Clock network; Field-programmable gate array; Computer science; Flexibility (engineering); CPU multiplier; Digital clock manager; Clock gating; Clock domain crossing; Embedded system; Clock rate; Clock skew; Synchronous circuit; Clock drift; Clock signal; Telecommunications","score_opus":0.02241358689475075,"score_gpt":0.22132394189350213,"score_spread":0.19891035499875137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965195759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74224496,0.002820526,0.23475981,0.0006879536,0.000042351043,0.00008129783,0.00015438613,0.00037619745,0.018832553],"genre_scores_gemma":[0.97342616,0.00056850957,0.024985222,0.000048188445,0.000024314399,0.000019495328,0.000056418812,0.00008630864,0.0007853393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981055,0.0006863473,0.00012454692,0.0002203229,0.00063023873,0.00023298204],"domain_scores_gemma":[0.9868138,0.010592065,0.0009500113,0.0011251117,0.00039949376,0.0001194794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019425693,0.00062487455,0.0002879416,0.0009199791,0.00044742948,0.0012077073,0.00082064886,0.00045715945,0.0022777054],"category_scores_gemma":[0.011681971,0.0003102376,0.00039347372,0.0012917799,0.00066356605,0.0026817967,0.0005545415,0.0005551129,0.00022846225],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005990957,0.000097550335,0.0069345143,0.00017413743,0.000077120625,0.00029184538,0.00012005454,0.8239364,0.020641742,0.014448209,0.0004628522,0.13221642],"study_design_scores_gemma":[0.000096815165,0.0013649138,0.015436453,0.00009783651,0.00016243901,0.0009784133,0.00027797106,0.92335457,0.035868913,0.017071549,0.0052188807,0.00007125705],"about_ca_topic_score_codex":0.0013880526,"about_ca_topic_score_gemma":0.0040975544,"teacher_disagreement_score":0.0022777054,"about_ca_system_score_codex":0.00093286746,"about_ca_system_score_gemma":0.0004499815,"threshold_uncertainty_score":0.010273457},"labels":[],"label_agreement":null},{"id":"W1966105387","doi":"10.1145/2566668","title":"Accelerating FPGA debug","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Debugging; Multiplexer; Field-programmable gate array; Embedded system; Computer hardware; Routing (electronic design automation); TRACE (psycholinguistics); Real-time computing; Multiplexing; Operating system","score_opus":0.020995923484247735,"score_gpt":0.2264472093870163,"score_spread":0.20545128590276857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966105387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12226742,0.0019350235,0.71008074,0.0006050537,0.00063464127,0.0003572887,0.0015555397,0.09207809,0.07048616],"genre_scores_gemma":[0.6398512,0.000986099,0.33059803,0.0002617504,0.000083293686,0.00028124396,0.002175224,0.004368158,0.021394992],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906915,0.00017581625,0.00004221941,0.00016071458,0.0003742718,0.00017790095],"domain_scores_gemma":[0.9977448,0.0010899543,0.00010749371,0.00057946576,0.00039601658,0.00008219419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979911,0.0015034261,0.00048081393,0.0014828079,0.00044712,0.0017695592,0.0015608461,0.00057991565,0.03835133],"category_scores_gemma":[0.005115234,0.00053572713,0.00046550564,0.0008458549,0.000441144,0.0029146327,0.0015478801,0.0010032658,0.006180975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015382803,0.00018484799,0.00844498,0.0008768965,0.0001096095,0.0005117405,0.00045812665,0.063182175,0.05963715,0.039613646,0.066651225,0.7587913],"study_design_scores_gemma":[0.0005739012,0.0009121689,0.004911767,0.0002855032,0.0001553138,0.0013196121,0.00044089946,0.51564693,0.20735073,0.029190304,0.23904915,0.00016380267],"about_ca_topic_score_codex":0.0019184055,"about_ca_topic_score_gemma":0.002820398,"teacher_disagreement_score":0.03835133,"about_ca_system_score_codex":0.0009126711,"about_ca_system_score_gemma":0.0010654096,"threshold_uncertainty_score":0.12829798},"labels":[],"label_agreement":null},{"id":"W1966460368","doi":"10.1145/2554688.2554783","title":"Towards interconnect-adaptive packing for FPGAs","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Computer science; Interconnection; Field-programmable gate array; Software; Lookup table; Path (computing); Computer architecture; Parallel computing; Computer engineering; Embedded system; Operating system; Computer network","score_opus":0.01697004714207424,"score_gpt":0.22348065476349585,"score_spread":0.20651060762142162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966460368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11827799,0.0016539599,0.85873574,0.0004122432,0.00013068505,0.0000857306,0.00015401839,0.007327321,0.0132222185],"genre_scores_gemma":[0.36753106,0.0009831141,0.6257902,0.00028102068,0.000076885386,0.00009349212,0.00046838832,0.0005638479,0.0042120335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952006,0.00010459775,0.000028946444,0.000065009604,0.00020365289,0.000077750316],"domain_scores_gemma":[0.99918324,0.00031398784,0.00011884868,0.00022070177,0.00013088688,0.000032300333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042871063,0.0008048107,0.0004813888,0.0008480516,0.00029764246,0.0009083906,0.0012037181,0.0004880162,0.002461611],"category_scores_gemma":[0.001793365,0.00044464096,0.00042050405,0.0010041613,0.0004308648,0.0013988827,0.0008526897,0.00085778424,0.000808471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038518803,0.00020383434,0.0033655914,0.00042207955,0.000053354757,0.0006004595,0.00035396835,0.36204016,0.07499895,0.07240139,0.010031494,0.47514355],"study_design_scores_gemma":[0.00004060263,0.00027409793,0.0010753251,0.000078896024,0.00002293003,0.00030741986,0.00007633029,0.9162205,0.038782597,0.026606299,0.016487902,0.000027079133],"about_ca_topic_score_codex":0.0011567456,"about_ca_topic_score_gemma":0.0019812644,"teacher_disagreement_score":0.002461611,"about_ca_system_score_codex":0.000764473,"about_ca_system_score_gemma":0.0005843482,"threshold_uncertainty_score":0.008234918},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; Routing (electronic design automation); Embedded system; Spice; CAD; Computer architecture; Power (physics); Gate array; Logic gate; Interconnection; Logic synthesis; Architecture; Electronic engineering; Engineering; Telecommunications","score_opus":0.011969027675170664,"score_gpt":0.23785888493443672,"score_spread":0.22588985725926605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967128905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27552515,0.001019668,0.68097717,0.0002062827,0.0000778316,0.00018118459,0.003474091,0.014619039,0.023919491],"genre_scores_gemma":[0.87191725,0.0004821734,0.11994597,0.000050966406,0.000019559579,0.00016322304,0.0024105625,0.00076381804,0.004246476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.000060482667,0.000018271614,0.000063160456,0.00016071885,0.000025243362],"domain_scores_gemma":[0.99943954,0.00028821387,0.00006620396,0.00009980106,0.00009493396,0.000011279209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036663166,0.0011614719,0.000370789,0.0016350548,0.00031403443,0.00058048277,0.0009700865,0.00032978092,0.0065067722],"category_scores_gemma":[0.0017500885,0.00042464814,0.0005526561,0.00091531425,0.00017706394,0.0013038868,0.00035600885,0.0002948382,0.000590013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021736084,0.000057695488,0.0067347386,0.00025527578,0.000087293156,0.00015191954,0.00007680721,0.7735782,0.010068647,0.0051589585,0.0051607373,0.1984524],"study_design_scores_gemma":[0.000021831785,0.0001320852,0.0019509714,0.000020667003,0.000023982853,0.00013158467,0.000022804992,0.98090786,0.010292921,0.0017251088,0.00474861,0.000021573096],"about_ca_topic_score_codex":0.0028057925,"about_ca_topic_score_gemma":0.0046050414,"teacher_disagreement_score":0.0065067722,"about_ca_system_score_codex":0.00052685983,"about_ca_system_score_gemma":0.0003361191,"threshold_uncertainty_score":0.021767318},"labels":[],"label_agreement":null},{"id":"W1967526445","doi":"10.1109/fpl.2009.5272331","title":"Improving the memory footprint and runtime scalability of FPGA CAD algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scalability; Computer science; Memory footprint; Field-programmable gate array; Embedded system; Workstation; CAD; FPGA prototype; Footprint; Computer architecture; Operating system; Engineering","score_opus":0.006805681439527634,"score_gpt":0.1995599858790898,"score_spread":0.19275430443956215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967526445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21830888,0.0039704605,0.733521,0.0010081523,0.00018247437,0.00014778943,0.00031209723,0.011243764,0.031305455],"genre_scores_gemma":[0.5477717,0.001190549,0.44305643,0.0002111031,0.00012631885,0.00014307113,0.0006278583,0.00073868386,0.0061342707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.00021624652,0.00009949641,0.00019285563,0.0004532352,0.0001521142],"domain_scores_gemma":[0.99719965,0.001273573,0.00018802866,0.0007398513,0.0005281931,0.000070750335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010092888,0.00086025987,0.00058134954,0.0011955007,0.00044099012,0.0012978362,0.0016799411,0.00049415766,0.0065767863],"category_scores_gemma":[0.0071101026,0.00031326682,0.0005335492,0.0013640794,0.00037054234,0.0029676375,0.0008455406,0.00074072654,0.0011661258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048128137,0.00015346975,0.004759357,0.00031601018,0.00007540841,0.00018395849,0.00023840282,0.13292824,0.06266128,0.012432378,0.0072061312,0.77856404],"study_design_scores_gemma":[0.00010204761,0.00022639649,0.0021794941,0.00005638658,0.0000699929,0.00023685454,0.00014549775,0.92256474,0.05792958,0.007024906,0.009432692,0.000031389158],"about_ca_topic_score_codex":0.003384692,"about_ca_topic_score_gemma":0.005337076,"teacher_disagreement_score":0.0065767863,"about_ca_system_score_codex":0.0007046215,"about_ca_system_score_gemma":0.0010113582,"threshold_uncertainty_score":0.022001505},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009445759865425845,"score_gpt":0.19082485218655057,"score_spread":0.18137909232112473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967786783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07577511,0.001623271,0.898296,0.000425864,0.0001290137,0.00013377397,0.0006530933,0.0006784648,0.022285307],"genre_scores_gemma":[0.45431328,0.0024788792,0.53243905,0.0002097481,0.00011948602,0.00012982733,0.002177635,0.00021468813,0.00791737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929726,0.00015085352,0.00007935878,0.00016680201,0.0001950738,0.000110580986],"domain_scores_gemma":[0.9991339,0.00039361842,0.00011946301,0.00022918388,0.000081363585,0.00004256117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044889117,0.00054054894,0.0009985414,0.0009331542,0.0009478597,0.0013255632,0.0008369165,0.0011691862,0.008084097],"category_scores_gemma":[0.002934059,0.0005714829,0.00066156435,0.0024742056,0.00052598177,0.0029594009,0.001345321,0.00066431816,0.0013775727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056649593,0.00016061313,0.0015431386,0.0006937614,0.000090643574,0.0005798769,0.00040105384,0.24592717,0.016676947,0.23300554,0.016286513,0.4840682],"study_design_scores_gemma":[0.00009551069,0.00032977262,0.0013763774,0.0001435156,0.000057917452,0.0017929608,0.00032340753,0.63612807,0.016058017,0.28976116,0.05388336,0.00004997046],"about_ca_topic_score_codex":0.00067046715,"about_ca_topic_score_gemma":0.0008326625,"teacher_disagreement_score":0.008084097,"about_ca_system_score_codex":0.0005342168,"about_ca_system_score_gemma":0.0004538653,"threshold_uncertainty_score":0.027043998},"labels":[],"label_agreement":null},{"id":"W1970788183","doi":"10.1109/82.933810","title":"Some space considerations of VLSI systolic array mappings","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Systolic array; Nested loop join; Loop (graph theory); Transformation (genetics); Very-large-scale integration; Algorithm; Computer science; Space (punctuation); Transformation matrix; Matrix (chemical analysis); Variable (mathematics); Array data structure; Mathematics; Parallel computing; Combinatorics; Mathematical analysis; Physics","score_opus":0.01961833748466359,"score_gpt":0.21210389494820767,"score_spread":0.19248555746354407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970788183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044752955,0.0075195488,0.8729763,0.0015528644,0.00043540008,0.00005047019,0.00013044846,0.00030383968,0.07227822],"genre_scores_gemma":[0.7138072,0.010853474,0.2419135,0.00070937333,0.0011555617,0.00030918256,0.0002425247,0.00041220858,0.030596994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995096,0.00014287127,0.00003470047,0.00006374546,0.00020722051,0.00004198365],"domain_scores_gemma":[0.99922764,0.00044529684,0.000056228473,0.00010740653,0.00014879063,0.000014609439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054098526,0.00050795893,0.00028875505,0.0005990209,0.0006016002,0.0013390081,0.00055217935,0.00048255935,0.005216314],"category_scores_gemma":[0.0029732946,0.00031512429,0.00045648255,0.0009753036,0.00091251027,0.0027532764,0.0005317752,0.0006750579,0.0008869767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250637,0.000021173673,0.00033583638,0.00022848384,0.000010724536,0.00030493885,0.00029884907,0.06844329,0.011185821,0.86303,0.0023410337,0.053737342],"study_design_scores_gemma":[0.000019578154,0.0002136486,0.00074636866,0.00007278205,0.000019655077,0.00064479077,0.00024301937,0.29635164,0.010966546,0.63452715,0.056164928,0.000029961158],"about_ca_topic_score_codex":0.00078268733,"about_ca_topic_score_gemma":0.00092524954,"teacher_disagreement_score":0.005216314,"about_ca_system_score_codex":0.0005868943,"about_ca_system_score_gemma":0.0004700401,"threshold_uncertainty_score":0.017450273},"labels":[],"label_agreement":null},{"id":"W1972041243","doi":"10.1145/1230800.1230811","title":"The exact channel density and compound design for generic universal switch blocks","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"USB; Block (permutation group theory); USB hub; Computer science; eXtensible Host Controller Interface (xHCI); Routing (electronic design automation); Channel (broadcasting); Disjoint sets; Combinatorics; Discrete mathematics; Topology (electrical circuits); Physics; Mathematics; Embedded system; Computer network; Operating system; Software","score_opus":0.02187675245786297,"score_gpt":0.23029956350674152,"score_spread":0.20842281104887855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972041243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18792032,0.0005477214,0.79156095,0.00013791432,0.00003058848,0.00008072291,0.00017344006,0.00036310297,0.01918522],"genre_scores_gemma":[0.8619366,0.0003521743,0.13452663,0.000056439418,0.000028845054,0.00008274321,0.000110127454,0.00004937361,0.00285702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.00006958345,0.000025478226,0.00009732251,0.00013492293,0.00009319405],"domain_scores_gemma":[0.99958926,0.00015018893,0.000092143295,0.000071983966,0.00006856317,0.000027888984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043565777,0.0005160425,0.00055484334,0.0004077653,0.00033401928,0.000646948,0.00060245144,0.0004036189,0.0030394457],"category_scores_gemma":[0.0015389954,0.00034262237,0.00035848448,0.00044325794,0.00065388816,0.0013522215,0.0007814986,0.00038506696,0.00027400366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047645578,0.00007508795,0.0017907557,0.00032633194,0.00004480274,0.00014781965,0.00014804919,0.6327746,0.04337158,0.21103597,0.0017636728,0.10804481],"study_design_scores_gemma":[0.000049266368,0.00037038792,0.0008381919,0.00003732959,0.000039819806,0.00023512119,0.000039802188,0.90308475,0.0194264,0.07030918,0.005543408,0.00002634535],"about_ca_topic_score_codex":0.0010144231,"about_ca_topic_score_gemma":0.0020583565,"teacher_disagreement_score":0.0030394457,"about_ca_system_score_codex":0.0009744954,"about_ca_system_score_gemma":0.00069482176,"threshold_uncertainty_score":0.010167956},"labels":[],"label_agreement":null},{"id":"W1972437065","doi":"10.1109/tvlsi.2012.2202326","title":"Combined Architecture/Algorithm Approach to Fast FPGA Routing","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Routing (electronic design automation); Logic block; Router; Multipath routing; Parallel computing; Static routing; Algorithm; Embedded system; Computer network; Routing protocol","score_opus":0.011929404047669444,"score_gpt":0.21617838698975392,"score_spread":0.20424898294208446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972437065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006822305,0.0002734878,0.98399204,0.0001569508,0.00004793563,0.000067966146,0.000042582575,0.0009208685,0.0076758657],"genre_scores_gemma":[0.061779667,0.00021858499,0.93459886,0.00008183182,0.000027630267,0.00013337578,0.00014753643,0.00010210694,0.0029103807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943095,0.00015415579,0.000030653024,0.0000862822,0.00023651935,0.000061499544],"domain_scores_gemma":[0.99969256,0.000097953605,0.000021636364,0.00009697967,0.00008136003,0.000009462834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039998794,0.00072427787,0.00051742827,0.00093597785,0.00037425256,0.0010632814,0.0012486522,0.0006926496,0.0067660394],"category_scores_gemma":[0.0007827869,0.0003690365,0.0006881128,0.0009641029,0.00039557464,0.00090838154,0.0006578486,0.00081460294,0.0014438845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001110485,0.00011116611,0.00082941423,0.00021799398,0.00010485103,0.00016219569,0.00005741594,0.4735066,0.021345934,0.070550166,0.005562182,0.427441],"study_design_scores_gemma":[0.000054772077,0.00011052895,0.00023488252,0.0000209835,0.000036181114,0.00014724738,0.000014905679,0.95416236,0.006573289,0.023246948,0.01538301,0.000014892889],"about_ca_topic_score_codex":0.0015346819,"about_ca_topic_score_gemma":0.0032685257,"teacher_disagreement_score":0.0067660394,"about_ca_system_score_codex":0.0006601533,"about_ca_system_score_gemma":0.0009953186,"threshold_uncertainty_score":0.022634685},"labels":[],"label_agreement":null},{"id":"W1973454118","doi":"10.1145/611817.611865","title":"Recursive circuit clustering for minimum delay and area","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Netlist; Computer science; Field-programmable gate array; Node (physics); Cluster (spacecraft); Parallel computing; Reduction (mathematics); Algorithm; Minification; Mathematics; Embedded system; Engineering; Artificial intelligence; Computer network","score_opus":0.023671383990914813,"score_gpt":0.2174573416257733,"score_spread":0.19378595763485848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973454118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014034229,0.00020406426,0.9818678,0.00006227028,0.000014749512,0.000057786998,0.000043608023,0.001180843,0.0025345506],"genre_scores_gemma":[0.15041839,0.00016347162,0.8446026,0.000060851024,0.000021408807,0.00011592957,0.00026234234,0.00027350508,0.0040814974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956876,0.000058426325,0.000020449903,0.000101211146,0.00018577182,0.00006530527],"domain_scores_gemma":[0.9995378,0.00013443093,0.000062454455,0.00011516243,0.00013506316,0.000015103719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024126637,0.0006753358,0.0005692114,0.0008722226,0.00058820867,0.0004956446,0.0011368694,0.00046493334,0.0035452414],"category_scores_gemma":[0.0011227385,0.000340181,0.0004741939,0.0010576048,0.00041473814,0.00080135587,0.00055316155,0.0005353354,0.0010628044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001133112,0.000074629614,0.0006391063,0.00022944939,0.00006479396,0.00011557406,0.00016306515,0.33086392,0.08416968,0.036062483,0.0067017316,0.5408022],"study_design_scores_gemma":[0.00003807986,0.00019729487,0.0007738545,0.000018213856,0.00004694412,0.00031468994,0.000039305884,0.91496205,0.051277477,0.016421434,0.015874965,0.000035710684],"about_ca_topic_score_codex":0.0026512584,"about_ca_topic_score_gemma":0.0056654364,"teacher_disagreement_score":0.0035452414,"about_ca_system_score_codex":0.000875024,"about_ca_system_score_gemma":0.0010284975,"threshold_uncertainty_score":0.011860073},"labels":[],"label_agreement":null},{"id":"W1976209959","doi":"10.1109/icmel.2008.4559325","title":"A new computer-aided multi-dimensional device modeling algorithm based on binning concepts","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Black box; Generality; Set (abstract data type); Context (archaeology); Simplicity; Simple (philosophy); Artificial intelligence","score_opus":0.03864097638677234,"score_gpt":0.25932493042111315,"score_spread":0.22068395403434082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976209959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009353912,0.000035065477,0.9982704,0.000021939148,0.0000090471885,0.000013010086,0.000011085281,0.00028897036,0.000415111],"genre_scores_gemma":[0.039835934,0.000109723565,0.95844275,0.000053371314,0.000008987516,0.00010740806,0.00008625526,0.00012502902,0.001230569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997085,0.000052767507,0.000018665569,0.000049309936,0.0001513031,0.000019399422],"domain_scores_gemma":[0.99956435,0.00018281992,0.000054500233,0.000078217694,0.00010229091,0.000017868702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063764415,0.000706092,0.0007876629,0.0007559349,0.00042549643,0.0008216539,0.0013204808,0.00069609104,0.0029364966],"category_scores_gemma":[0.0013211148,0.0005435696,0.000564696,0.0008180602,0.00046986676,0.0016410556,0.0009352259,0.001187992,0.0007631287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007024045,0.00006289502,0.00060071744,0.00013392522,0.00004490907,0.00006309538,0.00014754271,0.6222154,0.020773888,0.06977172,0.0026703337,0.28344524],"study_design_scores_gemma":[0.0000039498427,0.000013731301,0.00004351875,0.000006550809,0.0000042321426,0.000032658198,0.000004950727,0.9906793,0.0023417843,0.00427415,0.0025882502,0.00000686513],"about_ca_topic_score_codex":0.0027378583,"about_ca_topic_score_gemma":0.0046345573,"teacher_disagreement_score":0.0029364966,"about_ca_system_score_codex":0.0006925661,"about_ca_system_score_gemma":0.00089943403,"threshold_uncertainty_score":0.009823501},"labels":[],"label_agreement":null},{"id":"W1977406187","doi":"10.1145/1723112.1723157","title":"The impact of interconnect architecture on via-programmed structured ASICs (VPSAs)","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Application-specific integrated circuit; Interconnection; Routing (electronic design automation); Computer science; Field-programmable gate array; Embedded system; Computer network","score_opus":0.00483226911727936,"score_gpt":0.23628357229029442,"score_spread":0.23145130317301507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977406187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99054927,0.0007012987,0.0042912606,0.000071184346,0.000038993563,0.000019431951,0.00015121336,0.00015692452,0.0040204446],"genre_scores_gemma":[0.99655485,0.00023767617,0.0024401508,0.00001599518,0.000012529223,0.000008493079,0.000104055965,0.000038905833,0.0005875102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.00013527751,0.000030919968,0.00006055781,0.0001502504,0.000105271785],"domain_scores_gemma":[0.99669695,0.0018838148,0.0005891606,0.00028563535,0.00045262423,0.000091818074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045906473,0.0006552759,0.0002665015,0.00042831685,0.00023555612,0.0007360195,0.00044317578,0.00042994763,0.001570864],"category_scores_gemma":[0.0025689492,0.00014191291,0.0001791955,0.00059178815,0.00038312373,0.000926816,0.0002861289,0.00027998266,0.00024116058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020552708,0.0003584897,0.01603672,0.0007904638,0.00020683554,0.0008084259,0.000107358865,0.58519614,0.3375512,0.0040033837,0.0013242551,0.051561456],"study_design_scores_gemma":[0.0001392359,0.02102785,0.034841683,0.00011840634,0.0006128452,0.0018434753,0.00039545036,0.4685012,0.46216196,0.0027869178,0.0074571115,0.00011388752],"about_ca_topic_score_codex":0.0004393541,"about_ca_topic_score_gemma":0.00072746887,"teacher_disagreement_score":0.001570864,"about_ca_system_score_codex":0.00036446008,"about_ca_system_score_gemma":0.00018202039,"threshold_uncertainty_score":0.0052550435},"labels":[],"label_agreement":null},{"id":"W1978104777","doi":"10.1109/ictai.2010.25","title":"An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning","year":2010,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Angers Loire Métropole","keywords":"Memetic algorithm; Computer science; Operator (biology); Graph; Graph partition; Algorithm; Local search (optimization); Combinatorics; Mathematics; Theoretical computer science","score_opus":0.011153185135786135,"score_gpt":0.2622558178298913,"score_spread":0.2511026326941052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978104777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01901976,0.00019378046,0.9758961,0.00018656117,0.000044765926,0.000064521424,0.000044843095,0.00031518113,0.00423448],"genre_scores_gemma":[0.39682034,0.00021386621,0.5974817,0.00018568884,0.00005228432,0.00041238772,0.00017253487,0.000104401086,0.0045568505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997081,0.000084616164,0.000012679134,0.00004884339,0.000103101134,0.00004273335],"domain_scores_gemma":[0.99970657,0.0001357363,0.000036025034,0.000042627053,0.000058448873,0.000020617577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005321598,0.00052808033,0.0006565987,0.00092779857,0.0005296695,0.0006782894,0.001252585,0.0010495231,0.0026882258],"category_scores_gemma":[0.0014797259,0.00026120726,0.00051399006,0.00068650435,0.00047289566,0.00072237017,0.0010821894,0.0005833285,0.0004367959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014019012,0.000093611736,0.00065728824,0.00015923801,0.00009589604,0.00014761473,0.0001696186,0.7119963,0.020147221,0.033804566,0.0040044594,0.22858395],"study_design_scores_gemma":[0.000027202748,0.000042659827,0.00010329288,0.000007892291,0.00001212823,0.00005004525,0.000016389851,0.98967415,0.0020188144,0.005967986,0.0020734447,0.000006059441],"about_ca_topic_score_codex":0.000983477,"about_ca_topic_score_gemma":0.0013433626,"teacher_disagreement_score":0.0026882258,"about_ca_system_score_codex":0.00056883635,"about_ca_system_score_gemma":0.0006258854,"threshold_uncertainty_score":0.00899303},"labels":[],"label_agreement":null},{"id":"W1978440339","doi":"10.1007/s10878-008-9148-y","title":"A nonlinear optimization methodology for VLSI fixed-outline floorplanning","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Floorplan; Very-large-scale integration; Mathematical optimization; Nonlinear programming; Sizing; Computer science; Optimization problem; Nonlinear system; Mathematics","score_opus":0.03905878121476061,"score_gpt":0.2762490240574581,"score_spread":0.2371902428426975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978440339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015826824,0.000046042147,0.9965442,0.000027375783,0.0000102681115,0.000026658916,0.000015379608,0.00010048879,0.0016470191],"genre_scores_gemma":[0.115889765,0.00024345829,0.87727785,0.000061719365,0.00003525572,0.00020951498,0.00009272228,0.0001708916,0.0060187127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972075,0.000078874786,0.000012403227,0.000034513192,0.00012820149,0.00002524182],"domain_scores_gemma":[0.9996413,0.00017695513,0.00004010611,0.000036225705,0.0000927003,0.000012619444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658054,0.0007644216,0.00048644614,0.0005035664,0.00045238849,0.00050640566,0.0012080169,0.00048039065,0.0036325334],"category_scores_gemma":[0.0011978357,0.0005097533,0.000752961,0.00054230023,0.00052742136,0.00068606256,0.0007928416,0.0008593476,0.0006602259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019625357,0.00002802383,0.0001363736,0.0000811256,0.000020791884,0.00003221665,0.000028245668,0.900829,0.0050933375,0.019908039,0.00068154105,0.073141605],"study_design_scores_gemma":[0.0000031462612,0.000019032432,0.000039313174,0.0000045108704,0.000004269031,0.000014956846,0.0000033201902,0.99530435,0.00067245367,0.003245285,0.0006862066,0.0000032508742],"about_ca_topic_score_codex":0.0035326772,"about_ca_topic_score_gemma":0.006508135,"teacher_disagreement_score":0.0036325334,"about_ca_system_score_codex":0.0006737393,"about_ca_system_score_gemma":0.0011533585,"threshold_uncertainty_score":0.012152076},"labels":[],"label_agreement":null},{"id":"W1980284003","doi":"10.5555/1899721.1899786","title":"Symmetry-aware TCG-based placement design under complex multi-group constraints for analog circuit layouts","year":2010,"lang":"en","type":"article","venue":"Asia and South Pacific Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive closure; Computer science; Representation (politics); Graph; Symmetry (geometry); Integrated circuit layout; Algorithm; Computational complexity theory; Time complexity; Topology (electrical circuits); Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Integrated circuit; Combinatorics; Geometry","score_opus":0.07935021048947266,"score_gpt":0.2639427336879957,"score_spread":0.18459252319852304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980284003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022247145,0.000041081337,0.975195,0.00004921052,0.000018687544,0.000053198655,0.000022691987,0.00038307378,0.0019899893],"genre_scores_gemma":[0.43805373,0.00008958158,0.5604286,0.000059021346,0.000022767215,0.00010288088,0.000097938,0.00010097713,0.0010444418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995559,0.0001239596,0.000028596049,0.000055029355,0.00019819723,0.000038306713],"domain_scores_gemma":[0.99940383,0.00019935559,0.00011197348,0.00016064123,0.0001007709,0.000023371344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037216747,0.00056075485,0.00045827313,0.0005808644,0.00043857624,0.00055834133,0.0008725043,0.00036172918,0.0021922074],"category_scores_gemma":[0.0012624016,0.0002478614,0.00038024504,0.00056983344,0.0005382133,0.0009434439,0.000579189,0.00046936623,0.00038738636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025023852,0.000104382045,0.0007950299,0.00022770799,0.000042858082,0.0004102011,0.00027069967,0.49974662,0.10542348,0.062386815,0.0028282222,0.3275138],"study_design_scores_gemma":[0.00004915239,0.00014352554,0.00017280121,0.000010130543,0.00001396637,0.00018430222,0.00004121549,0.9558713,0.027383132,0.013090084,0.0030274778,0.000012837792],"about_ca_topic_score_codex":0.0010303205,"about_ca_topic_score_gemma":0.0017636401,"teacher_disagreement_score":0.0021922074,"about_ca_system_score_codex":0.0004907582,"about_ca_system_score_gemma":0.0008002433,"threshold_uncertainty_score":0.0073336363},"labels":[],"label_agreement":null},{"id":"W1981233168","doi":"10.1109/sips.2006.352557","title":"A Structural Study and Hyperedge Clustering Technique for Large Scale Circuits","year":2006,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Benchmark (surveying); Computer science; Data mining; Correlation clustering; Electronic circuit; Suite; Clustering high-dimensional data; Artificial intelligence; Engineering","score_opus":0.03488152956401719,"score_gpt":0.3033113079713055,"score_spread":0.2684297784072883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981233168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09292419,0.0004965842,0.90192443,0.00020323954,0.00003370174,0.000085007574,0.00007668428,0.00042073836,0.0038354034],"genre_scores_gemma":[0.5551807,0.00066458876,0.43759486,0.000090291665,0.000057127047,0.0000886579,0.0004459549,0.00019112411,0.0056866817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.00007934171,0.000014090892,0.00007547482,0.0002496375,0.000030344947],"domain_scores_gemma":[0.99851483,0.00051819475,0.00012516393,0.00027728794,0.000520762,0.000043680488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040802738,0.00039762337,0.00030974997,0.0011214019,0.0006585794,0.0007022882,0.0009549782,0.000584959,0.0024456054],"category_scores_gemma":[0.002539974,0.00024319944,0.0004967933,0.0015848895,0.0005297397,0.0014522251,0.00041110304,0.0007600384,0.00040655272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022841124,0.00015659313,0.0030587167,0.00037044726,0.00010782419,0.0002197456,0.00039957362,0.4011066,0.13529466,0.0559345,0.0023797797,0.40074316],"study_design_scores_gemma":[0.000019002044,0.0002626671,0.0029332328,0.00002127209,0.00005086821,0.00031680436,0.0001479619,0.9175292,0.05721081,0.0139002055,0.0075788856,0.00002900507],"about_ca_topic_score_codex":0.0019686222,"about_ca_topic_score_gemma":0.0039685927,"teacher_disagreement_score":0.0024456054,"about_ca_system_score_codex":0.00074273185,"about_ca_system_score_gemma":0.000640996,"threshold_uncertainty_score":0.008181393},"labels":[],"label_agreement":null},{"id":"W1981519894","doi":"10.1109/ccece.2008.4564891","title":"FPGA placement optimization methodology survey","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Simulated annealing; Field-programmable gate array; Computer science; Gate array; Genetic algorithm; MATLAB; Logic synthesis; Digital electronics; Adaptive simulated annealing; Logic gate; Programmable logic device; Parallel computing; Algorithm; Computer engineering; Computer hardware; Embedded system; Electronic circuit; Engineering; Electrical engineering","score_opus":0.05992395512680344,"score_gpt":0.22383134137445607,"score_spread":0.16390738624765264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981519894","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005432224,0.011313745,0.95420784,0.00026601594,0.00014756495,0.00012833044,0.00014706663,0.0005914107,0.027765771],"genre_scores_gemma":[0.17903699,0.033196166,0.7516891,0.00028053267,0.00029236983,0.00036511183,0.0008300502,0.00038803587,0.03392163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999418,0.00013251528,0.000039317787,0.000084266794,0.00028665835,0.000039199324],"domain_scores_gemma":[0.9997174,0.000077591656,0.000035085744,0.000033575678,0.00012766996,0.000008753862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005467591,0.0009551052,0.0005975216,0.0013404315,0.00035407313,0.00088504516,0.00089268154,0.00058763986,0.004539466],"category_scores_gemma":[0.0007092695,0.00047293305,0.0007675509,0.0019630513,0.00023194922,0.00050910556,0.00032915676,0.00045701477,0.0018543643],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059894723,0.00005597153,0.0006720431,0.00085535145,0.00007799937,0.00014739306,0.000049720096,0.31668222,0.009716567,0.024475325,0.008353282,0.63885427],"study_design_scores_gemma":[0.00005508,0.0003833723,0.0019984473,0.0004155464,0.000090092406,0.0012133386,0.000120175406,0.76527566,0.023004033,0.021758892,0.18562624,0.000059142505],"about_ca_topic_score_codex":0.0018879152,"about_ca_topic_score_gemma":0.0021024484,"teacher_disagreement_score":0.004539466,"about_ca_system_score_codex":0.0007007796,"about_ca_system_score_gemma":0.00088030845,"threshold_uncertainty_score":0.015186012},"labels":[],"label_agreement":null},{"id":"W1981813514","doi":"10.1016/j.disopt.2005.03.005","title":"Multiroute flows: Cut-trees and realizability","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Realizability; Mathematics; Characterization (materials science); Combinatorics; Diagonal; Simple (philosophy); Context (archaeology); Discrete mathematics; Tree (set theory); Matrix (chemical analysis); Flow network; Integer (computer science); Algorithm; Computer science","score_opus":0.006429571201527289,"score_gpt":0.215421699780067,"score_spread":0.20899212857853972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981813514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030945797,0.0005701728,0.9537155,0.00033191819,0.000040217124,0.00002959836,0.00009661784,0.00022530295,0.014044822],"genre_scores_gemma":[0.530034,0.0012953185,0.4553094,0.00015062356,0.00012081666,0.00012856575,0.0004329455,0.00033198565,0.012196332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996811,0.00007547153,0.000015819662,0.000057979436,0.00013147012,0.000038141006],"domain_scores_gemma":[0.9987184,0.00085031707,0.00012869935,0.00014867494,0.000105491396,0.00004850344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006958055,0.00048516304,0.00046048212,0.00070836226,0.0005166496,0.0014393184,0.0008128847,0.0008658539,0.006977339],"category_scores_gemma":[0.0035077194,0.00049931987,0.00045938976,0.000829057,0.00097628107,0.0026483296,0.00074919435,0.0017836909,0.00043106446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012933169,0.00008611553,0.0006877715,0.00013792598,0.000016659045,0.00011078711,0.00013579048,0.08907205,0.003684751,0.762876,0.00230848,0.14075439],"study_design_scores_gemma":[0.0000313257,0.00004990327,0.00040612664,0.00004983621,0.000018661542,0.00015472062,0.000052131807,0.2335156,0.004043256,0.75591594,0.005748316,0.000014089925],"about_ca_topic_score_codex":0.00066864304,"about_ca_topic_score_gemma":0.0016178117,"teacher_disagreement_score":0.006977339,"about_ca_system_score_codex":0.0005269272,"about_ca_system_score_gemma":0.0005005341,"threshold_uncertainty_score":0.023341537},"labels":[],"label_agreement":null},{"id":"W1982429141","doi":"10.1016/j.dam.2012.12.010","title":"Graph models and their efficient implementation for sparse Jacobian matrix determination","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Mathematics; Sparse matrix; Graph; Matrix (chemical analysis); Mathematical optimization; Algorithm; Combinatorics; Applied mathematics","score_opus":0.016980310951542593,"score_gpt":0.2596519545351472,"score_spread":0.24267164358360463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982429141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065100547,0.00007120211,0.9892811,0.0000836668,0.000029450948,0.000028022836,0.00010485383,0.0012976616,0.002594071],"genre_scores_gemma":[0.27340737,0.00032325383,0.7172491,0.0001330125,0.000055568926,0.00017019731,0.0006487948,0.00046610428,0.0075466423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997255,0.00007588396,0.000011758379,0.00003815729,0.0001200515,0.000028593648],"domain_scores_gemma":[0.99940276,0.00025627512,0.000047683214,0.00015253523,0.00011547898,0.000025307634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026875097,0.0006439445,0.00041696327,0.00066129334,0.00036198323,0.0008311583,0.0010305989,0.00067819626,0.0071062525],"category_scores_gemma":[0.0023429664,0.00037113077,0.00044223576,0.0010056616,0.00036038435,0.0014701057,0.000697533,0.00088169985,0.0025373707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020770876,0.0001527505,0.00061072735,0.0001700335,0.00005568573,0.00019807246,0.0001630233,0.4422633,0.014660623,0.17849465,0.012660113,0.35036328],"study_design_scores_gemma":[0.000015391674,0.000025877334,0.00007356022,0.000007878793,0.0000067667747,0.000041428004,0.00001767143,0.95777905,0.0032948244,0.035251338,0.0034740265,0.000012165439],"about_ca_topic_score_codex":0.004698816,"about_ca_topic_score_gemma":0.012378629,"teacher_disagreement_score":0.0071062525,"about_ca_system_score_codex":0.0003913051,"about_ca_system_score_gemma":0.0007316194,"threshold_uncertainty_score":0.023772776},"labels":[],"label_agreement":null},{"id":"W1983950263","doi":"10.1145/348019.348101","title":"Timing-driven routing for symmetrical array-based FPGAs","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; National Science Council; University of Texas at Austin","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Router; Static routing; Multipath routing; Equal-cost multi-path routing; Link-state routing protocol; Placement; Dynamic Source Routing; Parallel computing; Computer network; Embedded system; Routing protocol; Physical design; Circuit design","score_opus":0.026798628100344363,"score_gpt":0.24811098958298666,"score_spread":0.2213123614826423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983950263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05021618,0.00017736411,0.9455443,0.00007197259,0.00005017888,0.00003052968,0.00003006078,0.0007026329,0.003176814],"genre_scores_gemma":[0.53934175,0.00028120974,0.4557886,0.00011841105,0.00002900288,0.00003844277,0.0001299151,0.00008807462,0.004184588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.000042180513,0.000012398612,0.00002830869,0.00006915884,0.000020718844],"domain_scores_gemma":[0.9998165,0.000053523247,0.000040254476,0.000048737096,0.00003155178,0.000009450064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018080694,0.00023525736,0.00018013996,0.00022391453,0.00021797899,0.00029401376,0.00058653246,0.00025425674,0.0015357748],"category_scores_gemma":[0.0003877734,0.00010881657,0.00020939537,0.00019697436,0.00017310784,0.00047173435,0.00022811574,0.00026111264,0.00026718128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024364675,0.00010179005,0.001335246,0.00026142932,0.00005571297,0.0006225026,0.000080938924,0.43895087,0.18371636,0.06997307,0.0034086606,0.30124977],"study_design_scores_gemma":[0.00002133585,0.00022503697,0.00025978827,0.000008499539,0.000021084223,0.00029522524,0.000015778001,0.94995415,0.03604026,0.007331014,0.00581325,0.0000145961885],"about_ca_topic_score_codex":0.000501949,"about_ca_topic_score_gemma":0.0014301166,"teacher_disagreement_score":0.0015357748,"about_ca_system_score_codex":0.00025193367,"about_ca_system_score_gemma":0.00032536045,"threshold_uncertainty_score":0.005137682},"labels":[],"label_agreement":null},{"id":"W1983992983","doi":"10.1002/cta.332","title":"A hybrid evolutionary analogue module placement algorithm for integrated circuit layout designs","year":2005,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"KU Leuven; Carnegie Mellon University","keywords":"Simulated annealing; Algorithm; Computer science; Integrated circuit layout; Placement; Representation (politics); Genetic algorithm; Electronic circuit; Integrated circuit; Circuit design; Physical design; Embedded system; Engineering","score_opus":0.01838131401153997,"score_gpt":0.2563521510000683,"score_spread":0.23797083698852833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983992983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00753896,0.00010025374,0.9899642,0.000028290058,0.000015185528,0.00003309977,0.000012361911,0.00041642372,0.0018912597],"genre_scores_gemma":[0.13092549,0.000111269626,0.8658817,0.000050005197,0.000019369834,0.00013319569,0.0000797794,0.000074981406,0.0027242403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.00009123145,0.000011219621,0.000042932978,0.00011963888,0.000019191188],"domain_scores_gemma":[0.9998293,0.000086579836,0.000016702512,0.00002055467,0.00003937348,0.000007476225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187865,0.00045018707,0.00044806866,0.0006315335,0.0002260922,0.00039702552,0.0007586114,0.00060165266,0.0023818621],"category_scores_gemma":[0.00087574765,0.00026040408,0.00039572097,0.0006087393,0.00029505894,0.0003953648,0.00041537517,0.00035229736,0.00045561025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010305012,0.00006702185,0.00059775385,0.00011713323,0.000067508874,0.000084767686,0.00010598983,0.5093127,0.019672437,0.01817736,0.0016478368,0.4500465],"study_design_scores_gemma":[0.000029233326,0.000083716506,0.0001867951,0.00000912668,0.000014842177,0.00007755163,0.000008120348,0.98946124,0.0028547547,0.003002798,0.0042633372,0.0000084386265],"about_ca_topic_score_codex":0.0009477572,"about_ca_topic_score_gemma":0.0010798738,"teacher_disagreement_score":0.0023818621,"about_ca_system_score_codex":0.00033233993,"about_ca_system_score_gemma":0.00037426985,"threshold_uncertainty_score":0.007968128},"labels":[],"label_agreement":null},{"id":"W1984131666","doi":"10.1080/03052150801901475","title":"VLSI floorplan repair using dynamic white-space management, constraint graphs, and linear programming","year":2008,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Floorplan; Very-large-scale integration; White spaces; Computer science; Constraint (computer-aided design); Mathematical optimization; Linear programming; Integrated circuit layout; Range (aeronautics); High-level synthesis; Computer engineering; Algorithm; Integrated circuit; Mathematics; Engineering; Embedded system","score_opus":0.008025436742093614,"score_gpt":0.19664174856651265,"score_spread":0.18861631182441904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984131666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008040996,0.00015711125,0.98906344,0.0000678287,0.000010410869,0.000039089697,0.000037457066,0.0004960313,0.0020876927],"genre_scores_gemma":[0.20253253,0.0003006016,0.7945129,0.00006998537,0.000020641088,0.00015078942,0.00019385395,0.00016240365,0.0020562792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996182,0.00012007857,0.000014890819,0.00007256683,0.00012029279,0.000054068394],"domain_scores_gemma":[0.9994955,0.00031874442,0.000067072935,0.000048971327,0.000053619726,0.000016061176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583505,0.0008189521,0.0005491614,0.00058327685,0.0004547169,0.00077905454,0.00075486733,0.0004290792,0.0020494733],"category_scores_gemma":[0.0011962866,0.0004458506,0.0005345283,0.0008065761,0.00062789384,0.0008115279,0.0008325307,0.00070785114,0.0002726005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026364945,0.00002679656,0.00014635679,0.000047319427,0.000011474291,0.000036576013,0.000034945137,0.8988699,0.0021551342,0.009547007,0.0008846049,0.08821352],"study_design_scores_gemma":[0.000009242772,0.000034670098,0.00007285738,0.0000068299814,0.0000070836045,0.000020085196,0.000016079422,0.98955256,0.0015585106,0.0074295145,0.0012858553,0.000006708234],"about_ca_topic_score_codex":0.0068686907,"about_ca_topic_score_gemma":0.009339875,"teacher_disagreement_score":0.0068686907,"about_ca_system_score_codex":0.0007419558,"about_ca_system_score_gemma":0.0016609677,"threshold_uncertainty_score":0.013657391},"labels":[],"label_agreement":null},{"id":"W1984142551","doi":"10.1109/newcas.2012.6328998","title":"GPU Approach to FPGA placement based on star+","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Simulated annealing; Parallel computing; Swap (finance); Multi-core processor; Embedded system; Computer architecture; Algorithm","score_opus":0.021027957655504827,"score_gpt":0.21786835494549617,"score_spread":0.19684039728999134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984142551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020758972,0.00009777823,0.971226,0.00006171874,0.000042044954,0.00003929522,0.000052482916,0.00100354,0.006718137],"genre_scores_gemma":[0.32638392,0.00014168545,0.66719985,0.00007224697,0.000019512587,0.00006787816,0.00015045503,0.00023143306,0.0057330043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.000047183345,0.000008203115,0.000026124822,0.000080025944,0.000015748785],"domain_scores_gemma":[0.9998223,0.000040078503,0.000017603634,0.000058814807,0.000049738803,0.0000115010735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017717962,0.000315776,0.00035260263,0.0002872383,0.00023409676,0.00041524332,0.00079216954,0.0003460754,0.0027413825],"category_scores_gemma":[0.00038225693,0.00022914898,0.00040319873,0.00048408596,0.00028280253,0.0003377211,0.000358363,0.00043018907,0.0007555168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001028896,0.00004998082,0.00076296914,0.0000742309,0.000035264467,0.000099259385,0.000056744237,0.8573252,0.018012173,0.025199339,0.0026443067,0.09563778],"study_design_scores_gemma":[0.000008119224,0.000043571847,0.00008673167,0.000002538959,0.0000036461495,0.000055276574,0.0000054614584,0.99000275,0.00386386,0.0025034947,0.0034205578,0.000004116212],"about_ca_topic_score_codex":0.0029197938,"about_ca_topic_score_gemma":0.0054684733,"teacher_disagreement_score":0.0029197938,"about_ca_system_score_codex":0.0004513511,"about_ca_system_score_gemma":0.0007136804,"threshold_uncertainty_score":0.00917089},"labels":[],"label_agreement":null},{"id":"W1984337894","doi":"10.1155/2009/537341","title":"A Multilevel Congestion-Based Global Router","year":2009,"lang":"en","type":"article","venue":"VLSI design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hierarchical routing; Routing (electronic design automation); Router; Mathematical optimization; Distributed computing; Static routing; Computer network; Routing protocol; Mathematics","score_opus":0.019516569084140994,"score_gpt":0.22890199833658068,"score_spread":0.2093854292524397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984337894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024430592,0.00020639434,0.96952695,0.0001733502,0.000037729456,0.000044578643,0.00007610817,0.0013261917,0.004177987],"genre_scores_gemma":[0.5470935,0.00026360675,0.44630533,0.00017742721,0.00004967366,0.00012188709,0.00019452328,0.00013929822,0.005654732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997682,0.000044706077,0.000012983785,0.000059241804,0.00008167763,0.00003319069],"domain_scores_gemma":[0.9997719,0.00005027863,0.00003304266,0.000057578745,0.00006586086,0.000021294327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030752426,0.00038898224,0.0004754467,0.0005867019,0.00038039096,0.0007086185,0.0011195078,0.00049240806,0.0032321387],"category_scores_gemma":[0.0006106048,0.00022529002,0.00046338543,0.0003797933,0.0003593779,0.0010893345,0.0008923103,0.00068707316,0.00061157456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025838995,0.00014390697,0.0015923028,0.00021123543,0.00010663278,0.00027742962,0.00018037717,0.4611473,0.10767933,0.08941775,0.009496176,0.32948914],"study_design_scores_gemma":[0.000022419428,0.00017159298,0.00028193666,0.000012441231,0.000034704062,0.00009386491,0.000016566577,0.97170264,0.013764945,0.008884545,0.004992293,0.000022133103],"about_ca_topic_score_codex":0.0010026332,"about_ca_topic_score_gemma":0.0020236964,"teacher_disagreement_score":0.0032321387,"about_ca_system_score_codex":0.00064975425,"about_ca_system_score_gemma":0.0006552343,"threshold_uncertainty_score":0.01081264},"labels":[],"label_agreement":null},{"id":"W1984586534","doi":"10.1007/s002360000042","title":"The class Steiner minimal tree problem: a lower bound and test problem generation","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Linear programming relaxation; Theory of computation; Subgradient method; k-minimum spanning tree; Combinatorics; Discrete mathematics; Approximation algorithm; Time complexity; Integer programming; Tree (set theory); Heuristic; K-ary tree; Mathematical optimization; Algorithm; Binary tree; Tree structure","score_opus":0.007904042051019923,"score_gpt":0.19120084342983149,"score_spread":0.18329680137881157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984586534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06536133,0.0022958408,0.8921192,0.0056108916,0.00029745782,0.00052166707,0.0020302744,0.0012879077,0.030475277],"genre_scores_gemma":[0.49735004,0.0024293286,0.47409755,0.0013077708,0.0010698469,0.0009995583,0.0063379053,0.0013531117,0.015054885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965019,0.0010607053,0.00016225076,0.00053666084,0.0012391775,0.0004993759],"domain_scores_gemma":[0.9751152,0.020826364,0.00086333614,0.0014900462,0.0010521619,0.0006529058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032783647,0.0019648364,0.0022618985,0.0033239897,0.0017605142,0.004355611,0.004013218,0.0032256194,0.013888481],"category_scores_gemma":[0.02314342,0.00093282486,0.002620809,0.004267665,0.0020181101,0.0067149377,0.003138945,0.0038792805,0.0013164531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013636291,0.0006716929,0.0030338971,0.0013660729,0.00025636412,0.00036959798,0.00035097808,0.42156178,0.006524265,0.24554415,0.062350392,0.25660717],"study_design_scores_gemma":[0.00013761366,0.00017083494,0.00054552447,0.000098145116,0.00010316739,0.00029734816,0.00010197111,0.79943,0.0027268617,0.19151054,0.0048500965,0.000027869162],"about_ca_topic_score_codex":0.002555561,"about_ca_topic_score_gemma":0.003686264,"teacher_disagreement_score":0.013888481,"about_ca_system_score_codex":0.0031445024,"about_ca_system_score_gemma":0.0025362317,"threshold_uncertainty_score":0.046461582},"labels":[],"label_agreement":null},{"id":"W1986768612","doi":"10.1109/ccece.2012.6334856","title":"A formal and empirical analysis of recombination for genetic algorithm-based approaches to the FPGA placement problem","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Subspace topology; Genetic algorithm; Operator (biology); Computer science; Algorithm; Recombination; Quality (philosophy); Field (mathematics); Gate array; Mathematics; Artificial intelligence; Machine learning; Physics; Computer hardware","score_opus":0.07498597463990726,"score_gpt":0.2616243703525226,"score_spread":0.18663839571261537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986768612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015619783,0.00096964586,0.9741659,0.0007673017,0.00005270528,0.000080007456,0.000029187508,0.000116583695,0.008198867],"genre_scores_gemma":[0.56533706,0.002087347,0.4282407,0.00044830982,0.00037861857,0.00045677085,0.00015769989,0.0002404799,0.0026529857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919686,0.0038933826,0.00027577786,0.0007454898,0.0026866405,0.00043007117],"domain_scores_gemma":[0.942694,0.047673568,0.0037572298,0.0031319,0.0024120547,0.000331152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011064586,0.0008938232,0.00087509205,0.001598209,0.0013497833,0.0028526022,0.0020427415,0.0020763888,0.0035342134],"category_scores_gemma":[0.08117859,0.0006135634,0.0010238556,0.0021081998,0.0057974975,0.0047553894,0.001847608,0.0043089846,0.00041886556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053683627,0.00016808091,0.0027091415,0.00021473267,0.000046096884,0.00012641892,0.00041649534,0.33148637,0.0030226838,0.5999773,0.0016562293,0.060122736],"study_design_scores_gemma":[0.00002966953,0.00020414016,0.00154174,0.00012548448,0.000029428002,0.00042503595,0.00013388899,0.7656287,0.002174938,0.22359349,0.0060695927,0.00004386583],"about_ca_topic_score_codex":0.0013239541,"about_ca_topic_score_gemma":0.0010564297,"teacher_disagreement_score":0.011064586,"about_ca_system_score_codex":0.0025897226,"about_ca_system_score_gemma":0.0021804401,"threshold_uncertainty_score":0.058515847},"labels":[],"label_agreement":null},{"id":"W198687945","doi":"10.1007/978-1-4614-4325-4_5","title":"Results in Gray Codes and Universal Cycles for Designs","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray (unit); Gray code; Computer science; Arithmetic; Mathematics; Algorithm; Medicine","score_opus":0.04630054837356974,"score_gpt":0.24611902980329334,"score_spread":0.19981848142972358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198687945","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008844386,0.06723097,0.21968193,0.003329859,0.004221652,0.000098980505,0.0006459291,0.0010074073,0.69493884],"genre_scores_gemma":[0.23123041,0.0906924,0.13475844,0.004643079,0.004816601,0.0004867202,0.001258592,0.0018131753,0.5303006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993685,0.000093673494,0.00003441858,0.00013533242,0.0003018254,0.0000662925],"domain_scores_gemma":[0.9994217,0.00031359706,0.000024091021,0.00011222683,0.00010430676,0.000024109868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044596114,0.0018358347,0.0013381891,0.0032523475,0.001262888,0.002871209,0.0011935778,0.0011495951,0.024142664],"category_scores_gemma":[0.0024254809,0.0008447917,0.0009411062,0.005855057,0.0029607604,0.0047793533,0.00149489,0.004121525,0.0077856663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015735399,0.00001625206,0.000040064853,0.00028405944,0.000012489797,0.000037350786,0.0001886539,0.001605278,0.00057799154,0.874966,0.024235994,0.09802006],"study_design_scores_gemma":[0.000005573544,0.000011337979,0.00007447569,0.00011157097,0.000009890613,0.000088346555,0.000037328886,0.0011286492,0.0005027459,0.90404487,0.09397504,0.00001008996],"about_ca_topic_score_codex":0.0019272811,"about_ca_topic_score_gemma":0.0021569806,"teacher_disagreement_score":0.024142664,"about_ca_system_score_codex":0.0024884595,"about_ca_system_score_gemma":0.0009743919,"threshold_uncertainty_score":0.08076525},"labels":[],"label_agreement":null},{"id":"W1988714784","doi":"10.1145/512161.512197","title":"Finding shortest paths in large network systems","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dijkstra's algorithm; Suurballe's algorithm; Shortest path problem; Pathfinding; Computer science; Yen's algorithm; Floyd–Warshall algorithm; Shortest Path Faster Algorithm; K shortest path routing; Graph; A* search algorithm; Algorithm; Scalability; Theoretical computer science","score_opus":0.01381417334087049,"score_gpt":0.21817233968009103,"score_spread":0.20435816633922055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988714784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04846897,0.0008022776,0.9453038,0.00026232327,0.000037500733,0.00013665856,0.00027930184,0.0018111564,0.0028979662],"genre_scores_gemma":[0.31991366,0.00077964936,0.67340523,0.00006221384,0.000039795937,0.00025396477,0.0011072865,0.00031298943,0.004125199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00023829936,0.00007115081,0.0002715395,0.00026230857,0.00012323726],"domain_scores_gemma":[0.9975782,0.0016243856,0.00021448046,0.00024648063,0.00025530864,0.000081088125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007855993,0.0009505783,0.00083819905,0.0019636136,0.0016363296,0.0014349418,0.0013601072,0.00095897814,0.0040044524],"category_scores_gemma":[0.0055301404,0.00071005366,0.000405068,0.002828086,0.00088916416,0.0040057097,0.0018256457,0.0006888569,0.0007415377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021365721,0.00007399622,0.0014895528,0.00042874904,0.00008106119,0.0003004565,0.00044355492,0.7818586,0.0058416096,0.037832823,0.0050248443,0.16641115],"study_design_scores_gemma":[0.00006702201,0.000056834313,0.00043700944,0.000023985222,0.000026881215,0.00016834585,0.00023571371,0.9095708,0.0042842147,0.07597537,0.009129077,0.000024672954],"about_ca_topic_score_codex":0.0070337453,"about_ca_topic_score_gemma":0.008698473,"teacher_disagreement_score":0.0070337453,"about_ca_system_score_codex":0.0012567915,"about_ca_system_score_gemma":0.0010594422,"threshold_uncertainty_score":0.013985574},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer 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","score_opus":0.025888929128111807,"score_gpt":0.2199167076937532,"score_spread":0.1940277785656414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989477191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7149801,0.00052648276,0.17495717,0.0017175762,0.00007669759,0.00019244205,0.002706715,0.0006944587,0.1041484],"genre_scores_gemma":[0.96385276,0.000364087,0.019596828,0.00008424416,0.000018309373,0.000114423645,0.00083959027,0.00018018406,0.014949669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999527,0.00010974932,0.000022445587,0.00008649374,0.00013551727,0.00011887073],"domain_scores_gemma":[0.9975763,0.0014510647,0.00020343061,0.00019071465,0.0004421572,0.00013634312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007155355,0.0006517699,0.0003861777,0.00085300504,0.00046666208,0.0015187662,0.001614504,0.0013649057,0.011479803],"category_scores_gemma":[0.005694405,0.00076393445,0.0004434695,0.00084638305,0.00045531656,0.002930309,0.00058032095,0.0012138764,0.0016919698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012365473,0.00007615808,0.0032341639,0.00006621615,0.0000078884905,0.00016088138,0.00009687249,0.95535135,0.0019284026,0.028309293,0.0015582225,0.00908687],"study_design_scores_gemma":[0.0000064583082,0.000028215376,0.0005326946,0.0000057312136,0.0000048501956,0.000032611668,0.000039601306,0.9919538,0.00063753227,0.005478846,0.0012728327,0.000006755571],"about_ca_topic_score_codex":0.00920352,"about_ca_topic_score_gemma":0.012027896,"teacher_disagreement_score":0.011479803,"about_ca_system_score_codex":0.0026531427,"about_ca_system_score_gemma":0.00116046,"threshold_uncertainty_score":0.03840375},"labels":[],"label_agreement":null},{"id":"W1990050178","doi":"10.1109/rsp.2014.6966895","title":"System-on-chip processor using different FPGA architectures in the VTR CAD flow","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"CMC Microsystems","keywords":"Field-programmable gate array; Verilog; Adder; Computer science; Routing (electronic design automation); Embedded system; Block (permutation group theory); Design flow; Computer architecture; Computer hardware; Electronic design automation; FPGA prototype; Gate array","score_opus":0.014417388132131774,"score_gpt":0.22027569951759637,"score_spread":0.2058583113854646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990050178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18424189,0.000659669,0.76507777,0.00024252606,0.00015535367,0.00092558376,0.00067631446,0.01134921,0.036671694],"genre_scores_gemma":[0.577863,0.00046526268,0.40724677,0.0002605304,0.00001646182,0.0004399821,0.0007001903,0.0006547279,0.0123530375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995828,0.00011592685,0.000030758947,0.00006622192,0.00014880236,0.00005539838],"domain_scores_gemma":[0.9994491,0.00026926506,0.000038523514,0.0001366452,0.00009319904,0.000013335583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006100909,0.00048542436,0.00024166834,0.00039815996,0.00018169769,0.0006421057,0.00054248556,0.0002831924,0.010752541],"category_scores_gemma":[0.0012760122,0.00019742413,0.00020500063,0.00034392238,0.00022818576,0.0005775583,0.0002691623,0.0004248994,0.0014348673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009392954,0.00029553002,0.0027482728,0.0009283386,0.0000761764,0.0007750197,0.000354351,0.09151257,0.23687698,0.033285253,0.008538324,0.6236698],"study_design_scores_gemma":[0.00045581078,0.003946623,0.0073532914,0.00034360625,0.00014578093,0.0019963009,0.000224802,0.33063784,0.47145298,0.014646287,0.16863707,0.00015961034],"about_ca_topic_score_codex":0.00069796393,"about_ca_topic_score_gemma":0.0012581114,"teacher_disagreement_score":0.010752541,"about_ca_system_score_codex":0.00032934762,"about_ca_system_score_gemma":0.00042620464,"threshold_uncertainty_score":0.035970807},"labels":[],"label_agreement":null},{"id":"W1990444741","doi":"10.1142/s0219622013500119","title":"GRAPH BISECTION MODELED AS CARDINALITY CONSTRAINED BINARY QUADRATIC TASK ALLOCATION","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Technology & Decision Making","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Mathematics; Combinatorics; Mathematical optimization; Graph; Computer science","score_opus":0.006764768802241577,"score_gpt":0.25778903216362187,"score_spread":0.2510242633613803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990444741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032183286,0.00018723078,0.9594668,0.00027970164,0.000052024894,0.00011070947,0.00021660757,0.00039853793,0.007105019],"genre_scores_gemma":[0.5953995,0.00042790413,0.3902992,0.0002466582,0.00005474441,0.0004527359,0.0007853372,0.0003821235,0.011951832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989372,0.00039660104,0.000035558496,0.00022742455,0.0002608378,0.0001423549],"domain_scores_gemma":[0.99879164,0.0006412218,0.00016355958,0.00015104344,0.00016580985,0.00008665667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094096136,0.0010322738,0.0009564902,0.0006445499,0.0006014202,0.0010591121,0.0016189805,0.00096626714,0.006026163],"category_scores_gemma":[0.002691128,0.00049201935,0.00074268127,0.0016103795,0.0007433397,0.0020596862,0.0010221482,0.0015506011,0.0006709219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171909,0.000059985643,0.00018330835,0.00007648683,0.0000180879,0.00007070234,0.000043317763,0.9536661,0.0013848358,0.024210554,0.0018097821,0.018405054],"study_design_scores_gemma":[0.000012481038,0.000029525643,0.00007275998,0.000005200995,0.0000042365405,0.000034273802,0.000011828084,0.9847986,0.00042103542,0.013420978,0.0011845473,0.00000448509],"about_ca_topic_score_codex":0.00475958,"about_ca_topic_score_gemma":0.0050361445,"teacher_disagreement_score":0.006026163,"about_ca_system_score_codex":0.0013231044,"about_ca_system_score_gemma":0.0013047234,"threshold_uncertainty_score":0.020159483},"labels":[],"label_agreement":null},{"id":"W1990600294","doi":"10.1145/968280.968295","title":"A synthesis oriented omniscient manual editor","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Xilinx","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Context (archaeology); Set (abstract data type); Logic synthesis; Logic optimization; Physical design; Logic gate; Placement; Digital electronics; Computer architecture; Theoretical computer science; Electronic circuit; Embedded system; Algorithm; Circuit design; Engineering; Programming language","score_opus":0.004850994993209914,"score_gpt":0.20448528227777193,"score_spread":0.19963428728456203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990600294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001639806,0.00013360025,0.92569304,0.00018781866,0.00027791254,0.00015943064,0.001669125,0.05782409,0.0124151865],"genre_scores_gemma":[0.03377073,0.00035615248,0.90109473,0.00057330204,0.00030176225,0.0004447073,0.0035345904,0.01267617,0.047247898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987086,0.00020979784,0.000138994,0.00018897362,0.0006871453,0.00006647505],"domain_scores_gemma":[0.9958573,0.0022703668,0.00019700661,0.0007895203,0.00079205725,0.00009378196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019337244,0.0013797324,0.00066358637,0.0009107691,0.0003665366,0.0021555237,0.0020962679,0.0009740838,0.04001718],"category_scores_gemma":[0.0069441805,0.00078305026,0.0007234387,0.00051897584,0.0004551406,0.0014261554,0.0010875869,0.0014628209,0.014602352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010619769,0.00017512054,0.00065743364,0.0010501447,0.00006660926,0.0011188838,0.00030820363,0.018670253,0.05869724,0.0635024,0.27408972,0.580602],"study_design_scores_gemma":[0.0003393866,0.00018523978,0.00031347567,0.00012874871,0.000049416994,0.0013528846,0.00005870215,0.179751,0.053088237,0.03440482,0.73025656,0.00007153511],"about_ca_topic_score_codex":0.00033567,"about_ca_topic_score_gemma":0.0008702311,"teacher_disagreement_score":0.04001718,"about_ca_system_score_codex":0.00036764002,"about_ca_system_score_gemma":0.00080591737,"threshold_uncertainty_score":0.13387084},"labels":[],"label_agreement":null},{"id":"W1990780443","doi":"10.1109/fpt.2013.6718324","title":"Maximum flow algorithms for maximum observability during FPGA debug","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Semiconductor Research Corporation","keywords":"Observability; Field-programmable gate array; Computer science; Tracing; TRACE (psycholinguistics); Routing (electronic design automation); Debugging; Algorithm; Maximum flow problem; Embedded system; Parallel computing; Mathematics; Mathematical optimization","score_opus":0.02032556772293232,"score_gpt":0.2214809940092736,"score_spread":0.20115542628634128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990780443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005923619,0.000088068155,0.9927025,0.00008702112,0.00000823646,0.00003327233,0.000032495096,0.00036738938,0.00075744913],"genre_scores_gemma":[0.2581722,0.0001952859,0.7389752,0.00008388319,0.000049529568,0.00022753373,0.00023800824,0.00031927926,0.001739052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986299,0.000576862,0.00007323871,0.00026104716,0.0002953852,0.00016360034],"domain_scores_gemma":[0.9925303,0.005936505,0.0005599654,0.00046683676,0.00041244586,0.000093932504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031117257,0.0013124745,0.00092424464,0.0021771684,0.0009391772,0.0012070714,0.001342383,0.0012598628,0.004405769],"category_scores_gemma":[0.01396507,0.0009492338,0.00096814835,0.0014012367,0.0012982634,0.002983738,0.0014164492,0.0016756743,0.0005105357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003600775,0.00013424076,0.0010215631,0.00017670286,0.000045136705,0.00006723977,0.00026095498,0.7438381,0.005221509,0.049769495,0.0018406647,0.19726434],"study_design_scores_gemma":[0.000031564625,0.000047799862,0.00012914508,0.000020610838,0.000008729109,0.000019120607,0.000020001034,0.9605105,0.002088062,0.036210854,0.00090549723,0.000008182709],"about_ca_topic_score_codex":0.002965529,"about_ca_topic_score_gemma":0.0039962446,"teacher_disagreement_score":0.004405769,"about_ca_system_score_codex":0.0016089036,"about_ca_system_score_gemma":0.0021501305,"threshold_uncertainty_score":0.016456544},"labels":[],"label_agreement":null},{"id":"W1991121783","doi":"10.1109/fpt.2010.5681424","title":"Accelerating FPGA design space exploration using circuit similarity-based placement","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Field-programmable gate array; Computer science; Similarity (geometry); Design space exploration; Space (punctuation); Circuit design; Computer architecture; Embedded system; Artificial intelligence; Operating system","score_opus":0.10837972324426946,"score_gpt":0.26629689368180587,"score_spread":0.1579171704375364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991121783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167445,0.00021150318,0.9644505,0.00005377653,0.000022221548,0.000061858584,0.00001953541,0.0013317642,0.002174433],"genre_scores_gemma":[0.29910386,0.00015552707,0.6993049,0.000038850372,0.000024955792,0.000063456915,0.00007580659,0.00010544042,0.0011272813],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995497,0.000086784654,0.000024622095,0.000050798088,0.00025518646,0.000032830507],"domain_scores_gemma":[0.99938154,0.00025044064,0.000091429116,0.00012809836,0.00012764972,0.000020905842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036204036,0.00054567953,0.00043618635,0.0011663996,0.000376481,0.00052044087,0.000811483,0.00044539012,0.0018741051],"category_scores_gemma":[0.0015774372,0.00029123315,0.00041104812,0.0009851007,0.00034316353,0.0008609942,0.0007110748,0.00037089328,0.0006289755],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017274817,0.00007616132,0.0013226009,0.00016180746,0.000045377925,0.00019417008,0.0001785421,0.2170787,0.06331171,0.012819576,0.0021021827,0.70253634],"study_design_scores_gemma":[0.00007149219,0.00031808644,0.0009884302,0.000014715393,0.00002512469,0.00053353905,0.00004438907,0.945086,0.0386887,0.007462948,0.006742913,0.000023678936],"about_ca_topic_score_codex":0.0010199716,"about_ca_topic_score_gemma":0.0016970905,"teacher_disagreement_score":0.0018741051,"about_ca_system_score_codex":0.00047414482,"about_ca_system_score_gemma":0.0006631223,"threshold_uncertainty_score":0.006269574},"labels":[],"label_agreement":null},{"id":"W1991343829","doi":"10.1155/2012/395260","title":"A New Length‐Based Algebraic Multigrid Clustering Algorithm","year":2012,"lang":"en","type":"article","venue":"VLSI design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures; Western Canada Research Grid; Compute Canada","keywords":"Multigrid method; Cluster analysis; Algorithm; Computer science; Algebraic number; Mathematics; Artificial intelligence","score_opus":0.02468681697919865,"score_gpt":0.22419740696303606,"score_spread":0.19951058998383742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991343829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033948144,0.00013606402,0.9940637,0.00008611505,0.00004967704,0.00003810048,0.00004966856,0.0006299618,0.0015520168],"genre_scores_gemma":[0.07277835,0.00018848215,0.9224216,0.000072773415,0.000050170314,0.00012945704,0.00037281512,0.00021135267,0.0037750464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993717,0.000100233425,0.000036385532,0.00011464562,0.00033432367,0.000042768785],"domain_scores_gemma":[0.9992824,0.00012776212,0.00007586972,0.0001326751,0.0003409704,0.000040377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047945097,0.00074776815,0.0008433456,0.0015844256,0.0007442899,0.0011224898,0.0017026472,0.0009611461,0.0029421232],"category_scores_gemma":[0.0018371667,0.00046879792,0.00082309346,0.0014134962,0.00050568744,0.0012305662,0.0012322647,0.001043475,0.0014260766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014800101,0.00005925963,0.0009445098,0.00014393727,0.00010125938,0.000065129294,0.00014363504,0.47304967,0.017928148,0.03096755,0.007832614,0.46861628],"study_design_scores_gemma":[0.000018550521,0.0000243353,0.00019520751,0.000006197006,0.000009274231,0.000046767305,0.000013516415,0.9847231,0.00285018,0.00466879,0.0074264747,0.00001762797],"about_ca_topic_score_codex":0.0057006017,"about_ca_topic_score_gemma":0.0065098493,"teacher_disagreement_score":0.0057006017,"about_ca_system_score_codex":0.0010746404,"about_ca_system_score_gemma":0.0012466871,"threshold_uncertainty_score":0.0113348365},"labels":[],"label_agreement":null},{"id":"W1992264801","doi":"10.1109/fpl.2013.6645626","title":"From Quartus to VPR: Converting HDL to BLIF with the Titan flow","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Titan (rocket family); Field-programmable gate array; Computer science; CAD; Design flow; Computer architecture; Architecture; Electronic design automation; Embedded system; Engineering; Engineering drawing; Aerospace engineering","score_opus":0.004584349897902414,"score_gpt":0.17318848933148245,"score_spread":0.16860413943358005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992264801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04761518,0.000387863,0.8373397,0.0003590774,0.00034793222,0.00039683713,0.0021194068,0.063515864,0.047918104],"genre_scores_gemma":[0.34571895,0.000623519,0.61307275,0.00071564637,0.00011030815,0.00042198275,0.006728016,0.010287283,0.02232144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951816,0.00010491914,0.000045237062,0.000052525025,0.00020848995,0.000070665854],"domain_scores_gemma":[0.99909794,0.00037544587,0.000069143796,0.00020553792,0.00023275866,0.000019147856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073965226,0.00062106806,0.0002563298,0.0008109636,0.0002874764,0.0009435001,0.00080110086,0.00035781713,0.015638635],"category_scores_gemma":[0.0031034756,0.0003495049,0.00033574807,0.000625968,0.0003518753,0.0011335625,0.00054475636,0.00089692685,0.0037101354],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010146052,0.00026344464,0.0017786144,0.0013193606,0.000064269014,0.0012326066,0.00086237653,0.0613881,0.081659384,0.076680645,0.051423702,0.7223129],"study_design_scores_gemma":[0.00042499343,0.0009317157,0.0017695999,0.00047824852,0.00007222586,0.0016308273,0.00029744496,0.26843682,0.3645539,0.058446847,0.30282804,0.00012942193],"about_ca_topic_score_codex":0.0016177432,"about_ca_topic_score_gemma":0.0017991756,"teacher_disagreement_score":0.015638635,"about_ca_system_score_codex":0.00036855048,"about_ca_system_score_gemma":0.0006261285,"threshold_uncertainty_score":0.052316368},"labels":[],"label_agreement":null},{"id":"W1993004594","doi":"10.1109/tvlsi.2002.808463","title":"Probability-based approach to rectilinear Steiner tree problems","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Very-large-scale integration; Computer science; Class (philosophy); Interconnection; Tree (set theory); Integrated circuit layout; Algorithm; Mathematical optimization; Integrated circuit; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics; Embedded system","score_opus":0.032060161823195536,"score_gpt":0.2112050610018799,"score_spread":0.17914489917868437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993004594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012472612,0.0003342354,0.9967353,0.000116183255,0.000032333737,0.000016373195,0.000019582138,0.00008376159,0.001414862],"genre_scores_gemma":[0.18146297,0.003068404,0.8069611,0.0002301913,0.00044376633,0.00025702605,0.00027819318,0.00018769491,0.0071105813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896836,0.0003149726,0.00005729691,0.00017501281,0.00042792174,0.000056475194],"domain_scores_gemma":[0.9982185,0.0011789844,0.00013200592,0.00016028338,0.00025691203,0.000053343203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620008,0.0008745981,0.0008249041,0.0014134343,0.00061542494,0.0012163381,0.001686721,0.0010493161,0.0038066814],"category_scores_gemma":[0.0048440257,0.0005978158,0.0008109381,0.0021774927,0.0008474959,0.002494438,0.0012691687,0.00171689,0.0009094133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045577934,0.00004337624,0.00030389798,0.00016541612,0.000050536655,0.00013018984,0.00006843194,0.64266866,0.0018867151,0.25896928,0.0037139456,0.09195404],"study_design_scores_gemma":[0.000011657649,0.000026209731,0.000073361196,0.000009815404,0.000010034237,0.00008867331,0.0000073488745,0.90874904,0.00057954236,0.08666763,0.0037649034,0.0000117121745],"about_ca_topic_score_codex":0.0013191974,"about_ca_topic_score_gemma":0.001559359,"teacher_disagreement_score":0.0038066814,"about_ca_system_score_codex":0.0009264788,"about_ca_system_score_gemma":0.001045862,"threshold_uncertainty_score":0.012734592},"labels":[],"label_agreement":null},{"id":"W1993072227","doi":"10.5555/1015090.1015284","title":"Interconnect capacitance estimation for FPGAs","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Capacitance; Field-programmable gate array; Routing (electronic design automation); Noise (video); Dynamic demand; Electronic engineering; Computer science; CMOS; Bounding overwatch; Interconnection; Power (physics); Lookup table; Parasitic capacitance; Minimum bounding box; Engineering; Embedded system; Telecommunications; Artificial intelligence","score_opus":0.009835024715061765,"score_gpt":0.21483163952893491,"score_spread":0.20499661481387316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993072227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999848,0.0006755989,0.9266425,0.00018044678,0.000017348011,0.000017571296,0.00016939075,0.0009306999,0.0013679862],"genre_scores_gemma":[0.884368,0.0007608953,0.112325124,0.000052446354,0.000038135124,0.000031913936,0.0004185038,0.00011317916,0.0018918394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951375,0.000109609595,0.000022550425,0.000113665825,0.0002094332,0.000030982566],"domain_scores_gemma":[0.9990295,0.00042386263,0.00016651576,0.0001809997,0.00018000406,0.00001922403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032963973,0.00041088986,0.0003355196,0.0007074943,0.0002315634,0.0005651957,0.00042233797,0.00039449552,0.00072264083],"category_scores_gemma":[0.0033791165,0.00032741693,0.00022433893,0.00078434334,0.00023924118,0.0008088624,0.0002829746,0.0004365426,0.00022392755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000542251,0.000014396615,0.0024768796,0.0000627084,0.000029573703,0.00010536148,0.000024256517,0.8698814,0.021166487,0.003531845,0.000842413,0.101810485],"study_design_scores_gemma":[0.0000023820235,0.000018553668,0.000786361,0.0000050722424,0.0000036272368,0.00007331494,0.0000038891567,0.9924481,0.0045447974,0.0013697976,0.0007386259,0.0000054659595],"about_ca_topic_score_codex":0.004644596,"about_ca_topic_score_gemma":0.003993602,"teacher_disagreement_score":0.004644596,"about_ca_system_score_codex":0.0008700088,"about_ca_system_score_gemma":0.0006652986,"threshold_uncertainty_score":0.009235144},"labels":[],"label_agreement":null},{"id":"W1993422730","doi":"10.1109/ds-rt.2012.38","title":"An Offline Road Network Partitioning Solution in Distributed Transportation Simulation","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scalability; Graph partition; Computer science; Flow network; Graph; Space partitioning; Distributed computing; Partition (number theory); Graph theory; Theoretical computer science; Algorithm; Mathematical optimization; Database; Mathematics","score_opus":0.015821559524481138,"score_gpt":0.2518407162627888,"score_spread":0.23601915673830767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993422730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015494423,0.000040940944,0.9810823,0.000059407088,0.000014507248,0.000047780028,0.00003882752,0.00043659468,0.002785159],"genre_scores_gemma":[0.39402956,0.000097750075,0.6027541,0.000051502222,0.000014779943,0.00016114635,0.00019588768,0.00022770943,0.002467521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.0001381758,0.00001919685,0.00007380728,0.00012846157,0.00004825889],"domain_scores_gemma":[0.9995146,0.00016942875,0.00003593879,0.00013840577,0.00010577191,0.00003580933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904105,0.00048477744,0.00050637475,0.00039846505,0.0005519434,0.0005950221,0.0010536792,0.00057586754,0.0025932773],"category_scores_gemma":[0.0012127605,0.00030039402,0.0005149139,0.0004773276,0.00046424134,0.0011553509,0.0009559346,0.0008237051,0.00042152507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007100988,0.000043882013,0.00067576807,0.0000442615,0.000022864142,0.00005297509,0.00007705875,0.9136009,0.009466022,0.019480765,0.0009989262,0.055465538],"study_design_scores_gemma":[0.000010934433,0.000024771021,0.00009658207,0.0000031954821,0.0000041320604,0.000013449006,0.000019276296,0.99186397,0.0025487677,0.0036937695,0.0017156511,0.000005606021],"about_ca_topic_score_codex":0.0057365666,"about_ca_topic_score_gemma":0.007822989,"teacher_disagreement_score":0.0057365666,"about_ca_system_score_codex":0.0007607928,"about_ca_system_score_gemma":0.0011231733,"threshold_uncertainty_score":0.011406362},"labels":[],"label_agreement":null},{"id":"W1995613452","doi":"10.1049/iet-cdt:20070120","title":"SC Build: a computer-aided design tool for design space exploration of embedded central processing unit cores for field-programmable gate arrays","year":2008,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Design space exploration; Computer science; Gate array; Field-programmable gate array; Field (mathematics); Genetic algorithm; Computer Aided Design; Design tool; Computer architecture; Space exploration; Core (optical fiber); Space (punctuation); Embedded system; Multi-core processor; Computer engineering; Computer hardware; Parallel computing; Engineering; Aerospace engineering; Operating system","score_opus":0.04922049004676316,"score_gpt":0.25872247149558575,"score_spread":0.2095019814488226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995613452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01122904,0.00018571081,0.9727208,0.0000815207,0.00003077361,0.0001378013,0.00027604436,0.011859609,0.0034785648],"genre_scores_gemma":[0.11347168,0.00027268162,0.881144,0.00009276756,0.000012783225,0.00064243353,0.00058216753,0.0010903578,0.0026911236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.00006831152,0.000016199248,0.000025258423,0.00015556908,0.000022009724],"domain_scores_gemma":[0.99892884,0.0007825927,0.00007452206,0.00005632161,0.00013651716,0.000021268517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079512584,0.0009933633,0.0005064083,0.00072672055,0.00033188998,0.00072251755,0.0010086155,0.00070100295,0.008583534],"category_scores_gemma":[0.0025274302,0.00053194707,0.00065698836,0.00048502238,0.0004130164,0.00049068825,0.0005044321,0.00092206243,0.00096335047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003082549,0.00010833713,0.0017628416,0.00079601567,0.00012252135,0.0003959464,0.0003490661,0.61720467,0.031922217,0.01722681,0.014747468,0.31505588],"study_design_scores_gemma":[0.00011815607,0.00010732041,0.0002333107,0.000047840407,0.00003022726,0.00013871257,0.000033101,0.9722454,0.008878654,0.003919122,0.014225077,0.000023063509],"about_ca_topic_score_codex":0.0030952294,"about_ca_topic_score_gemma":0.0061142445,"teacher_disagreement_score":0.008583534,"about_ca_system_score_codex":0.0005263002,"about_ca_system_score_gemma":0.0016358583,"threshold_uncertainty_score":0.028714836},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0130859972809326,"score_gpt":0.2427284259525517,"score_spread":0.2296424286716191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996309908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016091073,0.0000687621,0.98148364,0.00008877421,0.000042970103,0.00003885726,0.00005244167,0.0003054562,0.0018281261],"genre_scores_gemma":[0.19049346,0.0002576894,0.80343926,0.000130811,0.000047332393,0.00009778156,0.00024290304,0.00015489176,0.00513595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963915,0.00009913528,0.000019594454,0.000101259306,0.00009535483,0.00004554327],"domain_scores_gemma":[0.99909425,0.00041407428,0.00012230258,0.00019466403,0.0001371232,0.00003757058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050369627,0.00063121546,0.0005221616,0.00036919065,0.0002638607,0.00061154104,0.00051124085,0.0004237914,0.004822391],"category_scores_gemma":[0.0017583048,0.00023919351,0.00041066745,0.0006524159,0.00055463606,0.0009842747,0.00059339986,0.0005781824,0.0014458499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000255975,0.00014498582,0.0008122845,0.00036308472,0.00007341977,0.00037524317,0.00022223697,0.45973852,0.078109495,0.112377286,0.004881454,0.34264597],"study_design_scores_gemma":[0.00003641064,0.00019818023,0.00017318374,0.000011910152,0.000017187642,0.00011743829,0.000072378345,0.9349142,0.02260551,0.035521287,0.0063155466,0.000016819715],"about_ca_topic_score_codex":0.0012598712,"about_ca_topic_score_gemma":0.0019798903,"teacher_disagreement_score":0.004822391,"about_ca_system_score_codex":0.00021767305,"about_ca_system_score_gemma":0.0005304936,"threshold_uncertainty_score":0.016132534},"labels":[],"label_agreement":null},{"id":"W1996678568","doi":"10.1145/368434.368600","title":"Analytical minimization of half-perimeter wirelength","year":2000,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Texas at Austin","keywords":"Minification; Perimeter; Computer science; Mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.008589669774032426,"score_gpt":0.2104882135888069,"score_spread":0.20189854381477448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996678568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03127662,0.001004186,0.94956595,0.00020918487,0.0000390001,0.000024515139,0.00010906882,0.00029868685,0.017472835],"genre_scores_gemma":[0.76587623,0.0023840547,0.21672767,0.00013084407,0.00006647337,0.00013996456,0.00018431887,0.00038684427,0.014103632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976355,0.000033142707,0.0000060907487,0.000037377096,0.00012901526,0.000030812662],"domain_scores_gemma":[0.9997317,0.00011674354,0.00004567581,0.000033755307,0.00005737915,0.000014846564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034791318,0.0008158156,0.00040278037,0.00047180086,0.00024959896,0.0007402569,0.0007272523,0.0005743768,0.0030900456],"category_scores_gemma":[0.0009492443,0.00038785767,0.00022593427,0.00049430865,0.00060280354,0.0009695714,0.0006648473,0.00035834746,0.00074329757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046084962,0.00001719724,0.0003853002,0.00021087837,0.000019385985,0.00010052815,0.000053973352,0.8866522,0.022527166,0.04332455,0.0022755293,0.044387262],"study_design_scores_gemma":[0.0000052476926,0.000032359843,0.0001640769,0.00001697579,0.0000062541267,0.00006159988,0.000018757042,0.9804417,0.0057549253,0.01132304,0.0021697215,0.000005335051],"about_ca_topic_score_codex":0.0005889048,"about_ca_topic_score_gemma":0.0011805648,"teacher_disagreement_score":0.0030900456,"about_ca_system_score_codex":0.00091248285,"about_ca_system_score_gemma":0.00075507455,"threshold_uncertainty_score":0.010337234},"labels":[],"label_agreement":null},{"id":"W1998393880","doi":"10.1145/1810479.1810515","title":"Brief announcement","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Load balancing (electrical power); Parallel computing; Very-large-scale integration; Distributed computing; Algorithm; Artificial intelligence; Embedded system","score_opus":0.004605202365633554,"score_gpt":0.18870149348796086,"score_spread":0.1840962911223273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998393880","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017789329,0.023396775,0.007390304,0.117752284,0.37026593,0.00059343386,0.0061646337,0.0017611872,0.47089657],"genre_scores_gemma":[0.010392648,0.013360354,0.0029227065,0.041260038,0.05450216,0.00032716047,0.004234807,0.0004809448,0.8725192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985941,0.00019811514,0.00010666331,0.00027712042,0.00061810546,0.000205939],"domain_scores_gemma":[0.9959084,0.00074553915,0.00018869642,0.00040734376,0.0016427151,0.0011072868],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019060775,0.0008404464,0.0006834939,0.0014774885,0.0017708822,0.003641138,0.00193153,0.0043046842,0.3211108],"category_scores_gemma":[0.008689275,0.00033262168,0.0006865829,0.0011094676,0.00067291467,0.002804988,0.002027862,0.003749278,0.2047368],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008727966,0.000039610215,0.00022089516,0.00020657567,0.0000056806384,0.00021703706,0.000041544732,0.000069741676,0.0003605655,0.007487701,0.9176346,0.07362881],"study_design_scores_gemma":[0.0000060687166,0.000018606845,0.00014576426,0.000055373537,0.0000030020558,0.00014200996,0.00002962711,0.000024952787,0.00012906254,0.0011755829,0.9982659,0.0000039883053],"about_ca_topic_score_codex":0.0019080425,"about_ca_topic_score_gemma":0.0030217206,"teacher_disagreement_score":0.67888916,"about_ca_system_score_codex":0.0016821008,"about_ca_system_score_gemma":0.0027164307,"threshold_uncertainty_score":0.96835303},"labels":[],"label_agreement":null},{"id":"W1999062853","doi":"10.1145/360276.360302","title":"Mixing buffers and pass transistors in FPGA routing architectures","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Interconnection; Field-programmable gate array; Application-specific integrated circuit; Transistor; Computer science; Topology (electrical circuits); CMOS; Parallel computing; Electrical engineering; Engineering; Embedded system; Computer network; Voltage","score_opus":0.007826181841910824,"score_gpt":0.19569805599612988,"score_spread":0.18787187415421905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999062853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22954562,0.004174804,0.7345018,0.00058459915,0.00027001317,0.0001476566,0.0001873676,0.0029211806,0.027666975],"genre_scores_gemma":[0.8141156,0.001808539,0.16819069,0.00023273614,0.0001282338,0.00009357774,0.00012174393,0.00021222276,0.01509669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997011,0.000070771064,0.000026527761,0.00007301959,0.000080311605,0.000048165937],"domain_scores_gemma":[0.9995073,0.00021778216,0.000082466926,0.000086984975,0.000071244314,0.000034241017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237043,0.0005522354,0.00027800235,0.00064437,0.00042510338,0.001892261,0.0008481911,0.0006075945,0.0041179215],"category_scores_gemma":[0.0011765162,0.000470283,0.00020904967,0.00059122214,0.0005539472,0.0022482632,0.00044241958,0.0005720603,0.00085262884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021004477,0.00015878791,0.0029837799,0.0006061772,0.00009725936,0.0010324204,0.000578048,0.1290514,0.14254498,0.4434983,0.0036315455,0.2737169],"study_design_scores_gemma":[0.00034949923,0.0021490348,0.0018759576,0.00024812273,0.00042419916,0.0023148798,0.00027707632,0.32620695,0.37277612,0.20443855,0.088797845,0.00014179449],"about_ca_topic_score_codex":0.0006886425,"about_ca_topic_score_gemma":0.0012412068,"teacher_disagreement_score":0.0041179215,"about_ca_system_score_codex":0.00062365783,"about_ca_system_score_gemma":0.00034076316,"threshold_uncertainty_score":0.013775885},"labels":[],"label_agreement":null},{"id":"W1999343232","doi":"10.1145/1027084.1027090","title":"Segmented channel routability via satisfiability","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"","keywords":"Routing (electronic design automation); Computer science; Channel (broadcasting); Field-programmable gate array; Satisfiability; Constraint (computer-aided design); Boolean satisfiability problem; Algorithm; Electronic design automation; Network routing; Parallel computing; Embedded system; Mathematics; Computer network","score_opus":0.013728378803189613,"score_gpt":0.22085256443908233,"score_spread":0.20712418563589272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999343232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056986142,0.00041926728,0.9321358,0.0013961548,0.000067123656,0.00028930808,0.00055774633,0.0007400433,0.007408417],"genre_scores_gemma":[0.629181,0.0008628616,0.3628419,0.0005317029,0.00021539922,0.00039839666,0.0017712151,0.0003029637,0.0038945535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956874,0.0017159051,0.00026400163,0.00077948923,0.0011762368,0.00037694426],"domain_scores_gemma":[0.9798322,0.016362678,0.0013137491,0.0013506827,0.0009792257,0.00016154312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028414528,0.0011209148,0.000737768,0.0014545372,0.0010000688,0.0026532665,0.0014358665,0.0014892458,0.0071221096],"category_scores_gemma":[0.020875078,0.0010075081,0.0019446589,0.0017854288,0.0037055395,0.0070158476,0.0019294966,0.0026766493,0.0005631145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040090873,0.0002588165,0.0034535306,0.001076143,0.000262441,0.00090086006,0.00066619157,0.45049882,0.010503491,0.36306325,0.008603513,0.16031207],"study_design_scores_gemma":[0.00009265935,0.000109294204,0.00028978052,0.00008378255,0.00008268185,0.0002530996,0.0001687627,0.533931,0.008074993,0.45314503,0.0037335258,0.00003539631],"about_ca_topic_score_codex":0.0031087748,"about_ca_topic_score_gemma":0.0042424193,"teacher_disagreement_score":0.0071221096,"about_ca_system_score_codex":0.0018238235,"about_ca_system_score_gemma":0.002551785,"threshold_uncertainty_score":0.023825824},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2813694063939959,"score_gpt":0.4229850109156691,"score_spread":0.1416156045216732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999993900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039693143,0.00079162425,0.94619477,0.0007724066,0.0002994026,0.00017104278,0.000102569065,0.00050332665,0.011471738],"genre_scores_gemma":[0.2460758,0.00041842647,0.74426395,0.00030449955,0.00015726566,0.0004080116,0.00021831071,0.000111619236,0.008042097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.00011191445,0.000013522271,0.000043296033,0.00008399144,0.00004321242],"domain_scores_gemma":[0.99954885,0.00026338492,0.000034374792,0.00004836102,0.000080370155,0.00002471427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007605,0.0007478195,0.00093004975,0.0010411463,0.00076448097,0.00082986197,0.0014521761,0.0013311666,0.0035135748],"category_scores_gemma":[0.0016304983,0.00039832338,0.0006695607,0.0010044125,0.0005130033,0.00093804323,0.0009002931,0.00085051014,0.00050047896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002925199,0.00025110936,0.0005043678,0.0002008589,0.0001228592,0.00016071642,0.00012634353,0.6127664,0.006587296,0.030340975,0.009958427,0.3386881],"study_design_scores_gemma":[0.00009227756,0.000074778196,0.0001380284,0.000012836401,0.000022447131,0.000082926774,0.000026461525,0.9836321,0.0009113498,0.012380529,0.0026174907,0.000008762067],"about_ca_topic_score_codex":0.0017223557,"about_ca_topic_score_gemma":0.0027394174,"teacher_disagreement_score":0.0035135748,"about_ca_system_score_codex":0.00062329473,"about_ca_system_score_gemma":0.0010848168,"threshold_uncertainty_score":0.011754096},"labels":[],"label_agreement":null},{"id":"W2000205915","doi":"10.1007/s10470-009-9312-z","title":"Performance-driven circuit and layout co-optimization for deep-submicron analog circuits","year":2009,"lang":"en","type":"article","venue":"Analog Integrated Circuits and Signal Processing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parasitic extraction; Schematic; Physical design; Computer science; Electronic engineering; Netlist; Integrated circuit layout; Design flow; Circuit extraction; Process (computing); Circuit design; Integrated circuit; Engineering; Equivalent circuit; Embedded system; Electrical engineering","score_opus":0.015482122001024343,"score_gpt":0.22576752686041557,"score_spread":0.21028540485939123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000205915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19929223,0.0021859438,0.76370394,0.0007157054,0.00019777974,0.000150629,0.00028562942,0.0031360104,0.030332178],"genre_scores_gemma":[0.85103244,0.00023584571,0.14115363,0.00016459519,0.00007128838,0.00007985557,0.00018383858,0.00036386293,0.006714641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.00011873447,0.00001664403,0.000047055233,0.00023633422,0.00009870826],"domain_scores_gemma":[0.999315,0.00027097412,0.000108260254,0.000086168504,0.00019512975,0.00002441981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885357,0.0009143789,0.0004629265,0.00063713995,0.00036057647,0.0006307644,0.001230636,0.00042749307,0.0039013564],"category_scores_gemma":[0.0012115291,0.00034895024,0.00038226292,0.0008427804,0.0002158679,0.00079722056,0.0006028524,0.00047326973,0.00051088765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020062528,0.00018036767,0.0010600018,0.0001670102,0.00008406775,0.000093254224,0.00006063159,0.7571271,0.06138228,0.006577418,0.0043800515,0.16868721],"study_design_scores_gemma":[0.000018719544,0.00013270554,0.0004585289,0.0000055769656,0.000021791599,0.000046882637,0.000015070407,0.97928256,0.016359523,0.0018110438,0.00183941,0.000008248748],"about_ca_topic_score_codex":0.002298267,"about_ca_topic_score_gemma":0.00846464,"teacher_disagreement_score":0.0039013564,"about_ca_system_score_codex":0.0013690132,"about_ca_system_score_gemma":0.0013626141,"threshold_uncertainty_score":0.013051331},"labels":[],"label_agreement":null},{"id":"W2000383438","doi":"10.1145/1123008.1123051","title":"Net cluster","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Benchmark (surveying); Computer science; Digital electronics; Reduction (mathematics); Cluster (spacecraft); Algorithm; Suite; Electronic circuit; Logic gate; Computer engineering; Mathematics; Artificial intelligence; Engineering","score_opus":0.0034570407955953515,"score_gpt":0.16798952766693995,"score_spread":0.16453248687134459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000383438","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041966572,0.0011597228,0.8608911,0.0005859286,0.00045715275,0.0007649824,0.00393356,0.021335118,0.0689059],"genre_scores_gemma":[0.20787518,0.0009998219,0.6828623,0.000491309,0.00011458408,0.00077202066,0.014964579,0.001770562,0.09014969],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960655,0.0000306189,0.00002288426,0.000114338836,0.00016975893,0.000055885663],"domain_scores_gemma":[0.9996031,0.0000586531,0.0000331543,0.00012892693,0.00014568443,0.000030443603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028327288,0.0005844385,0.00041375292,0.0011816319,0.00089204125,0.0013555153,0.0014174181,0.0004980457,0.019391092],"category_scores_gemma":[0.00096582394,0.00027215667,0.00061048294,0.001174123,0.0003064075,0.0010584802,0.0012183168,0.0005329177,0.0061936034],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005749806,0.00014434835,0.002174979,0.00057004107,0.000113530485,0.00016789185,0.00018952998,0.07532856,0.023266418,0.08649319,0.094247736,0.71672887],"study_design_scores_gemma":[0.00014538965,0.000337695,0.0022419342,0.00008538105,0.00010120624,0.0007380561,0.0002012762,0.4319607,0.057766173,0.05486857,0.4514705,0.00008311813],"about_ca_topic_score_codex":0.0032835077,"about_ca_topic_score_gemma":0.007183405,"teacher_disagreement_score":0.019391092,"about_ca_system_score_codex":0.00093962875,"about_ca_system_score_gemma":0.0014361611,"threshold_uncertainty_score":0.06486964},"labels":[],"label_agreement":null},{"id":"W2001180691","doi":"10.1142/s0218126608004526","title":"A FAST AND EFFECTIVE TIMING-DRIVEN PLACEMENT TOOL FOR FPGAs","year":2008,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Field-programmable gate array; Routing (electronic design automation); Computer science; Process (computing); Quadratic equation; Path (computing); Electronic circuit; Microelectronics; Chip; Algorithm; Mathematics; Embedded system; Engineering; Electrical engineering; Telecommunications; Geometry","score_opus":0.014504904275145782,"score_gpt":0.21083176085781655,"score_spread":0.19632685658267077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001180691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019268349,0.000087858796,0.9891487,0.00003464012,0.000030656945,0.000034531244,0.00011139319,0.0076162172,0.0010091013],"genre_scores_gemma":[0.068380855,0.00027500303,0.92556196,0.00011281108,0.000039201368,0.0001772337,0.0006626034,0.0016337323,0.0031566008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999111,0.00014363998,0.000060162074,0.00009777346,0.0005274121,0.000060007933],"domain_scores_gemma":[0.9990533,0.00047109416,0.0000887609,0.00015499216,0.00020040192,0.000031485837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006992602,0.0009504745,0.0005402415,0.00085259514,0.00036653015,0.00056284,0.0017525294,0.00063616544,0.010310251],"category_scores_gemma":[0.002370034,0.000632362,0.0006013729,0.00069967884,0.00036689846,0.0010839945,0.0007131083,0.00092907593,0.0023815846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024225148,0.00007911395,0.0006550016,0.0005983832,0.000057792196,0.00034890586,0.00014361428,0.17896774,0.056126095,0.017863786,0.022695825,0.72222143],"study_design_scores_gemma":[0.00024409332,0.00042048914,0.000660279,0.00009126321,0.000037566784,0.0008739459,0.000046070996,0.8759658,0.048519745,0.017637664,0.055419903,0.000083210056],"about_ca_topic_score_codex":0.0013971706,"about_ca_topic_score_gemma":0.001927983,"teacher_disagreement_score":0.010310251,"about_ca_system_score_codex":0.00041009023,"about_ca_system_score_gemma":0.00083359046,"threshold_uncertainty_score":0.03449124},"labels":[],"label_agreement":null},{"id":"W2002528607","doi":"10.1109/fpl.2012.6339245","title":"On the difficulty of pin-to-wire routing in FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Router; Computer science; Modular design; Very-large-scale integration; Control reconfiguration; Block (permutation group theory); Embedded system; Path (computing); Place and route; Computer network","score_opus":0.015020525938502805,"score_gpt":0.2166773981920934,"score_spread":0.20165687225359058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002528607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77611846,0.0041736886,0.17920095,0.0023051628,0.0002755223,0.000115980685,0.00017007005,0.0007019747,0.036938205],"genre_scores_gemma":[0.95259786,0.0021964894,0.039785992,0.00023588039,0.000089803565,0.000040725292,0.000110223824,0.00017231952,0.004770715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987741,0.0003775424,0.000077365265,0.00018041152,0.00045608327,0.00013442355],"domain_scores_gemma":[0.9928986,0.0050351364,0.0007475912,0.00076632004,0.00045744554,0.00009485793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544009,0.00059905666,0.00032028454,0.00056697027,0.0006775974,0.0011332117,0.0005762909,0.00087435317,0.0030835029],"category_scores_gemma":[0.008421486,0.00036831814,0.00022609028,0.00062230375,0.0009559773,0.0034987372,0.00046834102,0.0009535286,0.00062110595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011458066,0.000302864,0.0130689135,0.0009742909,0.00011869451,0.0023474111,0.0010664094,0.5274035,0.19309656,0.073624656,0.004006255,0.1828447],"study_design_scores_gemma":[0.00015744967,0.0039368295,0.022118542,0.00043850412,0.00016950462,0.008500281,0.001632095,0.6119587,0.23336102,0.07191908,0.04557987,0.0002281107],"about_ca_topic_score_codex":0.0010201883,"about_ca_topic_score_gemma":0.0012350501,"teacher_disagreement_score":0.0030835029,"about_ca_system_score_codex":0.00072308374,"about_ca_system_score_gemma":0.00020517896,"threshold_uncertainty_score":0.010315299},"labels":[],"label_agreement":null},{"id":"W2002849997","doi":"10.1007/s10878-015-9880-z","title":"An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rounding; Semidefinite programming; Randomized rounding; Univariate; Approximation algorithm; Maximum cut; Theory of computation; Linear programming; Bivariate analysis; Mathematics; Partition (number theory); Semidefinite embedding; Mathematical optimization; Algorithm; Graph partition; Graph; Computer science; Discrete mathematics; Combinatorics; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.04340661387300668,"score_gpt":0.28112499689139314,"score_spread":0.23771838301838646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002849997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111284265,0.00037565888,0.9760607,0.00032535382,0.00013938513,0.00010425783,0.00019077887,0.0006151532,0.011060199],"genre_scores_gemma":[0.2131635,0.00031092035,0.7779811,0.00034288928,0.00009634674,0.00035528457,0.00052790414,0.0003710945,0.0068509425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991135,0.0002545684,0.00003249578,0.00016359311,0.00024580566,0.00019002215],"domain_scores_gemma":[0.9986947,0.00085552083,0.00008806071,0.0001555879,0.00013638772,0.00006969139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013785758,0.0018510673,0.0020318427,0.0009260456,0.0008907044,0.0024219505,0.0019020902,0.0017368648,0.01396683],"category_scores_gemma":[0.004516654,0.0007699229,0.0009599536,0.0016136104,0.0008682565,0.0021151016,0.002182842,0.0021678878,0.0019886522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041293012,0.00024535772,0.0003624276,0.00025879598,0.000059869948,0.00013037847,0.00009266916,0.7651382,0.0022268614,0.06566601,0.014801354,0.1506052],"study_design_scores_gemma":[0.00004880316,0.000046080793,0.0000405675,0.000026367536,0.000007883885,0.000036381367,0.00002706905,0.9762659,0.0005210826,0.021548433,0.0014231254,0.0000083388995],"about_ca_topic_score_codex":0.0033215564,"about_ca_topic_score_gemma":0.0056576035,"teacher_disagreement_score":0.01396683,"about_ca_system_score_codex":0.001320511,"about_ca_system_score_gemma":0.0019142083,"threshold_uncertainty_score":0.046723723},"labels":[],"label_agreement":null},{"id":"W2003258276","doi":"10.1109/fpt.2008.4762362","title":"A system-level stochastic circuit generator for FPGA architecture evaluation","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Electronic circuit; Generator (circuit theory); Field-programmable gate array; Dataflow; Benchmark (surveying); Digital pattern generator; Sequential logic; Circuit design; Design flow; Computer architecture; Electronic engineering; Computer hardware; Embedded system; Parallel computing; Logic gate; Engineering; Electrical engineering; Power (physics); Algorithm","score_opus":0.06698503212614257,"score_gpt":0.24620833593829197,"score_spread":0.1792233038121494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003258276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035196338,0.000106205094,0.9463391,0.0000959495,0.000053799336,0.0003122387,0.00085472624,0.01410057,0.0029410583],"genre_scores_gemma":[0.4348814,0.00012308438,0.5590156,0.000118902535,0.00003621498,0.0007689055,0.0017792408,0.0014477739,0.0018289696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993742,0.00020342771,0.000041174044,0.000081211656,0.0002514991,0.00004850151],"domain_scores_gemma":[0.99806064,0.0010090538,0.00014970863,0.0003411295,0.00039600465,0.000043575095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600948,0.00092473754,0.0004048034,0.0009382268,0.00026800408,0.0005239287,0.0011371099,0.00045052188,0.0072673038],"category_scores_gemma":[0.0048049917,0.0003392266,0.0004085986,0.0005990178,0.00026480076,0.00080459175,0.00034355585,0.00063404633,0.0008491926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004103984,0.00026746068,0.0048261783,0.0005647366,0.00011685696,0.00051580684,0.00011285203,0.5759397,0.06797968,0.026875017,0.016171223,0.30622014],"study_design_scores_gemma":[0.000058175287,0.00019251794,0.0005105785,0.00001802984,0.000018796405,0.00019947767,0.000008414373,0.9625298,0.027976163,0.0034478798,0.0050226604,0.000017596481],"about_ca_topic_score_codex":0.0010285072,"about_ca_topic_score_gemma":0.0016746974,"teacher_disagreement_score":0.0072673038,"about_ca_system_score_codex":0.0007233201,"about_ca_system_score_gemma":0.00092666247,"threshold_uncertainty_score":0.024311543},"labels":[],"label_agreement":null},{"id":"W2003452683","doi":"10.1145/360276.360292","title":"A crosstalk-aware timing-driven router for FPGAs","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Crosstalk; Router; Field-programmable gate array; Computer science; Network routing; Electronic circuit; Application-specific integrated circuit; Embedded system; Routing (electronic design automation); Electronic engineering; Computer architecture; Computer network; Engineering; Electrical engineering","score_opus":0.026533057123853076,"score_gpt":0.2533236222733968,"score_spread":0.2267905651495437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003452683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14139596,0.0013309683,0.84465516,0.0003045879,0.00020996561,0.00009897494,0.00015775899,0.0068477704,0.0049988916],"genre_scores_gemma":[0.5228956,0.00050841994,0.46975428,0.00022973909,0.00009155352,0.000043547538,0.00020019701,0.00014191274,0.006134865],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997646,0.000056371417,0.000017001657,0.000051545143,0.00007678417,0.00003368053],"domain_scores_gemma":[0.9997094,0.000070790615,0.000048719336,0.00005128229,0.000095087285,0.000024658084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002871808,0.0003703735,0.0002871414,0.00042604783,0.00028618044,0.00050594244,0.00080384384,0.00039516643,0.0014250204],"category_scores_gemma":[0.00053871557,0.00022362352,0.00020325209,0.00031711158,0.00015584053,0.0004994951,0.00017219153,0.00035940844,0.0003186663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068339804,0.0002199231,0.003074995,0.00029523048,0.00015605819,0.0006396774,0.00009608434,0.18404347,0.4451087,0.018279813,0.0077741384,0.33962858],"study_design_scores_gemma":[0.00009344912,0.0008778807,0.0022489002,0.000031014904,0.00016193949,0.00091729296,0.000022262951,0.76992345,0.20506002,0.002386655,0.018211879,0.00006516755],"about_ca_topic_score_codex":0.0010244075,"about_ca_topic_score_gemma":0.0027939847,"teacher_disagreement_score":0.0014250204,"about_ca_system_score_codex":0.00044796144,"about_ca_system_score_gemma":0.00057035347,"threshold_uncertainty_score":0.0047671795},"labels":[],"label_agreement":null},{"id":"W2003514664","doi":"10.1109/newcas.2008.4606338","title":"An interconnection network for a novel reconfigurable circuit board","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Interconnection; Crossbar switch; Multiplexer; Computer science; Netlist; CMOS; Integrated circuit; Reticle; Embedded system; Electronic circuit; Electronic engineering; Engineering; Electrical engineering; Multiplexing; Wafer; Computer network; Telecommunications","score_opus":0.0373521198387689,"score_gpt":0.22806556701699535,"score_spread":0.19071344717822644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003514664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22853513,0.0013925097,0.7227668,0.00061719277,0.0004687847,0.00010146992,0.00035791844,0.0040575103,0.0417027],"genre_scores_gemma":[0.672922,0.00058158085,0.30796516,0.00013465826,0.00007645024,0.000089452886,0.00056084606,0.00015864048,0.017511245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990606,0.000015451902,0.0000057669877,0.000026632679,0.000033255783,0.000012893777],"domain_scores_gemma":[0.9999341,0.00001476735,0.000010474805,0.000017931485,0.000015187096,0.0000075852718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008413833,0.0002246692,0.00008974529,0.00025142689,0.00018711286,0.00036652893,0.00041105325,0.0002756673,0.0034109536],"category_scores_gemma":[0.00020139705,0.000100720914,0.00013427922,0.00022861455,0.00015084445,0.00052466337,0.00020304715,0.00020979287,0.00068220444],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022916756,0.0000611284,0.0010416891,0.00025020418,0.00004571856,0.0005994592,0.00009641824,0.044479456,0.6145586,0.056593392,0.008830863,0.27321383],"study_design_scores_gemma":[0.00013431239,0.0010857704,0.0040666563,0.00006322266,0.00009806621,0.0019205018,0.000066635206,0.32219794,0.3040064,0.011026661,0.35525295,0.00008088892],"about_ca_topic_score_codex":0.0005696855,"about_ca_topic_score_gemma":0.0010059788,"teacher_disagreement_score":0.0034109536,"about_ca_system_score_codex":0.00035483934,"about_ca_system_score_gemma":0.00019175356,"threshold_uncertainty_score":0.011410832},"labels":[],"label_agreement":null},{"id":"W2004141433","doi":"10.1145/1231996.1232020","title":"An effective clustering algorithm for mixed-size placement","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Benchmark (surveying); Preprocessor; Algorithm; Very-large-scale integration; Data mining; Correlation clustering; Computer engineering; Artificial intelligence; Embedded system","score_opus":0.006215602005690232,"score_gpt":0.24861659169032685,"score_spread":0.2424009896846366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004141433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032131379,0.00013517505,0.9945925,0.00005776771,0.000041557367,0.00007004801,0.000040599876,0.0008499815,0.0009992904],"genre_scores_gemma":[0.05100646,0.00014799638,0.94564617,0.00006244856,0.000040350827,0.0001524545,0.00025851966,0.00016554302,0.0025200807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909353,0.00011759561,0.000062038314,0.0001907144,0.0004712621,0.00006480827],"domain_scores_gemma":[0.99914944,0.00016612318,0.00008995521,0.0001635639,0.0003943828,0.00003661893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055769796,0.0011074028,0.00093237654,0.0023485692,0.0010733436,0.00085115223,0.0017361284,0.0011082819,0.0035704072],"category_scores_gemma":[0.001917669,0.00048454347,0.0006396494,0.0021196434,0.00057996315,0.0014666609,0.001090273,0.00084872794,0.0017104873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014505321,0.00006687792,0.00044687573,0.00016789521,0.00006963029,0.000087271095,0.000119147306,0.1569473,0.031095302,0.019083792,0.008790183,0.7829806],"study_design_scores_gemma":[0.00007108492,0.00014819129,0.00050066126,0.000018598035,0.000033669494,0.00029263686,0.00006772287,0.94872206,0.020054728,0.014615123,0.015429649,0.000045915534],"about_ca_topic_score_codex":0.0029642829,"about_ca_topic_score_gemma":0.0054675657,"teacher_disagreement_score":0.0035704072,"about_ca_system_score_codex":0.0010067223,"about_ca_system_score_gemma":0.0012534019,"threshold_uncertainty_score":0.011944175},"labels":[],"label_agreement":null},{"id":"W2004853491","doi":"10.1109/iscas.2007.377864","title":"A Performance Driven Layout Compaction Optimization Algorithm for Analog Circuits","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Physical design; Schematic; Integrated circuit layout; Electronic circuit; Topology optimization; Electronic engineering; Analogue electronics; Integrated circuit design; Circuit extraction; Mixed-signal integrated circuit; Circuit design; Integrated circuit; Engineering; Embedded system; Equivalent circuit; Electrical engineering","score_opus":0.014088080614889885,"score_gpt":0.23145113838060938,"score_spread":0.2173630577657195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004853491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039154943,0.00008520931,0.99439263,0.000047417987,0.000008739666,0.000027480535,0.000029010367,0.0005630805,0.0009308673],"genre_scores_gemma":[0.10651674,0.00014158797,0.8899687,0.00008209305,0.000027280303,0.00019325393,0.00024003178,0.00023223225,0.0025981013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997111,0.00005943688,0.000016354765,0.000053301843,0.00013010069,0.000029668783],"domain_scores_gemma":[0.9996332,0.00019772074,0.00003714751,0.00003869433,0.00008397981,0.000009142846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004657957,0.0007620539,0.00052026135,0.0005706729,0.00031692692,0.0005776222,0.0005840938,0.0005580324,0.0026823299],"category_scores_gemma":[0.0014186538,0.00034476953,0.00037061758,0.0006864206,0.0003801555,0.00055439165,0.000653457,0.00052102533,0.0006470565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110435576,0.000053175172,0.0003778188,0.000090756184,0.000037395926,0.000063137566,0.000076262375,0.5040473,0.018739568,0.011217864,0.0039901426,0.4611961],"study_design_scores_gemma":[0.00003200733,0.000045229095,0.00012926292,0.0000060765515,0.0000100902425,0.000038633774,0.000010766975,0.98871255,0.0044165566,0.0040751165,0.0025177938,0.0000059014083],"about_ca_topic_score_codex":0.0014193782,"about_ca_topic_score_gemma":0.0020044718,"teacher_disagreement_score":0.0026823299,"about_ca_system_score_codex":0.0005738873,"about_ca_system_score_gemma":0.00063521334,"threshold_uncertainty_score":0.0089733},"labels":[],"label_agreement":null},{"id":"W2004889232","doi":"10.1016/s0167-8396(02)00147-4","title":"Adjusting control points to achieve continuity","year":2002,"lang":"en","type":"article","venue":"Computer Aided Geometric Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Control (management); Algebra over a field; Pure mathematics; Calculus (dental); Computer science; Artificial intelligence","score_opus":0.025877979061212152,"score_gpt":0.20456243658526488,"score_spread":0.17868445752405274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004889232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033508457,0.000039695802,0.95952207,0.00003529547,0.000054967866,0.000076519165,0.000010564564,0.0007421615,0.006010298],"genre_scores_gemma":[0.70758426,0.00006927714,0.28739405,0.000045759756,0.00001847291,0.000109793626,0.00003172665,0.0001606969,0.0045859586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948776,0.000052819087,0.000027959008,0.00015468012,0.00019096458,0.00008572379],"domain_scores_gemma":[0.99935657,0.0001704329,0.000083640414,0.00020232674,0.00015439178,0.00003261373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053025625,0.00085037685,0.00046115372,0.0007968002,0.000714399,0.0012226659,0.0009672227,0.00068230456,0.003929216],"category_scores_gemma":[0.0024021731,0.00044682127,0.000264851,0.0004575078,0.00083605247,0.0009828714,0.0010166919,0.0008757918,0.00086741085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066225627,0.00033275987,0.0017337626,0.00017174844,0.000040547802,0.00030745543,0.0007534979,0.14991796,0.23664933,0.06923844,0.0024942025,0.53769815],"study_design_scores_gemma":[0.00024580062,0.0010382362,0.0016438949,0.00004863714,0.000048643262,0.000397512,0.00020268568,0.6800967,0.27081484,0.025618754,0.019761262,0.00008302748],"about_ca_topic_score_codex":0.0014034068,"about_ca_topic_score_gemma":0.0015590435,"teacher_disagreement_score":0.003929216,"about_ca_system_score_codex":0.00039055938,"about_ca_system_score_gemma":0.0006162053,"threshold_uncertainty_score":0.013144553},"labels":[],"label_agreement":null},{"id":"W2005275470","doi":"10.1109/fpl.2009.5272519","title":"An analytical model relating FPGA architecture and place and route runtime","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Simulated annealing; Router; Architecture; Computer science; Bounding overwatch; Parallel computing; Computer architecture; Function (biology); Embedded system; Algorithm; Artificial intelligence; Computer network","score_opus":0.008682102570983872,"score_gpt":0.22696931461758227,"score_spread":0.2182872120465984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005275470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0195526,0.0006195442,0.94301844,0.00084480556,0.00008417876,0.00006813176,0.00023029893,0.0006796307,0.034902297],"genre_scores_gemma":[0.7449775,0.0032908064,0.19563875,0.00039969865,0.00014402096,0.00037599634,0.00041706685,0.00061358383,0.05414258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994562,0.00009589709,0.000019708365,0.0000952426,0.0002401536,0.000092822374],"domain_scores_gemma":[0.9991529,0.00046647797,0.00012183268,0.00008299239,0.00015078427,0.000025029585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053120987,0.00075549097,0.00059037353,0.00095113367,0.0005435101,0.0015505088,0.0015019443,0.0013683223,0.006635227],"category_scores_gemma":[0.0036519992,0.0007030915,0.0006054146,0.000991308,0.0008947602,0.0022771542,0.0005277035,0.0009947512,0.0023470693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126904815,0.000010889769,0.00011698063,0.0000297362,0.00000622695,0.000050326416,0.000026611237,0.96085817,0.0014421243,0.031453412,0.0005208377,0.005471998],"study_design_scores_gemma":[0.0000035313708,0.000011909675,0.00007555367,0.0000076100605,0.000006453305,0.0000457684,0.0000105690715,0.9914689,0.00051476026,0.0061328798,0.0017162849,0.00000578816],"about_ca_topic_score_codex":0.008292171,"about_ca_topic_score_gemma":0.006160169,"teacher_disagreement_score":0.008292171,"about_ca_system_score_codex":0.002245753,"about_ca_system_score_gemma":0.0013844689,"threshold_uncertainty_score":0.022197008},"labels":[],"label_agreement":null},{"id":"W2005283161","doi":"10.1109/pads.2012.28","title":"Offline Road Network Partitioning in Distributed Transportation Simulation","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Graph; Flow network; Distributed computing; Graph theory; Space partitioning; Intelligent transportation system; Theoretical computer science; Algorithm; Mathematical optimization; Engineering","score_opus":0.014067868415996368,"score_gpt":0.23591936161437835,"score_spread":0.221851493198382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005283161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054037098,0.000112126676,0.9379175,0.000094275085,0.000028099974,0.000087996064,0.00009832438,0.0010074468,0.0066171936],"genre_scores_gemma":[0.6967654,0.00015925223,0.29929626,0.00006149266,0.000016817878,0.00021038021,0.00028302785,0.00031833563,0.0028890532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929035,0.0003446543,0.000033389006,0.00009485301,0.00015784964,0.00007894308],"domain_scores_gemma":[0.9986804,0.00074738724,0.00007764775,0.00028105246,0.0001519863,0.0000615106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006459579,0.0006332111,0.00060050836,0.00038261968,0.00047501366,0.00077778765,0.0010383214,0.00057867134,0.0029035264],"category_scores_gemma":[0.002000122,0.00038571615,0.00048633883,0.0003708012,0.0006085464,0.0014251054,0.0009530903,0.0009079887,0.00039780466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053534128,0.000025335841,0.00043335094,0.00002225766,0.000009477104,0.000034139826,0.000042708813,0.9755146,0.0022351118,0.006970949,0.00032174712,0.0143368635],"study_design_scores_gemma":[0.000009329108,0.000016874654,0.00006614953,0.0000029204498,0.000002756183,0.000008781891,0.000013791249,0.99488586,0.0014175376,0.0026143205,0.0009584938,0.0000031101788],"about_ca_topic_score_codex":0.006329267,"about_ca_topic_score_gemma":0.0063211573,"teacher_disagreement_score":0.006329267,"about_ca_system_score_codex":0.0008088359,"about_ca_system_score_gemma":0.00097585336,"threshold_uncertainty_score":0.012584865},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01091939259929031,"score_gpt":0.2032694107926043,"score_spread":0.192350018193314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005602803","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041518766,0.0013940979,0.25382063,0.00046088078,0.00057061657,0.00052995316,0.024042062,0.6085458,0.1064841],"genre_scores_gemma":[0.095962785,0.003539486,0.29487142,0.0020621957,0.00038158114,0.001881063,0.15102391,0.27816176,0.17211592],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865544,0.0001852751,0.000113730464,0.00015629306,0.0006926315,0.00019661209],"domain_scores_gemma":[0.9987112,0.00036657124,0.000104228726,0.00036924568,0.0003746658,0.0000741613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750251,0.0021576046,0.0010463778,0.0016033539,0.00043096626,0.0028768473,0.0061447364,0.0017940174,0.18418477],"category_scores_gemma":[0.0048266244,0.0019123654,0.0022354673,0.00097398256,0.0005365057,0.0031857435,0.0018779588,0.0027403007,0.08498552],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011268449,0.0002547515,0.0017021521,0.0017808299,0.00023609187,0.00061023125,0.00024330693,0.01871631,0.017366273,0.041083217,0.73635334,0.18052661],"study_design_scores_gemma":[0.0008813773,0.00050684926,0.0013378996,0.00042149617,0.00010902595,0.0013698784,0.000075803706,0.07900281,0.030192003,0.029537825,0.8563473,0.00021757631],"about_ca_topic_score_codex":0.0025865065,"about_ca_topic_score_gemma":0.0024659364,"teacher_disagreement_score":0.18418477,"about_ca_system_score_codex":0.0009659087,"about_ca_system_score_gemma":0.0012554007,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2007109372","doi":"10.1109/tvlsi.2009.2031318","title":"Exploring Area and Delay Tradeoffs in FPGAs With Architecture and Automated Transistor Design","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Sizing; Computer architecture; Embedded system; Transistor; Circuit design; Design space exploration; Architecture; Engineering; Electrical engineering","score_opus":0.03155522727447946,"score_gpt":0.2092796363849271,"score_spread":0.17772440911044765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007109372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8039997,0.0012593989,0.17839693,0.0003470247,0.00005233661,0.00008403133,0.000319814,0.0014828226,0.014057967],"genre_scores_gemma":[0.85049945,0.00034574,0.14741796,0.000057650817,0.000014963377,0.00006396254,0.00017640142,0.00014454406,0.0012793168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00012136907,0.000019021452,0.00005802502,0.00015520304,0.0000520125],"domain_scores_gemma":[0.9982681,0.0013402958,0.00015111206,0.00010745065,0.00011661099,0.00001634789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056988944,0.00071722997,0.0003050396,0.0009385527,0.00028458738,0.0006550096,0.00059441593,0.00048539657,0.0020519912],"category_scores_gemma":[0.0020988798,0.00043458637,0.00055629003,0.0007758655,0.00034618017,0.00094676757,0.00028431945,0.000560742,0.00020208531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001440317,0.00010391979,0.005073442,0.00019994455,0.00005652646,0.00018781405,0.00011938688,0.86739194,0.03507248,0.0067134993,0.00094439427,0.08399266],"study_design_scores_gemma":[0.00003858515,0.00032610894,0.0021420773,0.000018665214,0.00004342707,0.00011973275,0.00008061339,0.9698457,0.018444806,0.0057090833,0.0032062137,0.000024908357],"about_ca_topic_score_codex":0.002492448,"about_ca_topic_score_gemma":0.005175901,"teacher_disagreement_score":0.002492448,"about_ca_system_score_codex":0.0008985963,"about_ca_system_score_gemma":0.0006772972,"threshold_uncertainty_score":0.0068645477},"labels":[],"label_agreement":null},{"id":"W2007585924","doi":"10.1109/iscas.2010.5537954","title":"Rapid design space exploration for multi parametric optimization of VLSI designs","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Design space exploration; Computer science; Maximization; Minification; Parametric statistics; Multi-objective optimization; Very-large-scale integration; Process (computing); Pareto principle; Acceleration; Mathematical optimization; Embedded system; Machine learning; Mathematics","score_opus":0.10578131260809866,"score_gpt":0.27499697947881796,"score_spread":0.16921566687071932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007585924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127862105,0.0004889163,0.98384684,0.000069213675,0.000012224795,0.000054601256,0.000027523685,0.0004190468,0.0022954165],"genre_scores_gemma":[0.24775562,0.0004671513,0.74961793,0.00003832136,0.000015187088,0.0002730557,0.000089935784,0.00012496056,0.0016178377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00031180144,0.00001924805,0.000039586972,0.0002744813,0.000031613326],"domain_scores_gemma":[0.9990545,0.0007039264,0.000061795145,0.00007837046,0.00008635843,0.000015062017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011519892,0.00091555575,0.00048476682,0.0010134643,0.00030121967,0.0005129906,0.0004584859,0.0003996104,0.0030793694],"category_scores_gemma":[0.0024907116,0.0004516685,0.000674179,0.0005502541,0.00044470202,0.0007609464,0.0009641061,0.0007990211,0.00036521885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011478021,0.000051350413,0.00047607798,0.00027013625,0.000055021857,0.00006410213,0.0001636011,0.7001429,0.023730168,0.020239538,0.0010036464,0.25368863],"study_design_scores_gemma":[0.000027005017,0.00012312103,0.00021066227,0.000024430481,0.00001026099,0.000058373964,0.000032222903,0.9776063,0.0075586643,0.010047509,0.004289632,0.00001183265],"about_ca_topic_score_codex":0.0005693264,"about_ca_topic_score_gemma":0.0010378412,"teacher_disagreement_score":0.0030793694,"about_ca_system_score_codex":0.0003897378,"about_ca_system_score_gemma":0.00071856816,"threshold_uncertainty_score":0.010301471},"labels":[],"label_agreement":null},{"id":"W2007959382","doi":"10.1145/2331147.2331152","title":"Hierarchical Benchmark Circuit Generation for FPGA Architecture Evaluation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Electronic circuit; Dataflow; Field-programmable gate array; Generator (circuit theory); Computer architecture; Parallel computing; Embedded system; Computer engineering; Computer hardware; Power (physics); Electrical engineering; Engineering","score_opus":0.050136347844918536,"score_gpt":0.28097832139972867,"score_spread":0.23084197355481012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007959382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093808435,0.0002253236,0.8878728,0.0001480473,0.00006612963,0.00040465756,0.0012780118,0.009992193,0.006204338],"genre_scores_gemma":[0.54619783,0.00014463092,0.44716865,0.00014706147,0.000030315336,0.0006526488,0.0030106138,0.0011314723,0.0015167061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999178,0.0002938383,0.0000514263,0.000095238254,0.00031592144,0.000065598084],"domain_scores_gemma":[0.9975141,0.0012884554,0.00020032116,0.00043163984,0.0005199777,0.000045370238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864616,0.000964855,0.0003979609,0.0012529506,0.0003069686,0.00049312133,0.0014097664,0.00044474186,0.00655748],"category_scores_gemma":[0.006326793,0.00029116622,0.00045883676,0.00093605,0.00029869736,0.0008995574,0.00041690204,0.00061902625,0.0006528638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003242725,0.00024838306,0.004632048,0.0005491533,0.00008602598,0.00034246015,0.00007644198,0.625754,0.05083701,0.03234336,0.012882071,0.27192473],"study_design_scores_gemma":[0.000052482395,0.00018933552,0.0006003206,0.000017476332,0.000018548735,0.000114144685,0.000012746316,0.9612498,0.026933338,0.0068413117,0.003956865,0.000013603261],"about_ca_topic_score_codex":0.001969819,"about_ca_topic_score_gemma":0.0036151614,"teacher_disagreement_score":0.00655748,"about_ca_system_score_codex":0.0010459642,"about_ca_system_score_gemma":0.0011605329,"threshold_uncertainty_score":0.021937013},"labels":[],"label_agreement":null},{"id":"W2008705031","doi":"10.1109/cec.2009.4983014","title":"Discrete and continuous particle swarm optimization for FPGA placement","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Particle swarm optimization; Simulated annealing; Computer science; Multi-swarm optimization; Domain (mathematical analysis); Placement; Algorithm; Mathematical optimization; Swarm behaviour; Parallel computing; Embedded system; Mathematics; Artificial intelligence; Physical design","score_opus":0.008001580646048728,"score_gpt":0.22099257699464994,"score_spread":0.21299099634860122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008705031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054359976,0.00031800862,0.99138415,0.0001178458,0.00009120645,0.000018077633,0.000012131287,0.00010404369,0.0025184988],"genre_scores_gemma":[0.41782355,0.0007630107,0.5759939,0.0000850251,0.00017298337,0.00013189421,0.000091677444,0.00006121005,0.0048767575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968815,0.00010497382,0.000013874521,0.00004258754,0.00013279277,0.000017671287],"domain_scores_gemma":[0.9995832,0.00024534704,0.00003284802,0.00004681079,0.00007041508,0.000021356438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789417,0.0005324127,0.0005225649,0.00043887878,0.00030247844,0.000746541,0.0006373297,0.0007523033,0.0015606738],"category_scores_gemma":[0.0015372735,0.000305229,0.0004276139,0.00047281678,0.00068237603,0.00067842,0.0004453888,0.00077212753,0.0002991947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053163007,0.000034887835,0.00029259405,0.00008415273,0.000031156473,0.00004532626,0.00003235268,0.9130583,0.0024600162,0.022781486,0.0011112647,0.06001525],"study_design_scores_gemma":[0.000011649951,0.000019115441,0.000060366427,0.0000033053398,0.0000031510037,0.000011218488,0.0000035237172,0.99579936,0.00035027583,0.0028078405,0.00092692504,0.0000032261366],"about_ca_topic_score_codex":0.002340374,"about_ca_topic_score_gemma":0.0018870563,"teacher_disagreement_score":0.002340374,"about_ca_system_score_codex":0.0004753015,"about_ca_system_score_gemma":0.00048486158,"threshold_uncertainty_score":0.0052210093},"labels":[],"label_agreement":null},{"id":"W2010480731","doi":"10.1002/cta.551","title":"Symmetry‐aware placement algorithm using transitive closure graph representation for analog integrated circuits","year":2008,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive closure; Analogue electronics; Representation (politics); Algorithm; Transitive relation; Topology (electrical circuits); Computer science; Graph; Mathematics; Analog computer; Set (abstract data type); Electronic circuit; Theoretical computer science; Discrete mathematics; Combinatorics; Engineering","score_opus":0.02705385555040781,"score_gpt":0.28247698988882064,"score_spread":0.25542313433841285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010480731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04490085,0.0001276998,0.94980484,0.00013462701,0.000042745447,0.00010402912,0.00006863686,0.0014528658,0.0033637967],"genre_scores_gemma":[0.41402552,0.00011632247,0.5828671,0.00006358676,0.000026997322,0.00013608996,0.00032304585,0.00012815084,0.002313248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951625,0.00014641008,0.000030967873,0.00008658211,0.00016989713,0.000049903625],"domain_scores_gemma":[0.9994586,0.00020419442,0.00010525413,0.00012500488,0.00008585578,0.000021140531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047412427,0.00075779215,0.00067887595,0.0009605052,0.00037789467,0.00061679486,0.0008701995,0.00052205264,0.0028390288],"category_scores_gemma":[0.0013927825,0.0003151658,0.0005804382,0.00086613983,0.00045986846,0.0009287242,0.00075068197,0.00051310455,0.00047636626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021202833,0.0001577273,0.0006784515,0.00018594321,0.00005136503,0.000298076,0.00018771488,0.48324648,0.028940603,0.046581645,0.004658344,0.43480164],"study_design_scores_gemma":[0.000053950112,0.00012761317,0.00013954015,0.000009984584,0.00001641807,0.00012976922,0.000042797023,0.9662818,0.01213851,0.018717293,0.0023289619,0.000013362468],"about_ca_topic_score_codex":0.0016533369,"about_ca_topic_score_gemma":0.001434814,"teacher_disagreement_score":0.0028390288,"about_ca_system_score_codex":0.0006968304,"about_ca_system_score_gemma":0.00094261096,"threshold_uncertainty_score":0.009497523},"labels":[],"label_agreement":null},{"id":"W2011011346","doi":"10.5430/air.v1n2p38","title":"A enhanced algorithm for floorplan design using evolutionary technique","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Floorplan; Placement; Very-large-scale integration; Computer science; Genetic algorithm; Reliability (semiconductor); Physical design; Bounding overwatch; Domain (mathematical analysis); Chip; Scale (ratio); Mathematical optimization; Integrated circuit layout; Reliability engineering; Circuit design; Integrated circuit; Engineering; Mathematics; Embedded system; Artificial intelligence; Machine learning","score_opus":0.2746751030610162,"score_gpt":0.4215272742641248,"score_spread":0.14685217120310856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011011346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063071903,0.000110257126,0.9912971,0.000037348964,0.000021393327,0.000053307456,0.000031434545,0.00042695552,0.0017149609],"genre_scores_gemma":[0.08459957,0.00011781798,0.9132985,0.000045753295,0.000014035112,0.00021890634,0.00012728233,0.00008243255,0.001495735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971765,0.00008460688,0.000012523448,0.000042807347,0.000111284084,0.000031090538],"domain_scores_gemma":[0.99972945,0.0001552646,0.000020495032,0.00002398403,0.00006137042,0.000009386031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042586346,0.00060043053,0.0005912802,0.00068677496,0.0003642965,0.00039755553,0.00082159485,0.00077806116,0.0031011763],"category_scores_gemma":[0.0010312893,0.00036177813,0.0006091502,0.000688123,0.0003290611,0.00043687795,0.0005053036,0.0006907225,0.0005426989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005277064,0.000058303976,0.00035427316,0.00008431325,0.000039868257,0.00010750765,0.000068198715,0.7396875,0.008775858,0.008244041,0.0015493958,0.24097797],"study_design_scores_gemma":[0.000024868517,0.00005271207,0.00012674002,0.000008597805,0.000010481222,0.000063744505,0.00000724935,0.9943587,0.0011884746,0.0020139439,0.002139246,0.0000053190047],"about_ca_topic_score_codex":0.0022361404,"about_ca_topic_score_gemma":0.0026313474,"teacher_disagreement_score":0.0031011763,"about_ca_system_score_codex":0.00031763111,"about_ca_system_score_gemma":0.00064856856,"threshold_uncertainty_score":0.010374427},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.050586100689397985,"score_gpt":0.28790428891801184,"score_spread":0.23731818822861386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011407463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005123288,0.006934913,0.96482074,0.000970651,0.00027104025,0.000096900505,0.00005962681,0.0006465343,0.021076433],"genre_scores_gemma":[0.21582945,0.009299618,0.74982387,0.0006967965,0.0003851573,0.0004967304,0.00023180801,0.00023837303,0.02299829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.00009092251,0.000010052478,0.000040678653,0.000116198324,0.000015876618],"domain_scores_gemma":[0.9997744,0.00010906128,0.000024915365,0.00003775194,0.000047796755,0.0000060897983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046829143,0.00070658064,0.0006354062,0.00065337797,0.0003344823,0.0011171785,0.00091958,0.0011358297,0.0045821257],"category_scores_gemma":[0.0009868762,0.00024761056,0.0004687917,0.0012688187,0.0007335728,0.0010514321,0.0005438459,0.00093099836,0.0018751775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042552827,0.000055081633,0.0004169225,0.00059114484,0.0001133148,0.00013285331,0.000115622504,0.3849849,0.007948953,0.12712327,0.010948239,0.46752712],"study_design_scores_gemma":[0.00006401434,0.00009869632,0.00049908966,0.00014855534,0.000054818112,0.000535202,0.000052302024,0.77954185,0.007912289,0.13282073,0.078234114,0.000038307586],"about_ca_topic_score_codex":0.00075507455,"about_ca_topic_score_gemma":0.000993547,"teacher_disagreement_score":0.0045821257,"about_ca_system_score_codex":0.00059476215,"about_ca_system_score_gemma":0.0004772575,"threshold_uncertainty_score":0.015328765},"labels":[],"label_agreement":null},{"id":"W2011527102","doi":"10.1145/503048.503061","title":"EVE","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Event (particle physics); Sequential logic; Place and route; Electronic circuit; Path (computing); Virtex; Critical path method; Digital electronics; Set (abstract data type); State (computer science); Computer architecture; Design flow; High-level synthesis; Parallel computing; Computer engineering; Embedded system; Logic gate; Algorithm; Operating system; Electrical engineering; Programming language","score_opus":0.013334471921745757,"score_gpt":0.15506935054961363,"score_spread":0.14173487862786788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011527102","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052195583,0.0021839568,0.21317573,0.005610898,0.004209259,0.00051056076,0.006265232,0.045478243,0.71734655],"genre_scores_gemma":[0.020581475,0.0014510202,0.061878797,0.0023169843,0.00082201976,0.00026077847,0.004706994,0.0056383237,0.9023436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987968,0.00020758662,0.00006830337,0.00020885392,0.0006018573,0.00011654764],"domain_scores_gemma":[0.9978376,0.0005500425,0.0001337168,0.0005941175,0.0005533851,0.00033117484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012790377,0.00093279907,0.0005182185,0.001182134,0.0008555994,0.0035149022,0.0014831193,0.001326112,0.31828764],"category_scores_gemma":[0.004910664,0.0005211478,0.0005825165,0.0007767614,0.0005333559,0.0033459237,0.0026806835,0.0014510184,0.17301837],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029252574,0.00006413613,0.0005639049,0.00031435132,0.000013659265,0.000362826,0.00033250157,0.00053740747,0.0050251884,0.06753121,0.54593843,0.37902394],"study_design_scores_gemma":[0.000012563809,0.000021608017,0.00014787722,0.000025143476,0.000002910269,0.0002348784,0.00002582646,0.0005702257,0.0013244888,0.003085927,0.9945398,0.0000088056],"about_ca_topic_score_codex":0.0005064599,"about_ca_topic_score_gemma":0.0009845697,"teacher_disagreement_score":0.31828764,"about_ca_system_score_codex":0.0005149946,"about_ca_system_score_gemma":0.00070071215,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028158768054671157,"score_gpt":0.20665786393279184,"score_spread":0.17849909587812068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014316444","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007006646,0.0019010183,0.4808242,0.0003302225,0.0004968617,0.00064018054,0.021968177,0.4215635,0.06526919],"genre_scores_gemma":[0.12787955,0.004340012,0.5196465,0.0013768368,0.00027683715,0.0031397832,0.094107956,0.15580432,0.0934282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890304,0.00018823726,0.00009780831,0.00013771784,0.00051828654,0.00015494802],"domain_scores_gemma":[0.99900144,0.00042785594,0.00009550799,0.00018915995,0.00023856708,0.000047499394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018761106,0.0017422746,0.0010253843,0.0013870285,0.0003590271,0.001894676,0.0041460507,0.0012694696,0.09323378],"category_scores_gemma":[0.003980237,0.0013928118,0.0013519858,0.0008003848,0.0004966536,0.0021295808,0.0015711862,0.002505691,0.036158234],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011155054,0.00029620097,0.003165633,0.0030417594,0.0003381957,0.0009870919,0.0003842992,0.046317484,0.021476865,0.06716739,0.5721064,0.28360313],"study_design_scores_gemma":[0.00063594064,0.00047079942,0.0021258027,0.0004513855,0.00011079019,0.0014319728,0.00008770931,0.10935872,0.039432004,0.036629397,0.809051,0.00021456457],"about_ca_topic_score_codex":0.0017825069,"about_ca_topic_score_gemma":0.0015012117,"teacher_disagreement_score":0.09323378,"about_ca_system_score_codex":0.00060128496,"about_ca_system_score_gemma":0.0010433473,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.002018548958097644,"score_gpt":0.14380518859818242,"score_spread":0.14178663964008478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015033143","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005245382,0.0039107227,0.025551446,0.0038787152,0.0038260065,0.00030355796,0.0062086903,0.008952374,0.94212306],"genre_scores_gemma":[0.035157796,0.0032522776,0.010060229,0.0014563261,0.0007009518,0.00020169553,0.0065363217,0.0018220551,0.9408123],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899536,0.00011447202,0.00006709047,0.00026609728,0.0004194755,0.00013754354],"domain_scores_gemma":[0.998494,0.00021372929,0.00007163631,0.00032677836,0.0005774038,0.00031643224],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007091616,0.0010623301,0.0007186531,0.0019368809,0.0014458955,0.0037257825,0.001442383,0.0020333254,0.6865618],"category_scores_gemma":[0.0022255182,0.00045923083,0.00051686313,0.0015227413,0.0005728413,0.0028501495,0.003191154,0.0013534139,0.4828779],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032430136,0.00016321224,0.0015431133,0.00058838533,0.000024610152,0.0006089654,0.00027980757,0.00094392244,0.006008697,0.033543542,0.3858946,0.5700769],"study_design_scores_gemma":[0.000021191514,0.000047340814,0.0005729818,0.000092789465,0.0000074641134,0.00039077786,0.00009097931,0.0007874148,0.0013656252,0.0042738956,0.99233705,0.0000125424285],"about_ca_topic_score_codex":0.0014767747,"about_ca_topic_score_gemma":0.001634247,"teacher_disagreement_score":0.31343818,"about_ca_system_score_codex":0.0010411415,"about_ca_system_score_gemma":0.0015803718,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2015243450","doi":"10.1145/1572471.1572480","title":"A pre-placement net length estimation technique for mixed-size circuits","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Net (polyhedron); A priori and a posteriori; Cluster analysis; Computer science; Length measurement; Electronic circuit; Estimation; Algorithm; Mathematics; Engineering; Artificial intelligence; Geometry","score_opus":0.010022441308021367,"score_gpt":0.24119067596860072,"score_spread":0.23116823466057934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015243450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014206615,0.00004242978,0.9848771,0.000021314698,0.000006865134,0.000017412467,0.000051324863,0.0005464371,0.00023054761],"genre_scores_gemma":[0.44869623,0.00022090007,0.5481175,0.000039708466,0.000025575855,0.00017154834,0.00041325158,0.00017021237,0.0021449893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996203,0.000084248895,0.000021248663,0.00009647969,0.00015031913,0.000027420012],"domain_scores_gemma":[0.99863225,0.0006194137,0.00029573738,0.00019951539,0.00022834708,0.000024784253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059509,0.00083955796,0.00049418566,0.0007516343,0.00027764766,0.0004271686,0.0007971206,0.00054621894,0.0013484367],"category_scores_gemma":[0.0025850418,0.0006158779,0.00051145896,0.00044339788,0.00024856403,0.0011283644,0.00035882948,0.00083806843,0.000547135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014672532,0.000054831642,0.003708823,0.000094225536,0.00006097354,0.00007285491,0.00008560322,0.7974048,0.03617503,0.0033119752,0.00058501586,0.1582991],"study_design_scores_gemma":[0.0000033515964,0.000089915404,0.0013296419,0.000006361783,0.000015119778,0.00007043784,0.0000069120615,0.985693,0.011380484,0.00076729123,0.0006206962,0.000016744596],"about_ca_topic_score_codex":0.0026083682,"about_ca_topic_score_gemma":0.00590103,"teacher_disagreement_score":0.0026083682,"about_ca_system_score_codex":0.0005578979,"about_ca_system_score_gemma":0.0008407299,"threshold_uncertainty_score":0.005186379},"labels":[],"label_agreement":null},{"id":"W2015590221","doi":"10.1145/611817.611841","title":"Design of FPGA interconnect for multilevel metalization","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Interconnection; Routing (electronic design automation); Computer science; Exploit; Topology (electrical circuits); Dimension (graph theory); Hierarchy; Embedded system; Scaling; Computer network; Electrical engineering; Engineering; Mathematics","score_opus":0.04161591048762313,"score_gpt":0.24606562240394603,"score_spread":0.20444971191632288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015590221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4415639,0.00093759084,0.49241924,0.00071247044,0.00014725392,0.00012644289,0.0002448774,0.002063006,0.061785206],"genre_scores_gemma":[0.8629824,0.0002928959,0.13200147,0.00010929694,0.000023154795,0.000058415357,0.00012631429,0.000055210057,0.004350896],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999918,0.000012800485,0.000004317863,0.000013972344,0.000026279446,0.000024697498],"domain_scores_gemma":[0.99991965,0.000012430505,0.000015612517,0.000017896546,0.000026385791,0.000008021077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007727164,0.00017258538,0.00013361748,0.00023496483,0.00022758628,0.0003960476,0.0003660924,0.00019600894,0.0017652175],"category_scores_gemma":[0.00024028198,0.00010560384,0.00013836804,0.00021832991,0.00014528859,0.00027528935,0.00023840075,0.0001906635,0.00039729621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026777803,0.00008182337,0.0048108404,0.00046352026,0.00009050564,0.0007842785,0.00026302368,0.25579208,0.36155006,0.06599543,0.011106556,0.29879406],"study_design_scores_gemma":[0.000091212816,0.000902101,0.0043132133,0.000100675126,0.00009089794,0.0007865406,0.00019369548,0.7658012,0.14952946,0.014942981,0.06320332,0.000044727898],"about_ca_topic_score_codex":0.00092668633,"about_ca_topic_score_gemma":0.0033769798,"teacher_disagreement_score":0.0017652175,"about_ca_system_score_codex":0.0004620113,"about_ca_system_score_gemma":0.00033305102,"threshold_uncertainty_score":0.0059052706},"labels":[],"label_agreement":null},{"id":"W2018790177","doi":"10.1109/iscas.2012.6271714","title":"Fast parasitic-aware synthesis methodology for high-performance analog circuits","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parasitic extraction; Computer science; CMOS; Analogue electronics; Electronic engineering; Electronic circuit; Sizing; Circuit extraction; Computer architecture; Equivalent circuit; Engineering; Electrical engineering","score_opus":0.059715030550403954,"score_gpt":0.2790983057995376,"score_spread":0.21938327524913365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018790177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004249485,0.00019337791,0.99380624,0.000021050202,0.000015613448,0.00003599821,0.000026337255,0.00050544826,0.0011465921],"genre_scores_gemma":[0.2369863,0.0004574662,0.76041496,0.00008036185,0.000045029803,0.00016107073,0.00019823908,0.00018118443,0.0014754091],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995522,0.00008797383,0.000025389725,0.00007166307,0.00022450383,0.000038303497],"domain_scores_gemma":[0.9994326,0.00027498644,0.00006583154,0.00010765245,0.00010804318,0.00001078282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004038577,0.0008009421,0.0003789441,0.0006227585,0.000348822,0.0005165706,0.0007526535,0.00037090937,0.0019925684],"category_scores_gemma":[0.0007059681,0.00038615728,0.00070157606,0.00041087868,0.00030400403,0.0006710552,0.00042192062,0.0006129187,0.00043572692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014412795,0.000074662574,0.00070942263,0.0008651414,0.00017124908,0.00029934692,0.00018020977,0.20983814,0.348999,0.03793344,0.0018999026,0.39888537],"study_design_scores_gemma":[0.00008171038,0.00054507493,0.0006929811,0.00009111601,0.00019343659,0.0007315379,0.00005532203,0.75219816,0.19599827,0.025411895,0.023952562,0.000047850106],"about_ca_topic_score_codex":0.00050423836,"about_ca_topic_score_gemma":0.0011730867,"teacher_disagreement_score":0.0019925684,"about_ca_system_score_codex":0.00039011674,"about_ca_system_score_gemma":0.00090214494,"threshold_uncertainty_score":0.0066657662},"labels":[],"label_agreement":null},{"id":"W2021403474","doi":"10.1109/vlsi.design.2010.20","title":"A Graph-Based I/O Pad Pre-placement Technique for Use with Analytic FPGA Placement Methods","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Gate array; Placement; Parallel computing; Reduction (mathematics); Simple (philosophy); Graph; Algorithm; Circuit design; Embedded system; Mathematics; Physical design; Theoretical computer science","score_opus":0.02033673776125592,"score_gpt":0.30052020923725076,"score_spread":0.2801834714759948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021403474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030391363,0.000037455684,0.9944027,0.000054660723,0.000019284138,0.000035715457,0.000014571071,0.0011144595,0.0012819748],"genre_scores_gemma":[0.07805619,0.00012808456,0.9195327,0.00006048498,0.000020646228,0.000065106375,0.000059245835,0.00019046852,0.0018870956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978775,0.000035128793,0.000010400296,0.000041598483,0.00010476994,0.000020386671],"domain_scores_gemma":[0.99963236,0.000111338595,0.00006238047,0.00008601013,0.000092852104,0.000015089108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021421471,0.0009042102,0.00040267655,0.0007950148,0.00058608316,0.00042581273,0.000804785,0.00035783814,0.004802525],"category_scores_gemma":[0.0009712337,0.00042274356,0.0004073424,0.00069780764,0.0004836134,0.0006062152,0.00044824425,0.0007150696,0.0009901781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011960572,0.00011470176,0.0005297295,0.00026491188,0.000042276577,0.0001789382,0.00016169525,0.31266546,0.089254655,0.03084792,0.005600499,0.5602196],"study_design_scores_gemma":[0.000057377078,0.00023673112,0.00042564655,0.000028070923,0.000034335142,0.0003622423,0.000064804546,0.9066672,0.05601568,0.015740898,0.020328958,0.000038027618],"about_ca_topic_score_codex":0.0023538475,"about_ca_topic_score_gemma":0.005051723,"teacher_disagreement_score":0.004802525,"about_ca_system_score_codex":0.00047618034,"about_ca_system_score_gemma":0.0012612339,"threshold_uncertainty_score":0.016066074},"labels":[],"label_agreement":null},{"id":"W2022113200","doi":"10.1016/j.compeleceng.2013.02.011","title":"A new a priori net length estimation technique for integrated circuits using radial basis functions","year":2013,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Compute Canada","keywords":"Radial basis function; A priori and a posteriori; Benchmark (surveying); Robustness (evolution); Electronic circuit; Computer science; Basis (linear algebra); Algorithm; Digital electronics; Basis function; Mathematics; Artificial intelligence; Artificial neural network; Engineering","score_opus":0.0105482127751254,"score_gpt":0.2050367680231496,"score_spread":0.1944885552480242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022113200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022113044,0.00012603388,0.99669456,0.000021335154,0.000013106067,0.000007382294,0.000023707997,0.00049709977,0.00040549415],"genre_scores_gemma":[0.06392774,0.00030754897,0.93252635,0.000055579905,0.000044802186,0.000048703332,0.00022430232,0.00017931355,0.002685569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948967,0.00007536373,0.000024232484,0.00008737845,0.000295853,0.000027549995],"domain_scores_gemma":[0.99911815,0.00025586225,0.00012353035,0.00013517716,0.00033762708,0.0000295832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051577104,0.0012321286,0.0007980566,0.0012993439,0.00043085802,0.00089591386,0.0012488491,0.0008814709,0.0025549363],"category_scores_gemma":[0.0018981971,0.00062967814,0.00063509226,0.0008030702,0.00027873908,0.0018612419,0.0007364629,0.0012624417,0.0018692877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022732075,0.000095306816,0.0009183219,0.00020300268,0.00009453311,0.000082361934,0.00006257895,0.13169014,0.11587288,0.01095695,0.0035394672,0.73625714],"study_design_scores_gemma":[0.000011321706,0.00007059296,0.0005492966,0.000018018782,0.000029981102,0.0001372083,0.000008605487,0.9608622,0.031882517,0.002565562,0.0038308506,0.000033831486],"about_ca_topic_score_codex":0.0024012728,"about_ca_topic_score_gemma":0.0049954704,"teacher_disagreement_score":0.0025549363,"about_ca_system_score_codex":0.00059501507,"about_ca_system_score_gemma":0.00091095007,"threshold_uncertainty_score":0.008547068},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Texas Instruments","keywords":"Stratix; Field-programmable gate array; Computer science; Titan (rocket family); Benchmark (surveying); Parallel computing; Computer architecture; Architecture; Embedded system","score_opus":0.038747666946998424,"score_gpt":0.23994230075965653,"score_spread":0.20119463381265812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023428606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62700397,0.00090589345,0.22971381,0.00053362333,0.00045974736,0.00069302495,0.0112109035,0.020264056,0.10921499],"genre_scores_gemma":[0.7850251,0.00037355884,0.17395407,0.00029125635,0.000050117793,0.00080474344,0.017889265,0.0022142539,0.01939764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946505,0.00010269888,0.000024504434,0.00007753752,0.00023919824,0.00009097818],"domain_scores_gemma":[0.999064,0.00029576872,0.000090483525,0.0001718027,0.00034158843,0.000036315196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066442706,0.00070384966,0.0002508924,0.0006935734,0.00035365278,0.00046876332,0.0010442223,0.0002737214,0.006366674],"category_scores_gemma":[0.0021151186,0.00023522326,0.0004004276,0.0009559683,0.00025850526,0.0004671098,0.00037543554,0.00053817075,0.00066169933],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006865608,0.00049104233,0.009758138,0.00076907926,0.00009724817,0.00056026643,0.00031408266,0.55351937,0.07494296,0.0492745,0.073117495,0.23646925],"study_design_scores_gemma":[0.000112282454,0.0005490964,0.004354284,0.000039971717,0.000032561176,0.0002757604,0.00006832328,0.8610368,0.069333985,0.0067776623,0.057379168,0.000040115076],"about_ca_topic_score_codex":0.0058714612,"about_ca_topic_score_gemma":0.011639575,"teacher_disagreement_score":0.006366674,"about_ca_system_score_codex":0.00091837207,"about_ca_system_score_gemma":0.0011852348,"threshold_uncertainty_score":0.021298647},"labels":[],"label_agreement":null},{"id":"W2023461533","doi":"10.1109/fpl.2014.6927481","title":"A scalable, serially-equivalent, high-quality parallel placement methodology suitable for modern multicore and GPU architectures","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scalability; Parallel computing; CUDA; Field-programmable gate array; Routing (electronic design automation); Critical path method; Placement; Simulated annealing; Design flow; Embedded system; Physical design; Algorithm; Circuit design","score_opus":0.06483010504486024,"score_gpt":0.3121401575995601,"score_spread":0.24731005255469984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023461533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008555165,0.000071330614,0.98797125,0.00008318725,0.000040102772,0.000065756845,0.000027626866,0.001023145,0.002162348],"genre_scores_gemma":[0.10919069,0.000102243845,0.8879002,0.00006030989,0.00001866043,0.00007602807,0.00008519134,0.00020094863,0.0023657118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.0000505479,0.000022060116,0.000060222646,0.00019621656,0.00002699644],"domain_scores_gemma":[0.99953055,0.000067372304,0.00007113348,0.0001864612,0.00012247331,0.000021962862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036505907,0.00037801018,0.00030478236,0.0004544513,0.00046143096,0.00065481174,0.0009036741,0.00046833925,0.0025520448],"category_scores_gemma":[0.0010254757,0.00031532234,0.00041121725,0.00052641984,0.00045300735,0.00073404034,0.00051085115,0.00077251246,0.00079100556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010586651,0.00014477123,0.0014844054,0.0003103129,0.00009120225,0.00032378134,0.00018023429,0.28742552,0.3004013,0.037802022,0.006166344,0.3655643],"study_design_scores_gemma":[0.000091926115,0.0004995661,0.0017414169,0.000039239316,0.000060940158,0.0010220844,0.00012364326,0.8015356,0.12610023,0.025712097,0.043030366,0.000042973243],"about_ca_topic_score_codex":0.0011683133,"about_ca_topic_score_gemma":0.0039414773,"teacher_disagreement_score":0.0025520448,"about_ca_system_score_codex":0.0005860888,"about_ca_system_score_gemma":0.0013310779,"threshold_uncertainty_score":0.008537412},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Computer science; Parallel computing; Field-programmable gate array; Reduction (mathematics); Embedded system; Mathematics","score_opus":0.06598406236287854,"score_gpt":0.28893522794220006,"score_spread":0.22295116557932151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023462222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029264478,0.00022785156,0.9622263,0.00012719154,0.000058752987,0.0000807413,0.00006307376,0.0024614786,0.0054901205],"genre_scores_gemma":[0.26249754,0.00023435031,0.7325377,0.000053773085,0.000026275628,0.00007052401,0.00017700066,0.0002336603,0.004169157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949646,0.00009165947,0.000027925304,0.00006294786,0.0002754197,0.000045586174],"domain_scores_gemma":[0.9995454,0.00010415852,0.00005652118,0.00017981487,0.00009804815,0.000016105201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004098465,0.00052094314,0.00029384787,0.00042773646,0.000503079,0.0006789814,0.0008414508,0.00030117287,0.0040144455],"category_scores_gemma":[0.0013930625,0.00036386383,0.00026539093,0.00068860117,0.0003549874,0.00064105703,0.0004910907,0.00042425503,0.0011546628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046018139,0.000087566,0.0021229468,0.0003679403,0.000058391925,0.00044398432,0.00014033461,0.33842486,0.05751706,0.042118285,0.010571154,0.54768735],"study_design_scores_gemma":[0.00019851151,0.0005194694,0.0021749318,0.000046504283,0.000037406106,0.0006930054,0.00016405783,0.86702263,0.064656936,0.03339192,0.031044034,0.0000505198],"about_ca_topic_score_codex":0.0029587778,"about_ca_topic_score_gemma":0.009452277,"teacher_disagreement_score":0.0040144455,"about_ca_system_score_codex":0.0006325919,"about_ca_system_score_gemma":0.001145844,"threshold_uncertainty_score":0.013429642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010242131005467073,"score_gpt":0.2300675408683493,"score_spread":0.21982540986288224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023788229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03546319,0.0006104719,0.9528929,0.0004893823,0.00009167918,0.00008811817,0.00013360604,0.003159525,0.0070712157],"genre_scores_gemma":[0.22706853,0.0007019377,0.76746076,0.00013088054,0.000052242714,0.00011136942,0.00027753398,0.00027423457,0.003922429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948466,0.00014274225,0.000029972782,0.00006822629,0.00020657506,0.00006774398],"domain_scores_gemma":[0.99952984,0.00015850768,0.000051968236,0.00014784902,0.000084783525,0.000027038835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006681892,0.00068395754,0.0006260817,0.00062464795,0.0003816392,0.00092984684,0.0009131892,0.00080917776,0.004815037],"category_scores_gemma":[0.0017180527,0.00053287094,0.00059543346,0.0009071126,0.00056248764,0.0011538919,0.0010313744,0.0009262224,0.0010802319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010601096,0.00003897471,0.0004757865,0.0002409061,0.00004141701,0.00014446172,0.000079810685,0.79423624,0.018111665,0.036899317,0.0058018407,0.14382352],"study_design_scores_gemma":[0.000044567896,0.00009631368,0.00024122238,0.000029884226,0.0000125399165,0.00008896819,0.000064256405,0.9510404,0.0069241333,0.028957577,0.012489492,0.000010664444],"about_ca_topic_score_codex":0.002435816,"about_ca_topic_score_gemma":0.0048789745,"teacher_disagreement_score":0.004815037,"about_ca_system_score_codex":0.0007952114,"about_ca_system_score_gemma":0.0010986421,"threshold_uncertainty_score":0.016107917},"labels":[],"label_agreement":null},{"id":"W2024174517","doi":"10.1145/2499625.2499627","title":"Towards development of an analytical model relating FPGA architecture parameters to routability","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Router; Computer science; Logic block; Block (permutation group theory); Routing (electronic design automation); Embedded system; FPGA prototype; Computer architecture; CAD; Design flow; Parallel computing; Computer hardware; Engineering; Engineering drawing; Computer network","score_opus":0.025796937541249773,"score_gpt":0.24346641330898858,"score_spread":0.21766947576773882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024174517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017151168,0.0005864999,0.9605949,0.0006430415,0.000051627918,0.000073795054,0.00026148104,0.0005923193,0.020045264],"genre_scores_gemma":[0.7669619,0.0035951643,0.20169729,0.00041984514,0.00013649497,0.0005841627,0.00049530156,0.0006609121,0.025448862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996092,0.00009564879,0.000015009593,0.00006158048,0.00015790768,0.000060778417],"domain_scores_gemma":[0.99888664,0.00062934007,0.00010816226,0.00009233098,0.00025982037,0.000023701117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065471,0.0008011975,0.00070787064,0.0010809859,0.0004404278,0.0012188456,0.0012082574,0.001210322,0.0028700503],"category_scores_gemma":[0.004335757,0.00075294264,0.0008368424,0.0009458439,0.0006222667,0.001678837,0.00053405185,0.0012468363,0.0011817596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008184377,0.000012613481,0.00023333775,0.00003516002,0.0000071137356,0.00005732936,0.000040779185,0.9713766,0.001979582,0.02011222,0.00051803945,0.0056191403],"study_design_scores_gemma":[0.0000014956431,0.000005689919,0.000040375573,0.000007878003,0.0000030042386,0.000013595557,0.0000052087703,0.993775,0.00037542707,0.0049740733,0.00079471816,0.0000035533399],"about_ca_topic_score_codex":0.008801952,"about_ca_topic_score_gemma":0.0049829483,"teacher_disagreement_score":0.008801952,"about_ca_system_score_codex":0.0017981456,"about_ca_system_score_gemma":0.0012531917,"threshold_uncertainty_score":0.017501414},"labels":[],"label_agreement":null},{"id":"W2025476395","doi":"10.1016/j.vlsi.2010.11.003","title":"A pre-placement individual net length estimation model and an application for modern circuits","year":2010,"lang":"en","type":"article","venue":"Integration","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Interconnection; Electronic circuit; A priori and a posteriori; Estimation; Computer science; Integrated circuit; IBM; Net (polyhedron); Cluster analysis; Computer engineering; Electronic engineering; Reliability engineering; Engineering; Mathematics; Systems engineering; Machine learning; Telecommunications; Electrical engineering","score_opus":0.01818199883747231,"score_gpt":0.2712351910471546,"score_spread":0.2530531922096823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025476395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043974984,0.00006856498,0.9947627,0.000044632805,0.000014659292,0.000011073924,0.000034274104,0.00030085357,0.0003657198],"genre_scores_gemma":[0.39376822,0.00058089005,0.5914029,0.0001457982,0.00017009892,0.00020730346,0.0005663085,0.00029978965,0.012858579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995389,0.00009444166,0.000022138282,0.0001583961,0.00014979117,0.00003634438],"domain_scores_gemma":[0.99854434,0.00060189376,0.00020599,0.00026279522,0.0003565667,0.000028535931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775474,0.00092375866,0.0008375627,0.00060760404,0.00048238988,0.00078235776,0.0013686592,0.0012598063,0.0025766997],"category_scores_gemma":[0.0031522093,0.00072104763,0.0007978236,0.00088709255,0.00052603515,0.0015799452,0.0005613292,0.0014658106,0.0013498623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008980623,0.000049406597,0.00071005424,0.000044004442,0.000031014602,0.00006718758,0.00004802449,0.88534755,0.0065399385,0.0069451635,0.0008223748,0.099305436],"study_design_scores_gemma":[0.0000025032589,0.000035158362,0.00021624372,0.000003809188,0.000013348671,0.000032877822,0.000002819583,0.9964051,0.0013524576,0.001521493,0.0004073371,0.000006855976],"about_ca_topic_score_codex":0.0035046556,"about_ca_topic_score_gemma":0.0073778387,"teacher_disagreement_score":0.0035046556,"about_ca_system_score_codex":0.0007491694,"about_ca_system_score_gemma":0.0009252795,"threshold_uncertainty_score":0.008619964},"labels":[],"label_agreement":null},{"id":"W2026061728","doi":"10.1007/s10470-011-9648-z","title":"A new approach to sizing analog CMOS building blocks using pre-compiled neural network models","year":2011,"lang":"en","type":"article","venue":"Analog Integrated Circuits and Signal Processing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Automation; Electronic design automation; CMOS; Sizing; Electronic engineering; Computer science; Process (computing); Design flow; Amplifier; Engineering; Circuit design; Integrated circuit design; Embedded system","score_opus":0.04723845503049792,"score_gpt":0.24033086170360995,"score_spread":0.19309240667311203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026061728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014648091,0.00015574344,0.9767393,0.00006205276,0.000050029405,0.00006255985,0.00009543204,0.003040984,0.005145824],"genre_scores_gemma":[0.24640222,0.0001981436,0.7454477,0.00009922845,0.000032328357,0.00013816016,0.00028466663,0.00047218046,0.0069253733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985254,0.00001990082,0.000011017928,0.000030404915,0.0000692213,0.000016906493],"domain_scores_gemma":[0.9996922,0.00011951882,0.000027070038,0.000063439475,0.000088968474,0.000008833729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015250228,0.0009615715,0.0004138862,0.0005630184,0.00029953694,0.000866461,0.0010444158,0.00029058498,0.0051390235],"category_scores_gemma":[0.00078649697,0.0005020471,0.00058896624,0.00039322584,0.00022689102,0.0011195025,0.00040999893,0.0008522954,0.0007605039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011367346,0.00011205829,0.00089222,0.00025514528,0.00015794931,0.00014957321,0.00009702831,0.5937771,0.04791051,0.018954108,0.0035855898,0.333995],"study_design_scores_gemma":[0.000012054846,0.00005087574,0.00014566326,0.000013120701,0.00004312196,0.00004494558,0.00001316605,0.9753999,0.015871817,0.0038664492,0.0045283535,0.000010607354],"about_ca_topic_score_codex":0.0051580323,"about_ca_topic_score_gemma":0.02419685,"teacher_disagreement_score":0.0051580323,"about_ca_system_score_codex":0.0006314691,"about_ca_system_score_gemma":0.00108128,"threshold_uncertainty_score":0.017191768},"labels":[],"label_agreement":null},{"id":"W2028739735","doi":"10.4028/www.scientific.net/amr.490-495.1511","title":"The Improvement of Pseudo-Boolean Satisfiability Algorithm for FPGA Routing","year":2012,"lang":"en","type":"article","venue":"Advanced materials research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"La Cité Collégiale","funders":"","keywords":"Routing (electronic design automation); Boolean satisfiability problem; Computer science; Algorithm; Field-programmable gate array; Satisfiability; Embedded system","score_opus":0.03568103232071959,"score_gpt":0.3483881086767109,"score_spread":0.31270707635599126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028739735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006825089,0.00012117758,0.98987204,0.00012522859,0.000044994664,0.000055773773,0.000041301242,0.00073093583,0.0021835202],"genre_scores_gemma":[0.1283688,0.00029511613,0.8679934,0.00013531982,0.000039125534,0.00013628545,0.0003236347,0.00016588824,0.0025423418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915457,0.00026006906,0.000077731514,0.00014050669,0.0003066494,0.000060322865],"domain_scores_gemma":[0.999243,0.0002709153,0.00005693166,0.00012850345,0.0002846659,0.00001597889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069436606,0.0007155086,0.000439883,0.00088857504,0.00046968492,0.0008359493,0.0012375265,0.00060224935,0.0044724843],"category_scores_gemma":[0.0019057774,0.00035254768,0.0010578195,0.0009481542,0.0004598934,0.0018247892,0.00054944435,0.00094834383,0.0007145498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020307706,0.00013663157,0.0013886424,0.000472437,0.00010665404,0.00028055575,0.00015389675,0.20568945,0.03867057,0.10167001,0.007074256,0.6441538],"study_design_scores_gemma":[0.00007623479,0.00017427468,0.00026967077,0.000031890268,0.00004623442,0.00032713078,0.000039241488,0.95005053,0.01831242,0.020044424,0.010599761,0.00002830051],"about_ca_topic_score_codex":0.0022250684,"about_ca_topic_score_gemma":0.002605126,"teacher_disagreement_score":0.0044724843,"about_ca_system_score_codex":0.00062648905,"about_ca_system_score_gemma":0.0012898189,"threshold_uncertainty_score":0.014961958},"labels":[],"label_agreement":null},{"id":"W2031312330","doi":"10.1145/332357.332399","title":"Multilevel cooperative search","year":2000,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; DEPT; Library science; Operations research; Computer science; Management; Engineering; Chemistry; Economics","score_opus":0.016400188672989518,"score_gpt":0.2343691095491157,"score_spread":0.21796892087612618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031312330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0185347,0.0004205857,0.97138625,0.00014999392,0.000044470962,0.00011605951,0.00008233784,0.0006739554,0.008591584],"genre_scores_gemma":[0.37693912,0.0004050982,0.6093157,0.00035349518,0.000062312,0.0004303589,0.00042450946,0.00020745832,0.011861933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992888,0.00015205338,0.000030248639,0.00014821156,0.0002897157,0.00009095997],"domain_scores_gemma":[0.9989563,0.00038341607,0.00006430173,0.00034323876,0.00018675777,0.00006602759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313575,0.00047514905,0.0008377064,0.0010152909,0.00068489293,0.00087124784,0.0022561196,0.0009825316,0.0066448357],"category_scores_gemma":[0.0022984804,0.00031532475,0.00070773775,0.0012096721,0.00050327036,0.0013551397,0.0026046555,0.0008631677,0.0015157459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002588814,0.00021846964,0.0016390452,0.0003363649,0.0002189547,0.00024676256,0.0005483751,0.29059258,0.028147062,0.069130324,0.011413758,0.5972495],"study_design_scores_gemma":[0.00006497575,0.00014884889,0.0004883561,0.000030620744,0.000055912373,0.00020509181,0.0001083438,0.95260674,0.005830397,0.025380407,0.015057563,0.000022838845],"about_ca_topic_score_codex":0.0028532273,"about_ca_topic_score_gemma":0.0055046207,"teacher_disagreement_score":0.0066448357,"about_ca_system_score_codex":0.00057945924,"about_ca_system_score_gemma":0.00084138627,"threshold_uncertainty_score":0.022229195},"labels":[],"label_agreement":null},{"id":"W2035057034","doi":"10.1109/fpl.2014.6927418","title":"Incremental distributed trigger insertion for efficient FPGA debug","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Debugging; Computer science; Observability; Field-programmable gate array; Embedded system; Electronic circuit; Background debug mode interface; Spare part; Computer hardware; Computer architecture; Real-time computing; Engineering; Operating system; Electrical engineering","score_opus":0.009221593388612056,"score_gpt":0.210202706435551,"score_spread":0.20098111304693894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035057034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10280309,0.00036032527,0.88307506,0.00013924047,0.00005601551,0.00010210627,0.00007985536,0.008189981,0.0051942905],"genre_scores_gemma":[0.6563878,0.00012879616,0.33883306,0.000103629995,0.000023718188,0.000086289576,0.00014514333,0.0004043808,0.0038872813],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996903,0.00006585367,0.00001663167,0.000057053698,0.00011116321,0.000059],"domain_scores_gemma":[0.99916613,0.00030230897,0.00010293052,0.00031038455,0.00008557362,0.000032768654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800753,0.0006704658,0.00033561798,0.000521474,0.00028752655,0.00056154723,0.0012104419,0.00033613353,0.005056036],"category_scores_gemma":[0.0014106418,0.00034581058,0.00023312008,0.00048469615,0.00036254982,0.0011568879,0.0009029016,0.0005860541,0.00068565825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009125073,0.00023124181,0.0028427024,0.0003344895,0.000043940672,0.00063135993,0.00044262022,0.089639984,0.36539373,0.02212962,0.005972268,0.51142555],"study_design_scores_gemma":[0.00022989113,0.0011872458,0.0020205383,0.000058047473,0.00009297711,0.0009076581,0.0001705004,0.5278443,0.4322092,0.010282079,0.02493249,0.00006510116],"about_ca_topic_score_codex":0.000649858,"about_ca_topic_score_gemma":0.0021791116,"teacher_disagreement_score":0.005056036,"about_ca_system_score_codex":0.00051023526,"about_ca_system_score_gemma":0.00070303486,"threshold_uncertainty_score":0.01691407},"labels":[],"label_agreement":null},{"id":"W2036044594","doi":"10.1145/611817.611875","title":"Synthetic circuit generation using clustering and iteration","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Electronic circuit; Cluster analysis; Computer engineering; Netlist; Routing (electronic design automation); Path (computing); Algorithm; Embedded system; Engineering; Artificial intelligence","score_opus":0.038698831075028556,"score_gpt":0.21956467715342598,"score_spread":0.18086584607839742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036044594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27902934,0.00014028765,0.71071154,0.00016265026,0.000064610125,0.0003423555,0.000473098,0.0019490706,0.0071270764],"genre_scores_gemma":[0.6480071,0.000085655774,0.34786588,0.000058683523,0.000014610341,0.000451993,0.0010290792,0.0002331006,0.0022539385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993631,0.00018019714,0.000031324886,0.00011542431,0.00024848143,0.0000613686],"domain_scores_gemma":[0.996637,0.0018285855,0.00023505514,0.000597648,0.0006381332,0.00006367426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008980994,0.0005525458,0.0003721029,0.0008973958,0.00032897544,0.00046470293,0.0008965766,0.0006055295,0.001619288],"category_scores_gemma":[0.0045110304,0.00025840374,0.00046869944,0.00064635446,0.00053141796,0.00042432867,0.0005157057,0.00045626936,0.00025608527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016936605,0.00008685321,0.0026341917,0.0001641793,0.000037654256,0.00019076817,0.00019970933,0.87879205,0.02724895,0.019107133,0.0018184158,0.06955082],"study_design_scores_gemma":[0.000024719138,0.00010274997,0.00039363003,0.0000071110703,0.000008378729,0.00008251383,0.00002567456,0.9723508,0.020854821,0.004162932,0.0019748341,0.0000118105845],"about_ca_topic_score_codex":0.0015103417,"about_ca_topic_score_gemma":0.0015322202,"teacher_disagreement_score":0.001619288,"about_ca_system_score_codex":0.00073625275,"about_ca_system_score_gemma":0.00055184343,"threshold_uncertainty_score":0.005417049},"labels":[],"label_agreement":null},{"id":"W2037455559","doi":"10.1109/tcad.2011.2165715","title":"Accelerating FPGA Routing Through Parallelization and Engineering Enhancements Special Section on PAR-CAD 2010","year":2011,"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":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Computer science; Parallel computing; Field-programmable gate array; Router; Routing (electronic design automation); Overhead (engineering); Heuristic; Gate array; Heuristics; Embedded system; Computer network","score_opus":0.05512664828856144,"score_gpt":0.2195949649687447,"score_spread":0.16446831668018325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037455559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051486462,0.0030508158,0.85692835,0.0014711777,0.0005772084,0.00020749918,0.00019225031,0.011622546,0.074463606],"genre_scores_gemma":[0.27931634,0.002464759,0.67404467,0.0003734848,0.00030352073,0.000106455904,0.0007988736,0.001007359,0.04158454],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971074,0.00006420372,0.000013540763,0.000051500945,0.00012443641,0.000035502708],"domain_scores_gemma":[0.9996389,0.000100457284,0.000026268679,0.00010545991,0.00011178586,0.000017138229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003513098,0.0005997845,0.00030141763,0.0005392272,0.00023916273,0.0007878311,0.00052900653,0.00023648234,0.019564688],"category_scores_gemma":[0.00084488554,0.0002837976,0.0003085695,0.0006698288,0.00021619356,0.0005507643,0.00028568538,0.00046468186,0.0035143546],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024075514,0.00014156844,0.0008154559,0.00018085857,0.000032372176,0.00014448333,0.000042603424,0.119908966,0.05213507,0.01710503,0.034656465,0.7745964],"study_design_scores_gemma":[0.00015069677,0.0003435493,0.0014409561,0.000039263905,0.000053573865,0.0005572759,0.000040537987,0.75497115,0.06423678,0.010738103,0.16739114,0.000037028363],"about_ca_topic_score_codex":0.002189294,"about_ca_topic_score_gemma":0.005105151,"teacher_disagreement_score":0.019564688,"about_ca_system_score_codex":0.0006464568,"about_ca_system_score_gemma":0.0006950327,"threshold_uncertainty_score":0.06545043},"labels":[],"label_agreement":null},{"id":"W2037754626","doi":"10.1260/174830108788251773","title":"A Degree-Based Clustering Technique for VLSI Placement","year":2009,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Preprocessor; Degree (music); Computer science; Benchmark (surveying); Very-large-scale integration; IBM; Data pre-processing; Data mining; Algorithm; Artificial intelligence","score_opus":0.020368278343021715,"score_gpt":0.2692007815564009,"score_spread":0.2488325032133792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037754626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025958333,0.0002765239,0.9954721,0.00008631177,0.00005084848,0.000044493598,0.00004054203,0.00027179817,0.0011615065],"genre_scores_gemma":[0.09089295,0.0007675288,0.9039704,0.00010944113,0.000096512034,0.00012601042,0.00026550112,0.0001726929,0.0035989203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988777,0.00021383651,0.000062209736,0.00024122161,0.00053743675,0.00006766702],"domain_scores_gemma":[0.99897987,0.00029774004,0.000108263375,0.0002312453,0.00034386627,0.00003893005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554819,0.00089348527,0.0008281545,0.0019598186,0.0011161211,0.00083176716,0.0014343534,0.00094132894,0.0026613495],"category_scores_gemma":[0.0028132629,0.00054036477,0.0012435106,0.0028896458,0.00069109484,0.0011889514,0.0010654462,0.0012894874,0.0014819934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014432525,0.00007020897,0.00088669243,0.00047551564,0.00018729105,0.00012950366,0.00033599697,0.25002936,0.055755876,0.0705457,0.0076557784,0.61378384],"study_design_scores_gemma":[0.000055139473,0.00031623212,0.0017997557,0.00008115737,0.000118116615,0.00085478567,0.00017809564,0.8509164,0.03498391,0.05275753,0.057802007,0.00013686408],"about_ca_topic_score_codex":0.002888434,"about_ca_topic_score_gemma":0.0043754037,"teacher_disagreement_score":0.002888434,"about_ca_system_score_codex":0.0011791606,"about_ca_system_score_gemma":0.0011175589,"threshold_uncertainty_score":0.008903086},"labels":[],"label_agreement":null},{"id":"W2039194939","doi":"10.1145/2501985","title":"Analyzing System-Level Information’s Correlation to FPGA Placement","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Netlist; Computer science; Locality; Field-programmable gate array; Placement; Simulated annealing; Computer engineering; Verilog; Algorithm; Theoretical computer science; Embedded system; Physical design; Circuit design","score_opus":0.01392183303958959,"score_gpt":0.20595381848356248,"score_spread":0.19203198544397287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039194939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74393606,0.0009987808,0.24916697,0.00037013655,0.000054534386,0.00004886487,0.00022102104,0.00083677156,0.004366893],"genre_scores_gemma":[0.983114,0.00013124864,0.016024873,0.000025437354,0.000024667615,0.000011858361,0.0001375036,0.000060427796,0.00046996522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986853,0.0002948887,0.000062427134,0.00017575156,0.00061181193,0.00016981224],"domain_scores_gemma":[0.9742242,0.017341495,0.0031652653,0.002609884,0.0023983193,0.00026082085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525244,0.0004543486,0.00052513543,0.001827587,0.00041425053,0.0007943094,0.0005342817,0.00051579,0.001552677],"category_scores_gemma":[0.020512214,0.00048207803,0.0003440252,0.0025768382,0.000856713,0.001143631,0.0005675255,0.0007057455,0.00023970102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063025916,0.00008974185,0.051248975,0.00021835914,0.00011257352,0.00057807163,0.00024380969,0.80548495,0.028685441,0.0077029997,0.00066204154,0.104342684],"study_design_scores_gemma":[0.000015885831,0.0002567526,0.02880092,0.000015172093,0.000080212005,0.00028784614,0.000059984362,0.9402945,0.024568757,0.004429098,0.0011578768,0.000032869568],"about_ca_topic_score_codex":0.0017866701,"about_ca_topic_score_gemma":0.0035511574,"teacher_disagreement_score":0.001827587,"about_ca_system_score_codex":0.0012490026,"about_ca_system_score_gemma":0.00078608235,"threshold_uncertainty_score":0.009062171},"labels":[],"label_agreement":null},{"id":"W2039730318","doi":"10.1145/2003695.2003710","title":"Analog layout retargeting using geometric programming","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Computer science; Geometric programming; Initialization; Retargeting; Transformation (genetics); Mathematical optimization; Convex optimization; Netlist; Nonlinear programming; Computer engineering; Algorithm; Nonlinear system; Regular polygon; Artificial intelligence; Computer hardware; Mathematics","score_opus":0.0525912628983535,"score_gpt":0.2403003780804701,"score_spread":0.1877091151821166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039730318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031314185,0.000031407497,0.9941631,0.000024297668,0.000012728512,0.00001816212,0.000011774622,0.000689169,0.0019179932],"genre_scores_gemma":[0.16683127,0.00012240533,0.8275665,0.00009857038,0.000032351545,0.000092229995,0.000097297125,0.00046563038,0.004693753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999566,0.00008560329,0.000019866164,0.00010889316,0.00017359808,0.00004590836],"domain_scores_gemma":[0.9996426,0.00014184011,0.000047993064,0.00009534416,0.0000623525,0.000009895743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032729117,0.0009981142,0.00059207587,0.0007058198,0.0003428596,0.0006568184,0.0009942274,0.00040704914,0.0051876255],"category_scores_gemma":[0.0010338707,0.0003456466,0.0007363064,0.0005694724,0.0005341812,0.0008119096,0.0009977791,0.0008326255,0.0008443218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006255115,0.000047248835,0.00027497925,0.0001695003,0.00004171652,0.00020460143,0.00017389328,0.4315094,0.06276667,0.036498073,0.0030943225,0.465157],"study_design_scores_gemma":[0.000034463555,0.0001461763,0.00020928447,0.000014805299,0.000032974418,0.00030955058,0.000043422417,0.93079495,0.028218023,0.022071334,0.018097205,0.000027832517],"about_ca_topic_score_codex":0.001110073,"about_ca_topic_score_gemma":0.0015299969,"teacher_disagreement_score":0.0051876255,"about_ca_system_score_codex":0.0004949794,"about_ca_system_score_gemma":0.00049544126,"threshold_uncertainty_score":0.01735437},"labels":[],"label_agreement":null},{"id":"W2044141314","doi":"10.1007/s12065-014-0114-6","title":"Advancing genetic algorithm approaches to field programmable gate array placement with enhanced recombination operators","year":2014,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic algorithm; Field (mathematics); Gate array; Parallel computing; Algorithm; Field-programmable gate array; Computer hardware; Machine learning; Mathematics","score_opus":0.01663700403645227,"score_gpt":0.21228066336375362,"score_spread":0.19564365932730135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044141314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01019192,0.00047429226,0.983949,0.00009249428,0.000044415567,0.000018598323,0.000006422212,0.000086303735,0.0051365304],"genre_scores_gemma":[0.30583563,0.0011169998,0.6859428,0.00012636755,0.0000859271,0.00008284565,0.000039300096,0.00007832733,0.0066917804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979144,0.00006501833,0.0000071684153,0.000021609943,0.00009641352,0.000018380024],"domain_scores_gemma":[0.9996896,0.00017697718,0.000021516747,0.00003254064,0.00006852932,0.000010857317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492791,0.0005188583,0.00045528944,0.0006771655,0.00031127187,0.0006097212,0.0011258197,0.00079346437,0.0016023207],"category_scores_gemma":[0.0014187767,0.00027474813,0.00036648996,0.0008771385,0.0006316265,0.0006715021,0.0006025513,0.0009825807,0.00036476858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039396542,0.000055332985,0.00025679168,0.00005691006,0.000035392175,0.00007566499,0.000105033,0.77521425,0.0071504503,0.08889585,0.0010238884,0.12709111],"study_design_scores_gemma":[0.000013957288,0.000037060512,0.00007032279,0.00001027664,0.000009179586,0.0000365625,0.000011174001,0.97798675,0.0011817664,0.018593203,0.0020443283,0.0000054866323],"about_ca_topic_score_codex":0.00211336,"about_ca_topic_score_gemma":0.002332893,"teacher_disagreement_score":0.00211336,"about_ca_system_score_codex":0.00046240847,"about_ca_system_score_gemma":0.0004923698,"threshold_uncertainty_score":0.0053603053},"labels":[],"label_agreement":null},{"id":"W204600454","doi":"","title":"Steiner tree and interconnect optimization in VLSI design.","year":2002,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Very-large-scale integration; Interconnection; Computer science; Physical design; Mathematical optimization; Circuit design; Mathematics; Embedded system; Telecommunications","score_opus":0.023587805510588714,"score_gpt":0.17952450188296676,"score_spread":0.15593669637237806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204600454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008021559,0.13751651,0.8050383,0.0032422391,0.0017120247,0.00012779134,0.00046753717,0.0005537177,0.04332032],"genre_scores_gemma":[0.19158424,0.18829659,0.5831338,0.0015292828,0.003802475,0.00049648585,0.001705829,0.00037845614,0.02907282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896085,0.000321052,0.000063107815,0.00017509813,0.00041394436,0.00006595357],"domain_scores_gemma":[0.99945885,0.00032595132,0.00006831307,0.00004336131,0.00007824906,0.000025312795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009844515,0.0015194939,0.0010515949,0.0015085111,0.00057474506,0.0011517358,0.0010705094,0.0015533499,0.00510196],"category_scores_gemma":[0.0017312659,0.00060165726,0.0011365267,0.004564094,0.001347907,0.0024927016,0.0010332844,0.0019939248,0.0020239826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008654288,0.00005962442,0.00074612134,0.0017586412,0.00015647491,0.00023425215,0.00017480925,0.2504259,0.0023967146,0.43651548,0.036584277,0.2708611],"study_design_scores_gemma":[0.000040528197,0.00016338393,0.00049344264,0.00031002783,0.00006790167,0.00048449336,0.000107632484,0.2526258,0.0016922611,0.5938224,0.15014324,0.000048859813],"about_ca_topic_score_codex":0.0017447128,"about_ca_topic_score_gemma":0.001980071,"teacher_disagreement_score":0.00510196,"about_ca_system_score_codex":0.0012834625,"about_ca_system_score_gemma":0.00097510795,"threshold_uncertainty_score":0.01706773},"labels":[],"label_agreement":null},{"id":"W2046981406","doi":"10.1145/2744769.2744919","title":"Towards enhancing analog circuits sizing using SMT-based techniques","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Sizing; Biasing; Analogue electronics; Computer science; Electronic engineering; Amplifier; Cascode; Electronic circuit; Satisfiability modulo theories; Algorithm; CMOS; Voltage; Electrical engineering; Engineering","score_opus":0.04927790973757979,"score_gpt":0.26643219454661055,"score_spread":0.21715428480903076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046981406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015306672,0.00019710588,0.98041266,0.00013253397,0.000012260106,0.000051366824,0.000037436403,0.00035559715,0.00349433],"genre_scores_gemma":[0.22255749,0.00030550963,0.7753611,0.00013352762,0.000024947682,0.00009484189,0.00014584164,0.00015223541,0.0012245064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908733,0.0003142279,0.00004978645,0.00009269922,0.00040360593,0.00005237811],"domain_scores_gemma":[0.9980703,0.0012268871,0.00018886778,0.0002813883,0.0002102448,0.000022347544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000964312,0.00092810934,0.00044900205,0.0010100761,0.00033865916,0.0007927068,0.0008957881,0.00036186143,0.0031850545],"category_scores_gemma":[0.0033089798,0.00038192252,0.00089325797,0.0007310417,0.00061676995,0.001322108,0.00074993406,0.00084239343,0.00050559366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012362948,0.00010513462,0.0014087518,0.000487245,0.00009120736,0.00019744331,0.00017659304,0.44295493,0.0850623,0.050363872,0.0016449608,0.41738388],"study_design_scores_gemma":[0.00003903959,0.00019784822,0.0002373332,0.000052221716,0.000037248286,0.00019394267,0.0000648948,0.92759067,0.036354363,0.0281893,0.0070307064,0.000012485254],"about_ca_topic_score_codex":0.00085271697,"about_ca_topic_score_gemma":0.002543008,"teacher_disagreement_score":0.0031850545,"about_ca_system_score_codex":0.0005865996,"about_ca_system_score_gemma":0.0009809429,"threshold_uncertainty_score":0.010655105},"labels":[],"label_agreement":null},{"id":"W2047041799","doi":"10.1007/s10898-005-4207-8","title":"Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Combinatorics; Conjecture; Euclidean space; Euclidean geometry; Tree (set theory); Discrete mathematics; Space (punctuation); Topology (electrical circuits); Mathematical analysis; Geometry; Computer science","score_opus":0.00582047564380004,"score_gpt":0.2107929045233077,"score_spread":0.20497242887950767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047041799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11844572,0.008143954,0.841276,0.0029103705,0.00041825545,0.00013250686,0.0011899023,0.0011324696,0.026350869],"genre_scores_gemma":[0.5430486,0.0046368497,0.43898177,0.0006096989,0.0006240265,0.0003375071,0.00213962,0.00079584855,0.0088260295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970386,0.0009336972,0.00014426197,0.000388896,0.0010979982,0.0003964939],"domain_scores_gemma":[0.97761744,0.017421206,0.0010706477,0.0019971894,0.0013229842,0.0005704752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003594622,0.0018526996,0.0017825468,0.0028343997,0.00091827754,0.003750167,0.0032438198,0.0022649977,0.008558893],"category_scores_gemma":[0.034219667,0.0011877228,0.00145923,0.0029168606,0.0018571925,0.0059671216,0.0029623653,0.004462625,0.0016923775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014784468,0.00023526045,0.0033086406,0.00076272123,0.00017924943,0.00017753558,0.000443877,0.7008406,0.008057522,0.14617491,0.012828002,0.12551318],"study_design_scores_gemma":[0.00004837216,0.00011328504,0.00071112474,0.00013154384,0.000058912297,0.00012462721,0.00011202526,0.8862791,0.0021362684,0.10691555,0.0033404718,0.000028652668],"about_ca_topic_score_codex":0.0016119665,"about_ca_topic_score_gemma":0.004552281,"teacher_disagreement_score":0.008558893,"about_ca_system_score_codex":0.003546301,"about_ca_system_score_gemma":0.0016499566,"threshold_uncertainty_score":0.028632343},"labels":[],"label_agreement":null},{"id":"W2047143252","doi":"10.1145/1950413.1950441","title":"A CAD framework for Malibu","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; Verilog; Electronic circuit; Bitstream; CAD; Compiler; Multiplexing; Design flow; Computer architecture; Embedded system; Algorithm; Telecommunications; Electrical engineering; Engineering","score_opus":0.041434946229637046,"score_gpt":0.2342729925571768,"score_spread":0.19283804632753976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047143252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011704608,0.00080000947,0.90896785,0.00036469,0.00019151307,0.00019387667,0.0017705755,0.03845084,0.04809015],"genre_scores_gemma":[0.04383085,0.0015483339,0.8788158,0.00049697666,0.00011887382,0.0011583205,0.006817118,0.011359729,0.055854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921215,0.000109971406,0.0000471521,0.00010302541,0.00045195295,0.00007576201],"domain_scores_gemma":[0.99953353,0.0001399335,0.000030181465,0.000109473025,0.00015218319,0.00003476311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010872011,0.0013487656,0.0006923691,0.0018731154,0.000839912,0.002864928,0.002958035,0.0014374391,0.08721079],"category_scores_gemma":[0.0021469146,0.0008616393,0.0013283766,0.0008896718,0.00068087224,0.0017304338,0.0026521855,0.0018267974,0.026601195],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001819969,0.00012208904,0.0010476559,0.0007826918,0.00008236429,0.0006365655,0.00049138296,0.063956484,0.012709107,0.30317926,0.13710052,0.47970983],"study_design_scores_gemma":[0.00006665815,0.000044768767,0.00027302824,0.00022186607,0.000024842924,0.0005238326,0.000078663405,0.15076134,0.0055059493,0.05774837,0.7846981,0.000052601103],"about_ca_topic_score_codex":0.0023964138,"about_ca_topic_score_gemma":0.004219479,"teacher_disagreement_score":0.08721079,"about_ca_system_score_codex":0.0008489516,"about_ca_system_score_gemma":0.0012041406,"threshold_uncertainty_score":0.29174918},"labels":[],"label_agreement":null},{"id":"W2048878923","doi":"10.1145/2007052.2007068","title":"Integrated design space exploration based on power-performance trade-off using genetic algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Space (punctuation); Power (physics); Genetic algorithm; Algorithm design; Algorithm; Machine learning; Operating system","score_opus":0.05210946300318792,"score_gpt":0.2170636490770098,"score_spread":0.1649541860738219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048878923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037425403,0.0003086598,0.95826143,0.000099542245,0.000019676509,0.00006460798,0.00001795211,0.00042464735,0.003378158],"genre_scores_gemma":[0.3936652,0.00028106876,0.6042364,0.000081261285,0.000019834084,0.00019194387,0.000059485883,0.00008370242,0.001381007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950135,0.0001801583,0.000017128417,0.000060855724,0.0001885315,0.00005193118],"domain_scores_gemma":[0.9995772,0.00027013093,0.000042127955,0.000036552145,0.000060401875,0.000013513479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007807446,0.0007301679,0.00061777886,0.00096743985,0.00027669818,0.0006009283,0.00074496266,0.0006519806,0.0012257185],"category_scores_gemma":[0.0013858111,0.00036977028,0.00067413814,0.00055689615,0.0005499431,0.0005098889,0.00057887245,0.0005778466,0.00015091049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069348265,0.00008237147,0.0008701137,0.00008676241,0.000077029705,0.000082656574,0.00009300865,0.8444672,0.016256524,0.010496041,0.00044217845,0.1269767],"study_design_scores_gemma":[0.000022310802,0.00009173462,0.00015815471,0.000010329982,0.000022203483,0.000039335282,0.000014024491,0.99203837,0.0030551027,0.0034354422,0.0011068368,0.0000062441736],"about_ca_topic_score_codex":0.0012224516,"about_ca_topic_score_gemma":0.0016460167,"teacher_disagreement_score":0.0012257185,"about_ca_system_score_codex":0.0005804169,"about_ca_system_score_gemma":0.0009423062,"threshold_uncertainty_score":0.004211247},"labels":[],"label_agreement":null},{"id":"W2050578892","doi":"10.1109/asicon.2009.5351226","title":"Transistor permutation for better transistor chaining","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chaining; Transistor; Multiple-emitter transistor; Computer science; Key (lock); Electronic circuit; Electronic engineering; Transistor count; Logic gate; Permutation (music); Topology (electrical circuits); Algorithm; Electrical engineering; Engineering; Field-effect transistor; Physics","score_opus":0.009337012551341672,"score_gpt":0.20721241037458638,"score_spread":0.1978753978232447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050578892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0719314,0.00035291948,0.91817826,0.0003419567,0.00011199014,0.0001130679,0.0001205712,0.0029281457,0.005921649],"genre_scores_gemma":[0.3768061,0.00035471653,0.6171962,0.00027954322,0.00007562419,0.000087158536,0.00042783044,0.0005515786,0.00422119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996573,0.000097406875,0.000033481763,0.00009770795,0.00007527579,0.000038759154],"domain_scores_gemma":[0.9987275,0.00035765834,0.00012391854,0.00063225435,0.00011955549,0.000039093047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757743,0.0006057927,0.00052740675,0.00059973245,0.00040287984,0.0006169245,0.00070067134,0.0005412622,0.0064863577],"category_scores_gemma":[0.0019287987,0.000253308,0.0005306329,0.00082741224,0.000442178,0.0011740319,0.0006701969,0.0007716344,0.0016588137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031349773,0.00016811775,0.0022801694,0.00029511214,0.000083186234,0.00041613157,0.00020567833,0.105799824,0.19047074,0.035679433,0.005078659,0.65920943],"study_design_scores_gemma":[0.00018358022,0.0007171531,0.0012647763,0.00005084482,0.00015339346,0.0017146396,0.0001187084,0.63774616,0.219022,0.081873536,0.057081793,0.00007342673],"about_ca_topic_score_codex":0.00037014904,"about_ca_topic_score_gemma":0.0010711219,"teacher_disagreement_score":0.0064863577,"about_ca_system_score_codex":0.0002710321,"about_ca_system_score_gemma":0.00059411547,"threshold_uncertainty_score":0.021699011},"labels":[],"label_agreement":null},{"id":"W2059553661","doi":"10.1109/fpl.2009.5272520","title":"Replace: An incremental placement algorithm for field programmable gate arrays","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Floorplan; Field-programmable gate array; Simulated annealing; Placement; Parallel computing; Process (computing); Grid; Key (lock); Algorithm; Embedded system; Circuit design; Physical design; Mathematics","score_opus":0.012258809701748367,"score_gpt":0.25283369731650535,"score_spread":0.24057488761475698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059553661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016972385,0.00024510513,0.9733557,0.000103036706,0.0000754185,0.00010411535,0.00015735273,0.0051870127,0.0037998285],"genre_scores_gemma":[0.13244277,0.00016894785,0.86121845,0.00009527709,0.000036597237,0.00015697964,0.0005568249,0.00046468814,0.004859447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997811,0.00002999597,0.000010460873,0.00003073942,0.00011946302,0.000028266053],"domain_scores_gemma":[0.99977046,0.000075172684,0.000021958916,0.000051472944,0.00006825036,0.00001273724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018320614,0.0006733477,0.00040203563,0.00071785186,0.00042708882,0.00042720605,0.0012396477,0.00046244796,0.0058131325],"category_scores_gemma":[0.0007457504,0.0003666327,0.00045490984,0.0005371215,0.00029107297,0.00074355374,0.0006742191,0.00048652617,0.0014992929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027723648,0.000050761875,0.0007357489,0.00016779969,0.000039837185,0.00018109831,0.0000829187,0.1254581,0.02301455,0.0101487795,0.0138241025,0.8260191],"study_design_scores_gemma":[0.00014621267,0.00036692715,0.00053660927,0.000018717039,0.00004460927,0.0004333882,0.00005199619,0.9342667,0.021782782,0.013137786,0.02917959,0.000034678313],"about_ca_topic_score_codex":0.0028738312,"about_ca_topic_score_gemma":0.006979473,"teacher_disagreement_score":0.0058131325,"about_ca_system_score_codex":0.00042778067,"about_ca_system_score_gemma":0.0008536116,"threshold_uncertainty_score":0.01944685},"labels":[],"label_agreement":null},{"id":"W2059674565","doi":"10.1109/fpt.2007.4439225","title":"Memory Footprint Reduction for FPGA Routing Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Memory footprint; Reduction (mathematics); Parallel computing; Footprint; Compiler; Memory management; Algorithm; Embedded system; Computer hardware; Operating system; Semiconductor memory","score_opus":0.017711144902460382,"score_gpt":0.2491728526171012,"score_spread":0.2314617077146408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059674565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34105706,0.0033632491,0.6276912,0.00060536753,0.00019675215,0.00011056274,0.00030128367,0.0060528526,0.020621672],"genre_scores_gemma":[0.67504215,0.000887147,0.31626338,0.00017520216,0.000046052133,0.000105554005,0.00045652635,0.0004288335,0.006595182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995419,0.0001041371,0.000035187208,0.000057801168,0.00018941304,0.00007157695],"domain_scores_gemma":[0.99909604,0.00038219822,0.00009587561,0.00026888313,0.00013996725,0.000017087397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032602024,0.00053889473,0.00035979305,0.0006397689,0.00034747348,0.00068158767,0.001115409,0.00030237462,0.0043401765],"category_scores_gemma":[0.0016637238,0.00018230594,0.00039824043,0.0007848219,0.0002812484,0.0012463743,0.00046960945,0.00046658266,0.00057140825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064614654,0.00013009252,0.0025642868,0.00041397134,0.00011123839,0.00026248005,0.0001861177,0.21614504,0.110808305,0.024366887,0.0059181266,0.6384474],"study_design_scores_gemma":[0.00011502865,0.00074593356,0.002190666,0.000080036414,0.00013362034,0.0006786616,0.00018559946,0.7616044,0.18606976,0.016849026,0.0313033,0.0000439934],"about_ca_topic_score_codex":0.0015161559,"about_ca_topic_score_gemma":0.0030580056,"teacher_disagreement_score":0.0043401765,"about_ca_system_score_codex":0.00067886204,"about_ca_system_score_gemma":0.0005498097,"threshold_uncertainty_score":0.014519334},"labels":[],"label_agreement":null},{"id":"W2062282643","doi":"10.1145/968280.968327","title":"Transistor grouping and metal layer trade-offs in automatic tile layout of FPGAs","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Tile; Computer science; Layer (electronics); Virtex; Process (computing); Place and route; Very-large-scale integration; Computer architecture; Reconfigurable computing; Key (lock); Embedded system; Integrated circuit layout; Computer hardware; Integrated circuit; Operating system; Materials science","score_opus":0.012080458068272987,"score_gpt":0.20786616935939403,"score_spread":0.19578571129112105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062282643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816745,0.00081498805,0.406139,0.00020323934,0.000054679014,0.00006429375,0.000064530934,0.0038305593,0.0071542063],"genre_scores_gemma":[0.84968835,0.00015078222,0.14797883,0.000057577607,0.00002322885,0.000034007902,0.00007945445,0.00037748416,0.0016101813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936956,0.00019467402,0.00006485691,0.000101002006,0.00016774349,0.00010218382],"domain_scores_gemma":[0.9978411,0.0010055496,0.00035612297,0.0005445708,0.00017778228,0.00007480514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000684261,0.00047678052,0.0004492816,0.000673146,0.00036178608,0.0008211722,0.0008786517,0.0003263197,0.0016822162],"category_scores_gemma":[0.002945223,0.0004312001,0.0002735156,0.0007361794,0.0004313954,0.0013127876,0.0007661566,0.00031443677,0.0005786871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012457842,0.00013353827,0.007738565,0.00023554513,0.00006955401,0.0005521158,0.0005056189,0.3331308,0.33004758,0.009245641,0.002118532,0.31497672],"study_design_scores_gemma":[0.00019769106,0.0017581417,0.010629689,0.00004351021,0.0001688735,0.001079143,0.00030404396,0.692127,0.26999143,0.012692636,0.010923026,0.00008489842],"about_ca_topic_score_codex":0.00056826166,"about_ca_topic_score_gemma":0.0017298706,"teacher_disagreement_score":0.0016822162,"about_ca_system_score_codex":0.0004177297,"about_ca_system_score_gemma":0.00034333047,"threshold_uncertainty_score":0.0056275725},"labels":[],"label_agreement":null},{"id":"W2062553629","doi":"10.1109/tcad.2010.2061670","title":"Improving FPGA Placement With Dynamically Adaptive Stochastic Tunneling","year":2010,"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":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Field-programmable gate array; Benchmark (surveying); Routing (electronic design automation); Adaptive simulated annealing; Parallel computing; Computer engineering; Algorithm; Embedded system","score_opus":0.015143929766656102,"score_gpt":0.1964224691009992,"score_spread":0.1812785393343431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062553629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10656946,0.00013378782,0.8901753,0.00006997761,0.000025319228,0.00003552016,0.000014607629,0.0011560695,0.0018198846],"genre_scores_gemma":[0.68629223,0.000085455555,0.3123156,0.000044128337,0.000014073267,0.00003762414,0.000048755282,0.00013358776,0.0010284672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997087,0.00007395293,0.000015590704,0.000042447475,0.00012588962,0.000033397857],"domain_scores_gemma":[0.9996371,0.00014043413,0.000049965423,0.00008859494,0.000067435285,0.000016449734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004471745,0.0003861094,0.00035043343,0.0004485492,0.0003156878,0.00033796477,0.00091406435,0.00033604895,0.00088965776],"category_scores_gemma":[0.0014502738,0.0002547549,0.00033665547,0.00035207576,0.00032641648,0.0005343457,0.0005396041,0.00039886843,0.00019417316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012553624,0.000058280817,0.0012756801,0.000048669117,0.000031686668,0.00008194009,0.00007952327,0.78395665,0.04632134,0.008026088,0.0007619643,0.15923266],"study_design_scores_gemma":[0.000014935004,0.00009101737,0.00027874988,0.0000025129023,0.0000083974155,0.00006701005,0.000011244563,0.9877281,0.009570654,0.0013123055,0.0009077097,0.0000073758843],"about_ca_topic_score_codex":0.0014529333,"about_ca_topic_score_gemma":0.0026464185,"teacher_disagreement_score":0.0014529333,"about_ca_system_score_codex":0.00042499581,"about_ca_system_score_gemma":0.0006417677,"threshold_uncertainty_score":0.0030835867},"labels":[],"label_agreement":null},{"id":"W2064570018","doi":"10.1007/s10586-012-0229-4","title":"The impact of heterogeneous multi-core clusters on graph partitioning: an empirical study","year":2012,"lang":"en","type":"article","venue":"Cluster Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Graph; Core (optical fiber); Empirical research; Theoretical computer science; Statistics; Telecommunications","score_opus":0.06011409574486494,"score_gpt":0.34687051547067943,"score_spread":0.2867564197258145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064570018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9987532,0.000063012674,0.0006455655,0.000026972697,0.0000020412542,0.00002635408,0.000045328707,0.000009836172,0.0004276111],"genre_scores_gemma":[0.9989536,0.000038295093,0.00069075223,0.000010001863,0.0000032313874,0.000012259823,0.00010478251,0.000009110883,0.00017802225],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975068,0.0013558794,0.000102223355,0.0003090021,0.0005066592,0.00021944278],"domain_scores_gemma":[0.87674075,0.11022858,0.0046634357,0.0038461515,0.0031432265,0.0013778282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003232566,0.00035668167,0.00027412595,0.00084410777,0.00067591626,0.0008246133,0.0008639268,0.0006051268,0.00223276],"category_scores_gemma":[0.045620073,0.00023956371,0.00038616426,0.0012612963,0.0008955521,0.0016322496,0.00062182586,0.0007023274,0.00020254984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054834248,0.0049738693,0.7938639,0.00041252226,0.0005200943,0.00075722806,0.0023799757,0.08461737,0.0074196043,0.0018471451,0.0017951565,0.09592965],"study_design_scores_gemma":[0.00023709254,0.007037859,0.82399654,0.000069646274,0.0005522854,0.0016612342,0.008148642,0.14823166,0.0050669517,0.0023706846,0.002571477,0.00005587031],"about_ca_topic_score_codex":0.004332771,"about_ca_topic_score_gemma":0.006420999,"teacher_disagreement_score":0.004332771,"about_ca_system_score_codex":0.00076269277,"about_ca_system_score_gemma":0.00055684784,"threshold_uncertainty_score":0.017095685},"labels":[],"label_agreement":null},{"id":"W2064997970","doi":"10.1109/reconfig.2011.27","title":"Deterministic Timing-Driven Parallel Placement by Simulated Annealing Using Half-Box Window Decomposition","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Speedup; Parallel computing; Computer science; Simulated annealing; Thread (computing); Scalability; Algorithm","score_opus":0.04431845667615471,"score_gpt":0.2711952791164864,"score_spread":0.2268768224403317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064997970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029176349,0.0000767787,0.96758044,0.00004511999,0.000021194113,0.00007108125,0.000027480446,0.00085884595,0.0021427488],"genre_scores_gemma":[0.26580244,0.00010011454,0.7318603,0.000037010075,0.0000108752665,0.00025519397,0.00009238688,0.00019919821,0.0016425516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996517,0.00010253064,0.000018103654,0.00005913043,0.00013482937,0.00003373024],"domain_scores_gemma":[0.9995289,0.00022151522,0.000056260014,0.000107456224,0.00007096146,0.000014945172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007180619,0.00056954107,0.0006625525,0.00041060365,0.0003038977,0.0004938704,0.0008635675,0.00043669724,0.0016241976],"category_scores_gemma":[0.0012007882,0.00057770725,0.0007992919,0.0004734825,0.00043059178,0.00062601664,0.000513515,0.0006093488,0.00033145712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010793306,0.000038523533,0.00039189213,0.00005814356,0.000040085153,0.000029355524,0.000052888034,0.9420144,0.01631197,0.0057984972,0.00047096846,0.034685347],"study_design_scores_gemma":[0.000013086786,0.000023840752,0.0000642372,0.000001915217,0.0000037628417,0.0000077474915,0.0000033819506,0.995852,0.0029130324,0.0007392938,0.00037471586,0.0000029697571],"about_ca_topic_score_codex":0.0031855118,"about_ca_topic_score_gemma":0.0049506463,"teacher_disagreement_score":0.0031855118,"about_ca_system_score_codex":0.0007701999,"about_ca_system_score_gemma":0.0012938485,"threshold_uncertainty_score":0.006333947},"labels":[],"label_agreement":null},{"id":"W2068598660","doi":"10.1016/j.comgeo.2013.10.001","title":"An optimal algorithm for the Euclidean bottleneck full Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Disjoint sets; Logarithm; K-ary tree; Gomory–Hu tree; Matching (statistics); Tree (set theory); Discrete mathematics; Euclidean minimum spanning tree; Upper and lower bounds; Spanning tree; Tree structure; Minimum degree spanning tree; Binary tree","score_opus":0.01036784220015194,"score_gpt":0.23104368802641279,"score_spread":0.22067584582626085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068598660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03344138,0.0007103642,0.9457813,0.00051019434,0.00014514838,0.00017489096,0.0003824203,0.0020305505,0.016823728],"genre_scores_gemma":[0.1493171,0.00040061172,0.8431135,0.00015795084,0.000058622954,0.00019428859,0.00093054405,0.00025405074,0.0055733565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944705,0.00011055695,0.00003651871,0.00013483304,0.00017028116,0.000100780446],"domain_scores_gemma":[0.9994054,0.00027453218,0.00005191228,0.00011057365,0.00011048058,0.000047100002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739404,0.000920496,0.0011819375,0.0012090172,0.0007232739,0.0014098503,0.0020072476,0.0011310158,0.011733803],"category_scores_gemma":[0.0024791122,0.0005945125,0.00064597576,0.0019028292,0.00048423893,0.0027368614,0.0016042121,0.0010904319,0.0018346136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000570179,0.000347079,0.00065800105,0.00046165654,0.000089849236,0.00015957588,0.000159526,0.27639285,0.009311185,0.053216934,0.024151472,0.63448167],"study_design_scores_gemma":[0.00023152465,0.00017385387,0.0003979513,0.00003764927,0.00004062867,0.00019396207,0.000108922555,0.94257,0.0029476748,0.044278536,0.008994565,0.000024687604],"about_ca_topic_score_codex":0.0031176081,"about_ca_topic_score_gemma":0.0058246437,"teacher_disagreement_score":0.011733803,"about_ca_system_score_codex":0.0012664667,"about_ca_system_score_gemma":0.0021783507,"threshold_uncertainty_score":0.039253473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007858428311754624,"score_gpt":0.22772239036706296,"score_spread":0.21986396205530834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069460396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24451154,0.0031300534,0.721119,0.00041914592,0.00015813626,0.00015351055,0.00017318764,0.0029841783,0.027351256],"genre_scores_gemma":[0.83342785,0.0014396467,0.15640853,0.00019140074,0.000068832014,0.000082971936,0.00018319879,0.00014047799,0.00805712],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989593,0.000026146101,0.000006222124,0.000015111753,0.000035370107,0.000021159485],"domain_scores_gemma":[0.99985576,0.000050284238,0.000023727098,0.000031015374,0.00003189683,0.000007248754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001343001,0.00035671022,0.00014065436,0.0003071545,0.00017119537,0.00040489735,0.00044364794,0.00017110186,0.003693795],"category_scores_gemma":[0.000360231,0.00011024841,0.00011886627,0.0005354515,0.00016767145,0.00051182276,0.00015721544,0.00029130673,0.00032124354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045576846,0.00016056234,0.001368219,0.00030571717,0.00004672212,0.00027604686,0.00010000377,0.11734422,0.31851697,0.045126766,0.008124707,0.50817436],"study_design_scores_gemma":[0.00017313418,0.0013961038,0.0036389667,0.000101800906,0.00013204556,0.0008751612,0.00008509979,0.5780595,0.31770775,0.020149557,0.07762353,0.000057370966],"about_ca_topic_score_codex":0.00063506444,"about_ca_topic_score_gemma":0.001756886,"teacher_disagreement_score":0.003693795,"about_ca_system_score_codex":0.00032235903,"about_ca_system_score_gemma":0.00026947042,"threshold_uncertainty_score":0.012356937},"labels":[],"label_agreement":null},{"id":"W2070101640","doi":"10.1109/fpt.2013.6718328","title":"A case for hardened multiplexers in FPGAs","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplexer; Computer science; Benchmark (surveying); Logic block; Block (permutation group theory); Parallel computing; Lookup table; Logic synthesis; Field-programmable gate array; Routing (electronic design automation); Reduction (mathematics); Logic optimization; Logic gate; Programmable logic device; Computer architecture; Embedded system; Algorithm; Multiplexing; Mathematics; Operating system; Telecommunications","score_opus":0.01650390308304619,"score_gpt":0.21447856431501836,"score_spread":0.19797466123197216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070101640","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6173626,0.0018425161,0.2804586,0.004320276,0.00024441112,0.00015082408,0.00014372462,0.002113618,0.09336336],"genre_scores_gemma":[0.86973834,0.00025372222,0.10728982,0.00061177067,0.000040812312,0.000049680162,0.00004629632,0.00014847948,0.02182096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991442,0.00016833555,0.000036602956,0.00016288186,0.0003268353,0.00016122652],"domain_scores_gemma":[0.9992899,0.00021046739,0.00007446614,0.0003056217,0.00006553933,0.00005401148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005786968,0.0004361751,0.00021815344,0.0005424178,0.00070174626,0.0016674655,0.0012691396,0.0010972337,0.008342462],"category_scores_gemma":[0.0016341708,0.00036370152,0.0002929818,0.00043407548,0.0010632104,0.002939088,0.0009743984,0.00085415225,0.001052131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001304659,0.00015338876,0.0064982036,0.00031462286,0.00014286746,0.01057253,0.0010226209,0.10736216,0.17321771,0.471233,0.0064792614,0.22169897],"study_design_scores_gemma":[0.00028599595,0.0014989461,0.0064193034,0.00027542017,0.00020666102,0.017649151,0.0011221749,0.27027678,0.24414048,0.17022571,0.2877358,0.00016370355],"about_ca_topic_score_codex":0.0010558069,"about_ca_topic_score_gemma":0.0024189441,"teacher_disagreement_score":0.008342462,"about_ca_system_score_codex":0.0006994624,"about_ca_system_score_gemma":0.00029706242,"threshold_uncertainty_score":0.027908385},"labels":[],"label_agreement":null},{"id":"W2071575532","doi":"10.1007/s11590-006-0027-0","title":"An ILP based hierarchical global routing approach for VLSI ASIC design","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Routing (electronic design automation); Computer science; Very-large-scale integration; Integer programming; Rounding; Heuristic; Physical design; Parallel computing; Application-specific integrated circuit; Circuit design; Embedded system; Algorithm","score_opus":0.010559122700771837,"score_gpt":0.21219346988723609,"score_spread":0.20163434718646425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071575532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012234108,0.00036161023,0.97708875,0.00012820434,0.000048988302,0.000048844853,0.00006419837,0.0012930207,0.0087322565],"genre_scores_gemma":[0.36475828,0.00046318423,0.62667674,0.00021331837,0.000056703106,0.0001476102,0.00026368324,0.00024162896,0.007178849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987996,0.000029701627,0.0000061419623,0.000017556962,0.000048857564,0.0000176659],"domain_scores_gemma":[0.9998933,0.000024001416,0.00001255204,0.000032514694,0.000031834,0.0000057803486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019000127,0.0004544281,0.00033950678,0.00039689496,0.00032409426,0.00049927155,0.0008899112,0.00031474177,0.003547034],"category_scores_gemma":[0.00027392842,0.00027965746,0.00035830526,0.00046645838,0.00022488718,0.00057123235,0.00048771786,0.0004851512,0.00057289074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013850738,0.00009436577,0.0004252336,0.0003238209,0.00007693988,0.0001954742,0.00013945294,0.4535854,0.093207456,0.035797883,0.009956916,0.40605858],"study_design_scores_gemma":[0.000032268876,0.00025358668,0.0002744403,0.000025149679,0.000050518403,0.00014413672,0.000033645323,0.94816023,0.022505475,0.018212061,0.010292823,0.000015684147],"about_ca_topic_score_codex":0.0009655769,"about_ca_topic_score_gemma":0.0040264823,"teacher_disagreement_score":0.003547034,"about_ca_system_score_codex":0.00042271795,"about_ca_system_score_gemma":0.0005266879,"threshold_uncertainty_score":0.011866033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05195777177682509,"score_gpt":0.26672345532088737,"score_spread":0.21476568354406228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072249022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31350335,0.0016009288,0.66451156,0.0003181698,0.00022532267,0.00010166437,0.00029276786,0.006204611,0.0132416105],"genre_scores_gemma":[0.80465174,0.0006120185,0.18713833,0.00013333916,0.000056889196,0.00004642541,0.00031482763,0.00013934552,0.006907182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998098,0.000045637404,0.000015107887,0.000046162768,0.000049893864,0.000033386998],"domain_scores_gemma":[0.99955815,0.00012924426,0.000082458144,0.00012988184,0.000077818404,0.000022456437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020397137,0.00052741833,0.00024200385,0.00037626002,0.00025083162,0.00067416736,0.00063794287,0.00021518461,0.004143067],"category_scores_gemma":[0.00061080797,0.0002450529,0.00023102795,0.000612794,0.0003020862,0.0011020703,0.00050149014,0.0002572619,0.00077020103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006333336,0.00017682866,0.003226436,0.00065964635,0.00017459031,0.00042324272,0.00022889068,0.17549089,0.3777777,0.041849177,0.0051321182,0.39422718],"study_design_scores_gemma":[0.00018161625,0.0027377221,0.0043524806,0.00015148189,0.0002772221,0.001356417,0.00020037415,0.45400262,0.41506973,0.03221262,0.08935817,0.00009957018],"about_ca_topic_score_codex":0.0017869514,"about_ca_topic_score_gemma":0.0045898096,"teacher_disagreement_score":0.004143067,"about_ca_system_score_codex":0.0003365672,"about_ca_system_score_gemma":0.00037890184,"threshold_uncertainty_score":0.013859928},"labels":[],"label_agreement":null},{"id":"W2072442523","doi":"10.1109/cjece.2003.1425097","title":"Analogue integrated circuit sizing with several optimization runs using heuristics for setting initial points","year":2003,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maxima and minima; Sizing; Heuristics; Heuristic; Mathematical optimization; Point (geometry); Process (computing); Function (biology); Computer science; Algorithm; Mathematics","score_opus":0.010361521872989868,"score_gpt":0.18363426442626268,"score_spread":0.17327274255327282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072442523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21929407,0.00055741536,0.7703345,0.00018542117,0.00007204793,0.0006817846,0.00012812651,0.002289208,0.00645743],"genre_scores_gemma":[0.39448154,0.000137505,0.602889,0.000077620636,0.000017778802,0.00066486764,0.00030988586,0.00025763054,0.0011640548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922407,0.00029544538,0.00006091577,0.00018543222,0.00013606418,0.00009818728],"domain_scores_gemma":[0.9967444,0.0022775375,0.00020659243,0.00036505697,0.00033390775,0.000072478106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017937816,0.0015364689,0.0014061399,0.0012559909,0.0007463625,0.0007715303,0.0011540508,0.0009642843,0.0031228557],"category_scores_gemma":[0.004856141,0.00064931257,0.0008144869,0.0015659506,0.000677496,0.00083470566,0.00064437365,0.0010079849,0.0004855708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035367344,0.0003324426,0.0017388847,0.00018329063,0.0001446163,0.00013338252,0.00018405277,0.8266082,0.0075297193,0.0042132474,0.001112684,0.15746596],"study_design_scores_gemma":[0.00016389857,0.00047542612,0.00080920354,0.00002345278,0.00014071964,0.00006793189,0.00013046474,0.9836284,0.006010818,0.006491151,0.0020108696,0.000047765752],"about_ca_topic_score_codex":0.003848634,"about_ca_topic_score_gemma":0.0056935144,"teacher_disagreement_score":0.003848634,"about_ca_system_score_codex":0.0011714904,"about_ca_system_score_gemma":0.0013963645,"threshold_uncertainty_score":0.010447025},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02502333018816553,"score_gpt":0.2584584849067553,"score_spread":0.2334351547185898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075137913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03979414,0.00019663517,0.95231503,0.000072992625,0.000030867934,0.000035571564,0.000056288103,0.001340185,0.0061581987],"genre_scores_gemma":[0.54897094,0.00031961905,0.44549626,0.000068066496,0.00002845018,0.00007093371,0.00014474025,0.00021927757,0.0046816655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.000040037077,0.000010743582,0.000043181713,0.000105264175,0.000038886395],"domain_scores_gemma":[0.999739,0.000095595096,0.000043197324,0.00004864751,0.000056438126,0.000017177072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022985402,0.00065206416,0.00040976526,0.00070955476,0.00046974534,0.0006715098,0.0009204114,0.00035356125,0.0023253763],"category_scores_gemma":[0.0009220229,0.00034145857,0.00036789174,0.0005968863,0.00040332077,0.0006197291,0.00063277007,0.00033796878,0.00044700428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010706604,0.000026794578,0.00069897366,0.000082895975,0.000025363492,0.00022879124,0.00007268782,0.88765115,0.017257106,0.015805487,0.0013608577,0.07668274],"study_design_scores_gemma":[0.0000115121275,0.00004158518,0.00015150348,0.0000073389037,0.0000089252,0.000079077,0.000038155868,0.9849331,0.0074513587,0.0046429397,0.002628185,0.0000063907178],"about_ca_topic_score_codex":0.003109663,"about_ca_topic_score_gemma":0.0058390307,"teacher_disagreement_score":0.003109663,"about_ca_system_score_codex":0.00095825933,"about_ca_system_score_gemma":0.0010043058,"threshold_uncertainty_score":0.007779181},"labels":[],"label_agreement":null},{"id":"W2075329791","doi":"10.1109/fpl.2014.6927456","title":"Tile-based bottom-up compilation of custom mesh-of-functional-units FPGA overlays","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tile; Overlay; Computer science; Field-programmable gate array; Computer architecture; Parallel computing; Embedded system; Operating system; Materials science","score_opus":0.020799726422106934,"score_gpt":0.2053828113265248,"score_spread":0.18458308490441788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075329791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33408916,0.00014084134,0.6407313,0.00008424413,0.00007851001,0.00015735229,0.0002849586,0.009501738,0.014931917],"genre_scores_gemma":[0.73702097,0.000094625415,0.25779173,0.000041013835,0.000013413905,0.00009710118,0.00046113163,0.00047493697,0.0040049925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998462,0.000021077172,0.000009075835,0.000027603039,0.000053753345,0.00004230184],"domain_scores_gemma":[0.9997404,0.00008639762,0.000024708046,0.000072638446,0.000056463294,0.000019396213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015308388,0.00036672133,0.00026339598,0.00031768502,0.00018647665,0.00033370606,0.00047310963,0.00016216529,0.0025645348],"category_scores_gemma":[0.0006039137,0.00020868581,0.00031417096,0.00020388913,0.0002717123,0.00033225375,0.0003542945,0.0002998644,0.00034368542],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024409326,0.00008979008,0.0039707855,0.00019881516,0.000046344532,0.0004480311,0.00026854267,0.6461827,0.15107223,0.008315598,0.005745073,0.18341792],"study_design_scores_gemma":[0.000028402852,0.00027555242,0.0020830042,0.000015788139,0.000027905684,0.000121139456,0.00007489859,0.88231593,0.1026785,0.0022300098,0.010127133,0.000021723561],"about_ca_topic_score_codex":0.0028349333,"about_ca_topic_score_gemma":0.0050905584,"teacher_disagreement_score":0.0028349333,"about_ca_system_score_codex":0.00046696555,"about_ca_system_score_gemma":0.00056667824,"threshold_uncertainty_score":0.008579254},"labels":[],"label_agreement":null},{"id":"W2076906193","doi":"10.1142/s1469026805001611","title":"A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Bounded function; Genetic algorithm; Algorithm; Mathematical optimization; Network planning and design; Constraint (computer-aided design); Ring (chemistry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.01981469221337038,"score_gpt":0.28029369089475836,"score_spread":0.26047899868138796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076906193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015187971,0.00017723572,0.98207444,0.000099808305,0.000023219129,0.0000682279,0.000019770385,0.00020639306,0.0021429455],"genre_scores_gemma":[0.20108882,0.0002558181,0.79624444,0.00008202156,0.000016154052,0.00029828664,0.000075916156,0.00005456659,0.0018839573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997745,0.000073919655,0.000009082094,0.000043219712,0.00007432626,0.00002486711],"domain_scores_gemma":[0.9996784,0.00019634442,0.000037253565,0.000018087709,0.000054897235,0.000014923306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069263874,0.0006908189,0.0005210802,0.00072875223,0.00048362455,0.0005011972,0.00085831975,0.00086907047,0.0015044428],"category_scores_gemma":[0.0015521019,0.00037826758,0.00048822025,0.00062452594,0.000686176,0.0004888239,0.00041712544,0.00065937423,0.00021221228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028912922,0.00003104461,0.00022773417,0.00004552282,0.000025136083,0.00005263428,0.000052963995,0.9326783,0.0029181405,0.01431282,0.00062465254,0.04900216],"study_design_scores_gemma":[0.000026643122,0.00003520234,0.000050263996,0.000009165738,0.000009979134,0.00002506162,0.0000101673995,0.99347395,0.00081615156,0.0043498725,0.0011882439,0.0000053312065],"about_ca_topic_score_codex":0.0029757624,"about_ca_topic_score_gemma":0.0026330824,"teacher_disagreement_score":0.0029757624,"about_ca_system_score_codex":0.0007879171,"about_ca_system_score_gemma":0.0013210803,"threshold_uncertainty_score":0.0059168935},"labels":[],"label_agreement":null},{"id":"W2077651334","doi":"10.1007/s10470-006-1271-z","title":"Aladin: A Layout Synthesys Tool for Analog Integrated Circuits","year":2006,"lang":"en","type":"article","venue":"Analog Integrated Circuits and Signal Processing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"KU Leuven; Carnegie Mellon University","keywords":"Placement; Simulated annealing; Routing (electronic design automation); Computer science; IC layout editor; Physical design; Integrated circuit layout; Electronic circuit; Generator (circuit theory); Floorplan; Integrated circuit; Computer engineering; Analogue electronics; Electronic engineering; Computer architecture; Circuit design; Circuit extraction; Engineering; Embedded system; Algorithm; Electrical engineering; Voltage; Equivalent circuit","score_opus":0.011801358726977844,"score_gpt":0.21467774635943015,"score_spread":0.2028763876324523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077651334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031792275,0.0003879624,0.9175849,0.00010301914,0.00013427212,0.00008526395,0.0014112932,0.067678966,0.009435109],"genre_scores_gemma":[0.08747978,0.00056987326,0.8834486,0.0003390595,0.00009551562,0.00044637566,0.003722276,0.012259567,0.011638971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932075,0.00013702996,0.000048238246,0.00009470621,0.0003299241,0.000069438436],"domain_scores_gemma":[0.9989157,0.0005491445,0.00007942651,0.00015257113,0.00027093454,0.000032235406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007679416,0.0016486188,0.0007588187,0.0016530425,0.0005323947,0.0014211606,0.001916366,0.0008295525,0.06494837],"category_scores_gemma":[0.002891805,0.0009695325,0.00095765566,0.0010270615,0.0003960506,0.0011651625,0.0011226106,0.001472083,0.009457123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006421298,0.00014344587,0.0012133496,0.0020260126,0.00020029217,0.00054954505,0.0003703406,0.03802696,0.0627113,0.03646348,0.115032345,0.7426207],"study_design_scores_gemma":[0.0009205229,0.00047517344,0.0009812966,0.00037540164,0.00020078782,0.0015638707,0.00019591131,0.4067079,0.16614121,0.05663457,0.36564097,0.00016227266],"about_ca_topic_score_codex":0.0008019518,"about_ca_topic_score_gemma":0.0018076227,"teacher_disagreement_score":0.06494837,"about_ca_system_score_codex":0.0005633292,"about_ca_system_score_gemma":0.0009237116,"threshold_uncertainty_score":0.21727395},"labels":[],"label_agreement":null},{"id":"W2078041678","doi":"10.1145/1952522.1952530","title":"Evaluating address register assignment and offset assignment algorithms","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristics; Offset (computer science); Parallel computing; Partition (number theory); Algorithm; Computation; Overhead (engineering); Heuristic; Optimization problem; Register allocation; Assignment problem; Mathematical optimization; Mathematics","score_opus":0.10640099779316,"score_gpt":0.3076893389529483,"score_spread":0.20128834115978833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078041678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8263398,0.0024275442,0.16227455,0.00018356238,0.000068973895,0.00021718559,0.00021101019,0.0010412497,0.007236186],"genre_scores_gemma":[0.777408,0.00050106825,0.22023681,0.000069313166,0.000021098738,0.00012806291,0.00036958983,0.00010572917,0.0011603222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985184,0.00065327453,0.00007191433,0.00014713718,0.00045894092,0.00015028137],"domain_scores_gemma":[0.99527043,0.0035970511,0.0003036872,0.00027093082,0.0004934014,0.00006444924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017640028,0.0009316453,0.0006627028,0.0010794381,0.00043012347,0.0007242133,0.0008062442,0.00097066705,0.0012034],"category_scores_gemma":[0.007537618,0.0003117224,0.0003405061,0.0012706443,0.0004841683,0.0011861603,0.0004440061,0.00031018496,0.00016298782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071245624,0.00024240333,0.0031677207,0.00024134065,0.000095340765,0.000043877062,0.0000641254,0.80126965,0.005293927,0.003639613,0.00074541615,0.18448415],"study_design_scores_gemma":[0.00013327603,0.0008438381,0.0014078292,0.000016688404,0.000052484986,0.000050322535,0.000072836156,0.98342484,0.011296767,0.0017073915,0.0009795326,0.000014255916],"about_ca_topic_score_codex":0.004231855,"about_ca_topic_score_gemma":0.00538586,"teacher_disagreement_score":0.004231855,"about_ca_system_score_codex":0.0015810573,"about_ca_system_score_gemma":0.0015504454,"threshold_uncertainty_score":0.01147145},"labels":[],"label_agreement":null},{"id":"W2078579271","doi":"10.1109/fpt.2010.5681497","title":"The effect of multi-bit based connections on the area efficiency of FPGAs utilizing unidirectional routing resources","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Datapath; Routing (electronic design automation); Computer science; Field-programmable gate array; Multipath routing; Place and route; Computer architecture; Parallel computing; Embedded system; Static routing; Computer network; Routing protocol","score_opus":0.01381953391687251,"score_gpt":0.22682393280409766,"score_spread":0.21300439888722514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078579271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98660374,0.00063587865,0.0075130747,0.000060513583,0.000014591731,0.000007153724,0.00002399821,0.000101625046,0.005039501],"genre_scores_gemma":[0.9957527,0.00019460852,0.0033881455,0.000013272914,0.00000549486,0.000004720032,0.000020288946,0.000017950033,0.0006029249],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965763,0.000109766595,0.000026184482,0.000050232196,0.0000865762,0.000069478876],"domain_scores_gemma":[0.9980447,0.0012616712,0.00029113347,0.00019662383,0.0001589985,0.000046836776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032378788,0.00027699565,0.00009796609,0.00036877926,0.00018982055,0.00036889652,0.00035853696,0.00022341659,0.001372106],"category_scores_gemma":[0.001982846,0.00013703178,0.00008917254,0.00039476357,0.00018706344,0.0009956871,0.0002260185,0.00015822485,0.00021469666],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017319631,0.00021173486,0.014880367,0.00029775628,0.000075250915,0.000502263,0.00017375938,0.12029296,0.6551008,0.0075656762,0.0006298171,0.1985376],"study_design_scores_gemma":[0.00008987005,0.0034366366,0.028817218,0.00006254602,0.00020991042,0.0015932407,0.00020407555,0.18084647,0.77470773,0.0022604018,0.0077236095,0.000048323254],"about_ca_topic_score_codex":0.00024209337,"about_ca_topic_score_gemma":0.00065093284,"teacher_disagreement_score":0.001372106,"about_ca_system_score_codex":0.00023313184,"about_ca_system_score_gemma":0.00014702801,"threshold_uncertainty_score":0.0045901537},"labels":[],"label_agreement":null},{"id":"W2079078065","doi":"10.1145/785411.785413","title":"Gravity","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Electronic circuit; Algorithm; Iterative method; Computer engineering; Time complexity; Electrical engineering","score_opus":0.015426394018364126,"score_gpt":0.2255704286877004,"score_spread":0.21014403466933626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079078065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012558886,0.0053909775,0.038843352,0.010869292,0.0045165704,0.00031480775,0.0028935892,0.0028203123,0.9217922],"genre_scores_gemma":[0.22294338,0.0072080265,0.028321613,0.005876341,0.0018834873,0.00040155166,0.0053435396,0.0011031635,0.726919],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991658,0.0000820901,0.00003498261,0.00020014295,0.00038733578,0.0001295999],"domain_scores_gemma":[0.99948835,0.000060978502,0.00004432466,0.00010798205,0.00020233063,0.000096042044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047546436,0.00088276365,0.0005786099,0.0017124702,0.0018552417,0.0039351396,0.0014690505,0.0020593188,0.16763207],"category_scores_gemma":[0.0021921813,0.00029846138,0.0006919529,0.0014901225,0.0013959775,0.0027203655,0.0033854353,0.0013181424,0.06209917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018483063,0.00006187052,0.0023228857,0.0004869339,0.000033988163,0.0006688724,0.0006247658,0.0018577715,0.0055666086,0.33049217,0.3569663,0.30073303],"study_design_scores_gemma":[0.000022705273,0.000031168052,0.0010966321,0.00009205156,0.000009724804,0.00047491776,0.0002272088,0.0011135028,0.0010878599,0.029869441,0.9659535,0.000021273601],"about_ca_topic_score_codex":0.004257396,"about_ca_topic_score_gemma":0.0041024415,"teacher_disagreement_score":0.16763207,"about_ca_system_score_codex":0.00133656,"about_ca_system_score_gemma":0.0015267804,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2080270089","doi":"10.1145/1950413.1950443","title":"Towards scalable FPGA CAD through architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Scalability; Compiler; Scaling; CAD; Computer architecture; FPGA prototype; Architecture; Embedded system; Compile time; Parallel computing; Operating system; Engineering","score_opus":0.025525260103283196,"score_gpt":0.21630205378366474,"score_spread":0.19077679368038153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080270089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035198234,0.006447622,0.84800756,0.003654126,0.00073531386,0.00020568422,0.00038345926,0.015854163,0.08951381],"genre_scores_gemma":[0.1516484,0.0042831427,0.82283777,0.0009653472,0.0002665727,0.00020234575,0.0009777866,0.0009309955,0.017887648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.00017057463,0.00004211068,0.00011735627,0.0005658471,0.00011671159],"domain_scores_gemma":[0.9986444,0.00026331304,0.000046370635,0.00053502765,0.00042484372,0.00008595741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121618,0.00076170685,0.0005269485,0.00088586437,0.00040399362,0.0017597794,0.0014392533,0.0008575227,0.0127919875],"category_scores_gemma":[0.003226992,0.0005571638,0.000447891,0.0008646301,0.0006193978,0.0027334355,0.0019963488,0.0020544112,0.0052732164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019469086,0.00014901353,0.0012289151,0.0005149335,0.00005817018,0.00031128133,0.00020683644,0.06331393,0.059723683,0.17740735,0.05375954,0.6431317],"study_design_scores_gemma":[0.00016438062,0.0003535924,0.0013405798,0.00033665856,0.000049393308,0.0006331321,0.00021919665,0.44471648,0.038286548,0.17723767,0.3365932,0.00006911604],"about_ca_topic_score_codex":0.0015197665,"about_ca_topic_score_gemma":0.0033114972,"teacher_disagreement_score":0.0127919875,"about_ca_system_score_codex":0.0007841894,"about_ca_system_score_gemma":0.0011760903,"threshold_uncertainty_score":0.042793453},"labels":[],"label_agreement":null},{"id":"W2081801059","doi":"10.1016/j.mejo.2008.09.008","title":"Hardware accelerated FPGA placement","year":2008,"lang":"en","type":"article","venue":"Microelectronics Journal","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Logic block; Routing (electronic design automation); Key (lock); Exploit; Realization (probability); Embedded system; Reconfigurable computing; FPGA prototype; Parallel computing; Computer architecture; Computer hardware; Mathematics","score_opus":0.02006410535247706,"score_gpt":0.22023026365916776,"score_spread":0.2001661583066907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081801059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08308741,0.0015264619,0.8309527,0.00049804826,0.0008456935,0.00023054845,0.0003186509,0.012563569,0.069976896],"genre_scores_gemma":[0.3775472,0.0004777368,0.57865375,0.00027524895,0.0001113264,0.0000901479,0.00064840814,0.0004757828,0.041720416],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996332,0.000063601954,0.000015020464,0.000047022088,0.00017947721,0.0000617233],"domain_scores_gemma":[0.9996238,0.000059344693,0.000031802483,0.00011666883,0.00014436909,0.000024002957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020641618,0.0006726156,0.00038662765,0.0006343839,0.00052562467,0.0008492024,0.0009642113,0.0004283289,0.023605458],"category_scores_gemma":[0.0006692889,0.0003220187,0.00033791643,0.0007100148,0.00015895479,0.00051098457,0.000683648,0.000645068,0.0046149357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000829389,0.00017797244,0.0010606145,0.00021340404,0.000060857106,0.00033882566,0.00007348957,0.057588033,0.07800906,0.022097,0.02750248,0.81204873],"study_design_scores_gemma":[0.00042150982,0.0012366364,0.002712182,0.000090666384,0.00009872577,0.0014859647,0.00015214986,0.7237931,0.12216992,0.019274397,0.12849802,0.0000665946],"about_ca_topic_score_codex":0.0014334345,"about_ca_topic_score_gemma":0.006049546,"teacher_disagreement_score":0.023605458,"about_ca_system_score_codex":0.0005510894,"about_ca_system_score_gemma":0.0014619547,"threshold_uncertainty_score":0.07896817},"labels":[],"label_agreement":null},{"id":"W2083045602","doi":"10.1007/s10957-012-0036-3","title":"Gradient-Constrained Minimum Networks. III. Fixed Topology","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Embedding; Topology (electrical circuits); Network topology; Theory of computation; Combinatorics; Heuristic; Discrete mathematics; Mathematical optimization; Algorithm; Computer science","score_opus":0.006527470420823994,"score_gpt":0.221985977791401,"score_spread":0.215458507370577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083045602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02079506,0.0034471701,0.92939985,0.0012476436,0.00020401574,0.0000545818,0.00022933053,0.00023700685,0.044385348],"genre_scores_gemma":[0.74920255,0.005991894,0.20591927,0.00062213326,0.00032143164,0.0002753936,0.0004243903,0.0002862494,0.036956754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984896,0.000041396343,0.000005638039,0.000032500913,0.000052170875,0.00001931875],"domain_scores_gemma":[0.9997291,0.00012187503,0.00003643494,0.00003285814,0.000060732113,0.000018900864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037258584,0.00044389392,0.0004901042,0.00059121393,0.00031661586,0.0010078273,0.0010911314,0.0010980666,0.005219051],"category_scores_gemma":[0.0027170973,0.00042775946,0.00029945842,0.00078257173,0.00078363396,0.0016657059,0.0006943627,0.00083710474,0.00087180425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012638007,0.000025109635,0.0003252493,0.00023019702,0.000048016747,0.0001055944,0.000047319365,0.5086325,0.0040094177,0.38256913,0.007416306,0.09646479],"study_design_scores_gemma":[0.000018327377,0.00005424012,0.00025278653,0.000050710813,0.000014765979,0.00012907354,0.00002048144,0.75838214,0.001497343,0.2303412,0.009222773,0.000016166021],"about_ca_topic_score_codex":0.0019687703,"about_ca_topic_score_gemma":0.0018714267,"teacher_disagreement_score":0.005219051,"about_ca_system_score_codex":0.0007448519,"about_ca_system_score_gemma":0.00043011302,"threshold_uncertainty_score":0.017459452},"labels":[],"label_agreement":null},{"id":"W2083109774","doi":"10.1109/fpt.2010.5681478","title":"Technology issues facing the world's largest integrated circuits","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stratix; Field-programmable gate array; Control reconfiguration; Computer science; Embedded system; Computer architecture; Software; Process (computing); Reconfigurable computing; Operating system","score_opus":0.0072085983648260705,"score_gpt":0.22660405367358114,"score_spread":0.21939545530875507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083109774","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0399915,0.3962066,0.0633584,0.13575606,0.020317003,0.00015734199,0.00044798738,0.0012176607,0.34254742],"genre_scores_gemma":[0.3604615,0.31754646,0.09677692,0.027313143,0.014138009,0.00021828529,0.0010462876,0.0003784792,0.18212095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991673,0.00010367711,0.00005623103,0.00009584433,0.0004736094,0.00010333251],"domain_scores_gemma":[0.9983594,0.00070383993,0.00010193753,0.00007222954,0.0006274707,0.00013515555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802195,0.0004071578,0.00027669792,0.00077403116,0.00087583356,0.003456298,0.0007692908,0.0021445835,0.017413432],"category_scores_gemma":[0.0027629447,0.0002568521,0.00034478644,0.0011522581,0.0005605916,0.0031127497,0.0008712544,0.0015123924,0.0040778513],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009107401,0.000039047514,0.0015442803,0.00093645335,0.00002513453,0.00071820227,0.00027311614,0.003229515,0.009104671,0.14965071,0.16638984,0.6679979],"study_design_scores_gemma":[0.000018011806,0.00015920145,0.00088613306,0.00032008317,0.00004001318,0.001386023,0.00043113736,0.0018914135,0.0023976276,0.04160748,0.95083404,0.000028703564],"about_ca_topic_score_codex":0.0012580766,"about_ca_topic_score_gemma":0.0034046082,"teacher_disagreement_score":0.017413432,"about_ca_system_score_codex":0.0015686981,"about_ca_system_score_gemma":0.0015544647,"threshold_uncertainty_score":0.058253765},"labels":[],"label_agreement":null},{"id":"W2083536322","doi":"10.1109/fpt.2011.6132684","title":"Accelerated FPGA architecture design: Capabilities and limitations of analytical models","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Architecture; Computer science; Limiting; Computer architecture; Design methods; Embedded system; Computer engineering; Engineering","score_opus":0.16930945802324854,"score_gpt":0.24451128658917584,"score_spread":0.0752018285659273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083536322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043056943,0.0041484395,0.92149585,0.0013427818,0.000115477225,0.000121010424,0.00014986952,0.0013592723,0.028210483],"genre_scores_gemma":[0.6258734,0.0075518745,0.35741395,0.00040584855,0.0001129247,0.00042631364,0.00019730286,0.0003943362,0.0076240357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984884,0.0004947023,0.00006746271,0.00011715757,0.00072867237,0.00010356409],"domain_scores_gemma":[0.9953507,0.0029777521,0.00034482512,0.00077727064,0.00050883676,0.000040614716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018324249,0.0008813718,0.0006992205,0.00070249336,0.00037173257,0.0016133769,0.0016766319,0.0010711561,0.0019276977],"category_scores_gemma":[0.008739814,0.00094203604,0.0005664571,0.00071015244,0.0009584726,0.0029877126,0.0005233884,0.001599986,0.00067308755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006717379,0.00008973754,0.0007480301,0.00038037132,0.00004075882,0.00007329307,0.00013896066,0.83573323,0.0064338367,0.09548617,0.0017182849,0.05909013],"study_design_scores_gemma":[0.000024117782,0.00007622206,0.00016883886,0.00006119978,0.000019204512,0.000060797065,0.000034865137,0.9633518,0.0042094486,0.022540443,0.009432208,0.000020886817],"about_ca_topic_score_codex":0.002892432,"about_ca_topic_score_gemma":0.002635019,"teacher_disagreement_score":0.002892432,"about_ca_system_score_codex":0.001468333,"about_ca_system_score_gemma":0.0013212413,"threshold_uncertainty_score":0.010653555},"labels":[],"label_agreement":null},{"id":"W2083862022","doi":"10.1109/cjece.2009.5443860","title":"Near-linear wirelength estimation for FPGA placement","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Very-large-scale integration; Routing (electronic design automation); Placement; Reduction (mathematics); Path (computing); Critical path method; Parallel computing; Electronic design automation; Physical design; Static timing analysis; Circuit design; Algorithm; Computer engineering; Embedded system; Mathematics; Engineering","score_opus":0.005705714384969595,"score_gpt":0.18362591248853244,"score_spread":0.17792019810356285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083862022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01916811,0.00016072833,0.9787234,0.00005083024,0.000008706226,0.000009904693,0.000044091877,0.0006384019,0.0011957552],"genre_scores_gemma":[0.65827125,0.0003884031,0.33756012,0.00004527438,0.000018982993,0.000044605848,0.00020691968,0.00021835139,0.003246189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961025,0.00011037883,0.000012266759,0.000074910684,0.0001676649,0.000024496989],"domain_scores_gemma":[0.99932325,0.0003321405,0.00011148934,0.00011241865,0.00010433329,0.000016390568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985703,0.0004859871,0.00037769336,0.00048673208,0.00019812808,0.00050443475,0.000677313,0.00042333375,0.0014572497],"category_scores_gemma":[0.0017832844,0.0004454173,0.00028847303,0.00053609855,0.0003155473,0.0010317906,0.00043059196,0.000501009,0.0005026459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030050127,0.000010035475,0.0005050089,0.000021271757,0.0000066692937,0.000023619323,0.000013584135,0.9544496,0.0040904046,0.0040937494,0.00041376997,0.03634217],"study_design_scores_gemma":[7.849504e-7,0.0000095989635,0.00006839522,0.0000010103851,6.9066215e-7,0.00001155491,0.0000017690867,0.9980665,0.0007529325,0.0009006843,0.00018455037,0.0000014548102],"about_ca_topic_score_codex":0.004224531,"about_ca_topic_score_gemma":0.005216324,"teacher_disagreement_score":0.004224531,"about_ca_system_score_codex":0.00085263775,"about_ca_system_score_gemma":0.0009299975,"threshold_uncertainty_score":0.008399904},"labels":[],"label_agreement":null},{"id":"W2085192605","doi":"10.1109/ccece.2010.5575207","title":"An investigation of parallel memetic algorithms for VLSI circuit partitioning on multi-core computers","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Benchmark (surveying); Computer science; Memetic algorithm; Parallel computing; Very-large-scale integration; Suite; Algorithm; Local search (optimization); Embedded system","score_opus":0.05853442763360185,"score_gpt":0.27395896865226366,"score_spread":0.21542454101866182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085192605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.553902,0.0016896663,0.4232688,0.0008091173,0.00012129405,0.00014292831,0.00003581423,0.00034925342,0.019681199],"genre_scores_gemma":[0.79092574,0.000566292,0.20588677,0.00012468664,0.000051363055,0.000108039094,0.000037403744,0.000040645584,0.002259034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.0001418237,0.000010829257,0.000029686642,0.00009728297,0.00003412232],"domain_scores_gemma":[0.9989353,0.00075761677,0.0000626596,0.00009310619,0.00012635022,0.000024967541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281507,0.00041422885,0.00046585387,0.00042104797,0.00042550394,0.0005411369,0.0007481438,0.0005528395,0.0010506805],"category_scores_gemma":[0.0025902686,0.00022616143,0.00035751163,0.00053977384,0.00045152276,0.00083699264,0.00036397798,0.00043621522,0.00008299522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017243647,0.00019613432,0.0013945786,0.00016546562,0.00009430482,0.00006861234,0.00010351394,0.8884621,0.0077972403,0.015271628,0.0009042046,0.085369684],"study_design_scores_gemma":[0.00002296593,0.00007413989,0.00021173306,0.0000039686242,0.000009158787,0.000031769247,0.000019612786,0.99416816,0.0016205622,0.0032088433,0.00062648277,0.0000026292819],"about_ca_topic_score_codex":0.0011383059,"about_ca_topic_score_gemma":0.001259558,"teacher_disagreement_score":0.0011383059,"about_ca_system_score_codex":0.0005090842,"about_ca_system_score_gemma":0.0006199329,"threshold_uncertainty_score":0.0054374337},"labels":[],"label_agreement":null},{"id":"W2087803527","doi":"10.1145/2591513.2591543","title":"Forward-scaling, serially equivalent parallelism for FPGA placement","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Parallel computing; Computer science; Thread (computing); Field-programmable gate array; Critical path method; Scaling; Parallelism (grammar); Embedded system; Mathematics","score_opus":0.014784273811161121,"score_gpt":0.2369868628952145,"score_spread":0.22220258908405338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087803527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06660228,0.0011235485,0.8994294,0.00047999277,0.00022010866,0.00014642136,0.00013966362,0.0033308445,0.02852766],"genre_scores_gemma":[0.42714846,0.0006467079,0.5594553,0.00017344349,0.0000925775,0.0001204255,0.00024463792,0.00026481904,0.011853645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997813,0.000039649974,0.000010733612,0.000041304855,0.00010898946,0.00001804632],"domain_scores_gemma":[0.9996933,0.00007572306,0.000040716353,0.00009909357,0.00007500548,0.000016169457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023797152,0.00049348787,0.00019678478,0.00041486468,0.00039896503,0.00048326576,0.0005626364,0.00027182605,0.0062347264],"category_scores_gemma":[0.0008442686,0.0002724833,0.0002279144,0.00058164797,0.00026381167,0.00064074434,0.0003604093,0.00052718085,0.0018525621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019874358,0.00019271892,0.0011602504,0.0002807134,0.000032658318,0.00033819448,0.00011637029,0.13137767,0.23876153,0.039808523,0.009724048,0.5780086],"study_design_scores_gemma":[0.00013499788,0.0007234483,0.0015991108,0.00006161838,0.00004151438,0.00089941744,0.000073696574,0.737174,0.15480298,0.049964126,0.054481737,0.00004326857],"about_ca_topic_score_codex":0.0009603287,"about_ca_topic_score_gemma":0.0031005486,"teacher_disagreement_score":0.0062347264,"about_ca_system_score_codex":0.000543551,"about_ca_system_score_gemma":0.00072345283,"threshold_uncertainty_score":0.020857275},"labels":[],"label_agreement":null},{"id":"W2089047137","doi":"10.1145/1785481.1785581","title":"Performance-constrained template-driven retargeting for analog and RF layouts","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parasitic extraction; Retargeting; Computer science; Integrated circuit layout; Netlist; Radio frequency; RLC circuit; Electronic engineering; IC layout editor; Page layout; Integer programming; Circuit extraction; Computer engineering; Algorithm; Integrated circuit; Engineering; Equivalent circuit; Computer hardware; Capacitor; Artificial intelligence; Electrical engineering","score_opus":0.009048149737708785,"score_gpt":0.2054912267173273,"score_spread":0.19644307697961852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089047137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020606965,0.00004517056,0.97605747,0.000034027787,0.000007952255,0.000028821287,0.00002580406,0.0016699056,0.0015239106],"genre_scores_gemma":[0.4351325,0.00009206519,0.5612767,0.00006524472,0.000013731108,0.000107022504,0.00017192023,0.00072705,0.0024138086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966633,0.000066486275,0.000011871232,0.00006527067,0.0001570389,0.00003292427],"domain_scores_gemma":[0.99940085,0.00027765922,0.000097592005,0.00012641055,0.00008227598,0.000015160119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038011276,0.00068554655,0.0004137896,0.00040299568,0.00026107207,0.00037247132,0.00084893743,0.00036719622,0.0016326372],"category_scores_gemma":[0.0015294483,0.00033272608,0.000452196,0.00028888616,0.0003638869,0.00061465823,0.00060835655,0.00054193515,0.00043936603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008447466,0.000042650427,0.0004775617,0.00008996862,0.000029638102,0.00009665443,0.00016034924,0.64423084,0.11465271,0.008366116,0.0013926874,0.23037632],"study_design_scores_gemma":[0.00001293827,0.000064901826,0.00024326339,0.000005027788,0.000011060474,0.00008134235,0.000013617908,0.9511809,0.042564888,0.0033156944,0.0024908178,0.000015659893],"about_ca_topic_score_codex":0.0012259468,"about_ca_topic_score_gemma":0.0020599037,"teacher_disagreement_score":0.0016326372,"about_ca_system_score_codex":0.0006227063,"about_ca_system_score_gemma":0.00058493,"threshold_uncertainty_score":0.005461693},"labels":[],"label_agreement":null},{"id":"W2089448319","doi":"10.4028/www.scientific.net/amr.706-708.1890","title":"Implementing Sparse Matrix Ordering Using Hypergraph Partitioning","year":2013,"lang":"en","type":"article","venue":"Advanced materials research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Hypergraph; Cholesky decomposition; Sparse matrix; Computer science; Scheme (mathematics); Vertex (graph theory); Matrix (chemical analysis); Algorithm; Heuristic; Theoretical computer science; Combinatorics; Mathematics; Mathematical optimization; Graph; Eigenvalues and eigenvectors; Materials science; Computational chemistry","score_opus":0.060075169194913985,"score_gpt":0.3705282381566178,"score_spread":0.31045306896170377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089448319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0274475,0.00012477547,0.9668928,0.00010325039,0.00004237008,0.000064987056,0.00006464123,0.0008950925,0.0043645105],"genre_scores_gemma":[0.30949542,0.0001825872,0.6855961,0.0001087354,0.000026683196,0.0001070731,0.00034770035,0.00012362273,0.0040120953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.00007098919,0.000014483914,0.000039397728,0.00010925825,0.00004086099],"domain_scores_gemma":[0.99953616,0.00017652342,0.000039232084,0.000115678704,0.00010388436,0.000028597364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023821033,0.00048297702,0.00030524327,0.0006013789,0.0005033147,0.000541472,0.000550365,0.0003581383,0.0036118838],"category_scores_gemma":[0.0008784516,0.00021257215,0.0002503662,0.00068841386,0.00041480715,0.001030704,0.0009150003,0.0005502551,0.0007121911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032624367,0.00014144475,0.0013318423,0.00024238152,0.000057518355,0.00035375237,0.00035609704,0.2546192,0.17830916,0.08348321,0.006743623,0.4740356],"study_design_scores_gemma":[0.000053948712,0.00017371615,0.00048290257,0.00002131601,0.000014856101,0.0001899694,0.00012948514,0.870145,0.08112294,0.030626025,0.017006867,0.000032977812],"about_ca_topic_score_codex":0.0030906114,"about_ca_topic_score_gemma":0.0073871408,"teacher_disagreement_score":0.0036118838,"about_ca_system_score_codex":0.0004464445,"about_ca_system_score_gemma":0.00078053295,"threshold_uncertainty_score":0.012082994},"labels":[],"label_agreement":null},{"id":"W2089561452","doi":"10.1145/378239.378464","title":"On optimum switch box designs for 2-D FPGAs","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Parallel computing; S-box; Embedded system; Computer architecture; Cryptography; Algorithm","score_opus":0.030355443947766562,"score_gpt":0.25191157192334973,"score_spread":0.22155612797558316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089561452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06343371,0.0023007952,0.88547385,0.0003261145,0.00021353301,0.000106885134,0.00023208407,0.001505349,0.046407618],"genre_scores_gemma":[0.43503213,0.0023725454,0.53365237,0.00029192455,0.00017933329,0.00018408606,0.00045925786,0.0002973069,0.027530985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997898,0.0000721682,0.000012844476,0.000024194585,0.00006910212,0.000031841635],"domain_scores_gemma":[0.999846,0.00008783008,0.00001446739,0.000022562286,0.000023702149,0.0000055086152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002546296,0.00051431597,0.00025361223,0.000472191,0.00028285457,0.00056765776,0.00036165814,0.00028927557,0.0129476115],"category_scores_gemma":[0.0006706617,0.0002776302,0.0002472303,0.0004674169,0.00019250922,0.00083422015,0.00039148045,0.00032199905,0.0018088889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001414392,0.00008786369,0.0010555882,0.0005581573,0.0000719383,0.00022396355,0.00017355352,0.16102938,0.07332244,0.12133742,0.025881173,0.61484414],"study_design_scores_gemma":[0.0002880075,0.0011059745,0.0017946743,0.0002129484,0.00008370445,0.00065096153,0.00015029933,0.75073427,0.050925557,0.101517975,0.092473276,0.00006230159],"about_ca_topic_score_codex":0.0005392586,"about_ca_topic_score_gemma":0.002271667,"teacher_disagreement_score":0.0129476115,"about_ca_system_score_codex":0.00030241872,"about_ca_system_score_gemma":0.0003146575,"threshold_uncertainty_score":0.0433141},"labels":[],"label_agreement":null},{"id":"W2089966668","doi":"10.1145/1950413.1950484","title":"Regular fabric for regular FPGA (abstract only)","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Tile; Design for manufacturability; Computer science; Overhead (engineering); Routing (electronic design automation); Block (permutation group theory); Reduction (mathematics); Process (computing); Embedded system; Process variation; Computer hardware; Engineering; Electrical engineering; Mathematics; Materials science","score_opus":0.03177274203603166,"score_gpt":0.20736196025286913,"score_spread":0.17558921821683746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089966668","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12262239,0.0016951298,0.38064697,0.0011363846,0.0022024063,0.000725741,0.010348133,0.08004314,0.40057963],"genre_scores_gemma":[0.46486732,0.0010470412,0.22042009,0.0007957785,0.00031608075,0.00032162218,0.010188476,0.0074684145,0.2945752],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998542,0.000011807293,0.00001223953,0.00003128557,0.00007065942,0.000019724865],"domain_scores_gemma":[0.9997646,0.00003677914,0.000031233107,0.000108594315,0.000045289402,0.000013526367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000918638,0.00043508067,0.00015370699,0.0004349117,0.00022442259,0.0006028828,0.00035091615,0.00024178703,0.10351975],"category_scores_gemma":[0.00037430358,0.00018658976,0.00023966492,0.00030616426,0.00015750788,0.0003941457,0.00043431076,0.00026787864,0.028833922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004243254,0.00011908441,0.0021189824,0.0009822648,0.00003584118,0.0013410868,0.00015984556,0.0064975647,0.21432914,0.026045846,0.13805868,0.60988736],"study_design_scores_gemma":[0.000082753526,0.00041434533,0.0038060236,0.00009354033,0.000029868335,0.0024323985,0.00005322916,0.02323983,0.20063075,0.0056844326,0.7634964,0.000036405872],"about_ca_topic_score_codex":0.0002468419,"about_ca_topic_score_gemma":0.00058365864,"teacher_disagreement_score":0.10351975,"about_ca_system_score_codex":0.00018145771,"about_ca_system_score_gemma":0.00012342459,"threshold_uncertainty_score":0.34630805},"labels":[],"label_agreement":null},{"id":"W2090857935","doi":"10.5555/2840819.2840891","title":"High Performance Global Placement and Legalization Accounting for Fence Regions","year":2015,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Legalization; Fence (mathematics); Heuristic; Computer science; Routing (electronic design automation); CONTEST; Process (computing); Placement; Engineering; Artificial intelligence; Physical design; Embedded system; Circuit design; Structural engineering","score_opus":0.08343816140693223,"score_gpt":0.2823405100214152,"score_spread":0.19890234861448297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090857935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07816679,0.00030294163,0.9057344,0.0001808785,0.00006060959,0.00005656071,0.00012652318,0.0021275727,0.013243669],"genre_scores_gemma":[0.6946183,0.00024826505,0.29810128,0.00007296968,0.000032391617,0.000052673997,0.00028025996,0.00050102617,0.0060928375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994491,0.0001025257,0.000021152955,0.000113083166,0.0002008679,0.000113168826],"domain_scores_gemma":[0.9987091,0.00044231367,0.00015265017,0.0003891577,0.00024576474,0.00006110192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008708004,0.0007417766,0.0008635918,0.0006293746,0.000709112,0.0011224294,0.0011781759,0.00058148446,0.0048705963],"category_scores_gemma":[0.0029034158,0.00032289824,0.00050223066,0.00096974784,0.0007649048,0.0013437611,0.0010663286,0.0007098909,0.00048508254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071528244,0.000032046755,0.0010091955,0.00006267955,0.000015014112,0.00015179283,0.00007255813,0.9021313,0.006638251,0.018436976,0.0025044542,0.068874165],"study_design_scores_gemma":[0.000010868317,0.000046706195,0.00021890181,0.00000686031,0.000009051371,0.000067714194,0.000030765634,0.9864892,0.0042630387,0.00721332,0.0016379516,0.00000572577],"about_ca_topic_score_codex":0.007112109,"about_ca_topic_score_gemma":0.015561804,"teacher_disagreement_score":0.007112109,"about_ca_system_score_codex":0.0012867202,"about_ca_system_score_gemma":0.0021314998,"threshold_uncertainty_score":0.016293764},"labels":[],"label_agreement":null},{"id":"W2091956800","doi":"10.1109/fpt.2011.6132691","title":"Exploring FPGA technology mapping for fracturable LUT minimization","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lookup table; Field-programmable gate array; Computer science; Enhanced Data Rates for GSM Evolution; Minification; Reduction (mathematics); Computer architecture; Computer hardware; Embedded system; Parallel computing; Computer engineering; Telecommunications; Mathematics; Operating system","score_opus":0.14925025844105103,"score_gpt":0.21918307299999418,"score_spread":0.06993281455894315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091956800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6047955,0.001158595,0.3694039,0.0003171261,0.000036849946,0.000084572515,0.00009806225,0.0011597911,0.02294557],"genre_scores_gemma":[0.86792827,0.0003268699,0.12905096,0.00005961639,0.000012154479,0.000047132617,0.000117280586,0.00006621369,0.0023916068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986184,0.000039799823,0.000007734305,0.00001901805,0.000045706944,0.000025947511],"domain_scores_gemma":[0.99973243,0.00011593458,0.000048756152,0.000051916053,0.000042360563,0.000008707093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017474683,0.00042103473,0.00015468945,0.0004530609,0.0001987087,0.00036125912,0.00042736676,0.00018950028,0.0026747559],"category_scores_gemma":[0.0008556528,0.00011754491,0.00015365423,0.0005005224,0.00013421176,0.0006259677,0.00029252685,0.00016107898,0.00033276188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028445036,0.0001787182,0.004578704,0.00028073852,0.000037944403,0.000470245,0.00021955499,0.22021163,0.18298213,0.018700505,0.0026606976,0.5693947],"study_design_scores_gemma":[0.00007093999,0.0009236238,0.0046863304,0.000055655313,0.00007123225,0.0010072269,0.00037737886,0.79037696,0.16370985,0.018456308,0.02023189,0.00003265059],"about_ca_topic_score_codex":0.00040748494,"about_ca_topic_score_gemma":0.0014366754,"teacher_disagreement_score":0.0026747559,"about_ca_system_score_codex":0.00019690808,"about_ca_system_score_gemma":0.00034079078,"threshold_uncertainty_score":0.0089479685},"labels":[],"label_agreement":null},{"id":"W2093426958","doi":"10.1587/transinf.e96.d.1602","title":"FPGA Design Framework Combined with Commercial VLSI CAD","year":2013,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Tokyo; Synopsys","keywords":"Field-programmable gate array; Computer science; Routing (electronic design automation); Bitstream; Embedded system; FPGA prototype; Very-large-scale integration; Code (set theory); Computer hardware; Computer architecture; Decoding methods; Set (abstract data type); Algorithm; Programming language","score_opus":0.012897559675903817,"score_gpt":0.2032000263192102,"score_spread":0.19030246664330638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093426958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004364162,0.00048779423,0.9334045,0.00009344108,0.00009519321,0.0003081461,0.0009903125,0.022118587,0.038137905],"genre_scores_gemma":[0.07268306,0.000591777,0.8959968,0.00020612552,0.000052790852,0.0006983461,0.0040535294,0.0024129122,0.023304706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996507,0.000044174652,0.000023251427,0.0000429898,0.00018795105,0.000050908227],"domain_scores_gemma":[0.99975246,0.00004943736,0.000018190804,0.000046769273,0.00011817598,0.0000148732615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038284736,0.0009619174,0.00042463845,0.00096601906,0.00024459866,0.0007276776,0.0015922496,0.00045557946,0.029586641],"category_scores_gemma":[0.00061004004,0.00038085543,0.00065206224,0.0005977437,0.00017354033,0.00047669717,0.00037438262,0.00070038764,0.009722051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032675941,0.00014993231,0.0011811143,0.0012164935,0.00011305348,0.0008802805,0.0001920077,0.12551261,0.076852545,0.08593578,0.09058653,0.61705285],"study_design_scores_gemma":[0.00028027568,0.0004099965,0.0010740203,0.00013820665,0.00008231567,0.0015376973,0.00003854487,0.34257734,0.06847996,0.0119625395,0.5733172,0.0001018658],"about_ca_topic_score_codex":0.0026259306,"about_ca_topic_score_gemma":0.0031196733,"teacher_disagreement_score":0.029586641,"about_ca_system_score_codex":0.0005741516,"about_ca_system_score_gemma":0.0009814402,"threshold_uncertainty_score":0.09897721},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018045668936119946,"score_gpt":0.23193278232559508,"score_spread":0.21388711338947514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094806828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006270541,0.000111194895,0.9904643,0.00004706564,0.00003880652,0.000028893339,0.000021688395,0.0005995815,0.0024178962],"genre_scores_gemma":[0.17056227,0.00024147268,0.82493854,0.00008005762,0.000029299856,0.00010085094,0.00012144671,0.00019469418,0.0037313148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997366,0.0000645966,0.000012412214,0.000035683024,0.00013068225,0.000019969344],"domain_scores_gemma":[0.9997669,0.00009646826,0.000028242775,0.000040748448,0.000058809695,0.000008840441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023611757,0.00044435877,0.00030951173,0.00032199846,0.0003047199,0.00033267023,0.0005687331,0.00040463865,0.0027030164],"category_scores_gemma":[0.0007777928,0.00029477046,0.00036365283,0.00028534405,0.0002559864,0.000368813,0.00031103514,0.0005106355,0.00063671893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080640595,0.000032591688,0.00039289752,0.00016583849,0.000045840876,0.00009775274,0.00006455131,0.7263219,0.038160596,0.03830589,0.0022743633,0.19405717],"study_design_scores_gemma":[0.000021662225,0.00007694404,0.0002316831,0.000014717273,0.000012588555,0.00010473574,0.000012236682,0.9634789,0.0128812175,0.011598986,0.011554261,0.000012202619],"about_ca_topic_score_codex":0.0012812805,"about_ca_topic_score_gemma":0.0026690506,"teacher_disagreement_score":0.0027030164,"about_ca_system_score_codex":0.0006114312,"about_ca_system_score_gemma":0.0006479612,"threshold_uncertainty_score":0.009042501},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Transistor; Computer science; Sizing; Process (computing); Routing (electronic design automation); Electronic engineering; Embedded system; Engineering; Electrical engineering; Voltage","score_opus":0.007361591502590679,"score_gpt":0.19508584108261845,"score_spread":0.18772424958002776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095258817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017329756,0.00033348383,0.9599662,0.00011162733,0.000045319943,0.00008219548,0.00070355594,0.016182514,0.0052452846],"genre_scores_gemma":[0.24161245,0.0003204039,0.74846554,0.00015594212,0.00003280166,0.00026356586,0.0015378551,0.0030385265,0.004572878],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996728,0.000056557772,0.000020110714,0.00004158117,0.0001795141,0.000029526434],"domain_scores_gemma":[0.9989336,0.0006776461,0.00008634724,0.00014215075,0.00013954977,0.00002073846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041382216,0.00109779,0.00048184008,0.0008238731,0.00032193062,0.00076725066,0.0010162246,0.00042986503,0.01004956],"category_scores_gemma":[0.0020483688,0.000512658,0.0007125499,0.0004264891,0.00028628524,0.0009792639,0.00051097217,0.0005444,0.0011825727],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024004639,0.000064641565,0.003429114,0.00063951476,0.00011717528,0.00033591953,0.0002181088,0.42295143,0.050655138,0.02215437,0.026815651,0.47237888],"study_design_scores_gemma":[0.000056548877,0.00008286415,0.00073165586,0.000049385784,0.000023761999,0.00021653928,0.000031679145,0.9456673,0.0222544,0.008811679,0.022042353,0.000031911597],"about_ca_topic_score_codex":0.002177645,"about_ca_topic_score_gemma":0.0068078605,"teacher_disagreement_score":0.01004956,"about_ca_system_score_codex":0.0005512757,"about_ca_system_score_gemma":0.0009238374,"threshold_uncertainty_score":0.033619106},"labels":[],"label_agreement":null},{"id":"W2095574503","doi":"10.1109/tvlsi.2005.848817","title":"A novel FPGA architecture supporting wide, shallow memories","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Benchmark (surveying); Computer science; Architecture; Embedded system; Gate array; Computer architecture; Computer hardware; Parallel computing; Memory architecture","score_opus":0.01038495027989584,"score_gpt":0.22683062754143285,"score_spread":0.21644567726153702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095574503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33252144,0.0030833725,0.6133303,0.0004543204,0.0004487641,0.00019688485,0.0003014015,0.0057216114,0.043941908],"genre_scores_gemma":[0.7734269,0.0006241282,0.21639843,0.00021340928,0.00008151372,0.00006828605,0.00025948102,0.00004696545,0.008880888],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999192,0.000008422502,0.0000056595104,0.00001716019,0.000024166144,0.000025406896],"domain_scores_gemma":[0.9999064,0.000015919979,0.000013225821,0.000020351867,0.00002832862,0.000015652104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007652821,0.00026036138,0.00018000534,0.00029038583,0.00021542747,0.00051906955,0.0009119179,0.00027688238,0.002794818],"category_scores_gemma":[0.00015586952,0.00014494018,0.00013519386,0.00028677014,0.0001407911,0.0007452953,0.0003039878,0.0002874961,0.0007395976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068368966,0.0001388337,0.0024474785,0.0004759253,0.00006980137,0.0009659695,0.00013517666,0.017820759,0.50329065,0.033041768,0.010690629,0.43023938],"study_design_scores_gemma":[0.000540297,0.0040406515,0.0059953253,0.00017773753,0.00031539527,0.0054286453,0.00017913495,0.3368226,0.47995162,0.013024,0.15337618,0.00014845018],"about_ca_topic_score_codex":0.00047898365,"about_ca_topic_score_gemma":0.0013857313,"teacher_disagreement_score":0.002794818,"about_ca_system_score_codex":0.00024525792,"about_ca_system_score_gemma":0.00035268968,"threshold_uncertainty_score":0.009349644},"labels":[],"label_agreement":null},{"id":"W2095954771","doi":"10.1109/fpl.2010.17","title":"Parallelizing Simulated Annealing-Based Placement Using GPGPU","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; General-purpose computing on graphics processing units; Simulated annealing; Parallel computing; Graphics; Field-programmable gate array; Graphics processing unit; Computer architecture; Embedded system; Algorithm; Computer graphics (images)","score_opus":0.016375412988447066,"score_gpt":0.24595474976537712,"score_spread":0.22957933677693004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095954771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04721755,0.00021252589,0.9423634,0.00019525492,0.00010261146,0.0001432364,0.000051668078,0.0028536764,0.0068600797],"genre_scores_gemma":[0.37841937,0.00018432403,0.61773163,0.00009143891,0.000031100735,0.0001887072,0.00014534069,0.00028287002,0.0029252921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969864,0.00009003668,0.000014369163,0.000054385688,0.00010533916,0.000037228005],"domain_scores_gemma":[0.9995974,0.00015575808,0.000033525765,0.00010838993,0.000087349705,0.00001770639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041382705,0.0006102645,0.00075869134,0.0005044982,0.0004623245,0.00060456817,0.0008127429,0.00080697244,0.0018761131],"category_scores_gemma":[0.0011760158,0.00046672902,0.0005442602,0.0007940642,0.00049131823,0.0004597113,0.0006637163,0.0008184454,0.00059766026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053210602,0.000038789512,0.0002473729,0.000043809057,0.00002679831,0.000059256872,0.00004313509,0.9416308,0.010173859,0.003504237,0.0009836676,0.043195132],"study_design_scores_gemma":[0.000015942363,0.000028033402,0.000063656254,0.0000021236017,0.000004281754,0.000017376631,0.0000074101476,0.99334854,0.0031562,0.0018730207,0.0014793819,0.0000040437203],"about_ca_topic_score_codex":0.0046136957,"about_ca_topic_score_gemma":0.006020542,"teacher_disagreement_score":0.0046136957,"about_ca_system_score_codex":0.00077276974,"about_ca_system_score_gemma":0.001033107,"threshold_uncertainty_score":0.009173691},"labels":[],"label_agreement":null},{"id":"W2096185144","doi":"10.1145/774572.774683","title":"Incremental placement for layout driven optimizations on FPGAs","year":2002,"lang":"en","type":"article","venue":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Computer architecture; Embedded system","score_opus":0.06623920370334359,"score_gpt":0.28090486888024707,"score_spread":0.2146656651769035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096185144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040252704,0.00048051303,0.948459,0.000107182546,0.00006858715,0.00009003529,0.000084190666,0.0042660246,0.0061917244],"genre_scores_gemma":[0.37801304,0.00034271568,0.61670274,0.00009403431,0.00004935743,0.00011778717,0.0003465249,0.00038789428,0.0039459406],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978334,0.000041131156,0.000009759337,0.00003088482,0.00009988272,0.00003499075],"domain_scores_gemma":[0.99980634,0.000074884236,0.000022305627,0.000052453357,0.00003631329,0.000007721266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018477981,0.00064964255,0.0003383534,0.00056954974,0.0003460315,0.00039960546,0.0007819989,0.000269576,0.0037706227],"category_scores_gemma":[0.00071243447,0.00030109135,0.0002955322,0.00046904467,0.00026554556,0.0006138442,0.00051719084,0.00042354042,0.00066986866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003298286,0.00006969388,0.0009758976,0.00018922714,0.00004258888,0.00025255443,0.00010152419,0.33469668,0.059821494,0.021830935,0.006132603,0.57555705],"study_design_scores_gemma":[0.00009634846,0.00025024492,0.0007258708,0.000027944767,0.000047501573,0.00026899466,0.00006109947,0.91626686,0.0426825,0.020366512,0.01918192,0.000024223837],"about_ca_topic_score_codex":0.0016048973,"about_ca_topic_score_gemma":0.0042337077,"teacher_disagreement_score":0.0037706227,"about_ca_system_score_codex":0.00047328416,"about_ca_system_score_gemma":0.00046334454,"threshold_uncertainty_score":0.012613952},"labels":[],"label_agreement":null},{"id":"W2097448746","doi":"10.1109/ccece.1997.614778","title":"Circuit clustering and its effects on a multi-way circuit partitioning heuristic","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristic; Cluster analysis; Computer science; Phase (matter); Algorithm; Artificial intelligence; Physics","score_opus":0.03627549572137415,"score_gpt":0.21638120732653668,"score_spread":0.18010571160516253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097448746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286169,0.0008444967,0.35844833,0.0004454465,0.00007397485,0.00013814299,0.000053720163,0.00063262426,0.010746369],"genre_scores_gemma":[0.9178212,0.000115677525,0.08109176,0.000050398314,0.0000103733555,0.000043958065,0.00003812116,0.0000622757,0.0007662662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00021729262,0.000017059128,0.000046883382,0.00012662738,0.0000854338],"domain_scores_gemma":[0.996523,0.0024471516,0.00023578439,0.0003591352,0.0003175208,0.00011736198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980513,0.0005459571,0.00045668165,0.00073429226,0.00065629714,0.0005835518,0.00076939265,0.0006911607,0.0015108063],"category_scores_gemma":[0.0052007386,0.0003259789,0.00032862904,0.0006898465,0.0005428334,0.00077404664,0.00049596524,0.00044125065,0.00016139568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025985483,0.00011199979,0.0015403006,0.00008619715,0.0000413157,0.00010675604,0.000088792665,0.91900903,0.013357863,0.008277159,0.00065530447,0.056465372],"study_design_scores_gemma":[0.00005686061,0.00025845855,0.000929833,0.0000113998,0.000038516217,0.00012341986,0.000058732232,0.98540896,0.0092679905,0.0030736856,0.00075394224,0.000018191067],"about_ca_topic_score_codex":0.0022220416,"about_ca_topic_score_gemma":0.0038751608,"teacher_disagreement_score":0.0022220416,"about_ca_system_score_codex":0.00082929124,"about_ca_system_score_gemma":0.00058973185,"threshold_uncertainty_score":0.0060169697},"labels":[],"label_agreement":null},{"id":"W2097646901","doi":"10.1080/00207540500031980","title":"A practical exact algorithm for the shortest loop design problem in a block layout","year":2005,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Solver; Block (permutation group theory); Integer programming; Scheme (mathematics); Loop (graph theory); Mathematical optimization; Linear programming; Computer science; Simple (philosophy); Algorithm; Mathematics; Combinatorics","score_opus":0.14603698237724172,"score_gpt":0.42884330365835266,"score_spread":0.28280632128111094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097646901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014036631,0.00012494264,0.9767362,0.00017793225,0.000022646995,0.00013131391,0.00016405711,0.0016252168,0.0069810334],"genre_scores_gemma":[0.11667133,0.00011986878,0.87832314,0.000066887886,0.00002323204,0.00023119527,0.0004704964,0.00024113915,0.003852645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00008663357,0.000014796005,0.00007727566,0.0000949178,0.00008338607],"domain_scores_gemma":[0.9994655,0.0003497948,0.000039761933,0.00005328621,0.00006522732,0.000026463804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005133748,0.0008784542,0.00077774614,0.00063928374,0.0005190535,0.001072532,0.0010194227,0.0009054353,0.019053502],"category_scores_gemma":[0.0014440906,0.00049205875,0.00051986997,0.0009918701,0.0004576982,0.0011637582,0.00091191137,0.0008504089,0.0027041184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029613904,0.00021353469,0.0005472565,0.00039549422,0.000030568142,0.00016657733,0.0001729486,0.5807092,0.009523193,0.03290875,0.011273934,0.36376235],"study_design_scores_gemma":[0.00020419067,0.000116303185,0.00013008257,0.000019907075,0.000010730688,0.00007533529,0.00006450643,0.9697833,0.0018663224,0.022234026,0.005486059,0.000009252583],"about_ca_topic_score_codex":0.0042170472,"about_ca_topic_score_gemma":0.0068211374,"teacher_disagreement_score":0.019053502,"about_ca_system_score_codex":0.00087183696,"about_ca_system_score_gemma":0.0017198103,"threshold_uncertainty_score":0.06374025},"labels":[],"label_agreement":null},{"id":"W2097683623","doi":"10.1145/2554688.2554788","title":"Optimizing effective interconnect capacitance for FPGA power reduction","year":2014,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Capacitance; Reduction (mathematics); Interconnection; Field-programmable gate array; Power (physics); Materials science; Electronic engineering; Electrical engineering; Optoelectronics; Computer science; Embedded system; Engineering; Physics; Telecommunications; Electrode","score_opus":0.006285665850792426,"score_gpt":0.20946049749945667,"score_spread":0.20317483164866423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097683623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28949472,0.0026968038,0.6814386,0.0007354996,0.00012392752,0.00008878822,0.00020447902,0.0022261695,0.022991018],"genre_scores_gemma":[0.8702255,0.0006269519,0.124749,0.00011472239,0.000043739234,0.00003642469,0.00009721944,0.00016157016,0.003944886],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998331,0.000017790688,0.0000081885755,0.000030198284,0.00007361521,0.000037052254],"domain_scores_gemma":[0.9997384,0.000067645604,0.000076667864,0.000034538367,0.00006850091,0.000014274494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014770897,0.00061964756,0.00020713126,0.0005995687,0.00032899049,0.0006153261,0.0006442791,0.00029542035,0.002302569],"category_scores_gemma":[0.0005755792,0.00018250316,0.00017474299,0.00072979886,0.00022979728,0.0009188674,0.00029257342,0.0002911998,0.00048052252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014273384,0.00014184475,0.0015504949,0.00028803977,0.000051806604,0.0002176784,0.00007889942,0.16082199,0.66187906,0.014477065,0.0027934287,0.15755695],"study_design_scores_gemma":[0.000079708334,0.0008832594,0.0022063605,0.000033294367,0.00009811794,0.00063802034,0.000058204405,0.57401806,0.39683947,0.0047004875,0.02038754,0.000057477937],"about_ca_topic_score_codex":0.00081875944,"about_ca_topic_score_gemma":0.0029002386,"teacher_disagreement_score":0.002302569,"about_ca_system_score_codex":0.0007220811,"about_ca_system_score_gemma":0.0006078783,"threshold_uncertainty_score":0.0077028275},"labels":[],"label_agreement":null},{"id":"W2099587669","doi":"10.1109/glsv.1992.218354","title":"A systematic approach for designing systolic arrays","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dependency (UML); Transformation (genetics); Matrix (chemical analysis); Integer (computer science); Inverse; Computer science; Algorithm; Rank (graph theory); Square matrix; Mathematics; Theoretical computer science; Mathematical optimization; Discrete mathematics; Algebra over a field; Combinatorics; Artificial intelligence; Symmetric matrix; Pure mathematics; Programming language; Eigenvalues and eigenvectors","score_opus":0.018095632150632122,"score_gpt":0.2069893053875768,"score_spread":0.18889367323694467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099587669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023851972,0.00018992733,0.9920691,0.0000919503,0.000039620532,0.00013109254,0.000037667258,0.00060312514,0.0044521997],"genre_scores_gemma":[0.028201101,0.00040960344,0.9680467,0.00012687373,0.000027237384,0.00027475643,0.00011281058,0.00008283616,0.0027179923],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943453,0.0001388791,0.000053783762,0.00007804891,0.00025723653,0.000037603237],"domain_scores_gemma":[0.99958545,0.00008673398,0.000038189148,0.00010914585,0.00016477167,0.000015799062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496914,0.0006150778,0.0003295295,0.0008505086,0.0006416518,0.0010184296,0.0010077116,0.0004993489,0.0029951902],"category_scores_gemma":[0.0011319418,0.00047054444,0.00062135316,0.0009458799,0.00083468336,0.0007778161,0.0007767551,0.0010376554,0.0016183817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434471,0.00016773962,0.0007948151,0.0006638006,0.00009918248,0.0002618843,0.0005207983,0.061871804,0.08745835,0.26772267,0.009119868,0.57123476],"study_design_scores_gemma":[0.00017022184,0.000980229,0.0008101982,0.00034539044,0.00014681333,0.0012704065,0.00033815968,0.3627089,0.115663886,0.24010155,0.27734643,0.00011776223],"about_ca_topic_score_codex":0.0006077955,"about_ca_topic_score_gemma":0.001495414,"teacher_disagreement_score":0.0029951902,"about_ca_system_score_codex":0.00044640794,"about_ca_system_score_gemma":0.0015185486,"threshold_uncertainty_score":0.010019898},"labels":[],"label_agreement":null},{"id":"W2100201259","doi":"10.1109/icm.2008.5393533","title":"Placement algorithm for multiplier-based FPGA circuits","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Computer science; Routing (electronic design automation); Greedy algorithm; Pipeline (software); Multiplier (economics); Power consumption; Reduction (mathematics); Algorithm; Electronic circuit; Integer programming; Interconnection; Network routing; Power (physics); Embedded system; Mathematics; Telecommunications; Engineering","score_opus":0.02650386566117851,"score_gpt":0.2279425466022554,"score_spread":0.2014386809410769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100201259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047706557,0.000101355254,0.9915838,0.000058707377,0.00003950285,0.000081374616,0.00004343872,0.00072016614,0.0026010529],"genre_scores_gemma":[0.05978209,0.00017758159,0.9350838,0.000048799557,0.000029712657,0.00017036714,0.00016069759,0.00009684472,0.0044499994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999803,0.000038579226,0.000015093814,0.000035708683,0.00008693681,0.000020741649],"domain_scores_gemma":[0.9998828,0.000029287334,0.000016705733,0.000015912743,0.000049728103,0.0000056316635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023886465,0.0006438921,0.00037868373,0.0005967239,0.0004975999,0.0005579729,0.0008540225,0.00061023625,0.005623056],"category_scores_gemma":[0.000626992,0.00030480183,0.00028348065,0.00070165534,0.00023907928,0.0004019829,0.0004563318,0.00038278586,0.0019572247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016750985,0.000044469707,0.00044264432,0.0001971863,0.000036618003,0.00019712256,0.00012651566,0.301525,0.04067896,0.028012585,0.009673124,0.6188982],"study_design_scores_gemma":[0.0000920247,0.00019027454,0.00029112515,0.000028852523,0.000020621304,0.00033453348,0.00004576738,0.94709414,0.01688281,0.012731156,0.022268977,0.000019710867],"about_ca_topic_score_codex":0.0013591315,"about_ca_topic_score_gemma":0.0023758453,"teacher_disagreement_score":0.005623056,"about_ca_system_score_codex":0.0005330472,"about_ca_system_score_gemma":0.00075228827,"threshold_uncertainty_score":0.018810928},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012069945974130214,"score_gpt":0.22692480863411527,"score_spread":0.21485486265998505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100412947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024520854,0.00025491236,0.9664715,0.00019833256,0.000074027186,0.00007120986,0.00002591862,0.003322762,0.0050605563],"genre_scores_gemma":[0.25286967,0.00018227349,0.74364614,0.000066651985,0.00002495667,0.00021936596,0.000049634447,0.00028397408,0.0026573688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996939,0.00013735659,0.0000103690945,0.00002418862,0.000113165566,0.000021037935],"domain_scores_gemma":[0.99947137,0.00030142037,0.00004214101,0.00008355227,0.00008709473,0.00001444755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055510097,0.00051518664,0.00034311073,0.00035042036,0.00028960838,0.00038319826,0.000541867,0.0006335739,0.0031414814],"category_scores_gemma":[0.0015428029,0.00039300867,0.00035098442,0.000460661,0.00037796694,0.00028121244,0.00041723665,0.0007038021,0.00052916084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012535023,0.00003266652,0.00042338838,0.00012281312,0.000042039796,0.00008169618,0.00011337416,0.84983176,0.025472602,0.016972441,0.0016203165,0.10516151],"study_design_scores_gemma":[0.000018695588,0.00003921921,0.00008837738,0.000005162916,0.0000062904837,0.000019810437,0.0000065043173,0.98918355,0.00552341,0.0021285089,0.0029756837,0.0000047835942],"about_ca_topic_score_codex":0.0015360613,"about_ca_topic_score_gemma":0.002555426,"teacher_disagreement_score":0.0031414814,"about_ca_system_score_codex":0.0004941737,"about_ca_system_score_gemma":0.00064448727,"threshold_uncertainty_score":0.010509312},"labels":[],"label_agreement":null},{"id":"W2100746765","doi":"10.1109/mwscas.1992.271293","title":"A pipelined VLSI arithmetic architecture","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"National Center for Theoretical Sciences","keywords":"Very-large-scale integration; Computer science; Arithmetic; Parallel computing; Architecture; Tree (set theory); Binary tree; Reduction (mathematics); Pyramid (geometry); Computer architecture; Theoretical computer science; Algorithm; Embedded system; Mathematics","score_opus":0.004954174108534439,"score_gpt":0.17769906845361663,"score_spread":0.1727448943450822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100746765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046832327,0.0012176086,0.8960178,0.0004476447,0.00027741597,0.00016142013,0.0007770884,0.0057954127,0.04847336],"genre_scores_gemma":[0.4542061,0.00094419904,0.52281386,0.00034611864,0.00011625597,0.00014880317,0.0008652455,0.00011289589,0.020446526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990296,0.000009810487,0.000007062241,0.00002721954,0.00003843713,0.000014609417],"domain_scores_gemma":[0.9999279,0.000010195341,0.000007314563,0.000017169883,0.000029318835,0.000008138162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076565,0.0002411399,0.00016498378,0.00034059898,0.00027957134,0.0006193946,0.0006801653,0.00031595337,0.007473716],"category_scores_gemma":[0.00021153956,0.00019593851,0.00028765708,0.000497524,0.00019090399,0.0007255549,0.00032325584,0.00033900546,0.0018543343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024058734,0.0000685481,0.0010069717,0.0004415349,0.000055033055,0.00043439283,0.00012416056,0.05142352,0.26466972,0.14524545,0.017979762,0.51831037],"study_design_scores_gemma":[0.00014984678,0.0009599138,0.0017549607,0.00009660001,0.00014524895,0.0025093453,0.000055909768,0.5586618,0.11600805,0.06334234,0.256229,0.00008696186],"about_ca_topic_score_codex":0.0009989352,"about_ca_topic_score_gemma":0.0013966111,"teacher_disagreement_score":0.007473716,"about_ca_system_score_codex":0.00040997643,"about_ca_system_score_gemma":0.00067618914,"threshold_uncertainty_score":0.025002062},"labels":[],"label_agreement":null},{"id":"W2100873809","doi":"10.1109/ccece.2002.1013007","title":"Netlist partitioning for FPGA-based run-time reconfiguration","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Netlist; Computer science; Control reconfiguration; Field-programmable gate array; Embedded system; Reconfigurable computing; Computer architecture; Flexibility (engineering); Graph partition; Parallel computing; Graph; Distributed computing; Theoretical computer science","score_opus":0.012510482958629133,"score_gpt":0.20796417693032182,"score_spread":0.19545369397169268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100873809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1568608,0.0011084932,0.82460934,0.00014277892,0.000099047895,0.00014596872,0.000114783004,0.0035698123,0.013349009],"genre_scores_gemma":[0.6162318,0.00035597966,0.3789836,0.000078995276,0.000035338577,0.00010102647,0.00024680974,0.00022074945,0.0037457417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998487,0.000053677464,0.000008659864,0.00002014351,0.000047421043,0.000021274811],"domain_scores_gemma":[0.9997063,0.00015365571,0.000037006736,0.000052024425,0.00003758879,0.000013373546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001753569,0.00042780535,0.0001718253,0.00054365175,0.00024745314,0.00027978572,0.00038312539,0.0001754902,0.002739278],"category_scores_gemma":[0.00059017097,0.0001249933,0.00015909839,0.00032556773,0.00015968991,0.00042727776,0.0001788819,0.00021719997,0.0005865853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004674906,0.000100973295,0.0009135667,0.0002556974,0.00004200199,0.0003705678,0.000116973555,0.21173356,0.22398418,0.012122523,0.0025954554,0.54729706],"study_design_scores_gemma":[0.00011895718,0.0007450041,0.0024178303,0.00005590052,0.0000791705,0.00069112016,0.000054944085,0.7810963,0.17612815,0.010614168,0.027959943,0.00003849281],"about_ca_topic_score_codex":0.0007926872,"about_ca_topic_score_gemma":0.0021245123,"teacher_disagreement_score":0.002739278,"about_ca_system_score_codex":0.00030028867,"about_ca_system_score_gemma":0.00025859056,"threshold_uncertainty_score":0.009163797},"labels":[],"label_agreement":null},{"id":"W2100925048","doi":"10.5555/1129601.1129661","title":"Efficient analog platform characterization through analog constraint graphs","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Heuristics; Theoretical computer science; Executable; Bipartite graph; Analogue electronics; Leverage (statistics); Algorithm; Graph; Mathematical optimization; Electronic circuit; Mathematics; Artificial intelligence","score_opus":0.01363342740386932,"score_gpt":0.21743983049134,"score_spread":0.20380640308747067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100925048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008735824,0.000018730116,0.9891796,0.000039590366,0.0000035636497,0.000044927827,0.000085327585,0.0006168238,0.0012756306],"genre_scores_gemma":[0.32843637,0.00010303186,0.6683537,0.000070728864,0.000010767881,0.00026371639,0.0006099745,0.00035115908,0.0018005724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.00033899417,0.000055176573,0.0001442403,0.00044134984,0.00007201042],"domain_scores_gemma":[0.9982482,0.0008956937,0.00017625275,0.0004248913,0.00023141931,0.000023513929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071781396,0.0007646406,0.00054478465,0.0009117285,0.00042067046,0.001008062,0.0010198866,0.00047670378,0.0039928965],"category_scores_gemma":[0.00388546,0.00037853216,0.0006733018,0.0007935053,0.0007807602,0.0013203858,0.00080999586,0.00090964994,0.0005352461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009045889,0.00006337292,0.0006289214,0.00014768832,0.000030285952,0.00015628197,0.00013119733,0.74164486,0.019637607,0.086247034,0.0014005866,0.14982171],"study_design_scores_gemma":[0.000012289814,0.000023575603,0.00007645813,0.000009707849,0.0000065291442,0.000048720813,0.000018607447,0.95764554,0.013296071,0.026003748,0.002847358,0.000011373312],"about_ca_topic_score_codex":0.0026530798,"about_ca_topic_score_gemma":0.0038595172,"teacher_disagreement_score":0.0039928965,"about_ca_system_score_codex":0.0007071684,"about_ca_system_score_gemma":0.0012047368,"threshold_uncertainty_score":0.01335752},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; 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","score_opus":0.07563059520384806,"score_gpt":0.2878558569216994,"score_spread":0.21222526171785133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101356024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1112254,0.0011125136,0.87421364,0.00037711463,0.00006433811,0.00009054079,0.000035949022,0.0013667854,0.011513736],"genre_scores_gemma":[0.5626099,0.0010697693,0.42992344,0.00021655433,0.000042164298,0.00007364174,0.00008281161,0.00026143296,0.005720233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927276,0.00022089675,0.000033590582,0.00007985014,0.00034060766,0.000052380037],"domain_scores_gemma":[0.996777,0.0024946576,0.00015688321,0.00022418817,0.0003196955,0.000027695018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010666416,0.00065697957,0.00043729896,0.0007328877,0.0002813436,0.0013582432,0.00069582404,0.0005338503,0.002040835],"category_scores_gemma":[0.005966728,0.0004431549,0.00031759508,0.000600111,0.00032720133,0.0013146608,0.0003992036,0.00045419575,0.00037725235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002102778,0.00012328806,0.0027562778,0.000100876234,0.00006259081,0.00009796319,0.00007354799,0.55893177,0.016658578,0.012983127,0.00089381274,0.40710792],"study_design_scores_gemma":[0.000021430451,0.00010297276,0.0007238481,0.000012654112,0.000024141089,0.000072239054,0.000019808249,0.9858329,0.007523181,0.0034680536,0.0021880544,0.000010748022],"about_ca_topic_score_codex":0.002517048,"about_ca_topic_score_gemma":0.0068529886,"teacher_disagreement_score":0.002517048,"about_ca_system_score_codex":0.00061954686,"about_ca_system_score_gemma":0.000512369,"threshold_uncertainty_score":0.006827295},"labels":[],"label_agreement":null},{"id":"W2101442766","doi":"10.1109/tvlsi.2010.2076841","title":"Performance and Cost Tradeoffs in Metal-Programmable Structured ASICs (MPSAs)","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Application-specific integrated circuit; Notation; Computer science; Integrated circuit; Embedded system; Mathematics; Arithmetic; Operating system","score_opus":0.008960722417650318,"score_gpt":0.21234122466449126,"score_spread":0.20338050224684096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101442766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9505858,0.0036743933,0.02328382,0.0009472377,0.00010510409,0.000037204598,0.0003764048,0.0005048423,0.020485055],"genre_scores_gemma":[0.9893618,0.0006986571,0.007515061,0.00007400993,0.000033326898,0.000024353221,0.00011877719,0.00006414616,0.002109691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993863,0.0001238659,0.00002355794,0.0001207387,0.00023159212,0.00011390578],"domain_scores_gemma":[0.9989417,0.00048413157,0.0002018589,0.00010401107,0.00021273267,0.00005567667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056397036,0.0006275881,0.0003063114,0.0005345894,0.00033108288,0.0011508727,0.0006519563,0.00069205253,0.0023519928],"category_scores_gemma":[0.0016749989,0.00020525293,0.00024523665,0.0008396475,0.00035737635,0.0018547976,0.00034820635,0.00029180318,0.00047937236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001858822,0.0002857539,0.007626604,0.0007448981,0.00019294865,0.0008878762,0.0002563148,0.46968475,0.37532142,0.041506056,0.006710778,0.09492374],"study_design_scores_gemma":[0.00014139625,0.0038311263,0.008945475,0.00009452405,0.00026716827,0.0009975883,0.00041755495,0.69121003,0.25299612,0.022284325,0.018680274,0.0001343769],"about_ca_topic_score_codex":0.00086941506,"about_ca_topic_score_gemma":0.0015055507,"teacher_disagreement_score":0.0023519928,"about_ca_system_score_codex":0.00090972276,"about_ca_system_score_gemma":0.00031322142,"threshold_uncertainty_score":0.00786823},"labels":[],"label_agreement":null},{"id":"W2101693825","doi":"10.1109/ccece.2005.1557360","title":"Novel approaches to placement","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Planar graph; Planar; Theoretical computer science; Very-large-scale integration; Graph; Conjecture; Graph drawing; Electronic circuit; Computer engineering; Mathematics; Computer graphics (images)","score_opus":0.067253036083523,"score_gpt":0.19442043936652423,"score_spread":0.12716740328300125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101693825","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016218385,0.0029153086,0.9435959,0.0015488825,0.0009047144,0.000082798404,0.00008456821,0.00040817756,0.048837744],"genre_scores_gemma":[0.08299657,0.009194072,0.84291947,0.0014225933,0.0015358111,0.00038734887,0.0003029295,0.00034010704,0.060901057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864036,0.00026839037,0.00007144334,0.00033840246,0.0005759438,0.00010543418],"domain_scores_gemma":[0.99927837,0.0002208902,0.00006096825,0.00024548586,0.00014412087,0.000050138347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082688656,0.0013476285,0.00087230525,0.0015509718,0.0015982677,0.0030398373,0.0028966018,0.0021573408,0.016475243],"category_scores_gemma":[0.00231925,0.00084255397,0.0013072598,0.0019631782,0.0026844468,0.004214339,0.003838091,0.0031247209,0.006286145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029740799,0.000027790478,0.00011084338,0.00026481683,0.000024681209,0.00010362458,0.00016678455,0.018984685,0.002696333,0.8624832,0.007948246,0.1071593],"study_design_scores_gemma":[0.000040770363,0.000076054814,0.00009061299,0.00013875632,0.000029756864,0.0004701068,0.00012561606,0.06845008,0.002823751,0.6815353,0.24619083,0.000028413593],"about_ca_topic_score_codex":0.0008739338,"about_ca_topic_score_gemma":0.0020444307,"teacher_disagreement_score":0.016475243,"about_ca_system_score_codex":0.0016638815,"about_ca_system_score_gemma":0.0012258564,"threshold_uncertainty_score":0.055115163},"labels":[],"label_agreement":null},{"id":"W2102503881","doi":"10.1145/1950413.1950449","title":"An analytical model relating FPGA architecture parameters to routability","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Router; Block (permutation group theory); Computer science; Logic block; CAD; Channel (broadcasting); Embedded system; Parallel computing; Electronic engineering; Computer hardware; Engineering; Mathematics; Engineering drawing","score_opus":0.04758543518465032,"score_gpt":0.2551578394130092,"score_spread":0.20757240422835888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102503881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061482616,0.0010817618,0.8784022,0.0009796269,0.00006980446,0.000109035274,0.0007043594,0.0009366806,0.05623392],"genre_scores_gemma":[0.9014784,0.0025259797,0.061620545,0.00027412592,0.00009224514,0.00037440035,0.00045804944,0.00031203125,0.032864194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00008216991,0.000015938465,0.00007784968,0.0001568253,0.00007636643],"domain_scores_gemma":[0.99907196,0.0005005154,0.00011695022,0.00009206681,0.00019795737,0.000020517879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042399528,0.0008900651,0.0006398329,0.0010868603,0.00039617505,0.0010132954,0.0011029142,0.0013098596,0.0046409518],"category_scores_gemma":[0.0038194438,0.000650244,0.00065348006,0.0009613122,0.00063315645,0.0019204901,0.00043673886,0.00079206045,0.0016227367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014702759,0.000010399641,0.00020154398,0.00003139087,0.0000069074936,0.00006281471,0.00003301663,0.97686154,0.0023045961,0.015047286,0.00048621476,0.0049396334],"study_design_scores_gemma":[0.0000035831397,0.000013199732,0.00009194624,0.000007936333,0.000005927023,0.00003650657,0.000006075743,0.99392396,0.0004940578,0.004623449,0.0007882161,0.0000051554916],"about_ca_topic_score_codex":0.006500373,"about_ca_topic_score_gemma":0.0032807323,"teacher_disagreement_score":0.006500373,"about_ca_system_score_codex":0.0014240647,"about_ca_system_score_gemma":0.00077239284,"threshold_uncertainty_score":0.015525579},"labels":[],"label_agreement":null},{"id":"W2102704825","doi":"10.1109/tcad.2004.828124","title":"Area Optimization of Delay-Optimized Structures Using Intrinsic Constraint Graphs","year":2004,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sizing; Block (permutation group theory); Computer science; Mathematical optimization; Routing (electronic design automation); Similarity (geometry); Constraint (computer-aided design); Optimization problem; Relation (database); Algorithm; Mathematics; Data mining; Artificial intelligence","score_opus":0.030453359302128807,"score_gpt":0.22006195759192956,"score_spread":0.18960859828980076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102704825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025008276,0.00009801575,0.971907,0.00004218903,0.0000065142704,0.000035882415,0.00003945026,0.00015875456,0.0027039852],"genre_scores_gemma":[0.3753149,0.00030715304,0.62149704,0.000050432882,0.000014425555,0.0001830631,0.00018153459,0.00022224209,0.0022293231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.00013720772,0.000022051943,0.00006506515,0.0002459827,0.000036926638],"domain_scores_gemma":[0.9994696,0.0002871372,0.00008198094,0.000075755794,0.000075098695,0.00001046979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005921357,0.0005537091,0.00036877804,0.00050612114,0.00027182527,0.000576139,0.0007269353,0.0002970712,0.0013263242],"category_scores_gemma":[0.0014069029,0.00029786787,0.00053880515,0.0006248004,0.00041757105,0.001039631,0.00045371373,0.00055813964,0.00018239931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003088414,0.000034565448,0.00042697473,0.00010927828,0.000031743824,0.000045671495,0.00005163821,0.85031056,0.023832211,0.063605286,0.00046111664,0.06105999],"study_design_scores_gemma":[0.0000107509895,0.00006893313,0.00013374216,0.000008725286,0.00001727735,0.000037334667,0.000017047978,0.96507895,0.0147944745,0.016848795,0.0029764106,0.000007604561],"about_ca_topic_score_codex":0.0010829741,"about_ca_topic_score_gemma":0.0024490943,"teacher_disagreement_score":0.0013263242,"about_ca_system_score_codex":0.0008562979,"about_ca_system_score_gemma":0.0009485919,"threshold_uncertainty_score":0.00621289},"labels":[],"label_agreement":null},{"id":"W2102892811","doi":"10.1145/1462586.1462587","title":"Static and Dynamic Memory Footprint Reduction for FPGA Routing Algorithms","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Memory footprint; Field-programmable gate array; Policy-based routing; Multipath routing; Footprint; Distributed computing; Parallel computing; Embedded system; Routing protocol","score_opus":0.013504579150675147,"score_gpt":0.237491180714835,"score_spread":0.22398660156415984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102892811","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6121603,0.0048190444,0.36274946,0.0005452543,0.00011973553,0.0000839306,0.00020273519,0.0037463775,0.015573187],"genre_scores_gemma":[0.90839654,0.0005341478,0.088223666,0.00007358032,0.00003533393,0.00004853678,0.00015686134,0.0001666163,0.0023647654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00014790831,0.00004475742,0.00007340997,0.00024100108,0.000104545274],"domain_scores_gemma":[0.9984048,0.00066388154,0.00018580997,0.0005270777,0.00018536042,0.000033135722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053883187,0.00046792824,0.00032461807,0.00068355835,0.0004882028,0.0006089761,0.0011812955,0.0002916299,0.0025213137],"category_scores_gemma":[0.002640957,0.00018851199,0.00028350012,0.0007698558,0.00035057025,0.0016108496,0.00053177343,0.00034911177,0.00027466932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070322386,0.00022407556,0.004986461,0.00029709403,0.00008154673,0.00029157897,0.0002444852,0.18183061,0.08408249,0.024192365,0.0036614544,0.69940466],"study_design_scores_gemma":[0.00009185841,0.0008690389,0.0034749906,0.000063323605,0.00016055434,0.0008703822,0.00025063852,0.7960898,0.16730098,0.016638786,0.01413827,0.000051302843],"about_ca_topic_score_codex":0.0010152134,"about_ca_topic_score_gemma":0.0023336413,"teacher_disagreement_score":0.0025213137,"about_ca_system_score_codex":0.0007978433,"about_ca_system_score_gemma":0.0006342536,"threshold_uncertainty_score":0.008434594},"labels":[],"label_agreement":null},{"id":"W2103117726","doi":"10.1109/tvlsi.2005.859561","title":"Routing architecture optimizations for high-density embedded programmable IP cores","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Routing (electronic design automation); Logic block; Block (permutation group theory); Programmable logic array; Programmable logic device; Parallel computing; Channel (broadcasting); Computer science; Programmable Array Logic; Gate array; Logic gate; Simple programmable logic device; Block size; Square (algebra); Field-programmable gate array; Topology (electrical circuits); Logic synthesis; Computer hardware; Logic family; Embedded system; Engineering; Algorithm; Mathematics; Electrical engineering; Telecommunications; Key (lock); Geometry","score_opus":0.009668095962273072,"score_gpt":0.22336247586649963,"score_spread":0.21369437990422654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103117726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86442167,0.0009211144,0.1229758,0.0002127646,0.000033135948,0.000058603702,0.00011607837,0.0010540887,0.010206714],"genre_scores_gemma":[0.9499591,0.00022053425,0.04812471,0.000044790195,0.000010688719,0.00002758399,0.00014640913,0.00008672279,0.0013795608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985886,0.000031819487,0.000010139274,0.00002101217,0.000040906936,0.00003724345],"domain_scores_gemma":[0.9996848,0.00010089367,0.00007020203,0.000050741088,0.00007889993,0.000014539937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020061492,0.00041260044,0.00020708641,0.0003802619,0.00019618058,0.00033756162,0.00041088852,0.00021454891,0.0012531457],"category_scores_gemma":[0.0007433422,0.0002098485,0.00018106798,0.0004324682,0.00016043916,0.00059103285,0.00024542588,0.0002113434,0.00022185827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035050858,0.00013542117,0.003174335,0.0002269282,0.00007837502,0.0002678569,0.00007186686,0.6282482,0.22256954,0.008716216,0.0029503244,0.13321038],"study_design_scores_gemma":[0.00008039805,0.00052185485,0.0038934879,0.000016487824,0.000076258126,0.00030370452,0.00008128605,0.9159831,0.069865026,0.0040575857,0.005096553,0.000024254748],"about_ca_topic_score_codex":0.0008025186,"about_ca_topic_score_gemma":0.0032477335,"teacher_disagreement_score":0.0012531457,"about_ca_system_score_codex":0.00042788242,"about_ca_system_score_gemma":0.00041553695,"threshold_uncertainty_score":0.004192233},"labels":[],"label_agreement":null},{"id":"W2103312793","doi":"10.1109/cicc.1988.20785","title":"Constraint propagation and design interaction in an object orientated IC design environment","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Smalltalk; Constraint (computer-aided design); Local consistency; Computer science; Consistency (knowledge bases); Object (grammar); Object-oriented design; Object-oriented programming; Programming language; Theoretical computer science; Constraint satisfaction; Human–computer interaction; Artificial intelligence; Engineering","score_opus":0.025779655090000075,"score_gpt":0.22958206443403548,"score_spread":0.2038024093440354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103312793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001050887,0.0000622632,0.99517316,0.00005146838,0.00001108031,0.00003682207,0.000026214177,0.0008027197,0.002785506],"genre_scores_gemma":[0.030834932,0.0002802625,0.9626577,0.00009483838,0.00001654649,0.00018952714,0.00022781159,0.0005263318,0.0051719598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583226,0.0013024076,0.00029065128,0.00044448808,0.0018435471,0.00028659854],"domain_scores_gemma":[0.99795204,0.0011379851,0.00014725272,0.00041011418,0.00028036794,0.000072238494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028853896,0.001172622,0.0006177512,0.0011430003,0.0011178177,0.0040534353,0.0024272464,0.0014247958,0.006805404],"category_scores_gemma":[0.0053021763,0.0010569632,0.001037859,0.001512262,0.002363017,0.0033056554,0.0024136398,0.0021266686,0.0016916083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016173124,0.000094940806,0.00045512037,0.00038218658,0.00005431021,0.0009019045,0.0015447384,0.095343344,0.020220568,0.6503685,0.006412103,0.22406046],"study_design_scores_gemma":[0.00019921632,0.00017762095,0.0003803807,0.00027930082,0.00013778874,0.0008789844,0.00020168036,0.36086202,0.04629683,0.29552102,0.29488996,0.00017514991],"about_ca_topic_score_codex":0.004018533,"about_ca_topic_score_gemma":0.004084749,"teacher_disagreement_score":0.006805404,"about_ca_system_score_codex":0.001115942,"about_ca_system_score_gemma":0.002066237,"threshold_uncertainty_score":0.022766292},"labels":[],"label_agreement":null},{"id":"W2104079056","doi":"10.1145/1950413.1950445","title":"Scalable and deterministic timing-driven parallel placement for FPGAs","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Scalability; Speedup; Bounding overwatch; Metric (unit); Simulated annealing; Parallelism (grammar); Algorithm","score_opus":0.049267417948559496,"score_gpt":0.23822344027810072,"score_spread":0.18895602232954123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104079056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044549525,0.0002328252,0.9445303,0.00013331142,0.00006975935,0.00006749673,0.00007832229,0.0040785084,0.0062599247],"genre_scores_gemma":[0.37854314,0.00014139283,0.6172333,0.000065549786,0.000022448874,0.00011335497,0.00014547282,0.00031723015,0.0034181923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00006633139,0.000017189728,0.000056269713,0.00017594728,0.00004234744],"domain_scores_gemma":[0.99965954,0.00010493489,0.00004424942,0.000092853385,0.000080684644,0.00001778643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369049,0.0005053908,0.00040809892,0.00033359157,0.0003958351,0.00051569735,0.0009089624,0.00043939037,0.0028238788],"category_scores_gemma":[0.0009333649,0.00042713215,0.0003915844,0.00041574516,0.0003668925,0.00048373447,0.00046980445,0.0004775631,0.00062026444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121747034,0.00004037529,0.000630363,0.0000863426,0.000032456755,0.00010500816,0.000049122784,0.8745693,0.02388765,0.010269066,0.002129885,0.088078715],"study_design_scores_gemma":[0.000026037678,0.000041230505,0.00016403719,0.000004537422,0.0000054908883,0.000040805226,0.0000094250345,0.9877132,0.006042867,0.0038476167,0.0020979724,0.000006800689],"about_ca_topic_score_codex":0.0041365977,"about_ca_topic_score_gemma":0.008141291,"teacher_disagreement_score":0.0041365977,"about_ca_system_score_codex":0.0008153679,"about_ca_system_score_gemma":0.0010889636,"threshold_uncertainty_score":0.009446859},"labels":[],"label_agreement":null},{"id":"W2104156100","doi":"10.1109/ccece.2005.1557021","title":"Generating diverse pools of Steiner trees for VLSI routing","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Very-large-scale integration; Routing (electronic design automation); Computer science; Tree (set theory); Interconnection; Iterated function; Set (abstract data type); Spanning tree; Combinatorics; Algorithm; Mathematics; Computer network","score_opus":0.0132736315981807,"score_gpt":0.21511545986744113,"score_spread":0.20184182826926042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104156100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347744,0.00025946464,0.8933205,0.0000809512,0.000015021065,0.00010322001,0.0001283221,0.00049625384,0.002118894],"genre_scores_gemma":[0.36495394,0.00025452225,0.6323187,0.00004789954,0.000021335265,0.00023809055,0.000547655,0.0001295029,0.0014884861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996344,0.00012136061,0.00002870442,0.0000634277,0.00010997465,0.000042062875],"domain_scores_gemma":[0.99941754,0.00022362468,0.000081182494,0.00017141354,0.000069691705,0.00003658219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700839,0.00044751333,0.0007160665,0.00075156416,0.00060215377,0.0004733539,0.000886292,0.00042729385,0.0017413724],"category_scores_gemma":[0.0014503814,0.00051713514,0.00069208804,0.0009917076,0.00032088908,0.0013287314,0.0013016986,0.00042662045,0.00051158696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035153987,0.00011520861,0.0030421168,0.0002822225,0.00014293054,0.00081729976,0.00041091198,0.525743,0.0990791,0.06685826,0.004432423,0.298725],"study_design_scores_gemma":[0.00010705981,0.0006670086,0.0010414916,0.000035629622,0.000071083756,0.00060740684,0.00016049677,0.86784893,0.0423857,0.074470386,0.012563973,0.000040752868],"about_ca_topic_score_codex":0.00016303803,"about_ca_topic_score_gemma":0.0005750251,"teacher_disagreement_score":0.0017413724,"about_ca_system_score_codex":0.00030140928,"about_ca_system_score_gemma":0.00045403469,"threshold_uncertainty_score":0.0058255196},"labels":[],"label_agreement":null},{"id":"W2104559065","doi":"10.1109/icpp.2008.89","title":"A Multiway Partitioning Algorithm for Parallel Gate Level Verilog Simulation","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Verilog; Computer science; Algorithm; Speedup; Hypergraph; Parallel computing; Metric (unit); Algorithm design; Field-programmable gate array; Mathematics; Embedded system","score_opus":0.07598177386968231,"score_gpt":0.26839527080925396,"score_spread":0.19241349693957166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104559065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002516424,0.000043994845,0.9956084,0.000023719684,0.0000133486465,0.00003554795,0.00002445065,0.0007544062,0.0009797176],"genre_scores_gemma":[0.051208615,0.0000540546,0.94673574,0.00003020027,0.000007981773,0.00010053709,0.00013432311,0.00018903974,0.0015395117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00011402607,0.00003877378,0.000095397816,0.00020623505,0.000049822193],"domain_scores_gemma":[0.99939513,0.00024366876,0.000044477998,0.00015646972,0.00013665347,0.000023582244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297811,0.0006556142,0.00042687103,0.00072099984,0.00050524535,0.00072314404,0.0010371504,0.00056837895,0.0063819555],"category_scores_gemma":[0.0014858674,0.00038719716,0.0006290055,0.00048762027,0.00040683712,0.0012176329,0.00085514947,0.0010095028,0.0014413663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021544422,0.00010072814,0.00066411763,0.00017641019,0.00006782273,0.00010555917,0.00013364611,0.33302912,0.03406805,0.05492124,0.0038534598,0.57266444],"study_design_scores_gemma":[0.000031052023,0.00007711703,0.0001312034,0.000017967674,0.000016081134,0.00008280144,0.000015013013,0.96349263,0.013151677,0.01375592,0.009213247,0.00001517928],"about_ca_topic_score_codex":0.0019020495,"about_ca_topic_score_gemma":0.002901113,"teacher_disagreement_score":0.0063819555,"about_ca_system_score_codex":0.00075667433,"about_ca_system_score_gemma":0.00088401703,"threshold_uncertainty_score":0.021349788},"labels":[],"label_agreement":null},{"id":"W2104606487","doi":"10.1109/tvlsi.2011.2153883","title":"Optimizing Floating Point Units in Hybrid FPGAs","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Field-programmable gate array; Adder; Floating point; Benchmark (surveying); Throughput; Lookup table; Parallel computing; Routing (electronic design automation); Flexibility (engineering); Floating-point unit; Computer hardware; Embedded system; Computer architecture; Algorithm; Latency (audio); Mathematics","score_opus":0.025628805194764796,"score_gpt":0.21296268698502904,"score_spread":0.18733388179026425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104606487","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5751453,0.00070125883,0.41490954,0.00008682239,0.00004064811,0.00011243294,0.00010399329,0.001387519,0.007512469],"genre_scores_gemma":[0.8461129,0.00013029258,0.15189843,0.000044609973,0.0000078907415,0.00006744229,0.000087303204,0.00009564644,0.0015555428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975616,0.000036576163,0.000015777621,0.000043799486,0.000098500925,0.00004932922],"domain_scores_gemma":[0.9997956,0.000073170806,0.000033081877,0.000044594337,0.000043988457,0.000009580884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027293703,0.0005002624,0.0003887172,0.00048622597,0.00025821116,0.0005384168,0.0009011071,0.00023613333,0.0014016457],"category_scores_gemma":[0.0006305487,0.0002522336,0.00030324073,0.0004981485,0.00031099393,0.00071102026,0.00035281075,0.00028072248,0.00019021571],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019646675,0.000053250867,0.0020820394,0.00011629374,0.00006788123,0.00014302669,0.00006064997,0.82002157,0.056471977,0.008669962,0.00061238004,0.11150449],"study_design_scores_gemma":[0.00004247779,0.0004231729,0.0015992739,0.00001656675,0.00005142431,0.000099465935,0.00005017911,0.938439,0.049111944,0.0064927926,0.0036527272,0.000020961977],"about_ca_topic_score_codex":0.0024812757,"about_ca_topic_score_gemma":0.0051312186,"teacher_disagreement_score":0.0024812757,"about_ca_system_score_codex":0.00072437077,"about_ca_system_score_gemma":0.00055125094,"threshold_uncertainty_score":0.0052557588},"labels":[],"label_agreement":null},{"id":"W2104812993","doi":"10.1145/329166.329199","title":"Generating highly-routable sparse crossbars for PLDs","year":2000,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Routing (electronic design automation); Network routing; Sparse matrix; Parallel computing; Algorithm; Computer network","score_opus":0.013929553493395353,"score_gpt":0.22244625556785652,"score_spread":0.20851670207446116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104812993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20251244,0.00011561567,0.79179424,0.000111974914,0.000033354136,0.00012883183,0.0001962406,0.002288456,0.0028187844],"genre_scores_gemma":[0.75127953,0.00007418607,0.24579296,0.00005814723,0.000020628899,0.00013626582,0.0004501486,0.0002169266,0.0019711745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994654,0.00016361233,0.000024504137,0.00007034732,0.00020229223,0.00007377976],"domain_scores_gemma":[0.9980299,0.0009853953,0.00026448595,0.00024255464,0.00041929493,0.000058360412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562618,0.00066534616,0.00038971158,0.00087094185,0.00027547497,0.00052608905,0.00072826416,0.0003464588,0.0024582457],"category_scores_gemma":[0.003376574,0.00028938288,0.0002865441,0.00059965416,0.00045275502,0.0006917356,0.00062710023,0.00042594204,0.0003082872],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033602177,0.00017125592,0.0047936584,0.00026380035,0.00005384512,0.00042684277,0.00011556832,0.5712178,0.10038057,0.02675161,0.002946943,0.29254213],"study_design_scores_gemma":[0.00009222438,0.00037038868,0.0007847045,0.000016610229,0.000024117273,0.00016601037,0.00004652709,0.9156039,0.06395927,0.015927637,0.002991988,0.00001660852],"about_ca_topic_score_codex":0.0007939996,"about_ca_topic_score_gemma":0.0018133846,"teacher_disagreement_score":0.0024582457,"about_ca_system_score_codex":0.00059161364,"about_ca_system_score_gemma":0.0004958816,"threshold_uncertainty_score":0.008223653},"labels":[],"label_agreement":null},{"id":"W2105601985","doi":"10.1109/mwscas.2007.4488736","title":"Parasitic-aware physical design optimization of deep sub-micron analog circuits","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Physical design; Design flow; Computer science; Schematic; Software portability; Electronic engineering; Electronic circuit; Analogue electronics; Parasitic extraction; Integrated circuit design; Electronic design automation; Reliability (semiconductor); Circuit design; Computer architecture; Computer engineering; Embedded system; Engineering; Electrical engineering","score_opus":0.02110707230612559,"score_gpt":0.23844966280508517,"score_spread":0.21734259049895957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105601985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112689495,0.00039500653,0.8804388,0.0001244682,0.000028446004,0.00006332617,0.000051031013,0.00069081684,0.0055186],"genre_scores_gemma":[0.65196615,0.0002571302,0.34534064,0.00006965086,0.000017335684,0.000078596226,0.00007934936,0.00015012152,0.0020410696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982613,0.00003545412,0.000009645094,0.000023091701,0.00008482209,0.000020884505],"domain_scores_gemma":[0.9997757,0.00008029654,0.000058033995,0.00003564119,0.000042659565,0.00000770514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026871075,0.00045829258,0.00025174062,0.00032695747,0.00017747689,0.00042779575,0.0005342033,0.00023675531,0.0009578974],"category_scores_gemma":[0.00058096595,0.00020139129,0.00021228535,0.00022487796,0.00025857083,0.0005126997,0.0003639209,0.00026588302,0.00018675976],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009459957,0.000070645685,0.0014957822,0.00021709618,0.00004969601,0.0001452198,0.00010319618,0.5307447,0.2523288,0.015815675,0.0014312956,0.19750331],"study_design_scores_gemma":[0.000023261999,0.0002109328,0.0007816238,0.000008724963,0.000032840544,0.00016376782,0.00002940777,0.9316815,0.05603236,0.006131044,0.00489554,0.000008883363],"about_ca_topic_score_codex":0.00029147175,"about_ca_topic_score_gemma":0.0009292898,"teacher_disagreement_score":0.0009578974,"about_ca_system_score_codex":0.00042082687,"about_ca_system_score_gemma":0.0004529838,"threshold_uncertainty_score":0.0032045245},"labels":[],"label_agreement":null},{"id":"W2106448546","doi":"10.1145/1065579.1065770","title":"Logic block clustering of large designs for channel-width constrained FPGAs","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid","keywords":"Computer science; Field-programmable gate array; Block (permutation group theory); Cluster analysis; Logic block; Parallel computing; Channel (broadcasting); Logic gate; Logic synthesis; Algorithm; Computer architecture; Computer hardware; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03243443050342985,"score_gpt":0.2615054143327757,"score_spread":0.22907098382934585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106448546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19261833,0.0004149245,0.797966,0.00010636079,0.000040628667,0.00017101783,0.000063483865,0.0022098674,0.006409479],"genre_scores_gemma":[0.589579,0.0002127369,0.40442246,0.000090276524,0.000023617602,0.00012236531,0.00019763951,0.00031546343,0.005036502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996896,0.000052156538,0.000019003717,0.000056498884,0.00013777424,0.000045021345],"domain_scores_gemma":[0.99939024,0.00019430059,0.000118750126,0.00018488453,0.00007977732,0.00003196113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021160656,0.0005237372,0.00029537163,0.0005506011,0.00046978905,0.00039077163,0.00072172127,0.00021096513,0.003322371],"category_scores_gemma":[0.00096793356,0.00023503228,0.00023307896,0.00055055285,0.00029572638,0.0006889849,0.00049933174,0.0004081048,0.00052595296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004895172,0.00014502801,0.0023328005,0.00042097483,0.00007142086,0.0004723943,0.00023247529,0.39750114,0.26592848,0.014835247,0.0028389515,0.31473157],"study_design_scores_gemma":[0.000083998515,0.0009737186,0.0030963442,0.00004172744,0.00007539394,0.0005547436,0.00012595752,0.7488418,0.22046882,0.010908298,0.014793878,0.00003526015],"about_ca_topic_score_codex":0.0013099051,"about_ca_topic_score_gemma":0.004102397,"teacher_disagreement_score":0.003322371,"about_ca_system_score_codex":0.00062808534,"about_ca_system_score_gemma":0.00059444795,"threshold_uncertainty_score":0.0111144185},"labels":[],"label_agreement":null},{"id":"W2106697480","doi":"10.1145/2145694.2145754","title":"Parallel FPGA placement based on individual LUT placement (abstract only)","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Lookup table; Computer science; Parallel computing; Placement; Path (computing); CAD; Critical path method; Computer hardware; Computer architecture; Embedded system; Physical design; Circuit design; Engineering; Engineering drawing","score_opus":0.026335585204179786,"score_gpt":0.2456686059204377,"score_spread":0.21933302071625793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106697480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07275686,0.00034943342,0.9006733,0.00014548545,0.00021597825,0.00012385058,0.00017017881,0.0064262035,0.019138664],"genre_scores_gemma":[0.40156668,0.00030484845,0.583849,0.0000904445,0.000106792475,0.00007706019,0.00029967577,0.00033150872,0.01337403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981207,0.000020053989,0.000011437298,0.000040817537,0.000086229535,0.000029465085],"domain_scores_gemma":[0.99980086,0.000030550003,0.000033878136,0.0000860252,0.000036798643,0.000011857984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012181572,0.00044857935,0.00033805097,0.00054344407,0.00036237633,0.0004117537,0.0005752219,0.00022318706,0.006544881],"category_scores_gemma":[0.00031826613,0.00029693163,0.00026488054,0.00073353545,0.00024785905,0.0005563532,0.00044306493,0.00041546766,0.0020888776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034344924,0.00014363675,0.0011967487,0.00024346919,0.000047081834,0.00036776895,0.00006610552,0.08376171,0.20610085,0.01175601,0.008391024,0.6875822],"study_design_scores_gemma":[0.00022536566,0.0011571709,0.0037544593,0.00004228571,0.00009693485,0.002529237,0.000061441264,0.4662528,0.44431236,0.016551312,0.064939104,0.00007756762],"about_ca_topic_score_codex":0.0013253146,"about_ca_topic_score_gemma":0.0036412126,"teacher_disagreement_score":0.006544881,"about_ca_system_score_codex":0.00030997922,"about_ca_system_score_gemma":0.000675247,"threshold_uncertainty_score":0.021894813},"labels":[],"label_agreement":null},{"id":"W2106794245","doi":"10.1109/ccece.1998.682781","title":"A nonlinear programming placement approach based on target distance model and iterative construction method","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Nonlinear system; Iterative method; Set (abstract data type); Placement; Very-large-scale integration; Mathematical optimization; Nonlinear programming; Algorithm; Feature (linguistics); Function (biology); Physical design; Mathematics; Integrated circuit; Programming language","score_opus":0.0185942786680179,"score_gpt":0.23841179964197282,"score_spread":0.2198175209739549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106794245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008302137,0.000023872046,0.9977356,0.000021101552,0.000007629834,0.000011062492,0.0000043410673,0.00010184983,0.0012644436],"genre_scores_gemma":[0.08802463,0.00026202176,0.90361845,0.000059541035,0.00003717386,0.00017399271,0.00007135867,0.00013753367,0.0076153707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995677,0.00008458273,0.00001739574,0.00006282946,0.00024266905,0.000024721783],"domain_scores_gemma":[0.9998097,0.000066869674,0.000023490908,0.00003012133,0.000059222515,0.000010660434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003031696,0.0006599032,0.00057496835,0.00054281607,0.00040457712,0.0005679969,0.0012468736,0.00058036187,0.0033712701],"category_scores_gemma":[0.00051543955,0.00043119353,0.0006541681,0.0005638967,0.0006147933,0.00086636894,0.0008971441,0.0010729276,0.0010673861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069909365,0.000077059754,0.00033961033,0.00028161518,0.00004692208,0.00025057,0.00021676635,0.5740397,0.044129442,0.11663847,0.0031890555,0.26072088],"study_design_scores_gemma":[0.0000163492,0.000093016235,0.000108646345,0.000007984996,0.000012798366,0.00021508265,0.000013749591,0.97318304,0.008097017,0.010063504,0.008169462,0.000019369387],"about_ca_topic_score_codex":0.0016713995,"about_ca_topic_score_gemma":0.0017821387,"teacher_disagreement_score":0.0033712701,"about_ca_system_score_codex":0.00066156435,"about_ca_system_score_gemma":0.0009599787,"threshold_uncertainty_score":0.011278033},"labels":[],"label_agreement":null},{"id":"W2107547422","doi":"10.5555/1950815.1950972","title":"An integer programming placement approach to FPGA clock power reduction","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Clock skew; Digital clock manager; Clock network; Clock gating; CPU multiplier; Computer science; Field-programmable gate array; Integer programming; Synchronous circuit; Reduction (mathematics); Static timing analysis; Routing (electronic design automation); Dynamic demand; Clock rate; Skew; Timing failure; Parallel computing; Embedded system; Power (physics); Clock signal; Mathematics; Algorithm; Jitter; Telecommunications; Chip","score_opus":0.026024550565928735,"score_gpt":0.22797989032749408,"score_spread":0.20195533976156535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107547422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048720203,0.00012527409,0.9909072,0.00011197906,0.00003082424,0.000025812304,0.000017258837,0.0001314965,0.0037782288],"genre_scores_gemma":[0.18087356,0.00035039507,0.8125225,0.00013934019,0.000081468555,0.00012991116,0.0000657749,0.00010785093,0.005729253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995733,0.00018267638,0.0000208559,0.00004863824,0.00013562712,0.000038955037],"domain_scores_gemma":[0.9997446,0.00012449877,0.000041502422,0.000022586542,0.000057292786,0.000009456795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057628675,0.0006560714,0.00035727175,0.00042304955,0.00032612318,0.0007145116,0.0005916373,0.00039679263,0.0036433858],"category_scores_gemma":[0.00096868817,0.00038235512,0.00037710692,0.00063613756,0.00040135838,0.00051660626,0.00035714408,0.00088573736,0.000675574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008174471,0.00009968982,0.00022122175,0.00011042511,0.000022583325,0.00011071098,0.000054230924,0.85966873,0.014720282,0.03142629,0.0018255956,0.09165849],"study_design_scores_gemma":[0.000011118822,0.000039077167,0.00003200647,0.000007166621,0.0000064166966,0.00002838487,0.000011176295,0.99085325,0.0031625684,0.0041072774,0.0017377223,0.0000037602495],"about_ca_topic_score_codex":0.001030483,"about_ca_topic_score_gemma":0.0017994497,"teacher_disagreement_score":0.0036433858,"about_ca_system_score_codex":0.00055090274,"about_ca_system_score_gemma":0.000672975,"threshold_uncertainty_score":0.012188375},"labels":[],"label_agreement":null},{"id":"W2107940981","doi":"10.5555/1351542.1351654","title":"Optimizing time warp simulation with reinforcement learning techniques","year":2007,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Benchmark (surveying); Bellman equation; Dynamic programming; Function (biology); Bounded function; State (computer science); Optimal control; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.01747016352218258,"score_gpt":0.25604442832303126,"score_spread":0.23857426480084867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107940981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040467527,0.00010294016,0.9568763,0.00012329468,0.000016696102,0.00006963885,0.000013056457,0.0003359651,0.00199465],"genre_scores_gemma":[0.8784882,0.00010315868,0.11983608,0.000047287398,0.000012684106,0.00020577079,0.000026884205,0.00005649907,0.0012235068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959666,0.00016269335,0.000021422533,0.000064073145,0.00010469169,0.000050446262],"domain_scores_gemma":[0.99784076,0.0016030871,0.00018677833,0.00012059027,0.00017781783,0.000070937895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012625518,0.00075945776,0.00078122533,0.0003725894,0.0003186648,0.0005775438,0.0009443212,0.0007467627,0.0017216614],"category_scores_gemma":[0.004256296,0.00041177016,0.00038722943,0.00028569277,0.0009499539,0.00083269016,0.00076650677,0.0011967642,0.00018875425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019262741,0.000013641728,0.00011080218,0.0000081355765,0.0000054962197,0.000009727368,0.00000956909,0.99402905,0.00042751487,0.0014316179,0.000039562703,0.0038956366],"study_design_scores_gemma":[0.0000056511453,0.000008556934,0.00000832495,9.543504e-7,0.0000012527795,0.0000016210624,0.0000013342828,0.9990175,0.00025107604,0.0006565178,0.000046335874,8.9185176e-7],"about_ca_topic_score_codex":0.0040348475,"about_ca_topic_score_gemma":0.0028252888,"teacher_disagreement_score":0.0040348475,"about_ca_system_score_codex":0.00088533695,"about_ca_system_score_gemma":0.0011637105,"threshold_uncertainty_score":0.008022726},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027036500708916063,"score_gpt":0.27406991313517715,"score_spread":0.2470334124262611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108099581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056490907,0.0002204459,0.9900513,0.00019347157,0.000057195593,0.000067424764,0.00012281803,0.0013827641,0.002255441],"genre_scores_gemma":[0.045799576,0.00013815219,0.95025545,0.00012853925,0.000028385171,0.00016909206,0.00041876617,0.00027558557,0.002786391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999587,0.000045023724,0.000019895666,0.000078852725,0.00022085034,0.000048430345],"domain_scores_gemma":[0.9996105,0.000111244044,0.00004045953,0.0000709919,0.00012425198,0.000042497413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004103618,0.0008922678,0.0009974726,0.0016388164,0.00076824427,0.0011028306,0.001914809,0.0011617763,0.005492136],"category_scores_gemma":[0.0016087872,0.0005833591,0.0009067294,0.0013633702,0.0006112532,0.0014970496,0.002057438,0.0015248938,0.0013007852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036800595,0.00012976621,0.0010042136,0.00043184138,0.00017993194,0.0001565775,0.00026109308,0.2944503,0.05389294,0.05365765,0.021712651,0.573755],"study_design_scores_gemma":[0.000059013633,0.000052673495,0.00017773324,0.000016517597,0.000016582262,0.000058875627,0.000020365354,0.98194826,0.0036188816,0.007143358,0.0068725734,0.00001520003],"about_ca_topic_score_codex":0.0090842815,"about_ca_topic_score_gemma":0.019140022,"teacher_disagreement_score":0.0090842815,"about_ca_system_score_codex":0.0015111509,"about_ca_system_score_gemma":0.0014166186,"threshold_uncertainty_score":0.018372953},"labels":[],"label_agreement":null},{"id":"W2108349468","doi":"10.1145/1120725.1120786","title":"A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tsinghua University; University of Toronto","keywords":"RLC circuit; Crosstalk; Computer science; Routing (electronic design automation); Network routing; Electronic engineering; Voltage; Computer network; Electrical engineering; Engineering; Capacitor","score_opus":0.00848239604748847,"score_gpt":0.21167072350418972,"score_spread":0.20318832745670126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108349468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012128951,0.00025598955,0.98268086,0.00018704998,0.00003334035,0.000037776506,0.00008301132,0.00031360993,0.0042792736],"genre_scores_gemma":[0.35231492,0.00044069157,0.6383852,0.00022564534,0.00014112065,0.00021097941,0.0003955466,0.000317435,0.0075685205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00009334846,0.000010618776,0.00007886424,0.00009445901,0.000064126325],"domain_scores_gemma":[0.9996277,0.00018980056,0.00004327279,0.000038169354,0.000079150304,0.000021951992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611393,0.0013569697,0.0010094196,0.00061948545,0.00039567475,0.0007055286,0.0011271128,0.00089875114,0.0043478655],"category_scores_gemma":[0.0013463867,0.00036608754,0.00048121673,0.0007174911,0.0005207475,0.0010706884,0.0007701728,0.00074135925,0.0005658883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007103378,0.000038931914,0.0002207914,0.00010719144,0.000030193129,0.000054599743,0.000038415423,0.90382963,0.003517108,0.013823178,0.0029160383,0.07535288],"study_design_scores_gemma":[0.000026351261,0.00008953283,0.00011937704,0.0000075236785,0.000012200751,0.000052293457,0.000020747231,0.9867444,0.0013013105,0.009886978,0.0017335787,0.0000057337325],"about_ca_topic_score_codex":0.0012532645,"about_ca_topic_score_gemma":0.0017000838,"teacher_disagreement_score":0.0043478655,"about_ca_system_score_codex":0.0005759285,"about_ca_system_score_gemma":0.0010199342,"threshold_uncertainty_score":0.014545023},"labels":[],"label_agreement":null},{"id":"W2110405757","doi":"10.1109/tcad.2005.860957","title":"Placement Algorithm in Analog-Layout Designs","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":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Dalhousie University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.026449712335902133,"score_gpt":0.21781510018232786,"score_spread":0.19136538784642573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110405757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030665707,0.0004076125,0.99262154,0.0000875399,0.000038196365,0.00004490548,0.000020748019,0.0003215541,0.0033913995],"genre_scores_gemma":[0.11541727,0.0006813597,0.8795368,0.00010471275,0.00004303341,0.00017890193,0.00009391359,0.00008748402,0.0038564221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.00017634266,0.000023646826,0.000067596884,0.00013540236,0.000026942396],"domain_scores_gemma":[0.9997377,0.00014041088,0.000038410923,0.000030343404,0.000045158624,0.00000798143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006289821,0.0007274338,0.0005956066,0.0007080707,0.00042650677,0.0007778699,0.0007121656,0.00079429883,0.0032831016],"category_scores_gemma":[0.001054596,0.00040859097,0.0004357234,0.0010273145,0.0004938255,0.00070863165,0.00052588026,0.0006089886,0.000850372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040301038,0.000041684554,0.00025796832,0.00018127107,0.000037687954,0.00006996925,0.0000666208,0.75702447,0.0050618,0.033490345,0.001933065,0.20179477],"study_design_scores_gemma":[0.000028982278,0.00007191869,0.00010674972,0.000033135377,0.000013931175,0.00007578523,0.000024501349,0.9652022,0.002549265,0.02311809,0.00876538,0.0000100235175],"about_ca_topic_score_codex":0.0014199757,"about_ca_topic_score_gemma":0.0015895859,"teacher_disagreement_score":0.0032831016,"about_ca_system_score_codex":0.0006682118,"about_ca_system_score_gemma":0.00080127915,"threshold_uncertainty_score":0.0109831095},"labels":[],"label_agreement":null},{"id":"W2110659707","doi":"10.1109/pcee.2000.873615","title":"Parallel efficient implementation of hierarchical algorithms for module placement of large chips","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Algorithm; Benchmark (surveying); Simulated annealing; Parallel computing; Convergence (economics); Electronic circuit; Placement; Multiprocessing; Integrated circuit; Physical design","score_opus":0.0253424165269703,"score_gpt":0.2836081885869562,"score_spread":0.2582657720599859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110659707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014723105,0.00009371654,0.98227227,0.00003679739,0.000019500125,0.00004052541,0.00002782918,0.0014940846,0.0012921934],"genre_scores_gemma":[0.14938088,0.000064216954,0.848884,0.000028642466,0.000012929775,0.00011395354,0.00013074972,0.00008664327,0.0012980339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.000105291736,0.000029146255,0.00006022352,0.00012921741,0.000050035207],"domain_scores_gemma":[0.9993851,0.00019793445,0.00006186426,0.00019220269,0.00013236668,0.000030501034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004815228,0.0006181691,0.00060497224,0.0007502482,0.000492501,0.00070532324,0.001321242,0.0004744297,0.0024735243],"category_scores_gemma":[0.0016264049,0.00041279494,0.0005000095,0.00079409225,0.00038875706,0.0007614891,0.0008123813,0.0005671164,0.00060570904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021682313,0.000099215154,0.0014093191,0.0002372919,0.00008182016,0.00012457644,0.00022246764,0.48496503,0.037262503,0.02506932,0.0039434554,0.44636813],"study_design_scores_gemma":[0.000035875662,0.0000747666,0.00032296625,0.000004793802,0.000009729373,0.00004392846,0.00002234656,0.9796276,0.011529212,0.0051634554,0.0031547637,0.000010587606],"about_ca_topic_score_codex":0.0026509382,"about_ca_topic_score_gemma":0.0053791134,"teacher_disagreement_score":0.0026509382,"about_ca_system_score_codex":0.00076728803,"about_ca_system_score_gemma":0.0009602513,"threshold_uncertainty_score":0.008274794},"labels":[],"label_agreement":null},{"id":"W2110681214","doi":"10.1109/tvlsi.2009.2029232","title":"The Effect of Multi-Bit Correlation on the Design of Field-Programmable Gate Array Routing Resources","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Datapath; Computer science; Routing (electronic design automation); Field-programmable gate array; Logic block; Block (permutation group theory); Electronic circuit; Computer hardware; Parallel computing; Embedded system; Engineering; Electrical engineering; Mathematics","score_opus":0.011492852009050107,"score_gpt":0.22445098763695798,"score_spread":0.21295813562790786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110681214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54008144,0.002814723,0.44404367,0.0004966209,0.00012092501,0.00006290149,0.00004917051,0.0006326972,0.01169782],"genre_scores_gemma":[0.90848255,0.00053238124,0.08912012,0.00017916916,0.000023989516,0.00002996057,0.00003369354,0.000052015694,0.0015461242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993412,0.00022062975,0.000035748497,0.00009740886,0.0002238946,0.00008114928],"domain_scores_gemma":[0.9979037,0.0011454236,0.00038758805,0.00024620484,0.0002665892,0.000050561837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072568626,0.00040410206,0.00024968514,0.00037478041,0.000281423,0.0005626423,0.0007716046,0.00030057537,0.0008960082],"category_scores_gemma":[0.0024775194,0.00027510937,0.00017572178,0.00057519117,0.0002266402,0.0011670109,0.0003093672,0.0003597749,0.00019860736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043549502,0.00016937706,0.0071424246,0.00024414674,0.000086595515,0.00054701034,0.000097077136,0.6531676,0.11482376,0.024563303,0.0014309002,0.19729237],"study_design_scores_gemma":[0.000018754754,0.00034017736,0.0015056295,0.00002681112,0.000045226232,0.00039240037,0.000020081328,0.93875533,0.05359939,0.0027673189,0.0025128967,0.000015888592],"about_ca_topic_score_codex":0.00073973293,"about_ca_topic_score_gemma":0.0023591209,"teacher_disagreement_score":0.0008960082,"about_ca_system_score_codex":0.0006290612,"about_ca_system_score_gemma":0.000996952,"threshold_uncertainty_score":0.0045642257},"labels":[],"label_agreement":null},{"id":"W2111337158","doi":"10.1145/1228784.1228915","title":"Floorplan repair using dynamic whitespace management","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Floorplan; Computer science; Range (aeronautics); Design flow; Integrated circuit layout; Parallel computing; Algorithm; Embedded system; Integrated circuit; Engineering","score_opus":0.007260622656705033,"score_gpt":0.23185367201022636,"score_spread":0.2245930493535213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111337158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022273723,0.000116352225,0.97383714,0.000039753955,0.000024845833,0.00005085021,0.00004227717,0.0018417342,0.0017733384],"genre_scores_gemma":[0.31328183,0.0001320252,0.6828769,0.000050213348,0.000018905615,0.0000783152,0.00021040444,0.00025039472,0.0031009123],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996166,0.000049583,0.000023358469,0.00007700136,0.00017855235,0.000054911285],"domain_scores_gemma":[0.99952185,0.000120462806,0.0000851811,0.00016653872,0.000079167585,0.000026856953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419668,0.00048236118,0.00037553758,0.0005391016,0.00039734697,0.00045850908,0.00074124127,0.00025348266,0.002384803],"category_scores_gemma":[0.0008102136,0.00020982766,0.0003359791,0.00043716104,0.0004423051,0.00058382464,0.0008170724,0.00047793178,0.0005305138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014921487,0.00008857026,0.0011276727,0.0001707181,0.000035515972,0.00031533407,0.00024065656,0.2140647,0.07932542,0.014304768,0.0035909037,0.68658656],"study_design_scores_gemma":[0.000055687746,0.00036311065,0.0015025444,0.000030766834,0.0000489862,0.0007704315,0.00017622077,0.80125695,0.15241331,0.016961997,0.02636782,0.000052243646],"about_ca_topic_score_codex":0.0012078085,"about_ca_topic_score_gemma":0.0024267894,"teacher_disagreement_score":0.002384803,"about_ca_system_score_codex":0.00022473969,"about_ca_system_score_gemma":0.0007805266,"threshold_uncertainty_score":0.0079779625},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.04524113431800826,"score_gpt":0.2662992822355516,"score_spread":0.22105814791754336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111427553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015182517,0.00019840995,0.97228086,0.000087416716,0.000061583174,0.00016962325,0.00024428847,0.0060695754,0.00570573],"genre_scores_gemma":[0.1448153,0.0003086557,0.8490753,0.0000983982,0.00003287655,0.00028166178,0.00065239286,0.0005678075,0.0041676266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856514,0.00028932982,0.00010191576,0.00016211632,0.00077645556,0.00010503635],"domain_scores_gemma":[0.9968501,0.0012029369,0.00031443933,0.0010601836,0.0005328819,0.000039530973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002702,0.0008038109,0.00040586502,0.0009493573,0.0006318932,0.0010884213,0.0010012501,0.00047066514,0.006278527],"category_scores_gemma":[0.0032503048,0.00045901703,0.00066903385,0.0004293511,0.0006019225,0.0008887804,0.0004884511,0.00072383176,0.0019945067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016497353,0.00015184167,0.0028755313,0.000991385,0.00013562034,0.0014242871,0.0005086253,0.13495168,0.2316946,0.03371121,0.010658616,0.5827316],"study_design_scores_gemma":[0.00023657647,0.0012655959,0.00652455,0.00036650104,0.00014414857,0.0028538872,0.00034147647,0.3709144,0.4129934,0.023625262,0.18054129,0.00019287516],"about_ca_topic_score_codex":0.0019968876,"about_ca_topic_score_gemma":0.0034150064,"teacher_disagreement_score":0.006278527,"about_ca_system_score_codex":0.0006959119,"about_ca_system_score_gemma":0.0016426905,"threshold_uncertainty_score":0.021003723},"labels":[],"label_agreement":null},{"id":"W2111524252","doi":"10.1109/cicc.1993.590685","title":"A combined eigenvector tabu search approach for circuit partitioning","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tabu search; Guided Local Search; Eigenvalues and eigenvectors; Partition (number theory); Mathematical optimization; Computer science; Algorithm; Iterative method; Search algorithm; Mathematics","score_opus":0.06031010982164158,"score_gpt":0.2190760474328658,"score_spread":0.1587659376112242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111524252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034516882,0.00023417849,0.99106383,0.000037144546,0.000027401082,0.000045162356,0.00003448728,0.00040502334,0.004701074],"genre_scores_gemma":[0.07401169,0.00029819756,0.92010236,0.00006103653,0.00003238264,0.00021606438,0.00020905162,0.00021526964,0.0048539415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992772,0.0002540326,0.000027659431,0.000084109925,0.0003050087,0.00005211633],"domain_scores_gemma":[0.9996724,0.00011310218,0.000022480133,0.00006322279,0.00011605284,0.00001262104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055487273,0.00086820597,0.00073586666,0.0017279184,0.0006415295,0.0008859125,0.0012542772,0.0007064117,0.0050721862],"category_scores_gemma":[0.0015323814,0.00047188342,0.00064558344,0.0021962142,0.00038866495,0.0008454327,0.00073431147,0.0006745015,0.0015830782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091496186,0.00012979897,0.00070104114,0.00014649438,0.00009535617,0.00007121497,0.00011152285,0.37716818,0.012468694,0.057256553,0.0046297642,0.54712987],"study_design_scores_gemma":[0.000030635758,0.000119943266,0.0002599149,0.000019083334,0.00002625185,0.00012176867,0.000023222789,0.966271,0.0044671684,0.0167722,0.011866851,0.000022027882],"about_ca_topic_score_codex":0.002841434,"about_ca_topic_score_gemma":0.005574295,"teacher_disagreement_score":0.0050721862,"about_ca_system_score_codex":0.0005842399,"about_ca_system_score_gemma":0.000884445,"threshold_uncertainty_score":0.016968131},"labels":[],"label_agreement":null},{"id":"W2112003649","doi":"10.1145/370155.370571","title":"Combinatorial routing analysis and design of universal switch blocks","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"Routing (electronic design automation); Block (permutation group theory); Computer science; Set (abstract data type); USB; Decomposition; Dimension (graph theory); Constraint (computer-aided design); Parallel computing; Mathematics; Topology (electrical circuits); Discrete mathematics; Combinatorics; Embedded system; Operating system; Programming language; Software","score_opus":0.01005446106605642,"score_gpt":0.20406582588712713,"score_spread":0.1940113648210707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112003649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2071502,0.00051325647,0.7699263,0.000119074626,0.00001968288,0.00004632728,0.00012689191,0.00030721436,0.021791006],"genre_scores_gemma":[0.88020945,0.00046567954,0.1138125,0.00006890654,0.000021893307,0.00008667356,0.0001935383,0.00009483428,0.0050465106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00012347872,0.000017686893,0.00005833723,0.00009933107,0.00007161956],"domain_scores_gemma":[0.99965143,0.0001429507,0.000062119856,0.00007196765,0.00004759126,0.000024042132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039567795,0.0004435496,0.0004272472,0.0005563309,0.00024785052,0.0008828271,0.00055776205,0.00033167523,0.0026343185],"category_scores_gemma":[0.0009553851,0.00043547965,0.0005918068,0.00067009794,0.0005573356,0.0010270424,0.0004485969,0.00036545165,0.00026153596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008356765,0.000035844645,0.00070297933,0.00010571953,0.000029245812,0.00011908729,0.00006069642,0.77157766,0.01403773,0.17220809,0.0008904711,0.040148906],"study_design_scores_gemma":[0.000009460953,0.000043448967,0.00030840255,0.000009236133,0.00001835532,0.00006268375,0.000020450163,0.96558625,0.0031607072,0.02875764,0.0020159492,0.000007434823],"about_ca_topic_score_codex":0.0018022876,"about_ca_topic_score_gemma":0.0024679077,"teacher_disagreement_score":0.0026343185,"about_ca_system_score_codex":0.00090706215,"about_ca_system_score_gemma":0.00062143843,"threshold_uncertainty_score":0.008812666},"labels":[],"label_agreement":null},{"id":"W2112357703","doi":"10.1109/cicc.2005.1568636","title":"An improved \"soft\" eFPGA design and implementation strategy","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Application-specific integrated circuit; Field-programmable gate array; Overhead (engineering); Computer science; Design flow; Standard cell; Logic synthesis; Embedded system; Computer architecture; Physical design; Programmable logic device; Integrated circuit design; Quality (philosophy); Electronic design automation; Logic gate; Computer hardware; Circuit design; Integrated circuit; Algorithm; Operating system","score_opus":0.010583452235490438,"score_gpt":0.25233526301391923,"score_spread":0.2417518107784288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112357703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027627835,0.00012021759,0.9613897,0.0002326147,0.00007249609,0.000108010114,0.00006386559,0.0023864808,0.007998826],"genre_scores_gemma":[0.27103558,0.00015557418,0.71991587,0.0003638014,0.000057049172,0.00016183003,0.00016829553,0.00017394709,0.007968057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997142,0.000050629325,0.000019036437,0.00004780938,0.00012322178,0.000045096232],"domain_scores_gemma":[0.99967027,0.000056136338,0.00002797329,0.000114812276,0.00011671956,0.000014128206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174534,0.00043629613,0.00031139684,0.0004938332,0.00029428888,0.0006775977,0.0009692666,0.0003716208,0.003322862],"category_scores_gemma":[0.00047883007,0.00025230576,0.00030895334,0.00038010825,0.00043084656,0.0007993002,0.00041808127,0.00089524704,0.0013078924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023943764,0.00016867764,0.0006931957,0.00025989558,0.00005596006,0.00030480864,0.00016900102,0.04139838,0.38687518,0.063005514,0.006327131,0.50050277],"study_design_scores_gemma":[0.00026437457,0.0010641663,0.0015204207,0.000044834956,0.00013487939,0.0013196277,0.000077268945,0.483952,0.4084057,0.019246854,0.08389367,0.000076271564],"about_ca_topic_score_codex":0.00062301086,"about_ca_topic_score_gemma":0.0012686532,"teacher_disagreement_score":0.003322862,"about_ca_system_score_codex":0.00034346303,"about_ca_system_score_gemma":0.0007523997,"threshold_uncertainty_score":0.011116087},"labels":[],"label_agreement":null},{"id":"W2112586548","doi":"10.1109/cicc.1994.379741","title":"Minimizing interconnection delays in array-based FPGAs","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Interconnection; Field-programmable gate array; Computer science; CAD; Limit (mathematics); Focus (optics); Perspective (graphical); Computer architecture; Embedded system; Electronic circuit; Computer engineering; Engineering; Telecommunications; Artificial intelligence; Electrical engineering; Engineering drawing; Mathematics","score_opus":0.019054710568053,"score_gpt":0.1859508983327029,"score_spread":0.1668961877646499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112586548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46737486,0.001506372,0.513012,0.00022888338,0.00014205932,0.00007642914,0.00018819353,0.0023396052,0.015131608],"genre_scores_gemma":[0.83295393,0.000539391,0.16007018,0.000052563606,0.00003666117,0.00006607946,0.00018124112,0.00017790485,0.0059220884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997161,0.00006894952,0.00002056391,0.000059368176,0.000075961514,0.00005900366],"domain_scores_gemma":[0.99934894,0.0002697318,0.00013139899,0.000075984324,0.00012392308,0.000049993625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028750655,0.0006037252,0.00029948182,0.0005912743,0.00047077078,0.00057153596,0.0006541696,0.00030453692,0.0027545702],"category_scores_gemma":[0.0012472068,0.000280474,0.00018404025,0.0005718084,0.0002495709,0.00097597786,0.00041631985,0.0003003442,0.0005609104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058568484,0.00010472558,0.0033030629,0.0002640261,0.00007339289,0.00038660786,0.00013721199,0.74085087,0.10536156,0.01440422,0.0029061283,0.13162248],"study_design_scores_gemma":[0.000110887515,0.0013253159,0.0017575852,0.000034839337,0.00010914723,0.00043003014,0.00014250913,0.8745973,0.0966333,0.010523705,0.0142935235,0.000041891333],"about_ca_topic_score_codex":0.0015346762,"about_ca_topic_score_gemma":0.0033819086,"teacher_disagreement_score":0.0027545702,"about_ca_system_score_codex":0.000661694,"about_ca_system_score_gemma":0.00044264022,"threshold_uncertainty_score":0.009214938},"labels":[],"label_agreement":null},{"id":"W2112868953","doi":"10.1109/iscas.2008.4542032","title":"Binning algorithm for accurate computer aided device modeling","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Black box; Set (abstract data type); Context (archaeology); Artificial neural network; Generality; Artificial intelligence","score_opus":0.04933811692239483,"score_gpt":0.2505110461761093,"score_spread":0.2011729292537145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112868953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016231091,0.00006565869,0.9970462,0.000022927878,0.00001098209,0.000014488993,0.000019579242,0.0005067243,0.0006902682],"genre_scores_gemma":[0.088688955,0.00019346888,0.90747565,0.000075646545,0.000014137197,0.00014909921,0.00023332261,0.00030630088,0.0028633834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994741,0.00011174932,0.000031700678,0.0000838864,0.00025837895,0.00004021161],"domain_scores_gemma":[0.9993217,0.00029592178,0.000059209986,0.00013829356,0.00016702783,0.000017853738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008028448,0.0007046554,0.0008429002,0.0009927398,0.0004715383,0.0008400104,0.0010745022,0.00074346724,0.005818969],"category_scores_gemma":[0.0027075552,0.0004891721,0.00042449796,0.000999734,0.00042140455,0.0015390026,0.0009918063,0.0012209202,0.0015245787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001723525,0.000054247426,0.00060039986,0.00011796884,0.000033349996,0.00007598757,0.0001416401,0.5117377,0.017209213,0.07761323,0.0035549945,0.38868883],"study_design_scores_gemma":[0.000006568979,0.000015695497,0.0000647228,0.000008693341,0.0000043372156,0.00003337467,0.000006757584,0.980998,0.0040774364,0.0105115855,0.004265027,0.000007748731],"about_ca_topic_score_codex":0.0024890644,"about_ca_topic_score_gemma":0.0029861093,"teacher_disagreement_score":0.005818969,"about_ca_system_score_codex":0.0006109593,"about_ca_system_score_gemma":0.00084297074,"threshold_uncertainty_score":0.0194664},"labels":[],"label_agreement":null},{"id":"W2113267287","doi":"10.1109/date.2005.59","title":"An Improved Multi-Level Framework for Force-Directed Placement","year":2005,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Heuristic; Quality (philosophy); Unification; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.031681822945312396,"score_gpt":0.2679957733737577,"score_spread":0.23631395042844527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113267287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011222508,0.0000588596,0.9969805,0.000031004234,0.000012682703,0.000030079751,0.000020773414,0.0006284977,0.0011153868],"genre_scores_gemma":[0.044983726,0.00011450066,0.95282114,0.00004034244,0.000019436016,0.00011610508,0.00007478555,0.00018791213,0.0016421058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936527,0.00009996243,0.000032000164,0.00007946355,0.00034534614,0.00007795602],"domain_scores_gemma":[0.99964654,0.00010277398,0.00003489396,0.000086270535,0.00010333347,0.00002611531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076024956,0.0009416825,0.0007654765,0.0013307831,0.00075258286,0.0013511833,0.002216742,0.0012179009,0.0059751733],"category_scores_gemma":[0.0013040917,0.0007349149,0.0010081702,0.00096498925,0.0007141948,0.0010775749,0.0013090438,0.0014154331,0.0018941956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007489318,0.0000756236,0.00031700186,0.00019248518,0.00003212973,0.0002147702,0.00015985381,0.7319326,0.02442548,0.07041822,0.0038002657,0.16835672],"study_design_scores_gemma":[0.00001694651,0.000037255224,0.00005960162,0.000017621567,0.000008574645,0.00006253879,0.000008194915,0.9805997,0.0029034482,0.00796173,0.008309547,0.00001473517],"about_ca_topic_score_codex":0.0058287675,"about_ca_topic_score_gemma":0.009662904,"teacher_disagreement_score":0.0059751733,"about_ca_system_score_codex":0.0011289363,"about_ca_system_score_gemma":0.0016693758,"threshold_uncertainty_score":0.019989014},"labels":[],"label_agreement":null},{"id":"W2113502461","doi":"10.1109/edac.1993.386479","title":"ML-Germinal: A new heuristic standard cell placement algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristic; Convergence (economics); Algorithm; Computer science; Point (geometry); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.011626576245762403,"score_gpt":0.19515569763697455,"score_spread":0.18352912139121214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113502461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013335252,0.00028314235,0.97727543,0.00012013241,0.00011488385,0.00006685152,0.00016298713,0.003081176,0.005560193],"genre_scores_gemma":[0.14148526,0.00019005798,0.84886605,0.00016973956,0.00006206806,0.00012892729,0.0006189389,0.00044525415,0.0080337245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.000037601923,0.00001593247,0.000050814975,0.00014595555,0.000039250222],"domain_scores_gemma":[0.9998099,0.000035051733,0.000022807291,0.000048303074,0.000064445165,0.000019555442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021171835,0.00054918387,0.00067025435,0.0010819935,0.00045092532,0.0011007735,0.0016906374,0.0008238884,0.0076519726],"category_scores_gemma":[0.00066688884,0.00031641216,0.0005639134,0.0009978091,0.00032997967,0.0008027033,0.0010016809,0.00065919384,0.002244418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028425886,0.00009673035,0.00051069073,0.00019411503,0.000056434958,0.00012545254,0.0000731433,0.23626655,0.023628704,0.014407002,0.016183097,0.7081739],"study_design_scores_gemma":[0.00007592174,0.00015775548,0.0003065806,0.000018971983,0.000019807294,0.0001577812,0.000027421767,0.959664,0.013724556,0.005467523,0.02035552,0.000024178957],"about_ca_topic_score_codex":0.003313391,"about_ca_topic_score_gemma":0.0070112217,"teacher_disagreement_score":0.0076519726,"about_ca_system_score_codex":0.00072327745,"about_ca_system_score_gemma":0.0009973006,"threshold_uncertainty_score":0.025598466},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00342918692884033,"score_gpt":0.18936024284456082,"score_spread":0.18593105591572048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113645429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97750425,0.0010455417,0.01603705,0.00024061496,0.000049820956,0.000033624656,0.00023842757,0.0007409513,0.0041095377],"genre_scores_gemma":[0.98955005,0.00026413877,0.009074811,0.00006248612,0.000014362312,0.000017703114,0.00022477622,0.000096880125,0.0006948473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993624,0.00011339397,0.00005825949,0.00012560227,0.00020565078,0.00013476479],"domain_scores_gemma":[0.9939262,0.0040119817,0.00060563424,0.0006696108,0.000642462,0.00014423317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501721,0.00055589306,0.00035015322,0.0005168171,0.00024327877,0.00053614454,0.00071279204,0.0003392486,0.002225998],"category_scores_gemma":[0.0060228226,0.0002937885,0.00018682532,0.00064996886,0.00026915717,0.0014441038,0.00038524906,0.00034071653,0.00034430771],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016421856,0.00038595358,0.038992412,0.00097285234,0.00016712747,0.00082465756,0.00032272947,0.4216937,0.34828845,0.0052435347,0.0028340037,0.17863245],"study_design_scores_gemma":[0.00013653723,0.0047616763,0.06751497,0.00008978478,0.000256625,0.001106219,0.00032462893,0.3394176,0.5778132,0.0027348963,0.00572387,0.00011986401],"about_ca_topic_score_codex":0.0013470158,"about_ca_topic_score_gemma":0.003155575,"teacher_disagreement_score":0.002225998,"about_ca_system_score_codex":0.0005585931,"about_ca_system_score_gemma":0.00036506203,"threshold_uncertainty_score":0.0074467063},"labels":[],"label_agreement":null},{"id":"W2113702211","doi":"10.1109/icvd.2003.1183116","title":"An efficient practical heuristic for good ratio-cut partitioning","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry","keywords":"Submodular set function; Heuristics; Algorithm; Mathematics; Heuristic; Computer science; Benchmark (surveying); Simulated annealing; Mathematical optimization","score_opus":0.01947762997045741,"score_gpt":0.28296894747007856,"score_spread":0.2634913174996211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113702211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01388424,0.00031231824,0.98058116,0.00016537514,0.000043280423,0.00024477812,0.00008172412,0.0010834852,0.0036037592],"genre_scores_gemma":[0.093180835,0.00014232068,0.9047792,0.0000967721,0.000026393296,0.00022348714,0.00027241462,0.00019289309,0.0010856474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905473,0.00024567236,0.000048368096,0.00017983907,0.00031959135,0.0001518775],"domain_scores_gemma":[0.9991019,0.0003709892,0.00008617067,0.00024687263,0.00014289336,0.000051121227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069182366,0.0011855587,0.0011786069,0.0017803904,0.00083358533,0.0009013892,0.0017804836,0.0012027542,0.00679256],"category_scores_gemma":[0.003264182,0.0005450724,0.0007491769,0.0019111763,0.0007051149,0.0015206394,0.0011801359,0.0010491497,0.0018188546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002887788,0.0003051265,0.0007045209,0.0003920487,0.00004860805,0.0003096865,0.00022773314,0.36391345,0.02348938,0.03605209,0.010619258,0.56364936],"study_design_scores_gemma":[0.00011007541,0.00023360169,0.00034289874,0.000033462617,0.00003633337,0.00046199223,0.000103166916,0.93960905,0.01158001,0.03521593,0.012230765,0.000042748674],"about_ca_topic_score_codex":0.0016807057,"about_ca_topic_score_gemma":0.0023572776,"teacher_disagreement_score":0.00679256,"about_ca_system_score_codex":0.0009403241,"about_ca_system_score_gemma":0.0012425114,"threshold_uncertainty_score":0.022723436},"labels":[],"label_agreement":null},{"id":"W2114452736","doi":"10.1109/fpl.2008.4629975","title":"The effect of sparse switch patterns on the area efficiency of multi-bit routing resources in field-programmable gate arrays","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Routing (electronic design automation); Block (permutation group theory); Exploit; Flexibility (engineering); Computer hardware; Logic block; Parallel computing; Embedded system","score_opus":0.017970199267990306,"score_gpt":0.21835694936224073,"score_spread":0.20038675009425042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114452736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99113595,0.0002071344,0.007163879,0.000070648966,0.000012907364,0.00001053801,0.00003532009,0.000115695955,0.0012479902],"genre_scores_gemma":[0.9943721,0.00009637489,0.0051473323,0.000029317318,0.000009048158,0.00001030721,0.000043504242,0.000019628354,0.00027241645],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999119,0.00028405056,0.000093375704,0.000093564675,0.00026166343,0.00014840218],"domain_scores_gemma":[0.99247956,0.005298761,0.00096796657,0.00072066474,0.00040507232,0.00012803072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066741754,0.0004742947,0.00023692987,0.00052285014,0.00025996674,0.00040353808,0.00057984324,0.00037355017,0.0011052375],"category_scores_gemma":[0.0047198203,0.0002282049,0.00018193465,0.00067836855,0.00036554105,0.0011057584,0.00037074214,0.0002521062,0.00015003141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029671243,0.000606728,0.021993292,0.00033048997,0.00015808808,0.00075212814,0.00022685059,0.3299423,0.44742745,0.0033689179,0.0011617924,0.19106492],"study_design_scores_gemma":[0.00017537059,0.005499622,0.01998145,0.000038945436,0.00022556887,0.0012958167,0.0001776137,0.3570422,0.610102,0.0028615824,0.0025481705,0.000051759613],"about_ca_topic_score_codex":0.0005745058,"about_ca_topic_score_gemma":0.0013338056,"teacher_disagreement_score":0.0011052375,"about_ca_system_score_codex":0.00032200737,"about_ca_system_score_gemma":0.00025884315,"threshold_uncertainty_score":0.003697455},"labels":[],"label_agreement":null},{"id":"W2114971758","doi":"10.1109/iscas.2011.5938203","title":"Machine-learning framework for automatic netlist creation","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; CMC Microsystems","keywords":"Netlist; Computer science; Set (abstract data type); Electronic circuit; Design flow; Computer architecture; Electronic design automation; Computer engineering; Embedded system; Programming language; Engineering; Electrical engineering","score_opus":0.022093692119366688,"score_gpt":0.23854532081088975,"score_spread":0.21645162869152307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114971758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037061924,0.000047378107,0.9973138,0.000019098175,0.0000062720646,0.00001910845,0.00003654566,0.0018924442,0.0002947265],"genre_scores_gemma":[0.028041184,0.00011896176,0.9699504,0.000055267148,0.00002359759,0.0001295854,0.00037439927,0.00024530836,0.0010613231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.0001685094,0.00006643212,0.00018700381,0.00035965405,0.000061358856],"domain_scores_gemma":[0.9988626,0.00056284026,0.00009311603,0.00020474383,0.00023308452,0.000043660373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017078901,0.00096576737,0.000822134,0.001690021,0.0007076174,0.0016288031,0.0026260829,0.0009533959,0.005747409],"category_scores_gemma":[0.0033044883,0.0004874641,0.001166023,0.00090509804,0.0009474646,0.0018691542,0.0011018687,0.0016111258,0.0023018694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014924478,0.000143885,0.0006649854,0.0005099746,0.00010239108,0.00030607244,0.00016548132,0.22178832,0.019727994,0.13752252,0.009540272,0.6093789],"study_design_scores_gemma":[0.000024139217,0.00004082101,0.00012408048,0.000043783322,0.000017228502,0.00016862813,0.00001539935,0.9283368,0.01201137,0.042235248,0.0169595,0.000023053448],"about_ca_topic_score_codex":0.0019940767,"about_ca_topic_score_gemma":0.0036120913,"teacher_disagreement_score":0.005747409,"about_ca_system_score_codex":0.0010373816,"about_ca_system_score_gemma":0.0013632638,"threshold_uncertainty_score":0.019226968},"labels":[],"label_agreement":null},{"id":"W2115546910","doi":"10.1109/92.920838","title":"Structural analysis and generation of synthetic digital circuits with memory","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Computer science; Electronic circuit; Digital electronics; Combinational logic; Benchmark (surveying); Electronic engineering; Sequential logic; Generator (circuit theory); Logic gate; Computer architecture; Computer engineering; Engineering; Algorithm; Electrical engineering; Power (physics)","score_opus":0.01293733158551884,"score_gpt":0.2052804723198291,"score_spread":0.19234314073431025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115546910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6807098,0.000156921,0.30676097,0.00030899135,0.000046744128,0.00009732627,0.00037518382,0.0006934417,0.010850606],"genre_scores_gemma":[0.93685144,0.00007563375,0.06092022,0.000031689386,0.000007702753,0.00008118325,0.000407248,0.00004961336,0.0015752155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998553,0.000025301762,0.0000065509244,0.000020179152,0.00007812855,0.00001464781],"domain_scores_gemma":[0.99962676,0.00017972114,0.000054269094,0.00006659672,0.000059660433,0.000013021825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000164786,0.0001698604,0.00010017829,0.0002702675,0.00017102438,0.00020594907,0.0003648034,0.00029622726,0.0011039596],"category_scores_gemma":[0.0010654284,0.00014379896,0.0001966966,0.00017910462,0.0003234951,0.00019287485,0.0001454082,0.00025309026,0.00014265449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012256311,0.00009274898,0.0018298888,0.00019251357,0.000025404157,0.0002897755,0.00014107184,0.55436116,0.31040955,0.09061024,0.00097471615,0.040950343],"study_design_scores_gemma":[0.000031429892,0.00019301144,0.00077036367,0.000008106942,0.00001361951,0.00013382192,0.00003565031,0.8017085,0.1807996,0.011674999,0.0046196794,0.000011156437],"about_ca_topic_score_codex":0.00033292468,"about_ca_topic_score_gemma":0.0005074467,"teacher_disagreement_score":0.0011039596,"about_ca_system_score_codex":0.00036964583,"about_ca_system_score_gemma":0.00024717962,"threshold_uncertainty_score":0.0036931634},"labels":[],"label_agreement":null},{"id":"W2115579119","doi":"10.1109/socdc.2009.5423783","title":"Chip package-system co-design","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Apache (Canada)","funders":"","keywords":"Chip; System on a chip; Computer science; Integrated circuit design; Embedded system; Dissipation; Power (physics); System in package; Chip-scale package; Telecommunications","score_opus":0.01631723666921509,"score_gpt":0.22064886285696708,"score_spread":0.204331626187752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115579119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005841606,0.000496783,0.93451536,0.00027330586,0.0005607465,0.0005025622,0.0002005239,0.00450547,0.05310361],"genre_scores_gemma":[0.3198899,0.0012888283,0.54314566,0.001143537,0.00035600996,0.0015537861,0.0013563955,0.001620778,0.12964508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986999,0.00020052142,0.000047093465,0.0001772132,0.0006921371,0.00018297668],"domain_scores_gemma":[0.9990332,0.00009901945,0.000042917833,0.00031266312,0.00046722236,0.000044999466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998679,0.0008957176,0.00053114933,0.00058619777,0.0005036504,0.0014514826,0.0014776645,0.00074965536,0.031388357],"category_scores_gemma":[0.0011205599,0.00045322764,0.00068747666,0.0003997407,0.00033330577,0.0008977353,0.0013137626,0.0011322977,0.018256772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033782012,0.00031399983,0.0015259476,0.0013517883,0.0003187927,0.0007710978,0.00025158635,0.10531816,0.13603874,0.0998879,0.05864601,0.5952381],"study_design_scores_gemma":[0.00016954073,0.0015626504,0.001443429,0.00014717177,0.0002588671,0.0019449289,0.00008726735,0.3027514,0.16059026,0.023975207,0.5069893,0.00008004773],"about_ca_topic_score_codex":0.0006226161,"about_ca_topic_score_gemma":0.0015069233,"teacher_disagreement_score":0.031388357,"about_ca_system_score_codex":0.0006332452,"about_ca_system_score_gemma":0.0014336543,"threshold_uncertainty_score":0.10500455},"labels":[],"label_agreement":null},{"id":"W2115663817","doi":"10.1109/iccd.1992.276198","title":"Improving FPGA routing architectures using architecture and CAD interactions","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Router; Flexibility (engineering); Computer science; Block (permutation group theory); Logic block; Architecture; Computer architecture; Embedded system; Programmable Array Logic; Gate array; Logic synthesis; Logic gate; Computer network; Logic family; Algorithm; Mathematics","score_opus":0.011274832272166803,"score_gpt":0.23054443388401005,"score_spread":0.21926960161184325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115663817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25470382,0.0013042137,0.66624194,0.00041363496,0.00009143204,0.00016952102,0.00008563106,0.006008223,0.07098164],"genre_scores_gemma":[0.5971685,0.0007246047,0.38997534,0.00013211703,0.000041171803,0.00009302715,0.00024445803,0.00038014608,0.011240699],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995441,0.00010766722,0.000023642579,0.000048590733,0.00022729248,0.00004862977],"domain_scores_gemma":[0.99951446,0.0001738779,0.000063899155,0.000121682126,0.000112159134,0.0000139597405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042916797,0.0007241361,0.00021196983,0.00074902194,0.00026487853,0.0008542902,0.0005186173,0.0002829738,0.0039576096],"category_scores_gemma":[0.0015524197,0.00027621083,0.00020821339,0.00053970877,0.00019861381,0.0008580814,0.0004945302,0.00038469912,0.00070782076],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014728802,0.0001104252,0.0020446195,0.00014777764,0.00003510626,0.00026614542,0.00016402765,0.35634497,0.13342157,0.017605996,0.0029703625,0.48674172],"study_design_scores_gemma":[0.0001380329,0.0010438062,0.0037497142,0.00008838167,0.00012766919,0.0010853499,0.00013683182,0.8053463,0.11695428,0.009298695,0.061972495,0.00005842964],"about_ca_topic_score_codex":0.00086297485,"about_ca_topic_score_gemma":0.0026127668,"teacher_disagreement_score":0.0039576096,"about_ca_system_score_codex":0.0004498233,"about_ca_system_score_gemma":0.0003968448,"threshold_uncertainty_score":0.013239503},"labels":[],"label_agreement":null},{"id":"W2116417357","doi":"10.1109/fpt.2004.1393307","title":"Retiming aware clustering for sequential circuits","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Retiming; Benchmark (surveying); Computer science; Cluster analysis; Parallel computing; Field-programmable gate array; Sequential logic; Minification; Node (physics); Electronic circuit; Algorithm; Logic synthesis; Logic gate; Computer hardware; Artificial intelligence; Engineering","score_opus":0.027402562084977388,"score_gpt":0.2507252586549246,"score_spread":0.22332269656994724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116417357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06439599,0.00072879886,0.9287916,0.00008433635,0.000057911584,0.00006111528,0.00006837958,0.002367622,0.0034441766],"genre_scores_gemma":[0.40060046,0.00038517072,0.59221137,0.00011700917,0.000049665574,0.000072551484,0.00023942118,0.00025453436,0.006069806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997639,0.000027543705,0.000014066742,0.000068429654,0.00009114314,0.000034863897],"domain_scores_gemma":[0.999546,0.00011375332,0.00006211981,0.00012126751,0.00013806419,0.000018745835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020568316,0.00060366647,0.0003543992,0.0010619588,0.0006292567,0.00036319238,0.0009731598,0.00029281955,0.0023924955],"category_scores_gemma":[0.0007929433,0.00028867798,0.0003550656,0.0008921769,0.000235828,0.00066122843,0.00035328127,0.00028806378,0.0005259186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026783533,0.00007457878,0.0009578083,0.00024695863,0.00006410334,0.00012194006,0.00013728248,0.14229284,0.12900412,0.010127071,0.0035722873,0.7131332],"study_design_scores_gemma":[0.000056666988,0.0003740016,0.0015228271,0.000027686718,0.00008807594,0.00046278728,0.00005981769,0.8544304,0.11747368,0.009232521,0.016226616,0.00004497673],"about_ca_topic_score_codex":0.004248741,"about_ca_topic_score_gemma":0.013562239,"teacher_disagreement_score":0.004248741,"about_ca_system_score_codex":0.000843491,"about_ca_system_score_gemma":0.0008594786,"threshold_uncertainty_score":0.008448005},"labels":[],"label_agreement":null},{"id":"W2116518941","doi":"10.1109/tcad.2005.862748","title":"Force-Directed Methods for Generic Placement","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":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Computer science; Placement; Cluster analysis; Minification; Mathematical optimization; Algorithm; Mathematics; Physical design; Artificial intelligence; Embedded system","score_opus":0.03467480259999626,"score_gpt":0.2627210986315455,"score_spread":0.22804629603154927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116518941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005233874,0.00017768054,0.9949987,0.000045164983,0.000032414766,0.000046817117,0.000042416923,0.00068406155,0.0034493087],"genre_scores_gemma":[0.023501381,0.00043876618,0.97025025,0.00010676272,0.0000494493,0.000344194,0.00017935577,0.00045238616,0.0046773637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994362,0.00011870306,0.000025714435,0.00006865899,0.0003176843,0.00003307989],"domain_scores_gemma":[0.9994174,0.00027832238,0.000052226846,0.000121961435,0.00010900424,0.000021167662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794957,0.001234445,0.00064259,0.0010767387,0.00056947,0.0007539877,0.0015547555,0.0012195905,0.013345614],"category_scores_gemma":[0.0019188492,0.0005653889,0.00090209587,0.0008778685,0.00072986906,0.0007752454,0.0015153779,0.0015337454,0.004472053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007025607,0.000075959855,0.00047080126,0.00070882327,0.00008855615,0.00018101171,0.00019882937,0.3861924,0.012501271,0.1984855,0.015716862,0.38530976],"study_design_scores_gemma":[0.00004879658,0.000041263866,0.00012615464,0.0000757103,0.000013252446,0.00013193837,0.000029610912,0.87273186,0.0032369143,0.067768775,0.055768088,0.000027718204],"about_ca_topic_score_codex":0.0022585124,"about_ca_topic_score_gemma":0.0030710674,"teacher_disagreement_score":0.013345614,"about_ca_system_score_codex":0.00071075605,"about_ca_system_score_gemma":0.00090797094,"threshold_uncertainty_score":0.044645548},"labels":[],"label_agreement":null},{"id":"W2118653269","doi":"10.1145/1065579.1065694","title":"Incremental retiming for FPGA physical synthesis","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Retiming; Field-programmable gate array; Computer science; Parallel computing; Computer architecture; Embedded system","score_opus":0.013365233755510304,"score_gpt":0.23179216931382068,"score_spread":0.2184269355583104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118653269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066186744,0.0004000197,0.9887728,0.000047549085,0.000033668606,0.000022657883,0.000020044732,0.0010594975,0.0030251264],"genre_scores_gemma":[0.23877016,0.0006262618,0.75601465,0.00009465687,0.000050839248,0.00008790386,0.00010992375,0.00018277911,0.004062723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998186,0.000042245276,0.000008751275,0.000022259595,0.00008974433,0.000018445566],"domain_scores_gemma":[0.99976975,0.00011623129,0.000020551055,0.000045305445,0.0000419989,0.000006294133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022460881,0.0003979776,0.00018047763,0.00042548613,0.00024135612,0.00033610532,0.00060854177,0.0002124129,0.004261161],"category_scores_gemma":[0.0008008807,0.00019836304,0.00023532378,0.00031739438,0.00023094803,0.0004773301,0.00029362802,0.00047507518,0.0007119366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014363108,0.000044201654,0.00023570922,0.00024599332,0.000024897909,0.0001250061,0.00007290825,0.21026456,0.06390987,0.044423383,0.0033748255,0.67713505],"study_design_scores_gemma":[0.000061083316,0.00020944465,0.00023365795,0.000036988575,0.000038585178,0.00016740398,0.000018671497,0.9127249,0.043434948,0.023196265,0.01985489,0.000023170445],"about_ca_topic_score_codex":0.0012762538,"about_ca_topic_score_gemma":0.0039666872,"teacher_disagreement_score":0.004261161,"about_ca_system_score_codex":0.0004251214,"about_ca_system_score_gemma":0.00051640323,"threshold_uncertainty_score":0.014255047},"labels":[],"label_agreement":null},{"id":"W2118867008","doi":"10.1109/iwsoc.2005.69","title":"Global lower bounds for the VLSI macrocell floorplanning problem using semidefinite optimization","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Macrocell; Floorplan; Semidefinite programming; Benchmark (surveying); Very-large-scale integration; Computer science; Integer programming; Mathematical optimization; Upper and lower bounds; Integer (computer science); Parallel computing; Algorithm; Mathematics; Telecommunications; Embedded system","score_opus":0.015310811595894465,"score_gpt":0.24136071035656403,"score_spread":0.22604989876066958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118867008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013336244,0.00073107536,0.97424966,0.00042098758,0.000056748504,0.000051537085,0.0002362808,0.00030223659,0.010615226],"genre_scores_gemma":[0.4975713,0.0018004474,0.48841435,0.00041327064,0.00020490304,0.00068865664,0.001372683,0.0007251714,0.008809215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987457,0.00051317475,0.000043004366,0.00015747006,0.00038843762,0.00015212894],"domain_scores_gemma":[0.99276215,0.0055014575,0.00044069954,0.0004128193,0.00066050864,0.0002224011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033450015,0.0025565822,0.0013738236,0.0010294754,0.00053926907,0.00238556,0.0012767956,0.0011129508,0.00717838],"category_scores_gemma":[0.006697874,0.00068748585,0.0008951443,0.0013270185,0.0013983147,0.0023015682,0.0017695795,0.003057629,0.00081381976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057510635,0.00004933305,0.00019809019,0.0001322826,0.000031819476,0.000043613854,0.00003248654,0.9597507,0.0016011592,0.02037554,0.0019119318,0.015815465],"study_design_scores_gemma":[0.000011738113,0.000055936907,0.00006175252,0.000018331273,0.0000066963257,0.000015105205,0.0000128012225,0.98442924,0.000922439,0.013847873,0.0006129738,0.000005159451],"about_ca_topic_score_codex":0.0016937371,"about_ca_topic_score_gemma":0.0036506427,"teacher_disagreement_score":0.00717838,"about_ca_system_score_codex":0.0013055458,"about_ca_system_score_gemma":0.0013551022,"threshold_uncertainty_score":0.024014056},"labels":[],"label_agreement":null},{"id":"W2118882683","doi":"10.1109/ccece.1998.682778","title":"On the FPGA board level routing problem","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Montréal","funders":"","keywords":"Emulation; Routing (electronic design automation); Field-programmable gate array; Simple (philosophy); Computer science; Constraint (computer-aided design); Logic synthesis; Logic gate; Parallel computing; Embedded system; Algorithm; Mathematics","score_opus":0.046674579398864324,"score_gpt":0.20446758714914792,"score_spread":0.1577930077502836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118882683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087807044,0.0020333247,0.85405576,0.0019853686,0.0002953352,0.00020066509,0.0004863903,0.000432734,0.052703522],"genre_scores_gemma":[0.5744588,0.004713617,0.38018453,0.00071984547,0.0004369149,0.00034913048,0.0014255455,0.00048151752,0.037230227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993475,0.0002447786,0.000024658091,0.00016244089,0.00009351657,0.00012707124],"domain_scores_gemma":[0.99878675,0.00089563866,0.000096526564,0.00008430702,0.00006554307,0.000071304945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057973276,0.0010838938,0.0007902522,0.00039476957,0.00072736386,0.0020717108,0.00078759954,0.0018905685,0.011065589],"category_scores_gemma":[0.003220088,0.0003746109,0.0006081953,0.0011482637,0.0009925705,0.0026309832,0.0009080271,0.0013711107,0.0011288793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015736719,0.00010583478,0.0010794448,0.00036382148,0.000041247313,0.00072303007,0.00011712887,0.6919996,0.002477459,0.19457793,0.011843831,0.0965134],"study_design_scores_gemma":[0.00008342912,0.00017559095,0.00064332964,0.00007318547,0.00003806115,0.00073822105,0.00017382219,0.7891789,0.0022334307,0.18151441,0.025119111,0.0000285011],"about_ca_topic_score_codex":0.0017583853,"about_ca_topic_score_gemma":0.0012985355,"teacher_disagreement_score":0.011065589,"about_ca_system_score_codex":0.00068085303,"about_ca_system_score_gemma":0.0006449638,"threshold_uncertainty_score":0.03701812},"labels":[],"label_agreement":null},{"id":"W2118988958","doi":"10.1145/1344671.1344680","title":"WireMap","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xilinx (Canada)","funders":"","keywords":"Lookup table; Reduction (mathematics); Computer science; Heuristic; Enhanced Data Rates for GSM Evolution; Routing (electronic design automation); Path (computing); Algorithm; Mathematics; Embedded system; Telecommunications; Computer network; Artificial intelligence","score_opus":0.013113374030621133,"score_gpt":0.16532515317880578,"score_spread":0.15221177914818465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118988958","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007394392,0.002599607,0.5986803,0.0009274022,0.0011695098,0.00033276159,0.0073016514,0.10043454,0.28115985],"genre_scores_gemma":[0.09680402,0.004098772,0.44575801,0.0016499574,0.00038537107,0.00083091244,0.043791782,0.020980723,0.38570046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994722,0.000047151465,0.00003131101,0.0000975797,0.0002917866,0.000059967086],"domain_scores_gemma":[0.99949,0.00007563419,0.000025291458,0.00020321956,0.00017440558,0.000031351876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032092762,0.00089407875,0.00040003692,0.0013005047,0.0004916792,0.0014169033,0.0019315493,0.00067607895,0.12257375],"category_scores_gemma":[0.0011216577,0.00057223864,0.00063491677,0.0013646225,0.00022123511,0.0023875977,0.0016376115,0.0006547169,0.05483915],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018488575,0.00006003913,0.0004452873,0.00050192734,0.000046387926,0.00018348038,0.00008375706,0.006026653,0.008708422,0.03222463,0.25061047,0.700924],"study_design_scores_gemma":[0.000050972572,0.00008325882,0.000328219,0.000055132787,0.000028251658,0.00040427994,0.000041051542,0.019164698,0.012441309,0.01722848,0.95013964,0.000034845372],"about_ca_topic_score_codex":0.00082987064,"about_ca_topic_score_gemma":0.0018909358,"teacher_disagreement_score":0.87742627,"about_ca_system_score_codex":0.00040586543,"about_ca_system_score_gemma":0.0006413553,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2120569261","doi":"10.5555/1950815.1950894","title":"Area-efficient FPGA logic elements: architecture and synthesis","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Logic optimization; Computer science; Logic synthesis; Programmable logic array; Functional decomposition; Lookup table; Logic family; Logic block; Logic gate; Field-programmable gate array; Sequential logic; Trimming; Programmable logic device; Parallel computing; Combinational logic; Algorithm; Computer hardware","score_opus":0.02449781595460505,"score_gpt":0.1957363852504816,"score_spread":0.17123856929587655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120569261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13333765,0.0014469528,0.822007,0.00036227645,0.000077587196,0.000112425434,0.00013145582,0.0010102713,0.04151437],"genre_scores_gemma":[0.57907003,0.00056828366,0.41267326,0.000092662274,0.00003407239,0.000068456626,0.00015718595,0.00006085413,0.0072751017],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998938,0.000024538173,0.000006090671,0.000014331224,0.000045415847,0.000015810734],"domain_scores_gemma":[0.9999248,0.000021946415,0.000010009984,0.000016314947,0.000023783563,0.0000030422468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012439191,0.00019353344,0.00009457032,0.00024648794,0.0001350766,0.0003669224,0.00039294278,0.00022097772,0.0024105613],"category_scores_gemma":[0.0002834128,0.000108051936,0.00014327721,0.00028979592,0.00016891798,0.00035019248,0.00012388444,0.00025032705,0.0005851243],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019990583,0.000098264914,0.0012813907,0.00037788827,0.000031382653,0.00023663322,0.000093657254,0.25491843,0.2353504,0.1481399,0.004728789,0.35454342],"study_design_scores_gemma":[0.000048800874,0.000319061,0.0011534952,0.00006758358,0.000027423019,0.00035966237,0.000045303335,0.79741764,0.14278279,0.025106996,0.032653105,0.0000181794],"about_ca_topic_score_codex":0.00055992516,"about_ca_topic_score_gemma":0.001587872,"teacher_disagreement_score":0.0024105613,"about_ca_system_score_codex":0.0003886731,"about_ca_system_score_gemma":0.00031662465,"threshold_uncertainty_score":0.008064151},"labels":[],"label_agreement":null},{"id":"W2121764243","doi":"10.1109/iwsoc.2005.15","title":"A low-power partitioning methodology by maximizing sleep time and minimizing cut nets","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Computer science; Maximization; Minification; Very-large-scale integration; Heuristic; Power (physics); Dual (grammatical number); Genetic algorithm; Idle; Algorithm; Mathematics; Embedded system","score_opus":0.017046975054928432,"score_gpt":0.2349584021968112,"score_spread":0.21791142714188275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121764243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058988422,0.0004671831,0.936028,0.00012904391,0.000027824042,0.00008962255,0.000046850488,0.00034335625,0.0038796186],"genre_scores_gemma":[0.3745382,0.00028552886,0.6214622,0.00009827225,0.000024084537,0.00013468243,0.00012772143,0.00010100647,0.0032283552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999863,0.000029207093,0.000006670639,0.000026663147,0.00005551272,0.00001887335],"domain_scores_gemma":[0.99982196,0.00006234257,0.00003718395,0.000019819206,0.00004558041,0.000013154115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002385567,0.00048298368,0.0003541908,0.0005844354,0.00029173167,0.00032954392,0.0007838678,0.0003283782,0.0010821575],"category_scores_gemma":[0.00051909604,0.00020031635,0.0002852192,0.0006479031,0.0003017523,0.0005489578,0.00027389816,0.00032468527,0.00021890562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013872268,0.00017298729,0.0011308844,0.00026717712,0.00006321034,0.00015723372,0.00019822178,0.37504327,0.15193313,0.022764688,0.0025804741,0.44554996],"study_design_scores_gemma":[0.0000686185,0.0007364945,0.0016950048,0.000034416327,0.00008818196,0.0007328093,0.0000964812,0.9148363,0.05705832,0.015738105,0.008879416,0.00003579196],"about_ca_topic_score_codex":0.0010752591,"about_ca_topic_score_gemma":0.0031209816,"teacher_disagreement_score":0.0010821575,"about_ca_system_score_codex":0.00035612038,"about_ca_system_score_gemma":0.0007647656,"threshold_uncertainty_score":0.0036201477},"labels":[],"label_agreement":null},{"id":"W2121969545","doi":"","title":"Via-programmable logic array VPEX2 with configurable DFF using 2 logic elements","year":2009,"lang":"en","type":"article","venue":"Proceedings of the 2009 12th International Symposium on Integrated Circuits","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Programmable logic array; Programmable logic device; Programmable Array Logic; Logic gate; Logic family; Pass transistor logic; Simple programmable logic device; AND-OR-Invert; Computer science; Logic synthesis; Macrocell array; Logic optimization; Sequential logic; Electronic circuit; Computer hardware; Electronic engineering; Arithmetic; Digital electronics; Algorithm; Engineering; Mathematics; Electrical engineering","score_opus":0.015432732048414001,"score_gpt":0.2319377623383298,"score_spread":0.2165050302899158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121969545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8307645,0.0009216807,0.14362617,0.00024511287,0.00020537568,0.00015097742,0.00047987982,0.001996384,0.021609843],"genre_scores_gemma":[0.9484471,0.00014435026,0.04585533,0.00006329145,0.000021038972,0.000058036145,0.00021453305,0.000039182094,0.0051571555],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999764,0.00003448185,0.000013325824,0.00007013077,0.000069745656,0.00004831661],"domain_scores_gemma":[0.99979585,0.000030459869,0.000046060806,0.000051891475,0.000058992726,0.000016800039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014133101,0.00041317943,0.00023991826,0.0003332022,0.00018169335,0.00054024917,0.00082908024,0.00036655515,0.0022874821],"category_scores_gemma":[0.00027580795,0.00016555835,0.00022599501,0.00038296927,0.00017531426,0.0008406875,0.0003148033,0.00024703683,0.00037232894],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006230755,0.00018149224,0.0036605392,0.0002995568,0.000100568686,0.0010363493,0.00010474107,0.028510885,0.85294837,0.011244318,0.0032071788,0.09808292],"study_design_scores_gemma":[0.0002056837,0.0027096202,0.0050909417,0.000027698983,0.00008512057,0.0018235309,0.00006449112,0.10612525,0.84080297,0.0019867562,0.040987153,0.00009079982],"about_ca_topic_score_codex":0.00037063207,"about_ca_topic_score_gemma":0.00064951624,"teacher_disagreement_score":0.0022874821,"about_ca_system_score_codex":0.0004664135,"about_ca_system_score_gemma":0.00018559488,"threshold_uncertainty_score":0.007652402},"labels":[],"label_agreement":null},{"id":"W2122110986","doi":"10.1177/0037549709102760","title":"A Multiway Design-driven Partitioning Algorithm for Distributed Verilog Simulation","year":2009,"lang":"en","type":"article","venue":"SIMULATION","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Netlist; Computer science; Verilog; Algorithm; Very-large-scale integration; Hypergraph; Parallel computing; Speedup; Theoretical computer science; Mathematics; Field-programmable gate array; Computer hardware; Embedded system","score_opus":0.02922559888970879,"score_gpt":0.2835362861571888,"score_spread":0.25431068726748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122110986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029492476,0.00003502759,0.9952982,0.000027582815,0.0000084784315,0.00003795054,0.000019787361,0.00090000767,0.0007236874],"genre_scores_gemma":[0.07867061,0.0000522123,0.9193009,0.000046547168,0.000007255479,0.00018220929,0.000149572,0.0002156772,0.0013749788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.0001320061,0.000024199875,0.00007019248,0.000160344,0.00003967233],"domain_scores_gemma":[0.99932635,0.0003291924,0.000053125616,0.00014088162,0.0001207834,0.000029623276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962512,0.0007493611,0.00048292268,0.00062803837,0.00055542355,0.0006813984,0.0012767488,0.0007573215,0.003983541],"category_scores_gemma":[0.0016439236,0.0005050212,0.0006807963,0.0004619034,0.0004999795,0.0010935293,0.0008736087,0.001065469,0.00082557095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017106533,0.00008475263,0.000595861,0.000120129,0.000059018545,0.00007619772,0.00014059941,0.6760693,0.019534841,0.023789046,0.0025643765,0.27679485],"study_design_scores_gemma":[0.000029725876,0.0000377422,0.000054070784,0.000006913764,0.000008216407,0.000026410265,0.000007661632,0.98814595,0.0040434226,0.005209765,0.002423414,0.0000066912535],"about_ca_topic_score_codex":0.00240651,"about_ca_topic_score_gemma":0.0045086346,"teacher_disagreement_score":0.003983541,"about_ca_system_score_codex":0.0008885814,"about_ca_system_score_gemma":0.0010342967,"threshold_uncertainty_score":0.013326228},"labels":[],"label_agreement":null},{"id":"W2123201137","doi":"10.1109/saahpc.2011.16","title":"GPU-Accelerated Wire-Length Estimation for FPGA Placement","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Field-programmable gate array; Thread (computing); Exploit; Cardinality (data modeling); CUDA; Massively parallel; Algorithm; Embedded system","score_opus":0.05265519832774968,"score_gpt":0.2457630288427234,"score_spread":0.19310783051497374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123201137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11243222,0.0005068477,0.87083364,0.0001742746,0.00007096537,0.00006324829,0.0003554544,0.008926179,0.0066371476],"genre_scores_gemma":[0.4089694,0.0003149246,0.5867614,0.00003703626,0.000019967716,0.00004787234,0.000626342,0.000297285,0.0029257918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978155,0.000050142688,0.000011307134,0.000028306018,0.000110292516,0.000018420342],"domain_scores_gemma":[0.99938715,0.00019286794,0.000072865005,0.0001251133,0.00019896272,0.000022993023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026679283,0.0004961861,0.0004178476,0.00087375805,0.00027011655,0.00073704706,0.000738279,0.00033293833,0.0031542387],"category_scores_gemma":[0.0015879023,0.00030000252,0.00027690138,0.0012459306,0.00014946083,0.0007220918,0.00032153065,0.0004131729,0.000775701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038333877,0.000095439675,0.006592756,0.00017081987,0.0000674644,0.0001495723,0.0001034211,0.44348523,0.05177967,0.008275417,0.008387774,0.4805091],"study_design_scores_gemma":[0.0000089840305,0.000030619096,0.00081881817,0.0000051585926,0.000004445497,0.000031068223,0.000010028586,0.9900137,0.0066066207,0.0009329828,0.001531036,0.0000065197787],"about_ca_topic_score_codex":0.008900067,"about_ca_topic_score_gemma":0.0152985435,"teacher_disagreement_score":0.008900067,"about_ca_system_score_codex":0.0007925368,"about_ca_system_score_gemma":0.0009137026,"threshold_uncertainty_score":0.01769656},"labels":[],"label_agreement":null},{"id":"W2123802188","doi":"10.1145/360276.360300","title":"Detailed routing architectures for embedded programmable logic IP cores","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Application-specific integrated circuit; Routing (electronic design automation); Logic block; Programmable logic device; Block (permutation group theory); Computer science; Field-programmable gate array; Programmable logic array; Channel (broadcasting); Programmable Array Logic; Chip; Logic synthesis; Parallel computing; Simple programmable logic device; Logic gate; Computer hardware; Logic family; Embedded system; Algorithm; Mathematics; Telecommunications","score_opus":0.021818477297364424,"score_gpt":0.2526746141540688,"score_spread":0.23085613685670436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123802188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24625327,0.0016052227,0.72640204,0.00023978682,0.000083374245,0.00011442824,0.0002448751,0.0026355144,0.022421475],"genre_scores_gemma":[0.6710914,0.0007636979,0.31836173,0.00015460268,0.000034528483,0.000111734735,0.0005794326,0.00016909487,0.008733794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998759,0.000024291581,0.000009987678,0.000020357245,0.000046574565,0.000022842101],"domain_scores_gemma":[0.99974674,0.00007479477,0.00004624287,0.00006894124,0.00004955612,0.000013720537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022949644,0.00033986656,0.00021131922,0.00027211363,0.00015106887,0.00041780638,0.0005130852,0.00023014129,0.0028133756],"category_scores_gemma":[0.00053287117,0.00023306227,0.0001859644,0.00034907102,0.00017911232,0.00071713835,0.00026025565,0.00029381004,0.00050107273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031935144,0.000082013685,0.00086022547,0.00028056692,0.00005322379,0.00015534932,0.00008847621,0.53047556,0.15589716,0.085087076,0.0058742254,0.22082682],"study_design_scores_gemma":[0.00006584448,0.0006314903,0.0014360746,0.000029743602,0.000049670085,0.0003016318,0.000027431104,0.90693545,0.034879,0.030837264,0.024774207,0.000032204636],"about_ca_topic_score_codex":0.0004168494,"about_ca_topic_score_gemma":0.0016911903,"teacher_disagreement_score":0.0028133756,"about_ca_system_score_codex":0.00042959774,"about_ca_system_score_gemma":0.00032791082,"threshold_uncertainty_score":0.009411633},"labels":[],"label_agreement":null},{"id":"W2124402195","doi":"10.1109/fccm.2013.40","title":"Escaping the Academic Sandbox: Realizing VPR Circuits on Xilinx Devices","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Netlist; Field-programmable gate array; Computer science; Bitstream; Routing (electronic design automation); Sandbox (software development); Verilog; Embedded system; Suite; Computer architecture; CAD; State (computer science); Virtex; Computer hardware; Operating system; Engineering; Telecommunications","score_opus":0.023327690126324872,"score_gpt":0.23527031926127703,"score_spread":0.21194262913495215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124402195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15896995,0.0008170674,0.7473704,0.0004993397,0.0003532656,0.00019933809,0.00027813204,0.02216713,0.06934546],"genre_scores_gemma":[0.53662884,0.00044801383,0.43681154,0.00033946382,0.00005075139,0.00019366245,0.000505545,0.002320542,0.022701688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996039,0.00008183027,0.000022713693,0.000054834498,0.00018389682,0.00005275434],"domain_scores_gemma":[0.9996506,0.00011145016,0.000035383386,0.00013562416,0.000051422176,0.000015438263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042450207,0.0004302506,0.00021204523,0.00038676793,0.00029563223,0.0006815747,0.0009835445,0.00040065194,0.010013566],"category_scores_gemma":[0.0012377164,0.00023832936,0.00026588427,0.00026220633,0.00027671113,0.001231709,0.0007189079,0.0005796656,0.0019843953],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043119458,0.00023697558,0.002071455,0.0005652264,0.000067206594,0.0012668472,0.0013144478,0.06952216,0.19949815,0.09806411,0.03172518,0.595237],"study_design_scores_gemma":[0.00028060802,0.0011036628,0.002103913,0.00019468028,0.00007098249,0.0013997585,0.00029889232,0.34353328,0.39965793,0.02745974,0.2238033,0.00009323534],"about_ca_topic_score_codex":0.00052923703,"about_ca_topic_score_gemma":0.0011874343,"teacher_disagreement_score":0.010013566,"about_ca_system_score_codex":0.00046610594,"about_ca_system_score_gemma":0.00033358904,"threshold_uncertainty_score":0.033498764},"labels":[],"label_agreement":null},{"id":"W2124752818","doi":"10.1109/tc.2003.1159751","title":"General models and a reduction design technique for FPGA switch box designs","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Reduction (mathematics); Field-programmable gate array; Set (abstract data type); Topology (electrical circuits); Embedded system; Mathematics; Combinatorics","score_opus":0.04322566978115681,"score_gpt":0.24254347381377225,"score_spread":0.19931780403261545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124752818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010962258,0.00012598914,0.9829927,0.00009238764,0.000013610138,0.000060613915,0.00007286319,0.00025176775,0.005427855],"genre_scores_gemma":[0.34227186,0.0005639696,0.64608383,0.00012599619,0.0000501281,0.0003569204,0.00049250113,0.00014801293,0.009906683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.00011986726,0.00002038339,0.00008628612,0.00016595231,0.000055826233],"domain_scores_gemma":[0.9997522,0.000087547895,0.000027852355,0.00009591918,0.000027629518,0.000008776946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048200472,0.00072463753,0.00045457538,0.00050654996,0.00042048804,0.0007080876,0.0011135034,0.0005930982,0.004139376],"category_scores_gemma":[0.00080210617,0.0005262636,0.001600318,0.0005369971,0.00086861267,0.0012821081,0.0008990968,0.0012121848,0.0006529708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077952944,0.00006951061,0.00024661425,0.00020164844,0.000040848532,0.00019183748,0.00016411985,0.54665035,0.012589097,0.3767861,0.0020163835,0.06096548],"study_design_scores_gemma":[0.000037554677,0.00009783489,0.00019874099,0.00002935783,0.000042243515,0.00017184384,0.000047036876,0.81256485,0.0069100973,0.16513297,0.01474694,0.000020498861],"about_ca_topic_score_codex":0.0014002376,"about_ca_topic_score_gemma":0.0025188627,"teacher_disagreement_score":0.004139376,"about_ca_system_score_codex":0.00073943305,"about_ca_system_score_gemma":0.0005713824,"threshold_uncertainty_score":0.01384753},"labels":[],"label_agreement":null},{"id":"W2125290282","doi":"10.1109/ccece.2009.5090315","title":"Near-linear wirelength estimation for FPGA placement","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Routing (electronic design automation); Reduction (mathematics); Path (computing); Algorithm; Parallel computing; Static timing analysis; Star (game theory); Critical path method; Differentiable function; Placement; Computer engineering; Circuit design; Embedded system; Mathematics; Physical design","score_opus":0.012375305794748607,"score_gpt":0.24766384199299607,"score_spread":0.23528853619824747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125290282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017325778,0.00012592468,0.98033327,0.000049305054,0.000008223836,0.000009969031,0.000041686213,0.0008389192,0.001266917],"genre_scores_gemma":[0.6101076,0.00031631396,0.38473177,0.00004613122,0.000017681921,0.000048347134,0.00021687156,0.0002281211,0.0042871786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995869,0.0001060171,0.0000130198905,0.00008272715,0.00018680081,0.000024589055],"domain_scores_gemma":[0.9992442,0.0003393655,0.000120529534,0.00015606443,0.00012356597,0.00001634756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049641007,0.000489532,0.00033371625,0.00045500023,0.00022018356,0.0005121656,0.00065260346,0.00038489467,0.0020237465],"category_scores_gemma":[0.0016726938,0.00044786945,0.0002813535,0.0005534917,0.0003351555,0.0011681112,0.00042096668,0.0005631783,0.00076931494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006889064,0.000019912251,0.0009594764,0.000042789372,0.000012246646,0.00004070161,0.000029088795,0.88605446,0.010346574,0.007405128,0.0008324011,0.094188266],"study_design_scores_gemma":[0.0000016325246,0.000023214794,0.00017496386,0.0000017728323,0.0000016185168,0.000024665118,0.000004444485,0.99494153,0.002356657,0.0019819632,0.00048424338,0.0000033059112],"about_ca_topic_score_codex":0.0036390577,"about_ca_topic_score_gemma":0.005504477,"teacher_disagreement_score":0.0036390577,"about_ca_system_score_codex":0.00082283793,"about_ca_system_score_gemma":0.00093025,"threshold_uncertainty_score":0.0072357655},"labels":[],"label_agreement":null},{"id":"W2126743471","doi":"10.1109/iwsoc.2005.17","title":"A multilevel eigenvalue based circuit partitioning technique","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Very-large-scale integration; Partition (number theory); Computer science; Electronic circuit; Eigenvalues and eigenvectors; Matrix (chemical analysis); Algorithm; Physical design; Eigendecomposition of a matrix; Parallel computing; Circuit design; Mathematics; Engineering; Embedded system","score_opus":0.020216498490102118,"score_gpt":0.21608332661219026,"score_spread":0.19586682812208814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126743471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013540024,0.00014386905,0.9801845,0.000114203045,0.000036090205,0.00005228846,0.000053768348,0.0008201076,0.00505518],"genre_scores_gemma":[0.19095638,0.00021637125,0.7999854,0.00015333715,0.00004524484,0.00012716316,0.00025953833,0.00014491554,0.008111539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965143,0.000043769596,0.000016131384,0.00006207603,0.00018421486,0.00004243464],"domain_scores_gemma":[0.9997143,0.000070398135,0.000028116196,0.000075753975,0.000093569986,0.000017781147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018755262,0.00043065852,0.00040604323,0.0008202305,0.0006179293,0.00049678236,0.0006948039,0.00043897337,0.005670233],"category_scores_gemma":[0.0006792105,0.00023719094,0.0004965741,0.00068112725,0.00033923824,0.00076545746,0.0007695566,0.00063351623,0.0017602738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015867123,0.00009977689,0.00050754315,0.00016901229,0.00006592668,0.00029449572,0.00023560847,0.08412789,0.31736067,0.05231663,0.0076792124,0.53698456],"study_design_scores_gemma":[0.000056037097,0.00029043914,0.0011269219,0.000028601005,0.000049437527,0.0008808054,0.00010344427,0.85051525,0.09352144,0.026814234,0.026559317,0.000054110205],"about_ca_topic_score_codex":0.0013471774,"about_ca_topic_score_gemma":0.002737718,"teacher_disagreement_score":0.005670233,"about_ca_system_score_codex":0.00041023488,"about_ca_system_score_gemma":0.00046140878,"threshold_uncertainty_score":0.018968761},"labels":[],"label_agreement":null},{"id":"W2127275081","doi":"10.1109/ccece.2009.5090316","title":"Analog placement design with constraints of multiple symmetry groups","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive closure; Computational complexity theory; Topology (electrical circuits); Representation (politics); Graph; Mathematics; Symmetry (geometry); Algorithm; Computer science; Mathematical optimization; Combinatorics; Geometry","score_opus":0.013668960172385027,"score_gpt":0.20572857605736292,"score_spread":0.19205961588497789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127275081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024592955,0.000096119795,0.97033095,0.00007304838,0.000039018778,0.0000542539,0.000030913292,0.00027203167,0.004510801],"genre_scores_gemma":[0.56766206,0.00017023826,0.42888504,0.00008146704,0.0000499806,0.000110574445,0.000103314414,0.00009063862,0.0028466403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00024621867,0.00006718192,0.000104884704,0.00037891115,0.00006606736],"domain_scores_gemma":[0.9992212,0.0002982275,0.00015444655,0.0001826812,0.00011888697,0.000024486331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006299882,0.00062629924,0.00044360798,0.00048969535,0.00042821193,0.000641175,0.00081587856,0.00037876176,0.002847232],"category_scores_gemma":[0.001552759,0.00029851205,0.00046554886,0.0005251054,0.0005500438,0.0009444584,0.00066597416,0.00037263858,0.00043506597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036400236,0.00010352087,0.0009193023,0.00040538452,0.00007365603,0.00081234437,0.0002766339,0.46008277,0.108286075,0.10634568,0.0025909967,0.31973967],"study_design_scores_gemma":[0.00012847265,0.0004956225,0.00033257678,0.000035213925,0.000053669737,0.0005319587,0.0000933438,0.8719889,0.066911235,0.044494394,0.014904928,0.000029729435],"about_ca_topic_score_codex":0.0005311422,"about_ca_topic_score_gemma":0.00085048587,"teacher_disagreement_score":0.002847232,"about_ca_system_score_codex":0.0004683571,"about_ca_system_score_gemma":0.00058128306,"threshold_uncertainty_score":0.009524941},"labels":[],"label_agreement":null},{"id":"W2127309005","doi":"10.1109/tvlsi.2008.2008188","title":"Using the Minimum Set of Input Combinations to Minimize the Area of Local Routing Networks in Logic Clusters Containing Logically Equivalent I/Os in FPGAs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Routing (electronic design automation); Field-programmable gate array; Computer science; Logic synthesis; Lookup table; Set (abstract data type); Flexibility (engineering); Logic optimization; Logic family; Logic gate; Arithmetic; Parallel computing; Algorithm; Mathematics; Embedded system; Multiplexing; Programming language; Telecommunications","score_opus":0.039619554507284944,"score_gpt":0.2720311911488703,"score_spread":0.23241163664158537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127309005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36235294,0.00055016315,0.61996925,0.00032005153,0.000039670187,0.00018466085,0.00019003285,0.0012586239,0.0151346605],"genre_scores_gemma":[0.8026617,0.00019325233,0.1934897,0.000075407246,0.000021492744,0.00014861225,0.00019288575,0.00025456015,0.0029624086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995376,0.00013737075,0.00003232649,0.000118168056,0.00010884003,0.00006576691],"domain_scores_gemma":[0.99950075,0.00023537158,0.000088333734,0.00009309797,0.000051992745,0.000030469382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039867626,0.00086011225,0.0007426607,0.00052682066,0.00061463594,0.0009909812,0.0010383436,0.0004033771,0.003540989],"category_scores_gemma":[0.0019391561,0.0004740129,0.00045754266,0.0006074272,0.000473573,0.0013529081,0.00070565805,0.00046233556,0.00048612076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000737379,0.00018681664,0.0021621038,0.00039939137,0.00011675979,0.0003979358,0.00018411072,0.7083043,0.060193267,0.018847568,0.0025783535,0.20589209],"study_design_scores_gemma":[0.00007288008,0.0004958284,0.0014362064,0.000044051787,0.000117703436,0.0004025855,0.0001415551,0.93359005,0.039896246,0.020567842,0.0032088344,0.000026298929],"about_ca_topic_score_codex":0.0008980151,"about_ca_topic_score_gemma":0.0028041997,"teacher_disagreement_score":0.003540989,"about_ca_system_score_codex":0.0006260077,"about_ca_system_score_gemma":0.0010432628,"threshold_uncertainty_score":0.011845827},"labels":[],"label_agreement":null},{"id":"W2127958790","doi":"10.1109/icecs.2007.4511137","title":"Application of Diversity Controlled Genetic Algorithms to the Design and Optimization of OTA-C IF Filters","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convergence (economics); Filter (signal processing); Computer science; Optimization problem; Genetic algorithm; Electronic engineering; Algorithm; Engineering; Mathematical optimization; Mathematics","score_opus":0.011505174421973836,"score_gpt":0.20879362762101927,"score_spread":0.19728845319904545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127958790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10495224,0.0003785416,0.89066213,0.00012665089,0.000018898634,0.000039906437,0.0000138599235,0.0002005559,0.0036071213],"genre_scores_gemma":[0.7135149,0.00026249906,0.28440267,0.00005965802,0.00001553547,0.00010181285,0.000029776644,0.000033623342,0.0015794511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987113,0.000037457274,0.000004918393,0.000020102967,0.000050350896,0.000016047457],"domain_scores_gemma":[0.99975866,0.00014606341,0.000030054,0.000013202294,0.000043322354,0.000008656194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035660653,0.00044244385,0.0003076184,0.00037915914,0.00022147298,0.0003558331,0.00030304477,0.00046290708,0.0003866551],"category_scores_gemma":[0.00085763546,0.00017233577,0.00021766228,0.00033403837,0.00035032953,0.0001749761,0.0002507133,0.00031768804,0.000067468085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040562223,0.000023106875,0.00049427885,0.00002941849,0.000020674997,0.000041716037,0.000040737446,0.9271055,0.011901907,0.005563868,0.00018807349,0.05455023],"study_design_scores_gemma":[0.000017535633,0.000039043734,0.00014287217,0.0000037478499,0.000007401462,0.00002158988,0.000010221481,0.99249744,0.0047728275,0.0017494585,0.00073380984,0.0000040272917],"about_ca_topic_score_codex":0.0016043748,"about_ca_topic_score_gemma":0.0018071017,"teacher_disagreement_score":0.0016043748,"about_ca_system_score_codex":0.00042027782,"about_ca_system_score_gemma":0.0005277341,"threshold_uncertainty_score":0.0031901002},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021509665277858088,"score_gpt":0.2157802822445578,"score_spread":0.19427061696669973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128239317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031020591,0.0010612359,0.94180036,0.00021791576,0.0002587229,0.00012649965,0.00010494303,0.0033846204,0.022025112],"genre_scores_gemma":[0.43215936,0.000994055,0.5408245,0.00024363675,0.00015618587,0.00012735538,0.00021319126,0.000121591875,0.025160098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987376,0.000022976483,0.0000061355086,0.000023657754,0.000056762932,0.000016800612],"domain_scores_gemma":[0.99989045,0.000025738984,0.000012559859,0.000025552567,0.00003321869,0.000012528635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743933,0.0003850567,0.00014238515,0.00039178698,0.00028761895,0.00052595796,0.0007354677,0.00031463557,0.0051806346],"category_scores_gemma":[0.0002665086,0.00013308368,0.00016740881,0.00025278926,0.00021163054,0.0005904996,0.0002137161,0.00039556596,0.0010472678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051343,0.00014820263,0.0006860254,0.00027800634,0.000075565746,0.00070529565,0.00011376132,0.02562422,0.37985393,0.085875556,0.0087762745,0.49734974],"study_design_scores_gemma":[0.00019589555,0.0014446506,0.0013260918,0.00009579674,0.00015479435,0.0035157648,0.00004249232,0.3353267,0.43332523,0.014093159,0.21038939,0.00009004534],"about_ca_topic_score_codex":0.00046004468,"about_ca_topic_score_gemma":0.0010197496,"teacher_disagreement_score":0.0051806346,"about_ca_system_score_codex":0.00035404816,"about_ca_system_score_gemma":0.00026667028,"threshold_uncertainty_score":0.017330945},"labels":[],"label_agreement":null},{"id":"W2128701724","doi":"10.5555/2016802.2016811","title":"FPGA glitch power analysis and reduction","year":2011,"lang":"en","type":"article","venue":"International Symposium on Low Power Electronics and Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glitch; Field-programmable gate array; Power analysis; Dynamic demand; Overhead (engineering); Reduction (mathematics); Computer science; Power (physics); Routing (electronic design automation); Embedded system; Algorithm; Mathematics; Cryptography; Telecommunications; Physics","score_opus":0.008595959861145907,"score_gpt":0.20981841352481623,"score_spread":0.2012224536636703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128701724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1852393,0.0013531446,0.7811888,0.00035456193,0.00013612275,0.00020944845,0.00019300227,0.004579076,0.026746618],"genre_scores_gemma":[0.7568805,0.00069300056,0.23175138,0.000198677,0.000055175606,0.0000939457,0.00033507516,0.0006069349,0.009385266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956757,0.000045375098,0.00001964649,0.000056367564,0.00024830934,0.0000627114],"domain_scores_gemma":[0.9995017,0.00016383,0.00006393065,0.00008392209,0.00017626701,0.000010345876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017356829,0.0007772941,0.0004035481,0.0014052318,0.00043419524,0.0005406327,0.00068727584,0.00026594792,0.004427695],"category_scores_gemma":[0.00090497255,0.00030633275,0.00055193284,0.0005149831,0.0002843387,0.0005320954,0.00024092615,0.0004539722,0.0006282326],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055041944,0.0001228891,0.0028298157,0.00062960247,0.000108672575,0.00048433334,0.00020187697,0.18896586,0.21847528,0.01071651,0.0047171083,0.5721976],"study_design_scores_gemma":[0.000086897606,0.0009639548,0.0049991934,0.00008208169,0.00013981995,0.0012666646,0.000117290685,0.59277683,0.36925164,0.0052383454,0.025016805,0.00006045281],"about_ca_topic_score_codex":0.0016527687,"about_ca_topic_score_gemma":0.0032327306,"teacher_disagreement_score":0.004427695,"about_ca_system_score_codex":0.00081348437,"about_ca_system_score_gemma":0.00058456266,"threshold_uncertainty_score":0.014812112},"labels":[],"label_agreement":null},{"id":"W2129159815","doi":"10.5555/1356802.1356851","title":"Symmetry-aware placement with transitive closure graphs for analog layout design","year":2008,"lang":"en","type":"article","venue":"Digital Scholarship - UNLV (University of Nevada Reno)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive closure; Closure (psychology); Transitive relation; Symmetry (geometry); Graph; Set (abstract data type); Space (punctuation); Mathematics; Computer science; Topology (electrical circuits); Algorithm; Discrete mathematics; Combinatorics; Geometry","score_opus":0.027642781294926096,"score_gpt":0.18445765369086053,"score_spread":0.15681487239593445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129159815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018507957,0.00007707303,0.97801,0.00006868229,0.000020267935,0.0000786452,0.000037724913,0.00062664837,0.002572897],"genre_scores_gemma":[0.38928214,0.00012783591,0.60885966,0.00005471524,0.000027782173,0.0001509891,0.00013253895,0.00009864009,0.0012657482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995739,0.00017224961,0.000023183173,0.00004872834,0.00015027876,0.000031593794],"domain_scores_gemma":[0.9994349,0.00023218877,0.0000808964,0.00017770083,0.00005594592,0.00001831551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004141315,0.0005514173,0.00033515485,0.00068616914,0.0003270616,0.0004751787,0.0006762749,0.000326107,0.002289518],"category_scores_gemma":[0.0011847279,0.00019920876,0.00040583193,0.00061321177,0.0006093157,0.0007435576,0.0005001234,0.00042328454,0.0003163274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027778593,0.00017432938,0.0007938782,0.00021923895,0.000046217985,0.00033394227,0.0001610659,0.34644276,0.09901282,0.113633886,0.00330912,0.43559504],"study_design_scores_gemma":[0.00007398283,0.00031376161,0.00022717298,0.000018511448,0.000020687517,0.00023128136,0.000046362045,0.9057629,0.03750404,0.049977463,0.005800938,0.000022849305],"about_ca_topic_score_codex":0.00068740454,"about_ca_topic_score_gemma":0.0012527299,"teacher_disagreement_score":0.002289518,"about_ca_system_score_codex":0.0004722819,"about_ca_system_score_gemma":0.0007051219,"threshold_uncertainty_score":0.0076591372},"labels":[],"label_agreement":null},{"id":"W2129619153","doi":"10.1109/tvlsl2003.820527","title":"Timing driven gate duplication","year":2004,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Tree traversal; Tuple; Gene duplication; Logic gate; Traverse; Computer science; Minification; Algorithm; AND gate; Parallel computing; Mathematics; Discrete mathematics","score_opus":0.013114122795632906,"score_gpt":0.20187340900531348,"score_spread":0.18875928620968058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129619153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053398766,0.00078691705,0.9330727,0.00020461308,0.00009670263,0.00013680829,0.00011934999,0.0007238494,0.011460281],"genre_scores_gemma":[0.539497,0.0010367908,0.44297788,0.00031071526,0.00008014185,0.00021196659,0.0004991047,0.00032020136,0.015066234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945694,0.00009379683,0.000026836851,0.00012724256,0.00020279834,0.00009245844],"domain_scores_gemma":[0.9992016,0.00036493142,0.00011958213,0.00013805491,0.0001479069,0.000027962787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048077543,0.0006812247,0.0006688311,0.00055276917,0.0004812954,0.0006656322,0.0011929424,0.00040387447,0.0034846195],"category_scores_gemma":[0.0013453875,0.00035485358,0.00058053836,0.0011683595,0.00054997246,0.0009773816,0.00074584235,0.0006228369,0.00054907525],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039509023,0.000110008674,0.0011490607,0.0004175496,0.000087041044,0.0004545464,0.00014743506,0.42221287,0.06628899,0.11720748,0.0043119416,0.38721794],"study_design_scores_gemma":[0.000095950934,0.00059004035,0.0008110154,0.000045023527,0.00011620289,0.0013326585,0.000083725026,0.7372984,0.13245815,0.08811223,0.039012805,0.000043780234],"about_ca_topic_score_codex":0.0007864168,"about_ca_topic_score_gemma":0.0011848119,"teacher_disagreement_score":0.0034846195,"about_ca_system_score_codex":0.0010443426,"about_ca_system_score_gemma":0.0008661695,"threshold_uncertainty_score":0.011657178},"labels":[],"label_agreement":null},{"id":"W2129647912","doi":"10.1007/0-387-34403-9_41","title":"An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Graph partition; Algorithm; Computer science; Graph; Mathematics; Theoretical computer science","score_opus":0.012119178788564871,"score_gpt":0.22961846378640244,"score_spread":0.21749928499783758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129647912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038392926,0.00026433112,0.99188304,0.000084457024,0.000040886927,0.000058510876,0.0000501503,0.0005516231,0.0032276895],"genre_scores_gemma":[0.036353696,0.00023973173,0.9604286,0.00006337387,0.000017342541,0.00010590062,0.00020878352,0.00016599573,0.0024165981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996779,0.00005329931,0.000019837338,0.000052432566,0.00016094922,0.000035564164],"domain_scores_gemma":[0.99970454,0.00010099934,0.00002197144,0.00006619752,0.00009286341,0.000013479351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033830936,0.00055715605,0.00063105184,0.0011373872,0.000536764,0.0005745717,0.0012617968,0.0006739547,0.006031518],"category_scores_gemma":[0.0010593932,0.00031961163,0.0006776878,0.0016174482,0.00039193322,0.0011124144,0.0009796545,0.0011564746,0.0014256537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009746795,0.00007575494,0.00026646332,0.0003248467,0.00003386175,0.000081580554,0.00014184127,0.11570005,0.038661655,0.05222927,0.0120849125,0.7803024],"study_design_scores_gemma":[0.00006613913,0.00011644745,0.0002837119,0.00005444957,0.000033719665,0.00024293747,0.000072929004,0.90835583,0.020208739,0.03929093,0.031246819,0.000027427754],"about_ca_topic_score_codex":0.0017648208,"about_ca_topic_score_gemma":0.002452847,"teacher_disagreement_score":0.006031518,"about_ca_system_score_codex":0.00055205205,"about_ca_system_score_gemma":0.0006338955,"threshold_uncertainty_score":0.020177424},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016081907554113695,"score_gpt":0.24108229443550394,"score_spread":0.22500038688139024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129946839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012173672,0.0001022206,0.98332363,0.000058941507,0.000018647095,0.00003183913,0.000012434966,0.0006268627,0.003651816],"genre_scores_gemma":[0.19758835,0.00026961652,0.7980997,0.00009966326,0.000034735356,0.00013223778,0.00009403498,0.00035173024,0.0033299895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00020094913,0.000026823667,0.0001052484,0.00025208993,0.000101205485],"domain_scores_gemma":[0.99891996,0.0006066598,0.00009054548,0.00018658505,0.00013810673,0.000058155223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148034,0.0010804649,0.000792387,0.00087637664,0.00048065584,0.0008942551,0.0009226952,0.0008045803,0.0068946676],"category_scores_gemma":[0.0028578301,0.00048906746,0.00071499357,0.0009558161,0.0007374939,0.0015843877,0.0015415275,0.002030561,0.0014753297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024760937,0.00013767283,0.00049946277,0.00016058127,0.000039598795,0.00011230476,0.00017349239,0.6437176,0.034461148,0.07101348,0.002199779,0.24723732],"study_design_scores_gemma":[0.00005339406,0.00008159406,0.00010924606,0.000021275908,0.000017228243,0.00005505215,0.00002915753,0.95923346,0.009821321,0.026970843,0.0035942325,0.000013126796],"about_ca_topic_score_codex":0.0011948734,"about_ca_topic_score_gemma":0.0021271412,"teacher_disagreement_score":0.0068946676,"about_ca_system_score_codex":0.0006671899,"about_ca_system_score_gemma":0.0007641245,"threshold_uncertainty_score":0.023064971},"labels":[],"label_agreement":null},{"id":"W2130276110","doi":"10.1109/isvlsi.2006.1","title":"A \"Soft++\" eFPGA Physical Design Approach with Case Studies in 180nm and 90nm","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"CMC Microsystems","keywords":"Computer science; Application-specific integrated circuit; Place and route; Benchmark (surveying); Physical design; Field-programmable gate array; Design flow; Embedded system; Overhead (engineering); Computer architecture; Set (abstract data type); Integrated circuit design; Soft error; Electronic engineering; Computer hardware; Circuit design; Engineering","score_opus":0.031757654419559786,"score_gpt":0.24386017304065433,"score_spread":0.21210251862109453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130276110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31953937,0.0010864914,0.5976137,0.0009544179,0.0000768141,0.00032920574,0.00025198603,0.0012189316,0.07892913],"genre_scores_gemma":[0.77033204,0.00030640617,0.22233333,0.00015748496,0.00000960789,0.00014175464,0.00006823694,0.00007251818,0.00657855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959105,0.00016694416,0.000014742025,0.000036540696,0.00014321729,0.00004746279],"domain_scores_gemma":[0.99964035,0.00016586768,0.000043848493,0.000079774756,0.000052963755,0.00001718475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048433497,0.00037619076,0.00014272306,0.00033572986,0.00042132562,0.0007940302,0.0006469304,0.00061507133,0.0029810185],"category_scores_gemma":[0.0008289397,0.00017956701,0.0002638303,0.0003617402,0.00071659865,0.00061471853,0.00043363872,0.0004047453,0.000293452],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022642531,0.000218948,0.0033294857,0.00068400305,0.00006395566,0.002941496,0.00060500193,0.581667,0.039502315,0.12664361,0.0043642186,0.23975356],"study_design_scores_gemma":[0.00018211838,0.0011584421,0.0036405514,0.00011221185,0.0000708811,0.0031061564,0.0004440993,0.8392412,0.03942975,0.05253785,0.060020518,0.000056140907],"about_ca_topic_score_codex":0.0015941899,"about_ca_topic_score_gemma":0.0030589593,"teacher_disagreement_score":0.0029810185,"about_ca_system_score_codex":0.0006174295,"about_ca_system_score_gemma":0.00062529516,"threshold_uncertainty_score":0.009972453},"labels":[],"label_agreement":null},{"id":"W2130529591","doi":"10.1109/cicc.2002.1012766","title":"Nearest neighbour interconnect architecture in deep submicron FPGAs","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Interconnection; Computer science; Architecture; Network topology; Computer architecture; Nearest neighbour; Parallel computing; Performance improvement; Embedded system; Topology (electrical circuits); Engineering; Electrical engineering; Computer network; Artificial intelligence","score_opus":0.004906398154460492,"score_gpt":0.18257057341065003,"score_spread":0.17766417525618955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130529591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42472276,0.00203181,0.535066,0.0003426501,0.00009193552,0.000036916183,0.000103855295,0.0019520719,0.03565195],"genre_scores_gemma":[0.8848791,0.00039330858,0.10645267,0.00006709909,0.000015979038,0.000013602112,0.00007555847,0.0000342051,0.008068529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987984,0.000023711744,0.0000072634193,0.000020263942,0.000050321334,0.000018578346],"domain_scores_gemma":[0.99985445,0.00003754062,0.000028503426,0.000027424447,0.000042286334,0.000009827053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013250121,0.00011455872,0.00015569973,0.00026280398,0.00026638745,0.00036723178,0.0004121835,0.00028258289,0.0011266146],"category_scores_gemma":[0.00042453984,0.00012544991,0.00009657654,0.00033113654,0.00017727747,0.00055218884,0.00019563701,0.00013997348,0.00040573347],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003195541,0.00008338722,0.002914543,0.0002333395,0.000039104056,0.00060696714,0.00025852403,0.4435908,0.11083866,0.07642836,0.004804808,0.3598819],"study_design_scores_gemma":[0.000035974288,0.00042604713,0.0026372143,0.000030967447,0.000031582527,0.0011849138,0.00011056456,0.890476,0.044632882,0.040649932,0.019723114,0.000060885974],"about_ca_topic_score_codex":0.0018954102,"about_ca_topic_score_gemma":0.006106588,"teacher_disagreement_score":0.0018954102,"about_ca_system_score_codex":0.00040090331,"about_ca_system_score_gemma":0.00019027702,"threshold_uncertainty_score":0.003768921},"labels":[],"label_agreement":null},{"id":"W2130762555","doi":"10.1109/iccd.1994.331981","title":"An ILP solution for simultaneous scheduling, allocation, and binding in multiple block synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Scheduling (production processes); Integer programming; Block (permutation group theory); Interdependence; Critical path method; Linear programming; Set (abstract data type); High-level synthesis; Mathematical optimization; Job shop scheduling; Processor scheduling; Theoretical computer science; Distributed computing; Parallel computing; Algorithm; Programming language; Mathematics; Embedded system; Engineering; Schedule; Field-programmable gate array","score_opus":0.02182484388445856,"score_gpt":0.22399418965289106,"score_spread":0.20216934576843248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130762555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001578534,0.00008239137,0.99535406,0.00010189959,0.000020787524,0.000029217086,0.000037383197,0.00027679477,0.0025189563],"genre_scores_gemma":[0.073910296,0.00018753091,0.9219208,0.00011222142,0.000038667906,0.00024573063,0.00012743475,0.0002118474,0.0032453942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995147,0.00017205685,0.000020277495,0.00006718594,0.00016173022,0.00006416438],"domain_scores_gemma":[0.99949956,0.0003661989,0.00003739029,0.0000265442,0.00005716949,0.000013039243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009020864,0.0009057425,0.00062324334,0.0006254784,0.000558428,0.00088219356,0.00074566616,0.0007408158,0.006178661],"category_scores_gemma":[0.0014843335,0.00062366645,0.00074941217,0.0006597338,0.000684885,0.00076746824,0.0006178634,0.0012171557,0.0008439449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041493877,0.00003116717,0.00010144137,0.00011311531,0.000022987017,0.000069510505,0.00006205489,0.90417045,0.0027285242,0.027404614,0.002545715,0.062708944],"study_design_scores_gemma":[0.000028431134,0.00002379403,0.000019365842,0.000013408583,0.0000099559975,0.000018893867,0.0000144812075,0.9844077,0.001245933,0.011280542,0.002933232,0.0000042280153],"about_ca_topic_score_codex":0.002839207,"about_ca_topic_score_gemma":0.0053615975,"teacher_disagreement_score":0.006178661,"about_ca_system_score_codex":0.00089557,"about_ca_system_score_gemma":0.0017761304,"threshold_uncertainty_score":0.02066964},"labels":[],"label_agreement":null},{"id":"W2131004306","doi":"10.1109/tcsii.2005.862174","title":"A connectivity based clustering algorithm with application to VLSI circuit partitioning","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Very-large-scale integration; Computer science; Benchmark (surveying); Algorithm; Suite; Set (abstract data type); Parallel computing; Data mining; Artificial intelligence; Embedded system","score_opus":0.010564492616238616,"score_gpt":0.1982182144374683,"score_spread":0.18765372182122966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131004306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074098,0.0003986481,0.9888699,0.00016803443,0.000059399186,0.000085785374,0.000089518675,0.0008175509,0.0021014202],"genre_scores_gemma":[0.072328,0.00039328635,0.9237914,0.000087252345,0.00007447704,0.0001963032,0.00045356905,0.00016837301,0.002507283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995105,0.000078389414,0.000027908549,0.00010370669,0.00024399503,0.00003551971],"domain_scores_gemma":[0.9992298,0.00024208457,0.00006983062,0.000090380374,0.00033521894,0.00003279153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038368625,0.0008888176,0.00078773795,0.0021599033,0.0009953239,0.0007638398,0.0013998842,0.0011941799,0.002574916],"category_scores_gemma":[0.0023470817,0.00043710705,0.00061067205,0.0029836118,0.0005238681,0.0013803948,0.0009317021,0.00082244474,0.0009336935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012812897,0.00006213558,0.000838235,0.0001973268,0.00008752374,0.00014138412,0.00017396896,0.3742169,0.020279469,0.026353262,0.010261704,0.56725997],"study_design_scores_gemma":[0.000039697712,0.00008924663,0.00048454732,0.000017214019,0.000025877653,0.0002501497,0.000034102453,0.97421086,0.005410333,0.009774959,0.009630031,0.000033050586],"about_ca_topic_score_codex":0.0048272037,"about_ca_topic_score_gemma":0.006578646,"teacher_disagreement_score":0.0048272037,"about_ca_system_score_codex":0.0008887347,"about_ca_system_score_gemma":0.0010100314,"threshold_uncertainty_score":0.009598196},"labels":[],"label_agreement":null},{"id":"W2131602584","doi":"10.5555/1899721.1899785","title":"A performance-constrained template-based layout retargeting algorithm for analog integrated circuits","year":2010,"lang":"en","type":"article","venue":"Asia and South Pacific Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Retargeting; Parasitic extraction; Computer science; Integrated circuit layout; Analogue electronics; Set (abstract data type); Integer programming; Algorithm; Standard cell; IC layout editor; Design layout record; Electronic circuit; Circuit extraction; Integrated circuit; Electronic engineering; Engineering; Artificial intelligence; Equivalent circuit","score_opus":0.021984226089467537,"score_gpt":0.21785472112104545,"score_spread":0.1958704950315779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131602584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006420933,0.000042612013,0.9916762,0.000022324744,0.0000072158796,0.000020593761,0.000020515705,0.001129628,0.00065989187],"genre_scores_gemma":[0.1902832,0.000086608954,0.80704886,0.000055688186,0.000013939597,0.00009577033,0.00016125318,0.00031282232,0.0019418265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997017,0.000049309932,0.000012943731,0.00007107751,0.00013920307,0.000025687486],"domain_scores_gemma":[0.9995968,0.00017775604,0.00006111169,0.000074575655,0.00007632705,0.0000133473895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034161098,0.00066782156,0.00041661522,0.00042649562,0.00023810315,0.00037072838,0.0009174398,0.00046834102,0.001745443],"category_scores_gemma":[0.0011730917,0.0003323922,0.000451096,0.0004545401,0.00030142395,0.00052708085,0.00051829236,0.0006545391,0.0005200008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008961401,0.000047979644,0.00033905846,0.00007651858,0.000039283164,0.000069307665,0.0000680451,0.50742674,0.082457736,0.0067610056,0.0017893411,0.40083537],"study_design_scores_gemma":[0.000012853865,0.000053356092,0.00014924609,0.0000034256889,0.0000105909,0.000055692228,0.000004556428,0.97675645,0.019284891,0.0019447582,0.0017147807,0.000009386885],"about_ca_topic_score_codex":0.0018603436,"about_ca_topic_score_gemma":0.002665671,"teacher_disagreement_score":0.0018603436,"about_ca_system_score_codex":0.0005980893,"about_ca_system_score_gemma":0.0007306447,"threshold_uncertainty_score":0.00583905},"labels":[],"label_agreement":null},{"id":"W2131752392","doi":"10.5555/1129601.1129728","title":"Mixed-size placement via line search","year":2005,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scaling; Computer science; Line (geometry); Simple (philosophy); Sampling (signal processing); Algorithm; Function (biology); Line search; Mathematical optimization; Mathematics","score_opus":0.08022057527161153,"score_gpt":0.286907533980832,"score_spread":0.2066869587092205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131752392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008855746,0.00014948321,0.98195,0.000086148684,0.000037365204,0.00007784326,0.00007261271,0.002580728,0.0061901277],"genre_scores_gemma":[0.124480516,0.000107851905,0.87051266,0.000118092095,0.000024694786,0.00023088127,0.00015646334,0.0003343219,0.00403445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960524,0.00007382331,0.000018155823,0.00006265865,0.00020349803,0.000036695154],"domain_scores_gemma":[0.99945575,0.00021360815,0.000083327766,0.00011190297,0.000106686035,0.000028779157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003191254,0.0008560691,0.00049065927,0.0011059864,0.00047270482,0.00064071105,0.0013051914,0.00074370677,0.00954033],"category_scores_gemma":[0.0014265684,0.00037770037,0.00034725707,0.0007981608,0.000410176,0.0008454923,0.0011054808,0.0006641773,0.002504341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001726269,0.0001806954,0.0011545105,0.0003168537,0.00007778835,0.00021868618,0.00016226483,0.2622352,0.058737442,0.03284829,0.010966198,0.63292956],"study_design_scores_gemma":[0.000083373896,0.00025282556,0.00031929286,0.0000278069,0.000017449871,0.00019446226,0.00003973078,0.94977117,0.018605342,0.01238488,0.018275972,0.000027679002],"about_ca_topic_score_codex":0.0011720798,"about_ca_topic_score_gemma":0.0037283073,"teacher_disagreement_score":0.00954033,"about_ca_system_score_codex":0.00044135892,"about_ca_system_score_gemma":0.00065505144,"threshold_uncertainty_score":0.031915545},"labels":[],"label_agreement":null},{"id":"W2131973905","doi":"10.1109/ccece.2002.1015261","title":"A tool for automated analog CMOS layout module generation and placement","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"CMOS; Integrated circuit layout; IC layout editor; Design layout record; Computer science; Page layout; Process (computing); Electronic engineering; CAD; Electronic design automation; Design flow; Noise (video); Integrated circuit design; Engineering; Integrated circuit; Circuit extraction; Embedded system; Engineering drawing; Electrical engineering; Artificial intelligence","score_opus":0.016632707075611056,"score_gpt":0.2322576612603557,"score_spread":0.21562495418474464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131973905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014503276,0.00017522248,0.94381875,0.00008791737,0.0000911698,0.00013669107,0.0009663273,0.049796652,0.003476926],"genre_scores_gemma":[0.035876945,0.0002849921,0.9481813,0.0002121603,0.00007668374,0.00060748844,0.0023596568,0.0034990248,0.0089017665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992963,0.00009550403,0.00006316899,0.00008384652,0.00041529472,0.000045916597],"domain_scores_gemma":[0.9984267,0.00071298814,0.00011943425,0.00039166698,0.00028728545,0.0000620273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008907388,0.0012189785,0.00070288783,0.0014255742,0.0004226966,0.0008995265,0.0018273653,0.00086576113,0.028765557],"category_scores_gemma":[0.002821385,0.0008604853,0.00064110657,0.00083674514,0.00034189378,0.0010653188,0.0010499946,0.0012678287,0.010164288],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002732229,0.00011105972,0.0007962399,0.0006598322,0.00008468371,0.00070021284,0.0002044993,0.016793814,0.08178775,0.017589534,0.11935383,0.76164526],"study_design_scores_gemma":[0.0005703555,0.0004864043,0.001942019,0.00026615508,0.00014211793,0.0047674715,0.00006891328,0.2781164,0.12978496,0.027848976,0.5558259,0.00018035842],"about_ca_topic_score_codex":0.0005023341,"about_ca_topic_score_gemma":0.0008283439,"teacher_disagreement_score":0.028765557,"about_ca_system_score_codex":0.00032054787,"about_ca_system_score_gemma":0.00067542173,"threshold_uncertainty_score":0.09623039},"labels":[],"label_agreement":null},{"id":"W2132958139","doi":"10.1109/icm.2003.237880","title":"Congestion driven placement for VLSI standard cell design","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Router; Placement; Very-large-scale integration; Computer science; Interconnection; Routing (electronic design automation); Reduction (mathematics); Network routing; Integrated circuit layout; Chip; Parallel computing; Physical design; Electronic engineering; Embedded system; Integrated circuit; Circuit design; Engineering; Computer network; Mathematics; Telecommunications","score_opus":0.01860362526623188,"score_gpt":0.2198702142903698,"score_spread":0.2012665890241379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132958139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033996213,0.00097469636,0.959287,0.00016475734,0.00012885834,0.00012439881,0.000079016914,0.0011989021,0.0040460923],"genre_scores_gemma":[0.51109934,0.0011720335,0.47990164,0.00014101018,0.00007473305,0.00016471947,0.00026527024,0.00016901128,0.007012211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.000041281764,0.0000083162695,0.000018037594,0.00009428346,0.000019876656],"domain_scores_gemma":[0.99982446,0.00004914884,0.000021836284,0.0000324209,0.00006121282,0.000010932808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029178342,0.00034735457,0.00018068854,0.00038559208,0.0002790712,0.00038125392,0.00047445588,0.00022606678,0.0024779236],"category_scores_gemma":[0.00073523895,0.00020795446,0.00015483171,0.00045242795,0.0002641016,0.00040191665,0.000348627,0.00040975452,0.0005576496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002454621,0.000056944653,0.0006220564,0.00020205273,0.00003458703,0.00029587027,0.00013118087,0.42991382,0.091724165,0.061578315,0.007046373,0.4081492],"study_design_scores_gemma":[0.00006638396,0.00037400945,0.00049520755,0.000024427047,0.000023205937,0.0002352939,0.000041568295,0.9098873,0.033726484,0.034757476,0.02034121,0.000027459091],"about_ca_topic_score_codex":0.0017223074,"about_ca_topic_score_gemma":0.0034428171,"teacher_disagreement_score":0.0024779236,"about_ca_system_score_codex":0.00044721592,"about_ca_system_score_gemma":0.0006454207,"threshold_uncertainty_score":0.008289456},"labels":[],"label_agreement":null},{"id":"W2133761062","doi":"10.1109/iscas.2007.378191","title":"Two Clustering Preprocessing Techniques for Large-Scale Circuits","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Preprocessor; Computer science; Benchmark (surveying); Electronic circuit; Data mining; Data pre-processing; Scale (ratio); Algorithm; Artificial intelligence; Engineering","score_opus":0.0153265288273615,"score_gpt":0.2738462145749965,"score_spread":0.258519685747635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133761062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013248475,0.00046234712,0.9806011,0.00016138522,0.00010535211,0.00012810223,0.00014046271,0.00303409,0.0021186422],"genre_scores_gemma":[0.12091634,0.00040744798,0.8701543,0.00017763709,0.00009090726,0.00016590189,0.000991228,0.00040316948,0.006693065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.000063818814,0.000035881072,0.00014146243,0.00035083314,0.00007781685],"domain_scores_gemma":[0.9990676,0.00018694822,0.000104653445,0.00029083464,0.00031439762,0.00003551613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029544174,0.0009868499,0.0006989604,0.0011737081,0.00076848146,0.000834126,0.0015302284,0.00084290217,0.0067109703],"category_scores_gemma":[0.0014673169,0.00046899772,0.00094642484,0.0016373886,0.0004145994,0.0011163811,0.0007427503,0.0013248143,0.00236999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040672944,0.000111214744,0.00058978715,0.00057649927,0.00011312783,0.00018872837,0.00020142998,0.03177974,0.23936382,0.009618898,0.008447227,0.7086027],"study_design_scores_gemma":[0.00014499143,0.0005983386,0.005811453,0.0000823432,0.00017656035,0.0013318841,0.00023750079,0.31437767,0.6096046,0.012107457,0.055370767,0.00015644648],"about_ca_topic_score_codex":0.001620711,"about_ca_topic_score_gemma":0.00438514,"teacher_disagreement_score":0.0067109703,"about_ca_system_score_codex":0.00078847737,"about_ca_system_score_gemma":0.0010394957,"threshold_uncertainty_score":0.022450447},"labels":[],"label_agreement":null},{"id":"W2133929151","doi":"10.1109/cicc.1998.695048","title":"A nonlinear programming and local improvement method for standard cell placement","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very-large-scale integration; Placement; Standard cell; Computer science; Nonlinear system; Electronic circuit; Iterative method; Integrated circuit layout; Parallel computing; Design methods; Computer engineering; Algorithm; Mathematical optimization; Physical design; Circuit design; Integrated circuit; Embedded system; Mathematics; Engineering; Electrical engineering","score_opus":0.012776297606292947,"score_gpt":0.24872264691495968,"score_spread":0.23594634930866673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133929151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010961061,0.000030339726,0.9976822,0.000018112913,0.000009227688,0.0000140791335,0.000007247358,0.00014893728,0.0009937081],"genre_scores_gemma":[0.037637353,0.00010045353,0.95699537,0.00003699844,0.000024170682,0.00015403086,0.000060296403,0.00012923939,0.00486203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996859,0.000069678914,0.000009949932,0.000044183664,0.0001663635,0.000024068539],"domain_scores_gemma":[0.99967766,0.00015055589,0.000030641295,0.000037141017,0.00008843856,0.00001557619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046664895,0.00058125425,0.0005604957,0.0005636353,0.00036844998,0.0003759384,0.0011260343,0.0004660786,0.0049193935],"category_scores_gemma":[0.0009186714,0.00038185358,0.00057262625,0.00065346295,0.0005067881,0.00057441404,0.0007730512,0.0012495962,0.0015692979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008481723,0.00009457418,0.0002585488,0.00018057744,0.00003930987,0.000115082665,0.00013763191,0.45668414,0.03578595,0.04672201,0.0063151843,0.4535822],"study_design_scores_gemma":[0.000013624053,0.000070537935,0.00007715505,0.0000062122563,0.0000072341204,0.000060101705,0.000007886148,0.9866702,0.0040859804,0.0040686247,0.0049192067,0.000013171832],"about_ca_topic_score_codex":0.0028124752,"about_ca_topic_score_gemma":0.0050078765,"teacher_disagreement_score":0.0049193935,"about_ca_system_score_codex":0.00059831544,"about_ca_system_score_gemma":0.0009674564,"threshold_uncertainty_score":0.016456962},"labels":[],"label_agreement":null},{"id":"W2134606315","doi":"10.1109/cicc.1991.164058","title":"An efficient eigenvector-node interchange approach for finding netlist partitions","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Netlist; Heuristics; Eigenvalues and eigenvectors; Computer science; Node (physics); Partition (number theory); Benchmark (surveying); Theoretical computer science; Heuristic; Algorithm; Mathematics; Mathematical optimization; Combinatorics; Artificial intelligence","score_opus":0.0666571393386486,"score_gpt":0.2536353325695826,"score_spread":0.186978193230934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134606315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004730441,0.000111218746,0.991954,0.00002367164,0.000013140858,0.000110903224,0.00007223909,0.000882698,0.0021016733],"genre_scores_gemma":[0.031472683,0.00011207198,0.9652425,0.000029177065,0.000010398334,0.00021786637,0.00045325697,0.0002484463,0.0022135903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.00010877405,0.000022066335,0.00007526041,0.000154508,0.00005493361],"domain_scores_gemma":[0.99939513,0.00025800447,0.00005654012,0.00010085502,0.00015887206,0.00003048331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053875096,0.001352575,0.00087529875,0.0024722842,0.0012211418,0.0008752,0.0013673459,0.000608804,0.008429486],"category_scores_gemma":[0.001849924,0.0006047889,0.0007441112,0.002648831,0.0005272859,0.001269529,0.00086296827,0.0007356629,0.002132413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018576019,0.00016408453,0.0009744358,0.00028953206,0.00007118828,0.00023105512,0.00022373669,0.20121513,0.027329445,0.027769942,0.00811218,0.7334334],"study_design_scores_gemma":[0.00010231942,0.0002157892,0.00075243454,0.000043013242,0.000058683967,0.0003286933,0.0001693274,0.9148409,0.02141694,0.039803784,0.022214366,0.000053825966],"about_ca_topic_score_codex":0.0050335624,"about_ca_topic_score_gemma":0.011321763,"teacher_disagreement_score":0.008429486,"about_ca_system_score_codex":0.00093935034,"about_ca_system_score_gemma":0.0014381347,"threshold_uncertainty_score":0.028199494},"labels":[],"label_agreement":null},{"id":"W2137186724","doi":"10.1109/cmpcon.1979.729140","title":"A Parallel Array Of Microprocessors - An Alternative Solution To Diffusion Problems","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Flexibility (engineering); Diffusion; Parallel computing; Architecture; Protocol (science); Compact space; Reduction (mathematics); Scalability; Distributed computing; Embedded system; Operating system; Mathematics","score_opus":0.014677026336944716,"score_gpt":0.2346019831176603,"score_spread":0.2199249567807156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137186724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061087176,0.0012837887,0.9247389,0.0004984834,0.00015451731,0.000040519226,0.00003088113,0.00040960725,0.011756157],"genre_scores_gemma":[0.52250177,0.0012259636,0.46417132,0.00015276473,0.000101476,0.000101066114,0.000059594728,0.000059753336,0.011626199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986506,0.000032200936,0.000007678753,0.000033706092,0.000044672477,0.00001674557],"domain_scores_gemma":[0.99986374,0.000046637866,0.00001943288,0.00003158208,0.000028853108,0.000009738775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020365306,0.00024142471,0.0003592825,0.0001911969,0.00029751367,0.000417847,0.000572486,0.00045841356,0.0022133726],"category_scores_gemma":[0.0004255092,0.00016485782,0.00027777394,0.000298921,0.0003028319,0.00085885846,0.00038851678,0.00046769634,0.00046778508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038417065,0.00014033099,0.0014519065,0.0004930518,0.00010638783,0.00049676106,0.00025441262,0.23084679,0.163771,0.29446787,0.0043486943,0.3032386],"study_design_scores_gemma":[0.00014658453,0.00042958534,0.00056239736,0.00003997981,0.000053481243,0.0007167786,0.000066827975,0.8401178,0.037887987,0.06853343,0.051414132,0.000031102056],"about_ca_topic_score_codex":0.00022087301,"about_ca_topic_score_gemma":0.00039778682,"teacher_disagreement_score":0.0022133726,"about_ca_system_score_codex":0.00017164141,"about_ca_system_score_gemma":0.00032470815,"threshold_uncertainty_score":0.0074044466},"labels":[],"label_agreement":null},{"id":"W2137381762","doi":"10.1145/1391732.1391736","title":"Perturb+mutate","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Heuristic; Electronic circuit; Locality; Constant (computer programming); Software; Measure (data warehouse); Algorithm; Artificial intelligence; Physics","score_opus":0.019475283882179516,"score_gpt":0.20685930846730663,"score_spread":0.18738402458512712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137381762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10674187,0.00049616856,0.8073002,0.0005529056,0.00049286545,0.0008403255,0.0021759022,0.036660887,0.044738773],"genre_scores_gemma":[0.43295196,0.0003894493,0.5249358,0.0007454045,0.0000634879,0.00090543507,0.002708493,0.006531734,0.0307682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993886,0.00009533757,0.00003430088,0.00015595902,0.00024602743,0.000079736565],"domain_scores_gemma":[0.999212,0.00028503904,0.0000787155,0.0002707179,0.00012228456,0.00003116991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045614823,0.0010916626,0.0005669857,0.0006710677,0.00049342995,0.000895053,0.0012355838,0.0006075143,0.01786389],"category_scores_gemma":[0.0022937625,0.00041328813,0.00065093377,0.000396849,0.000580444,0.001036218,0.001139814,0.0007165816,0.0035766046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087060995,0.00028491396,0.005865333,0.0010855803,0.00020622759,0.0007299733,0.00026209233,0.12305831,0.103676595,0.04683759,0.039308812,0.67781395],"study_design_scores_gemma":[0.00037888627,0.0011213109,0.002400652,0.000110867535,0.00023134693,0.0016105092,0.00018767359,0.42698517,0.29007733,0.04045929,0.23629987,0.00013713769],"about_ca_topic_score_codex":0.0010789616,"about_ca_topic_score_gemma":0.0021176704,"teacher_disagreement_score":0.01786389,"about_ca_system_score_codex":0.00056388945,"about_ca_system_score_gemma":0.00059113256,"threshold_uncertainty_score":0.05976069},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009972897050443194,"score_gpt":0.22406208376840114,"score_spread":0.21408918671795796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138206217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004240925,0.00010786049,0.99143887,0.000055065586,0.000025087584,0.000034836106,0.000055894405,0.0025132678,0.0015281803],"genre_scores_gemma":[0.11974446,0.00023139933,0.874506,0.00008454849,0.000035408113,0.00011232937,0.00029716766,0.0007323802,0.0042562904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992768,0.00016063933,0.000039249368,0.000089119145,0.0003592906,0.00007501028],"domain_scores_gemma":[0.99932516,0.00032723008,0.00007233099,0.00011629279,0.0001317173,0.0000272213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077598385,0.0008611366,0.0006323071,0.0009206649,0.0005446523,0.00063838536,0.0013999136,0.0005792091,0.011973265],"category_scores_gemma":[0.0024352365,0.0005339592,0.0004827632,0.00078019866,0.0005292847,0.001155581,0.00084079604,0.00069044775,0.0023945258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024576782,0.00007017129,0.0006273175,0.00038895983,0.0000333031,0.00024399355,0.00014800411,0.33317167,0.021911182,0.021745395,0.014694913,0.6067194],"study_design_scores_gemma":[0.000092498994,0.00027343916,0.00030610594,0.00003441761,0.000009711082,0.00034087547,0.000039928826,0.958085,0.010241099,0.014189139,0.016358308,0.000029496667],"about_ca_topic_score_codex":0.0032888395,"about_ca_topic_score_gemma":0.004350911,"teacher_disagreement_score":0.011973265,"about_ca_system_score_codex":0.00060770597,"about_ca_system_score_gemma":0.0008340664,"threshold_uncertainty_score":0.04005456},"labels":[],"label_agreement":null},{"id":"W2138254350","doi":"","title":"A new algorithm and improved lower bound for point placement on a line in two rounds.","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Upper and lower bounds; Extension (predicate logic); Point (geometry); Algorithm; Graph; Construct (python library); Combinatorics; Line (geometry); Computer science; Mathematics; Discrete mathematics; Geometry","score_opus":0.009662615114425859,"score_gpt":0.2586199862517362,"score_spread":0.24895737113731034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138254350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013020826,0.0003549231,0.97290695,0.0005300502,0.00016786836,0.00021541736,0.00015816205,0.0019117362,0.010734045],"genre_scores_gemma":[0.082356945,0.00034424473,0.9031419,0.0003160522,0.00018516461,0.00036523578,0.0007034484,0.0004382411,0.012148704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803144,0.00034718798,0.0001075329,0.0004375805,0.00079311983,0.00028309916],"domain_scores_gemma":[0.99716574,0.0011537692,0.00024083897,0.00092061446,0.00035704166,0.00016198427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912499,0.0017789988,0.0010628878,0.0016293112,0.0012921127,0.0021563822,0.003707434,0.002341315,0.020418135],"category_scores_gemma":[0.0043117558,0.0008524753,0.0014323592,0.0018594894,0.0014665847,0.0055489065,0.003144402,0.0042647845,0.0070330463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010180796,0.00069855375,0.0012809391,0.0007283496,0.00017109526,0.00049045077,0.00047146357,0.14941183,0.053107593,0.18680061,0.03837741,0.5674436],"study_design_scores_gemma":[0.0003820234,0.0012064042,0.0013220084,0.000097692224,0.00020777006,0.0013607279,0.00015991367,0.75319785,0.04185731,0.118338026,0.08167514,0.00019507048],"about_ca_topic_score_codex":0.0016837703,"about_ca_topic_score_gemma":0.0026835075,"teacher_disagreement_score":0.020418135,"about_ca_system_score_codex":0.0015957709,"about_ca_system_score_gemma":0.0017654132,"threshold_uncertainty_score":0.06830549},"labels":[],"label_agreement":null},{"id":"W2138616176","doi":"10.1109/mwscas.2002.1187288","title":"Empirical performance prediction for IFFT/FFT cores for OFDM systems-on-a-chip","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fast Fourier transform; Orthogonal frequency-division multiplexing; Chip; Metric (unit); System on a chip; Design flow; CMOS; Implementation; Performance metric; Electronic engineering; Embedded system; Channel (broadcasting); Algorithm; Engineering; Telecommunications","score_opus":0.03659533878385981,"score_gpt":0.26071284155119523,"score_spread":0.2241175027673354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138616176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53600204,0.0005080684,0.45773843,0.00024008451,0.000021670216,0.00008315738,0.00034740826,0.0020449809,0.0030141918],"genre_scores_gemma":[0.92846644,0.00012095621,0.07061317,0.000028169718,0.000009920674,0.00005274971,0.00023783633,0.00006918184,0.00040157183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921083,0.00020507438,0.00006129398,0.000102756814,0.0003506487,0.00006933393],"domain_scores_gemma":[0.99411494,0.0034379137,0.0007009783,0.0007236782,0.000982792,0.000039732917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010169322,0.0005650567,0.00024435928,0.00077305036,0.00020713876,0.00028533724,0.00045748617,0.00040444758,0.0009108342],"category_scores_gemma":[0.011612934,0.00019548018,0.00022169291,0.00045348753,0.000251285,0.0007169464,0.0001935816,0.00045475268,0.00026516835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003318942,0.00013880714,0.04117826,0.00014158968,0.000056361376,0.00019246007,0.00014925799,0.69216555,0.05020901,0.0043907035,0.0017656103,0.20928052],"study_design_scores_gemma":[0.0000054249167,0.00013994008,0.006442774,0.0000092171,0.00000715032,0.00012713237,0.000020311096,0.96684957,0.02525399,0.00052701135,0.0006066315,0.000010819007],"about_ca_topic_score_codex":0.0018641764,"about_ca_topic_score_gemma":0.0027800829,"teacher_disagreement_score":0.0018641764,"about_ca_system_score_codex":0.0006344241,"about_ca_system_score_gemma":0.0004010612,"threshold_uncertainty_score":0.005378127},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Interconnection; Capacitance; Computer science; Electronic circuit; Embedded system; Electronic engineering; Electrical engineering; Engineering; Telecommunications; Physics","score_opus":0.009816520485855242,"score_gpt":0.19377983564139512,"score_spread":0.18396331515553987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138840350","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8309226,0.010899996,0.11133901,0.00051722594,0.00016408751,0.000043180265,0.00012572522,0.00038795144,0.045600247],"genre_scores_gemma":[0.9481995,0.0034619994,0.03944864,0.00007871914,0.000038363654,0.000018246012,0.000066531415,0.000061528925,0.008626511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969196,0.000075788914,0.00001636097,0.000055619897,0.00011868849,0.000041653166],"domain_scores_gemma":[0.9995875,0.00015149762,0.00009451419,0.00006954446,0.00007333139,0.00002371666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029895408,0.00026835667,0.00012448504,0.0003526443,0.00025195698,0.0008540623,0.00033121483,0.000257806,0.0011890772],"category_scores_gemma":[0.0007974344,0.00024901875,0.000095907504,0.00040884133,0.00023786945,0.0010110221,0.00027913402,0.00025281892,0.00036725996],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071847317,0.00014907419,0.008505989,0.00075619924,0.000053718886,0.0005895408,0.00034847486,0.07760772,0.32358325,0.09428129,0.0024244457,0.49098176],"study_design_scores_gemma":[0.000087177126,0.0025036717,0.015377482,0.00019426309,0.00025624761,0.0035972798,0.0008444273,0.2608459,0.56839347,0.051204775,0.09655786,0.00013743417],"about_ca_topic_score_codex":0.0005966642,"about_ca_topic_score_gemma":0.0028034602,"teacher_disagreement_score":0.0011890772,"about_ca_system_score_codex":0.00037336524,"about_ca_system_score_gemma":0.00029204617,"threshold_uncertainty_score":0.003977895},"labels":[],"label_agreement":null},{"id":"W2139478143","doi":"10.5555/832284.835430","title":"Probabilistic Analysis of Rectilinear Steiner Trees","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Probabilistic logic; Very-large-scale integration; Computer science; Set (abstract data type); Tree (set theory); Interconnection; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence; Programming language","score_opus":0.018787917547615073,"score_gpt":0.20509535678153984,"score_spread":0.18630743923392476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139478143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02039033,0.0006872869,0.97540015,0.00022677971,0.000019718122,0.000026531812,0.00022689934,0.00021572443,0.0028066067],"genre_scores_gemma":[0.7428534,0.0034192977,0.24529928,0.00022877542,0.00021529022,0.00025307486,0.0012306655,0.0003758565,0.006124342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976381,0.00067201763,0.00009879314,0.00040888836,0.0009788116,0.0002034345],"domain_scores_gemma":[0.9909821,0.0057741175,0.001295179,0.0008549073,0.00095011544,0.00014346883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022030284,0.0007185295,0.00083732087,0.001959095,0.0008335972,0.001257698,0.0012922519,0.0009668142,0.0036856076],"category_scores_gemma":[0.012896097,0.0010367216,0.0010575812,0.002917174,0.0014057959,0.0031343128,0.0012678728,0.0013593606,0.0006958104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000804544,0.000013857138,0.001742707,0.000111627036,0.000059047463,0.00010025363,0.00011038759,0.7838919,0.0034210035,0.18133095,0.0016660122,0.027471757],"study_design_scores_gemma":[0.000005922795,0.000019757435,0.00066505687,0.0000112895295,0.00001634064,0.000088404006,0.000015911652,0.9184406,0.0007636839,0.07839119,0.0015638284,0.00001815664],"about_ca_topic_score_codex":0.0022878065,"about_ca_topic_score_gemma":0.0024457555,"teacher_disagreement_score":0.0036856076,"about_ca_system_score_codex":0.0013817364,"about_ca_system_score_gemma":0.0007771804,"threshold_uncertainty_score":0.012329519},"labels":[],"label_agreement":null},{"id":"W2139577649","doi":"10.1109/ccece.2009.5090314","title":"Performance-constrained parasitic-aware retargeting and optimization of analog layouts","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retargeting; Parasitic extraction; Computer science; Analogue electronics; Set (abstract data type); Graph; Sensitivity (control systems); Electronic circuit; Electronic engineering; Theoretical computer science; Engineering; Artificial intelligence; Electrical engineering","score_opus":0.007444330700417906,"score_gpt":0.20158416211867478,"score_spread":0.19413983141825686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139577649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063602425,0.00013920307,0.9299902,0.00008274215,0.000015257957,0.00005152577,0.00005093641,0.0027348436,0.0033329753],"genre_scores_gemma":[0.6516733,0.0001315673,0.34468335,0.00008150601,0.000016227556,0.00008678446,0.00014635154,0.00060913316,0.0025717309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960905,0.00008676739,0.00001397762,0.000087425564,0.00014841184,0.000054421125],"domain_scores_gemma":[0.9993734,0.0003160224,0.00010077119,0.00009920528,0.000094151306,0.000016489445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038364125,0.0011462469,0.0005876214,0.00064626517,0.00031517417,0.00045305464,0.0008022988,0.00036949222,0.0017433016],"category_scores_gemma":[0.001670942,0.00041673955,0.0004935857,0.00035164205,0.0004431614,0.00063152146,0.0007391809,0.0005658204,0.00037792893],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006621284,0.000038532868,0.0005068551,0.00008567059,0.0000286859,0.00008549633,0.00010850359,0.76157707,0.066280365,0.0033372093,0.0009015025,0.16698384],"study_design_scores_gemma":[0.000017530518,0.000092337636,0.00044836267,0.0000075613125,0.000020334885,0.000079873316,0.000027760347,0.9615764,0.03244001,0.003397296,0.0018760738,0.000016395326],"about_ca_topic_score_codex":0.0019939078,"about_ca_topic_score_gemma":0.0030386744,"teacher_disagreement_score":0.0019939078,"about_ca_system_score_codex":0.0007290279,"about_ca_system_score_gemma":0.0007601033,"threshold_uncertainty_score":0.0058318973},"labels":[],"label_agreement":null},{"id":"W2141752451","doi":"10.1145/1216919.1216946","title":"GlitchLess","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Routing (electronic design automation); Lookup table; Computer science; Filter (signal processing); Path (computing); Critical path method; Embedded system; Power (physics); Place and route; Logic synthesis; Logic gate; Computer hardware; Computer network; Engineering; Algorithm","score_opus":0.005216985359612056,"score_gpt":0.19906182191740326,"score_spread":0.19384483655779122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141752451","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22886007,0.0023935307,0.6910856,0.0007157354,0.0008541269,0.0003166566,0.00031803362,0.009714939,0.065741375],"genre_scores_gemma":[0.77288944,0.0014855439,0.16587296,0.0012073269,0.00022990392,0.00015929597,0.0005164444,0.0012190046,0.05642004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995906,0.000021348838,0.000020751862,0.0000848593,0.0002075995,0.00007493472],"domain_scores_gemma":[0.9989741,0.00022193047,0.00015963572,0.00041109015,0.000194799,0.000038529484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019155035,0.0006190927,0.00043275545,0.0009294004,0.00065007014,0.00059926335,0.0012732053,0.0005758091,0.011185244],"category_scores_gemma":[0.0012560401,0.00037599285,0.0004578692,0.00059605687,0.0005915626,0.0013282879,0.001079628,0.0009309785,0.0032083702],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005614561,0.000092588714,0.0019210799,0.0004796342,0.00006888107,0.0014792961,0.00049813744,0.010520713,0.26637626,0.012879056,0.009215303,0.69590753],"study_design_scores_gemma":[0.00014490087,0.0026807815,0.005889755,0.00023483516,0.00021758236,0.010682192,0.00040177186,0.06975812,0.648236,0.012361422,0.24921414,0.00017844491],"about_ca_topic_score_codex":0.0005704005,"about_ca_topic_score_gemma":0.0013004557,"teacher_disagreement_score":0.011185244,"about_ca_system_score_codex":0.00032953545,"about_ca_system_score_gemma":0.00036560744,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2141988600","doi":"10.1109/tcad.2015.2440316","title":"Robust Optimization of Multiple Timing Constraints","year":2015,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Texas Instruments; Semiconductor Research Corporation","keywords":"Static timing analysis; Computer science; Field-programmable gate array; Electronic circuit; Clock skew; Digital clock manager; Extension (predicate logic); Clock network; Design flow; Computer engineering; Electronic engineering; Clock signal; Computer hardware; Embedded system; Engineering; Electrical engineering","score_opus":0.0778516902545223,"score_gpt":0.22629956962115338,"score_spread":0.1484478793666311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141988600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020993069,0.00039455682,0.96821165,0.0002044031,0.00006099565,0.00004819708,0.00013092007,0.00031549524,0.009640758],"genre_scores_gemma":[0.71564716,0.0005485779,0.27224123,0.00019558294,0.000099890276,0.00022995159,0.00026142763,0.0004411276,0.010335031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992495,0.00017674126,0.00003074603,0.00016454894,0.00026991338,0.00010852915],"domain_scores_gemma":[0.99889994,0.00068002986,0.0001586609,0.00006860043,0.00015169676,0.000041066214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135623,0.0014916202,0.001066733,0.0005889003,0.00038351238,0.0012487676,0.000869892,0.0010674151,0.0044758143],"category_scores_gemma":[0.0032268113,0.00071447354,0.00090118224,0.00055077404,0.0008936964,0.0009506245,0.0009246133,0.0012397994,0.0004936765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031859847,0.000008308649,0.00009136068,0.000051627303,0.000015833102,0.00005551175,0.000012770916,0.9792789,0.0023947984,0.008940327,0.00043743168,0.0086812675],"study_design_scores_gemma":[0.000009781711,0.000031443262,0.00004639631,0.0000074086065,0.000009389072,0.000022658338,0.0000046956893,0.994245,0.0013987136,0.00347377,0.00074463856,0.000006116366],"about_ca_topic_score_codex":0.0020990078,"about_ca_topic_score_gemma":0.002244151,"teacher_disagreement_score":0.0044758143,"about_ca_system_score_codex":0.0010739419,"about_ca_system_score_gemma":0.0013258853,"threshold_uncertainty_score":0.014973044},"labels":[],"label_agreement":null},{"id":"W2142002524","doi":"10.1145/2145694.2145711","title":"Analyzing and predicting the impact of CAD algorithm noise on FPGA speed performance and power","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Noise (video); Algorithm; Computer science; CAD; Electronic circuit; Field-programmable gate array; Power (physics); Heuristic; Electronic engineering; Electronic design automation; Electrical engineering; Computer hardware; Engineering; Artificial intelligence; Embedded system","score_opus":0.009027414032915976,"score_gpt":0.23415769024501226,"score_spread":0.22513027621209628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142002524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94033,0.00021745669,0.05770011,0.00006816994,0.000017018252,0.000046007117,0.0001888619,0.0004627159,0.00096964306],"genre_scores_gemma":[0.9853345,0.00006172483,0.013904727,0.000017708697,0.0000063467282,0.000021055184,0.000214017,0.000047568377,0.00039248334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905056,0.00019771277,0.000053461237,0.0001785127,0.00041663676,0.0001031088],"domain_scores_gemma":[0.987997,0.009400293,0.0008011903,0.0007286004,0.000986614,0.0000862084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413699,0.00077483885,0.00033232948,0.0011689834,0.00019167294,0.00055386376,0.0003603725,0.0005240791,0.0005677455],"category_scores_gemma":[0.014199012,0.00027809935,0.00030762103,0.0006329013,0.00031646676,0.00083800335,0.00019301855,0.00041634424,0.00023624548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044372978,0.00012904569,0.060761362,0.000059643124,0.000061953055,0.00014098696,0.00004144942,0.8649849,0.015872478,0.00043447193,0.00028782137,0.056782216],"study_design_scores_gemma":[0.0000065053323,0.00022870192,0.012951392,0.0000041343783,0.000018854293,0.00006515978,0.000012651704,0.974323,0.011993453,0.00024356105,0.0001429449,0.000009632999],"about_ca_topic_score_codex":0.0043433905,"about_ca_topic_score_gemma":0.006345815,"teacher_disagreement_score":0.0043433905,"about_ca_system_score_codex":0.000730994,"about_ca_system_score_gemma":0.00045644402,"threshold_uncertainty_score":0.008636236},"labels":[],"label_agreement":null},{"id":"W2142395333","doi":"10.1109/fpl.2006.311357","title":"Architecture and CAD for FPGA Clock Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Digital clock manager; Clock network; Clock skew; Computer science; Clock gating; Embedded system; Skew; Process (computing); CAD; CPU multiplier; FPGA prototype; Computer hardware; Computer architecture; Clock signal; Engineering; Jitter; Telecommunications; Operating system","score_opus":0.003657012666872999,"score_gpt":0.17736353855774792,"score_spread":0.17370652589087493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142395333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008885307,0.004195913,0.8030189,0.0011439716,0.0010142066,0.0002581061,0.0005018131,0.0035101944,0.17747153],"genre_scores_gemma":[0.15156984,0.0054000802,0.7465025,0.00041835193,0.00026220083,0.0003715199,0.0013008404,0.00066227803,0.093512334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996419,0.00005170734,0.000020394506,0.00004080623,0.00021535276,0.000029903973],"domain_scores_gemma":[0.99973613,0.000052281976,0.000014762991,0.000053592907,0.00012927614,0.000013873176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004493865,0.00047627225,0.00020031158,0.000880334,0.000366283,0.0012049065,0.000571185,0.0005496426,0.016443532],"category_scores_gemma":[0.0013656593,0.00028214892,0.00032304757,0.0006152643,0.00031337675,0.0006648356,0.0004176067,0.0008268161,0.004353897],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000750825,0.000028388107,0.000640678,0.0004067648,0.000016218986,0.0002990024,0.00016462087,0.055927582,0.016392618,0.4646985,0.038357016,0.42299345],"study_design_scores_gemma":[0.00007798534,0.00009107434,0.0005998154,0.00026332156,0.000020913702,0.00060979184,0.000048533897,0.146453,0.014269602,0.05699928,0.7805292,0.000037448157],"about_ca_topic_score_codex":0.0020468184,"about_ca_topic_score_gemma":0.0031392795,"teacher_disagreement_score":0.016443532,"about_ca_system_score_codex":0.0007678849,"about_ca_system_score_gemma":0.00083413394,"threshold_uncertainty_score":0.055009067},"labels":[],"label_agreement":null},{"id":"W2142424442","doi":"10.1109/icvd.1994.282671","title":"A new genetic algorithm for the channel routing problem","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Routing (electronic design automation); Genetic algorithm; Channel (broadcasting); Algorithm; Computer network; Machine learning","score_opus":0.018886702047897445,"score_gpt":0.1999399463439825,"score_spread":0.18105324429608505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142424442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046117697,0.00025958478,0.99111676,0.00013529838,0.00008753808,0.000053931108,0.00004523223,0.0002979309,0.0033920181],"genre_scores_gemma":[0.0932373,0.00058909296,0.8972939,0.00023696519,0.000102082246,0.00036741493,0.00028558666,0.00015279488,0.0077348677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996278,0.0000922565,0.0000145144195,0.00007929394,0.00014484146,0.00004127048],"domain_scores_gemma":[0.99972826,0.00013650673,0.00002016553,0.000024176212,0.000073288786,0.00001763037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046488098,0.0006580994,0.0007158564,0.00081121904,0.00049082463,0.0008587824,0.0010460528,0.0014777523,0.00417232],"category_scores_gemma":[0.0013374507,0.00028411677,0.00060984265,0.0008933392,0.0006780024,0.0010893024,0.00072123966,0.001156767,0.00090291415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058801445,0.000086505184,0.00046933972,0.00012791576,0.000068225316,0.00014331269,0.00007370502,0.6921254,0.0070131538,0.06058552,0.006040625,0.23320751],"study_design_scores_gemma":[0.000047644888,0.000042139116,0.00008697819,0.000013855962,0.000018130828,0.00008090737,0.000012401419,0.97442836,0.0011061016,0.015918221,0.008230804,0.000014452508],"about_ca_topic_score_codex":0.0029774492,"about_ca_topic_score_gemma":0.0030921104,"teacher_disagreement_score":0.00417232,"about_ca_system_score_codex":0.0006770239,"about_ca_system_score_gemma":0.0012933206,"threshold_uncertainty_score":0.0139577985},"labels":[],"label_agreement":null},{"id":"W2142533150","doi":"10.1109/tvlsi.2008.2005307","title":"Total Power Modeling in FPGAs Under Spatial Correlation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Dissipation; Independence (probability theory); Power (physics); Computer science; Spatial correlation; Dynamic demand; Logic gate; Dependency (UML); Routing (electronic design automation); Electronic engineering; Algorithm; Engineering; Embedded system; Mathematics; Artificial intelligence; Statistics; Physics; Telecommunications","score_opus":0.012394807424171522,"score_gpt":0.21833918065804933,"score_spread":0.20594437323387782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142533150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11811195,0.00018888483,0.87880015,0.000049160062,0.000009240832,0.000019783685,0.000046960915,0.00022401684,0.002549943],"genre_scores_gemma":[0.96604794,0.00024910388,0.03209473,0.000024394503,0.000010772843,0.000029339306,0.00003971259,0.00004490449,0.001459042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.000057042027,0.000013584949,0.000047499176,0.00014122199,0.000027948876],"domain_scores_gemma":[0.9994667,0.0002546951,0.000105231695,0.000080175465,0.00008340636,0.000009838919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026345902,0.00046718883,0.0002386443,0.0003790677,0.00018005478,0.00040308078,0.00056108576,0.00023516138,0.0006569617],"category_scores_gemma":[0.001292621,0.00027605207,0.00035691416,0.00046571041,0.0003151132,0.00090458244,0.00028871515,0.000277961,0.00018105916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002267913,0.00000692833,0.00090079993,0.000012332076,0.0000114594595,0.00008763256,0.000017349566,0.9819532,0.004038601,0.0026669083,0.0000671915,0.010214938],"study_design_scores_gemma":[0.0000013051972,0.000017546416,0.00033650905,0.000001286058,0.0000048989937,0.000044536075,0.000003476389,0.99677783,0.0017691541,0.0009152927,0.00012606267,0.0000021375195],"about_ca_topic_score_codex":0.0012899375,"about_ca_topic_score_gemma":0.0017437066,"teacher_disagreement_score":0.0012899375,"about_ca_system_score_codex":0.00032961555,"about_ca_system_score_gemma":0.0003741864,"threshold_uncertainty_score":0.002564907},"labels":[],"label_agreement":null},{"id":"W2142611170","doi":"10.1109/ccece.2009.5090269","title":"Artificial neural network application in analog layout placement design","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Artificial neural network; Computer architecture; Artificial intelligence","score_opus":0.02002633953648071,"score_gpt":0.2340297920642609,"score_spread":0.2140034525277802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142611170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068433015,0.00034273052,0.990369,0.00011904299,0.000050968683,0.000014593959,0.00000999559,0.000271653,0.0019786619],"genre_scores_gemma":[0.44760153,0.0005902278,0.5459036,0.00024102385,0.00009640103,0.00009698613,0.00005914305,0.00007411688,0.00533695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997999,0.000061016766,0.000011580455,0.00003667116,0.00007291261,0.00001793645],"domain_scores_gemma":[0.9997317,0.00014097586,0.000025187606,0.000018727267,0.00007459362,0.000008828082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043854254,0.00047947405,0.0003967446,0.00044901847,0.00030104714,0.0004337214,0.00070473365,0.00086645846,0.002169385],"category_scores_gemma":[0.0009689577,0.0003000597,0.0002994938,0.00057733955,0.0003135447,0.00059610803,0.00028852143,0.00046774832,0.00034546474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006820267,0.000039029146,0.00038511457,0.000119512006,0.00004460483,0.000082882296,0.000035548033,0.77152175,0.013043058,0.009558928,0.0013193836,0.20378204],"study_design_scores_gemma":[0.00000561727,0.00001931746,0.00008395918,0.0000041883736,0.0000059397626,0.000020351032,0.000003436412,0.9945321,0.0022533094,0.0020661491,0.0010010963,0.000004427683],"about_ca_topic_score_codex":0.001540438,"about_ca_topic_score_gemma":0.0024031661,"teacher_disagreement_score":0.002169385,"about_ca_system_score_codex":0.00054065714,"about_ca_system_score_gemma":0.00036259924,"threshold_uncertainty_score":0.0072572827},"labels":[],"label_agreement":null},{"id":"W2142756199","doi":"10.1007/978-3-642-03685-9_1","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Approximation algorithm; Discrete mathematics; Mathematics; Cardinality (data modeling); Computer science; Graph; Algorithm","score_opus":0.017948463206996036,"score_gpt":0.23337833848091166,"score_spread":0.21542987527391563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142756199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137946,0.012806151,0.76155835,0.009655045,0.00088271935,0.00047941544,0.0034013938,0.002187762,0.07764972],"genre_scores_gemma":[0.4702369,0.013504969,0.46351323,0.0019119804,0.0023125734,0.0009745667,0.009917064,0.0015640291,0.036064755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958775,0.00097388006,0.00025634203,0.0008508914,0.0014092106,0.00063223595],"domain_scores_gemma":[0.9846676,0.0116256485,0.0007005262,0.0020149213,0.0005486516,0.00044267206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025658535,0.0033784807,0.0041205115,0.0027047535,0.0027821155,0.008635891,0.007828078,0.0044015334,0.01756754],"category_scores_gemma":[0.017225292,0.0028692356,0.0042631994,0.008335703,0.0039543477,0.018555058,0.0046831714,0.0124424435,0.0031408018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023412753,0.0016017932,0.0030586903,0.0032223375,0.0005663844,0.00051096716,0.0015202203,0.3306369,0.0071573886,0.35597822,0.06919861,0.22420725],"study_design_scores_gemma":[0.00031487513,0.00016781292,0.0011740754,0.00019826462,0.0002403203,0.00054834055,0.00051878794,0.34060657,0.003007336,0.6411605,0.011982712,0.00008034057],"about_ca_topic_score_codex":0.002780835,"about_ca_topic_score_gemma":0.003105304,"teacher_disagreement_score":0.01756754,"about_ca_system_score_codex":0.0038156393,"about_ca_system_score_gemma":0.0020715639,"threshold_uncertainty_score":0.058769286},"labels":[],"label_agreement":null},{"id":"W2142966647","doi":"10.5555/1129601.1129691","title":"Timing-aware power noise reduction in layout","year":2005,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Apache (Canada)","funders":"","keywords":"Noise (video); Computer science; Reduction (mathematics); Noise reduction; Power (physics); Electronic engineering; Dynamic demand; Sizing; Engineering; Artificial intelligence; Mathematics","score_opus":0.057599402202576026,"score_gpt":0.2777333425474824,"score_spread":0.22013394034490635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142966647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020690655,0.00032901202,0.97502214,0.00012509075,0.000052892352,0.000023502713,0.00003170968,0.0016876963,0.0020372807],"genre_scores_gemma":[0.46785128,0.00057583547,0.5221305,0.00029690049,0.00012334163,0.00007589747,0.00019854997,0.00047509038,0.008272577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956995,0.00006920464,0.000018705961,0.000073619776,0.00022724786,0.000041300493],"domain_scores_gemma":[0.99941325,0.00023211578,0.00009459708,0.000115220035,0.0001297151,0.000015083772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024087081,0.00081569626,0.00041920907,0.00060674123,0.00040438047,0.00046637616,0.0008361788,0.000372428,0.0020870266],"category_scores_gemma":[0.0013841044,0.0003892547,0.00044384864,0.0006667929,0.0002623771,0.00083394954,0.00043522648,0.0004555141,0.0006724208],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017926778,0.00011148168,0.0012386038,0.00019043252,0.000052053158,0.00022743791,0.00012429447,0.42175898,0.18407808,0.011148557,0.0027151867,0.3781757],"study_design_scores_gemma":[0.000030358324,0.00022597722,0.0006992867,0.000015802305,0.000056080804,0.00036686053,0.000036097466,0.89633983,0.08582693,0.00766252,0.008720219,0.000020027832],"about_ca_topic_score_codex":0.0013557135,"about_ca_topic_score_gemma":0.003098957,"teacher_disagreement_score":0.0020870266,"about_ca_system_score_codex":0.00058360375,"about_ca_system_score_gemma":0.0007125095,"threshold_uncertainty_score":0.00698179},"labels":[],"label_agreement":null},{"id":"W2143172342","doi":"10.1155/2013/751030","title":"Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Key Research and Development Program of China; Fonds Spéciaux de Recherche; China Institute of Water Resources and Hydropower Research; National Natural Science Foundation of China","keywords":"Computer science; Graph partition; Parallel computing; Graph; Preprocessor; Software; Finite element method; Domain decomposition methods; Key (lock); Algorithm; Decomposition; Theoretical computer science; Programming language; Engineering","score_opus":0.010271315962459305,"score_gpt":0.20675619929368114,"score_spread":0.19648488333122183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143172342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003850932,0.00008515232,0.99248403,0.00005087942,0.000029121453,0.000037068272,0.000016379834,0.00053230464,0.0029142208],"genre_scores_gemma":[0.102522455,0.00030581138,0.8926502,0.00006596045,0.000041674673,0.00021999149,0.00023773371,0.00028878808,0.003667396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956185,0.00006325692,0.000028668497,0.00008409819,0.00023135309,0.000030635936],"domain_scores_gemma":[0.99972075,0.000073277886,0.000014850991,0.000053658514,0.00012949774,0.0000078193125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039810737,0.00042616724,0.00047215066,0.0009693118,0.0006175066,0.0005537112,0.00082850223,0.0004542018,0.0035547514],"category_scores_gemma":[0.0011751296,0.00028536908,0.00051858835,0.0007629436,0.0005280753,0.0010897424,0.000707698,0.0005612444,0.0008402222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013930337,0.000070185495,0.0013467314,0.00020177204,0.000033662687,0.00015480538,0.00031142234,0.20813237,0.04086321,0.10511675,0.005210299,0.6384195],"study_design_scores_gemma":[0.00003225919,0.00006002415,0.000342443,0.00002137306,0.00001718683,0.00022553526,0.00004917607,0.94232,0.014757049,0.023441179,0.018714843,0.00001896722],"about_ca_topic_score_codex":0.0021632295,"about_ca_topic_score_gemma":0.0013997902,"teacher_disagreement_score":0.0035547514,"about_ca_system_score_codex":0.0003987027,"about_ca_system_score_gemma":0.0006991329,"threshold_uncertainty_score":0.011891842},"labels":[],"label_agreement":null},{"id":"W2144655684","doi":"10.1109/fpl.2011.67","title":"Reducing FPGA Router Run-Time through Algorithm and Architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Router; Pathfinder; Algorithm; Overhead (engineering); Parallel computing; Reduction (mathematics); Multipath routing; Static routing; Embedded system; Computer network; Routing protocol; Mathematics","score_opus":0.013153260713161564,"score_gpt":0.1949060365368834,"score_spread":0.18175277582372185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144655684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828768,0.0010105952,0.8943876,0.0005683525,0.00008510214,0.00015516569,0.00007783159,0.0046374775,0.016201142],"genre_scores_gemma":[0.30276895,0.00044870822,0.6891535,0.00018551786,0.000033905162,0.00011172118,0.00022245337,0.00029194076,0.0067832475],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951684,0.0001123984,0.000028300898,0.000083483275,0.00019897467,0.00005997892],"domain_scores_gemma":[0.9992539,0.00027322207,0.00009490122,0.00021357031,0.00014239948,0.000022005941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849012,0.00059385103,0.00031161096,0.00055999827,0.00024896368,0.0009309229,0.0010003871,0.00039383737,0.0048986184],"category_scores_gemma":[0.0011641385,0.00025984235,0.00034600103,0.000483701,0.00028950404,0.0010409817,0.00032249646,0.0006494267,0.0010395314],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000277335,0.00020072359,0.0021738412,0.00032019682,0.00009136873,0.00023120797,0.000090799236,0.19747527,0.10864191,0.019040868,0.004782439,0.66667396],"study_design_scores_gemma":[0.00018206077,0.00081632467,0.0032937406,0.00005952928,0.00019090071,0.0009033318,0.00010502158,0.8462723,0.098745465,0.009868938,0.039491545,0.00007087463],"about_ca_topic_score_codex":0.0020578112,"about_ca_topic_score_gemma":0.0071636774,"teacher_disagreement_score":0.0048986184,"about_ca_system_score_codex":0.00077723525,"about_ca_system_score_gemma":0.001028519,"threshold_uncertainty_score":0.016387463},"labels":[],"label_agreement":null},{"id":"W2144723702","doi":"10.1109/ccece.2003.1225998","title":"A heuristic for the POP topological optimization problem in IP networks","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Router; Heuristic; Computer science; Topology (electrical circuits); Port (circuit theory); Interface (matter); Network topology; Computer network; Distributed computing; Mathematics; Engineering; Combinatorics; Parallel computing","score_opus":0.010972568796258375,"score_gpt":0.2140575910034498,"score_spread":0.2030850222071914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144723702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022773402,0.0005224648,0.9659553,0.0003840606,0.000078246325,0.00017896145,0.00012258375,0.00031908683,0.009665827],"genre_scores_gemma":[0.31917924,0.0006237536,0.6742704,0.00034709935,0.00008792649,0.0005055373,0.00046991854,0.00017737503,0.0043387683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.00027795212,0.000023629622,0.000072641094,0.00011309394,0.0001285542],"domain_scores_gemma":[0.9987435,0.00093892124,0.000082584695,0.000075966826,0.00009283104,0.00006614581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012754014,0.0011881317,0.0012661519,0.0012460676,0.0007276911,0.0012237972,0.0013930803,0.0018363075,0.006401828],"category_scores_gemma":[0.0030213413,0.00064947346,0.0008224255,0.00109847,0.0010249594,0.0017283058,0.0012494557,0.0010698533,0.0007011199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011972051,0.000107072345,0.00034692432,0.00015434055,0.00003107593,0.0001284769,0.000054037035,0.92058027,0.0008178109,0.02538206,0.0033232667,0.048954923],"study_design_scores_gemma":[0.00006139029,0.000105006424,0.00009155217,0.00003280024,0.000019723047,0.00006332176,0.000062558734,0.979369,0.00052052713,0.016743174,0.002918783,0.00001210637],"about_ca_topic_score_codex":0.0017095706,"about_ca_topic_score_gemma":0.0019588533,"teacher_disagreement_score":0.006401828,"about_ca_system_score_codex":0.0010199706,"about_ca_system_score_gemma":0.0012688272,"threshold_uncertainty_score":0.021416306},"labels":[],"label_agreement":null},{"id":"W2145101332","doi":"10.1109/fpt.2009.5377654","title":"Area, delay, power, and cost trends for metal-programmable structured ASICs (MPSAs)","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Application-specific integrated circuit; Field-programmable gate array; Computer science; Process (computing); Key (lock); Integrated circuit; Embedded system; Power (physics)","score_opus":0.013914197401761358,"score_gpt":0.2407055842805286,"score_spread":0.22679138687876724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145101332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828189,0.0013347551,0.0050597643,0.00036427224,0.000022747101,0.000011286004,0.0005785501,0.00014311675,0.009666777],"genre_scores_gemma":[0.98966134,0.00088852865,0.0061307307,0.000058749552,0.000019530935,0.000014622428,0.0005457985,0.000026223759,0.0026543168],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998012,0.0000198367,0.000008469303,0.000056630455,0.00008884133,0.000025107407],"domain_scores_gemma":[0.9986994,0.0005329872,0.00024809534,0.00007495922,0.00040635339,0.000038120306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023491823,0.00023269039,0.00012778476,0.00078576436,0.00012516673,0.0005122054,0.0002761979,0.00040858868,0.001913877],"category_scores_gemma":[0.0014165868,0.00011893895,0.00013327049,0.001530495,0.0001606812,0.0012117998,0.00008293074,0.00024036379,0.0003595796],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00214431,0.00038491748,0.12929158,0.00082790473,0.0001752356,0.0012075641,0.00042110382,0.20535678,0.3052081,0.028958388,0.008896029,0.317128],"study_design_scores_gemma":[0.000087809065,0.0053593176,0.23221122,0.000109262626,0.00026039008,0.0025698158,0.0012046614,0.46517074,0.24364638,0.016072704,0.03319509,0.000112522415],"about_ca_topic_score_codex":0.0013853934,"about_ca_topic_score_gemma":0.0028279258,"teacher_disagreement_score":0.001913877,"about_ca_system_score_codex":0.00044958215,"about_ca_system_score_gemma":0.00018680784,"threshold_uncertainty_score":0.006402552},"labels":[],"label_agreement":null},{"id":"W2146888824","doi":"10.1109/ecctd.2007.4529654","title":"Clustering algorithms for circuit partitioning and placement problems","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Digital electronics; Algorithm; Correlation clustering; Data mining; Computer engineering; Electronic circuit; Artificial intelligence; Engineering","score_opus":0.034607140389724206,"score_gpt":0.24935574639417696,"score_spread":0.21474860600445275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146888824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005188317,0.0017129588,0.9889508,0.00023067763,0.000077125915,0.00012034041,0.00012348345,0.00039051767,0.0032058689],"genre_scores_gemma":[0.1422181,0.0036567594,0.84714454,0.0002126222,0.00028331557,0.00041853264,0.0010727752,0.0002851238,0.004708232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812,0.0005748814,0.00011038258,0.00023612192,0.00083873793,0.000119840646],"domain_scores_gemma":[0.9970682,0.0015902931,0.000220243,0.00029658,0.00074924016,0.000075411364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531731,0.001666679,0.0013286537,0.0025412804,0.0013221785,0.0012947682,0.0018937899,0.001798143,0.0035881484],"category_scores_gemma":[0.009929141,0.0005552174,0.00094940205,0.004475451,0.00089800346,0.002032212,0.001340141,0.0017850015,0.0016132686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011675095,0.00006593102,0.000686025,0.00033199953,0.00009794095,0.00005123648,0.00012162891,0.6765655,0.003136773,0.058027405,0.008206019,0.25259274],"study_design_scores_gemma":[0.000025541458,0.00005153984,0.00033965064,0.000027393702,0.00002021974,0.00009804076,0.000045377164,0.946328,0.0012574111,0.045665964,0.0061243665,0.0000164375],"about_ca_topic_score_codex":0.0032199793,"about_ca_topic_score_gemma":0.0041033104,"teacher_disagreement_score":0.0035881484,"about_ca_system_score_codex":0.0013532559,"about_ca_system_score_gemma":0.0010455343,"threshold_uncertainty_score":0.012003541},"labels":[],"label_agreement":null},{"id":"W2147209308","doi":"10.1109/asic.2001.954706","title":"A clustering utility based approach for ASIC design","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Application-specific integrated circuit; Cluster analysis; Computer science; Heuristic; Interconnection; Electronics; Key (lock); Chip; System on a chip; Embedded system; Integrated circuit; Integrated circuit design; Computer engineering; Computer architecture; Engineering; Electrical engineering; Artificial intelligence; Telecommunications","score_opus":0.07999541787729543,"score_gpt":0.22188144737234036,"score_spread":0.14188602949504492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147209308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053340117,0.00027242568,0.989363,0.00007824742,0.000024272746,0.000095046154,0.000044764944,0.00096997933,0.0038182898],"genre_scores_gemma":[0.14426279,0.0005094724,0.8475909,0.00009700527,0.000031529453,0.00024933278,0.0002517532,0.0002464712,0.0067606997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995995,0.00010228046,0.000014998287,0.000046728903,0.00019762588,0.00003893381],"domain_scores_gemma":[0.99973816,0.000062965126,0.00001890143,0.000043894957,0.00012433044,0.00001171607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034520417,0.0007367837,0.00045658456,0.0012490435,0.00058780255,0.0006723099,0.0010030833,0.00044408964,0.003515031],"category_scores_gemma":[0.00088264677,0.00032927791,0.00042539238,0.0015640268,0.00029312875,0.0005780102,0.00044133118,0.0004913723,0.0008934154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001037916,0.00008755054,0.0004149788,0.00018806351,0.000059470716,0.00011652722,0.0001229467,0.3043975,0.016633043,0.033893593,0.009399676,0.6345829],"study_design_scores_gemma":[0.000022008353,0.00008406595,0.0002027318,0.000019071307,0.000033247223,0.00013918347,0.000046022356,0.96263784,0.008235396,0.0136234835,0.01493925,0.00001773914],"about_ca_topic_score_codex":0.004009299,"about_ca_topic_score_gemma":0.0073049595,"teacher_disagreement_score":0.004009299,"about_ca_system_score_codex":0.00096842524,"about_ca_system_score_gemma":0.0009411303,"threshold_uncertainty_score":0.011758983},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02608449495973388,"score_gpt":0.24309535380356354,"score_spread":0.21701085884382965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147506855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43441027,0.0011474834,0.49750406,0.0007261955,0.000170035,0.00014296194,0.00031917,0.0025935485,0.06298624],"genre_scores_gemma":[0.8815921,0.00027365598,0.11346948,0.000088518325,0.00002229277,0.00006299552,0.00013795435,0.00004676985,0.004306211],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999304,0.000012002029,0.0000037969667,0.000012488767,0.000022472406,0.000018777526],"domain_scores_gemma":[0.9999304,0.000011074568,0.000014702318,0.000014256827,0.000023253495,0.000006424529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006889644,0.00016500596,0.00012101604,0.00023042828,0.00020744471,0.00034840443,0.00036384616,0.00017634802,0.0019315454],"category_scores_gemma":[0.00021753219,0.00009232547,0.00011600338,0.00019930337,0.00011294321,0.00022354144,0.0001771472,0.00015948783,0.00040059217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029354703,0.00008157284,0.0057130232,0.0005038675,0.00010129603,0.00083174463,0.00025255283,0.24705158,0.33850968,0.056966566,0.014562426,0.33513218],"study_design_scores_gemma":[0.00010306801,0.0009319584,0.0044434164,0.00008663088,0.00008296593,0.000819417,0.00018272264,0.7832662,0.13107163,0.011691317,0.06727706,0.000043614822],"about_ca_topic_score_codex":0.00084860827,"about_ca_topic_score_gemma":0.0034566678,"teacher_disagreement_score":0.0019315454,"about_ca_system_score_codex":0.00044517597,"about_ca_system_score_gemma":0.00028888506,"threshold_uncertainty_score":0.00646168},"labels":[],"label_agreement":null},{"id":"W2147640578","doi":"10.1287/ijoc.1050.0154","title":"Using Eigenvectors to Partition Circuits","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Eigenvalues and eigenvectors; Computer science; Mathematics; Electronic circuit; Arithmetic; Combinatorics; Engineering; Physics; Electrical engineering","score_opus":0.027372000564207362,"score_gpt":0.25504836344767023,"score_spread":0.22767636288346288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147640578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009425058,0.00010723308,0.98614186,0.000057297042,0.000029260698,0.00003883443,0.00008129546,0.00041726348,0.0037018952],"genre_scores_gemma":[0.15078364,0.00039480295,0.8406411,0.00009481011,0.000048098307,0.00021121542,0.000509682,0.00044656688,0.0068700234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943453,0.00012952415,0.00003301926,0.0001262936,0.00019392544,0.00008270081],"domain_scores_gemma":[0.999258,0.00031405146,0.000071881994,0.00011665873,0.00020719621,0.000032272113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050785195,0.0012244361,0.00058220676,0.0020435972,0.00077548815,0.0014954688,0.0005898775,0.00056782586,0.007076204],"category_scores_gemma":[0.0029878588,0.0005150764,0.00057840726,0.0015361403,0.000900128,0.0016922269,0.0007946566,0.0008869612,0.0018692777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015285308,0.00007576408,0.0011681562,0.00018245741,0.00004392024,0.00014446754,0.0002703373,0.3928315,0.034613904,0.19737017,0.005891716,0.36725467],"study_design_scores_gemma":[0.000049327213,0.0000872646,0.0005999814,0.000042490043,0.000022474758,0.00015768023,0.00012230697,0.7945261,0.0123519795,0.17609985,0.015907498,0.000032953907],"about_ca_topic_score_codex":0.0046920236,"about_ca_topic_score_gemma":0.0068992693,"teacher_disagreement_score":0.007076204,"about_ca_system_score_codex":0.0009688718,"about_ca_system_score_gemma":0.0009703171,"threshold_uncertainty_score":0.023672283},"labels":[],"label_agreement":null},{"id":"W2147903260","doi":"10.1109/fpt.2004.1393252","title":"Placement and routing for non-rectangular embedded programmable logic cores in SoC design","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Routing (electronic design automation); Computer science; Programmable logic device; Logic synthesis; Embedded system; Programmable logic array; Computer architecture; Logic gate; Parallel computing; Algorithm","score_opus":0.023506044105524145,"score_gpt":0.2549584049747044,"score_spread":0.23145236086918025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147903260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059352767,0.00066935807,0.9340365,0.00015854814,0.00005861685,0.000070918,0.000025233596,0.0006064909,0.005021522],"genre_scores_gemma":[0.37416416,0.0005172588,0.62188303,0.00011491687,0.000028731383,0.000048349266,0.000065234206,0.000075202785,0.0031030383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968874,0.000113046764,0.000020003057,0.000049046324,0.00009023892,0.000038965925],"domain_scores_gemma":[0.9996462,0.0001408524,0.00006655731,0.000053213163,0.00007849515,0.000014603409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044490895,0.0003105507,0.00020146735,0.00034534637,0.00025751122,0.00037607388,0.0003691315,0.00021823187,0.0013160175],"category_scores_gemma":[0.0011776591,0.00021985275,0.00017458427,0.00039149224,0.0004024325,0.000560543,0.0002982984,0.0002561737,0.00030428445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022493575,0.00004610136,0.0011274521,0.00019464339,0.000023220427,0.00023296785,0.0001312945,0.6299748,0.041243497,0.03417602,0.0023210244,0.29030403],"study_design_scores_gemma":[0.00003220523,0.00016294837,0.00046768246,0.000024496969,0.00001919374,0.00018068403,0.000049768827,0.96445644,0.017093694,0.0116174435,0.0058806944,0.000014660795],"about_ca_topic_score_codex":0.0020653363,"about_ca_topic_score_gemma":0.0068662623,"teacher_disagreement_score":0.0020653363,"about_ca_system_score_codex":0.00050376565,"about_ca_system_score_gemma":0.00094502553,"threshold_uncertainty_score":0.0044025183},"labels":[],"label_agreement":null},{"id":"W2148414872","doi":"10.21236/ada603903","title":"Integration of Physical Design and Sequential Optimization","year":2006,"lang":"en","type":"report","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Computer science","score_opus":0.031718748905475484,"score_gpt":0.2656318573185264,"score_spread":0.2339131084130509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148414872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008024327,0.0006786577,0.9764554,0.00035934988,0.00008435957,0.00003499771,0.000015175551,0.00029913284,0.014048657],"genre_scores_gemma":[0.37640622,0.001911658,0.6130657,0.00027918487,0.00014472364,0.00013586287,0.00006884499,0.00031376595,0.0076740277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.00033494912,0.000046527053,0.000102281796,0.00052680925,0.0000657489],"domain_scores_gemma":[0.99861944,0.0007110488,0.00012148415,0.0003045656,0.0002173048,0.000026312106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011057578,0.0006265912,0.00041485004,0.00053889403,0.00030435057,0.00087007263,0.0006739859,0.00037364117,0.0032418407],"category_scores_gemma":[0.0028696763,0.00041468735,0.00047308006,0.00048154895,0.0009292215,0.0011157268,0.0006988145,0.0006700264,0.00050277147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009337867,0.00006533771,0.00078994303,0.00033065118,0.00006108821,0.00012923437,0.00008608741,0.5802562,0.019306207,0.2027735,0.00110363,0.19500476],"study_design_scores_gemma":[0.000042677457,0.00026269973,0.00053563464,0.000054653843,0.00006211251,0.0002265609,0.00004262881,0.8391427,0.012844814,0.119513705,0.027246758,0.0000250469],"about_ca_topic_score_codex":0.0010903458,"about_ca_topic_score_gemma":0.0019972972,"teacher_disagreement_score":0.0032418407,"about_ca_system_score_codex":0.0009244385,"about_ca_system_score_gemma":0.0013903632,"threshold_uncertainty_score":0.0108450055},"labels":[],"label_agreement":null},{"id":"W2149159580","doi":"10.1109/cicc.1993.590820","title":"Multilevel optimization of high speed VLSI interconnects using decomposition","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Very-large-scale integration; Computer science; Decomposition; Parallel computing; Hierarchy; Printed circuit board; Tearing; Electric power transmission; Electronic engineering; Electrical engineering; Engineering; Embedded system","score_opus":0.028166880446567986,"score_gpt":0.2393816415894646,"score_spread":0.2112147611428966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149159580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021929836,0.00015958,0.9742929,0.000064596104,0.000016732942,0.000017121356,0.00003610591,0.0002927759,0.0031904557],"genre_scores_gemma":[0.5069464,0.00033092883,0.4888304,0.00007400404,0.000028366685,0.0001700262,0.0002110787,0.00019549545,0.0032134042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980825,0.00004491728,0.0000074052505,0.000027301343,0.000078311576,0.00003384083],"domain_scores_gemma":[0.99983406,0.00006504653,0.000028511056,0.000026306452,0.000032785087,0.000013243518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025872793,0.00063909334,0.0005730726,0.0003868778,0.0003343487,0.0004853769,0.0004779616,0.00037245319,0.0018240893],"category_scores_gemma":[0.0006460306,0.00032842736,0.00078929414,0.00050267176,0.0003424395,0.00059316406,0.00077560864,0.00075053633,0.00037352313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025029107,0.000020946452,0.00024486563,0.000053385647,0.000035327343,0.000033600525,0.000028223008,0.93322974,0.016347907,0.015845807,0.000864601,0.033270534],"study_design_scores_gemma":[0.000006225266,0.000023802562,0.000058592028,0.000002481521,0.0000045886654,0.000007431933,0.000003680309,0.9950364,0.0013051308,0.0029729009,0.00057601026,0.000002697676],"about_ca_topic_score_codex":0.0016859391,"about_ca_topic_score_gemma":0.0024510336,"teacher_disagreement_score":0.0018240893,"about_ca_system_score_codex":0.00055438635,"about_ca_system_score_gemma":0.0005729467,"threshold_uncertainty_score":0.0061021447},"labels":[],"label_agreement":null},{"id":"W2149504570","doi":"10.1108/02644400310502973","title":"Subdomain cluster generation for domain decomposition methods using graph partitioning optimization","year":2003,"lang":"en","type":"article","venue":"Engineering Computations","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Domain decomposition methods; Graph partition; Computer science; Parallel computing; Decomposition; Cluster (spacecraft); Heuristic; Decomposition method (queueing theory); Software; Graph; Load balancing (electrical power); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Finite element method; Chemistry; Engineering; Programming language","score_opus":0.02363652411567258,"score_gpt":0.30661947565827613,"score_spread":0.28298295154260356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149504570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122220935,0.00008162009,0.98534656,0.000057639965,0.000013377935,0.00004126979,0.000024188712,0.00016777235,0.002045497],"genre_scores_gemma":[0.17897399,0.0001450935,0.81844264,0.00004155805,0.000016303602,0.0001879744,0.00014209254,0.0001908963,0.0018595627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979943,0.000072011186,0.000007046911,0.000030749805,0.00007274187,0.000018051329],"domain_scores_gemma":[0.99972624,0.0001499941,0.000026625072,0.000031174888,0.000049754566,0.000016342414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043139458,0.00056836184,0.0004804142,0.0005457992,0.0004655766,0.0005169311,0.000447779,0.00037032447,0.0022353043],"category_scores_gemma":[0.0011447088,0.00024321732,0.00030716677,0.00049229333,0.00031083595,0.00042434203,0.00060853164,0.00058183155,0.0004802057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013666209,0.00007159274,0.0007612323,0.00015762476,0.000021331969,0.000056222405,0.00011957543,0.73677856,0.023194294,0.029253757,0.0024561356,0.20699304],"study_design_scores_gemma":[0.000011950278,0.000018160723,0.00007941959,0.000005652561,0.000003059392,0.000015106696,0.000018960063,0.9901827,0.0032076514,0.0043877326,0.002065873,0.0000036968793],"about_ca_topic_score_codex":0.0015024993,"about_ca_topic_score_gemma":0.0026958506,"teacher_disagreement_score":0.0022353043,"about_ca_system_score_codex":0.00054944854,"about_ca_system_score_gemma":0.00076470396,"threshold_uncertainty_score":0.00747782},"labels":[],"label_agreement":null},{"id":"W2149846723","doi":"10.1109/iscas.2010.5537167","title":"Symmetry-aware analog layout placement design handling substrate-sharing constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive closure; Computer science; Representation (politics); Graph; Computational complexity theory; Transitive relation; Set (abstract data type); Time complexity; Topology (electrical circuits); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.022977196984071916,"score_gpt":0.23527665101562487,"score_spread":0.21229945403155295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149846723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025689142,0.00006972916,0.96935946,0.000051247152,0.000033954,0.000039963044,0.000021597667,0.00036309517,0.004371823],"genre_scores_gemma":[0.5237976,0.00012420019,0.47326648,0.00007029763,0.000035964695,0.00005772486,0.00007714693,0.00007640639,0.002494216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999645,0.00009447042,0.000024373678,0.000044297587,0.00016099874,0.00003084664],"domain_scores_gemma":[0.99964786,0.000093532464,0.00006222772,0.00012365833,0.00005792213,0.000014818402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027026574,0.00045898813,0.00031135348,0.0003833347,0.00036403714,0.0004681154,0.000892952,0.0003301562,0.002086397],"category_scores_gemma":[0.00072663085,0.00019322387,0.0002991223,0.00049612863,0.00041329206,0.0007429867,0.0005104885,0.00033080616,0.0003689505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021093634,0.000097558725,0.00089786085,0.00027841792,0.000053656302,0.0005387219,0.00019859264,0.35865587,0.18417893,0.067352735,0.002568943,0.38496777],"study_design_scores_gemma":[0.00006933787,0.00031036275,0.00039337273,0.000016976684,0.00003755263,0.00052215677,0.00007118927,0.8733914,0.094905265,0.018230217,0.012028925,0.000023163717],"about_ca_topic_score_codex":0.0005385094,"about_ca_topic_score_gemma":0.001102337,"teacher_disagreement_score":0.002086397,"about_ca_system_score_codex":0.00039633954,"about_ca_system_score_gemma":0.0005289163,"threshold_uncertainty_score":0.006979704},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019693992566802015,"score_gpt":0.25741650922623527,"score_spread":0.23772251665943325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150022482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18235089,0.0023418427,0.63551986,0.00051499665,0.0004850842,0.00045687368,0.0012736605,0.07070519,0.10635156],"genre_scores_gemma":[0.70480067,0.00070153904,0.25928494,0.00026855222,0.00006743416,0.00026297156,0.0032298989,0.0018002441,0.029583711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996117,0.00006673941,0.000024170351,0.000054509153,0.00016108013,0.0000817858],"domain_scores_gemma":[0.9997619,0.000037516387,0.000025103187,0.000072392075,0.000058237772,0.000044769753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727761,0.0005078006,0.00034589448,0.0008532672,0.0003888547,0.0009090893,0.0014291669,0.0004155716,0.010255738],"category_scores_gemma":[0.00082457525,0.0003153449,0.00043153932,0.00055886974,0.00030223397,0.0013672886,0.0015031047,0.00068013516,0.002429134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026846188,0.00043248635,0.0049379626,0.0009004537,0.00022826908,0.0012418914,0.00042852777,0.120951034,0.091400266,0.08092674,0.07295637,0.62291145],"study_design_scores_gemma":[0.0005698025,0.002132162,0.0039844173,0.00016527083,0.00021195445,0.001802089,0.00023382083,0.5506531,0.085446395,0.03415631,0.32045177,0.00019284563],"about_ca_topic_score_codex":0.0014127144,"about_ca_topic_score_gemma":0.002366339,"teacher_disagreement_score":0.010255738,"about_ca_system_score_codex":0.00065370277,"about_ca_system_score_gemma":0.00070091215,"threshold_uncertainty_score":0.03430879},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.053136683840399636,"score_gpt":0.19464615835084725,"score_spread":0.14150947451044762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150098004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08900059,0.00085573934,0.87921953,0.0002745168,0.0002906729,0.00019745549,0.00020525506,0.0016516153,0.028304594],"genre_scores_gemma":[0.72831976,0.000702633,0.26284164,0.00021923843,0.000065787026,0.00013322235,0.0002270459,0.00012430984,0.007366365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999889,0.000019770996,0.000009013196,0.000026520556,0.000034764995,0.000020757147],"domain_scores_gemma":[0.99986887,0.000037544276,0.00001618402,0.000019008485,0.00004919984,0.000009169358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017607516,0.00024758835,0.00013443976,0.00021989467,0.00020806416,0.0005695913,0.000731723,0.00020015177,0.0036325732],"category_scores_gemma":[0.0003656639,0.00013669011,0.00015570478,0.0001809796,0.00016449855,0.00044689374,0.00013531277,0.00021887661,0.0005889893],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047501875,0.00009107869,0.002203186,0.0007160598,0.000114379436,0.00043668225,0.00017649448,0.11605204,0.3808052,0.10625187,0.006400668,0.38627726],"study_design_scores_gemma":[0.0001840928,0.0013412246,0.002020246,0.00012112727,0.00020539151,0.0010323022,0.0001281238,0.4532131,0.4109972,0.027044164,0.10366189,0.0000512213],"about_ca_topic_score_codex":0.000404721,"about_ca_topic_score_gemma":0.00087696715,"teacher_disagreement_score":0.0036325732,"about_ca_system_score_codex":0.00043018788,"about_ca_system_score_gemma":0.00035207727,"threshold_uncertainty_score":0.012152195},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02618504134952716,"score_gpt":0.22059743236395774,"score_spread":0.19441239101443059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150281391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.743051,0.0035986837,0.22941145,0.0008902561,0.000049618426,0.00013072502,0.00021461186,0.00097261486,0.021681063],"genre_scores_gemma":[0.9188041,0.00091695297,0.07760871,0.0000987334,0.000029419156,0.000052220526,0.0001302451,0.00013516778,0.002224408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995561,0.00012133063,0.000026027346,0.00004707549,0.00016936343,0.0000801662],"domain_scores_gemma":[0.99790585,0.0013876043,0.0002116876,0.0002619803,0.0001894588,0.000043390122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064153195,0.00043865124,0.0003285395,0.0004979278,0.00034622487,0.00060224504,0.0008611833,0.0003335178,0.0030338115],"category_scores_gemma":[0.0031283442,0.00021765626,0.0002256303,0.0008615802,0.00030588856,0.0017116487,0.00036303158,0.0003249779,0.0004392182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014615005,0.00016067516,0.0059664603,0.0005560726,0.00016081527,0.0003015925,0.00015548506,0.5558084,0.16031739,0.041227195,0.0028531312,0.23103121],"study_design_scores_gemma":[0.00024389448,0.0026836465,0.012142323,0.00010890994,0.00027209253,0.0016628567,0.0002898178,0.61977196,0.31695747,0.030482313,0.01530352,0.000081172686],"about_ca_topic_score_codex":0.0009379516,"about_ca_topic_score_gemma":0.0025671525,"teacher_disagreement_score":0.0030338115,"about_ca_system_score_codex":0.0007436642,"about_ca_system_score_gemma":0.0003549896,"threshold_uncertainty_score":0.010149121},"labels":[],"label_agreement":null},{"id":"W2150336620","doi":"10.1287/ijoc.1040.0127","title":"Integer Linear Programming Models for Global Routing","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Branch and price; Branch and cut; Linear programming; Mathematical optimization; Integer (computer science); Mathematics; Linear programming relaxation; Routing (electronic design automation); Branch and bound; Computer science; Programming language","score_opus":0.016612840833262452,"score_gpt":0.25495493552169163,"score_spread":0.23834209468842918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150336620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012751842,0.0052459603,0.953803,0.0015202609,0.0002676989,0.0001019838,0.00068276795,0.00042829066,0.036674805],"genre_scores_gemma":[0.27049822,0.020534046,0.63474727,0.0017788474,0.001463011,0.002179396,0.0037452602,0.00082981435,0.06422416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869317,0.0006293148,0.000055246084,0.00019646114,0.00028680908,0.00013900577],"domain_scores_gemma":[0.99847454,0.0011060955,0.00013060818,0.000067446854,0.00018362985,0.000037661353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015304339,0.0025763223,0.0012912651,0.00082420994,0.0005285882,0.0026768441,0.0019533369,0.0022653318,0.014447214],"category_scores_gemma":[0.0037186018,0.0007569091,0.0012025572,0.002392655,0.0010172452,0.0021137956,0.0013248704,0.0043691243,0.0042087156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003830474,0.000072097406,0.0001684112,0.0002908353,0.00004424045,0.00010121409,0.00010183083,0.58504766,0.00030132374,0.35675594,0.017468473,0.03960963],"study_design_scores_gemma":[0.000025815718,0.000024875315,0.000056025754,0.00006925954,0.000013643684,0.00003268645,0.00003937636,0.7581052,0.00011508857,0.21212864,0.02937592,0.000013391333],"about_ca_topic_score_codex":0.006046705,"about_ca_topic_score_gemma":0.0056607807,"teacher_disagreement_score":0.014447214,"about_ca_system_score_codex":0.0020124777,"about_ca_system_score_gemma":0.0020713343,"threshold_uncertainty_score":0.048330724},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026212895875709748,"score_gpt":0.20879863204576316,"score_spread":0.18258573617005341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150787480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02926999,0.0007766818,0.9628206,0.00007841975,0.0000329822,0.00019498462,0.000114830036,0.0016192466,0.005092331],"genre_scores_gemma":[0.15676808,0.0003974573,0.8405058,0.00007525985,0.000018318377,0.00027553074,0.00022555474,0.00019508747,0.0015390149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999551,0.00017045713,0.000026491422,0.00005414252,0.00012547965,0.00007243674],"domain_scores_gemma":[0.998814,0.00083649834,0.00010685032,0.00009952482,0.00011822212,0.000024945139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068862084,0.0010269299,0.0006552216,0.0011990863,0.0004891143,0.0007201346,0.0011599023,0.0005455727,0.0038384956],"category_scores_gemma":[0.0020833365,0.00057492615,0.0005999351,0.0009810855,0.00040059062,0.00084147725,0.000601893,0.0005027793,0.0007690393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017169381,0.00012999047,0.00095554127,0.00040941584,0.0000708337,0.00014766968,0.0001569702,0.6462622,0.009476564,0.016248941,0.0037249434,0.32224518],"study_design_scores_gemma":[0.00008393132,0.00016577184,0.0004232264,0.000051176296,0.000054655164,0.0001284489,0.00008561855,0.96886516,0.008967756,0.015767572,0.005381626,0.000025042773],"about_ca_topic_score_codex":0.0022463698,"about_ca_topic_score_gemma":0.0045184386,"teacher_disagreement_score":0.0038384956,"about_ca_system_score_codex":0.00087157375,"about_ca_system_score_gemma":0.0013939562,"threshold_uncertainty_score":0.012841105},"labels":[],"label_agreement":null},{"id":"W2151538019","doi":"10.1109/cicc.1995.518134","title":"BALLISTIC: an analog layout language","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Porting; Assembly language; Code (set theory); Parameterized complexity; Graphics; High-level programming language; Electronic circuit; Programming language; Routing (electronic design automation); Computer graphics (images); Electrical engineering; Embedded system; Engineering; Algorithm; Programming paradigm; Software","score_opus":0.01559915807385621,"score_gpt":0.20732591722434085,"score_spread":0.19172675915048465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151538019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009054706,0.00021202961,0.95044535,0.00014857946,0.00010378761,0.00012003861,0.0016894054,0.03311623,0.013259101],"genre_scores_gemma":[0.035878774,0.00063083257,0.9111777,0.00073163625,0.00012690347,0.0006128881,0.0043762345,0.009581967,0.03688304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992874,0.00012927891,0.00010129581,0.00010034758,0.000315139,0.00006660943],"domain_scores_gemma":[0.99932826,0.00019843444,0.00006791714,0.00011488799,0.00024996916,0.000040660398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070616766,0.0011005617,0.00052947213,0.00074742694,0.00053740694,0.002657407,0.0026139861,0.0007894792,0.05670306],"category_scores_gemma":[0.0017847846,0.000980237,0.0008260372,0.000670027,0.0006965293,0.0019036507,0.0013378883,0.0017324812,0.024713712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036041648,0.000096298216,0.00048031475,0.0018682103,0.000050353286,0.0007793802,0.0008261285,0.02903208,0.045649387,0.3821314,0.21409696,0.3246291],"study_design_scores_gemma":[0.00007606856,0.00008447562,0.00016315153,0.00016075022,0.000025123534,0.0010541453,0.000060018487,0.049040817,0.018644135,0.040850677,0.8897746,0.00006607451],"about_ca_topic_score_codex":0.0016923702,"about_ca_topic_score_gemma":0.002107615,"teacher_disagreement_score":0.05670306,"about_ca_system_score_codex":0.000867604,"about_ca_system_score_gemma":0.0013260475,"threshold_uncertainty_score":0.18969065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006557993342052479,"score_gpt":0.20227910757881648,"score_spread":0.195721114236764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151614223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13299906,0.0006623454,0.85655004,0.00021637639,0.00008530754,0.000084668456,0.00005656505,0.0038197783,0.005525881],"genre_scores_gemma":[0.58342594,0.0002515291,0.41337734,0.00012581343,0.000055320736,0.00004666414,0.00016621254,0.00028720647,0.0022639325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.00012193405,0.000049848823,0.000082865066,0.00032541525,0.00008776351],"domain_scores_gemma":[0.9979393,0.00062095094,0.00042312805,0.0006093357,0.00033845077,0.000068803536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005915493,0.0007468523,0.00062618434,0.001000329,0.00048205623,0.00089148094,0.0012642364,0.00059264695,0.0021039667],"category_scores_gemma":[0.004311944,0.00048660568,0.00031007262,0.0016053758,0.00046827874,0.0017352997,0.0008587463,0.0005613779,0.00066666456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069524,0.00031831555,0.0028969103,0.0002596272,0.00004473257,0.0002794149,0.00016810963,0.43059495,0.14489931,0.011069813,0.0037904913,0.40517133],"study_design_scores_gemma":[0.00007328774,0.0007114284,0.0024253991,0.000029610554,0.000045854773,0.00042736556,0.000063544525,0.8615583,0.12327234,0.0046866545,0.0066560344,0.000050206338],"about_ca_topic_score_codex":0.0009217638,"about_ca_topic_score_gemma":0.002714873,"teacher_disagreement_score":0.0021039667,"about_ca_system_score_codex":0.0006876388,"about_ca_system_score_gemma":0.000985802,"threshold_uncertainty_score":0.0070384145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021977691626485916,"score_gpt":0.21168669329966935,"score_spread":0.18970900167318344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152362440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017884301,0.0011799227,0.9733854,0.00015749385,0.0001349122,0.000058883827,0.000044788463,0.002082697,0.0050716256],"genre_scores_gemma":[0.3844106,0.00085791823,0.60631734,0.0002715307,0.00008011284,0.0001028318,0.00017358719,0.00019913394,0.007586935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997167,0.00006346905,0.000012585744,0.000048440696,0.00013515062,0.000023594106],"domain_scores_gemma":[0.9996731,0.00009878474,0.000059026057,0.00007398896,0.000082511375,0.000012608922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030846536,0.00042548348,0.00019279137,0.00043714684,0.00037660627,0.00042797072,0.0005423408,0.00038965195,0.0027524605],"category_scores_gemma":[0.0011818188,0.00022810158,0.00026379206,0.00043339407,0.00025244534,0.00053717935,0.00025699762,0.000506291,0.00062619866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019524146,0.0000634268,0.0008757153,0.0002074958,0.00005773755,0.00024222005,0.00012847659,0.3005138,0.07099521,0.036581255,0.0056474875,0.5844919],"study_design_scores_gemma":[0.000070443624,0.0004954762,0.0009881112,0.000053155894,0.00005553519,0.00034957984,0.00004259538,0.89042825,0.051386923,0.021867158,0.03422193,0.000040761326],"about_ca_topic_score_codex":0.0033025322,"about_ca_topic_score_gemma":0.0073252744,"teacher_disagreement_score":0.0033025322,"about_ca_system_score_codex":0.0009369887,"about_ca_system_score_gemma":0.0007033931,"threshold_uncertainty_score":0.009207845},"labels":[],"label_agreement":null},{"id":"W2153007772","doi":"10.1109/isqed.2011.5770732","title":"Enhancement of incremental design for FPGAs using circuit similarity","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Netlist; Similarity (geometry); Computer science; Circuit extraction; Matching (statistics); Design flow; Algorithm; Physical design; Field-programmable gate array; Process (computing); Plug-in; Feature (linguistics); Logic synthesis; Electronic circuit; Computer engineering; Theoretical computer science; Circuit design; Logic gate; Artificial intelligence; Computer hardware; Equivalent circuit; Embedded system; Mathematics; Engineering; Programming language; Image (mathematics)","score_opus":0.1564762563193712,"score_gpt":0.26235752824947883,"score_spread":0.10588127193010763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153007772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026719885,0.00016699753,0.96851736,0.000036914145,0.000024363604,0.00008364043,0.000020105084,0.0017590981,0.0026716138],"genre_scores_gemma":[0.28757307,0.0001312185,0.7099971,0.00005579754,0.000023386257,0.0000840727,0.00013446393,0.00016293536,0.0018379443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955183,0.000083540835,0.00003038522,0.000058216654,0.00024018895,0.000035798854],"domain_scores_gemma":[0.9993849,0.00022796956,0.00008171401,0.0001303835,0.00015478123,0.00002022658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040842782,0.0006133927,0.00036051494,0.0011493558,0.00030103364,0.00045813664,0.00094906206,0.00027092593,0.0023846999],"category_scores_gemma":[0.0013657302,0.00026887504,0.0005666853,0.00053139287,0.00033451992,0.00075177185,0.00066428113,0.0003351999,0.00044798452],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017204897,0.00006981376,0.0016866188,0.00025655254,0.000052630192,0.000264483,0.00018692685,0.089882426,0.09918816,0.02242798,0.0019416483,0.78387064],"study_design_scores_gemma":[0.000093162984,0.0008925374,0.0017432806,0.000038842925,0.00011255749,0.00104882,0.000085066466,0.8063939,0.1410644,0.018282464,0.03019449,0.000050440412],"about_ca_topic_score_codex":0.0008455677,"about_ca_topic_score_gemma":0.0016131788,"teacher_disagreement_score":0.0023846999,"about_ca_system_score_codex":0.00048106036,"about_ca_system_score_gemma":0.0005458247,"threshold_uncertainty_score":0.007977605},"labels":[],"label_agreement":null},{"id":"W2153245554","doi":"10.1109/tcad.2005.852040","title":"Calligrapher: a new layout-migration engine for hard intellectual property libraries","year":2005,"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":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Standard cell; Metric (unit); Solver; Process (computing); Constraint (computer-aided design); Page layout; Computer engineering; Parallel computing; Integrated circuit; Programming language; Mathematics; Operating system; Engineering","score_opus":0.039085538524315996,"score_gpt":0.21243984616758857,"score_spread":0.1733543076432726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153245554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01803508,0.00027076754,0.9457313,0.00014956084,0.00006206114,0.00016384946,0.00022670126,0.029231172,0.006129583],"genre_scores_gemma":[0.11425687,0.00025282762,0.87547064,0.00017763996,0.000020395511,0.00021801861,0.00075030676,0.0014001089,0.007453257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966645,0.000045461067,0.000021199607,0.000053583444,0.00017387283,0.000039486637],"domain_scores_gemma":[0.9997613,0.000064593514,0.00003911284,0.00006876114,0.00004539861,0.00002086838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032496426,0.000811049,0.00042760797,0.0006494924,0.00036664095,0.00084036874,0.0017023302,0.00065932993,0.004057616],"category_scores_gemma":[0.00088721217,0.0003343162,0.0004976122,0.0006384553,0.00044873374,0.0012121779,0.0009009878,0.0011498935,0.0011665768],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034844552,0.00021066653,0.0014516513,0.0004262844,0.00007678839,0.00029825306,0.00021396058,0.20718312,0.10630927,0.03398917,0.027013661,0.62247866],"study_design_scores_gemma":[0.00008019791,0.00013124934,0.00053101167,0.000026430582,0.000029401208,0.00019576174,0.00003651475,0.87296295,0.07138452,0.0074695214,0.047110118,0.000042383388],"about_ca_topic_score_codex":0.002472182,"about_ca_topic_score_gemma":0.005487624,"teacher_disagreement_score":0.004057616,"about_ca_system_score_codex":0.0006486653,"about_ca_system_score_gemma":0.0012026076,"threshold_uncertainty_score":0.013574064},"labels":[],"label_agreement":null},{"id":"W2153585893","doi":"10.1145/611817.611838","title":"Using logic duplication to improve performance in FPGAs","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Path (computing); Computer science; Critical path method; Programmable logic device; Logic synthesis; Logic optimization; Logic gate; Parallel computing; Gene duplication; Data deduplication; Algorithm; Embedded system; Engineering; Programming language","score_opus":0.025479367273861124,"score_gpt":0.2480734802009621,"score_spread":0.22259411292710096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153585893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49963215,0.0021818443,0.4832374,0.00046472356,0.0002085524,0.00007859027,0.000055916553,0.0032497142,0.010891082],"genre_scores_gemma":[0.78376144,0.0007933265,0.21016806,0.00023411446,0.00015659993,0.000041018695,0.00010342591,0.00019785666,0.004544265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941456,0.000102428145,0.000049242815,0.000086143154,0.00023775794,0.0001099165],"domain_scores_gemma":[0.9988356,0.0005059265,0.00018777131,0.00023907724,0.00019202262,0.000039565086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044129204,0.0006886429,0.0004252594,0.0007227833,0.00042940775,0.0007305235,0.0012659247,0.0004302738,0.0021369145],"category_scores_gemma":[0.0021699157,0.00032677673,0.00027703316,0.0007736834,0.00038910503,0.0015511046,0.0005840008,0.0004584678,0.0006618681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008791389,0.00016519695,0.0036532094,0.0003225365,0.00009812101,0.0011008189,0.00023081298,0.1418769,0.3319683,0.019659301,0.003021932,0.4970237],"study_design_scores_gemma":[0.00014484169,0.002044674,0.0029671201,0.000064624866,0.00015691157,0.0026225469,0.000090372225,0.28023678,0.6729153,0.010262253,0.028418658,0.00007590548],"about_ca_topic_score_codex":0.00045610173,"about_ca_topic_score_gemma":0.00072677457,"teacher_disagreement_score":0.0021369145,"about_ca_system_score_codex":0.000711957,"about_ca_system_score_gemma":0.0004972324,"threshold_uncertainty_score":0.007148683},"labels":[],"label_agreement":null},{"id":"W2154356865","doi":"10.1109/cicc.2003.1249360","title":"Architecture of datapath-oriented coarse-grain logic and routing for FPGAs","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datapath; Field-programmable gate array; Routing (electronic design automation); Computer architecture; Computer science; Architecture; Logic synthesis; Set (abstract data type); Parallel computing; Reconfigurability; Embedded system; Logic gate; Algorithm; Programming language; Geography","score_opus":0.01192976122594891,"score_gpt":0.22541987254509474,"score_spread":0.21349011131914583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154356865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1499549,0.00073057786,0.8390317,0.00017570065,0.00009292947,0.00011649066,0.00013422538,0.002193918,0.0075695873],"genre_scores_gemma":[0.54761404,0.00040917093,0.44692662,0.00016445435,0.00002270917,0.00006389385,0.00031926917,0.000063955056,0.0044158064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99993765,0.000007540164,0.0000050239623,0.000016428556,0.000021169331,0.000012141717],"domain_scores_gemma":[0.99991095,0.00001375661,0.000013517113,0.000026130367,0.000028520184,0.000007238412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102383005,0.00020799751,0.00013721417,0.0003209769,0.00021879419,0.0004137308,0.00065721065,0.00017521133,0.0015791226],"category_scores_gemma":[0.0001536992,0.00014161282,0.00015927234,0.00035118355,0.00020351932,0.00046677285,0.00015967485,0.0002008308,0.0003008483],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004980997,0.00014572094,0.0034763021,0.00044618,0.000085294334,0.00043491836,0.00015322292,0.115969464,0.3154582,0.04449941,0.0059269303,0.51290625],"study_design_scores_gemma":[0.0002618272,0.0010863184,0.004976035,0.00006233809,0.00017620291,0.0011286043,0.00009114335,0.6428449,0.24850662,0.022010246,0.07876219,0.00009363367],"about_ca_topic_score_codex":0.0019089145,"about_ca_topic_score_gemma":0.0046441513,"teacher_disagreement_score":0.0019089145,"about_ca_system_score_codex":0.00051487243,"about_ca_system_score_gemma":0.0005115994,"threshold_uncertainty_score":0.0052827597},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06117116452925328,"score_gpt":0.21318732548179994,"score_spread":0.15201616095254666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155316178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014409944,0.00016197079,0.9815486,0.00008232175,0.000013495371,0.000056576104,0.00027154505,0.0011343468,0.0023211124],"genre_scores_gemma":[0.1379509,0.00044430757,0.85291696,0.00015641886,0.000015146958,0.0002309218,0.0013704994,0.00057868287,0.006336149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964035,0.000089225476,0.00004841538,0.000043699372,0.00013644565,0.000041949595],"domain_scores_gemma":[0.99960226,0.00015772057,0.000053369695,0.00012429978,0.000052468615,0.000009983287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061066245,0.00053755706,0.00030761285,0.0005642927,0.00032048093,0.000990732,0.0009781235,0.00049648556,0.0039191195],"category_scores_gemma":[0.0011245962,0.0003595875,0.00069653627,0.00055858586,0.0006737749,0.0017480272,0.0006068263,0.0007446972,0.0007734461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002295093,0.00007487914,0.0016474467,0.0007695763,0.000034999957,0.0007481887,0.0008386063,0.24055369,0.04894793,0.47506937,0.009011275,0.22207452],"study_design_scores_gemma":[0.000057826797,0.0001337875,0.0003842048,0.00009132567,0.00004098192,0.00060209,0.00014472763,0.7944221,0.040451612,0.08593658,0.07769362,0.00004119827],"about_ca_topic_score_codex":0.0015265761,"about_ca_topic_score_gemma":0.0034559662,"teacher_disagreement_score":0.0039191195,"about_ca_system_score_codex":0.00058696984,"about_ca_system_score_gemma":0.00063108344,"threshold_uncertainty_score":0.013110757},"labels":[],"label_agreement":null},{"id":"W2155560344","doi":"10.1109/mnrc.2008.4683373","title":"A spatial computing architecture for implementing computational circuits","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer architecture; Scalability; Debugging; Field-programmable gate array; Electronic circuit; Computer engineering; Design flow; Encoding (memory); Benchmark (surveying); Architecture; Parallel computing; Embedded system; Artificial intelligence; Engineering; Programming language","score_opus":0.022263233234602265,"score_gpt":0.24349149889025562,"score_spread":0.22122826565565334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155560344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01427391,0.0007297432,0.94773287,0.00046331107,0.00013945535,0.00010367179,0.00015216126,0.00526221,0.031142663],"genre_scores_gemma":[0.1971296,0.0008140206,0.7862977,0.000428068,0.00007380638,0.00023594897,0.0003268201,0.00018457255,0.014509388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975353,0.000046919024,0.000022135222,0.000040467137,0.000101785416,0.000035100264],"domain_scores_gemma":[0.9996444,0.00007971956,0.000020662215,0.000116786454,0.00012157393,0.000016942191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000258206,0.00044199426,0.00021250203,0.0006452549,0.00070523785,0.0011704648,0.0013326374,0.00053087575,0.008322419],"category_scores_gemma":[0.00074495975,0.00025198123,0.00041002355,0.000961228,0.0006963342,0.001288893,0.0005327518,0.0006674404,0.0021114924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023899347,0.000099034674,0.0013524467,0.00037652274,0.000053347252,0.00027390156,0.00021782944,0.079877615,0.059082348,0.49631596,0.018647704,0.34346437],"study_design_scores_gemma":[0.00012245466,0.00049579126,0.00080606545,0.000121021556,0.00012797255,0.0006587149,0.00011927454,0.5220763,0.10143852,0.11752475,0.25643855,0.00007063179],"about_ca_topic_score_codex":0.003663009,"about_ca_topic_score_gemma":0.00516994,"teacher_disagreement_score":0.008322419,"about_ca_system_score_codex":0.0008106484,"about_ca_system_score_gemma":0.0011969716,"threshold_uncertainty_score":0.02784127},"labels":[],"label_agreement":null},{"id":"W2156091563","doi":"10.1109/fpl.2008.4630008","title":"MacroMap: A technology mapping algorithm for heterogeneous FPGAs with effective area estimation","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Arctic Goose Joint Venture; National Natural Science Foundation of China","keywords":"Field-programmable gate array; Computer science; Lookup table; Macro; Algorithm; Heterogeneous network; Computer engineering; Parallel computing; Computer hardware; Telecommunications; Wireless; Wireless network","score_opus":0.00853833330748312,"score_gpt":0.19763630868556784,"score_spread":0.1890979753780847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156091563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008898364,0.00019367134,0.98763067,0.00003452556,0.000026064346,0.000040024082,0.000053012678,0.0018010015,0.0013227544],"genre_scores_gemma":[0.11247893,0.0001312169,0.8842146,0.000043332355,0.00001962678,0.00010806051,0.00023872424,0.00016016155,0.0026053162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.000029040555,0.000012868418,0.000044975503,0.000060570408,0.000018228417],"domain_scores_gemma":[0.9997812,0.00007255694,0.0000322706,0.000046096076,0.000054793614,0.000013041884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025987407,0.0007002058,0.00041710457,0.0010123025,0.00040656724,0.00063078065,0.00085271656,0.0003715099,0.0035564678],"category_scores_gemma":[0.0008695314,0.0002998784,0.00039674138,0.000760991,0.00019363145,0.0012352908,0.0006444661,0.00037887946,0.0008765169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018618102,0.000040717692,0.0010777828,0.00011107425,0.00005377996,0.00013712622,0.000065386295,0.09507501,0.024847774,0.007389779,0.004299981,0.8667154],"study_design_scores_gemma":[0.000046914793,0.000121770245,0.0007942061,0.000014200404,0.000030297459,0.0002781727,0.000052042782,0.9467006,0.032695316,0.005725733,0.013520896,0.00001983041],"about_ca_topic_score_codex":0.0016728226,"about_ca_topic_score_gemma":0.0027621698,"teacher_disagreement_score":0.0035564678,"about_ca_system_score_codex":0.0004043504,"about_ca_system_score_gemma":0.0005470547,"threshold_uncertainty_score":0.011897564},"labels":[],"label_agreement":null},{"id":"W2156657748","doi":"10.1109/ccece.1999.807236","title":"Design and characterization of an embedded ASIC DRAM","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Dram; Microelectronics; Embedded system; Application-specific integrated circuit; Universal memory; Computer science; Macro; Chip; CAS latency; Process variation; Process (computing); Engineering; Computer hardware; Operating system; Semiconductor memory; Electrical engineering; Computer memory; Programming language; Memory controller; Telecommunications; Memory refresh","score_opus":0.011139310511142836,"score_gpt":0.20579650255794707,"score_spread":0.19465719204680423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156657748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94953626,0.00050659745,0.038354293,0.00013848569,0.00007092711,0.00022121718,0.00066057994,0.0009653151,0.009546262],"genre_scores_gemma":[0.9740986,0.00014536422,0.02053219,0.000055622946,0.000010924631,0.000086947846,0.00023498519,0.000040931423,0.0047944654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976975,0.000028884284,0.000010937558,0.000049536993,0.00010334651,0.00003748342],"domain_scores_gemma":[0.9996644,0.00004619948,0.000053230833,0.000063057414,0.00014519473,0.000027939106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012800966,0.00020540762,0.00024556537,0.0002482739,0.00023337582,0.00053891196,0.0007615718,0.00032440433,0.0017340289],"category_scores_gemma":[0.00042059727,0.00012572594,0.00010622356,0.00027929666,0.00027249084,0.00029275005,0.0001405183,0.00018050223,0.00034021455],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029073414,0.00012640175,0.0029412939,0.0002498331,0.000040619707,0.000398491,0.0001698158,0.013942602,0.9518749,0.0017169517,0.001422443,0.026825892],"study_design_scores_gemma":[0.000065437496,0.002086831,0.006083035,0.000013454429,0.00005907936,0.00049662706,0.00012516431,0.041861832,0.9351294,0.00016761491,0.013887034,0.000024458806],"about_ca_topic_score_codex":0.0012838305,"about_ca_topic_score_gemma":0.00116164,"teacher_disagreement_score":0.0017340289,"about_ca_system_score_codex":0.0005935294,"about_ca_system_score_gemma":0.00045671692,"threshold_uncertainty_score":0.0058008432},"labels":[],"label_agreement":null},{"id":"W2156813734","doi":"10.1109/mwscas.2007.4488680","title":"Efficient volterra series based sensitivity analysis of mildly nonlinear circuits","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volterra series; Hessian matrix; Sensitivity (control systems); Jacobian matrix and determinant; Speedup; Nonlinear system; Computer science; Electronic circuit; Series (stratigraphy); Frequency domain; Algorithm; Mathematics; Applied mathematics; Electronic engineering; Parallel computing; Engineering; Physics","score_opus":0.016879216511048886,"score_gpt":0.23073481855126204,"score_spread":0.21385560204021314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156813734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021839615,0.00012374607,0.97441715,0.00006743374,0.000014092092,0.0000437708,0.000042976382,0.00028946836,0.0031617465],"genre_scores_gemma":[0.79611427,0.00034161395,0.19943006,0.00007735248,0.000043605858,0.00016134362,0.00011830004,0.00012799508,0.003585559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948835,0.00014812216,0.000023413366,0.000051358646,0.00025545785,0.000033207736],"domain_scores_gemma":[0.99909234,0.00065588264,0.00005579143,0.00007269756,0.00011295315,0.000010398762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974363,0.0010692476,0.00064359326,0.00092548283,0.00025129147,0.0005953276,0.0004389399,0.00050062424,0.0026050913],"category_scores_gemma":[0.0023657277,0.00030942087,0.0007689814,0.00036970573,0.00050865614,0.0007303624,0.0004750741,0.0006871324,0.00032343526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000649396,0.00003477568,0.0003853515,0.00013332635,0.000043603086,0.0001027215,0.000061024075,0.86205536,0.0577587,0.0219378,0.0004294582,0.056993037],"study_design_scores_gemma":[0.0000022408055,0.000016293949,0.00012251173,0.0000038569424,0.0000048271363,0.000020248906,0.0000036191454,0.98846614,0.005964286,0.0050318725,0.00035854036,0.0000056263834],"about_ca_topic_score_codex":0.0011938426,"about_ca_topic_score_gemma":0.0011004804,"teacher_disagreement_score":0.0026050913,"about_ca_system_score_codex":0.0006183856,"about_ca_system_score_gemma":0.0003633531,"threshold_uncertainty_score":0.008714855},"labels":[],"label_agreement":null},{"id":"W2156912292","doi":"10.1109/asic.1995.580750","title":"High-level analog synthesis using signal flow graph transformations","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signal-flow graph; Realizability; Computer science; Transfer function; Graph; High-level synthesis; Analog signal; SIGNAL (programming language); Control flow graph; Theoretical computer science; Algorithm; Topology (electrical circuits); Mathematics; Computer hardware; Programming language; Digital signal processing; Electrical engineering; Engineering","score_opus":0.03921932070267154,"score_gpt":0.2018993032004975,"score_spread":0.16267998249782598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156912292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003418868,0.000058668364,0.99027586,0.000040412182,0.000026208281,0.0000780247,0.000053507127,0.0016944326,0.004354071],"genre_scores_gemma":[0.19282313,0.0003331452,0.8014644,0.00011775515,0.000043520697,0.00023074167,0.00039294452,0.0002442833,0.0043501076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967897,0.00006065093,0.000021664771,0.000048892576,0.00015128782,0.000038492894],"domain_scores_gemma":[0.9998078,0.000081167585,0.000016618957,0.000041574847,0.000046721572,0.000006199282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022960542,0.0007130393,0.0003067144,0.00052187324,0.00033491338,0.00081066886,0.00046229016,0.00039839532,0.0044498155],"category_scores_gemma":[0.0005982102,0.00026229734,0.0006542307,0.0003845959,0.00045358634,0.00048001896,0.00036583946,0.0007743834,0.0014392711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014444452,0.00012701219,0.0002444778,0.00048994063,0.0000653177,0.00039989356,0.00017915979,0.16029836,0.28479418,0.1462604,0.004426372,0.40257043],"study_design_scores_gemma":[0.00013647908,0.00056315,0.0004440813,0.000114725735,0.000087896195,0.00056495034,0.000051475654,0.59352976,0.23452541,0.110998064,0.058925796,0.00005813053],"about_ca_topic_score_codex":0.0010171337,"about_ca_topic_score_gemma":0.0010779251,"teacher_disagreement_score":0.0044498155,"about_ca_system_score_codex":0.00036313178,"about_ca_system_score_gemma":0.0006449198,"threshold_uncertainty_score":0.014886141},"labels":[],"label_agreement":null},{"id":"W2156995134","doi":"10.5555/1870926.1871047","title":"A power optimization method for CMOS op-amps using sub-space based geometric programming","year":2010,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Geometric programming; Monomial; CMOS; Convex optimization; Mathematical optimization; Transistor; Space (punctuation); Regular polygon; Computer science; Constraint (computer-aided design); Power (physics); Voltage; Electronic engineering; Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Discrete mathematics","score_opus":0.015562163227364962,"score_gpt":0.25389846106551606,"score_spread":0.2383362978381511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156995134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013971237,0.000031576423,0.9976465,0.000028755401,0.0000066509656,0.0000092715945,0.000009741024,0.00006392363,0.0008064037],"genre_scores_gemma":[0.18402208,0.0003356319,0.80994904,0.000083694664,0.00003716706,0.00022912108,0.000104968014,0.00025042577,0.004987912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998561,0.000040868257,0.000006759691,0.000019852665,0.00006286012,0.000013539789],"domain_scores_gemma":[0.99985754,0.00007228276,0.000014282433,0.000014726701,0.00003504715,0.000006038549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035256497,0.0007546512,0.0006393654,0.00040544564,0.0002915985,0.00048945384,0.0008647058,0.00042296184,0.002569279],"category_scores_gemma":[0.00056656974,0.00039790437,0.00083450484,0.0006555101,0.00042657208,0.0007141716,0.0005364525,0.00087487354,0.00057113956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010828981,0.000008908314,0.00008594722,0.00003609481,0.000011372087,0.000025166828,0.000028324039,0.92821825,0.0031279358,0.02171562,0.0005881369,0.046143435],"study_design_scores_gemma":[0.000001899632,0.000010660062,0.000014350728,0.0000017251932,0.000002335892,0.0000110053315,0.0000030175806,0.9953595,0.00045341742,0.0032769076,0.0008631229,0.0000020359482],"about_ca_topic_score_codex":0.0016541422,"about_ca_topic_score_gemma":0.0023628406,"teacher_disagreement_score":0.002569279,"about_ca_system_score_codex":0.00056720054,"about_ca_system_score_gemma":0.0007355574,"threshold_uncertainty_score":0.008595109},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016905989154600756,"score_gpt":0.22069264977099234,"score_spread":0.20378666061639159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157958003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25696805,0.0020263682,0.6832888,0.0004611493,0.00020467826,0.00018153561,0.00032528967,0.002873423,0.053670716],"genre_scores_gemma":[0.7233603,0.0005806625,0.26673305,0.00016811138,0.000043658387,0.00007498907,0.00035014556,0.00007990169,0.008609158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998529,0.000035534624,0.000009991268,0.000018494922,0.000056825174,0.000026141635],"domain_scores_gemma":[0.999851,0.000037238013,0.000024757745,0.0000336148,0.000043775326,0.000009615705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020099516,0.00019502205,0.000103681254,0.000295156,0.00023147135,0.00045263005,0.00038182607,0.0002032145,0.0036978105],"category_scores_gemma":[0.00043523023,0.00008648002,0.00020551635,0.00027756084,0.00020775748,0.0006159475,0.00018809526,0.00020947684,0.00047982976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020253638,0.00006893233,0.0011969646,0.0003295296,0.00004806116,0.00019686628,0.00009862008,0.39196953,0.08551199,0.15505865,0.0075470465,0.35777134],"study_design_scores_gemma":[0.00011882182,0.0008047462,0.0023699375,0.0000822176,0.00007636143,0.00046936085,0.00010782129,0.81731594,0.046417654,0.06505862,0.067125686,0.00005286043],"about_ca_topic_score_codex":0.0018734131,"about_ca_topic_score_gemma":0.003986111,"teacher_disagreement_score":0.0036978105,"about_ca_system_score_codex":0.0006211814,"about_ca_system_score_gemma":0.0004077577,"threshold_uncertainty_score":0.012370408},"labels":[],"label_agreement":null},{"id":"W2158515581","doi":"10.5755/j01.eee.19.10.2464","title":"Sizing Analog Integrated Circuits by Current-Branches-Bias Assignments with Heuristics","year":2013,"lang":"en","type":"article","venue":"Elektronika ir Elektrotechnika","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"","keywords":"Sizing; Heuristics; Biasing; Cascode; Transconductance; Electronic engineering; Computer science; Electronic circuit; Operational amplifier; Current mirror; Mathematical optimization; Amplifier; Engineering; Electrical engineering; Voltage; Mathematics; Transistor; CMOS","score_opus":0.011770308963011131,"score_gpt":0.19996341638769213,"score_spread":0.188193107424681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158515581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11393843,0.00036538177,0.8751419,0.00013218493,0.000025200956,0.00017935691,0.00008414888,0.00059343467,0.0095399385],"genre_scores_gemma":[0.5057091,0.00022413518,0.4912963,0.00009531474,0.000016427473,0.00018604501,0.00016447312,0.00013268905,0.0021755036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.00006948234,0.000010473262,0.00004021694,0.00004829725,0.000036318463],"domain_scores_gemma":[0.9995877,0.00028698824,0.00003762313,0.000029569004,0.000045945148,0.000012078082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003268269,0.00082297745,0.0004214634,0.00096146204,0.00027865113,0.000643451,0.00054885575,0.0003773716,0.002465023],"category_scores_gemma":[0.0010838247,0.0003553363,0.00055071106,0.0006359381,0.00036215203,0.00058873335,0.00042902541,0.0004369721,0.00029184463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007120643,0.00009490184,0.0011803794,0.000108100736,0.00003624863,0.000070037924,0.00009597437,0.8388201,0.012007323,0.010087953,0.00096017175,0.13646758],"study_design_scores_gemma":[0.000028548091,0.00006781797,0.00028114382,0.00001436903,0.000026463067,0.000030584488,0.000042473173,0.98680335,0.003614185,0.007799566,0.001285001,0.000006477303],"about_ca_topic_score_codex":0.0028102612,"about_ca_topic_score_gemma":0.0043924907,"teacher_disagreement_score":0.0028102612,"about_ca_system_score_codex":0.00063399615,"about_ca_system_score_gemma":0.001008712,"threshold_uncertainty_score":0.008246303},"labels":[],"label_agreement":null},{"id":"W2159649114","doi":"10.5555/602902.602925","title":"General models for optimum arbitrary-dimension FPGA switch box designs","year":2000,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Topology (electrical circuits); Network topology; Dimension (graph theory); Mathematics; Embedded system; Computer network; Combinatorics","score_opus":0.028076585010745888,"score_gpt":0.23506388613176424,"score_spread":0.20698730112101835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159649114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13291761,0.00066561374,0.825954,0.0007633388,0.000053809847,0.00014761028,0.000689704,0.00019213014,0.038616218],"genre_scores_gemma":[0.87404096,0.000781745,0.10128718,0.00017197487,0.00005929835,0.0003247378,0.00054037763,0.00009267427,0.022701107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954885,0.0001419219,0.000016278978,0.00010969982,0.000081841754,0.00010125779],"domain_scores_gemma":[0.99934334,0.00035022764,0.0001197911,0.000067640794,0.0000590759,0.00005979456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469952,0.0008981649,0.00080760865,0.00055000314,0.00042130615,0.0013609689,0.0009508346,0.0013218902,0.011227714],"category_scores_gemma":[0.0018794513,0.0007899284,0.00096847734,0.00072404736,0.0010534097,0.0019192804,0.0010240371,0.0014444297,0.0006362976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007014263,0.00003203912,0.00029820926,0.00006274983,0.000019615252,0.000104977924,0.00005214308,0.82577014,0.0009939863,0.16822983,0.0011882433,0.0031780167],"study_design_scores_gemma":[0.000031223677,0.00002830358,0.00015708676,0.000013353735,0.000011584635,0.00005137634,0.000032765347,0.9154651,0.000383714,0.08163381,0.0021839058,0.000007689349],"about_ca_topic_score_codex":0.0020623656,"about_ca_topic_score_gemma":0.0027603789,"teacher_disagreement_score":0.011227714,"about_ca_system_score_codex":0.0017152636,"about_ca_system_score_gemma":0.0006458662,"threshold_uncertainty_score":0.037560463},"labels":[],"label_agreement":null},{"id":"W2159928318","doi":"10.1109/glsv.1995.516055","title":"Parallel hierarchical global routing for general cell layout","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Speedup; Computer science; Routing (electronic design automation); Parallel computing; Decomposition; Simple (philosophy); Integer programming; Algorithm; Computer network","score_opus":0.018963534811120376,"score_gpt":0.22365778026597358,"score_spread":0.2046942454548532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159928318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010460713,0.00016994907,0.9839061,0.000055117056,0.000022550079,0.00004508268,0.000075236785,0.0018125565,0.0034527478],"genre_scores_gemma":[0.13440405,0.00024878915,0.8586412,0.00007560835,0.000019566094,0.0001163765,0.0005289422,0.00037007412,0.00559528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978906,0.000033961318,0.000008804776,0.00005101525,0.00008538356,0.000031835083],"domain_scores_gemma":[0.99982303,0.000051717103,0.000015623058,0.00006564825,0.00003589969,0.000008101225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026868822,0.0007008647,0.0005254083,0.0005125715,0.00044162263,0.0004991324,0.0007619224,0.00038097563,0.0058444696],"category_scores_gemma":[0.0004065097,0.00026439712,0.0005171509,0.00058100664,0.0004363552,0.0008929856,0.0006234323,0.0005175622,0.0011650027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009984975,0.00005270767,0.0005419542,0.00022484007,0.000048624195,0.0001279659,0.00009292918,0.49139506,0.043366365,0.030561717,0.009224991,0.42426294],"study_design_scores_gemma":[0.000056211014,0.000098061704,0.00045663488,0.000012964586,0.000033070915,0.00014995594,0.000038033115,0.93563837,0.015827052,0.028456157,0.019212987,0.000020492489],"about_ca_topic_score_codex":0.0030073698,"about_ca_topic_score_gemma":0.009147044,"teacher_disagreement_score":0.0058444696,"about_ca_system_score_codex":0.0006501814,"about_ca_system_score_gemma":0.0008403282,"threshold_uncertainty_score":0.019551694},"labels":[],"label_agreement":null},{"id":"W2160595395","doi":"10.1109/mwscas.1990.140679","title":"Applying simulated evolution to scheduling in high level synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Scheduling (production processes); Computer science; Probabilistic logic; Mathematical optimization; Greedy algorithm; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.03396459389540897,"score_gpt":0.2157652595090148,"score_spread":0.1818006656136058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160595395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025638882,0.000196012,0.96912956,0.00015185511,0.000048756916,0.000056726956,0.000017729524,0.0005906098,0.004169929],"genre_scores_gemma":[0.52424705,0.00049376715,0.47131908,0.00010964229,0.000031074764,0.00017466267,0.000066292196,0.00014114553,0.0034172337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.00021400265,0.000016079031,0.00003075568,0.00013978987,0.00002465187],"domain_scores_gemma":[0.9994124,0.0004028784,0.000039213162,0.00006421064,0.00006206486,0.00001923758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075060077,0.00031874015,0.0003306665,0.00039009535,0.00027325572,0.00055343634,0.00049335335,0.00057967304,0.0012160583],"category_scores_gemma":[0.0023305437,0.00029266687,0.0003800653,0.00041339057,0.00087322417,0.0004368594,0.00057058403,0.000578739,0.0002255649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024916328,0.000012681323,0.00027553085,0.00002562978,0.000023128952,0.00003579868,0.000039925686,0.9597381,0.0027974471,0.0109751625,0.00021782321,0.025833892],"study_design_scores_gemma":[0.000012291334,0.000021242364,0.000048096324,0.0000046062232,0.000005372888,0.000010780764,0.0000047635117,0.9909044,0.0017161078,0.0056423065,0.001627115,0.000002925454],"about_ca_topic_score_codex":0.0031333086,"about_ca_topic_score_gemma":0.0025647264,"teacher_disagreement_score":0.0031333086,"about_ca_system_score_codex":0.0007535693,"about_ca_system_score_gemma":0.00072722416,"threshold_uncertainty_score":0.006230116},"labels":[],"label_agreement":null},{"id":"W2161653569","doi":"10.1109/ccece.1997.614777","title":"A clustering algorithm for circuit partitioning","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Netlist; Computer science; Cluster analysis; Simulated annealing; Tabu search; Algorithm; Benchmark (surveying); Algorithm design; Parallel computing; Artificial intelligence","score_opus":0.03459231613347618,"score_gpt":0.2129012160972475,"score_spread":0.1783088999637713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161653569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010740968,0.0005718787,0.99241346,0.00008457225,0.000086602675,0.00013815859,0.0001740436,0.001271096,0.004186147],"genre_scores_gemma":[0.017311864,0.0005135116,0.9756172,0.00008940061,0.00006267,0.00026636108,0.0007664687,0.00028786217,0.005084773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890554,0.00017408347,0.00005865187,0.00025034283,0.0005378999,0.00007349096],"domain_scores_gemma":[0.99945754,0.00014553881,0.000035608417,0.000116717085,0.00022472741,0.000019851244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054288254,0.0013653836,0.0010205106,0.0025471905,0.001298499,0.0012249816,0.0017128723,0.0011944335,0.007596891],"category_scores_gemma":[0.0016686671,0.00058516866,0.0011643387,0.00326396,0.0005859305,0.0013537704,0.0010710811,0.0012775711,0.0053459504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007265998,0.00005273362,0.0003374334,0.0003633183,0.00012713257,0.00009997258,0.00012568392,0.14657089,0.013759202,0.03933121,0.02943612,0.7697236],"study_design_scores_gemma":[0.00007934916,0.000117202384,0.00090241904,0.00010240654,0.00005983081,0.00083500246,0.000078686026,0.751997,0.01562394,0.053059153,0.17704238,0.00010259755],"about_ca_topic_score_codex":0.0045402697,"about_ca_topic_score_gemma":0.0059091775,"teacher_disagreement_score":0.007596891,"about_ca_system_score_codex":0.0010937091,"about_ca_system_score_gemma":0.0012028574,"threshold_uncertainty_score":0.02541411},"labels":[],"label_agreement":null},{"id":"W2161942462","doi":"10.1109/tcad.2008.915545","title":"Scalable Synthesis and Clustering Techniques Using Decision Diagrams","year":2008,"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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Binary decision diagram; Computer science; Scalability; Field-programmable gate array; Cluster analysis; Leverage (statistics); Logic synthesis; Electronic design automation; Parallel computing; Reduction (mathematics); Data-flow analysis; Design flow; Theoretical computer science; Algorithm; Data flow diagram; Logic gate; Mathematics; Computer hardware; Embedded system","score_opus":0.03977928161711857,"score_gpt":0.22769522824453112,"score_spread":0.18791594662741254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161942462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004369265,0.00020235352,0.99288803,0.00004967112,0.000017463246,0.000054943706,0.000049757884,0.00079189066,0.0015767073],"genre_scores_gemma":[0.08975969,0.0003662856,0.9077392,0.00004708008,0.00001956451,0.00012679925,0.00027723648,0.00013870596,0.0015253162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914443,0.00016008802,0.000065028136,0.0001901756,0.00037707598,0.00006310045],"domain_scores_gemma":[0.99926156,0.00039179006,0.000061968494,0.00014123353,0.00012433933,0.000019137373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007245361,0.0009333698,0.0006815435,0.0014393239,0.00049927155,0.00089652237,0.0008956276,0.00051657454,0.004817814],"category_scores_gemma":[0.0015804281,0.0005865853,0.00093430316,0.0010160839,0.0005294835,0.0010993959,0.0008276666,0.0008292162,0.00086941506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011342763,0.00006206684,0.000435151,0.00043023127,0.00008193746,0.00014194485,0.0001265852,0.42470735,0.04639115,0.06865758,0.0028758643,0.4559768],"study_design_scores_gemma":[0.00008424383,0.00007839078,0.0001679577,0.000042736858,0.000045925877,0.000115344854,0.00003606297,0.91574913,0.030777767,0.03886365,0.014018224,0.000020656755],"about_ca_topic_score_codex":0.002174186,"about_ca_topic_score_gemma":0.0034874852,"teacher_disagreement_score":0.004817814,"about_ca_system_score_codex":0.00092901126,"about_ca_system_score_gemma":0.0011829039,"threshold_uncertainty_score":0.016117215},"labels":[],"label_agreement":null},{"id":"W2162180547","doi":"10.1109/iscas.2005.1466066","title":"Fast Integer Linear Programming Based Models for VLSI Global Routing","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Router; Integer programming; Computer science; Routing (electronic design automation); Very-large-scale integration; Mathematical optimization; Pruning; Tree (set theory); Minification; Linear programming; Global optimization; Parallel computing; Algorithm; Mathematics; Computer network; Embedded system","score_opus":0.018846671850123925,"score_gpt":0.25098185101314974,"score_spread":0.2321351791630258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162180547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002124443,0.0004314314,0.99027973,0.00021875602,0.00003227301,0.000039027294,0.000114287206,0.00020195961,0.0065581445],"genre_scores_gemma":[0.2823774,0.003211831,0.6873963,0.00032844243,0.00016601096,0.0011349275,0.00074567244,0.00029454363,0.024344921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.0001703724,0.0000147424835,0.00004756863,0.0001492337,0.00005123226],"domain_scores_gemma":[0.99918383,0.000618895,0.000058598314,0.000038409635,0.00008538096,0.00001483069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088799145,0.0011626679,0.00068101496,0.00042755014,0.00035919948,0.0012442227,0.001107129,0.001080362,0.0064136013],"category_scores_gemma":[0.0020270331,0.0005633498,0.0008694308,0.0011412742,0.00061465823,0.0013494394,0.00062075263,0.002134951,0.0013090732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017498953,0.000018875839,0.00005715485,0.00004339636,0.000008310698,0.00003280218,0.000025103027,0.93551564,0.00038201603,0.05081265,0.0013908539,0.011695701],"study_design_scores_gemma":[0.0000051410725,0.000009129744,0.000010262489,0.000004132875,0.0000022180839,0.000006414016,0.0000046956693,0.9850117,0.000107056876,0.013580319,0.001256551,0.0000022850909],"about_ca_topic_score_codex":0.002792719,"about_ca_topic_score_gemma":0.003914543,"teacher_disagreement_score":0.0064136013,"about_ca_system_score_codex":0.0009057835,"about_ca_system_score_gemma":0.00092859275,"threshold_uncertainty_score":0.021455646},"labels":[],"label_agreement":null},{"id":"W2162557036","doi":"10.1109/pads.2007.4","title":"A Design-Driven Partitioning Algorithm for Distributed Verilog Simulation","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Netlist; Computer science; Verilog; Algorithm; Very-large-scale integration; Hypergraph; Speedup; Parallel computing; Logic synthesis; Algorithm design; Theoretical computer science; Logic gate; Mathematics; Field-programmable gate array; Embedded system","score_opus":0.025883688928128645,"score_gpt":0.2677548274825193,"score_spread":0.24187113855439063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162557036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026292538,0.000039046598,0.99547946,0.000028267043,0.00000914875,0.0000418938,0.0000208622,0.00080222584,0.000949811],"genre_scores_gemma":[0.07504553,0.00006418545,0.9228051,0.00004269772,0.000008541255,0.0001843359,0.00017804976,0.00021011305,0.0014614672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.000098541735,0.000021705084,0.00006696216,0.00016048641,0.000033023403],"domain_scores_gemma":[0.99939454,0.0002886889,0.000043815722,0.0001267804,0.00012232218,0.000023760707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055049564,0.00073545787,0.00043371812,0.00063323346,0.0004890299,0.0006128696,0.001031817,0.0006824245,0.0037742408],"category_scores_gemma":[0.0016240692,0.00048208932,0.00055574183,0.0004696413,0.00042665377,0.0009043972,0.00075952616,0.0009503972,0.00097595796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013927648,0.00008177084,0.0004995828,0.00013490775,0.000047225516,0.00008590827,0.00012242967,0.5498492,0.02538439,0.029391102,0.0033247652,0.3909394],"study_design_scores_gemma":[0.000034113924,0.000038757727,0.00007149927,0.000009180711,0.000009116497,0.000046354733,0.000009605056,0.98057586,0.0054500434,0.009437234,0.004310365,0.000007739992],"about_ca_topic_score_codex":0.0019689756,"about_ca_topic_score_gemma":0.0030690767,"teacher_disagreement_score":0.0037742408,"about_ca_system_score_codex":0.0007865191,"about_ca_system_score_gemma":0.0009162526,"threshold_uncertainty_score":0.012626171},"labels":[],"label_agreement":null},{"id":"W2162628682","doi":"10.1145/611817.611842","title":"Automatic transistor and physical design of FPGA tiles from an architectural specification","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Place and route; Netlist; Schematic; Design layout record; Router; Embedded system; Lookup table; Computer hardware; Process (computing); Integrated circuit layout; Computer architecture; Integrated circuit; Electrical engineering; Engineering; Circuit extraction; Operating system; Voltage","score_opus":0.01827725736220543,"score_gpt":0.2206740602273176,"score_spread":0.20239680286511216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162628682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05139111,0.00014656762,0.92766786,0.00008180793,0.00006094885,0.00015044787,0.00054480997,0.008936711,0.011019741],"genre_scores_gemma":[0.3371393,0.00019580254,0.65329456,0.00012691635,0.0000296606,0.00027730176,0.0015696228,0.0015861996,0.005780554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000051034993,0.000021566033,0.00003892652,0.00013068884,0.000028045153],"domain_scores_gemma":[0.99965775,0.00013513505,0.00003546073,0.00007838265,0.0000827667,0.000010387624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302043,0.0005287724,0.0003203407,0.0005462075,0.0002167986,0.0007141743,0.00058534264,0.00024122682,0.0050526485],"category_scores_gemma":[0.000882706,0.0003482203,0.00048590094,0.00027791594,0.00032837258,0.00041991938,0.0003677806,0.00038408092,0.0012295493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002574654,0.000067319845,0.0034329258,0.00079910265,0.000087979584,0.00094765105,0.00043769865,0.33093315,0.30576313,0.04978999,0.01438448,0.29309902],"study_design_scores_gemma":[0.00012558815,0.00038466384,0.0026450988,0.00008011049,0.00005932602,0.00072161976,0.00016927235,0.6823359,0.23219897,0.014934395,0.06629101,0.00005399821],"about_ca_topic_score_codex":0.00052054384,"about_ca_topic_score_gemma":0.001080815,"teacher_disagreement_score":0.0050526485,"about_ca_system_score_codex":0.00042987592,"about_ca_system_score_gemma":0.0006506835,"threshold_uncertainty_score":0.016902804},"labels":[],"label_agreement":null},{"id":"W2162694675","doi":"10.1109/iccd.2008.4751836","title":"A parallel Steiner tree heuristic for macro cell routing","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Computer science; Routing (electronic design automation); Tree (set theory); Heuristic; Parameterized complexity; Very-large-scale integration; Macro; Set (abstract data type); Parallel computing; Algorithm; Mathematical optimization; Mathematics; Computer network; Combinatorics; Artificial intelligence; Embedded system","score_opus":0.018186451578640152,"score_gpt":0.2069256173150415,"score_spread":0.18873916573640134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162694675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08097357,0.0006986772,0.91004026,0.0001801077,0.000057189853,0.00021652639,0.00021543328,0.0007080562,0.006910245],"genre_scores_gemma":[0.35415924,0.00042717098,0.6390314,0.00010459947,0.000033955526,0.000251944,0.00070604,0.00018019919,0.005105532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.000046095192,0.0000112933985,0.000035247183,0.000059403017,0.000029747473],"domain_scores_gemma":[0.9997974,0.00008575926,0.000027149366,0.000030817173,0.000039195023,0.000019597785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036335862,0.0004944498,0.00071759097,0.0008608203,0.0005164128,0.00044569845,0.00085243507,0.0005314666,0.0031102914],"category_scores_gemma":[0.00058833585,0.00036175363,0.00061705866,0.0011212175,0.000322482,0.0009696467,0.00056871277,0.00040449924,0.0004799142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019357409,0.00011203069,0.00085766637,0.00014481846,0.00006944617,0.0002236454,0.000092756054,0.7670932,0.013915433,0.011583124,0.0052027865,0.20051156],"study_design_scores_gemma":[0.00005437279,0.00016224173,0.000274066,0.000009170343,0.000026377274,0.00013887254,0.000032405267,0.9864618,0.003056694,0.0068401173,0.0029307178,0.000013118559],"about_ca_topic_score_codex":0.0018099189,"about_ca_topic_score_gemma":0.0036936058,"teacher_disagreement_score":0.0031102914,"about_ca_system_score_codex":0.0005165856,"about_ca_system_score_gemma":0.00082841655,"threshold_uncertainty_score":0.010404944},"labels":[],"label_agreement":null},{"id":"W2162705435","doi":"10.1109/tvlsi.2003.812369","title":"Further improve circuit partitioning using GBAW logic perturbation techniques","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hypergraph; Graph partition; Computer science; Electronic circuit; Benchmark (surveying); Graph; Logic synthesis; Logic gate; Partition (number theory); Parallel computing; Logic optimization; Algorithm; Theoretical computer science; Mathematics; Engineering","score_opus":0.021252731122555588,"score_gpt":0.23291846541657654,"score_spread":0.21166573429402097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162705435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15522297,0.00045415838,0.8357544,0.00025401838,0.00005518564,0.00012299915,0.00006772173,0.0027936588,0.0052749207],"genre_scores_gemma":[0.52278703,0.00033748397,0.47177595,0.00018921768,0.00003365389,0.00009422791,0.00026396217,0.00033303248,0.0041854354],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997594,0.000046009252,0.000014891246,0.000041248717,0.00010249437,0.00003598841],"domain_scores_gemma":[0.999691,0.00012329497,0.00004119228,0.00008540035,0.000045874185,0.000013222077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020392782,0.00085340143,0.00037006152,0.0008741786,0.00028404852,0.00038405036,0.0006191219,0.00035456003,0.0025120727],"category_scores_gemma":[0.00083387335,0.00022682785,0.00038842714,0.0006643318,0.00035402435,0.000997281,0.00071385043,0.0005754911,0.00078838796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001824635,0.00016476423,0.00094778615,0.00020893723,0.00007617877,0.00022063658,0.00020151751,0.10617889,0.53764796,0.013191939,0.0016458717,0.339333],"study_design_scores_gemma":[0.00008399242,0.0005576741,0.0018201986,0.000025431778,0.00009486052,0.0006793987,0.00010921441,0.56140125,0.40850395,0.011531943,0.01516454,0.000027561846],"about_ca_topic_score_codex":0.001098437,"about_ca_topic_score_gemma":0.0027963477,"teacher_disagreement_score":0.0025120727,"about_ca_system_score_codex":0.00035437706,"about_ca_system_score_gemma":0.00034284196,"threshold_uncertainty_score":0.0084037185},"labels":[],"label_agreement":null},{"id":"W2163480916","doi":"10.1109/icpads.2000.857720","title":"Some space considerations of VLSI systolic array mappings","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Systolic array; Nested loop join; Very-large-scale integration; Loop (graph theory); Transformation (genetics); Algorithm; Computer science; Transformation matrix; Space (punctuation); Matrix (chemical analysis); Variable (mathematics); Array data structure; Mathematics; Parallel computing; Combinatorics; Physics; Mathematical analysis","score_opus":0.019342595885688953,"score_gpt":0.19340886197251025,"score_spread":0.1740662660868213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163480916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09339962,0.006167377,0.78522146,0.001990638,0.00035439496,0.000052957213,0.00016614195,0.00040620845,0.11224125],"genre_scores_gemma":[0.8192808,0.0052041025,0.14360529,0.0004300103,0.0006447522,0.00021253989,0.00018699623,0.0003033075,0.03013216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955267,0.00012329649,0.000026830745,0.000047397552,0.00020995612,0.000039874354],"domain_scores_gemma":[0.99901724,0.00060286286,0.000062105544,0.00012565855,0.00017364295,0.000018572182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056767644,0.00039938002,0.0002321968,0.00066234794,0.00054911635,0.0013452312,0.00038312498,0.00038256586,0.0052852333],"category_scores_gemma":[0.003209891,0.00030195806,0.0003517173,0.00080834236,0.000865348,0.0021000968,0.0004673327,0.0005422584,0.0007425005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000738121,0.000019677022,0.00029710383,0.00013424778,0.000008068089,0.00024291174,0.00023402758,0.0684585,0.009981421,0.87135476,0.0022478704,0.046947617],"study_design_scores_gemma":[0.00002269803,0.00017273525,0.0007443573,0.000055210876,0.000016022173,0.00044772,0.0001893937,0.27762854,0.010330792,0.6705015,0.039868258,0.000022916669],"about_ca_topic_score_codex":0.0007392788,"about_ca_topic_score_gemma":0.0010222056,"teacher_disagreement_score":0.0052852333,"about_ca_system_score_codex":0.000650908,"about_ca_system_score_gemma":0.00048104476,"threshold_uncertainty_score":0.017680883},"labels":[],"label_agreement":null},{"id":"W2163517325","doi":"10.5555/1356802.1356854","title":"Large-scale fixed-outline floorplanning design using convex optimization techniques","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Floorplan; Mathematical optimization; Minification; Voronoi diagram; Computer science; Convex optimization; Regular polygon; Global optimization; Graph; Mathematics; Theoretical computer science","score_opus":0.0293150775017935,"score_gpt":0.23663767064324662,"score_spread":0.20732259314145313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163517325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049411003,0.00004999561,0.9935954,0.000022565864,0.0000046590612,0.000020873136,0.000018312407,0.0002790082,0.0010680694],"genre_scores_gemma":[0.19426797,0.00011014913,0.8037094,0.000029181963,0.000009952306,0.00012047638,0.00012244587,0.00013275401,0.0014976852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957746,0.0001413945,0.000016083015,0.000057771147,0.00015551098,0.00005179896],"domain_scores_gemma":[0.99960285,0.00018724256,0.000050638366,0.00005152786,0.0000905984,0.000017137234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006054224,0.0008398924,0.0005822659,0.0004824575,0.0003190463,0.00052246975,0.00089847465,0.0003481838,0.0021405993],"category_scores_gemma":[0.000855826,0.0003919101,0.00059226836,0.0005583474,0.0004054271,0.00050576765,0.00053827284,0.0006635127,0.00042218537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017446358,0.000012656608,0.00013755668,0.000027514014,0.000010783606,0.00003714829,0.000017872526,0.9526458,0.0052311006,0.004823838,0.0005853573,0.036452953],"study_design_scores_gemma":[0.000004381314,0.000023951237,0.00005741917,0.0000032536439,0.0000031596992,0.000019635967,0.00000469276,0.99535275,0.0022363474,0.0017166319,0.0005740003,0.0000036923013],"about_ca_topic_score_codex":0.002988126,"about_ca_topic_score_gemma":0.0040520127,"teacher_disagreement_score":0.002988126,"about_ca_system_score_codex":0.000576398,"about_ca_system_score_gemma":0.0010701938,"threshold_uncertainty_score":0.007161081},"labels":[],"label_agreement":null},{"id":"W2163661406","doi":"10.1016/j.disopt.2012.10.002","title":"A bad example for the iterative rounding method for mincost <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si52.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected spanning subgraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Norm (philosophy); Algorithm; Discrete mathematics; Iterative method; Iterative refinement; Relaxation (psychology); Computer science; Combinatorics","score_opus":0.021739337531294353,"score_gpt":0.2639957199895441,"score_spread":0.2422563824582497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163661406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292153,0.0005117236,0.9644447,0.002003352,0.00042001932,0.000046118945,0.00016168051,0.00089404295,0.027226262],"genre_scores_gemma":[0.0853888,0.00050715747,0.8918282,0.0006920713,0.00018682583,0.00012715822,0.00020068619,0.0008185298,0.02025058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.00020918736,0.000033800945,0.00010187543,0.0002763982,0.00007139574],"domain_scores_gemma":[0.998965,0.00051137316,0.000035162604,0.00021668084,0.00023619026,0.000035688485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096619077,0.00080710626,0.00057469227,0.00069945416,0.0010932351,0.0012601148,0.0011075373,0.001214837,0.019762173],"category_scores_gemma":[0.006198298,0.00033649022,0.0008830038,0.001299948,0.0010290296,0.0017109701,0.0011257998,0.0028044186,0.0046340576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024778998,0.00007903253,0.0003432964,0.00030606182,0.000046327204,0.0003668681,0.00019112862,0.057609495,0.005715989,0.65697724,0.064441815,0.21367498],"study_design_scores_gemma":[0.00008985004,0.000091198846,0.00029710762,0.000120520555,0.000039328377,0.00070837233,0.00010522591,0.339837,0.0077596647,0.55883634,0.092054576,0.00006084447],"about_ca_topic_score_codex":0.0022849045,"about_ca_topic_score_gemma":0.0049106176,"teacher_disagreement_score":0.019762173,"about_ca_system_score_codex":0.00075530156,"about_ca_system_score_gemma":0.00086107623,"threshold_uncertainty_score":0.06611109},"labels":[],"label_agreement":null},{"id":"W2163716961","doi":"10.5755/j01.itc.40.4.981","title":"A HYBRID GENETIC ALGORITHM FOR PARTITIONING OF DATA MODEL IN DISTRIBUTION MANAGEMENT SYSTEMS","year":2011,"lang":"en","type":"article","venue":"Information Technology And Control","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Particle swarm optimization; Genetic algorithm; Algorithm; Estimation of distribution algorithm; Mathematical optimization; Mathematics; Machine learning","score_opus":0.013685633900061576,"score_gpt":0.20069229830943766,"score_spread":0.18700666440937608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163716961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013506422,0.00016408892,0.9847972,0.000068338995,0.000020272435,0.00003083031,0.00002355385,0.00023605427,0.0011532096],"genre_scores_gemma":[0.3703215,0.0002667961,0.6255567,0.00011998178,0.000028408247,0.0002550756,0.0002376778,0.00010458532,0.0031091361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999607,0.00012131239,0.000016913405,0.000081157945,0.0001241459,0.000049486247],"domain_scores_gemma":[0.9997873,0.00010918465,0.000018612041,0.000021744887,0.000051279047,0.0000119878305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006506897,0.00067328295,0.0005608676,0.00081246183,0.000499165,0.00071702525,0.0008301934,0.00074547576,0.0013146544],"category_scores_gemma":[0.0010165946,0.00035903053,0.0005633353,0.0007172419,0.00047662196,0.000919863,0.0006350587,0.00056567724,0.00026937743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052438812,0.000040711024,0.0006298472,0.000038669717,0.00004451791,0.00004187059,0.000074255666,0.85965675,0.0033486092,0.009976072,0.0008281464,0.12526812],"study_design_scores_gemma":[0.000013526178,0.000021612956,0.00009910399,0.000004623421,0.0000072151583,0.000018972101,0.000008599812,0.99560803,0.0006755982,0.0027156956,0.00082251115,0.000004503872],"about_ca_topic_score_codex":0.0064242454,"about_ca_topic_score_gemma":0.0044409796,"teacher_disagreement_score":0.0064242454,"about_ca_system_score_codex":0.00083599077,"about_ca_system_score_gemma":0.00087470893,"threshold_uncertainty_score":0.012773693},"labels":[],"label_agreement":null},{"id":"W2164114092","doi":"10.1109/delta.2002.994649","title":"A novel analytical model for evaluation of substrate crosstalk in VLSI circuits","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crosstalk; Very-large-scale integration; Computer science; Electronic circuit; Electronic engineering; Computer architecture; Electrical engineering; Engineering; Embedded system","score_opus":0.08816011737603942,"score_gpt":0.31464825146451714,"score_spread":0.22648813408847773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164114092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008222824,0.0003284246,0.9872257,0.00009264056,0.000035950656,0.000017353625,0.00003189994,0.00023949497,0.0038057414],"genre_scores_gemma":[0.5564707,0.0026405407,0.42272937,0.00030930678,0.00015530096,0.00017003527,0.00021681184,0.000274492,0.017033448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997223,0.000052411746,0.000010076125,0.000026547888,0.00016389243,0.000024686447],"domain_scores_gemma":[0.9998398,0.00005655557,0.000019507726,0.000023520623,0.000053709395,0.000006789772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029280086,0.0007107855,0.0004041352,0.00047396228,0.00026338492,0.00065730524,0.0009845805,0.000845154,0.00087797845],"category_scores_gemma":[0.0011454505,0.0002829989,0.00044024165,0.0006391823,0.00042995068,0.0011346973,0.0003834804,0.0005862877,0.0005335151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034681903,0.00004963729,0.00039456476,0.00015080815,0.000029313887,0.00030673938,0.0001477848,0.7079159,0.080373436,0.16449513,0.0016629684,0.044439033],"study_design_scores_gemma":[0.0000028618442,0.000018793427,0.000046938585,0.0000069973075,0.000005678981,0.000104779254,0.000008977647,0.9863464,0.003933357,0.0075457143,0.001973161,0.00000623431],"about_ca_topic_score_codex":0.00089108554,"about_ca_topic_score_gemma":0.001003185,"teacher_disagreement_score":0.0009845805,"about_ca_system_score_codex":0.0006436549,"about_ca_system_score_gemma":0.0008322682,"threshold_uncertainty_score":0.0046700835},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.01999264766098574,"score_gpt":0.24533398569114792,"score_spread":0.22534133803016218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164340799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115310386,0.0012338763,0.74839854,0.0005695837,0.00036022303,0.0009850537,0.0033011865,0.07103868,0.0588025],"genre_scores_gemma":[0.35141453,0.00082247425,0.62033886,0.00030717065,0.00009587436,0.001226952,0.00994283,0.007400561,0.008450734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966444,0.0009852344,0.00019902615,0.00023873756,0.0016773537,0.00025535023],"domain_scores_gemma":[0.994829,0.0026944752,0.00032884922,0.0010290697,0.0009722736,0.00014639655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003531791,0.0012990816,0.0005134999,0.0017459117,0.00051743764,0.0015469106,0.0021868015,0.00066793483,0.0088172825],"category_scores_gemma":[0.010882327,0.0005275709,0.0006277182,0.0020363512,0.00064362085,0.0020175234,0.0014946231,0.0012007391,0.0016266273],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010879696,0.00097424805,0.009824053,0.0013467895,0.00014546791,0.00074339664,0.0008120352,0.20873287,0.06735394,0.09188839,0.08638512,0.5307057],"study_design_scores_gemma":[0.0005241139,0.0010944884,0.005900872,0.00028830732,0.00007844912,0.0006154628,0.00039036668,0.62638885,0.14079149,0.032012593,0.19174743,0.00016755775],"about_ca_topic_score_codex":0.004002929,"about_ca_topic_score_gemma":0.004936828,"teacher_disagreement_score":0.0088172825,"about_ca_system_score_codex":0.0011882166,"about_ca_system_score_gemma":0.001404607,"threshold_uncertainty_score":0.02949673},"labels":[],"label_agreement":null},{"id":"W2165102380","doi":"10.1109/iscas.1990.112038","title":"On the design of a parallel algorithm for VLSI layout compaction","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dual (grammatical number); Shortest path problem; Very-large-scale integration; Computation; Path (computing); Graph; Graph theory; Algorithm; Mathematical optimization; Theoretical computer science; Parallel computing; Mathematics; Programming language","score_opus":0.05215500958859865,"score_gpt":0.22709906953688572,"score_spread":0.17494405994828707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165102380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002067622,0.00011331189,0.99353975,0.00006709681,0.000034372766,0.000060727652,0.000029340865,0.00081847975,0.0032691734],"genre_scores_gemma":[0.033920087,0.0002342338,0.9627397,0.000077671946,0.00004483529,0.00028811113,0.00016240923,0.00015992166,0.002373044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945575,0.00010187501,0.000041181644,0.00012189122,0.00021793423,0.000061380604],"domain_scores_gemma":[0.9994671,0.00023626458,0.000036844463,0.00009645295,0.00014624016,0.000017194097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056010426,0.0010510259,0.00078831543,0.00094339176,0.00083614053,0.0011604676,0.0014582006,0.00080133724,0.008415253],"category_scores_gemma":[0.0018809501,0.0005552015,0.00076963136,0.001515077,0.00062317797,0.001483442,0.0009673937,0.0008630682,0.0026455189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025823194,0.00014495794,0.0004845362,0.00037287496,0.00007318854,0.00020906926,0.00012664455,0.30107945,0.027768781,0.095856875,0.012006682,0.5616186],"study_design_scores_gemma":[0.00012443385,0.00016716817,0.00015344398,0.00003017972,0.000034211505,0.00021175046,0.000040821087,0.9281597,0.00873051,0.038500316,0.023827162,0.00002043948],"about_ca_topic_score_codex":0.00167426,"about_ca_topic_score_gemma":0.0027480584,"teacher_disagreement_score":0.008415253,"about_ca_system_score_codex":0.00081798504,"about_ca_system_score_gemma":0.0012497802,"threshold_uncertainty_score":0.02815181},"labels":[],"label_agreement":null},{"id":"W2165433638","doi":"10.1109/mwscas.1996.594197","title":"An efficient interior point approach for QP and LP models of the relative placement problem","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Quadratic programming; Linear programming; Mathematical optimization; Point (geometry); Computer science; Graph; Quadratic equation; Iterative method; Algorithm; Mathematics; Theoretical computer science; Geometry","score_opus":0.022457155257393082,"score_gpt":0.2085352540782423,"score_spread":0.18607809882084922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165433638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039835193,0.000070120135,0.99748117,0.00006404336,0.000016095411,0.000018348432,0.000018897792,0.000054529784,0.0018785015],"genre_scores_gemma":[0.09077586,0.000768649,0.9002584,0.00015895329,0.00017250433,0.00061400037,0.00023412578,0.00027778978,0.0067396658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944216,0.00024266425,0.00001837248,0.00006453657,0.00018224648,0.00005000244],"domain_scores_gemma":[0.9990846,0.0006548473,0.000061114166,0.00004031749,0.00013654953,0.000022579381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338278,0.0014594989,0.0013588462,0.0008871597,0.00053915137,0.0013656847,0.0013589142,0.0014876768,0.008545187],"category_scores_gemma":[0.0032778974,0.00081855303,0.0013243153,0.0009723559,0.0008529734,0.0013743266,0.0011304832,0.0033239883,0.0016326654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015841739,0.000042599808,0.000066088694,0.00014648485,0.000014635952,0.00006127029,0.000047765705,0.9000665,0.00086290255,0.06344225,0.0027945554,0.032439098],"study_design_scores_gemma":[0.000005259892,0.000011976317,0.0000116136025,0.000009750958,0.0000030987019,0.00001519397,0.000009067396,0.9835967,0.00017864472,0.014775322,0.0013800532,0.0000033719052],"about_ca_topic_score_codex":0.0037190078,"about_ca_topic_score_gemma":0.0038003165,"teacher_disagreement_score":0.008545187,"about_ca_system_score_codex":0.00089410646,"about_ca_system_score_gemma":0.0015674273,"threshold_uncertainty_score":0.028586507},"labels":[],"label_agreement":null},{"id":"W2165602035","doi":"10.1109/ccece.2004.1345063","title":"Global routing for VLSI standard cells","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Speedup; Routing (electronic design automation); Very-large-scale integration; Parallel computing; Integer programming; Heuristic; Path (computing); Linear programming; Set (abstract data type); Computation; Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Embedded system; Computer network","score_opus":0.007696700446813141,"score_gpt":0.22452739007306344,"score_spread":0.2168306896262503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165602035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013097901,0.001184589,0.96895057,0.00023455992,0.00008727463,0.000052895426,0.0001494011,0.0016027626,0.014640143],"genre_scores_gemma":[0.31442434,0.0022020189,0.664873,0.00021439938,0.000092161376,0.00025969432,0.0008710586,0.00049584237,0.01656756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984264,0.000039139908,0.0000069366356,0.00002657913,0.00006385982,0.000020825382],"domain_scores_gemma":[0.99986935,0.000041578318,0.000014116096,0.000031368625,0.000038107864,0.0000055094692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000234905,0.0006501185,0.0003890104,0.00050478993,0.00035043308,0.0007326238,0.0006021337,0.0003891072,0.0072796536],"category_scores_gemma":[0.00046001378,0.00022045056,0.0003744376,0.00072682893,0.00034418594,0.0009435536,0.000518363,0.00049809844,0.001195861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079236765,0.00003515027,0.0004935588,0.00031243093,0.000041942694,0.00013081748,0.00008013936,0.46172938,0.021749439,0.10106156,0.01591128,0.3983751],"study_design_scores_gemma":[0.0000417384,0.00018103709,0.00026988832,0.000052738033,0.000041013005,0.00016730808,0.00005950303,0.8319139,0.0131757045,0.097506195,0.056567397,0.00002350489],"about_ca_topic_score_codex":0.0012036304,"about_ca_topic_score_gemma":0.0036175426,"teacher_disagreement_score":0.0072796536,"about_ca_system_score_codex":0.00055053656,"about_ca_system_score_gemma":0.0005737881,"threshold_uncertainty_score":0.024352908},"labels":[],"label_agreement":null},{"id":"W2165921360","doi":"10.1109/cicc.1990.124814","title":"The effect of switch box flexibility on routability of field programmable gate arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Flexibility (engineering); Field-programmable gate array; Routing (electronic design automation); Interconnection; Computer science; Channel (broadcasting); Gate array; Set (abstract data type); Logic gate; Field (mathematics); Logic synthesis; Embedded system; Engineering; Algorithm; Computer network; Mathematics","score_opus":0.011321006485805227,"score_gpt":0.22671275671378524,"score_spread":0.21539175022798002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165921360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97191703,0.00046062964,0.02144703,0.00012783638,0.000024466524,0.000010056874,0.000062108425,0.0003012008,0.0056496114],"genre_scores_gemma":[0.9980945,0.00007644791,0.0015682062,0.000010994078,0.000009151637,0.0000032744138,0.000027589756,0.00002660269,0.0001832044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926835,0.00023829674,0.00005322319,0.00011133638,0.0001734011,0.00015530418],"domain_scores_gemma":[0.99048656,0.007292719,0.0009600686,0.0008293889,0.00023669004,0.0001945324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396431,0.0004671272,0.00021876665,0.0004461767,0.00032723002,0.00072805147,0.00040526982,0.00051500375,0.0023626306],"category_scores_gemma":[0.0081108175,0.0002704152,0.00028239487,0.00041798045,0.0005873996,0.0017030013,0.0005323711,0.0004734606,0.00021378131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031310816,0.00017034811,0.0101972595,0.00026525086,0.00013818845,0.0011452233,0.00031789573,0.5039099,0.38358727,0.014859982,0.00055053766,0.08172708],"study_design_scores_gemma":[0.00022487619,0.004243444,0.024851896,0.00008555916,0.00033077394,0.002345438,0.00022352085,0.4856639,0.4538183,0.023586307,0.00443012,0.00019589972],"about_ca_topic_score_codex":0.0002642517,"about_ca_topic_score_gemma":0.00037929,"teacher_disagreement_score":0.0023626306,"about_ca_system_score_codex":0.00024789685,"about_ca_system_score_gemma":0.00014299892,"threshold_uncertainty_score":0.007903814},"labels":[],"label_agreement":null},{"id":"W2166086163","doi":"10.1109/icvd.1993.669687","title":"Parallel Network Primal-Dual Method on a Shared Memory Multiprocessor and A Unified Approach to VLSI Layout Compaction and Wire Balancing","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Initialization; Computer science; Dual (grammatical number); Parallel computing; Very-large-scale integration; Benchmark (surveying); Mathematical optimization; Multiprocessing; Constraint (computer-aided design); Graph; Algorithm; Theoretical computer science; Mathematics; Embedded system","score_opus":0.019789919869932726,"score_gpt":0.25215277749692183,"score_spread":0.2323628576269891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166086163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031274785,0.00012689103,0.99375534,0.00011043782,0.00004054138,0.000022153466,0.000016543452,0.00013714853,0.0026634396],"genre_scores_gemma":[0.13863549,0.00035207628,0.8525052,0.00012019084,0.00009968181,0.00030994698,0.00010230519,0.00018539905,0.00768972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.0001609912,0.000014898789,0.00005691243,0.00015508574,0.00004809627],"domain_scores_gemma":[0.999683,0.00012591496,0.000034751967,0.00005634596,0.0000751138,0.000024825573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008202091,0.0006600863,0.0009033414,0.0005205334,0.000450733,0.001039259,0.0013454721,0.0007029364,0.0044493955],"category_scores_gemma":[0.0012311906,0.0004906565,0.0005252655,0.0010758805,0.00063484686,0.0011002875,0.001266778,0.0013034857,0.0007864397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098839126,0.00007784096,0.00020617021,0.00008482951,0.000045846566,0.000114898394,0.000038677546,0.85040206,0.0030732707,0.06992688,0.0031564971,0.072774194],"study_design_scores_gemma":[0.000014862281,0.000014233854,0.000020371368,0.0000024246117,0.0000040675495,0.00001425786,0.000004517127,0.99172604,0.00045974576,0.0061777,0.0015588541,0.0000028594748],"about_ca_topic_score_codex":0.0017718915,"about_ca_topic_score_gemma":0.0034420681,"teacher_disagreement_score":0.0044493955,"about_ca_system_score_codex":0.00080442237,"about_ca_system_score_gemma":0.0011723668,"threshold_uncertainty_score":0.01488471},"labels":[],"label_agreement":null},{"id":"W2166289398","doi":"10.1109/fpt.2009.5377668","title":"Self-hosted placement for massively parallel processor arrays","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Placer mining; Massively parallel; Computer science; Parallel computing; Simulated annealing; Placement; Workstation; Computational science; Physical design; Algorithm; Integrated circuit; Geology; Operating system","score_opus":0.011565182860145287,"score_gpt":0.22775225539301525,"score_spread":0.21618707253286995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166289398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21655455,0.00023693687,0.77510315,0.00022671245,0.00008363264,0.000049516406,0.00003495926,0.0009374048,0.0067731566],"genre_scores_gemma":[0.709337,0.0001384878,0.28468043,0.000040542294,0.000029189297,0.000050102077,0.00006062016,0.00011524493,0.005548379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984837,0.00004202336,0.0000061131586,0.00002933513,0.000054085747,0.000020010755],"domain_scores_gemma":[0.99969196,0.00013983187,0.000054337685,0.00005154538,0.000043905737,0.000018536828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028734677,0.00023889152,0.0002754109,0.00023553027,0.00036471555,0.00041906367,0.00052456436,0.0005335761,0.001628365],"category_scores_gemma":[0.0008335464,0.00021805175,0.00027793873,0.00029599803,0.00043153932,0.00044418703,0.00038237954,0.00033403805,0.00031285404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047814807,0.00003657693,0.0005669791,0.000045496596,0.0000141201135,0.00014007096,0.00006982324,0.9549844,0.011656195,0.007896918,0.0005875506,0.02395406],"study_design_scores_gemma":[0.000007981382,0.000051313516,0.00021058875,0.0000021449557,0.0000037182306,0.000060859944,0.000024181852,0.99075,0.0040160622,0.0036826043,0.0011862237,0.0000043032796],"about_ca_topic_score_codex":0.0010075907,"about_ca_topic_score_gemma":0.0016944993,"teacher_disagreement_score":0.001628365,"about_ca_system_score_codex":0.00038664555,"about_ca_system_score_gemma":0.00037311402,"threshold_uncertainty_score":0.0054474473},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01698447838718365,"score_gpt":0.20653044797419595,"score_spread":0.1895459695870123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166604263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046022445,0.0001941264,0.9476002,0.00014458023,0.00005919747,0.000110983834,0.000035012217,0.0025630149,0.003270391],"genre_scores_gemma":[0.2958476,0.00013764433,0.6994515,0.00010880569,0.000022326532,0.00017034162,0.00013260488,0.00037375558,0.0037554852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928313,0.00015242549,0.00004226802,0.00013886535,0.00028808884,0.00009525572],"domain_scores_gemma":[0.9989247,0.0003616716,0.00009319421,0.00032701815,0.0002194326,0.00007389846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009034498,0.00031516876,0.00041750754,0.00036702282,0.00042775905,0.00073665136,0.0015996082,0.000481186,0.0034263881],"category_scores_gemma":[0.002115625,0.00029436548,0.0003976037,0.00033460796,0.00042546945,0.0013384325,0.0010136951,0.0007411484,0.00049419556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058545126,0.0003502047,0.003526567,0.00041774666,0.00014841255,0.00029846423,0.0006760893,0.3230805,0.12642398,0.044130392,0.005300794,0.49506143],"study_design_scores_gemma":[0.00007799718,0.0001840914,0.0006679407,0.000018169709,0.000024588866,0.00012130092,0.0000744551,0.937857,0.03676037,0.011898493,0.012295747,0.000019828341],"about_ca_topic_score_codex":0.0010826462,"about_ca_topic_score_gemma":0.002078989,"teacher_disagreement_score":0.0034263881,"about_ca_system_score_codex":0.0007282565,"about_ca_system_score_gemma":0.0008961565,"threshold_uncertainty_score":0.01146245},"labels":[],"label_agreement":null},{"id":"W2167561823","doi":"10.1109/cicc.2001.929727","title":"A novel FPGA architecture supporting wide shallow memories","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Field-programmable gate array; Block (permutation group theory); Routing (electronic design automation); Degradation (telecommunications); Logic block; Architecture; Megabit; Computer hardware; Path (computing); Memory architecture; Embedded system; Chip; Computer architecture; Computer network; Telecommunications","score_opus":0.015370271547065278,"score_gpt":0.2058589559590611,"score_spread":0.19048868441199582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167561823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43433264,0.004396479,0.5030245,0.00061915297,0.0005208468,0.0001723359,0.00041252465,0.007941594,0.048579942],"genre_scores_gemma":[0.7917071,0.0007549324,0.19464976,0.0002640987,0.00007703623,0.000055361896,0.00028420228,0.0000692801,0.0121382335],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99993,0.000007762122,0.000004668891,0.000014491529,0.00002196592,0.000021165193],"domain_scores_gemma":[0.999923,0.000013596128,0.000011215089,0.000016176673,0.000021471196,0.000014614392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000061259474,0.00023821964,0.00016400115,0.00023573202,0.00023617115,0.00044129856,0.0006716407,0.0002496004,0.0034438954],"category_scores_gemma":[0.00012359582,0.00013964833,0.00011028795,0.00020968527,0.00014424048,0.0006017516,0.0003120819,0.00026334325,0.0008354329],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007181364,0.00007727128,0.0018867119,0.00035733895,0.00004882109,0.0009800621,0.00013695177,0.008802207,0.5407679,0.017674476,0.010997727,0.41755235],"study_design_scores_gemma":[0.00044843915,0.0032187714,0.0077300593,0.00016046806,0.00026690113,0.0070500486,0.00020641148,0.18253797,0.57229215,0.011515328,0.21440129,0.00017218321],"about_ca_topic_score_codex":0.00048250167,"about_ca_topic_score_gemma":0.0015454552,"teacher_disagreement_score":0.0034438954,"about_ca_system_score_codex":0.00023641247,"about_ca_system_score_gemma":0.00023390578,"threshold_uncertainty_score":0.011520982},"labels":[],"label_agreement":null},{"id":"W2167700307","doi":"10.1109/isqed.2007.159","title":"Thermal-Aware Placement for FPGAs Using Electrostatic Charge Model","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Simulated annealing; Temperature gradient; Thermal; Computer science; Placement; Annealing (glass); Chip; Algorithm; Electronic engineering; Materials science; Embedded system; Engineering; Physics; Physical design; Thermodynamics; Circuit design","score_opus":0.02636385647325473,"score_gpt":0.26769226260448264,"score_spread":0.2413284061312279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167700307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05939702,0.00042226765,0.9346256,0.000108406864,0.000053608102,0.000042948242,0.000061975064,0.00072591857,0.0045622936],"genre_scores_gemma":[0.8119994,0.00032779292,0.18377489,0.000069250134,0.000028816972,0.00006454927,0.00008927649,0.00010461854,0.003541477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998122,0.000028655748,0.0000086804,0.000023297982,0.00010908236,0.000018125565],"domain_scores_gemma":[0.9998969,0.000024328236,0.000016604758,0.000024159775,0.000033089425,0.0000049621667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001305199,0.00043413482,0.0004116944,0.00035123192,0.00026930065,0.00041716621,0.0007130349,0.00034795466,0.001100689],"category_scores_gemma":[0.00034200755,0.00027392688,0.0004690798,0.00039348612,0.00019374835,0.0005444841,0.00024078379,0.0002449422,0.00025129842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045493838,0.000019508134,0.0002838735,0.000042361713,0.000031112133,0.00007176467,0.0000131844645,0.94196075,0.024474032,0.0044359383,0.0006154363,0.028006557],"study_design_scores_gemma":[0.000005845322,0.00002957516,0.00015058588,0.0000019266602,0.000008740158,0.00005059851,0.0000030829547,0.9946346,0.0037176735,0.0008192427,0.0005729996,0.000005016849],"about_ca_topic_score_codex":0.0025057243,"about_ca_topic_score_gemma":0.0053697024,"teacher_disagreement_score":0.0025057243,"about_ca_system_score_codex":0.0006021225,"about_ca_system_score_gemma":0.0006205258,"threshold_uncertainty_score":0.0049822927},"labels":[],"label_agreement":null},{"id":"W2167788667","doi":"10.1109/iwsoc.2005.29","title":"A structure based clustering algorithm with applications to VLSI physical design","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Benchmark (surveying); Computer science; Very-large-scale integration; Suite; Algorithm; Algorithm design; Canopy clustering algorithm; Correlation clustering; Data mining; Artificial intelligence","score_opus":0.00938799234256803,"score_gpt":0.22388603059894352,"score_spread":0.21449803825637548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167788667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032302267,0.00036129486,0.99297947,0.00020188832,0.00007134884,0.00007623469,0.00006294064,0.0008900499,0.0021264856],"genre_scores_gemma":[0.040633105,0.0003827819,0.95525086,0.000107001164,0.00006323137,0.00014984868,0.00027836693,0.00015109513,0.0029836728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942845,0.000073225805,0.00003200854,0.0001329426,0.00029974,0.00003354626],"domain_scores_gemma":[0.9991086,0.00023437582,0.00009577739,0.0001592193,0.00036639775,0.00003570682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005389957,0.00090210536,0.00085357786,0.0022396583,0.001159761,0.0009497151,0.0014499782,0.0012828992,0.0029178164],"category_scores_gemma":[0.002411363,0.0005898927,0.0007138345,0.0028548678,0.00078987685,0.0017579818,0.0009911277,0.0011429612,0.0017126284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085080464,0.00007362145,0.0008455005,0.0001870215,0.00009565123,0.00006473123,0.00017455478,0.30006045,0.016807476,0.03924833,0.010969272,0.6313883],"study_design_scores_gemma":[0.00004735939,0.000109383116,0.0005784921,0.00003098786,0.000032604654,0.0002462064,0.000047057747,0.937338,0.008616061,0.031591475,0.021312648,0.000049681323],"about_ca_topic_score_codex":0.003906168,"about_ca_topic_score_gemma":0.006052132,"teacher_disagreement_score":0.003906168,"about_ca_system_score_codex":0.0012573238,"about_ca_system_score_gemma":0.0012364091,"threshold_uncertainty_score":0.009761095},"labels":[],"label_agreement":null},{"id":"W2167812696","doi":"10.1109/iscas.1998.705260","title":"Utility function based hybrid algorithm for channel routing","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tabu search; Computer science; Router; Routing (electronic design automation); Algorithm; Mathematical optimization; Benchmark (surveying); Channel (broadcasting); Convergence (economics); Heuristic; Graph; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.02601384334861889,"score_gpt":0.2032406609655718,"score_spread":0.17722681761695291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167812696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010596011,0.00019422492,0.9844738,0.000091634654,0.000031367636,0.00004357474,0.00003201011,0.00080258073,0.0037347523],"genre_scores_gemma":[0.40804163,0.0002486282,0.5809034,0.00013008843,0.000032139134,0.00030784486,0.0001837316,0.00017902555,0.009973441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00011972768,0.000011588507,0.00004071257,0.000120935714,0.00007038508],"domain_scores_gemma":[0.99972063,0.00014945993,0.000018477453,0.000028394377,0.00006408568,0.000018937873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063589937,0.0004959201,0.0006755576,0.00081254664,0.00043359387,0.00088162295,0.0011893859,0.00071464817,0.0043139197],"category_scores_gemma":[0.0011372356,0.00024901755,0.0003094023,0.0008429716,0.00052681065,0.0009520507,0.000751605,0.00062938477,0.0007097939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016365743,0.00009636737,0.00035291698,0.00006461056,0.000042435968,0.00005648508,0.000053599295,0.72356546,0.0026490416,0.058619708,0.0035112014,0.21082443],"study_design_scores_gemma":[0.000017378245,0.000024452696,0.000028047214,0.0000027060073,0.0000043324176,0.000011232841,0.000005292045,0.9927912,0.00051798654,0.005497331,0.0010956111,0.000004512329],"about_ca_topic_score_codex":0.0030168204,"about_ca_topic_score_gemma":0.003146205,"teacher_disagreement_score":0.0043139197,"about_ca_system_score_codex":0.0009766709,"about_ca_system_score_gemma":0.001083001,"threshold_uncertainty_score":0.014431477},"labels":[],"label_agreement":null},{"id":"W2167881201","doi":"10.1109/ccece.2008.4564673","title":"An effective congestion-based integer programming model for VLSI global routing","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Integer programming; Computer science; Very-large-scale integration; Routing (electronic design automation); Router; Parallel computing; Steiner tree problem; Mathematical optimization; Algorithm; Computer network; Mathematics; Embedded system","score_opus":0.01575072268814795,"score_gpt":0.21224252778328503,"score_spread":0.19649180509513708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167881201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033951255,0.0001283031,0.9934856,0.00015475186,0.000026772366,0.000030159426,0.00004794789,0.000082423496,0.002648798],"genre_scores_gemma":[0.36718863,0.00081971823,0.6193002,0.00022093294,0.00012164222,0.0005625417,0.00027105561,0.00016669866,0.011348537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994832,0.00019051897,0.000020713966,0.00007881087,0.00015944924,0.000067256966],"domain_scores_gemma":[0.99956554,0.00028878482,0.00003785754,0.000024970504,0.000060785853,0.000022015134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012961655,0.0010234138,0.0007498351,0.00042534212,0.00039605587,0.0011439524,0.0015295999,0.0009210874,0.003220206],"category_scores_gemma":[0.0018040104,0.00058863376,0.00095074996,0.0009330293,0.00070608285,0.0017784348,0.0009440333,0.001986697,0.00048192777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025289577,0.000027834112,0.000073723626,0.000039586554,0.000010461201,0.00004849192,0.000033222776,0.9200852,0.00086369104,0.06679496,0.00087179756,0.011125812],"study_design_scores_gemma":[0.0000067926185,0.000012658661,0.000009125748,0.000002394556,0.000002701618,0.000006617649,0.0000032840226,0.99008125,0.00011398524,0.0091125555,0.0006464087,0.0000021541641],"about_ca_topic_score_codex":0.0020490512,"about_ca_topic_score_gemma":0.0028311561,"teacher_disagreement_score":0.003220206,"about_ca_system_score_codex":0.0007774627,"about_ca_system_score_gemma":0.0013879118,"threshold_uncertainty_score":0.0107726455},"labels":[],"label_agreement":null},{"id":"W2168380569","doi":"10.1016/s0377-0427(00)00399-x","title":"Refining an approximate inverse","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preconditioner; Robustness (evolution); Factorization; Computation; Mathematics; Inverse; Exploit; Graph; Algorithm; Incomplete LU factorization; Iterative method; Mathematical optimization; Computer science; Matrix decomposition; Discrete mathematics","score_opus":0.015247306102368558,"score_gpt":0.22310895216774512,"score_spread":0.20786164606537658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168380569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028102526,0.00019449733,0.95838416,0.00027400808,0.00015906188,0.000045225326,0.000072562616,0.00031999522,0.012448079],"genre_scores_gemma":[0.32455492,0.0004375294,0.6578674,0.00017257809,0.000091231705,0.000049825307,0.00021228337,0.000286156,0.016328072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993993,0.00010444906,0.000027567608,0.00011094352,0.00032018733,0.000037504567],"domain_scores_gemma":[0.9992901,0.00022864158,0.000043568234,0.00028311496,0.00013277952,0.0000217028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060658884,0.0007628196,0.0008046665,0.00080879964,0.0005342863,0.0012953182,0.0004662397,0.001229451,0.0069873757],"category_scores_gemma":[0.003111056,0.0005164143,0.00077310484,0.0005843187,0.0012088093,0.0016743977,0.0014567842,0.0013543107,0.0016174928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005942183,0.000118550415,0.0013140413,0.0004157939,0.00010466169,0.0007484683,0.0004940722,0.18229805,0.12782149,0.2932347,0.0063214954,0.38653442],"study_design_scores_gemma":[0.00005778721,0.0003438186,0.0006374931,0.000072996125,0.00008077391,0.0016500106,0.00023507008,0.7507005,0.07087977,0.1323159,0.042972125,0.000053792457],"about_ca_topic_score_codex":0.0008449068,"about_ca_topic_score_gemma":0.0010999406,"teacher_disagreement_score":0.0069873757,"about_ca_system_score_codex":0.00035699143,"about_ca_system_score_gemma":0.0005290895,"threshold_uncertainty_score":0.023375034},"labels":[],"label_agreement":null},{"id":"W2169476075","doi":"10.1109/fpt.2009.5377689","title":"Congestion-driven regional re-clustering for low-cost FPGAs","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Interconnection; Computer science; Cluster analysis; Channel (broadcasting); White spaces; Constraint (computer-aided design); Implementation; Parallel computing; Selection (genetic algorithm); Embedded system; Computer engineering; Computer network; Engineering; Operating system","score_opus":0.026827795946442155,"score_gpt":0.25071521453288237,"score_spread":0.2238874185864402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169476075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14465405,0.00049425935,0.8488351,0.00011896187,0.000027994809,0.00011989777,0.000057501573,0.0030473734,0.0026448166],"genre_scores_gemma":[0.6883062,0.00016449537,0.30732986,0.000044336073,0.000014532102,0.00009476971,0.00011874027,0.00028518395,0.003641926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997526,0.00006441886,0.000010921736,0.000042925512,0.000080993304,0.00004805454],"domain_scores_gemma":[0.99936193,0.00021012216,0.000107183456,0.00015353892,0.00012368688,0.000043485183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005257369,0.00061472936,0.00047786685,0.0006750562,0.0005026227,0.00047675578,0.0012801217,0.00032136883,0.0021005403],"category_scores_gemma":[0.0011820068,0.00040662367,0.00032402753,0.0005583668,0.0003633115,0.00067818956,0.00051045325,0.00037697534,0.00041515983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017578511,0.000055767225,0.0012503965,0.000094066236,0.000030358071,0.00011087633,0.00013734399,0.8450713,0.026902024,0.0039327075,0.0015768739,0.120662495],"study_design_scores_gemma":[0.000019577563,0.00007877375,0.00040860195,0.000004666979,0.000011527235,0.000048064514,0.000028867145,0.98738885,0.0097517865,0.001143663,0.0011049247,0.000010682404],"about_ca_topic_score_codex":0.0052608424,"about_ca_topic_score_gemma":0.014936011,"teacher_disagreement_score":0.0052608424,"about_ca_system_score_codex":0.001078844,"about_ca_system_score_gemma":0.0007749083,"threshold_uncertainty_score":0.010460496},"labels":[],"label_agreement":null},{"id":"W2171697180","doi":"10.1109/glsv.1995.516024","title":"Optimizing wiring space in slicing floorplans","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Floorplan; Slicing; Computer science; Heuristic; Space (punctuation); Integrated circuit layout; Mirroring; Branch and bound; Mathematical optimization; Topology (electrical circuits); Algorithm; Parallel computing; Mathematics; Integrated circuit; Embedded system; Combinatorics; Artificial intelligence","score_opus":0.01400861194722146,"score_gpt":0.18702510514803822,"score_spread":0.17301649320081675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171697180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22449964,0.0017027083,0.7648124,0.00014253706,0.00003258037,0.0000992563,0.0002600665,0.002517461,0.0059333686],"genre_scores_gemma":[0.7068406,0.0007003486,0.2903114,0.000033764027,0.000016007312,0.0000734482,0.00039547117,0.00036029425,0.0012686084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946445,0.0001692649,0.000024773462,0.000067370995,0.00018069934,0.00009345557],"domain_scores_gemma":[0.999057,0.00058298063,0.000111754896,0.000092564514,0.000104688464,0.000051064606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513411,0.0010995347,0.0006816783,0.0006840224,0.0003786083,0.0006421696,0.00055309327,0.0002674716,0.0020541688],"category_scores_gemma":[0.0021075136,0.0004347872,0.00032544823,0.0008209817,0.00054378936,0.0013213917,0.0005468884,0.00038928905,0.00025380842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011451467,0.000031286247,0.0010503323,0.00010235196,0.000022091277,0.00007184861,0.0000876889,0.8586928,0.0124722915,0.0043419343,0.0007176562,0.12229519],"study_design_scores_gemma":[0.00003220728,0.00020891856,0.000662356,0.00002054015,0.000036946647,0.00010558317,0.00006498727,0.9745164,0.014603072,0.0072712596,0.0024628716,0.000014929405],"about_ca_topic_score_codex":0.0040427595,"about_ca_topic_score_gemma":0.007275368,"teacher_disagreement_score":0.0040427595,"about_ca_system_score_codex":0.00081297685,"about_ca_system_score_gemma":0.00085677,"threshold_uncertainty_score":0.008038402},"labels":[],"label_agreement":null},{"id":"W2172056907","doi":"10.1109/ccece.2011.6030638","title":"Using GPUs to accelerate FPGA wirelength estimate for use with complex search operators","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Field-programmable gate array; Very-large-scale integration; Algorithm; Routing (electronic design automation); Exploit; Embedded system","score_opus":0.2045496872603078,"score_gpt":0.3211113345375101,"score_spread":0.11656164727720231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172056907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08984847,0.00021988318,0.89991874,0.00016022492,0.000054186155,0.000048047677,0.000119273966,0.005120169,0.0045109508],"genre_scores_gemma":[0.3090309,0.00015471925,0.68646246,0.000066513785,0.000021132866,0.00006043882,0.00028445368,0.0003163149,0.0036030677],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998267,0.000035913075,0.000011425615,0.000025328463,0.00008235336,0.00001831282],"domain_scores_gemma":[0.999305,0.00025892077,0.00007483655,0.00017723687,0.00016105268,0.000023005916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861829,0.00056610926,0.00040353194,0.0006222889,0.0003117188,0.0007832663,0.0008763745,0.00037417354,0.0043196566],"category_scores_gemma":[0.0018605811,0.0002781492,0.00027344102,0.0008495908,0.00026351304,0.0010823853,0.00048745668,0.00053249515,0.0008083994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048734067,0.00011058393,0.0042923684,0.00016658595,0.000087008164,0.00021767429,0.00019191341,0.3013479,0.06533059,0.017971838,0.010549095,0.59924704],"study_design_scores_gemma":[0.000031461448,0.000049282397,0.00052955275,0.0000075548246,0.000008168643,0.00004309035,0.000018964682,0.97979486,0.013300279,0.003285042,0.0029237685,0.000007977157],"about_ca_topic_score_codex":0.005679985,"about_ca_topic_score_gemma":0.012453922,"teacher_disagreement_score":0.005679985,"about_ca_system_score_codex":0.0005586812,"about_ca_system_score_gemma":0.0006929942,"threshold_uncertainty_score":0.014450729},"labels":[],"label_agreement":null},{"id":"W2172219312","doi":"10.1109/newcas.2004.1359038","title":"Performance of probabilistic approaches to Steiner tree problem","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Heuristics; Computer science; Probabilistic logic; Heuristic; Class (philosophy); Tree (set theory); Mathematical optimization; Automation; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Engineering; Combinatorics","score_opus":0.06073061505041603,"score_gpt":0.22675602689848376,"score_spread":0.16602541184806774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172219312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49057576,0.011442202,0.45325148,0.0011989151,0.00032065608,0.00015395638,0.00071621663,0.0041508544,0.038189955],"genre_scores_gemma":[0.8946359,0.001873235,0.10056627,0.00013711372,0.000081820326,0.000083339764,0.0007045484,0.00019876129,0.0017191059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963258,0.0013327791,0.00015677631,0.0004949271,0.0013043996,0.00038540844],"domain_scores_gemma":[0.99213046,0.0054759816,0.00048487334,0.0008208605,0.0008814,0.00020636871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029048976,0.00080662576,0.0008028946,0.0012419127,0.00078748807,0.001324386,0.0016596422,0.0011784823,0.0030968853],"category_scores_gemma":[0.010845256,0.0003167481,0.00058594637,0.002048938,0.0006243745,0.0022392748,0.001141283,0.0008050282,0.00051930686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011105957,0.00017298936,0.0025232243,0.00028466043,0.00011400298,0.000050657556,0.000098810415,0.86431086,0.005183577,0.021639073,0.004029247,0.10048228],"study_design_scores_gemma":[0.000042371634,0.0002532556,0.0008332791,0.000018899396,0.000029599189,0.00010020536,0.000046794477,0.98631245,0.0032519544,0.00796081,0.0011306902,0.000019696692],"about_ca_topic_score_codex":0.002995643,"about_ca_topic_score_gemma":0.0025738876,"teacher_disagreement_score":0.0030968853,"about_ca_system_score_codex":0.0014394328,"about_ca_system_score_gemma":0.0017220925,"threshold_uncertainty_score":0.01536274},"labels":[],"label_agreement":null},{"id":"W2172234488","doi":"10.1145/1391469.1391671","title":"Automated transistor sizing for FPGA architecture exploration","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Sizing; Computer architecture; Routing (electronic design automation); Transistor; Architecture; Embedded system; Quality (philosophy); Logic synthesis; Logic gate; Engineering; Electrical engineering","score_opus":0.028053586477289134,"score_gpt":0.2232644264827875,"score_spread":0.19521084000549835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172234488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040897198,0.0003311621,0.9398672,0.00012714873,0.000021399066,0.000117566546,0.00029839986,0.013837804,0.0045020804],"genre_scores_gemma":[0.2504696,0.00021613194,0.7462515,0.000050010723,0.000011970417,0.00016934019,0.00047816918,0.00083275535,0.0015205368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946505,0.00016502907,0.000030184347,0.00006134443,0.00024050435,0.000037930196],"domain_scores_gemma":[0.9983827,0.0010167779,0.00013214278,0.00031070632,0.00013354789,0.000024184348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054589676,0.0009220809,0.00061228697,0.0008749461,0.00048072962,0.0006907561,0.0008020519,0.00044476174,0.005937736],"category_scores_gemma":[0.0022266845,0.00058771466,0.00062540895,0.0006594286,0.00037952166,0.000872117,0.0004962835,0.00060735515,0.00088137435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018840945,0.0000840522,0.001820219,0.0004021334,0.00006872642,0.00025815394,0.0002285264,0.3324156,0.10988508,0.014715936,0.0076045142,0.53232867],"study_design_scores_gemma":[0.00008243012,0.00015385088,0.0007302148,0.00003747851,0.000035740763,0.00025053497,0.00004840768,0.9214919,0.05112955,0.011864438,0.014135949,0.00003946141],"about_ca_topic_score_codex":0.001997974,"about_ca_topic_score_gemma":0.004150532,"teacher_disagreement_score":0.005937736,"about_ca_system_score_codex":0.00067138986,"about_ca_system_score_gemma":0.0013308751,"threshold_uncertainty_score":0.019863665},"labels":[],"label_agreement":null},{"id":"W2173609013","doi":"10.1155/2008/736203","title":"The Coarse-Grained/Fine-Grained Logic Interface in FPGAs with Embedded Floating-Point Arithmetic Units","year":2008,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Field-programmable gate array; Computer science; Interface (matter); Parallel computing; Floating point; Routing (electronic design automation); Point (geometry); Embedded system; Algorithm; Mathematics; Geometry","score_opus":0.020211464836332294,"score_gpt":0.2426125445848633,"score_spread":0.22240107974853102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173609013","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94398993,0.00041457766,0.048413422,0.00007288135,0.000010683342,0.0000776022,0.00008848819,0.00033496338,0.0065974146],"genre_scores_gemma":[0.9894232,0.00003730308,0.009930289,0.000016479456,0.0000019142162,0.00000969906,0.000050948813,0.000014977095,0.0005151983],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929607,0.00013543262,0.000053757238,0.00010318215,0.00029390186,0.00011764245],"domain_scores_gemma":[0.9967629,0.0016578083,0.0005716401,0.0004994404,0.0003768107,0.00013144637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072467903,0.0002488711,0.00015508157,0.00056595064,0.00027529013,0.0011017927,0.00051419437,0.00034612505,0.0024687685],"category_scores_gemma":[0.006452408,0.00019663229,0.00015570804,0.00048424426,0.0005768294,0.0016913475,0.00058839173,0.0003044899,0.00029770093],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029723493,0.0005423897,0.2381357,0.0007715796,0.00012469811,0.0016602473,0.0017421909,0.19894005,0.13867381,0.034145687,0.0013395179,0.3809518],"study_design_scores_gemma":[0.00019663095,0.002375649,0.34371084,0.0001798191,0.00020382731,0.0029985416,0.0029154983,0.4950273,0.1076014,0.026749678,0.017893648,0.0001472],"about_ca_topic_score_codex":0.0015978819,"about_ca_topic_score_gemma":0.00196686,"teacher_disagreement_score":0.0024687685,"about_ca_system_score_codex":0.00056364713,"about_ca_system_score_gemma":0.00029115347,"threshold_uncertainty_score":0.00825882},"labels":[],"label_agreement":null},{"id":"W2180689556","doi":"10.1007/s00453-011-9540-3","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Mathematics; Approximation algorithm; Discrete mathematics; Graph","score_opus":0.030268888774087295,"score_gpt":0.22878516744079802,"score_spread":0.19851627866671073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180689556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16723044,0.0073287515,0.7647532,0.011285871,0.00057757756,0.00037558982,0.0024430554,0.0015670322,0.044438463],"genre_scores_gemma":[0.61755335,0.007798628,0.3406321,0.001994906,0.0016804032,0.0007474419,0.006720613,0.0010846007,0.021787936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951568,0.0014480265,0.00029865562,0.00095455843,0.0013570699,0.0007848914],"domain_scores_gemma":[0.9768372,0.018111898,0.0012209408,0.0025309462,0.0006650725,0.000633951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033241576,0.0030296133,0.0036771514,0.002816103,0.00318263,0.0088481875,0.0069729057,0.0043551456,0.01592575],"category_scores_gemma":[0.02500708,0.0025473854,0.0037469189,0.0069112345,0.004709749,0.018906677,0.004863723,0.009685957,0.0023633083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002636412,0.0016510136,0.005567324,0.0024622998,0.0005791768,0.0005018717,0.0017176939,0.47610727,0.0054563577,0.29574788,0.046844933,0.16072778],"study_design_scores_gemma":[0.00035368814,0.0001807574,0.001313787,0.00014701077,0.0002468955,0.00040237128,0.00063815375,0.478265,0.0027130072,0.50828743,0.0073792804,0.000072584655],"about_ca_topic_score_codex":0.0031797725,"about_ca_topic_score_gemma":0.004277278,"teacher_disagreement_score":0.01592575,"about_ca_system_score_codex":0.003707545,"about_ca_system_score_gemma":0.0025859224,"threshold_uncertainty_score":0.053276896},"labels":[],"label_agreement":null},{"id":"W2184772890","doi":"","title":"A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs","year":2010,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Programmable Array Logic; Logic synthesis; Hierarchy; Computer architecture; Programmable logic device; Combinational logic; Data flow diagram; Parallel computing; Algorithm; Theoretical computer science; Computer engineering; Logic optimization; Logic gate; Embedded system","score_opus":0.009493425309748777,"score_gpt":0.22572680610396334,"score_spread":0.21623338079421456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184772890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032319326,0.000056481,0.9940398,0.000065628104,0.00000894407,0.00005264533,0.00012466956,0.0010406463,0.0013792145],"genre_scores_gemma":[0.029261995,0.00010913383,0.96747273,0.00005341128,0.000006648862,0.00012943163,0.00046618615,0.00028204868,0.0022183864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993888,0.00015335383,0.00008338315,0.000102931364,0.00021701664,0.00005443716],"domain_scores_gemma":[0.99944717,0.00027493748,0.00004337135,0.00011014066,0.00010336835,0.000020983118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935853,0.00059915625,0.0005010162,0.0010787485,0.0006818349,0.0016063863,0.0016679253,0.0007120981,0.004760325],"category_scores_gemma":[0.0019547988,0.00066030776,0.0011082523,0.0013241135,0.00090413616,0.0027314317,0.0014512235,0.0012546799,0.0012690676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015031883,0.0000763407,0.0005570091,0.00031426686,0.00003316647,0.0003091613,0.0008312085,0.1257156,0.009641823,0.45354304,0.011461492,0.39736664],"study_design_scores_gemma":[0.000069520094,0.00006293297,0.00010423092,0.00007557288,0.00002280538,0.00022916144,0.00017570618,0.8559629,0.008442971,0.0976015,0.03721806,0.00003459385],"about_ca_topic_score_codex":0.004189268,"about_ca_topic_score_gemma":0.0054215644,"teacher_disagreement_score":0.004760325,"about_ca_system_score_codex":0.0012284167,"about_ca_system_score_gemma":0.0011814727,"threshold_uncertainty_score":0.015924871},"labels":[],"label_agreement":null},{"id":"W2220797983","doi":"","title":"Distance domination and amplifier placement problems","year":2006,"lang":"en","type":"article","venue":"ANU Open Research (Australian National University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.08081579605710654,"score_gpt":0.3144525488639169,"score_spread":0.23363675280681034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220797983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16232547,0.0017479439,0.79438186,0.0018080958,0.00010669397,0.00023552445,0.0005377586,0.00028106046,0.038575497],"genre_scores_gemma":[0.8755819,0.0014999537,0.1013715,0.0003656026,0.00016881223,0.00023953161,0.0004864327,0.00010071812,0.020185571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.00029091284,0.000042020027,0.00021222813,0.00022659492,0.00018722298],"domain_scores_gemma":[0.997996,0.0013894656,0.00023515556,0.000090015004,0.00015680147,0.00013253487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073324854,0.0010535271,0.0006577461,0.00050720974,0.00068923837,0.0014204726,0.001556797,0.001295905,0.005730937],"category_scores_gemma":[0.0034208014,0.0003573237,0.00051032385,0.0012128078,0.0010480793,0.0022244195,0.0012924703,0.0009124116,0.00042670057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027108536,0.00020566874,0.0018711116,0.0005051098,0.0001028763,0.00077868643,0.00033496125,0.66912645,0.010722077,0.21383572,0.007499422,0.09474683],"study_design_scores_gemma":[0.00009636528,0.00024370108,0.0010706999,0.000052115924,0.00007055145,0.0012317898,0.000325064,0.75898415,0.0077107525,0.21504529,0.015135843,0.000033749064],"about_ca_topic_score_codex":0.001552158,"about_ca_topic_score_gemma":0.0015987349,"teacher_disagreement_score":0.005730937,"about_ca_system_score_codex":0.001003927,"about_ca_system_score_gemma":0.00060575636,"threshold_uncertainty_score":0.019171834},"labels":[],"label_agreement":null},{"id":"W2248178880","doi":"","title":"Proceedings of the 2007 international workshop on System level interconnect prediction","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"IBM; Interconnection; Computer science; Architecture; Implementation; Engineering; Telecommunications; Software engineering; History","score_opus":0.019970193540213746,"score_gpt":0.22229727023138987,"score_spread":0.2023270766911761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248178880","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022471085,0.039066136,0.6886797,0.030977964,0.0612117,0.0007899181,0.006605772,0.015260451,0.1349373],"genre_scores_gemma":[0.1492629,0.042642172,0.26655245,0.0091128955,0.020694433,0.0012910137,0.031959813,0.006263649,0.47222066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875605,0.00026944635,0.000076969925,0.00024887294,0.0004955584,0.00015320617],"domain_scores_gemma":[0.9979448,0.00051701855,0.00006999902,0.00034801022,0.0008185077,0.00030179005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022613776,0.0013867333,0.0011761984,0.0009768337,0.00085666764,0.003408445,0.0022184479,0.0015964229,0.040403016],"category_scores_gemma":[0.003771323,0.0006443451,0.000952684,0.0010005602,0.0006444133,0.003254938,0.0017666842,0.003352537,0.018505247],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030165692,0.00017058007,0.00071147864,0.0002967766,0.00005836392,0.00018713699,0.00014824126,0.012135975,0.0040706876,0.014568853,0.7425759,0.22477435],"study_design_scores_gemma":[0.000058599093,0.0002028199,0.0010641242,0.0002248292,0.00006140289,0.000311722,0.00015404126,0.059037883,0.005950422,0.022649907,0.91023415,0.000050031347],"about_ca_topic_score_codex":0.002079271,"about_ca_topic_score_gemma":0.002635731,"teacher_disagreement_score":0.040403016,"about_ca_system_score_codex":0.0010914563,"about_ca_system_score_gemma":0.0019952527,"threshold_uncertainty_score":0.13516152},"labels":[],"label_agreement":null},{"id":"W2281941492","doi":"10.1109/reconfig.2015.7393356","title":"Scalable analytic placement for FPGA on GPGPU","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Scalability; Parallel computing; Placement; Routing (electronic design automation); Critical path method; Path (computing); Gate array; Embedded system; Physical design; Circuit design","score_opus":0.03932186761777701,"score_gpt":0.2565174618796524,"score_spread":0.2171955942618754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281941492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048786078,0.00035228574,0.93131715,0.0002624002,0.0000915509,0.000103140694,0.00012813353,0.009433528,0.009525751],"genre_scores_gemma":[0.2550638,0.00029717994,0.73971623,0.00010223953,0.000029740915,0.00012619118,0.00034614888,0.0004887565,0.0038296888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976224,0.000038853454,0.000011607462,0.000038484242,0.00011020523,0.000038635084],"domain_scores_gemma":[0.99974114,0.000079851234,0.000028637949,0.00006424769,0.000066646215,0.000019487876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024606482,0.0007773668,0.000520786,0.0006102235,0.00062002894,0.0007979327,0.0009477828,0.0004753556,0.0043581943],"category_scores_gemma":[0.00096557057,0.0003756013,0.00044065455,0.00074880355,0.00042941942,0.00069998327,0.00081872236,0.0005899146,0.0013295067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025635934,0.000070104834,0.0012284254,0.00020219528,0.000047773025,0.00035285653,0.00019627533,0.602968,0.023163745,0.027118072,0.015853196,0.32854307],"study_design_scores_gemma":[0.000048838603,0.00007131889,0.00019110131,0.000009862561,0.000010219141,0.0000952402,0.00005565992,0.9754342,0.006376782,0.00936031,0.008336736,0.000009786817],"about_ca_topic_score_codex":0.0063937106,"about_ca_topic_score_gemma":0.009455889,"teacher_disagreement_score":0.0063937106,"about_ca_system_score_codex":0.0008251246,"about_ca_system_score_gemma":0.001244132,"threshold_uncertainty_score":0.014579654},"labels":[],"label_agreement":null},{"id":"W2283189482","doi":"10.1109/fpt.2015.7393136","title":"HETRIS: Adaptive floorplanning for heterogeneous FPGAs","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Floorplan; Field-programmable gate array; Scalability; Computer science; Control reconfiguration; Computer architecture; Embedded system; Parallel computing","score_opus":0.05768860992558055,"score_gpt":0.2488131203642336,"score_spread":0.19112451043865303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283189482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031478193,0.00022045142,0.9515995,0.000059224923,0.000033856493,0.00012250173,0.00027475104,0.011457153,0.004754427],"genre_scores_gemma":[0.30955714,0.00019037383,0.6850571,0.00005632455,0.000014343615,0.00016327435,0.00077441416,0.0011668792,0.0030200747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.000085221,0.000030029378,0.00007158037,0.00018716491,0.000053489675],"domain_scores_gemma":[0.9992982,0.00037392907,0.00008785943,0.00012448698,0.00008052759,0.000034944635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055804465,0.0006943174,0.00030761285,0.00068344927,0.00033518774,0.00057757733,0.00093605975,0.0003063371,0.0059071924],"category_scores_gemma":[0.0012926137,0.0003326252,0.00052695954,0.00034641934,0.0004055067,0.00071258453,0.0007553437,0.0006067574,0.00054175337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025147834,0.000082663966,0.002189601,0.00030445642,0.00008046055,0.00039860408,0.000281304,0.52496487,0.05856468,0.014498102,0.0071281795,0.39125556],"study_design_scores_gemma":[0.000078849225,0.00019394826,0.0010692648,0.000034916866,0.000026283487,0.00023848764,0.00006396345,0.9318059,0.04272028,0.007609523,0.016121238,0.00003728597],"about_ca_topic_score_codex":0.0030160546,"about_ca_topic_score_gemma":0.008376385,"teacher_disagreement_score":0.0059071924,"about_ca_system_score_codex":0.00048734446,"about_ca_system_score_gemma":0.0007896676,"threshold_uncertainty_score":0.019761503},"labels":[],"label_agreement":null},{"id":"W2289241984","doi":"10.1109/rsp.2015.7416557","title":"Hard block reduction and synthesis improvements in Odin II","year":2015,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Netlist; Computer science; Verilog; Field-programmable gate array; Block (permutation group theory); Reduction (mathematics); Computer architecture; For loop; Embedded system; Routing (electronic design automation); Abstract syntax tree; Tree (set theory); Gate array; Programming language; Computer hardware; Loop (graph theory); Parsing","score_opus":0.022120522314660877,"score_gpt":0.21504763624582604,"score_spread":0.19292711393116516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289241984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20642583,0.001397781,0.70209855,0.0005163639,0.00035711547,0.00047533793,0.0012828006,0.010129799,0.07731647],"genre_scores_gemma":[0.44096726,0.0005297445,0.52101386,0.0004097848,0.00007104787,0.00017509564,0.0025753733,0.001797884,0.032459922],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993954,0.00007471644,0.000051076735,0.00009801576,0.00028953116,0.00009127461],"domain_scores_gemma":[0.9994879,0.00013536279,0.00005226919,0.0001471805,0.00015576655,0.00002157614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003278458,0.0008551898,0.00036400938,0.000776162,0.0003788031,0.0010160247,0.00068958855,0.00021073474,0.0071608555],"category_scores_gemma":[0.0009468407,0.00030224895,0.00046341724,0.0005070067,0.00024635025,0.00080151326,0.0007198313,0.00063711044,0.0012463542],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073797116,0.00026153532,0.0016117281,0.00068333984,0.000039585313,0.0005376127,0.0003707501,0.054568447,0.2921977,0.025259271,0.008908858,0.6148233],"study_design_scores_gemma":[0.00021719608,0.0008500858,0.0036047045,0.00012873561,0.00014782698,0.0010172395,0.00019814441,0.22979522,0.50471807,0.01272607,0.24651954,0.000077178884],"about_ca_topic_score_codex":0.0015059557,"about_ca_topic_score_gemma":0.0037834279,"teacher_disagreement_score":0.0071608555,"about_ca_system_score_codex":0.0007162385,"about_ca_system_score_gemma":0.0008357502,"threshold_uncertainty_score":0.023955405},"labels":[],"label_agreement":null},{"id":"W2289721043","doi":"10.14288/1.0073893","title":"A power evaluation framework for FPGA applications and CAD experimentation","year":2013,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"CAD; Computer science; Field-programmable gate array; Power (physics); Engineering; Engineering drawing; Embedded system","score_opus":0.010194416734755428,"score_gpt":0.20984990429816006,"score_spread":0.19965548756340462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289721043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062157254,0.00012825956,0.98834026,0.00013088672,0.000027735909,0.0002783797,0.00029345808,0.00604959,0.0041298373],"genre_scores_gemma":[0.022324305,0.00033197674,0.9711652,0.00011523788,0.00004295514,0.0011088023,0.0010247402,0.0012200292,0.0026667665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99569595,0.0015867737,0.000414249,0.00043537593,0.0016122581,0.00025542782],"domain_scores_gemma":[0.99564016,0.0020956146,0.000267369,0.00093315524,0.00093767996,0.00012604073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091337,0.0020931181,0.0010628251,0.0028040905,0.00094818755,0.003141235,0.0035060318,0.0016119581,0.014329485],"category_scores_gemma":[0.010689803,0.00093784294,0.0021386193,0.0016736727,0.0014372434,0.0028229388,0.0025419754,0.0023575008,0.0038316317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014380422,0.0004132657,0.001633663,0.0011226297,0.00011857204,0.000501268,0.00051052286,0.2313299,0.012465672,0.38753292,0.03384407,0.33038378],"study_design_scores_gemma":[0.000109747874,0.0002203478,0.00053316215,0.00047145243,0.000058261365,0.00045893338,0.00014781154,0.67590576,0.010557532,0.15370007,0.15773302,0.00010391582],"about_ca_topic_score_codex":0.004144724,"about_ca_topic_score_gemma":0.0052556694,"teacher_disagreement_score":0.014329485,"about_ca_system_score_codex":0.0015247952,"about_ca_system_score_gemma":0.0024471902,"threshold_uncertainty_score":0.047936916},"labels":[],"label_agreement":null},{"id":"W2293375234","doi":"10.1145/2847263.2847319","title":"Low-Swing Signaling for FPGA Power Reduction (Abstract Only)","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Overhead (engineering); Swing; Reduction (mathematics); Routing (electronic design automation); Energy consumption; Interconnection; Efficient energy use; Computer hardware; Engineering; Electrical engineering; Telecommunications","score_opus":0.012451481615193908,"score_gpt":0.22461752298963253,"score_spread":0.21216604137443862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293375234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33609912,0.0030219706,0.58578277,0.001022753,0.00053736474,0.0001547764,0.0005607541,0.011431027,0.061389472],"genre_scores_gemma":[0.917947,0.0008183607,0.06141008,0.00019886642,0.00009947801,0.00002746041,0.0003382828,0.0002665114,0.01889403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991906,0.0000113761425,0.0000066143534,0.000013560335,0.000035650075,0.000013781276],"domain_scores_gemma":[0.99987066,0.000023735736,0.000023248116,0.00003112146,0.00004344898,0.00000772202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006699404,0.00035038716,0.00011887942,0.00027997466,0.00017167268,0.0004702799,0.00040182544,0.00015049163,0.0154079925],"category_scores_gemma":[0.00020103923,0.00010297626,0.00015030289,0.00033254086,0.00010543299,0.00043415677,0.00020434766,0.00020249344,0.0020543574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032574544,0.00008557615,0.0015752516,0.0004932043,0.00004838323,0.00031473377,0.00007966015,0.015322281,0.43113005,0.015336896,0.016463239,0.518825],"study_design_scores_gemma":[0.0001208016,0.001188211,0.0029310535,0.00010117077,0.00013547121,0.0012332025,0.000081824786,0.1808307,0.6999227,0.008598035,0.104821116,0.000035711913],"about_ca_topic_score_codex":0.00037212382,"about_ca_topic_score_gemma":0.0012892209,"teacher_disagreement_score":0.0154079925,"about_ca_system_score_codex":0.00020591551,"about_ca_system_score_gemma":0.00021811287,"threshold_uncertainty_score":0.051544845},"labels":[],"label_agreement":null},{"id":"W2299845815","doi":"","title":"Area optimizations in fpga architecture and cad","year":2005,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Multiplexer; Embedded system; Routing (electronic design automation); Static random-access memory; Flexibility (engineering); Gate array; Computer architecture; Computer hardware; Multiplexing","score_opus":0.00656325611663158,"score_gpt":0.1908285388090456,"score_spread":0.18426528269241402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299845815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057797875,0.0094104465,0.8381779,0.0010282872,0.00025608033,0.00015579144,0.00016240073,0.002501103,0.09051006],"genre_scores_gemma":[0.32691234,0.0062263263,0.64032495,0.0003720681,0.00020483066,0.00017043001,0.00036166195,0.00038425426,0.0250431],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992142,0.00015186031,0.00005528666,0.0000986765,0.0004032639,0.00007676451],"domain_scores_gemma":[0.9994012,0.0002453943,0.00004914715,0.00013649162,0.0001546573,0.000013100165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044831156,0.00053144834,0.00031402215,0.00093695434,0.00028692384,0.0010330874,0.0007185651,0.00032362866,0.0046023536],"category_scores_gemma":[0.0015355663,0.00028755286,0.0003200904,0.0011591606,0.00033151841,0.001329118,0.0004335728,0.0006241561,0.0011549598],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012568725,0.000049849627,0.0010836608,0.0003056798,0.000026781268,0.00019371038,0.00010810147,0.08348109,0.02939235,0.11003132,0.0076348856,0.7675668],"study_design_scores_gemma":[0.00014155678,0.00064782694,0.0041102115,0.00024217778,0.00012862713,0.0018771933,0.00024450844,0.44267482,0.09798496,0.11930438,0.33253536,0.000108505745],"about_ca_topic_score_codex":0.0010753291,"about_ca_topic_score_gemma":0.0020983815,"teacher_disagreement_score":0.0046023536,"about_ca_system_score_codex":0.00065513415,"about_ca_system_score_gemma":0.00048172407,"threshold_uncertainty_score":0.015396357},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Graph; Space partitioning; Vertex (graph theory); Algorithm; Theoretical computer science","score_opus":0.0057559873206896065,"score_gpt":0.165789516692164,"score_spread":0.1600335293714744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301743601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017252395,0.0015630064,0.66955554,0.0010181352,0.00091597886,0.0004892748,0.0028863624,0.051552355,0.254767],"genre_scores_gemma":[0.155492,0.0012640739,0.54878825,0.00087121665,0.0001595604,0.0004044976,0.010018055,0.006759912,0.2762425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949086,0.000049824892,0.00002531981,0.00013316827,0.00023931827,0.000061428844],"domain_scores_gemma":[0.9995421,0.00006643276,0.00002120512,0.0001831965,0.00013674253,0.00005031278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165445,0.0007336564,0.0005107598,0.0010209973,0.0009231182,0.0017417422,0.0016602095,0.0008015404,0.05232141],"category_scores_gemma":[0.0010906226,0.0004097563,0.00054192304,0.00080649,0.00040085346,0.0016354681,0.0017246068,0.0010220172,0.024482267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059697934,0.00013100794,0.0013405731,0.00036329063,0.000053074542,0.0004232337,0.00024565982,0.015933475,0.029905856,0.057839938,0.13914907,0.75401783],"study_design_scores_gemma":[0.00008980252,0.0001861433,0.0011117611,0.00007617205,0.000027939675,0.0007978191,0.00012440918,0.08816254,0.024279835,0.017291823,0.8677877,0.00006403474],"about_ca_topic_score_codex":0.0030208689,"about_ca_topic_score_gemma":0.005101326,"teacher_disagreement_score":0.05232141,"about_ca_system_score_codex":0.0007756401,"about_ca_system_score_gemma":0.00082139566,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2313156072","doi":"10.5121/ijdps.2012.3607","title":"Implementation of Network Community Profile using Local Spectral algorithm and its application in Community Networking","year":2012,"lang":"en","type":"article","venue":"International Journal of Distributed and Parallel systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Algorithm","score_opus":0.025726424227720417,"score_gpt":0.29558177104358424,"score_spread":0.2698553468158638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313156072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02471177,0.00006242199,0.97265947,0.0001452917,0.000021823591,0.00010035444,0.00006244533,0.00093607954,0.0013003729],"genre_scores_gemma":[0.34281683,0.00007419977,0.6551231,0.00005527331,0.000030141446,0.00020474654,0.0002494384,0.00011544562,0.0013307962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981108,0.0007583343,0.00008681184,0.00030877252,0.0005939997,0.00014132052],"domain_scores_gemma":[0.9944607,0.0023988895,0.00051926036,0.0008419229,0.0014429085,0.00033643257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035623685,0.0005124972,0.0008115871,0.003466341,0.0012615613,0.0016945332,0.002172639,0.00094887894,0.0023764365],"category_scores_gemma":[0.013830817,0.00027929028,0.0005812379,0.002035154,0.00081348437,0.0028203242,0.0016914256,0.000818523,0.0007093266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039463866,0.00056058983,0.015242125,0.00026181893,0.00013847982,0.00016384773,0.0010352562,0.23304836,0.015066862,0.094983086,0.0044984496,0.6346064],"study_design_scores_gemma":[0.000018641565,0.0000702665,0.00083515147,0.000013993799,0.000009843727,0.00013909902,0.00018349133,0.9796814,0.0044795284,0.013221391,0.0013296003,0.00001770383],"about_ca_topic_score_codex":0.0031229625,"about_ca_topic_score_gemma":0.0035473222,"teacher_disagreement_score":0.0035623685,"about_ca_system_score_codex":0.0011756155,"about_ca_system_score_gemma":0.0014223149,"threshold_uncertainty_score":0.018839896},"labels":[],"label_agreement":null},{"id":"W2336236367","doi":"10.1145/2899381","title":"Eh?Placer","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Chinese University of Hong Kong; University of Hong Kong; Alberta Innovates - Technology Futures","keywords":"Placer mining; Computer science; Variety (cybernetics); Process (computing); Physical design; Focus (optics); Margin (machine learning); Industrial engineering; Geology; Artificial intelligence; Programming language; Integrated circuit; Machine learning","score_opus":0.015155866589129945,"score_gpt":0.21903710167187923,"score_spread":0.20388123508274927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336236367","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076861368,0.0006671055,0.9506609,0.00041196088,0.00027864752,0.00018346148,0.0008316903,0.016282814,0.02299725],"genre_scores_gemma":[0.16932596,0.0008834017,0.7987484,0.0005502161,0.00016180893,0.00018714005,0.0028164552,0.002994806,0.024331817],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898213,0.0001493256,0.00006996962,0.00022851402,0.00040916714,0.00016075178],"domain_scores_gemma":[0.9989291,0.00032967026,0.00007839823,0.0003952378,0.00022453448,0.000043056174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084043917,0.001197911,0.0010587389,0.0008332974,0.0007650495,0.0017059385,0.002458283,0.0012607318,0.029957322],"category_scores_gemma":[0.0027049105,0.0004958393,0.0012694147,0.0009408299,0.00065744127,0.0020933792,0.003003706,0.0011625738,0.010390888],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040235292,0.00011862451,0.0010463671,0.0009879811,0.00008346779,0.00038966135,0.00017058862,0.1262206,0.011114105,0.08982289,0.06451672,0.7051266],"study_design_scores_gemma":[0.00020055006,0.00039089596,0.00075325684,0.00018872053,0.00008021058,0.001175981,0.00027277632,0.6324929,0.038782015,0.13585912,0.1897023,0.00010130559],"about_ca_topic_score_codex":0.00174091,"about_ca_topic_score_gemma":0.0030721258,"teacher_disagreement_score":0.9700427,"about_ca_system_score_codex":0.0006608992,"about_ca_system_score_gemma":0.0011545093,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2405015892","doi":"10.1090/conm/588/11713","title":"Using graph partitioning for efficient network modularity optimization","year":2013,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Modularity (biology); Mathematics; Graph; Graph partition; Theoretical computer science; Combinatorics; Computer science; Biology; Evolutionary biology","score_opus":0.040738291521766744,"score_gpt":0.26554876489335394,"score_spread":0.2248104733715872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405015892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021702336,0.00032961395,0.9723025,0.0002685555,0.00004023305,0.00015888762,0.00021842406,0.0013620125,0.0036175111],"genre_scores_gemma":[0.21132204,0.0003175954,0.7832748,0.00014699264,0.000040627383,0.0003689477,0.0010537273,0.0008518785,0.0026233764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857545,0.0005749681,0.000049876147,0.00031364697,0.00033980628,0.0001461586],"domain_scores_gemma":[0.9975762,0.0014539812,0.00020063895,0.0003722385,0.0002894703,0.00010757501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017288498,0.002300628,0.0012474789,0.0024822082,0.001182838,0.0015064584,0.0015738913,0.0013209783,0.003435561],"category_scores_gemma":[0.007902037,0.0009307985,0.001332784,0.0020843619,0.0009890915,0.0031570226,0.0022284172,0.0012917966,0.0011091512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000212091,0.00018848803,0.0013320928,0.00037991803,0.00015009544,0.00018100184,0.00028853095,0.75423455,0.015623365,0.0419921,0.007291443,0.17812632],"study_design_scores_gemma":[0.00004111003,0.00004804893,0.00021934813,0.000023153587,0.000031722382,0.00007184158,0.000060953887,0.94103074,0.004238605,0.05133108,0.0028911214,0.000012334573],"about_ca_topic_score_codex":0.0044924556,"about_ca_topic_score_gemma":0.007314014,"teacher_disagreement_score":0.0044924556,"about_ca_system_score_codex":0.0019333703,"about_ca_system_score_gemma":0.001746451,"threshold_uncertainty_score":0.0140275955},"labels":[],"label_agreement":null},{"id":"W2481354194","doi":"10.1109/ipdpsw.2016.16","title":"Parallel Graph Partitioning on a CPU-GPU Architecture","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Computer science; Parallel computing; Architecture; Graph; Computer architecture; Theoretical computer science","score_opus":0.009441816210775193,"score_gpt":0.2002424908063714,"score_spread":0.19080067459559621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481354194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23934326,0.0007947042,0.7110435,0.000604343,0.00019007757,0.00017602452,0.00050940504,0.017002309,0.030336337],"genre_scores_gemma":[0.54395324,0.00023235152,0.4452459,0.00016458797,0.000027742744,0.0001684901,0.00081544777,0.00035802918,0.009034319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980634,0.00003316835,0.000011651873,0.000052116982,0.000059105463,0.00003760557],"domain_scores_gemma":[0.99978286,0.00004506545,0.000012811981,0.00007190672,0.000060229348,0.000027254553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015728726,0.00039740588,0.00041184103,0.0005022584,0.0005559566,0.00077592954,0.0012111634,0.00039231675,0.0057083047],"category_scores_gemma":[0.00052462635,0.0002698311,0.00034551483,0.00074382656,0.00028258475,0.00068925245,0.0007304045,0.000513909,0.001203059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010068618,0.00038770834,0.0041998536,0.00034762765,0.00016839939,0.00057049736,0.0004562669,0.3212045,0.15351018,0.038539298,0.03211241,0.44749638],"study_design_scores_gemma":[0.00010060725,0.0001431679,0.0010588283,0.000010872268,0.000022097485,0.00013136357,0.0000673299,0.9526722,0.020658758,0.00793328,0.017182771,0.000018769424],"about_ca_topic_score_codex":0.006167165,"about_ca_topic_score_gemma":0.010290394,"teacher_disagreement_score":0.006167165,"about_ca_system_score_codex":0.0008432311,"about_ca_system_score_gemma":0.0008103305,"threshold_uncertainty_score":0.019096196},"labels":[],"label_agreement":null},{"id":"W2508502534","doi":"10.1109/isvlsi.2016.23","title":"Routing-Aware Incremental Timing-Driven Placement","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Placement; Routing (electronic design automation); Computer science; CONTEST; Static timing analysis; Network routing; Physical design; Computer network; Embedded system; Circuit design","score_opus":0.01736856733150907,"score_gpt":0.22469682497569854,"score_spread":0.20732825764418947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508502534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052587662,0.00030590824,0.9371212,0.00013393587,0.00012277257,0.00017179086,0.00012890564,0.0030698061,0.006358],"genre_scores_gemma":[0.5822514,0.00032388474,0.41065553,0.00016168512,0.000061113526,0.00013692469,0.0005307299,0.00032931368,0.005549463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958986,0.000058082336,0.000022708611,0.000046282195,0.00022678365,0.000056295437],"domain_scores_gemma":[0.99936324,0.00014653517,0.000099269295,0.00015831299,0.00019614275,0.000036569945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032294102,0.00072008895,0.00036368368,0.0007122403,0.00035750022,0.00049605104,0.0011775094,0.00035635606,0.0025734385],"category_scores_gemma":[0.0012346314,0.00030307047,0.0004225486,0.0005549428,0.00024508798,0.00063040084,0.0007565417,0.00044045842,0.00048897776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024019084,0.00015839397,0.0023026238,0.0002433937,0.000054813278,0.00040164505,0.0001019999,0.45458457,0.12110404,0.00881661,0.006542871,0.40544885],"study_design_scores_gemma":[0.000051341965,0.00038159368,0.0012365292,0.000015378284,0.000045767163,0.00046757134,0.000049316404,0.94161934,0.042422872,0.0055755135,0.008101608,0.000033115593],"about_ca_topic_score_codex":0.0013148993,"about_ca_topic_score_gemma":0.0050401627,"teacher_disagreement_score":0.0025734385,"about_ca_system_score_codex":0.0004721419,"about_ca_system_score_gemma":0.0012656238,"threshold_uncertainty_score":0.008608997},"labels":[],"label_agreement":null},{"id":"W2514038949","doi":"10.1109/iscas.2016.7527478","title":"Efficient ILP-based variant-grid analog router","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Router; Computer science; Routing (electronic design automation); Static routing; Policy-based routing; Integer programming; Linear programming; Link-state routing protocol; Equal-cost multi-path routing; Multipath routing; Computer network; Distributed computing; Routing protocol; Algorithm","score_opus":0.006799162086376307,"score_gpt":0.1844894108303515,"score_spread":0.17769024874397518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514038949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01521362,0.00017418688,0.9789851,0.00011452502,0.000031359723,0.000044760276,0.000046807378,0.0012578419,0.004131862],"genre_scores_gemma":[0.45372927,0.00014170981,0.5418207,0.00017534022,0.000026339574,0.00009695543,0.00018471341,0.00010739769,0.0037175838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.00006964731,0.000023130871,0.00006942628,0.000096289616,0.000057362584],"domain_scores_gemma":[0.99965286,0.0001295333,0.000044739474,0.0000748863,0.00007919555,0.000018822258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104879,0.0005701182,0.0005499714,0.00049645174,0.00038594363,0.0008857758,0.0011443845,0.00051934127,0.0040950337],"category_scores_gemma":[0.000806527,0.0002437508,0.00035694326,0.0005247704,0.000341235,0.0008147548,0.0006687142,0.0005981147,0.00056756556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024280205,0.00011052551,0.0009811381,0.0001705683,0.00004190489,0.00022818639,0.00010179854,0.6964286,0.024273615,0.01818011,0.005918358,0.2533224],"study_design_scores_gemma":[0.000016860586,0.000036743197,0.00006069959,0.000003610233,0.00000993272,0.000042943102,0.000013921563,0.9933883,0.003148927,0.0020832797,0.0011898372,0.0000049685177],"about_ca_topic_score_codex":0.0020564497,"about_ca_topic_score_gemma":0.0030618284,"teacher_disagreement_score":0.0040950337,"about_ca_system_score_codex":0.0006340236,"about_ca_system_score_gemma":0.00077046134,"threshold_uncertainty_score":0.013699293},"labels":[],"label_agreement":null},{"id":"W2517156619","doi":"10.1109/fccm.2016.43","title":"An Empirical Analysis of the Fidelity of VPR Area Models","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Adder; Computer science; Multiplexer; Point (geometry); Fidelity; Multiplexing; Mathematics; Latency (audio); Telecommunications","score_opus":0.03698574710576573,"score_gpt":0.2757968774740671,"score_spread":0.23881113036830137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517156619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774497,0.001568367,0.30891988,0.00055309676,0.00006325717,0.00018646491,0.0015110236,0.0016191126,0.00812919],"genre_scores_gemma":[0.9701901,0.00027592262,0.027716849,0.000054877295,0.0000152186285,0.00006808292,0.0008096756,0.00024111588,0.0006281176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914731,0.0034319002,0.00057520584,0.0012479296,0.0028975804,0.00037417386],"domain_scores_gemma":[0.88425416,0.088440455,0.006308375,0.015171724,0.005519827,0.00030541694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011103129,0.000745502,0.0006476766,0.0015060495,0.0004361092,0.0014036963,0.0017959304,0.0011886152,0.0018650442],"category_scores_gemma":[0.09195742,0.000807147,0.00079856406,0.0010922108,0.0009462752,0.0031041661,0.0012079995,0.0014578855,0.00046611505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003039368,0.00005952891,0.026815325,0.00017822323,0.00014083378,0.00020292719,0.00030842237,0.92468953,0.0036379513,0.0043477835,0.00073023245,0.038585242],"study_design_scores_gemma":[0.000025022437,0.0003274242,0.011978912,0.000082369595,0.00006217127,0.00074113265,0.0001474047,0.97108173,0.00846131,0.0035529986,0.0034855437,0.000054047385],"about_ca_topic_score_codex":0.004152742,"about_ca_topic_score_gemma":0.0026123172,"teacher_disagreement_score":0.011103129,"about_ca_system_score_codex":0.0014723703,"about_ca_system_score_gemma":0.00055962,"threshold_uncertainty_score":0.058719635},"labels":[],"label_agreement":null},{"id":"W2520963437","doi":"10.1109/hpcsim.2016.7568334","title":"Metis-CIC: A new mesh partitioning heuristic for parallel preconditioned iterative methods in CFD","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry; National Natural Science Foundation of China","keywords":"Computer science; Metis; Parallel computing; Graph partition; Computational fluid dynamics; Iterative method; Rate of convergence; Mathematical optimization; Convergence (economics); Linear system; Heuristic; Algorithm; Graph; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.032146468942669856,"score_gpt":0.33349344940318465,"score_spread":0.3013469804605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520963437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030326294,0.0004384651,0.9642491,0.00011223159,0.00008205997,0.0001371626,0.000086728665,0.001304587,0.0032633515],"genre_scores_gemma":[0.25353447,0.00021374082,0.7431292,0.000088295055,0.000051996856,0.00031237217,0.00036108788,0.0005058926,0.0018030374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00013502785,0.000028418328,0.00005477494,0.00021423568,0.000064054395],"domain_scores_gemma":[0.99926335,0.00033782658,0.000071993585,0.00010302156,0.0001732794,0.000050510447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061538006,0.0007182964,0.00082873786,0.00093079265,0.00071607815,0.00070285326,0.0012530849,0.0006909226,0.0015355846],"category_scores_gemma":[0.0023287758,0.00033946615,0.00055175193,0.0008371765,0.0005554916,0.0007978612,0.0010427262,0.0007443208,0.00033768668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678866,0.000097957956,0.0014233903,0.00020949417,0.000071662645,0.00013068467,0.00017481689,0.7405717,0.015271856,0.017131122,0.004810042,0.21983941],"study_design_scores_gemma":[0.000022668984,0.000042963446,0.00016228699,0.000008286859,0.000007687759,0.00003783369,0.000019096557,0.9920596,0.00395939,0.0018808295,0.0017907515,0.000008573935],"about_ca_topic_score_codex":0.0039013398,"about_ca_topic_score_gemma":0.00624293,"teacher_disagreement_score":0.0039013398,"about_ca_system_score_codex":0.00078330626,"about_ca_system_score_gemma":0.0014217496,"threshold_uncertainty_score":0.0077572465},"labels":[],"label_agreement":null},{"id":"W2524902150","doi":"10.1109/fpl.2016.7577325","title":"An evaluation on the accuracy of the minimum width transistor area models in ranking the layout area of FPGA architectures","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Adder; Multiplexer; Computer science; Field-programmable gate array; Ranking (information retrieval); Artificial intelligence; Computer hardware; Multiplexing","score_opus":0.044407031306817585,"score_gpt":0.25365957023683466,"score_spread":0.20925253893001708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524902150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61528075,0.0026738425,0.3657605,0.00037832197,0.00013597768,0.00011010653,0.0010002919,0.004166003,0.0104942415],"genre_scores_gemma":[0.9100227,0.0004432104,0.08727752,0.00005524505,0.000017993829,0.000053009662,0.00054039026,0.0002595218,0.0013304767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759346,0.00085035455,0.00013743751,0.00027827316,0.0009880018,0.00015237805],"domain_scores_gemma":[0.98710024,0.008505011,0.0009101379,0.0018429325,0.0015476246,0.00009397539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002618295,0.0010475297,0.00059257075,0.0018153033,0.0003226299,0.0011457386,0.0014095005,0.00071623473,0.0016859391],"category_scores_gemma":[0.015503421,0.00043513192,0.00080356165,0.0010123637,0.00034501712,0.0016487389,0.00050602277,0.0004753527,0.00045766064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038631939,0.00005354434,0.01051162,0.00016128257,0.00011093174,0.00008741953,0.00008825444,0.87707734,0.010566875,0.0019029493,0.0008584801,0.098195],"study_design_scores_gemma":[0.000018130975,0.0003351211,0.0043054093,0.0000437058,0.00005070924,0.00015769819,0.00005824354,0.97745013,0.01477525,0.001053974,0.0017195425,0.000032006177],"about_ca_topic_score_codex":0.004548188,"about_ca_topic_score_gemma":0.006085411,"teacher_disagreement_score":0.004548188,"about_ca_system_score_codex":0.0010791153,"about_ca_system_score_gemma":0.0007149718,"threshold_uncertainty_score":0.013847053},"labels":[],"label_agreement":null},{"id":"W2525927134","doi":"10.1109/fpl.2016.7577358","title":"Model-based optimization of High Level Synthesis directives","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Field-programmable gate array; Directive; High-level synthesis; Design space exploration; Process (computing); Datapath; Abstraction layer; Construct (python library); Computer architecture; Variety (cybernetics); Design flow; Abstraction; Embedded system; Programming language; Software; Artificial intelligence","score_opus":0.023727555119895428,"score_gpt":0.20607732414602595,"score_spread":0.1823497690261305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525927134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08247458,0.00016723662,0.9061345,0.00010297363,0.000035274592,0.000091447,0.00013768938,0.0032295538,0.007626746],"genre_scores_gemma":[0.6772269,0.000119649914,0.3188272,0.00007511818,0.000010512892,0.00017465983,0.0002760005,0.0005303841,0.0027595328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991379,0.00027767196,0.000038509683,0.000113075876,0.0003268145,0.00010598646],"domain_scores_gemma":[0.9990221,0.0005182914,0.00011161711,0.00017159984,0.00015314107,0.000023201554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009059005,0.0009853152,0.00048539013,0.00072248036,0.00032174654,0.0008335682,0.0008458569,0.0004528694,0.0035799348],"category_scores_gemma":[0.0024915636,0.00057677145,0.0008640066,0.00046252794,0.00050005934,0.0008077098,0.0005987187,0.0007733256,0.0006130712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012610524,0.00008291491,0.0011723923,0.00010713564,0.000022302327,0.000042368785,0.000050900224,0.92089343,0.016521182,0.006192859,0.0008489554,0.053939458],"study_design_scores_gemma":[0.000016980948,0.000046007255,0.00009431914,0.000005464609,0.000008128682,0.000011407409,0.000010018819,0.9910501,0.0057989755,0.0019987978,0.0009559299,0.0000037787715],"about_ca_topic_score_codex":0.0025487477,"about_ca_topic_score_gemma":0.005828312,"teacher_disagreement_score":0.0035799348,"about_ca_system_score_codex":0.00091521605,"about_ca_system_score_gemma":0.001524973,"threshold_uncertainty_score":0.011976123},"labels":[],"label_agreement":null},{"id":"W2527244689","doi":"10.1109/fpl.2016.7577326","title":"The speed of diversity: Exploring complex FPGA routing topologies for the global metal layer","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Routing (electronic design automation); Interconnection; Computer science; Field-programmable gate array; Layer (electronics); Topology (electrical circuits); Electronic engineering; Materials science; Embedded system; Engineering; Electrical engineering; Computer network; Nanotechnology","score_opus":0.1897463588851081,"score_gpt":0.2843065463874937,"score_spread":0.0945601875023856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527244689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.927777,0.00024395339,0.06077767,0.00014470007,0.000011296017,0.000022546288,0.00007577639,0.00016051566,0.010786521],"genre_scores_gemma":[0.94864565,0.00023536415,0.05012117,0.000021248183,0.0000048801608,0.00002431843,0.00006702697,0.000030794632,0.000849478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994457,0.000020378922,0.0000017002732,0.000010840487,0.000012012562,0.000010527311],"domain_scores_gemma":[0.9997806,0.00013198222,0.000026500109,0.000032106043,0.00002046245,0.0000084027715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001894627,0.00040963266,0.00015580918,0.00027859057,0.00018946468,0.00047952664,0.0002786373,0.00027310464,0.00077901565],"category_scores_gemma":[0.0005932305,0.0001745738,0.00023771006,0.0002091264,0.00027053073,0.00071161275,0.00029289437,0.0002470081,0.00010008423],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001004875,0.00006017218,0.003016165,0.00010357701,0.000023153842,0.00020308598,0.00013186893,0.915328,0.027661093,0.009963744,0.00042467803,0.042983968],"study_design_scores_gemma":[0.000024444724,0.00025115183,0.0010580514,0.000014247784,0.000023385144,0.00013332813,0.00010195273,0.9758655,0.012002833,0.008316089,0.002196516,0.000012461697],"about_ca_topic_score_codex":0.000534487,"about_ca_topic_score_gemma":0.0011803539,"teacher_disagreement_score":0.00077901565,"about_ca_system_score_codex":0.00028403092,"about_ca_system_score_gemma":0.00020930496,"threshold_uncertainty_score":0.0026060343},"labels":[],"label_agreement":null},{"id":"W2532502681","doi":"10.1109/tic-sth.2009.5444435","title":"A comparison of hardware acceleration methods for VLSI Maze routing","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Speedup; Computer science; Hardware acceleration; Software; Parallel computing; Very-large-scale integration; Routing (electronic design automation); Computer hardware; Acceleration; Path (computing); Embedded system; Field-programmable gate array; Computer architecture; Operating system","score_opus":0.07467330716448682,"score_gpt":0.41918760334419114,"score_spread":0.3445142961797043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532502681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14250661,0.013244397,0.7903371,0.0003587281,0.00042190411,0.00023117977,0.00024695214,0.008822359,0.043830752],"genre_scores_gemma":[0.46128628,0.0048303464,0.5169323,0.00011684685,0.00010059772,0.00016073462,0.0005532379,0.00035804868,0.015661662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961495,0.00005883464,0.00002093313,0.000037600916,0.00021430495,0.00005336487],"domain_scores_gemma":[0.9995364,0.00016502071,0.000037690224,0.00007868843,0.00015726605,0.000025011936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028844608,0.0008312917,0.0003660737,0.0014386278,0.00024434182,0.0004945773,0.0010802319,0.0003854882,0.007100206],"category_scores_gemma":[0.0011310041,0.00024024055,0.00046988935,0.0017360193,0.00015317048,0.00073679886,0.0002574734,0.00031772983,0.001237104],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006381185,0.00013863255,0.00097153796,0.00052141753,0.000087793065,0.000094650146,0.00005847476,0.038386434,0.040670592,0.0076629343,0.004931899,0.9058374],"study_design_scores_gemma":[0.0005151462,0.0031417543,0.008379392,0.00020513545,0.0002296455,0.0019056156,0.00017575422,0.74268514,0.13189647,0.0064801034,0.1042299,0.00015602206],"about_ca_topic_score_codex":0.0012475045,"about_ca_topic_score_gemma":0.002278654,"teacher_disagreement_score":0.007100206,"about_ca_system_score_codex":0.0005065531,"about_ca_system_score_gemma":0.0005314813,"threshold_uncertainty_score":0.02375251},"labels":[],"label_agreement":null},{"id":"W2533618188","doi":"","title":"Deterministic, Weak-scaling Parallelism for Wirelength- and Timing-driven FPGA Placement, Suitable for Multicore and Manycore Architectures","year":2015,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Strong","keywords":"Parallel computing; Parallelism (grammar); Field-programmable gate array; Scaling; Computer science; Multi-core processor; Computer architecture; Computational science; Embedded system; Mathematics","score_opus":0.023731692589929295,"score_gpt":0.24518031155717868,"score_spread":0.22144861896724938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533618188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029058544,0.0006013786,0.9604145,0.00032467183,0.00011416019,0.000114761875,0.000087224835,0.0010411771,0.0082435915],"genre_scores_gemma":[0.4125507,0.00071386824,0.5791238,0.0002506708,0.000095982025,0.00035164825,0.0002816504,0.00033064457,0.006301046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994867,0.00007793159,0.000027825607,0.00010211064,0.0002617083,0.000043745982],"domain_scores_gemma":[0.99901986,0.0003070443,0.00017890276,0.00029995365,0.00015118446,0.00004308309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042342232,0.000575979,0.00033197165,0.0004340136,0.0004843135,0.00066788425,0.0009435788,0.00044108724,0.0023310804],"category_scores_gemma":[0.0022402809,0.0003171908,0.000478194,0.00074846967,0.00063028606,0.00078447565,0.00059053506,0.0009319778,0.0010127838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018994955,0.00023183961,0.0029636698,0.0006634723,0.00006263603,0.00024224725,0.00016117995,0.368592,0.087888874,0.13359256,0.006714657,0.39869705],"study_design_scores_gemma":[0.000044928598,0.00029380087,0.0013244884,0.000044336273,0.000024874595,0.00029717793,0.000037353086,0.8701203,0.033911373,0.074166566,0.019709283,0.000025620817],"about_ca_topic_score_codex":0.00079854764,"about_ca_topic_score_gemma":0.002712491,"teacher_disagreement_score":0.0023310804,"about_ca_system_score_codex":0.00083122164,"about_ca_system_score_gemma":0.0012371453,"threshold_uncertainty_score":0.0077982545},"labels":[],"label_agreement":null},{"id":"W2536590467","doi":"10.1109/icm.2011.6177347","title":"A new hardware abstraction-based framework to cope with analog design challenges","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Abstraction; Microelectronics; Variety (cybernetics); Context (archaeology); Computer architecture; Wireless; Electronic design automation; Reliability (semiconductor); Design process; Design technology; Design methods; Process (computing); Embedded system; Systems engineering; Telecommunications; Engineering; Work in process; Electrical engineering","score_opus":0.06364044899990705,"score_gpt":0.22509007569813036,"score_spread":0.16144962669822333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536590467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008738388,0.00036406913,0.99520063,0.00020847896,0.00006364582,0.000042230924,0.000027953109,0.000422866,0.0027962187],"genre_scores_gemma":[0.035692472,0.0009436467,0.9577776,0.0002563358,0.0001458304,0.00020049654,0.0001252319,0.00017424741,0.0046841605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859923,0.0003655281,0.00015817658,0.00018838598,0.00055887783,0.0001297075],"domain_scores_gemma":[0.9989716,0.0003080566,0.00008415585,0.00036619414,0.00021261672,0.000057360958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180048,0.0012045542,0.00077820796,0.0011762151,0.0009623804,0.00273195,0.0027475017,0.0011843042,0.0045455396],"category_scores_gemma":[0.0022804574,0.00066196674,0.0015317416,0.0010233612,0.0017341528,0.00319735,0.002135898,0.0028983818,0.0015827081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072998744,0.000062966676,0.00046110852,0.0005606595,0.00007464048,0.00044384314,0.0005866163,0.08303067,0.017233167,0.6868831,0.00645917,0.20413105],"study_design_scores_gemma":[0.0000837586,0.00031555071,0.0002350113,0.0003627027,0.00019304725,0.0013036836,0.00014114537,0.3525614,0.013071109,0.3360666,0.29557878,0.00008713536],"about_ca_topic_score_codex":0.0014005196,"about_ca_topic_score_gemma":0.0021374342,"teacher_disagreement_score":0.0045455396,"about_ca_system_score_codex":0.00076811505,"about_ca_system_score_gemma":0.0018969136,"threshold_uncertainty_score":0.015206337},"labels":[],"label_agreement":null},{"id":"W2547196265","doi":"10.1109/icaci.2012.6463129","title":"Performance analysis of the graph-partitioning algorithms used in OpenFOAM","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Polygon mesh; Graph partition; Parallel computing; Execution time; Overhead (engineering); Load balancing (electrical power); Metis; Algorithm; Distributed computing; Graph; Theoretical computer science; Mathematics; Operating system; Computer graphics (images)","score_opus":0.016344447999904133,"score_gpt":0.22717134385647356,"score_spread":0.2108268958565694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547196265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90842843,0.0005544128,0.076206475,0.0001649384,0.00006309805,0.00011379496,0.00044726668,0.004186826,0.009834744],"genre_scores_gemma":[0.9262148,0.00018086733,0.07103482,0.00003564751,0.000008687942,0.000067782894,0.0010524333,0.00022540471,0.0011795651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992078,0.00015489881,0.000052459065,0.00012248386,0.00029555528,0.00016690292],"domain_scores_gemma":[0.99804485,0.00096900144,0.00014185347,0.0002923134,0.00046589025,0.000086081964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135713,0.00070831,0.0004445041,0.0008556418,0.00066598406,0.0006519324,0.0010566174,0.00050931354,0.00215545],"category_scores_gemma":[0.0031212945,0.00020800464,0.00034393667,0.001239845,0.00039049552,0.001191697,0.00052164873,0.00042003472,0.0003020125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017939509,0.0003699419,0.013224353,0.00047097082,0.00017240667,0.000239098,0.0004106388,0.62342805,0.07185331,0.007656668,0.0047152904,0.27566537],"study_design_scores_gemma":[0.000061235274,0.00021290577,0.0041646617,0.00000974555,0.000022857763,0.00008266704,0.000100950085,0.95251334,0.039963,0.0010322792,0.0018122974,0.00002403842],"about_ca_topic_score_codex":0.011549666,"about_ca_topic_score_gemma":0.009302803,"teacher_disagreement_score":0.011549666,"about_ca_system_score_codex":0.0012253684,"about_ca_system_score_gemma":0.0009839779,"threshold_uncertainty_score":0.022964835},"labels":[],"label_agreement":null},{"id":"W2553967290","doi":"","title":"On Pin-to-wire Routing in FPGAs","year":2012,"lang":"en","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Field-programmable gate array; Routing (electronic design automation); Engineering; Computer science; Electrical engineering; Embedded system","score_opus":0.013613438925035385,"score_gpt":0.29796324605193175,"score_spread":0.2843498071268964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553967290","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26956803,0.01577715,0.6217682,0.0011384382,0.00036336287,0.0001175342,0.00015139203,0.0007447102,0.09037121],"genre_scores_gemma":[0.7980256,0.021725686,0.15221518,0.0003675653,0.0002063444,0.00006432085,0.00019094914,0.00019451446,0.027009923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970883,0.000054031752,0.00001146628,0.000037046164,0.00014753811,0.000041032145],"domain_scores_gemma":[0.9997819,0.00012269715,0.000024542003,0.000030374278,0.000033904962,0.0000066029847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021661448,0.00043525908,0.0001936584,0.00052761164,0.00023732304,0.00048392446,0.00030303205,0.00026942496,0.0029892696],"category_scores_gemma":[0.0008396779,0.00016777476,0.00013266227,0.00094350096,0.00035007478,0.0009345627,0.00023684088,0.0003335102,0.00047149652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024178292,0.00009837732,0.0026913546,0.00036912964,0.000039062445,0.0005624721,0.00019419653,0.40171373,0.051873717,0.1157205,0.004740069,0.4217556],"study_design_scores_gemma":[0.000044281358,0.0009911945,0.004937677,0.00027146353,0.000055649325,0.0013389251,0.00023883459,0.71205777,0.09799779,0.1122364,0.069749355,0.00008066701],"about_ca_topic_score_codex":0.00095685944,"about_ca_topic_score_gemma":0.0018179147,"teacher_disagreement_score":0.0029892696,"about_ca_system_score_codex":0.0003893473,"about_ca_system_score_gemma":0.00016672001,"threshold_uncertainty_score":0.01000005},"labels":[],"label_agreement":null},{"id":"W2560928762","doi":"10.1109/cicc.1988.20786","title":"Integration of algorithmic VLSI synthesis with testability incorporation","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Testability; Very-large-scale integration; Computer science; Design for testing; Tree (set theory); High-level synthesis; Computer engineering; Computer architecture; Algorithm; Theoretical computer science; Reliability engineering; Mathematics; Embedded system; Engineering","score_opus":0.00949885690245675,"score_gpt":0.18655112771892474,"score_spread":0.177052270816468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560928762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005736026,0.00019477644,0.9804612,0.0001164002,0.00003908143,0.000053919004,0.00002145384,0.0011352815,0.012241892],"genre_scores_gemma":[0.21250525,0.00050429476,0.7822476,0.00017198098,0.00007341032,0.00012366835,0.00019886982,0.00038768232,0.0037872207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877983,0.00033360638,0.000072159135,0.000115273906,0.00057878875,0.0001203067],"domain_scores_gemma":[0.9983222,0.00084563793,0.00013259034,0.0003462593,0.00032733625,0.000025895944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072311435,0.00079113,0.00050747715,0.0012156484,0.00031983416,0.001209577,0.0012625405,0.000483536,0.003896723],"category_scores_gemma":[0.0035946493,0.00044525682,0.00076597335,0.00077483,0.0007250583,0.0012535219,0.000761607,0.000730306,0.0009808686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009624812,0.00010239045,0.00084570464,0.0004388592,0.00007329283,0.00027255676,0.000112704605,0.26365125,0.04415666,0.20293322,0.0015355967,0.4857815],"study_design_scores_gemma":[0.00005677939,0.0005069402,0.0005891762,0.00016899592,0.00010823147,0.0005460934,0.000061114224,0.76897955,0.052353624,0.13443366,0.042153448,0.000042401472],"about_ca_topic_score_codex":0.0011722412,"about_ca_topic_score_gemma":0.0018754819,"teacher_disagreement_score":0.003896723,"about_ca_system_score_codex":0.00059930014,"about_ca_system_score_gemma":0.0010637788,"threshold_uncertainty_score":0.013035834},"labels":[],"label_agreement":null},{"id":"W2562600912","doi":"10.1109/cicc.1991.164142","title":"Optimal synthesis of high performance architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Key (lock); Integer programming; Interconnection; Mathematical optimization; Linear programming; Interface (matter); Computer architecture; Distributed computing; Parallel computing; Computer network; Algorithm; Operating system; Mathematics","score_opus":0.007987585156057598,"score_gpt":0.17327746363008986,"score_spread":0.16528987847403226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562600912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135112,0.00021889668,0.97549427,0.00011668991,0.000031992156,0.00003696722,0.00006941243,0.00032661768,0.010193957],"genre_scores_gemma":[0.45260674,0.0006291039,0.53973585,0.00011681897,0.00003529211,0.00021037302,0.00027239046,0.00021044849,0.006182845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996301,0.00008428146,0.000018851866,0.000057048735,0.00014388122,0.00006592371],"domain_scores_gemma":[0.9997576,0.00011193442,0.000037039918,0.000037091104,0.000043904856,0.000012498093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040968403,0.00054172263,0.00037330133,0.000331846,0.00028510718,0.0007785826,0.00046699695,0.00042317377,0.003077413],"category_scores_gemma":[0.0011870165,0.00035013768,0.0004621716,0.00044092495,0.00054786005,0.0007100729,0.00048136583,0.0006445266,0.00040024193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029918032,0.000019476262,0.00010333487,0.00011212871,0.000011473671,0.000052511845,0.00005293308,0.8581252,0.01026004,0.092599496,0.0012109133,0.037422467],"study_design_scores_gemma":[0.000018556344,0.00004774518,0.000053292762,0.000015000479,0.000009192577,0.000021189766,0.00001951739,0.9563798,0.004247458,0.03483215,0.004350684,0.0000054326892],"about_ca_topic_score_codex":0.0015912139,"about_ca_topic_score_gemma":0.0028386402,"teacher_disagreement_score":0.003077413,"about_ca_system_score_codex":0.0007711705,"about_ca_system_score_gemma":0.0013175957,"threshold_uncertainty_score":0.010294974},"labels":[],"label_agreement":null},{"id":"W2578575989","doi":"10.1145/3039902.3039907","title":"An Improved Overlay and Mapping Algorithm Supporting Rapid Triggering for FPGA Debug","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Debugging; Overlay; Field-programmable gate array; Computer science; Observability; Embedded system; Background debug mode interface; Software; TRACE (psycholinguistics); Computer hardware; Real-time computing; Operating system","score_opus":0.015100499825445566,"score_gpt":0.2633789226388761,"score_spread":0.24827842281343052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578575989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068166114,0.00017893496,0.91759604,0.0001300607,0.00006716419,0.00015441878,0.00008517769,0.008849894,0.0047721025],"genre_scores_gemma":[0.39714184,0.000091393194,0.5992902,0.000076162156,0.000020139742,0.00010232224,0.00017429436,0.00038384405,0.0027198081],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968135,0.0000585467,0.000024165813,0.000055587756,0.00011642857,0.00006391092],"domain_scores_gemma":[0.9993993,0.00018531339,0.00006558946,0.00017093081,0.00013277035,0.000046032525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035154837,0.00064383406,0.00030103794,0.0006867887,0.0004227069,0.00057957746,0.0007076167,0.00045078716,0.003998639],"category_scores_gemma":[0.0017531979,0.00024958185,0.00027184602,0.0004019101,0.00032853227,0.0009493216,0.00075144775,0.0005629832,0.000866617],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070851075,0.00021590179,0.0036925913,0.000238414,0.000040860046,0.0006345388,0.00039550583,0.09837909,0.25415,0.022873893,0.008815184,0.60985553],"study_design_scores_gemma":[0.00014595891,0.0008281502,0.0016959512,0.00003748449,0.000041802574,0.0008916918,0.00016009322,0.7712841,0.18857606,0.009636509,0.026638014,0.00006424254],"about_ca_topic_score_codex":0.001252075,"about_ca_topic_score_gemma":0.00213911,"teacher_disagreement_score":0.003998639,"about_ca_system_score_codex":0.00046061157,"about_ca_system_score_gemma":0.00094709505,"threshold_uncertainty_score":0.013376772},"labels":[],"label_agreement":null},{"id":"W2588897393","doi":"10.1109/aspdac.2017.7858368","title":"Parasitic-aware GP-based many-objective sizing methodology for analog and RF integrated circuits","year":2017,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Economic Affairs","keywords":"Parasitic extraction; Sizing; Computer science; Heuristic; Geometric programming; CMOS; Electronic engineering; Electronic circuit; Analogue electronics; Process (computing); Computer engineering; Convex optimization; Regular polygon; Computer architecture; Engineering; Electrical engineering; Mathematics; Artificial intelligence; Machine learning","score_opus":0.07764127263365753,"score_gpt":0.3247736203931772,"score_spread":0.24713234775951967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588897393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009812163,0.000094169816,0.98778313,0.000044617907,0.0000094480565,0.000026233442,0.000019296951,0.00017258055,0.0020383247],"genre_scores_gemma":[0.40685278,0.00017488364,0.58959806,0.00010060715,0.000021108142,0.00022572895,0.00014605749,0.00018113363,0.0026996902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997836,0.0000610974,0.000006777843,0.0000288544,0.00009943026,0.000020235537],"domain_scores_gemma":[0.9997286,0.00015588701,0.00002696407,0.000022962087,0.000057861056,0.000007657136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048856984,0.0006917801,0.0004905538,0.0005180153,0.00025528032,0.0004179613,0.0009151323,0.00055295596,0.001846822],"category_scores_gemma":[0.000784223,0.00039067314,0.0007046611,0.00050209183,0.00036270468,0.00053927884,0.00047949486,0.00073153584,0.00023266574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010991907,0.00001608816,0.00020777882,0.000041972893,0.000024209827,0.00002552465,0.00002332023,0.94893414,0.00393849,0.005076992,0.0002982255,0.04140225],"study_design_scores_gemma":[0.0000028328081,0.000014657258,0.000048416237,0.0000023728437,0.0000048819916,0.000009392802,0.0000031405827,0.9977028,0.0006408695,0.0012317251,0.00033724768,0.0000017886958],"about_ca_topic_score_codex":0.001970268,"about_ca_topic_score_gemma":0.003008176,"teacher_disagreement_score":0.001970268,"about_ca_system_score_codex":0.0004952186,"about_ca_system_score_gemma":0.0008588871,"threshold_uncertainty_score":0.0061782002},"labels":[],"label_agreement":null},{"id":"W2593282265","doi":"10.1109/mwscas.2016.7869975","title":"Experimental evaluation and comparison of time-multiplexed multi-FPGA routing architectures","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Computer science; Multiplexing; Benchmark (surveying); Routing (electronic design automation); Electronic circuit; Logic synthesis; Time-division multiplexing; Logic gate; Parallel computing; Embedded system; Computer hardware; Algorithm; Engineering; Electrical engineering","score_opus":0.03631318421026875,"score_gpt":0.31575396757101515,"score_spread":0.2794407833607464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593282265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985748,0.00023627044,0.010349615,0.000032469085,0.00003430001,0.000057513735,0.00025066498,0.0004246878,0.002866532],"genre_scores_gemma":[0.9867713,0.0001475814,0.011321801,0.000008316394,0.000006506369,0.00005457643,0.0002639276,0.000033921875,0.0013920136],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996834,0.00006746259,0.00002536019,0.000058570105,0.00009057952,0.000074652206],"domain_scores_gemma":[0.999057,0.00026110478,0.0001375343,0.00017818334,0.0002981154,0.00006808779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041532825,0.0005726222,0.00026545013,0.00073347293,0.00021445789,0.00024769342,0.00063882873,0.00029058222,0.0027765594],"category_scores_gemma":[0.00087143586,0.00012138286,0.00016772549,0.0007681787,0.00021444808,0.00046775007,0.00021014782,0.00015423096,0.00024115187],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017713087,0.00094668387,0.0044724555,0.00095864275,0.00013734536,0.00050738413,0.00017825635,0.16427623,0.72228026,0.0022264966,0.0014443144,0.10080055],"study_design_scores_gemma":[0.00012880059,0.010713886,0.012497076,0.000028945702,0.00011745649,0.00044334357,0.0002010353,0.1953831,0.7760692,0.00053294486,0.0038454293,0.000038786304],"about_ca_topic_score_codex":0.00089710474,"about_ca_topic_score_gemma":0.0010946781,"teacher_disagreement_score":0.0027765594,"about_ca_system_score_codex":0.00040265216,"about_ca_system_score_gemma":0.00019268718,"threshold_uncertainty_score":0.009288549},"labels":[],"label_agreement":null},{"id":"W2598631327","doi":"10.1145/2990299.2990305","title":"Automatic detection and elision of reset sub-circuits","year":2016,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Verilog; Computer science; Reset (finance); Field-programmable gate array; Routing (electronic design automation); Electronic circuit; Embedded system; Hardware description language; Application-specific integrated circuit; Computer hardware; Electrical engineering; Engineering","score_opus":0.008464199203003852,"score_gpt":0.20043207918533745,"score_spread":0.1919678799823336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598631327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26669782,0.00062801654,0.7060092,0.0001637808,0.000113346854,0.00027427208,0.00026747255,0.019987425,0.0058585918],"genre_scores_gemma":[0.7609702,0.00022838758,0.23088564,0.00033618265,0.000022953755,0.00011563219,0.00055463053,0.0012771675,0.0056092143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906486,0.00012988498,0.00007946043,0.00020094047,0.00041461983,0.00011035229],"domain_scores_gemma":[0.99764913,0.0012468133,0.00038389722,0.00039203098,0.00028927624,0.00003890178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051916606,0.0008057645,0.0004623805,0.0010893211,0.00022960608,0.00091173936,0.0013656906,0.00037796856,0.0040661176],"category_scores_gemma":[0.0030947705,0.0003233656,0.00038247305,0.00034501415,0.0004275591,0.00089142146,0.0007635367,0.00061686954,0.0005575909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089723675,0.00016091173,0.0076502822,0.00063540303,0.00006945005,0.00092133647,0.00036411942,0.029353164,0.36346447,0.008850682,0.0029420059,0.584691],"study_design_scores_gemma":[0.000086326516,0.00048042243,0.004559949,0.00008203796,0.0000723073,0.0011183511,0.00009959004,0.25034645,0.7273723,0.0037308782,0.011998139,0.00005315563],"about_ca_topic_score_codex":0.0005756143,"about_ca_topic_score_gemma":0.0012029117,"teacher_disagreement_score":0.0040661176,"about_ca_system_score_codex":0.00051294244,"about_ca_system_score_gemma":0.0007276471,"threshold_uncertainty_score":0.013602495},"labels":[],"label_agreement":null},{"id":"W2604877941","doi":"10.1145/3024063","title":"Synthesizable Standard Cell FPGA Fabrics Targetable by the Verilog-to-Routing CAD Flow","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Verilog; Computer science; FPGA prototype; Bitstream; Embedded system; Routing (electronic design automation); Application-specific integrated circuit; Standard cell; Reconfigurable computing; Computer architecture; Computer hardware; Integrated circuit; Algorithm; Operating system","score_opus":0.012995821058801689,"score_gpt":0.21814816057302946,"score_spread":0.2051523395142278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604877941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06632529,0.00025129566,0.90985084,0.000112699905,0.00008981638,0.00026817876,0.0007045625,0.0067224824,0.015674872],"genre_scores_gemma":[0.49987158,0.00041028624,0.49230528,0.00013838164,0.000021088199,0.0002890908,0.0009504462,0.00080744823,0.0052064015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997392,0.00005448129,0.00001901242,0.00002997447,0.000121013545,0.000036263336],"domain_scores_gemma":[0.9995067,0.0002177272,0.00005362713,0.00012000164,0.000092184026,0.000009759391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041591324,0.00054506277,0.0001890841,0.0003077906,0.00020190023,0.0005314266,0.0006353517,0.00028785595,0.0054044747],"category_scores_gemma":[0.0010559703,0.00020425669,0.00034074447,0.00015839514,0.0002661516,0.00046385408,0.00022625289,0.00039194743,0.00092874974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002888936,0.00017676706,0.0023198517,0.0010980412,0.00007943465,0.00079095125,0.00021397852,0.4892213,0.19029309,0.08004429,0.007360955,0.2281125],"study_design_scores_gemma":[0.00011066847,0.00037802567,0.000695051,0.000094391115,0.0000634261,0.0005339351,0.000056765613,0.70210326,0.23155273,0.014658094,0.04972442,0.000029334155],"about_ca_topic_score_codex":0.0012293145,"about_ca_topic_score_gemma":0.0026071996,"teacher_disagreement_score":0.0054044747,"about_ca_system_score_codex":0.0005240841,"about_ca_system_score_gemma":0.00078299025,"threshold_uncertainty_score":0.018079758},"labels":[],"label_agreement":null},{"id":"W2611347473","doi":"10.1109/rsp.2014.6966904","title":"System-on-chip processor using different FPGA architectures in the VTR CAD flow","year":2014,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Field-programmable gate array; Adder; Verilog; Computer science; Embedded system; Block (permutation group theory); Routing (electronic design automation); Design flow; Computer architecture; Computer hardware; FPGA prototype; Electronic design automation; Logic synthesis; Logic gate","score_opus":0.02149867666359571,"score_gpt":0.24139686002116073,"score_spread":0.21989818335756503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611347473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15582083,0.0006679047,0.79382783,0.00024638197,0.00015123593,0.00070936355,0.00056607,0.010392213,0.037618153],"genre_scores_gemma":[0.55141103,0.00048078154,0.43196028,0.0002356296,0.00001736331,0.00036452035,0.0007286573,0.00074072724,0.014061109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00014870823,0.000036249003,0.000080817576,0.00019570216,0.000063780084],"domain_scores_gemma":[0.9994615,0.00024942856,0.00003712006,0.00014995251,0.00008793405,0.00001406474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062268553,0.0005578041,0.0002526611,0.00038972514,0.00019005255,0.0007538624,0.00057184306,0.00034725774,0.01097143],"category_scores_gemma":[0.0013180131,0.00020688848,0.00020339206,0.00039463112,0.00025040295,0.0005935763,0.00030827077,0.00045650842,0.0015630241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008265011,0.00028438942,0.0023014748,0.0008224126,0.00007150469,0.0007880229,0.00034365794,0.10129561,0.22319338,0.039253104,0.008947946,0.621872],"study_design_scores_gemma":[0.0003898123,0.002599377,0.005185887,0.00025353863,0.000114635855,0.0017242403,0.00018833677,0.34221897,0.45584399,0.017129911,0.17422737,0.00012393828],"about_ca_topic_score_codex":0.0006397049,"about_ca_topic_score_gemma":0.001119117,"teacher_disagreement_score":0.01097143,"about_ca_system_score_codex":0.000364621,"about_ca_system_score_gemma":0.0004756253,"threshold_uncertainty_score":0.03670305},"labels":[],"label_agreement":null},{"id":"W2612563535","doi":"10.1109/tvlsi.2017.2691409","title":"Leveraging Unused Resources for Energy Optimization of FPGA Interconnect","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dynamic demand; Equal-cost multi-path routing; Interconnection; Routing (electronic design automation); Static routing; Electronic engineering; Computer network; Engineering; Power (physics); Routing protocol; Physics","score_opus":0.017562840011441167,"score_gpt":0.23286284547607924,"score_spread":0.21530000546463807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612563535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65032625,0.0033726105,0.32642627,0.00041372934,0.00010222132,0.00003459044,0.00014583551,0.0010640781,0.018114282],"genre_scores_gemma":[0.9723263,0.00042308363,0.025024092,0.00005577,0.000015807753,0.000015140402,0.000055038683,0.00007892029,0.0020058216],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998634,0.000021286203,0.0000107759915,0.000022169854,0.000044006254,0.000038392896],"domain_scores_gemma":[0.99977237,0.00006783939,0.00005962811,0.00005290497,0.000036494315,0.00001086696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015611523,0.00050596654,0.00018298844,0.00047014697,0.00023219749,0.00075390004,0.0007215219,0.00019722263,0.0017888781],"category_scores_gemma":[0.00043092665,0.00017524858,0.0001738706,0.00041956131,0.00027037578,0.0012421263,0.00036997985,0.00021664525,0.00027015468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004143478,0.00013708849,0.003789541,0.00032556712,0.00009740936,0.0004775406,0.00013980817,0.33934963,0.43555942,0.022097671,0.0017048441,0.19590718],"study_design_scores_gemma":[0.000054347693,0.0009165482,0.002865079,0.00005994111,0.00012786876,0.0004502382,0.00012712984,0.6882332,0.2851474,0.007236232,0.014728814,0.00005315961],"about_ca_topic_score_codex":0.00053178304,"about_ca_topic_score_gemma":0.0027282422,"teacher_disagreement_score":0.0017888781,"about_ca_system_score_codex":0.00046349454,"about_ca_system_score_gemma":0.00044186664,"threshold_uncertainty_score":0.0059844255},"labels":[],"label_agreement":null},{"id":"W2617507377","doi":"10.4236/ajor.2017.73014","title":"System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction","year":2017,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Polygon (computer graphics); Computation; Reliability (semiconductor); Algorithm; Reduction (mathematics); Computer science; Series (stratigraphy); Mathematical optimization; Node (physics); Process (computing); Mathematics; Theoretical computer science","score_opus":0.08582483862008403,"score_gpt":0.4240188789983182,"score_spread":0.3381940403782342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617507377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040066443,0.000071569375,0.95731527,0.000035932335,0.0000075293847,0.000026585503,0.000029727084,0.000113210204,0.0023338275],"genre_scores_gemma":[0.84931654,0.0002441539,0.14902237,0.00001194014,0.000015483229,0.00006650257,0.00008568761,0.000060195915,0.0011771321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.00014716476,0.000013499066,0.00003572514,0.00014937467,0.000034937293],"domain_scores_gemma":[0.998836,0.0008237787,0.00010956839,0.000099442,0.00011252254,0.00001878243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084872625,0.00054786267,0.0006175781,0.00085513847,0.00026091828,0.00047527766,0.0005705,0.00027359955,0.0011459356],"category_scores_gemma":[0.003718517,0.00021899205,0.0005937441,0.0006030213,0.000792094,0.0007932157,0.00042771627,0.00045019903,0.00012760979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001119674,0.0000032740209,0.00018195825,0.000013643954,0.000005474207,0.000020854108,0.000011349485,0.9875349,0.00053499965,0.0071166237,0.000049664555,0.0045160577],"study_design_scores_gemma":[7.962429e-7,0.000009747703,0.000043539894,0.0000011680382,0.0000021674632,0.000006686796,0.0000033567446,0.99712604,0.00030754556,0.002418341,0.00007933179,0.0000013616011],"about_ca_topic_score_codex":0.003897684,"about_ca_topic_score_gemma":0.002840714,"teacher_disagreement_score":0.003897684,"about_ca_system_score_codex":0.0008216673,"about_ca_system_score_gemma":0.0006853395,"threshold_uncertainty_score":0.0077500343},"labels":[],"label_agreement":null},{"id":"W2619603071","doi":"10.1145/3035464","title":"A Fast Hierarchical Adaptive Analog Routing Algorithm Based on Integer Linear Programming","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Multipath routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Routing (electronic design automation); Dynamic Source Routing; Integer programming; Distributed computing; Algorithm; Computer network; Routing protocol","score_opus":0.022845966572676617,"score_gpt":0.2574228208277125,"score_spread":0.23457685425503588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619603071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028827884,0.000087383094,0.9946713,0.000061619336,0.000019073203,0.000028029483,0.000019579513,0.0005885141,0.0016418234],"genre_scores_gemma":[0.11236536,0.0001402109,0.8842909,0.00014362369,0.000033410535,0.00016254793,0.00016543933,0.00015441833,0.0025442145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.0000690061,0.0000195771,0.00008778184,0.00011215792,0.000050597235],"domain_scores_gemma":[0.9996953,0.00015317093,0.00004070277,0.000026292568,0.00006818915,0.000016328415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046983204,0.0008816482,0.00082478934,0.0007291718,0.00042404135,0.0009005573,0.0012094894,0.0006577812,0.004342258],"category_scores_gemma":[0.0009774044,0.0005003175,0.00064038043,0.00083563675,0.00032685618,0.0010207628,0.00080865866,0.0012112684,0.0007963489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011585132,0.00009797747,0.00037722327,0.000117580814,0.000039802784,0.000085205356,0.00005908851,0.67334896,0.008855174,0.013206185,0.0040242197,0.29967278],"study_design_scores_gemma":[0.00001221814,0.00002156703,0.000021498934,0.0000027587766,0.0000045865067,0.000012820116,0.0000052079495,0.9971649,0.0006579524,0.0014548363,0.00063822005,0.0000034360326],"about_ca_topic_score_codex":0.0031136863,"about_ca_topic_score_gemma":0.00402467,"teacher_disagreement_score":0.004342258,"about_ca_system_score_codex":0.0006312825,"about_ca_system_score_gemma":0.0010243537,"threshold_uncertainty_score":0.014526308},"labels":[],"label_agreement":null},{"id":"W2718700547","doi":"","title":"Airspace block organization with metaheurisitics and partitioning packages","year":2013,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Computer science; Mathematics; Combinatorics","score_opus":0.0056661503549899055,"score_gpt":0.17591502781415244,"score_spread":0.17024887745916253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2718700547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02838517,0.000570536,0.9610973,0.00018248666,0.00005332802,0.00010198037,0.000117312986,0.0007236765,0.00876824],"genre_scores_gemma":[0.24256188,0.0004180547,0.7511066,0.00006251597,0.000044236956,0.00032617958,0.0003094713,0.00036814468,0.004802907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954766,0.00020544227,0.000021142174,0.000055232584,0.0001253766,0.00004519579],"domain_scores_gemma":[0.9994635,0.0002124913,0.00006784036,0.00013647684,0.0000881591,0.000031527703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068674615,0.00051311386,0.0004806357,0.00094283064,0.00044066005,0.0012199333,0.00076620263,0.00066727534,0.0052431994],"category_scores_gemma":[0.0011821723,0.00029763876,0.00080927415,0.0015492641,0.00049169164,0.00095234776,0.0009276877,0.00086525275,0.0010269481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017021099,0.00016473,0.00094129745,0.00020485345,0.00010219231,0.00007992196,0.00016077766,0.67424077,0.010591515,0.104242764,0.0040123714,0.20508857],"study_design_scores_gemma":[0.000045514134,0.00013323771,0.00039449427,0.000048219714,0.000043822307,0.000105405736,0.00006141997,0.9403089,0.008236379,0.029079989,0.02152939,0.000013221718],"about_ca_topic_score_codex":0.0011212272,"about_ca_topic_score_gemma":0.0012553362,"teacher_disagreement_score":0.0052431994,"about_ca_system_score_codex":0.00070320733,"about_ca_system_score_gemma":0.0007343234,"threshold_uncertainty_score":0.017540276},"labels":[],"label_agreement":null},{"id":"W2752793715","doi":"10.1109/tcad.2017.2748027","title":"Automatic Selection of Process Corner Simulations for Faster Design Verification","year":2017,"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":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Benchmark (surveying); Process (computing); Set (abstract data type); Computer science; Transistor; Algorithm; Power (physics); Selection (genetic algorithm); Voltage; Process corners; Speedup; Die (integrated circuit); Integrated circuit; Engineering; Parallel computing; Electrical engineering; Artificial intelligence; Embedded system","score_opus":0.05011577823575271,"score_gpt":0.2648827685851671,"score_spread":0.21476699034941443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752793715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077409714,0.00026173884,0.9062983,0.00009896217,0.000035935882,0.00011334594,0.0002036011,0.01410515,0.001473206],"genre_scores_gemma":[0.44375607,0.00010323598,0.5526194,0.0000852601,0.000019650108,0.00020892541,0.0010065173,0.0014372113,0.0007637118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985808,0.0005177597,0.00012301037,0.00024923348,0.00040482823,0.00012433654],"domain_scores_gemma":[0.9953002,0.00285601,0.00035206985,0.00068706874,0.0007121617,0.00009258795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374653,0.0017170463,0.0012985213,0.0017361135,0.0005411459,0.00094943825,0.0010560306,0.00073617627,0.0052286335],"category_scores_gemma":[0.0073014884,0.0007093124,0.0008011551,0.0009429825,0.00032003608,0.001294407,0.00085445633,0.0008895488,0.0016549353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013298964,0.0003667882,0.010389236,0.00036918215,0.00018282683,0.00034909556,0.00028569665,0.26699775,0.15391447,0.005834292,0.0066978647,0.5532829],"study_design_scores_gemma":[0.00012709733,0.0001079577,0.0009944803,0.000021971186,0.00003369816,0.0001044902,0.000032645807,0.93901175,0.054462057,0.0028233551,0.0022504544,0.000030077194],"about_ca_topic_score_codex":0.001504001,"about_ca_topic_score_gemma":0.002304249,"teacher_disagreement_score":0.0052286335,"about_ca_system_score_codex":0.0004721948,"about_ca_system_score_gemma":0.0014038674,"threshold_uncertainty_score":0.01749152},"labels":[],"label_agreement":null},{"id":"W2782281681","doi":"10.1109/tcad.2018.2789728","title":"Density-Uniformity-Aware Analog Layout Retargeting","year":2018,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador; Canada Foundation for Innovation","keywords":"Retargeting; Computer science; Process (computing); Electronic engineering; Capacitance; Set (abstract data type); Integrated circuit layout; Place and route; Integrated circuit; Electrical engineering; Engineering; Artificial intelligence; Routing (electronic design automation)","score_opus":0.025244253969223664,"score_gpt":0.2188628959097165,"score_spread":0.19361864194049283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782281681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51682717,0.0009625619,0.46872288,0.00019625535,0.00012075258,0.000102932136,0.00015906192,0.004569547,0.008338864],"genre_scores_gemma":[0.9529008,0.00012975253,0.04472448,0.00008063351,0.000020483363,0.000018936771,0.00006707716,0.000120483775,0.0019373897],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.000032610653,0.0000149143625,0.0000812306,0.000093600225,0.000034985525],"domain_scores_gemma":[0.999363,0.00010983308,0.00017364557,0.00022647092,0.00010042027,0.000026568912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015792326,0.00041376808,0.00019816776,0.00032242114,0.00021225297,0.00032162017,0.00070489146,0.00016144957,0.0010514811],"category_scores_gemma":[0.0008186299,0.00017606896,0.00012804872,0.0002637219,0.0002852826,0.0004325158,0.0005862818,0.00019955267,0.00025965215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001706087,0.00006950493,0.0017114037,0.00014395549,0.00002873854,0.00016782997,0.0001979915,0.017096195,0.8866086,0.0025401649,0.0009033941,0.09036164],"study_design_scores_gemma":[0.00003661169,0.0004992146,0.005118314,0.000011822226,0.000060697228,0.0006276716,0.00007651081,0.100347385,0.8832803,0.0011985867,0.008710345,0.00003263331],"about_ca_topic_score_codex":0.0004533201,"about_ca_topic_score_gemma":0.001191966,"teacher_disagreement_score":0.0010514811,"about_ca_system_score_codex":0.00033180966,"about_ca_system_score_gemma":0.00020801077,"threshold_uncertainty_score":0.003517568},"labels":[],"label_agreement":null},{"id":"W2783307004","doi":"","title":"EVE, a CAD tool providing placement and pipelining assistance for high-speed FPGA circuit designs","year":2001,"lang":"en","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Field-programmable gate array; Critical path method; Electronic circuit; Event (particle physics); Path (computing); Digital electronics; Computer architecture; Place and route; Virtex; Parallel computing; Computer engineering; Embedded system; Electrical engineering; Engineering; Operating system","score_opus":0.0394614255143726,"score_gpt":0.30216115643246927,"score_spread":0.2626997309180967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783307004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026757138,0.0014239402,0.82219297,0.0004015242,0.00035062913,0.00030099138,0.004622013,0.03974922,0.10420155],"genre_scores_gemma":[0.13376696,0.0026178914,0.59090596,0.00024843414,0.00007382034,0.00028873127,0.008088774,0.007613552,0.25639585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996264,0.000024397268,0.000012053131,0.000034245393,0.000266024,0.000036976966],"domain_scores_gemma":[0.9994948,0.00018891093,0.000031713644,0.00009762538,0.0001524002,0.000034569093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004150308,0.0006596482,0.00039232237,0.0009947816,0.00035375345,0.0006543632,0.0010210196,0.0003657108,0.04571986],"category_scores_gemma":[0.0015728576,0.0007202973,0.00034137492,0.00079003535,0.00025586394,0.00078535045,0.00042075408,0.00081453234,0.006501133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036915386,0.00009522246,0.0019388079,0.0007528649,0.00006751434,0.00083085964,0.0004052935,0.03182757,0.128969,0.038765676,0.20294379,0.5930343],"study_design_scores_gemma":[0.0005287158,0.00023574132,0.005025485,0.0001595578,0.00012740215,0.0017990116,0.00010790188,0.14486681,0.17893873,0.005776757,0.66232806,0.00010582294],"about_ca_topic_score_codex":0.0038133147,"about_ca_topic_score_gemma":0.01962988,"teacher_disagreement_score":0.04571986,"about_ca_system_score_codex":0.0004947607,"about_ca_system_score_gemma":0.0010185194,"threshold_uncertainty_score":0.1529482},"labels":[],"label_agreement":null},{"id":"W2783721252","doi":"","title":"Packing Boundary-Anchored Rectangles.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Computer science; Boundary (topology); Mathematics","score_opus":0.032501644865725335,"score_gpt":0.2521070399376369,"score_spread":0.21960539507191157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783721252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063675,0.0018619107,0.86904114,0.00028727253,0.0005148907,0.0001773919,0.00085028907,0.002852488,0.06073963],"genre_scores_gemma":[0.35564798,0.0018895434,0.61197686,0.00022496186,0.000121442914,0.00018607623,0.002597603,0.0007630536,0.026592594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993224,0.00016324375,0.000046325134,0.00012352827,0.00020991897,0.00013460963],"domain_scores_gemma":[0.9991134,0.00029314953,0.000080668564,0.00032696177,0.00011877918,0.00006716153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043578589,0.0007328843,0.0009823472,0.0009956738,0.00070104207,0.0014013175,0.0014777868,0.0008365346,0.01751727],"category_scores_gemma":[0.0030961197,0.00071777427,0.00063495553,0.0017597543,0.00059144426,0.0019978648,0.003237977,0.0010965854,0.007398429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012604835,0.00027371757,0.0016665176,0.0007194046,0.000097980206,0.0010041931,0.0005424913,0.07672241,0.036564577,0.19805902,0.04287908,0.64021015],"study_design_scores_gemma":[0.00034386595,0.0008041129,0.0020167504,0.0005131779,0.00013420919,0.0017894645,0.00055234175,0.4882935,0.07328362,0.28504133,0.14710823,0.000119447606],"about_ca_topic_score_codex":0.0010652331,"about_ca_topic_score_gemma":0.0015158375,"teacher_disagreement_score":0.01751727,"about_ca_system_score_codex":0.00028588867,"about_ca_system_score_gemma":0.00041069213,"threshold_uncertainty_score":0.05860108},"labels":[],"label_agreement":null},{"id":"W2785649635","doi":"10.1109/fpt.2017.8280115","title":"Automatic circuit design and modelling for heterogeneous FPGAs","year":2017,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Standard cell; Routing (electronic design automation); Block (permutation group theory); Computer architecture; Embedded system; Floorplan; Verilog; Place and route; Design flow; Computer hardware; Stratix; Integrated circuit","score_opus":0.06489352580945308,"score_gpt":0.2474589058206374,"score_spread":0.18256538001118433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785649635","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023696678,0.00009907347,0.9683376,0.0000519328,0.00001470997,0.000061253624,0.0002407916,0.0015538078,0.0059441477],"genre_scores_gemma":[0.46955228,0.00029734024,0.52055264,0.00007179597,0.000018830917,0.0003039875,0.0007633129,0.0004315857,0.008008172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998186,0.00003888894,0.000009642033,0.000032015934,0.000076787874,0.000024108656],"domain_scores_gemma":[0.9997675,0.00011707496,0.0000220283,0.000049300717,0.000037917656,0.0000061869127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620921,0.0005490894,0.0003518372,0.0005092805,0.00032165082,0.0005946658,0.0008353497,0.00050290633,0.004031124],"category_scores_gemma":[0.0007396515,0.0003492829,0.0007369488,0.0003009955,0.0003783561,0.00061256805,0.0004157753,0.00046695862,0.0005292711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021031663,0.000013050205,0.00038960436,0.000051263713,0.0000110680785,0.00007228225,0.00004227363,0.9556914,0.006358534,0.014283526,0.00054809154,0.022517798],"study_design_scores_gemma":[0.000007024709,0.000012160839,0.00011145805,0.0000055418504,0.0000049502837,0.000027973678,0.000008284285,0.98973316,0.002903516,0.0042018862,0.002980536,0.000003489243],"about_ca_topic_score_codex":0.00405321,"about_ca_topic_score_gemma":0.0073671257,"teacher_disagreement_score":0.00405321,"about_ca_system_score_codex":0.000727723,"about_ca_system_score_gemma":0.00064554805,"threshold_uncertainty_score":0.013485432},"labels":[],"label_agreement":null},{"id":"W2789985954","doi":"10.1145/3130265.3130326","title":"Simulation-based circuit-activity estimation for FPGAs containing hard blocks","year":2017,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Benchmark (surveying); Verilog; Electronic circuit; Routing (electronic design automation); Embedded system; Electronic design automation; Software; Computer hardware; Electronic engineering; Computer architecture; Engineering; Electrical engineering","score_opus":0.05441265144530018,"score_gpt":0.29824117160330593,"score_spread":0.24382852015800577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789985954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12035453,0.0004605416,0.86839354,0.000081760336,0.00003003919,0.00009602398,0.00026282572,0.0066523543,0.0036683297],"genre_scores_gemma":[0.810252,0.00019518979,0.18764232,0.000036287573,0.000010531933,0.00008341149,0.00037866272,0.00017882077,0.001222818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966896,0.00010316062,0.000023670327,0.000056998753,0.00011848897,0.00002873072],"domain_scores_gemma":[0.99876785,0.0007935813,0.00014391159,0.00014853408,0.0001235199,0.000022666381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039140094,0.00082384684,0.00033710044,0.00090351613,0.00018341606,0.00047068123,0.0005546319,0.00029704743,0.002669581],"category_scores_gemma":[0.0022403852,0.00021927663,0.0002927065,0.00043125168,0.00018224718,0.0006480681,0.00026145915,0.00040292824,0.00029883382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003545544,0.00010028937,0.0037259834,0.00022168625,0.00006944192,0.00012668048,0.00009756543,0.80760664,0.0372417,0.004411615,0.0009626732,0.1450811],"study_design_scores_gemma":[0.000011692331,0.00005849534,0.00034771775,0.000006884713,0.000009560911,0.000042347965,0.0000071805753,0.9846895,0.013567301,0.0005703201,0.0006836591,0.0000053492863],"about_ca_topic_score_codex":0.0030183268,"about_ca_topic_score_gemma":0.0049023083,"teacher_disagreement_score":0.0030183268,"about_ca_system_score_codex":0.0006579182,"about_ca_system_score_gemma":0.0005733294,"threshold_uncertainty_score":0.0089306235},"labels":[],"label_agreement":null},{"id":"W2794259726","doi":"10.1145/3182394","title":"An Evaluation on the Accuracy of the Minimum-Width Transistor Area Models in Ranking the Layout Area of FPGA Architectures","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Computer science; Adder; Field-programmable gate array; Ranking (information retrieval); Computer engineering; Algorithm; Artificial intelligence; Computer hardware; Multiplexing","score_opus":0.04023300561660837,"score_gpt":0.2535090742876795,"score_spread":0.21327606867107113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794259726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418867,0.0036752792,0.33580446,0.0004898178,0.00018635526,0.00012328848,0.0012776285,0.0052515413,0.01130496],"genre_scores_gemma":[0.9131299,0.0005066776,0.084002934,0.00006640658,0.00002155014,0.000053781536,0.0006583032,0.0003212372,0.0012392199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702424,0.0010175029,0.00016394717,0.00033199825,0.0012683321,0.00019403998],"domain_scores_gemma":[0.9839998,0.010602122,0.0010172583,0.0022966862,0.0019566265,0.00012752555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003058093,0.0011174339,0.00062184874,0.0017721326,0.0003565037,0.0012897392,0.0016747669,0.0008057139,0.0017713684],"category_scores_gemma":[0.018612672,0.0004466682,0.0008388278,0.0010020154,0.0003817278,0.0018479694,0.0005597051,0.0005307285,0.0004597194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040361122,0.00006249778,0.010890994,0.0002094942,0.00012474612,0.000099103316,0.000094567826,0.87601626,0.009365646,0.0019505965,0.0010714325,0.099711016],"study_design_scores_gemma":[0.000020738027,0.00031469084,0.004299442,0.000053965763,0.000048582464,0.00016501495,0.00006333109,0.9774624,0.014554029,0.0010733819,0.0019097917,0.000034627068],"about_ca_topic_score_codex":0.0047885384,"about_ca_topic_score_gemma":0.0066850036,"teacher_disagreement_score":0.0047885384,"about_ca_system_score_codex":0.0011596306,"about_ca_system_score_gemma":0.00079130416,"threshold_uncertainty_score":0.016172945},"labels":[],"label_agreement":null},{"id":"W2799971163","doi":"10.1109/iscas.2018.8351431","title":"Layout-dependent effects aware g<sub>m</sub>/i<sub>D</sub>-based many-objective sizing optimization for analog integrated circuits","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Sizing; Parasitic extraction; Computer science; Analogue electronics; Nonlinear programming; Electronic circuit; Electronic engineering; Interconnection; Mathematical optimization; Nonlinear system; Engineering; Mathematics; Electrical engineering","score_opus":0.009012290998788246,"score_gpt":0.21499087578384327,"score_spread":0.205978584785055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799971163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05481113,0.00022466818,0.93610823,0.00007685043,0.000019246185,0.000052465148,0.00005239135,0.00045169253,0.008203339],"genre_scores_gemma":[0.6038854,0.00013664713,0.3920996,0.000063929765,0.000014628399,0.000088389555,0.00011814708,0.00015673932,0.003436562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998801,0.000025107209,0.0000044594462,0.000016794822,0.00006241236,0.000011115763],"domain_scores_gemma":[0.9998492,0.00006550745,0.000027550472,0.000022381568,0.000028985289,0.0000063536236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020647405,0.0005988654,0.00028047024,0.0003182088,0.00017237685,0.00037355375,0.00064221345,0.00030515887,0.0016581906],"category_scores_gemma":[0.0003471035,0.00019214833,0.00042869512,0.00029154902,0.00023389306,0.00037420116,0.00038267512,0.00036582848,0.00024639114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028277656,0.000039878192,0.00059362175,0.00009746051,0.00003865171,0.000052116924,0.00004629208,0.8615704,0.057109453,0.007478773,0.0005406243,0.072404474],"study_design_scores_gemma":[0.0000047805797,0.00005304764,0.00019863303,0.000004042872,0.000009906904,0.00003046386,0.0000072138146,0.9881529,0.009155502,0.0013428,0.0010368208,0.000003862128],"about_ca_topic_score_codex":0.0007531414,"about_ca_topic_score_gemma":0.0023324878,"teacher_disagreement_score":0.0016581906,"about_ca_system_score_codex":0.0004814769,"about_ca_system_score_gemma":0.0005228115,"threshold_uncertainty_score":0.0055472255},"labels":[],"label_agreement":null},{"id":"W2800418272","doi":"10.1145/3158215","title":"Eh?Legalizer","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Alberta Innovates - Technology Futures; CMC Microsystems","keywords":"Legalization; Computer science; Robustness (evolution); Scalability; Routing (electronic design automation); Standard cell; Floorplan; Mathematical optimization; Process (computing); Parallel computing; Algorithm; Embedded system; Mathematics; Integrated circuit","score_opus":0.017845804125772382,"score_gpt":0.23808365911985227,"score_spread":0.22023785499407988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800418272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024174964,0.00032911153,0.9206922,0.00026163046,0.00016258162,0.00038071058,0.0008403724,0.021891793,0.03126659],"genre_scores_gemma":[0.17947377,0.00027787764,0.7904039,0.00029761728,0.00004070373,0.00028390525,0.0028185323,0.0031514058,0.023252355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999577,0.000045975637,0.000027660739,0.000088925146,0.00020491488,0.00005545832],"domain_scores_gemma":[0.99938357,0.00018383122,0.000059875256,0.00016386407,0.00018874495,0.000020090309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040847628,0.0006907469,0.0003541729,0.00087361655,0.0003977434,0.00076239195,0.0012287111,0.00056175736,0.03046382],"category_scores_gemma":[0.0017417297,0.00026094588,0.0004378072,0.0004648999,0.00044347707,0.0010257951,0.0011037735,0.000609305,0.0043126335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029453222,0.00012449425,0.0014532356,0.000532722,0.000050813323,0.00043558815,0.0002577493,0.052637994,0.040572185,0.037921842,0.054546807,0.811172],"study_design_scores_gemma":[0.00024304603,0.0003069991,0.0012681033,0.00011633795,0.000058078316,0.0008295204,0.00025745088,0.6606183,0.13241136,0.030252807,0.17357983,0.000058142163],"about_ca_topic_score_codex":0.001986941,"about_ca_topic_score_gemma":0.005062892,"teacher_disagreement_score":0.03046382,"about_ca_system_score_codex":0.00060315494,"about_ca_system_score_gemma":0.001271008,"threshold_uncertainty_score":0.101911604},"labels":[],"label_agreement":null},{"id":"W2800869073","doi":"10.1109/iscas.2018.8351560","title":"Fast Performance Evaluation for Analog Circuit Synthesis Frameworks","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Network topology; Schematic; Analogue electronics; Graph; Electronic circuit; Computer engineering; Algorithm; Topology (electrical circuits); Theoretical computer science; Electronic engineering; Engineering; Electrical engineering","score_opus":0.02707449811160098,"score_gpt":0.2559348126299347,"score_spread":0.22886031451833375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800869073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031906992,0.0005511001,0.9551185,0.00006560407,0.000038314356,0.00011133787,0.00026106613,0.006632567,0.0053145336],"genre_scores_gemma":[0.56337184,0.00057317776,0.43115938,0.00005227174,0.00004056332,0.00029558034,0.0008020857,0.0009816068,0.002723563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976724,0.0006159104,0.000107013984,0.00024755413,0.0011869087,0.00017019112],"domain_scores_gemma":[0.99608445,0.002276913,0.00029936596,0.0005261522,0.00075746916,0.000055694803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014503221,0.0018790183,0.000737437,0.0025365516,0.00046058968,0.001173389,0.0010508692,0.00067763164,0.0067208214],"category_scores_gemma":[0.0069586993,0.00033375667,0.0006714935,0.0014921913,0.0004892731,0.0018169145,0.00072640553,0.00079885474,0.0012157735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004889048,0.0001212756,0.0019662862,0.0006754725,0.00010164353,0.00020041416,0.00015516076,0.3495828,0.07981047,0.025605576,0.003746589,0.53754544],"study_design_scores_gemma":[0.000034375487,0.00045316937,0.0011228368,0.000049613893,0.000045892702,0.00017790223,0.00006012494,0.90833694,0.07405417,0.009529816,0.0060891607,0.00004599856],"about_ca_topic_score_codex":0.0018502842,"about_ca_topic_score_gemma":0.0015480637,"teacher_disagreement_score":0.0067208214,"about_ca_system_score_codex":0.001301123,"about_ca_system_score_gemma":0.00111136,"threshold_uncertainty_score":0.022483349},"labels":[],"label_agreement":null},{"id":"W2801467633","doi":"10.1109/isqed.2018.8357272","title":"Parasitic-aware gm/I&lt;inf&gt;D&lt;/inf&gt;-based many-objective analog/RF circuit sizing","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parasitic extraction; Sizing; CMOS; Comparator; Electronic engineering; Computer science; Electrical engineering; Engineering; Voltage","score_opus":0.015300919450181241,"score_gpt":0.2329725486858125,"score_spread":0.21767162923563124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801467633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030161718,0.00022754412,0.9612497,0.000057286667,0.000022613462,0.00006699911,0.000061514154,0.0008065801,0.007346031],"genre_scores_gemma":[0.39954194,0.0001868278,0.5960583,0.000089899506,0.000020846528,0.0001434338,0.00020453248,0.00031190927,0.0034423294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997633,0.00004871666,0.000011427778,0.00003487814,0.00011917288,0.000022470731],"domain_scores_gemma":[0.9997186,0.00011491466,0.000042340187,0.000041204108,0.00007341126,0.0000095942805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036951952,0.00083212584,0.00040034248,0.0007619802,0.00027718162,0.0005383121,0.0008095479,0.0003512651,0.0027504065],"category_scores_gemma":[0.00069803343,0.00028152284,0.0006291632,0.0005464788,0.00029739342,0.00058500306,0.00045902096,0.0003654872,0.00039352043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050401643,0.00005118783,0.0009367662,0.00018507852,0.000062627885,0.00007299938,0.000069827685,0.7372828,0.06961066,0.008504378,0.0012629783,0.18191019],"study_design_scores_gemma":[0.000009703667,0.00007271472,0.00038200078,0.000009471418,0.000029736408,0.000068254136,0.00001575495,0.97815347,0.016842382,0.0018190345,0.002588843,0.000008566487],"about_ca_topic_score_codex":0.0013220607,"about_ca_topic_score_gemma":0.0034085517,"teacher_disagreement_score":0.0027504065,"about_ca_system_score_codex":0.0006852546,"about_ca_system_score_gemma":0.00079986674,"threshold_uncertainty_score":0.00920099},"labels":[],"label_agreement":null},{"id":"W28414101","doi":"10.1016/j.pneurobio.2017.04.002","title":"A Novel Floorplanning for Hierarchical VLSI Design.","year":2009,"lang":"en","type":"article","venue":"Computers and Their Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Floorplan; Very-large-scale integration; Computer science; Computer architecture; Physical design; Integrated circuit layout; Parallel computing; Integrated circuit design; Embedded system; Integrated circuit; Circuit design","score_opus":0.019428657818499746,"score_gpt":0.22927292271664956,"score_spread":0.2098442648981498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28414101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012743998,0.0015642822,0.95675033,0.00027227894,0.00020029371,0.00009603207,0.00028049285,0.002667335,0.025425006],"genre_scores_gemma":[0.32537925,0.00094963756,0.661862,0.00027860218,0.0000562681,0.000229477,0.0006066162,0.0003584756,0.010279695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.00005871708,0.00001843848,0.000036639514,0.00007392765,0.000036515885],"domain_scores_gemma":[0.9998097,0.000071383074,0.0000235612,0.000041318355,0.000039849478,0.000014228308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000243874,0.0007426656,0.00030982762,0.00039375495,0.00024499616,0.00068316277,0.0007558002,0.00033872924,0.011012096],"category_scores_gemma":[0.0005322149,0.0002690435,0.0005248347,0.00036049538,0.00028465848,0.00053661846,0.00052821677,0.00056259835,0.0014469954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021612106,0.00006861226,0.0010193863,0.00062390696,0.00008479071,0.00039089686,0.00014892164,0.45172495,0.035603713,0.086482935,0.017433621,0.4062021],"study_design_scores_gemma":[0.00006847772,0.00030797688,0.00036824658,0.0001343806,0.000053589913,0.00043753392,0.000063859734,0.8522306,0.01206515,0.05463268,0.07960581,0.000031767722],"about_ca_topic_score_codex":0.0016491124,"about_ca_topic_score_gemma":0.0039830324,"teacher_disagreement_score":0.011012096,"about_ca_system_score_codex":0.00044762445,"about_ca_system_score_gemma":0.0007125034,"threshold_uncertainty_score":0.036839187},"labels":[],"label_agreement":null},{"id":"W2883647869","doi":"10.1145/3195800","title":"Wotan","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Field-programmable gate array; Routing (electronic design automation); Parallel computing; Lookup table; Embedded system","score_opus":0.014460874857942226,"score_gpt":0.2214055918945223,"score_spread":0.20694471703658007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883647869","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025672555,0.0021772427,0.25756824,0.00093635917,0.0017482494,0.00088016764,0.05668639,0.19053653,0.46379438],"genre_scores_gemma":[0.16009602,0.0022533059,0.29601958,0.0015896045,0.00031341182,0.0015791327,0.18383862,0.03467722,0.31963313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924123,0.00006771295,0.000059569156,0.0002147143,0.0003314396,0.000085391075],"domain_scores_gemma":[0.9989704,0.00017854552,0.0001036716,0.0003178659,0.00037037677,0.00005913162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559126,0.0012806125,0.00056262274,0.002192779,0.0006262208,0.0022522146,0.0015811448,0.0007488464,0.122115724],"category_scores_gemma":[0.003287139,0.00068664015,0.00059315754,0.0014442062,0.0002884249,0.0025766103,0.0015467472,0.0009048019,0.07059503],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005471561,0.00016793469,0.005974973,0.0010591423,0.00013000522,0.00023991818,0.00017631828,0.009432428,0.011972514,0.037359923,0.39331168,0.5396279],"study_design_scores_gemma":[0.00011111515,0.00014782406,0.002215244,0.00014316413,0.000060682894,0.0004060998,0.0000986433,0.04655074,0.020286681,0.021422837,0.9084737,0.00008328357],"about_ca_topic_score_codex":0.001770899,"about_ca_topic_score_gemma":0.0040608104,"teacher_disagreement_score":0.122115724,"about_ca_system_score_codex":0.00060809765,"about_ca_system_score_gemma":0.001130962,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2887357719","doi":"10.5555/3199700.3199819","title":"DATC RDF: robust design flow database","year":2017,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Microsemi (Canada)","funders":"","keywords":"Computer science; RDF; Database; Design flow; Physical design; Database design; Data mining; Information retrieval; Circuit design; Semantic Web; Embedded system","score_opus":0.16137316123309314,"score_gpt":0.29884269166096666,"score_spread":0.13746953042787352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887357719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041739843,0.0010572984,0.48716596,0.0007852912,0.00035841647,0.00086788373,0.30006924,0.18108045,0.024441523],"genre_scores_gemma":[0.06078498,0.0016449589,0.22322237,0.001328851,0.00017354653,0.0020542522,0.6787282,0.020331709,0.011731095],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590236,0.00062305736,0.00078281196,0.00081082335,0.0016254339,0.00025550564],"domain_scores_gemma":[0.99093443,0.0022802532,0.00063074625,0.0040982445,0.0018713799,0.00018494843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988787,0.0027620804,0.0017124524,0.0073005697,0.0009630807,0.004796059,0.004846143,0.0022596752,0.030464765],"category_scores_gemma":[0.0135404905,0.0014888934,0.0023912112,0.004689626,0.0009191083,0.0051141903,0.0025860192,0.0024179134,0.015803885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014708963,0.00041582194,0.0049903775,0.0038331363,0.0003702517,0.0007685957,0.00040288336,0.095811285,0.010385407,0.10966636,0.5482092,0.22367582],"study_design_scores_gemma":[0.0003293935,0.00012050661,0.0010140883,0.00053962757,0.00019294328,0.00049346563,0.000104341314,0.10100507,0.025667986,0.0413749,0.82894826,0.00020944273],"about_ca_topic_score_codex":0.013662785,"about_ca_topic_score_gemma":0.009976239,"teacher_disagreement_score":0.030464765,"about_ca_system_score_codex":0.0030070306,"about_ca_system_score_gemma":0.0043575857,"threshold_uncertainty_score":0.10191482},"labels":[],"label_agreement":null},{"id":"W28973634","doi":"10.7326/m16-2871","title":"Enhancing and Using an Automatic Design System for Creating FPGAs","year":2005,"lang":"en","type":"article","venue":"Annals of Internal Medicine","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute; National Institute on Aging; American College of Cardiology Foundation; Natural Sciences and Engineering Research Council of Canada; Agency for Healthcare Research and Quality; University of Toronto","keywords":"Field-programmable gate array; Computer science; Embedded system; Computer architecture; Reconfigurable computing; Task (project management); Page layout; Circuit design; Architecture; Application-specific integrated circuit; Integrated circuit layout; Computer hardware; Integrated circuit; Engineering; Systems engineering; Operating system","score_opus":0.07016267351587435,"score_gpt":0.3337723562325478,"score_spread":0.26360968271667345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28973634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03410853,0.00046850558,0.9423452,0.00017474797,0.00016306348,0.00020171209,0.00014303828,0.012243964,0.010151266],"genre_scores_gemma":[0.15719472,0.00030054036,0.83427536,0.00012352692,0.000040942985,0.00009486225,0.0003083004,0.00059871416,0.0070630163],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996588,0.000074384305,0.00003192588,0.000055262437,0.00014426665,0.000035299487],"domain_scores_gemma":[0.9992642,0.00025308967,0.00004846173,0.00013648345,0.00026537862,0.00003230526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052858994,0.0005245906,0.00016465547,0.0008017469,0.00027276765,0.00063096225,0.0006652076,0.0003455693,0.007011314],"category_scores_gemma":[0.0017202261,0.0002709652,0.000255022,0.00035465878,0.0001878524,0.0006525385,0.00037308934,0.00043500063,0.002250044],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028428182,0.00009208856,0.0021269065,0.00027792586,0.000044897588,0.00040279518,0.00021603337,0.013883102,0.1805264,0.0085666245,0.014004511,0.77957445],"study_design_scores_gemma":[0.0002373195,0.0010081899,0.0042740367,0.00018264234,0.00016380347,0.0031982358,0.00017166504,0.33447674,0.4630581,0.0075312313,0.18559803,0.00010002215],"about_ca_topic_score_codex":0.00093804183,"about_ca_topic_score_gemma":0.002033933,"teacher_disagreement_score":0.007011314,"about_ca_system_score_codex":0.0002788268,"about_ca_system_score_gemma":0.0005878614,"threshold_uncertainty_score":0.023455203},"labels":[],"label_agreement":null},{"id":"W2897505503","doi":"10.1145/3233244","title":"GPlace3.0","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Router; Parallel computing; Routing (electronic design automation); Reduction (mathematics); Benchmark (surveying); Embedded system; Computer engineering; Algorithm; Computer network; Mathematics","score_opus":0.01641232852791342,"score_gpt":0.232863703928349,"score_spread":0.21645137540043558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897505503","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021677203,0.0010771223,0.6697404,0.00045788128,0.00036156853,0.00056562957,0.005296599,0.24131043,0.0595131],"genre_scores_gemma":[0.15904161,0.0011742554,0.72862387,0.00075118913,0.000081258346,0.000873356,0.020197429,0.025973702,0.06328338],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996351,0.000043724907,0.000020408532,0.0000700625,0.0001809927,0.000049732193],"domain_scores_gemma":[0.99961025,0.00010422958,0.0000490392,0.000091903705,0.00012156271,0.00002302616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070998294,0.0013419208,0.0004056606,0.00085174455,0.00031896995,0.0011247332,0.0021580851,0.00073063286,0.0340159],"category_scores_gemma":[0.001653088,0.0007106223,0.00059510494,0.0006887705,0.00035266933,0.00095077255,0.00090996723,0.0012021719,0.011911317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007142699,0.00015074808,0.002151259,0.0009961431,0.00015696489,0.00028358688,0.00025248516,0.11521283,0.029792894,0.029340273,0.34647503,0.4744735],"study_design_scores_gemma":[0.0004788346,0.00057630945,0.001418755,0.00011096822,0.000056120447,0.00053970946,0.000078453944,0.5196009,0.05116452,0.016190281,0.4096885,0.000096587275],"about_ca_topic_score_codex":0.0030426956,"about_ca_topic_score_gemma":0.0046469974,"teacher_disagreement_score":0.0340159,"about_ca_system_score_codex":0.0007687873,"about_ca_system_score_gemma":0.0012422358,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2905187565","doi":"10.1109/fpl.2018.00054","title":"Multi-fidelity Optimization for High-Level Synthesis Directives","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"High-level synthesis; High fidelity; Computer science; Fidelity; Design space exploration; Field-programmable gate array; Design flow; Electronic design automation; Computer architecture; CAD; Embedded system; Computer engineering; Engineering; Engineering drawing","score_opus":0.03676464153402379,"score_gpt":0.2557620574418277,"score_spread":0.2189974159078039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905187565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008878274,0.00009734142,0.9881166,0.000048095353,0.00001341777,0.000022378941,0.00002147268,0.00050431077,0.0022981232],"genre_scores_gemma":[0.39182618,0.00013421518,0.6045314,0.00010093462,0.000025575699,0.00013982975,0.000120146084,0.0004830348,0.002638677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909556,0.00028908157,0.000036863134,0.00008737049,0.0004274545,0.00006362943],"domain_scores_gemma":[0.99840444,0.0010104714,0.00017825472,0.00018447402,0.00018657307,0.000035730453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014254799,0.00070016505,0.0004285396,0.00059622223,0.00035786713,0.0008245874,0.0006901448,0.00063948514,0.0037009409],"category_scores_gemma":[0.004526927,0.000492268,0.00044083458,0.00037112462,0.00055825745,0.0008303876,0.0008692113,0.0009655958,0.00059968245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007039207,0.00003978897,0.00050535175,0.00008041848,0.000017665106,0.000037353475,0.00007266507,0.9147255,0.012095368,0.016832586,0.000686766,0.05483612],"study_design_scores_gemma":[0.0000057569555,0.000014367972,0.000040052146,0.000005756461,0.0000024239732,0.000009456341,0.000004041433,0.99493635,0.0023317675,0.0017923604,0.00085444946,0.0000031419381],"about_ca_topic_score_codex":0.0015984693,"about_ca_topic_score_gemma":0.0027143129,"teacher_disagreement_score":0.0037009409,"about_ca_system_score_codex":0.0008238504,"about_ca_system_score_gemma":0.00070656376,"threshold_uncertainty_score":0.012380898},"labels":[],"label_agreement":null},{"id":"W2907894052","doi":"10.22215/etd/2015-11198","title":"Lightweight Robust Optimizer for Distributed Application Deployment in Multi-Clouds","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software deployment; Cloud computing; Distributed computing; Simulated annealing; Graph; Power consumption; Enhanced Data Rates for GSM Evolution; Graph partition; Bin packing problem; Bin; Parallel computing; Mathematical optimization; Theoretical computer science; Algorithm; Power (physics); Mathematics; Artificial intelligence","score_opus":0.028067011463482974,"score_gpt":0.2756158198303103,"score_spread":0.24754880836682733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907894052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020350894,0.0002342599,0.9754043,0.00010334598,0.000036126694,0.000047184825,0.00004191334,0.0014808562,0.002301101],"genre_scores_gemma":[0.48623013,0.00022479062,0.5086511,0.000095305506,0.00004504851,0.00016203866,0.0001739203,0.00047486578,0.003942902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966264,0.00006344855,0.000014446223,0.000059185975,0.00014072997,0.000059588314],"domain_scores_gemma":[0.9997389,0.00009840965,0.000039091865,0.000044546196,0.00005948968,0.000019662117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820851,0.0007936202,0.0006837835,0.0003976833,0.00036735117,0.00064274337,0.00085609476,0.00044001234,0.002479369],"category_scores_gemma":[0.0010125644,0.00036093296,0.0005498365,0.00039395358,0.00031315786,0.0005726631,0.0006922438,0.00082830206,0.00063675834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009249682,0.000044534874,0.0003156374,0.00007592482,0.000036785535,0.000055838576,0.000029027688,0.9004774,0.010882856,0.0072067115,0.0020608709,0.07872192],"study_design_scores_gemma":[0.0000066007065,0.000017079314,0.00006204478,0.0000024168535,0.000003360237,0.000008088967,0.000005632353,0.99721485,0.0013030608,0.00087575393,0.00049905234,0.000001968461],"about_ca_topic_score_codex":0.0033162173,"about_ca_topic_score_gemma":0.0050339946,"teacher_disagreement_score":0.0033162173,"about_ca_system_score_codex":0.00075691345,"about_ca_system_score_gemma":0.0010358301,"threshold_uncertainty_score":0.008294344},"labels":[],"label_agreement":null},{"id":"W2908823030","doi":"10.4324/9781315276649-11","title":"Getting beneath the surface","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geology; Surface (topology); Geometry; Mathematics","score_opus":0.014791398428957665,"score_gpt":0.19787153718355344,"score_spread":0.18308013875459578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908823030","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022280593,0.04410622,0.018914867,0.037774313,0.009770457,0.000050510782,0.00012672895,0.00042164902,0.88660705],"genre_scores_gemma":[0.027162485,0.033385955,0.011059474,0.00895477,0.0032763232,0.00006918899,0.0001743428,0.0007404085,0.91517717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994636,0.00012784611,0.00001581266,0.00011320988,0.00021356481,0.000065996515],"domain_scores_gemma":[0.9994892,0.00021226099,0.000017959303,0.0000803128,0.00011391066,0.00008626625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006210012,0.0006002494,0.00043787152,0.0009665571,0.0031268452,0.007511487,0.00090588443,0.001908126,0.06074147],"category_scores_gemma":[0.0018087727,0.00028499984,0.0004965849,0.0010066009,0.005006703,0.01282174,0.0033298275,0.0045574177,0.024358356],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012632226,0.000018753964,0.0001143697,0.0001962474,0.0000035122478,0.00008421327,0.0052555474,0.00020261854,0.00045590175,0.6477815,0.2229018,0.12297283],"study_design_scores_gemma":[7.0829094e-7,0.000004446943,0.000038214064,0.00012715142,9.221423e-7,0.00007077697,0.0006800392,0.000053205003,0.000070896414,0.03624327,0.96270746,0.0000029138632],"about_ca_topic_score_codex":0.0023699373,"about_ca_topic_score_gemma":0.0049474295,"teacher_disagreement_score":0.06074147,"about_ca_system_score_codex":0.0023720926,"about_ca_system_score_gemma":0.0016547423,"threshold_uncertainty_score":0.20320046},"labels":[],"label_agreement":null},{"id":"W2911319947","doi":"10.1109/rsp.2018.8631999","title":"Towards Trainable Synthesis for Optimized Circuit Deployment on FPGA","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Field-programmable gate array; Computer science; Verilog; Software deployment; Embedded system; Leverage (statistics); Computer architecture; Hardware description language; Computer hardware; High-level synthesis; Routing (electronic design automation); Operating system","score_opus":0.03138668725022993,"score_gpt":0.24326996544594884,"score_spread":0.2118832781957189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911319947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081830524,0.000269251,0.8962543,0.0002100089,0.00006227775,0.00018447837,0.0003392973,0.010027567,0.010822225],"genre_scores_gemma":[0.36984012,0.00020995887,0.6246696,0.00013198752,0.000029441297,0.0002487107,0.00058751396,0.0010582631,0.003224264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999466,0.00012889426,0.000045199213,0.00008484168,0.00018643778,0.00008865575],"domain_scores_gemma":[0.9991254,0.0003952465,0.00010559762,0.00019533865,0.00015646254,0.000021797638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047581122,0.0009522847,0.0003838688,0.0006789778,0.00029938933,0.0007423713,0.0010401718,0.00041090866,0.0047156895],"category_scores_gemma":[0.0017160452,0.00042081226,0.00042457206,0.00047009793,0.00036924414,0.00085533975,0.00052071747,0.0007531206,0.0010230351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019262075,0.00020118064,0.0013675977,0.00044592159,0.000053850203,0.00039977353,0.00023498629,0.42167106,0.23303226,0.025590613,0.0066357516,0.31017432],"study_design_scores_gemma":[0.00007734435,0.000327853,0.00048271441,0.000056440116,0.00003900711,0.00017983289,0.00006228909,0.82567203,0.15011555,0.008145426,0.014813883,0.000027695763],"about_ca_topic_score_codex":0.001857418,"about_ca_topic_score_gemma":0.0035942823,"teacher_disagreement_score":0.0047156895,"about_ca_system_score_codex":0.0007837931,"about_ca_system_score_gemma":0.0009924618,"threshold_uncertainty_score":0.015775502},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009955210054345838,"score_gpt":0.2020108655535977,"score_spread":0.19205565549925188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911751195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03937072,0.0017936574,0.61375856,0.00052280084,0.0005125829,0.0005864614,0.017701028,0.16922174,0.15653232],"genre_scores_gemma":[0.37092167,0.0015711412,0.41174603,0.00127338,0.00013314944,0.00123106,0.04806228,0.028314773,0.13674651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995988,0.00004625225,0.00002876352,0.00008016909,0.00018438425,0.000061690705],"domain_scores_gemma":[0.9993912,0.00024687374,0.00004692716,0.000118531985,0.00016677316,0.00002960218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048741276,0.0012442357,0.00038836902,0.0008772852,0.0003463586,0.001235439,0.0013413356,0.00078202237,0.06598276],"category_scores_gemma":[0.0018371608,0.00061761844,0.0008405633,0.00048896304,0.00031617907,0.0011980429,0.0007815381,0.0008217957,0.011439641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001247915,0.00022450293,0.005426362,0.0022694783,0.00019280192,0.0010205769,0.00034686344,0.09747601,0.06016266,0.06833924,0.33383742,0.42945614],"study_design_scores_gemma":[0.0004622868,0.00040008084,0.0023238359,0.00029460722,0.00010130379,0.0014085895,0.000086659886,0.31492943,0.07859244,0.022546208,0.57871425,0.0001401904],"about_ca_topic_score_codex":0.001982463,"about_ca_topic_score_gemma":0.0042451895,"teacher_disagreement_score":0.06598276,"about_ca_system_score_codex":0.0007429938,"about_ca_system_score_gemma":0.00085565646,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2921296408","doi":"10.48550/arxiv.1903.05304","title":"On the depth of cutting planes","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Intersection (aeronautics); Cutting-plane method; Simplex; Mathematics; Plane (geometry); Geometry; Parametric statistics; Combinatorics; Algorithm; Integer programming; Engineering","score_opus":0.0607409193743733,"score_gpt":0.15933847223704323,"score_spread":0.09859755286266993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921296408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041142903,0.001604905,0.94394904,0.00044690116,0.0000699243,0.000071237504,0.00034944186,0.0003804161,0.01198518],"genre_scores_gemma":[0.5298419,0.002414495,0.46003583,0.0003299828,0.0002288599,0.0003005892,0.0005982664,0.0006109671,0.0056391177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967733,0.0006520277,0.00019323743,0.00065909355,0.0012072872,0.00051514554],"domain_scores_gemma":[0.9873996,0.008472196,0.001148942,0.001436868,0.0010763984,0.00046597942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026079575,0.0014133024,0.0010113072,0.0024085818,0.00087065855,0.004093941,0.0023882678,0.0014759115,0.005493756],"category_scores_gemma":[0.018527582,0.0013481105,0.0012338537,0.002041214,0.0037469012,0.009491105,0.004441697,0.004567165,0.0009203232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032514948,0.000059113576,0.002887453,0.0003737258,0.000058389844,0.00020866013,0.0006825462,0.25969055,0.011183529,0.6153867,0.002770912,0.10637321],"study_design_scores_gemma":[0.000038681643,0.00022609427,0.0011164814,0.00018402153,0.00003617829,0.00032573572,0.0002522497,0.2967253,0.006016779,0.68051505,0.014494494,0.000068999194],"about_ca_topic_score_codex":0.001283465,"about_ca_topic_score_gemma":0.0010041767,"teacher_disagreement_score":0.005493756,"about_ca_system_score_codex":0.0020056092,"about_ca_system_score_gemma":0.00096668146,"threshold_uncertainty_score":0.018378437},"labels":[],"label_agreement":null},{"id":"W2925797319","doi":"10.1145/3317575","title":"An Optimized Cost Flow Algorithm to Spread Cells in Detailed Placement","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Placement; Algorithm; Very-large-scale integration; Design flow; Electronic circuit; Physical design; Circuit design; Embedded system; Electrical engineering","score_opus":0.010827797269848546,"score_gpt":0.23349491403872633,"score_spread":0.2226671167688778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925797319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008767131,0.00008009924,0.9889636,0.00006995194,0.00002206566,0.00008949225,0.000044514218,0.0005080313,0.0014550844],"genre_scores_gemma":[0.0919805,0.00009399479,0.9042928,0.00006695817,0.00001926026,0.00018104223,0.00020037369,0.00013838758,0.003026717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.000042454027,0.000015762931,0.000044979457,0.00012449596,0.000043610762],"domain_scores_gemma":[0.9996013,0.00019005021,0.00004146194,0.000040192113,0.00010795934,0.000019099074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041727303,0.0008513583,0.00065642135,0.001173578,0.0005206242,0.0007265478,0.0008384846,0.0008346837,0.0054674437],"category_scores_gemma":[0.0013705519,0.00043431678,0.00045295033,0.001002414,0.00044176428,0.00085648603,0.00071047473,0.0006617637,0.0011175914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017837576,0.00009903027,0.00061093323,0.00010594015,0.000027318907,0.000094968666,0.0000803096,0.56192756,0.020228598,0.016473232,0.0043474576,0.39582628],"study_design_scores_gemma":[0.000029499222,0.00007536204,0.000095388816,0.0000070206524,0.0000071783197,0.00004788411,0.000012984023,0.989005,0.0033335127,0.005142946,0.0022367302,0.0000065681643],"about_ca_topic_score_codex":0.0035742654,"about_ca_topic_score_gemma":0.006026529,"teacher_disagreement_score":0.0054674437,"about_ca_system_score_codex":0.0009137601,"about_ca_system_score_gemma":0.0014633469,"threshold_uncertainty_score":0.0182904},"labels":[],"label_agreement":null},{"id":"W2943340242","doi":"10.1109/icm.2018.8704066","title":"An Effective FPGA Placement Flow Selection Framework using Machine Learning","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Benchmark (surveying); Computer science; Selection (genetic algorithm); Flow (mathematics); CONTEST; Placement; CAD; Design flow; Parallel computing; Computer engineering; Computer architecture; Embedded system; Machine learning; Circuit design; Physical design; Engineering drawing; Mathematics; Engineering","score_opus":0.008083971132520039,"score_gpt":0.25359297142447385,"score_spread":0.2455090002919538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943340242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006178591,0.0001528489,0.9913872,0.00012593769,0.00001628688,0.000046051657,0.00004244566,0.0014524758,0.0005981517],"genre_scores_gemma":[0.29749784,0.0001765617,0.69901586,0.0002456957,0.00010113089,0.0002018705,0.0003969276,0.00017681414,0.0021873617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.00025990556,0.000050420225,0.000217808,0.0003717774,0.00009460548],"domain_scores_gemma":[0.9988753,0.00047576128,0.00013338563,0.00009694253,0.00036737468,0.000051301893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013955968,0.0010736075,0.0011977284,0.0015383353,0.0005542142,0.0011200194,0.0018322128,0.0014634604,0.0022990971],"category_scores_gemma":[0.0029160825,0.0004613459,0.00068686035,0.00091835024,0.00054226845,0.0010031783,0.00074959645,0.0012313707,0.00086046563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008266232,0.0001464337,0.00094780955,0.00006297272,0.00003344692,0.00007522759,0.000028819468,0.68219626,0.0042201127,0.0030956988,0.0026142048,0.30649626],"study_design_scores_gemma":[0.000004885096,0.000023919287,0.000061429666,0.000003434139,0.0000028724132,0.000012470866,0.0000032762002,0.99801254,0.00079882226,0.0007659068,0.00030797458,0.0000024401884],"about_ca_topic_score_codex":0.005405713,"about_ca_topic_score_gemma":0.006207949,"teacher_disagreement_score":0.005405713,"about_ca_system_score_codex":0.0010970607,"about_ca_system_score_gemma":0.0017254287,"threshold_uncertainty_score":0.010748506},"labels":[],"label_agreement":null},{"id":"W2943505044","doi":"10.1109/iscas.2019.8702574","title":"Graph-Grammar-Based Analog Circuit Topology Synthesis","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Network topology; Topology (electrical circuits); Analogue electronics; Grammar; Algorithm; Circuit extraction; Electronic circuit; Theoretical computer science; Equivalent circuit; Electrical engineering; Engineering","score_opus":0.009702553313871999,"score_gpt":0.19216780046778428,"score_spread":0.1824652471539123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943505044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00479337,0.00007798637,0.9906138,0.000041794083,0.000022031476,0.000073118536,0.00012994264,0.0015955964,0.002652437],"genre_scores_gemma":[0.18524511,0.00024271348,0.8098978,0.00010094191,0.000024899717,0.00024897262,0.0009842725,0.00066524744,0.0025899168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00007814079,0.000025907244,0.00007424026,0.00016311306,0.00003091458],"domain_scores_gemma":[0.99950933,0.0002232033,0.000029665256,0.00010366246,0.00011834708,0.000015799984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034887006,0.00060552283,0.00045830524,0.0009183283,0.00037002767,0.00061281765,0.00086232874,0.00047182987,0.003670627],"category_scores_gemma":[0.0012053823,0.00027209806,0.0008438725,0.000622259,0.00061202823,0.00070708245,0.0005678561,0.00061872374,0.0010072461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006823947,0.00007678694,0.0007163534,0.00048145847,0.000078938734,0.00058623956,0.00020737141,0.32026756,0.101117164,0.09563075,0.0070329392,0.4737362],"study_design_scores_gemma":[0.00005311348,0.00010617637,0.00037715666,0.000043777247,0.000050331833,0.00043416012,0.000054826978,0.84605354,0.048162285,0.0840958,0.020537773,0.000031059597],"about_ca_topic_score_codex":0.0014838644,"about_ca_topic_score_gemma":0.0024822978,"teacher_disagreement_score":0.003670627,"about_ca_system_score_codex":0.00045548542,"about_ca_system_score_gemma":0.0010001537,"threshold_uncertainty_score":0.0122795105},"labels":[],"label_agreement":null},{"id":"W2945806107","doi":"10.1145/3316781.3317743","title":"A Flat Timing-Driven Placement Flow for Modern FPGAs","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Benchmark (surveying); Computer science; Suite; Parallel computing; Embedded system","score_opus":0.016342300333233688,"score_gpt":0.22390130738401534,"score_spread":0.20755900705078165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945806107","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015524503,0.00018966703,0.97916174,0.000077178,0.000041713814,0.0000765652,0.00008043417,0.0026492914,0.0021989394],"genre_scores_gemma":[0.26261625,0.00027104965,0.7315715,0.00016761813,0.000049596518,0.0000888139,0.00030533332,0.00034355652,0.0045862766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950373,0.00007260144,0.000023525818,0.0000784728,0.0002672523,0.00005450031],"domain_scores_gemma":[0.99955744,0.00012989773,0.00008628481,0.000112510206,0.0000951876,0.000018723433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037612335,0.0008271462,0.000288252,0.00063309254,0.00038636493,0.00055643433,0.0010270644,0.00035553332,0.0037582978],"category_scores_gemma":[0.0009519513,0.00038972028,0.00034190502,0.0004887543,0.00042044572,0.00068444066,0.00048761163,0.0006391738,0.0009868508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002984602,0.000121211604,0.0012084071,0.0004371901,0.000047771413,0.00035836626,0.00013122208,0.24839957,0.12928317,0.020094227,0.0077102366,0.5919102],"study_design_scores_gemma":[0.00007999847,0.0007014242,0.0013429862,0.000034031236,0.000030455436,0.0005399104,0.0000661779,0.9040696,0.06633872,0.010236997,0.016512705,0.000047042],"about_ca_topic_score_codex":0.0021629229,"about_ca_topic_score_gemma":0.00579849,"teacher_disagreement_score":0.0037582978,"about_ca_system_score_codex":0.0006199196,"about_ca_system_score_gemma":0.001287661,"threshold_uncertainty_score":0.012572825},"labels":[],"label_agreement":null},{"id":"W2949081670","doi":"10.48550/arxiv.1305.0172","title":"An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; K-ary tree; Disjoint sets; Logarithm; Matching (statistics); Tree (set theory); Spanning tree; Euclidean minimum spanning tree; Discrete mathematics; Gomory–Hu tree; Upper and lower bounds; Minimum degree spanning tree; Tree structure; Binary tree","score_opus":0.04220076924491658,"score_gpt":0.1779886769648603,"score_spread":0.1357879077199437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949081670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048795275,0.00082279026,0.92226624,0.00086346094,0.00014427597,0.00034715788,0.00086032477,0.004711265,0.021189231],"genre_scores_gemma":[0.17611037,0.00040976962,0.8161194,0.00020293407,0.000052399366,0.00030781297,0.001892019,0.00029930822,0.0046060416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991769,0.00013485907,0.00006882983,0.00024188623,0.00021462167,0.00016288673],"domain_scores_gemma":[0.99949443,0.00019314689,0.000051980176,0.0001388881,0.00008412661,0.000037425845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059585524,0.001027946,0.00096443866,0.0010831971,0.00075129344,0.0014769962,0.0021160357,0.0013923588,0.010368651],"category_scores_gemma":[0.0024436775,0.00050372985,0.0006795362,0.0018598073,0.0004845848,0.0033183962,0.0017158934,0.0009216118,0.002443875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085341034,0.00048276928,0.0011023242,0.0006513747,0.00011833681,0.00027678697,0.00031101276,0.15978903,0.01697322,0.08829893,0.0425792,0.6885636],"study_design_scores_gemma":[0.0004485434,0.00026809482,0.00063733454,0.00006749998,0.00007202378,0.00045105454,0.00023969814,0.85272354,0.0069354824,0.11719046,0.020916257,0.000050081046],"about_ca_topic_score_codex":0.0022793543,"about_ca_topic_score_gemma":0.0038666388,"teacher_disagreement_score":0.010368651,"about_ca_system_score_codex":0.0013520998,"about_ca_system_score_gemma":0.001817296,"threshold_uncertainty_score":0.034686565},"labels":[],"label_agreement":null},{"id":"W2949216549","doi":"10.1109/fpt.2018.00026","title":"Tatum: Parallel Timing Analysis for Faster Design Cycles and Improved Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Kernel (algebra); Field-programmable gate array; Overhead (engineering); Correctness; Static timing analysis; Application-specific integrated circuit; Speedup; Multi-core processor; Compiler; Central processing unit; Embedded system; Computer hardware; Algorithm; Operating system","score_opus":0.028441975187797126,"score_gpt":0.2460384257316878,"score_spread":0.21759645054389068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949216549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065431245,0.00093032944,0.868348,0.00047278503,0.00030970768,0.00017114551,0.00088043604,0.046577558,0.016878864],"genre_scores_gemma":[0.38436207,0.00044494067,0.5985942,0.0003334432,0.00012662633,0.00032184017,0.0013163872,0.005172437,0.009327967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879944,0.00023692056,0.00007715966,0.00020326438,0.0005174263,0.00016575123],"domain_scores_gemma":[0.99847525,0.00049359567,0.000206213,0.00039474602,0.00039414602,0.000036102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314513,0.0018783011,0.00068806397,0.0016060101,0.0005717125,0.0014748437,0.001304303,0.0004797909,0.016801678],"category_scores_gemma":[0.0029702669,0.0005353979,0.0009736537,0.0015539319,0.00045447942,0.0016234075,0.0005892914,0.0010988755,0.0019199986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013896563,0.0002853151,0.0061075296,0.0009854092,0.00029976826,0.00035594663,0.00020004362,0.20176317,0.13893966,0.035107672,0.04417602,0.5703898],"study_design_scores_gemma":[0.00019496714,0.00042766682,0.0013184546,0.000058299964,0.00016210673,0.00029447838,0.000051972125,0.8437624,0.11320839,0.013932385,0.02652685,0.00006211718],"about_ca_topic_score_codex":0.004187882,"about_ca_topic_score_gemma":0.0066985535,"teacher_disagreement_score":0.016801678,"about_ca_system_score_codex":0.0011514039,"about_ca_system_score_gemma":0.0026064138,"threshold_uncertainty_score":0.05620724},"labels":[],"label_agreement":null},{"id":"W2951713654","doi":"10.1109/fpt.2018.00040","title":"Synthesizable Heterogeneous FPGA Fabrics","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stratix; Field-programmable gate array; Verilog; Computer science; Embedded system; Application-specific integrated circuit; Reuse; Computer architecture; Parallel computing; Computer hardware; Engineering","score_opus":0.010337273248006614,"score_gpt":0.20104452661585184,"score_spread":0.19070725336784522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951713654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19720063,0.00043417927,0.7681117,0.000111073176,0.0001230696,0.00024143384,0.0007701073,0.0067775203,0.026230328],"genre_scores_gemma":[0.7356914,0.0002461041,0.25809112,0.00006225893,0.000017115899,0.00014513731,0.00075765786,0.0005435175,0.0044456213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974686,0.00004610302,0.000015470909,0.000048832426,0.000094906114,0.000047795213],"domain_scores_gemma":[0.99974054,0.00009537096,0.00003158816,0.000078970355,0.000042059164,0.000011418988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028183704,0.0005983719,0.0002645295,0.00036954894,0.00022408046,0.0005243941,0.00068757357,0.00030918024,0.004221056],"category_scores_gemma":[0.0006734748,0.0002507795,0.0004789679,0.00021891209,0.0002439754,0.00046423715,0.0003590341,0.0003492376,0.0005586413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016983344,0.00008766747,0.0015233421,0.00041229496,0.00006198481,0.00079006894,0.000104971565,0.68243545,0.15524757,0.03889231,0.0025329555,0.11774149],"study_design_scores_gemma":[0.000069862195,0.0002771932,0.0006642759,0.00004375076,0.000053326665,0.0002954454,0.000042943884,0.8556383,0.10848738,0.011089467,0.02331824,0.000019749128],"about_ca_topic_score_codex":0.00087355374,"about_ca_topic_score_gemma":0.0016047546,"teacher_disagreement_score":0.004221056,"about_ca_system_score_codex":0.00044204318,"about_ca_system_score_gemma":0.00048817837,"threshold_uncertainty_score":0.014120817},"labels":[],"label_agreement":null},{"id":"W2952969041","doi":"10.48550/arxiv.1509.01190","title":"Advanced Multilevel Node Separator Algorithms","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Iterated local search; Computer science; Graph; Graph partition; Algorithm; Iterated function; Separator (oil production); Theoretical computer science; Local search (optimization); Mathematics","score_opus":0.07977483864723559,"score_gpt":0.19768250421305283,"score_spread":0.11790766556581725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952969041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014164469,0.000310428,0.97983,0.00014470192,0.000037314418,0.0000815556,0.00019714059,0.0013555743,0.00387882],"genre_scores_gemma":[0.18032098,0.0002445244,0.81158984,0.0001562859,0.00005368298,0.00026744572,0.00079617836,0.00041030344,0.0061608297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.00014237626,0.00005553479,0.00017712185,0.00028269837,0.000105587525],"domain_scores_gemma":[0.998408,0.00059647195,0.00017257934,0.00039299464,0.000345961,0.00008395186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082734245,0.0008380809,0.0011058404,0.0015843358,0.00061991933,0.001280104,0.0021942577,0.0012278588,0.0099584395],"category_scores_gemma":[0.0041944813,0.00044451893,0.001081791,0.0014882747,0.0005591915,0.0020432586,0.0024399618,0.0015540171,0.0022196528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003135299,0.00015466279,0.0013440612,0.0003743636,0.00011732466,0.00011196222,0.00029188505,0.4723225,0.014176857,0.051123686,0.011036328,0.4486328],"study_design_scores_gemma":[0.000045418154,0.000063206055,0.00016651179,0.000024963254,0.000018313283,0.000048764963,0.00003179382,0.9731426,0.0035543863,0.018383406,0.0045092735,0.000011301203],"about_ca_topic_score_codex":0.0029829154,"about_ca_topic_score_gemma":0.005581,"teacher_disagreement_score":0.0099584395,"about_ca_system_score_codex":0.0009663044,"about_ca_system_score_gemma":0.0011683884,"threshold_uncertainty_score":0.033314347},"labels":[],"label_agreement":null},{"id":"W2954158457","doi":"10.1016/j.dam.2019.06.007","title":"Spectral bounds for graph partitioning with prescribed partition sizes","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Graph partition; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph energy; Strength of a graph; Graph; Adjacency list; Partition (number theory); Spectral graph theory; Undirected graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.008739207267766799,"score_gpt":0.20691535695033877,"score_spread":0.19817614968257197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954158457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04783006,0.0010596246,0.9171583,0.0011735415,0.00014686688,0.000117057774,0.0004554228,0.0005612732,0.03149788],"genre_scores_gemma":[0.73510337,0.0021084915,0.24814151,0.0010810312,0.0004068532,0.0006553506,0.00097579375,0.000979718,0.010547828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746466,0.0007784521,0.00009155465,0.00034504768,0.00093577063,0.00038453317],"domain_scores_gemma":[0.9735286,0.020675704,0.0011384051,0.0020641868,0.0016719163,0.00092126336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033464693,0.002035739,0.0015291652,0.0026555085,0.0013782824,0.00338651,0.00276542,0.001964167,0.009229087],"category_scores_gemma":[0.028106013,0.0009264678,0.0010473222,0.0026699696,0.0033233438,0.005137086,0.004343547,0.003410725,0.0015710635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039361388,0.0001330081,0.0005530748,0.00047954003,0.000059075715,0.000100068944,0.00038568003,0.26412642,0.009115175,0.6817645,0.0070018065,0.035888065],"study_design_scores_gemma":[0.000028840124,0.000056517194,0.00027380892,0.000090832305,0.000026655238,0.00007126573,0.0000886212,0.51603395,0.0027817013,0.47846034,0.0020663512,0.000021130094],"about_ca_topic_score_codex":0.0015982031,"about_ca_topic_score_gemma":0.0025021287,"teacher_disagreement_score":0.009229087,"about_ca_system_score_codex":0.0025190196,"about_ca_system_score_gemma":0.0013605995,"threshold_uncertainty_score":0.030874372},"labels":[],"label_agreement":null},{"id":"W2957361546","doi":"10.1145/3337801.3337818","title":"Physical Design Considerations for Synthesizable Standard-Cell-Based FPGAs","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Embedded system; Standard cell; Computer science; Floorplan; Physical design; FPGA prototype; System on a chip; Computer hardware; Computer architecture; Circuit design; Integrated circuit; Operating system","score_opus":0.018915354305505973,"score_gpt":0.22631722286808173,"score_spread":0.20740186856257575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957361546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15977615,0.0009290247,0.8283223,0.00025959863,0.000073944546,0.00008852882,0.0002995887,0.0010928311,0.009158038],"genre_scores_gemma":[0.84226966,0.0007279357,0.15454721,0.000072394105,0.000027921673,0.00008118804,0.00018198729,0.00018801865,0.0019036706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.000080631835,0.000022030275,0.00004249656,0.00017633174,0.000030977964],"domain_scores_gemma":[0.99934965,0.00035340554,0.00011445858,0.00009332976,0.00007852022,0.00001060121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041994505,0.00032449834,0.00016581333,0.00024091858,0.00015200606,0.0006308342,0.000519951,0.0002891956,0.0011271422],"category_scores_gemma":[0.0013131284,0.00022248275,0.0002256957,0.0001587323,0.00027979957,0.0004481731,0.00019096605,0.00033843875,0.00023052121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056277288,0.000025422807,0.001236761,0.00024508976,0.000028549468,0.00039015576,0.00009343404,0.835175,0.11497568,0.021441717,0.0005300524,0.025801782],"study_design_scores_gemma":[0.000012524122,0.0002300677,0.00075170613,0.000026436963,0.000030542844,0.0002673616,0.000046201032,0.9288063,0.05506365,0.006809843,0.007939614,0.000015747948],"about_ca_topic_score_codex":0.0006968902,"about_ca_topic_score_gemma":0.0015074068,"teacher_disagreement_score":0.0011271422,"about_ca_system_score_codex":0.00052944187,"about_ca_system_score_gemma":0.00048580876,"threshold_uncertainty_score":0.0038413405},"labels":[],"label_agreement":null},{"id":"W2981891337","doi":"10.1109/dsd.2019.00031","title":"Improving Digital Circuit Simulation with Batch-Parallel Logic Evaluation","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Correctness; Traverse; Parallel computing; Node (physics); Electronic circuit; Process (computing); Digital electronics; Sequential logic; Field-programmable gate array; Graph; Speedup; Computer engineering; Logic gate; Algorithm; Computer hardware; Theoretical computer science; Programming language","score_opus":0.019647996097110428,"score_gpt":0.22780727086889085,"score_spread":0.20815927477178042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981891337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.151008,0.00046230797,0.82491165,0.00022984596,0.00014045404,0.000173776,0.0004751345,0.011580627,0.011018243],"genre_scores_gemma":[0.67023337,0.00019378755,0.3237237,0.000103570426,0.000026804126,0.00019298196,0.0007052564,0.00089559035,0.003924984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994367,0.00012396103,0.000027248754,0.000100897305,0.00023311286,0.0000779433],"domain_scores_gemma":[0.99817777,0.00092143106,0.00010049937,0.00036800624,0.0003539775,0.00007822258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746477,0.00091031013,0.0008817116,0.00048718092,0.00042352526,0.00088261394,0.002339448,0.00066996826,0.0063773766],"category_scores_gemma":[0.0029455142,0.0004513412,0.000753747,0.0006042398,0.00049177435,0.001497896,0.00066989486,0.000934706,0.0007729723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038477313,0.00015186127,0.0023195054,0.00016667122,0.00005122779,0.00007956023,0.000066647415,0.93408895,0.011860232,0.0049063815,0.0023428444,0.04358142],"study_design_scores_gemma":[0.00002075779,0.000029701258,0.000096189135,0.000002566098,0.0000067347564,0.000008849852,0.000004876979,0.99471456,0.0035809786,0.00092747953,0.0006032819,0.000003977408],"about_ca_topic_score_codex":0.010356964,"about_ca_topic_score_gemma":0.01179107,"teacher_disagreement_score":0.010356964,"about_ca_system_score_codex":0.0012693179,"about_ca_system_score_gemma":0.0018722909,"threshold_uncertainty_score":0.02133441},"labels":[],"label_agreement":null},{"id":"W2983726556","doi":"10.1109/fpl.2019.00060","title":"A Deep Learning Framework to Predict Routability for FPGA Circuit Placement","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Convolutional neural network; Deep learning; Placement; Computer architecture; Computer engineering; Artificial intelligence; Gate array; Parallel computing; Artificial neural network; State (computer science); Algorithm; Embedded system; Circuit design; Physical design","score_opus":0.011468532993046529,"score_gpt":0.22942320961472107,"score_spread":0.21795467662167453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983726556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051506992,0.00055664295,0.9410415,0.0002670135,0.00005955325,0.000043071683,0.0003876064,0.003925159,0.0022124632],"genre_scores_gemma":[0.7501046,0.00035730697,0.24290493,0.0001531429,0.000047044174,0.000098259006,0.0010197748,0.00017430623,0.0051406003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985445,0.00002021367,0.000007466153,0.0000478409,0.000045501412,0.000024475856],"domain_scores_gemma":[0.9996468,0.00013080343,0.000053862692,0.000044005446,0.00010741879,0.000017168544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743856,0.0010698686,0.00040251517,0.000693736,0.0002257142,0.0005265067,0.0012744743,0.00072480337,0.0021515316],"category_scores_gemma":[0.0011654061,0.00046923046,0.00042554145,0.0005542493,0.00034633794,0.0007649627,0.00037632207,0.001047938,0.00049446203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004418618,0.00003610115,0.00082871184,0.000027298593,0.000020486925,0.00003896406,0.000009466596,0.9275794,0.0032577433,0.0011782853,0.0013865744,0.06559279],"study_design_scores_gemma":[0.0000016721393,0.000008851009,0.0000811963,0.0000017200751,0.0000027690576,0.000006179702,0.000001285503,0.99836606,0.0008020787,0.00055525417,0.00017165406,0.0000012562143],"about_ca_topic_score_codex":0.0125854695,"about_ca_topic_score_gemma":0.026547298,"teacher_disagreement_score":0.0125854695,"about_ca_system_score_codex":0.0012488116,"about_ca_system_score_gemma":0.0011703662,"threshold_uncertainty_score":0.025024414},"labels":[],"label_agreement":null},{"id":"W2991030845","doi":"10.1145/3339985.3358497","title":"Verilog Loop Unrolling, Module Generation, Part-Select and Arithmetic Right Shift Support in Odin II","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Netlist; Verilog; Computer science; Field-programmable gate array; Hardware description language; Computer architecture; Routing (electronic design automation); Computer hardware; Embedded system","score_opus":0.009178310594513977,"score_gpt":0.19826280809694197,"score_spread":0.18908449750242798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991030845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018973334,0.00044620698,0.9017667,0.00026940834,0.00029470268,0.00033759823,0.0029858775,0.039996553,0.034929607],"genre_scores_gemma":[0.37835026,0.00088019343,0.55691314,0.0010923536,0.00010795495,0.0006639058,0.008153287,0.007361074,0.04647784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992613,0.00010348287,0.0000674935,0.00013348681,0.00032286518,0.00011129495],"domain_scores_gemma":[0.99915016,0.00031098223,0.000076573735,0.00024019092,0.00020076684,0.000021268912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533837,0.00074009673,0.00033239156,0.00062481733,0.0003309355,0.0015153959,0.0012131805,0.00036652925,0.012800759],"category_scores_gemma":[0.0018195907,0.0004509543,0.0004210233,0.0003876976,0.00061512174,0.0012965242,0.0005989299,0.0010257014,0.0039242064],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017251894,0.000351694,0.0029942608,0.0017631022,0.000058696998,0.0009213254,0.00073144224,0.048533563,0.14988242,0.16448104,0.051385667,0.5771716],"study_design_scores_gemma":[0.00037863664,0.00049024133,0.0011701355,0.00039391886,0.0000985655,0.0011117135,0.00010484151,0.16407149,0.31258106,0.032505434,0.48698682,0.00010720132],"about_ca_topic_score_codex":0.0019391747,"about_ca_topic_score_gemma":0.0025968084,"teacher_disagreement_score":0.012800759,"about_ca_system_score_codex":0.0009226363,"about_ca_system_score_gemma":0.0014554586,"threshold_uncertainty_score":0.04282278},"labels":[],"label_agreement":null},{"id":"W2991158361","doi":"10.1109/sielmen.2019.8905907","title":"CSAP and TFSG – Circuit Symbolic Analysis Programs","year":2019,"lang":"en","type":"article","venue":"2019 International Conference on Electromechanical and Energy Systems (SIELMEN)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern Alberta Institute of Technology","funders":"","keywords":"Computer science; Symbolic data analysis; Symbolic execution; Programming language; Theoretical computer science; Software","score_opus":0.014086375612271862,"score_gpt":0.21009545366806476,"score_spread":0.1960090780557929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991158361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027667051,0.00010624451,0.9809777,0.00015433223,0.00004584465,0.00009074723,0.00048184593,0.008091062,0.0072856345],"genre_scores_gemma":[0.1113166,0.00051547505,0.87011987,0.00041999246,0.00012261343,0.00077748013,0.0020644509,0.0021381918,0.012525334],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993255,0.00020136415,0.00003991433,0.00014168832,0.00022375512,0.00006782634],"domain_scores_gemma":[0.99887913,0.0006895739,0.00006744825,0.00014015163,0.00020092592,0.000022862767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067893934,0.001326258,0.00039355663,0.0012992851,0.00043532072,0.0012940113,0.000966112,0.0006013643,0.019745396],"category_scores_gemma":[0.0031369345,0.00034198439,0.0010632606,0.0010469521,0.0011164657,0.0010382433,0.00088935305,0.0015761362,0.0040526055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025389888,0.00009831176,0.0008652331,0.0007217003,0.00007789971,0.00039713664,0.0004867006,0.09224464,0.012188379,0.3807055,0.03133812,0.48062253],"study_design_scores_gemma":[0.0001228822,0.00017243458,0.0004106023,0.00020810623,0.00006937986,0.000564695,0.00013473436,0.5346194,0.03024263,0.28363457,0.14976203,0.000058555615],"about_ca_topic_score_codex":0.0014910841,"about_ca_topic_score_gemma":0.0014462308,"teacher_disagreement_score":0.019745396,"about_ca_system_score_codex":0.0007305671,"about_ca_system_score_gemma":0.0011880384,"threshold_uncertainty_score":0.066055},"labels":[],"label_agreement":null},{"id":"W2997995007","doi":"10.48550/arxiv.1912.09232","title":"Improving Clique Decompositions of Semidefinite Relaxations for Optimal\\n Power Flow Problems","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Semidefinite programming; Clique; Mathematics; Chordal graph; Mathematical optimization; Decomposition; Power flow; Clique problem; Extension (predicate logic); Flow (mathematics); Power (physics); Computer science; Combinatorics; Electric power system; Graph","score_opus":0.04127062701432777,"score_gpt":0.1787413784370388,"score_spread":0.13747075142271103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997995007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06652852,0.00034222717,0.91720635,0.00058130233,0.000097484146,0.00015960108,0.00032305738,0.0008943819,0.013867024],"genre_scores_gemma":[0.40870878,0.00036870482,0.58430403,0.00034269437,0.000095959396,0.00029047753,0.0009964519,0.000577815,0.004315024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843866,0.0008082791,0.000048843976,0.00019557818,0.00030970783,0.0001990254],"domain_scores_gemma":[0.9955128,0.0031442489,0.00024690852,0.0005190725,0.0003671786,0.00020972347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029811645,0.0015936793,0.0009626082,0.0010304551,0.0006040985,0.001537535,0.0011826262,0.00103573,0.0061806845],"category_scores_gemma":[0.008140934,0.0006309592,0.001245718,0.0011440302,0.0010124564,0.0019916422,0.0017071002,0.0027699422,0.00076560624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002395025,0.00038976897,0.00043336404,0.00016921881,0.000054077744,0.000059768536,0.00012708822,0.8834963,0.0039190813,0.048040625,0.0065219607,0.056549247],"study_design_scores_gemma":[0.000041919193,0.0000503588,0.00005962221,0.000010346282,0.000006864847,0.000011399007,0.000023962042,0.9835941,0.0009879066,0.014354456,0.0008536375,0.0000053960243],"about_ca_topic_score_codex":0.0027076825,"about_ca_topic_score_gemma":0.005290282,"teacher_disagreement_score":0.0061806845,"about_ca_system_score_codex":0.0011450055,"about_ca_system_score_gemma":0.0014345741,"threshold_uncertainty_score":0.020676434},"labels":[],"label_agreement":null},{"id":"W3003197669","doi":"10.1109/icfpt47387.2019.00025","title":"Partitioning FPGA-Optimized Systolic Arrays for Fun and Profit","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Systolic array; Field-programmable gate array; Computer science; Parallel computing; Partition (number theory); Latency (audio); Throughput; Algorithm; Computer hardware; Embedded system; Very-large-scale integration; Mathematics","score_opus":0.009325196011428774,"score_gpt":0.20386849833754533,"score_spread":0.19454330232611655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003197669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21032326,0.0006683555,0.76141506,0.000780352,0.0001487747,0.000085124106,0.00028360353,0.0045487,0.021746797],"genre_scores_gemma":[0.73672247,0.0002631838,0.2573527,0.00019739832,0.00003637134,0.000057193036,0.0003107609,0.00021884787,0.004841169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998061,0.000036663412,0.000013182488,0.000033853375,0.0000572346,0.00005291811],"domain_scores_gemma":[0.99969697,0.0000948755,0.00004731068,0.000076365366,0.00006797571,0.000016595404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024027353,0.00047032742,0.00025087062,0.0003006387,0.00022038246,0.00060557073,0.0006466145,0.00020939118,0.0044118534],"category_scores_gemma":[0.0009166674,0.0002134536,0.00020678218,0.00044803662,0.00025464976,0.0008991603,0.00037627885,0.00040030852,0.0008571776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004986553,0.0001779412,0.0033580472,0.00020158997,0.000053503336,0.00020263022,0.00013046552,0.39408284,0.12075345,0.027430464,0.010187787,0.44292256],"study_design_scores_gemma":[0.00005929557,0.0003295941,0.0015659556,0.000027992315,0.000036268437,0.00012647899,0.00010967537,0.889053,0.07711047,0.016275717,0.015281144,0.000024336197],"about_ca_topic_score_codex":0.0021838925,"about_ca_topic_score_gemma":0.007571686,"teacher_disagreement_score":0.0044118534,"about_ca_system_score_codex":0.00087297417,"about_ca_system_score_gemma":0.0012211109,"threshold_uncertainty_score":0.014759123},"labels":[],"label_agreement":null},{"id":"W3006437160","doi":"10.48550/arxiv.2002.06998","title":"RapidLayout: Fast Hard Block Placement of FPGA-optimized Systolic Arrays using Evolutionary Algorithms","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs; Sun Yat-sen University; CMC Microsystems","keywords":"Field-programmable gate array; Computer science; Parallel computing; Systolic array; Placement; Algorithm; Minimum bounding box; Block (permutation group theory); Routing (electronic design automation); Simulated annealing; Floorplan; Computer hardware; Embedded system; Very-large-scale integration; Physical design; Circuit design; Mathematics; Artificial intelligence","score_opus":0.07501290098818877,"score_gpt":0.18550282673030283,"score_spread":0.11048992574211405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006437160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06206601,0.00027798605,0.9054751,0.00016993919,0.00010737778,0.00014286028,0.00027931953,0.019306403,0.01217503],"genre_scores_gemma":[0.27475,0.00015447353,0.7148015,0.00014096653,0.000022878778,0.00017713009,0.0006183863,0.0019169025,0.0074177673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998134,0.000042645104,0.0000077364375,0.00003155884,0.00007338875,0.000031226948],"domain_scores_gemma":[0.99971336,0.00014058259,0.00003253806,0.000044458226,0.000053553875,0.000015522412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598351,0.00095693424,0.00035911487,0.00036806805,0.00028667282,0.0005286489,0.0010096615,0.00052642036,0.00868794],"category_scores_gemma":[0.00089462125,0.00040993016,0.00044354599,0.00026209909,0.0003155025,0.00049828313,0.0005650405,0.0005643855,0.0011057114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847361,0.00009629351,0.0011689385,0.00021502723,0.000050815124,0.00020919493,0.00010057212,0.68359613,0.036749482,0.009812047,0.01296742,0.25484928],"study_design_scores_gemma":[0.00007711331,0.000120568526,0.0002493356,0.000016053144,0.000009296918,0.000050436225,0.000025780948,0.9723656,0.016696794,0.0030299465,0.0073455907,0.000013404016],"about_ca_topic_score_codex":0.0026991873,"about_ca_topic_score_gemma":0.006016702,"teacher_disagreement_score":0.00868794,"about_ca_system_score_codex":0.00055547757,"about_ca_system_score_gemma":0.00094955094,"threshold_uncertainty_score":0.02906406},"labels":[],"label_agreement":null},{"id":"W3009193187","doi":"10.1109/tcad.2020.2977605","title":"An Automated Topology Synthesis Framework for Analog Integrated Circuits","year":2020,"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":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Research and Development Corporation of Newfoundland and Labrador; Canada Foundation for Innovation","keywords":"Network topology; Topology (electrical circuits); Computer science; Algorithm; Tree (set theory); Mathematics; Engineering; Electrical engineering","score_opus":0.04061444235109959,"score_gpt":0.2629130206829645,"score_spread":0.22229857833186492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009193187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044163922,0.0001358104,0.99612457,0.00003242518,0.000020559715,0.000047546255,0.000088038374,0.0013325842,0.0017768966],"genre_scores_gemma":[0.03279183,0.00041204956,0.9635423,0.000056098543,0.00004916169,0.000289894,0.00048424836,0.00031845187,0.002055976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.00016980639,0.000055843895,0.00011533543,0.0004044686,0.000050185434],"domain_scores_gemma":[0.9996594,0.00012590864,0.000026113008,0.00008456888,0.000088651424,0.000015392208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613314,0.001128539,0.0007650527,0.0015659177,0.0007094405,0.00143426,0.001810554,0.00067854347,0.0075070984],"category_scores_gemma":[0.001400461,0.00055119424,0.0015042144,0.000999345,0.0007657891,0.0013699196,0.0010598783,0.001257734,0.0023086842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055196022,0.00006538283,0.00021360378,0.00045624207,0.00008060108,0.00035495468,0.00015212456,0.2833542,0.025290499,0.31984803,0.0077827666,0.3623464],"study_design_scores_gemma":[0.00006556827,0.00009254759,0.00010659439,0.000095368414,0.00004568493,0.00033811427,0.000035730227,0.72769725,0.010362605,0.18475601,0.07636119,0.000043358315],"about_ca_topic_score_codex":0.0024471018,"about_ca_topic_score_gemma":0.003494444,"teacher_disagreement_score":0.0075070984,"about_ca_system_score_codex":0.0009758241,"about_ca_system_score_gemma":0.0014066825,"threshold_uncertainty_score":0.025113702},"labels":[],"label_agreement":null},{"id":"W3009491659","doi":"10.1137/1.9781611976229.10","title":"Generalized Gains for Hybrid Vertex Separator Algorithms","year":2020,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Computer science; Separator (oil production); Reuse; Algorithm; Graph; Theoretical computer science; Engineering","score_opus":0.07819017564935744,"score_gpt":0.2533407399016599,"score_spread":0.17515056425230247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009491659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006658498,0.00015964232,0.9868889,0.000070002905,0.00003107777,0.000041443884,0.00004637711,0.00060241716,0.0055016573],"genre_scores_gemma":[0.24223754,0.00043715307,0.7461437,0.00013080423,0.00006751113,0.00023892857,0.0003257447,0.00041826212,0.010000338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991504,0.000162934,0.000039161147,0.000114876086,0.00043548393,0.00009718689],"domain_scores_gemma":[0.99890614,0.00053132605,0.000053824682,0.00027118943,0.00019367675,0.000043954813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070229353,0.0009250623,0.0006034108,0.0009617287,0.0005282472,0.0015983377,0.0016519293,0.0006799145,0.0073325075],"category_scores_gemma":[0.003389313,0.0003513959,0.00055376714,0.001084637,0.0008627767,0.0026405703,0.0021215333,0.0016706795,0.0019570645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024540236,0.000084497806,0.00037358346,0.00019483721,0.000051687857,0.000074736934,0.00014157085,0.36982515,0.017238194,0.279596,0.0050209947,0.32715335],"study_design_scores_gemma":[0.00003825658,0.00007020423,0.00011993994,0.000024460896,0.000015641976,0.00007076045,0.00003518914,0.8101006,0.010250151,0.17081998,0.008436499,0.00001834514],"about_ca_topic_score_codex":0.0011149835,"about_ca_topic_score_gemma":0.0022756075,"teacher_disagreement_score":0.0073325075,"about_ca_system_score_codex":0.0014456057,"about_ca_system_score_gemma":0.0009304964,"threshold_uncertainty_score":0.024529696},"labels":[],"label_agreement":null},{"id":"W3010080362","doi":"","title":"Minimum length disjoint paths and Capacitated (rooted) Steiner Tree","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Steiner tree problem; Disjoint sets; Combinatorics; Computer science; Tree (set theory); Mathematics","score_opus":0.012510111540356373,"score_gpt":0.20264043120676392,"score_spread":0.19013031966640756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010080362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23467633,0.0015179771,0.71766907,0.0019951805,0.00013877299,0.0001993331,0.003061406,0.0006662101,0.040075663],"genre_scores_gemma":[0.70208305,0.0017730169,0.2684971,0.0002988715,0.00014711791,0.00022509458,0.0028863673,0.00029291617,0.023796417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994469,0.00011889727,0.000035774003,0.00016218322,0.00015830828,0.00007785792],"domain_scores_gemma":[0.9981719,0.0010245783,0.0002629338,0.00016497816,0.00021809353,0.00015738526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038129534,0.00067098776,0.0007421715,0.00089032855,0.00067671936,0.0015633748,0.0016096062,0.0012548938,0.00905262],"category_scores_gemma":[0.00402236,0.00059960043,0.00050947693,0.0023037822,0.00066159747,0.002451753,0.0013053145,0.0013269597,0.0010536084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084700785,0.0002105762,0.0017783184,0.0015275554,0.0001497552,0.0007154648,0.00044816112,0.5273277,0.017774455,0.30769664,0.01711799,0.12440632],"study_design_scores_gemma":[0.000091942806,0.0002063663,0.0013657819,0.00011096133,0.00008168911,0.00065374444,0.00022511752,0.47709614,0.005305938,0.50411177,0.010707994,0.00004255219],"about_ca_topic_score_codex":0.0011796982,"about_ca_topic_score_gemma":0.0020739974,"teacher_disagreement_score":0.00905262,"about_ca_system_score_codex":0.0011880061,"about_ca_system_score_gemma":0.0008008036,"threshold_uncertainty_score":0.030284107},"labels":[],"label_agreement":null},{"id":"W3011140373","doi":"10.1109/icm48031.2019.9021943","title":"Enhancing the Performance of FPGA Congestion Management via Supervised Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Lookup table; Key (lock); Computer architecture; Embedded system; Placement; Computer engineering; Physical design; Circuit design; Operating system","score_opus":0.004616403771878333,"score_gpt":0.17836288244459259,"score_spread":0.17374647867271426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011140373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26664558,0.0014430233,0.71824396,0.00045361472,0.00016112611,0.000099658944,0.00014354255,0.008458454,0.0043511875],"genre_scores_gemma":[0.93019795,0.00014722085,0.06813678,0.000083021354,0.000042289437,0.000033108918,0.00016616762,0.000077632336,0.0011159048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996164,0.00009471363,0.00001924815,0.000098680735,0.00009723972,0.00007361336],"domain_scores_gemma":[0.99871063,0.0006581181,0.00017298266,0.00015848159,0.00024660188,0.000053245963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093801995,0.0009953594,0.00064728846,0.00053070346,0.0003218548,0.00058057293,0.001196917,0.00073012337,0.001553878],"category_scores_gemma":[0.003216076,0.0002695907,0.00032464194,0.0004085674,0.0003686044,0.0009668938,0.00053011294,0.00081906683,0.00050961704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974899,0.00021856431,0.0026262344,0.000073830444,0.000065400985,0.00006705608,0.000026272839,0.68483466,0.00830797,0.00088393356,0.0017326223,0.30086598],"study_design_scores_gemma":[0.000007320418,0.00006421215,0.00023848927,0.0000022630586,0.0000058915807,0.0000113616925,0.0000039873667,0.9972452,0.0019827923,0.00032477596,0.00011047479,0.0000032511712],"about_ca_topic_score_codex":0.0038978725,"about_ca_topic_score_gemma":0.004106309,"teacher_disagreement_score":0.0038978725,"about_ca_system_score_codex":0.00067978946,"about_ca_system_score_gemma":0.0009861524,"threshold_uncertainty_score":0.007750392},"labels":[],"label_agreement":null},{"id":"W3011353849","doi":"10.1137/20m1330762","title":"A Spectral Approach to Network Design","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Theoretical computer science","score_opus":0.024522106779222865,"score_gpt":0.22343676694356532,"score_spread":0.19891466016434245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011353849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086888514,0.00011661721,0.99494714,0.00017638168,0.000034060038,0.000017992834,0.00001751783,0.000053807846,0.0037675453],"genre_scores_gemma":[0.17364292,0.0010928945,0.8169023,0.00051748357,0.00021849012,0.00030535433,0.00012618832,0.00015362557,0.0070407265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782556,0.0009911377,0.00008346434,0.00032680915,0.00064801343,0.00012490233],"domain_scores_gemma":[0.99699867,0.0017116673,0.00018583676,0.0005968423,0.0004021239,0.000104871375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002808,0.0012105376,0.0007725503,0.0010554121,0.0008843977,0.001972455,0.0016630612,0.0012616075,0.0071595376],"category_scores_gemma":[0.0074715125,0.0006683325,0.0010717466,0.001195561,0.001995082,0.0029664398,0.0020471944,0.0032585831,0.0013013274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036570702,0.000055544937,0.00015182485,0.00013380095,0.0000286888,0.000044175078,0.00008134655,0.33240345,0.0022160131,0.6109193,0.002437618,0.051491678],"study_design_scores_gemma":[0.000012723665,0.000043070457,0.00003469705,0.000031269137,0.000009910845,0.000051709445,0.00002610851,0.65763617,0.0011241125,0.3328156,0.008203065,0.000011578557],"about_ca_topic_score_codex":0.0010063354,"about_ca_topic_score_gemma":0.0013907056,"teacher_disagreement_score":0.0071595376,"about_ca_system_score_codex":0.0015978424,"about_ca_system_score_gemma":0.0013116946,"threshold_uncertainty_score":0.023950994},"labels":[],"label_agreement":null},{"id":"W3011875640","doi":"10.1145/3337792","title":"Algorithm 1003","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; National Science Foundation","keywords":"Computer science; Graph partition; Theoretical computer science; Parallel computing; Mathematical optimization; Algorithm; Graph; Mathematics","score_opus":0.023439222531116806,"score_gpt":0.22771702112117392,"score_spread":0.20427779859005712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011875640","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019502694,0.00046413662,0.84046906,0.001468236,0.0006948902,0.0013451478,0.00505616,0.009221797,0.121777885],"genre_scores_gemma":[0.18350746,0.00038101856,0.6655592,0.0011696838,0.00019047366,0.001684196,0.012124547,0.0032731374,0.13211031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933666,0.00009535481,0.000040210147,0.00024791557,0.00015668079,0.00012313202],"domain_scores_gemma":[0.9993954,0.00020509641,0.000028623814,0.00015359004,0.00018435762,0.000033047385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344941,0.001139243,0.00073634466,0.0011335544,0.00095668755,0.0018903887,0.0014874777,0.0014375411,0.13129696],"category_scores_gemma":[0.0031054842,0.00029895408,0.0007041006,0.0010324725,0.00047927987,0.0014234241,0.0015608988,0.0010746026,0.041177895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005378116,0.0002330676,0.001778762,0.0004502301,0.000098873556,0.00017601643,0.000119316275,0.08078257,0.005003432,0.09008608,0.14280456,0.6779293],"study_design_scores_gemma":[0.0005421902,0.00022852351,0.0008288243,0.00014904958,0.0000683922,0.000517513,0.00032989093,0.60631907,0.00977356,0.18989559,0.19129178,0.000055561908],"about_ca_topic_score_codex":0.0031146205,"about_ca_topic_score_gemma":0.005370204,"teacher_disagreement_score":0.13129696,"about_ca_system_score_codex":0.0008551577,"about_ca_system_score_gemma":0.002355131,"threshold_uncertainty_score":0.4392321},"labels":[],"label_agreement":null},{"id":"W3013345876","doi":"10.1109/asp-dac47756.2020.9045588","title":"Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign","keywords":"Graph partition; Computer science; Parallel computing; Speedup; Graph bandwidth; Graph; Strength of a graph; Computation; Theoretical computer science; Algorithm; Voltage graph; Line graph","score_opus":0.01931914162918906,"score_gpt":0.24962297289973262,"score_spread":0.23030383127054355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013345876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07666713,0.00067253155,0.8801461,0.00017293697,0.000161338,0.00013226083,0.0005263895,0.024772976,0.01674842],"genre_scores_gemma":[0.29684317,0.0003247001,0.6891267,0.00016205947,0.000025163188,0.00018938468,0.0022829769,0.0023627596,0.008683129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981207,0.000026934065,0.000008412144,0.000034137553,0.00008693552,0.000031543033],"domain_scores_gemma":[0.9998109,0.000055868837,0.000017989461,0.00004235504,0.000045834688,0.00002701584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020828248,0.00077272556,0.0003889869,0.000702637,0.00031578596,0.00077621493,0.001068269,0.00037329068,0.008264228],"category_scores_gemma":[0.0005478679,0.00029929916,0.00041684782,0.0008241837,0.0002775566,0.0008355507,0.00081931625,0.000488032,0.0012440095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012212751,0.0003519245,0.0034431869,0.0006286406,0.0002349522,0.00048065188,0.0004427411,0.13956708,0.14262906,0.028590027,0.05165078,0.63075966],"study_design_scores_gemma":[0.00027349775,0.00023454979,0.0012825986,0.000037471567,0.000030578674,0.0003223172,0.00009503748,0.9054214,0.04372903,0.009059011,0.039473463,0.000041024174],"about_ca_topic_score_codex":0.0028984274,"about_ca_topic_score_gemma":0.005743653,"teacher_disagreement_score":0.008264228,"about_ca_system_score_codex":0.0005319496,"about_ca_system_score_gemma":0.00070131273,"threshold_uncertainty_score":0.027646542},"labels":[],"label_agreement":null},{"id":"W3013952364","doi":"10.1109/asp-dac47756.2020.9045175","title":"AIR: A Fast but Lazy Timing-Driven FPGA Router","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Router; Computer science; Routing (electronic design automation); Field-programmable gate array; Path (computing); Key (lock); One-armed router; Process (computing); Metrics; Static routing; Static timing analysis; Network routing; Embedded system; Distributed computing; Computer network; Parallel computing; Routing protocol; Operating system","score_opus":0.021713728271957163,"score_gpt":0.20615991764317024,"score_spread":0.18444618937121307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013952364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084164746,0.0016880098,0.8733582,0.00032150547,0.00035340656,0.00023201316,0.00025467278,0.019754143,0.019873396],"genre_scores_gemma":[0.53825307,0.0006440312,0.44609672,0.00034957033,0.00012194578,0.00010502042,0.00048633065,0.0003750503,0.0135682225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997404,0.00004602659,0.000016736454,0.000042558913,0.0001063812,0.0000478941],"domain_scores_gemma":[0.99972206,0.00007360177,0.000045588073,0.00006789261,0.00006783372,0.000023002045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030712085,0.00039074765,0.00025229543,0.00042640007,0.0002346552,0.0006509766,0.0011665901,0.0003325862,0.003765489],"category_scores_gemma":[0.00053322146,0.00020539488,0.00020348206,0.00022631802,0.00019653708,0.00082204124,0.00042367692,0.00045021513,0.0009852537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001008055,0.00018494381,0.0027395373,0.0003625026,0.00008523165,0.00042940117,0.00010632308,0.09268266,0.16573907,0.02574963,0.029044908,0.6818677],"study_design_scores_gemma":[0.0003162606,0.0018910421,0.0020880639,0.00005695433,0.00015041487,0.0011906719,0.000063437976,0.77412266,0.12847891,0.007286116,0.0842391,0.00011632575],"about_ca_topic_score_codex":0.00084421074,"about_ca_topic_score_gemma":0.0023734607,"teacher_disagreement_score":0.003765489,"about_ca_system_score_codex":0.00028138407,"about_ca_system_score_gemma":0.0005634022,"threshold_uncertainty_score":0.012596846},"labels":[],"label_agreement":null},{"id":"W3023260388","doi":"10.1109/tvlsi.2004.831478","title":"Power estimation techniques for FPGAs","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Delay calculation; Field-programmable gate array; Computer science; Routing (electronic design automation); Capacitance; Noise (video); Electronic engineering; Logic gate; Logic synthesis; Interconnection; Dynamic demand; Gate array; Minimum bounding box; CMOS; Programmable logic array; Power (physics); Algorithm; Embedded system; Engineering; Artificial intelligence; Telecommunications","score_opus":0.009093474468148337,"score_gpt":0.23481335160568928,"score_spread":0.22571987713754094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023260388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004647778,0.00054975087,0.99217916,0.00007999182,0.000021274562,0.000021474078,0.000095040574,0.0010022282,0.0014032637],"genre_scores_gemma":[0.37785316,0.0021422124,0.6126355,0.00013036715,0.000112830676,0.00019448374,0.0006797187,0.00022689256,0.006024794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968815,0.00007463106,0.000022071425,0.00006601613,0.0001270021,0.00002219772],"domain_scores_gemma":[0.99944,0.00029901057,0.000054939817,0.00008837488,0.00011041036,0.000007219027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004163367,0.00073920726,0.0004577283,0.0008226587,0.00027704478,0.0005763112,0.0005444109,0.00034563983,0.0029392778],"category_scores_gemma":[0.0030447664,0.00036305355,0.00041797967,0.000747501,0.0001778901,0.000808661,0.00032436443,0.0006987755,0.0010274093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005814604,0.000020911202,0.0010627413,0.00011252303,0.0000463658,0.00007110436,0.000046387253,0.48053163,0.006815693,0.016251411,0.0026791308,0.492304],"study_design_scores_gemma":[0.0000069389134,0.000023251927,0.00042910952,0.000025386042,0.000010314291,0.00005665037,0.00001107115,0.9813798,0.0032923399,0.010446125,0.004310911,0.000008111993],"about_ca_topic_score_codex":0.0040642256,"about_ca_topic_score_gemma":0.004060608,"teacher_disagreement_score":0.0040642256,"about_ca_system_score_codex":0.00044899367,"about_ca_system_score_gemma":0.0004229445,"threshold_uncertainty_score":0.009832859},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02123967216127599,"score_gpt":0.20983675866673177,"score_spread":0.18859708650545579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033033241","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009329676,0.0010243269,0.5078312,0.000971428,0.0010830937,0.0005741727,0.0075595104,0.13712908,0.33449745],"genre_scores_gemma":[0.14400846,0.0016687396,0.3094819,0.001963651,0.00033864292,0.00078024366,0.040195074,0.036113936,0.46544942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882716,0.00012618073,0.00008045925,0.00019149433,0.00066097965,0.00011372756],"domain_scores_gemma":[0.99878854,0.00018575166,0.00008713489,0.00039279176,0.00048799324,0.000057707442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435658,0.00078340777,0.0003212203,0.001019684,0.00035055488,0.0019169261,0.0018744923,0.0010740034,0.13706094],"category_scores_gemma":[0.0027587938,0.00060543657,0.0007668754,0.0005103768,0.00030456655,0.0014781669,0.0012370704,0.001066099,0.065296285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037515108,0.00013098143,0.0009961317,0.00059001346,0.00004663962,0.0003325917,0.00017930496,0.014597341,0.046267938,0.05684018,0.2965377,0.58310604],"study_design_scores_gemma":[0.0001162904,0.00020663676,0.00047450123,0.00009146481,0.000023875546,0.0006621002,0.000026735313,0.032661386,0.026050212,0.011114926,0.928524,0.000047849077],"about_ca_topic_score_codex":0.0012478242,"about_ca_topic_score_gemma":0.0018818267,"teacher_disagreement_score":0.13706094,"about_ca_system_score_codex":0.0007708512,"about_ca_system_score_gemma":0.0011062213,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3041521987","doi":"10.1145/3373269","title":"Machine Learning for Congestion Management and Routability Prediction within FPGA Placement","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Router; Convolutional neural network; Computer engineering; Deep learning; Gate array; Parallel computing; Embedded system; Algorithm; Artificial intelligence; Computer network","score_opus":0.020984262073361945,"score_gpt":0.22161650259867668,"score_spread":0.20063224052531475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041521987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11159422,0.00072277954,0.8783755,0.0003845674,0.00007029395,0.0000634084,0.00017886075,0.006208847,0.0024015862],"genre_scores_gemma":[0.8240402,0.00029053024,0.17284457,0.0001060155,0.000039460763,0.00008983339,0.00028087062,0.00014536551,0.0021631706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996358,0.00009574553,0.000018568588,0.00008590189,0.00011389858,0.000049999013],"domain_scores_gemma":[0.9986064,0.00085578096,0.00016868564,0.00013362929,0.00020737255,0.00002812972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061925966,0.00091992086,0.0004498857,0.0006373601,0.00026140432,0.00068464974,0.0010057157,0.00055663055,0.0014349457],"category_scores_gemma":[0.0035507372,0.0003680726,0.00034718358,0.0004961622,0.0004063224,0.0009880894,0.0003950762,0.000832294,0.00036896687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007020385,0.000047473095,0.001648524,0.000038752987,0.000026892403,0.000029633455,0.000019092224,0.8905487,0.0028147395,0.0015271268,0.0009308198,0.10229805],"study_design_scores_gemma":[0.000002555638,0.000014501878,0.00014152784,0.0000021874127,0.0000027528192,0.0000054247625,0.0000023473312,0.99775773,0.0011398114,0.00078859524,0.00014033649,0.0000022206289],"about_ca_topic_score_codex":0.006766965,"about_ca_topic_score_gemma":0.008895172,"teacher_disagreement_score":0.006766965,"about_ca_system_score_codex":0.0011407178,"about_ca_system_score_gemma":0.0011770165,"threshold_uncertainty_score":0.0134551525},"labels":[],"label_agreement":null},{"id":"W3043169486","doi":"10.1109/mlcad48534.2019.9142079","title":"Adaptive FPGA Placement Optimization via Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Heuristics; Reinforcement learning; Computer science; Field-programmable gate array; Process (computing); Computer engineering; Computer architecture; Artificial intelligence; Embedded system; Programming language","score_opus":0.007523945024058885,"score_gpt":0.19182230452809534,"score_spread":0.18429835950403645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043169486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062436357,0.00033141466,0.93231595,0.00027614724,0.00005285498,0.00007931621,0.000025322204,0.0007583112,0.0037243352],"genre_scores_gemma":[0.88570005,0.0001289374,0.11183921,0.00015433952,0.000028625704,0.00010056366,0.00004434008,0.00006000608,0.0019438773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.0001627228,0.000019399966,0.000089482135,0.00010120072,0.00007563301],"domain_scores_gemma":[0.9979377,0.0014543831,0.00020805588,0.00010893111,0.00022000873,0.00007096846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770099,0.00077454955,0.0007761535,0.00042172242,0.0002466946,0.00056719076,0.0009233829,0.00082416245,0.0018371843],"category_scores_gemma":[0.004165354,0.0004226245,0.00038945978,0.00028681196,0.0008686044,0.00065798935,0.00065584225,0.000991949,0.00030224724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003217585,0.000028356688,0.00030029524,0.000020189567,0.000012283722,0.000019609874,0.000012049166,0.9807202,0.00070898584,0.0011461547,0.0002593533,0.01674032],"study_design_scores_gemma":[0.000008211751,0.00002104284,0.00003163119,0.0000023383698,0.000002156709,0.000004832285,0.000002198466,0.9990748,0.0001872613,0.00057863427,0.000085358944,0.0000014823748],"about_ca_topic_score_codex":0.0039616474,"about_ca_topic_score_gemma":0.0038877863,"teacher_disagreement_score":0.0039616474,"about_ca_system_score_codex":0.000763373,"about_ca_system_score_gemma":0.001031478,"threshold_uncertainty_score":0.007877171},"labels":[],"label_agreement":null},{"id":"W3046189630","doi":"","title":"Enhancing the Performance of FPGA Congestion Management via Supervised Learning","year":2019,"lang":"en","type":"article","venue":"IEEE Conference Proceedings","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Lookup table; Computer science; Key (lock); Computer engineering; Embedded system; Computer architecture; Artificial intelligence; Machine learning; Operating system","score_opus":0.009717276824317627,"score_gpt":0.19596620584663324,"score_spread":0.1862489290223156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046189630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2790582,0.0014435274,0.705587,0.0004818143,0.0001684298,0.00010109909,0.00014810605,0.008772633,0.0042391857],"genre_scores_gemma":[0.93600917,0.00013672192,0.06232614,0.00008563488,0.00004323546,0.000035192243,0.00017209651,0.00007519322,0.0011166689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995844,0.00010345997,0.000020779498,0.0001070065,0.000104420185,0.000080011814],"domain_scores_gemma":[0.9986389,0.00069678295,0.00017713782,0.00016374947,0.00026732706,0.000056014174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010149112,0.0010335128,0.0006647092,0.00052720244,0.0003263614,0.0005808012,0.0012142557,0.0007497747,0.0014954703],"category_scores_gemma":[0.003403334,0.0002768853,0.00034022125,0.0003994455,0.0003730861,0.0009883944,0.00056333723,0.0008628153,0.0005009049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031945438,0.00023729567,0.0027481834,0.00007016682,0.00006833802,0.00006460508,0.000026741733,0.6931445,0.0077287178,0.00085126306,0.0017594907,0.2929812],"study_design_scores_gemma":[0.0000070836886,0.000058718535,0.00022630318,0.000002054625,0.0000054963225,0.000009731837,0.000003583415,0.99754435,0.0017511412,0.00029304664,0.000095424366,0.0000030531107],"about_ca_topic_score_codex":0.0041237823,"about_ca_topic_score_gemma":0.0041249557,"teacher_disagreement_score":0.0041237823,"about_ca_system_score_codex":0.00068999286,"about_ca_system_score_gemma":0.0010220362,"threshold_uncertainty_score":0.008199573},"labels":[],"label_agreement":null},{"id":"W3080620120","doi":"10.1109/cjece.2019.2962147","title":"Automatic and Simultaneous Floorplanning and Placement in Field-Programmable Gate Arrays With Dynamic Partial Reconfiguration Based on Genetic Algorithm","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Floorplan; Control reconfiguration; Field-programmable gate array; Simulated annealing; Gate array; Computer science; Benchmark (surveying); Genetic algorithm; Embedded system; Parallel computing; Algorithm; Computer architecture; Computer engineering","score_opus":0.0035351054875988573,"score_gpt":0.1607900000625606,"score_spread":0.15725489457496175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080620120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074740194,0.00026928182,0.9211881,0.00008961592,0.000035278186,0.000085507374,0.000028967508,0.001398108,0.002164995],"genre_scores_gemma":[0.4993568,0.00017128358,0.49874592,0.000056810273,0.000018026696,0.00012914238,0.00009861696,0.00008321774,0.0013400674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960726,0.0001040893,0.000017944047,0.00008834584,0.00012326911,0.00005917586],"domain_scores_gemma":[0.9997727,0.00010224113,0.000036104673,0.00002892848,0.000045867484,0.000014142946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041095415,0.00063622004,0.0006046829,0.00078650453,0.0005150361,0.00046239965,0.00058817386,0.00047478438,0.0006910971],"category_scores_gemma":[0.0006111058,0.00039976093,0.0006587972,0.00064654334,0.0004428078,0.00042941308,0.00033464018,0.0004566871,0.00012577379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009731107,0.000082864,0.0010698199,0.000076559525,0.000052645544,0.00013678454,0.00013295826,0.7485754,0.021631017,0.0033791242,0.00083169754,0.22393377],"study_design_scores_gemma":[0.000031211814,0.000108795306,0.0004990255,0.0000068879203,0.000021138858,0.00009130667,0.00002821159,0.99065316,0.006113687,0.0015145199,0.0009203263,0.000011741905],"about_ca_topic_score_codex":0.0073267487,"about_ca_topic_score_gemma":0.008516153,"teacher_disagreement_score":0.0073267487,"about_ca_system_score_codex":0.00047713175,"about_ca_system_score_gemma":0.0011551001,"threshold_uncertainty_score":0.01456821},"labels":[],"label_agreement":null},{"id":"W3087976346","doi":"10.1109/tcad.2020.3025068","title":"An LDE-Aware <i>g</i> <sub> <i>m</i> </sub>/<i>I</i> <sub> <i>D</i> </sub>-Based Hybrid Sizing Method for Analog Integrated Circuits","year":2020,"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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Research and Development Corporation of Newfoundland and Labrador; Canada Foundation for Innovation","keywords":"Sizing; Sensitivity (control systems); Computer science; Algorithm; Computation; Electronic circuit; Topology (electrical circuits); Mathematics; Electronic engineering; Engineering; Electrical engineering; Combinatorics","score_opus":0.0300492102004446,"score_gpt":0.23417788038704782,"score_spread":0.20412867018660322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087976346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006279443,0.00009609493,0.99022967,0.00005217048,0.000015195018,0.000034045763,0.00005212895,0.00036734727,0.0028738733],"genre_scores_gemma":[0.22133905,0.00014653328,0.7730435,0.00016018945,0.00002554946,0.00014988794,0.00024056919,0.00020749004,0.0046872473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997198,0.000052226555,0.000014245072,0.00007139872,0.00012554704,0.000016737562],"domain_scores_gemma":[0.9997204,0.0001089454,0.00003817052,0.000045146604,0.00007781048,0.000009506697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029212885,0.00075689255,0.00048531077,0.0005712547,0.00031180796,0.0006582506,0.0009077819,0.0005052504,0.0027253754],"category_scores_gemma":[0.0007057176,0.00037707167,0.00060409016,0.0004742992,0.00026296865,0.0009410469,0.0006400556,0.0005797667,0.0005421744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000920362,0.000096182586,0.0008586865,0.00023964013,0.00008234994,0.00009318585,0.00011971795,0.5085942,0.16556251,0.014881808,0.0030352229,0.30634442],"study_design_scores_gemma":[0.000013189454,0.000046211404,0.00020816532,0.000010429499,0.000021446893,0.00006464603,0.000014961626,0.967363,0.02535141,0.0029734692,0.003922246,0.00001086915],"about_ca_topic_score_codex":0.0013035156,"about_ca_topic_score_gemma":0.004018976,"teacher_disagreement_score":0.0027253754,"about_ca_system_score_codex":0.00057330617,"about_ca_system_score_gemma":0.000747198,"threshold_uncertainty_score":0.009117246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02906838200091587,"score_gpt":0.2217929692400638,"score_spread":0.19272458723914793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089997764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031437512,0.00020252723,0.9649719,0.000115686445,0.00002359282,0.000037643917,0.000017996943,0.00076168764,0.0024314628],"genre_scores_gemma":[0.8542147,0.00007998809,0.1438394,0.00009694753,0.000016816055,0.00007131127,0.000037006208,0.000064699896,0.0015791566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972373,0.00006330169,0.000014417142,0.000060329665,0.00009989306,0.00003830357],"domain_scores_gemma":[0.99919075,0.00045145545,0.000106254396,0.00008826525,0.0001322873,0.00003094229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007914474,0.00060787774,0.0005317967,0.00036416904,0.0002243169,0.00046479105,0.0008894531,0.00050729944,0.0020079357],"category_scores_gemma":[0.0021720086,0.0002963976,0.00029967833,0.00025358854,0.00061537535,0.00061669026,0.000565674,0.0009161714,0.00023002064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005040988,0.000069281996,0.00081037456,0.00006695551,0.000029186156,0.00003765303,0.00003424364,0.8664572,0.0064613963,0.005494882,0.00057725667,0.11991106],"study_design_scores_gemma":[0.0000042770607,0.000021502588,0.000041941534,0.0000023579348,0.0000030891038,0.0000056824088,0.0000013865114,0.99724126,0.0010278205,0.0014630688,0.00018587151,0.0000016347569],"about_ca_topic_score_codex":0.0019968306,"about_ca_topic_score_gemma":0.0031308,"teacher_disagreement_score":0.0020079357,"about_ca_system_score_codex":0.00074669754,"about_ca_system_score_gemma":0.0008965646,"threshold_uncertainty_score":0.006717205},"labels":[],"label_agreement":null},{"id":"W3091003631","doi":"10.1109/iscas45731.2020.9181150","title":"Fast Analog Layout Retargeting with Device Abstraction","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Retargeting; Computer science; Process (computing); Abstraction; Graph; Constraint (computer-aided design); IC layout editor; Integrated circuit layout; Computer hardware; Scheme (mathematics); Page layout; Artificial intelligence; Integrated circuit; Circuit extraction; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.015087580075322451,"score_gpt":0.18936132194819025,"score_spread":0.1742737418728678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091003631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020487646,0.0003136909,0.9712801,0.00004820061,0.000053724154,0.00007920977,0.00009792096,0.004316458,0.0033231254],"genre_scores_gemma":[0.44265276,0.00035325647,0.5489784,0.00019676343,0.00003586104,0.00013384449,0.00045004516,0.0009429506,0.0062561384],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995629,0.00005299083,0.000024287752,0.00009972917,0.00020248338,0.000057620648],"domain_scores_gemma":[0.9993476,0.00017170356,0.00006975984,0.00032465093,0.00007060854,0.00001557562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024289868,0.0007243556,0.00046095552,0.0004832524,0.00021104437,0.0005355046,0.0013368083,0.00034967,0.0037434832],"category_scores_gemma":[0.000775001,0.00024711198,0.0006120198,0.00046866055,0.0004056362,0.00081907696,0.00086740684,0.0006852549,0.0008196317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019364964,0.00005741161,0.00075042807,0.0005101957,0.00008692661,0.0006280223,0.00030106184,0.11606793,0.41615677,0.023706118,0.003970302,0.4375713],"study_design_scores_gemma":[0.0000914165,0.0006038077,0.0012349387,0.000043408654,0.00012821355,0.001435074,0.000092541035,0.404125,0.50054014,0.018937308,0.07267823,0.000089996654],"about_ca_topic_score_codex":0.0008108605,"about_ca_topic_score_gemma":0.0012810255,"teacher_disagreement_score":0.0037434832,"about_ca_system_score_codex":0.00039900801,"about_ca_system_score_gemma":0.00040729617,"threshold_uncertainty_score":0.012523174},"labels":[],"label_agreement":null},{"id":"W3091973109","doi":"10.1109/iemtronics51293.2020.9216458","title":"The Use of Agile Methodology for Porting Analog and Mixed-Signal Circuits Between Different Technology Nodes","year":2020,"lang":"en","type":"article","venue":"2020 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Porting; Agile software development; Computer science; Electronic design automation; Time to market; Mixed-signal integrated circuit; Integrated circuit; Integrated circuit design; Process (computing); Automation; Design flow; Electronic circuit; Embedded system; Computer engineering; Software engineering; Engineering; Electrical engineering","score_opus":0.1116785171635695,"score_gpt":0.2934335369577546,"score_spread":0.1817550197941851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091973109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005706681,0.00017711186,0.990983,0.00011004742,0.000020398196,0.00012591084,0.000013227438,0.00022073586,0.0026428918],"genre_scores_gemma":[0.08215148,0.00030651424,0.9152734,0.0000853493,0.000012073746,0.00023407608,0.000053725944,0.00013581307,0.0017475319],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9920602,0.004027374,0.00033524376,0.0006131827,0.002655873,0.00030819068],"domain_scores_gemma":[0.9908935,0.00495049,0.0007498328,0.002046781,0.001147644,0.00021170064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052196034,0.0010487254,0.0003575355,0.0016422934,0.0008690386,0.0024197751,0.0018821043,0.00084079,0.0014217712],"category_scores_gemma":[0.00867344,0.0006152323,0.0007972669,0.0009329426,0.0017584515,0.0018688802,0.0023159413,0.0015267122,0.0006400973],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010585164,0.00030093882,0.0042805024,0.0013519208,0.00019775768,0.0017693011,0.006549165,0.049937587,0.103511065,0.12549989,0.002700104,0.7037959],"study_design_scores_gemma":[0.00020581945,0.002204368,0.00404127,0.0015069696,0.0003144004,0.010143135,0.0032442773,0.28883174,0.23276861,0.17224263,0.28416574,0.00033115805],"about_ca_topic_score_codex":0.0006650929,"about_ca_topic_score_gemma":0.0011245137,"teacher_disagreement_score":0.0052196034,"about_ca_system_score_codex":0.00069151947,"about_ca_system_score_gemma":0.0016784839,"threshold_uncertainty_score":0.027604282},"labels":[],"label_agreement":null},{"id":"W3091995083","doi":"10.1109/dsd51259.2020.00018","title":"Hard and Soft Logic Trade-offs for Multipliers in VTR","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Verilog; Field-programmable gate array; Granularity; Computer science; Routing (electronic design automation); Programmable Array Logic; Electronic circuit; Computer architecture; Reduction (mathematics); Embedded system; Logic gate; Computer hardware; Logic synthesis; Logic family; Engineering; Electrical engineering","score_opus":0.03231239154869903,"score_gpt":0.22470645788283514,"score_spread":0.1923940663341361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091995083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31816688,0.010087669,0.58739525,0.0024409331,0.00032014228,0.0001638844,0.00026249888,0.0015067554,0.07965597],"genre_scores_gemma":[0.911342,0.0009840053,0.07873567,0.00032305313,0.00011214486,0.00004928037,0.00008297102,0.00021885736,0.008152056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842215,0.00045724193,0.00008717349,0.00022029551,0.0006314495,0.00018180718],"domain_scores_gemma":[0.9969861,0.0021450315,0.0003414991,0.00027862992,0.000183087,0.00006581146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167083,0.00096107594,0.00037351175,0.00088945345,0.000538072,0.0018847353,0.0009875308,0.0007525958,0.009280241],"category_scores_gemma":[0.004537445,0.00034565813,0.0003741639,0.0005282968,0.00073445216,0.0026244624,0.0009136469,0.0008477297,0.0009830765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012308523,0.0002655733,0.0024144803,0.0010277436,0.00012778258,0.0006280179,0.00028656205,0.16582231,0.30634588,0.15193602,0.0026662801,0.36724854],"study_design_scores_gemma":[0.00013387632,0.0028059662,0.0023549832,0.00028685492,0.00019268302,0.0021741714,0.00024454054,0.64992,0.20001167,0.12121115,0.02054769,0.000116493604],"about_ca_topic_score_codex":0.000239077,"about_ca_topic_score_gemma":0.0010650221,"teacher_disagreement_score":0.009280241,"about_ca_system_score_codex":0.00081817055,"about_ca_system_score_gemma":0.00032295333,"threshold_uncertainty_score":0.031045496},"labels":[],"label_agreement":null},{"id":"W3093817935","doi":"10.1109/fpl50879.2020.00043","title":"Measuring the Accuracy of Layout Area Estimation Models of Tile-Based FPGAs in FinFET Technology","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Process (computing); Work (physics); Estimation; Multiplexer; Embedded system; Engineering; Telecommunications; Multiplexing","score_opus":0.05364929105235554,"score_gpt":0.22556006750814947,"score_spread":0.17191077645579395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093817935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7807413,0.0003576152,0.2120512,0.00007082426,0.000039013477,0.00003276594,0.0005247553,0.0024307785,0.0037517825],"genre_scores_gemma":[0.9764341,0.000116514406,0.022478476,0.000012187982,0.000002687218,0.000017775163,0.00026280875,0.00004468011,0.0006307919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965143,0.000058896294,0.000027640646,0.00010547773,0.00012017961,0.000036413214],"domain_scores_gemma":[0.9989906,0.00046664933,0.0001641991,0.00020042146,0.00016261767,0.000015405223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037154037,0.0005594597,0.00026143098,0.00041570613,0.00016035412,0.0005408538,0.00067634095,0.00051580864,0.0011153074],"category_scores_gemma":[0.0024650018,0.00029243485,0.00036809556,0.00035949357,0.00016462879,0.0007928563,0.00026720855,0.00027138845,0.0003395576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018162587,0.000035094094,0.016089888,0.00007790555,0.000090822075,0.0001298471,0.00007961988,0.9064739,0.036852956,0.00076001184,0.00029050623,0.03893783],"study_design_scores_gemma":[0.0000057106668,0.00014249246,0.0061364905,0.000011532113,0.000024906989,0.00009725689,0.00003954892,0.9647861,0.027895737,0.00024191188,0.00060060434,0.000017667073],"about_ca_topic_score_codex":0.0046740696,"about_ca_topic_score_gemma":0.006129255,"teacher_disagreement_score":0.0046740696,"about_ca_system_score_codex":0.0006377909,"about_ca_system_score_gemma":0.00043603,"threshold_uncertainty_score":0.009293735},"labels":[],"label_agreement":null},{"id":"W3094241140","doi":"10.1109/epeps48591.2020.9231491","title":"An Efficient and Parallel Electromagnetic Solver for Complex Interconnects in Layered Media","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Computer science; Scalability; Computation; Computational science; Parallel computing; Workload; Transmission-line matrix method; Computational electromagnetics; Electronic engineering; Algorithm; Electromagnetic field; Engineering; Physics","score_opus":0.02807108252980117,"score_gpt":0.23248033030003318,"score_spread":0.204409247770232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094241140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010258681,0.000060900635,0.98664457,0.00006006508,0.000023245102,0.000027239746,0.000046727233,0.00041727241,0.0024613333],"genre_scores_gemma":[0.18719359,0.00020948822,0.8081808,0.00006319354,0.000028128128,0.00012759835,0.0001367627,0.00024453332,0.0038159029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999012,0.000019587542,0.0000041266667,0.000009594092,0.000053106614,0.000012353577],"domain_scores_gemma":[0.9997943,0.00009047724,0.00002257059,0.000025922609,0.000049500617,0.000017326693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023929343,0.00044319226,0.00033552074,0.00023135178,0.00031549105,0.00046346406,0.00091056695,0.0005155983,0.0018539098],"category_scores_gemma":[0.00066660764,0.00023049682,0.00037335223,0.00039213168,0.00025579467,0.00053438713,0.0005676278,0.0006290274,0.00044743076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007859411,0.00007825119,0.0010511404,0.00021327735,0.000054886368,0.0002549822,0.00011504177,0.81035316,0.060326483,0.030561464,0.0029366638,0.09397613],"study_design_scores_gemma":[0.000008154552,0.000015079694,0.00004776466,0.000002668322,0.000003035271,0.000031656164,0.00000823098,0.99506456,0.0026451054,0.0010366089,0.0011343003,0.0000027600875],"about_ca_topic_score_codex":0.0010822008,"about_ca_topic_score_gemma":0.0020237186,"teacher_disagreement_score":0.0018539098,"about_ca_system_score_codex":0.0002256533,"about_ca_system_score_gemma":0.0007394499,"threshold_uncertainty_score":0.0062019825},"labels":[],"label_agreement":null},{"id":"W3097021646","doi":"10.1145/3416946","title":"Efficient Parasitic-aware <i> g <sup>m</sup> </i> / <i> I <sup>D</sup> - </i> based Hybrid Sizing Methodology for Analog and RF Integrated Circuits","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Floorplan; Parasitic extraction; Sizing; Computer science; Integrated circuit; Piecewise; Electronic engineering; Analogue electronics; Nonlinear programming; Electronic circuit; Mathematical optimization; Algorithm; Nonlinear system; Electrical engineering; Mathematics; Embedded system; Engineering; Physics","score_opus":0.043965003161724595,"score_gpt":0.2605274146914718,"score_spread":0.2165624115297472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097021646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018786348,0.0002344136,0.97468436,0.000065968925,0.00001549646,0.000034873454,0.000047670677,0.00055309106,0.005577819],"genre_scores_gemma":[0.40488845,0.00021923809,0.5922341,0.000066322,0.00001594122,0.00007756179,0.00014933212,0.00021360099,0.0021354752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981135,0.000039153838,0.000008924308,0.000028843591,0.00009457017,0.000017254908],"domain_scores_gemma":[0.9997873,0.00008292352,0.000038113896,0.000044487344,0.00003790398,0.000009235304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025477773,0.0006280949,0.00029458673,0.00046937048,0.00023732938,0.0004992763,0.0008885975,0.00034942827,0.0017441871],"category_scores_gemma":[0.0005155944,0.00023252184,0.0004666018,0.00049894187,0.0002792679,0.0006752389,0.0005468545,0.00047311815,0.00040401038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050383886,0.000052222098,0.0007699819,0.0001747478,0.00004089019,0.00009535449,0.00010361239,0.69446015,0.0962189,0.022977365,0.0018604033,0.18319586],"study_design_scores_gemma":[0.0000054108227,0.00005295095,0.0001391565,0.000007348724,0.000011288916,0.00008424218,0.000015074779,0.9758296,0.01673031,0.0039604837,0.0031580215,0.000006132575],"about_ca_topic_score_codex":0.0008091203,"about_ca_topic_score_gemma":0.0018501343,"teacher_disagreement_score":0.0017441871,"about_ca_system_score_codex":0.00052394747,"about_ca_system_score_gemma":0.0005798062,"threshold_uncertainty_score":0.0058348775},"labels":[],"label_agreement":null},{"id":"W3098798579","doi":"10.1109/southeastcon44009.2020.9249694","title":"An Investigation of the Accuracy of the VPR and COFFE Area Models in Predicting the Layout Area of FPGA Lookup Tables","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Field-programmable gate array; Routing (electronic design automation); Lookup table; Computer science; Benchmark (surveying); Block (permutation group theory); Embedded system; Mathematics; Geometry","score_opus":0.03398046109264609,"score_gpt":0.21176110220676217,"score_spread":0.17778064111411607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098798579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79314756,0.0012711798,0.197783,0.000270224,0.000052189338,0.00006964238,0.00043122945,0.0018761959,0.0050987694],"genre_scores_gemma":[0.96082693,0.0002709223,0.037849367,0.000024951427,0.0000067610176,0.00002959841,0.00014829086,0.000058816164,0.0007844175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992384,0.00019901963,0.000034875757,0.00013229463,0.0003345629,0.00006086032],"domain_scores_gemma":[0.99338853,0.005264023,0.0003493382,0.0005172193,0.0004488195,0.00003200627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456552,0.00062319735,0.0003876056,0.0007761362,0.00028524586,0.0005680104,0.00094940525,0.00077560416,0.0006193946],"category_scores_gemma":[0.008789314,0.00035886763,0.00043845395,0.0006622132,0.0003299841,0.0010421268,0.00029073376,0.0005314162,0.00018182506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017931104,0.00005997399,0.01146276,0.00006745153,0.000046695408,0.00008950606,0.00009538198,0.92361313,0.011022015,0.001354943,0.0004141121,0.051594734],"study_design_scores_gemma":[0.0000030431886,0.00006864224,0.0015400071,0.000005749673,0.000006588357,0.00003959005,0.00001236919,0.99360585,0.0043865554,0.00010264051,0.0002213756,0.0000076042547],"about_ca_topic_score_codex":0.012955499,"about_ca_topic_score_gemma":0.012506012,"teacher_disagreement_score":0.012955499,"about_ca_system_score_codex":0.0007678958,"about_ca_system_score_gemma":0.0005561962,"threshold_uncertainty_score":0.025760174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05746213606325693,"score_gpt":0.3228053845310089,"score_spread":0.2653432484677519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101215367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005482788,0.000026905713,0.99770576,0.000028623095,0.000022868731,0.00006593934,0.000024770894,0.00031122108,0.001265669],"genre_scores_gemma":[0.01591084,0.00006212049,0.9816305,0.000058623482,0.00003105916,0.00054584217,0.00005111578,0.00016828017,0.001541663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967675,0.0014473235,0.0002068338,0.00045482873,0.0010139584,0.00010958336],"domain_scores_gemma":[0.9936447,0.0034304284,0.00036261114,0.0016845344,0.00075906375,0.00011866005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032993052,0.0012653249,0.00068571186,0.0014561843,0.0006675505,0.0010131057,0.0012121329,0.00065561914,0.011507861],"category_scores_gemma":[0.011001948,0.00085298467,0.0010835216,0.00090570195,0.0015881517,0.0016274241,0.0014152566,0.00222558,0.00269562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025924703,0.0001691344,0.0008365357,0.0007539495,0.00012028865,0.0001945754,0.00034905202,0.06988467,0.052125674,0.40033743,0.0071820514,0.4677874],"study_design_scores_gemma":[0.0003873308,0.00093463727,0.00056081417,0.00022429047,0.0001285264,0.00073125755,0.0001230081,0.29887104,0.05877114,0.49826866,0.14084703,0.00015219966],"about_ca_topic_score_codex":0.00040518426,"about_ca_topic_score_gemma":0.0006674115,"teacher_disagreement_score":0.011507861,"about_ca_system_score_codex":0.0006589897,"about_ca_system_score_gemma":0.0012817084,"threshold_uncertainty_score":0.038497627},"labels":[],"label_agreement":null},{"id":"W3107133478","doi":"10.1145/3380446.3430618","title":"An Adaptive Analytic FPGA Placement Framework based on Deep-Learning","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Encoder; Quality (philosophy); Placer mining; Deep learning; Parallel computing; Computer engineering; Artificial intelligence; Embedded system; Operating system","score_opus":0.016703661068808717,"score_gpt":0.23276744533996496,"score_spread":0.21606378427115625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107133478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056697256,0.00014666785,0.9911088,0.00005645761,0.000029449026,0.000022758242,0.00003531373,0.0017809384,0.0011499412],"genre_scores_gemma":[0.41987255,0.00027456522,0.5740012,0.00017693668,0.00005624267,0.000097376025,0.00027728372,0.00027223633,0.004971663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997911,0.000023950855,0.000007050133,0.000044429893,0.000099229146,0.000034292054],"domain_scores_gemma":[0.9997944,0.000054122407,0.000027435226,0.000037067537,0.00007001996,0.00001708169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861889,0.00086611137,0.00055647484,0.0005189961,0.0002655628,0.0005842221,0.00168165,0.0005517235,0.002616393],"category_scores_gemma":[0.00066572643,0.00043281773,0.00040240525,0.00044982458,0.00034269312,0.0006420405,0.00073514954,0.0009965716,0.0008514532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095716685,0.00007500218,0.0005632448,0.00007406746,0.00004270403,0.00009518508,0.000025955382,0.74769235,0.016707351,0.0075488603,0.002509835,0.22456972],"study_design_scores_gemma":[0.0000042437528,0.000021811735,0.00004690327,0.0000025926604,0.0000042569022,0.000019010931,0.000003177297,0.99549687,0.0023728893,0.0014052342,0.0006200228,0.0000030183023],"about_ca_topic_score_codex":0.005838369,"about_ca_topic_score_gemma":0.014806685,"teacher_disagreement_score":0.005838369,"about_ca_system_score_codex":0.0009429061,"about_ca_system_score_gemma":0.0014937572,"threshold_uncertainty_score":0.011608779},"labels":[],"label_agreement":null},{"id":"W3107926654","doi":"10.1109/ccece47787.2020.9255695","title":"Placement with Sequence-Pair-Driven TCG for Advanced Analog Constraints","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive closure; Computer science; Analogue electronics; Analog computer; Graph; Sequence (biology); Transitive reduction; Electronic design automation; Computer engineering; Electronic circuit; Theoretical computer science; Engineering; Embedded system; Mathematics; Electrical engineering","score_opus":0.031242928009064422,"score_gpt":0.2395470291519036,"score_spread":0.20830410114283918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107926654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007394574,0.00006149855,0.99006945,0.000045870867,0.000036613146,0.000095937925,0.00002918211,0.00036623396,0.0019006266],"genre_scores_gemma":[0.23365621,0.00016566631,0.7626079,0.00013259334,0.000054935696,0.00022665247,0.00022182157,0.00016171094,0.0027724856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999383,0.00016823871,0.00003494633,0.00012192141,0.00023451669,0.000057519363],"domain_scores_gemma":[0.99925095,0.00024876272,0.00009983782,0.00020193006,0.00015644937,0.000042150004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004521406,0.00097511214,0.0006046676,0.0010220989,0.0007976084,0.00051952543,0.0012603344,0.0006390343,0.0042041],"category_scores_gemma":[0.0014987749,0.00032690293,0.00070355664,0.0009926216,0.00068540906,0.0010353003,0.0010947634,0.0007043701,0.00084840244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019888103,0.00016786749,0.0010808118,0.00044063703,0.00006720389,0.0008625711,0.00036444282,0.4186102,0.054435454,0.09944549,0.0063483566,0.4179782],"study_design_scores_gemma":[0.00005652235,0.00024794973,0.00020614611,0.000020274438,0.000034100038,0.0005689744,0.00008356696,0.93720627,0.0147839,0.03857469,0.008191859,0.000025720352],"about_ca_topic_score_codex":0.0019050764,"about_ca_topic_score_gemma":0.0037554975,"teacher_disagreement_score":0.0042041,"about_ca_system_score_codex":0.00051179476,"about_ca_system_score_gemma":0.0014427499,"threshold_uncertainty_score":0.014064074},"labels":[],"label_agreement":null},{"id":"W3114620271","doi":"","title":"ALGORITMO DIVISÃO UTILIZANDO A META-HEURÍSTICA SIMULATED ANNEALING APLICADO NA OTIMIZAÇÃO DE CIRCUITOS REVERSÍVEIS","year":2019,"lang":"pt","type":"article","venue":"Congresso Brasileiro de Automática - CBA","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Physics; Simulated annealing; Computer science; Algorithm","score_opus":0.03567885243618515,"score_gpt":0.27381505206462226,"score_spread":0.2381361996284371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114620271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04267533,0.0012602502,0.9457032,0.00023900255,0.00013810182,0.00021026949,0.000096957854,0.0018473417,0.007829552],"genre_scores_gemma":[0.28689268,0.00081859046,0.70047385,0.00016719314,0.000036744415,0.0003116842,0.00019395039,0.0002854205,0.010819872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952614,0.00012427289,0.000041413692,0.00011587872,0.0001373245,0.000054817418],"domain_scores_gemma":[0.9993443,0.00028240008,0.000057538644,0.00013262182,0.0001579916,0.00002517218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007211586,0.0009850928,0.0011270135,0.0009590678,0.00074372557,0.0017062374,0.0012801412,0.0010893232,0.0056393943],"category_scores_gemma":[0.0014524063,0.0005979962,0.0015510988,0.000864593,0.00063379435,0.0010862247,0.00049425097,0.0009959509,0.0010269515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025579668,0.0001394799,0.0009574331,0.00063932984,0.00018159264,0.00020004071,0.00033677352,0.6268629,0.044755984,0.01828454,0.0027636003,0.30462253],"study_design_scores_gemma":[0.00006154255,0.0002361738,0.00039348772,0.000052103725,0.00010884616,0.00021191631,0.00010850322,0.94460213,0.029501041,0.007241019,0.01744977,0.000033440967],"about_ca_topic_score_codex":0.0037925236,"about_ca_topic_score_gemma":0.005226476,"teacher_disagreement_score":0.0056393943,"about_ca_system_score_codex":0.001327856,"about_ca_system_score_gemma":0.0019269813,"threshold_uncertainty_score":0.018865705},"labels":[],"label_agreement":null},{"id":"W3116009344","doi":"10.1109/icecs49266.2020.9294968","title":"Advanced Transitive-Closure-Graph-Based Placement Representation for Analog Layout Design","year":2020,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Grain Research and Development Corporation","keywords":"Computer science; Transitive closure; Redundancy (engineering); Network topology; Graph; Representation (politics); Analogue electronics; Computation; Flexibility (engineering); Automation; Electronic design automation; Theoretical computer science; Computer engineering; Distributed computing; Electronic circuit; Algorithm; Embedded system; Mathematics; Engineering","score_opus":0.04488228364013116,"score_gpt":0.2601018625108018,"score_spread":0.21521957887067064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116009344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062863203,0.000091116686,0.9902687,0.00007448971,0.00004563947,0.000052429757,0.00009950407,0.0007660895,0.0023156535],"genre_scores_gemma":[0.3158387,0.00035127116,0.6795496,0.00013475023,0.00008436458,0.00021674111,0.0006494236,0.00015847654,0.0030167282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994697,0.00014355882,0.000051375813,0.00010471993,0.00018999475,0.0000405966],"domain_scores_gemma":[0.9994948,0.00010166101,0.00008778934,0.00018023925,0.00011477548,0.000020705675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003601879,0.0006758963,0.00036384596,0.00085116085,0.0004110221,0.00078863214,0.0008502611,0.0006129018,0.0026798001],"category_scores_gemma":[0.0011707252,0.00020643862,0.0005454646,0.0010357942,0.00056549395,0.0011843002,0.0006056409,0.0007066975,0.0006433918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014678724,0.00012688544,0.00044284246,0.00025065846,0.000035402383,0.00031390542,0.00022354691,0.3826225,0.046109896,0.24051128,0.007163976,0.32205227],"study_design_scores_gemma":[0.000031387703,0.00014410749,0.000122683,0.000021630978,0.000027585562,0.0002480795,0.00003855705,0.904163,0.01514671,0.067470826,0.012558842,0.000026501413],"about_ca_topic_score_codex":0.0012507972,"about_ca_topic_score_gemma":0.0016677871,"teacher_disagreement_score":0.0026798001,"about_ca_system_score_codex":0.0005984423,"about_ca_system_score_gemma":0.0009696942,"threshold_uncertainty_score":0.008964837},"labels":[],"label_agreement":null},{"id":"W3141105696","doi":"10.1109/date.2009.5090829","title":"Finite Precision bit-width allocation using SAT-Modulo Theory","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Bit (key); Context (archaeology); Computer science; Finite field; Arithmetic; Division (mathematics); Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.01561764808198758,"score_gpt":0.2397121338565358,"score_spread":0.22409448577454824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141105696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013032858,0.0005442281,0.979009,0.00014317138,0.0000648108,0.00004215188,0.00004331331,0.00041278388,0.0067077936],"genre_scores_gemma":[0.43588606,0.00088529213,0.56051,0.0001761834,0.000096308984,0.00016903543,0.00017789386,0.00017415138,0.0019251899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853444,0.0005313378,0.000094654155,0.00021328652,0.00050613604,0.00012013694],"domain_scores_gemma":[0.9977823,0.001293498,0.00022345007,0.00045904279,0.00020168404,0.00003991606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018945029,0.0007461758,0.00070112327,0.0015792075,0.00072298583,0.0022579762,0.0015101158,0.00057283696,0.003385395],"category_scores_gemma":[0.006928165,0.00039568965,0.0005768979,0.0014041744,0.0013372406,0.00311766,0.0012925774,0.0012434816,0.00086065056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025041736,0.00008541617,0.00068808126,0.0002913886,0.000051804764,0.000105740895,0.0001831681,0.17315646,0.023495272,0.59676707,0.0015565192,0.20336866],"study_design_scores_gemma":[0.00005042587,0.0002032058,0.00020202604,0.00014689013,0.00003543825,0.0001583237,0.00009479138,0.5856571,0.048242684,0.35517782,0.009979184,0.00005210531],"about_ca_topic_score_codex":0.0003565227,"about_ca_topic_score_gemma":0.00057305815,"teacher_disagreement_score":0.003385395,"about_ca_system_score_codex":0.0010750192,"about_ca_system_score_gemma":0.0010511932,"threshold_uncertainty_score":0.0113253},"labels":[],"label_agreement":null},{"id":"W3141147179","doi":"10.1109/iccad.2006.320013","title":"Un/DoPack: Re-Clustering of Large System-on-Chip Designs with Interconnect Variation for Low-Cost FPGAs","year":2006,"lang":"en","type":"article","venue":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interconnection; Benchmark (surveying); Field-programmable gate array; Routing (electronic design automation); Computer science; Place and route; Electronic circuit; Electronic design automation; Logic synthesis; Design flow; Physical design; Embedded system; Electronic engineering; Logic gate; Circuit design; Engineering; Electrical engineering; Algorithm; Telecommunications","score_opus":0.0359316740128897,"score_gpt":0.26682030673019463,"score_spread":0.23088863271730492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141147179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3318569,0.0009542529,0.6409192,0.0003820402,0.0001558446,0.00048710566,0.0004252466,0.010525732,0.014293724],"genre_scores_gemma":[0.5978142,0.0002775687,0.39308837,0.00024629667,0.00003313154,0.00021781401,0.0010219408,0.00117189,0.0061288713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.00011478716,0.000016093449,0.00007261704,0.00020927405,0.00006143751],"domain_scores_gemma":[0.99851865,0.00054996455,0.00026273585,0.0004282981,0.00018431855,0.000056125915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056444923,0.00094691233,0.00037351955,0.00086040533,0.0004781181,0.0006834972,0.0008830375,0.0003672645,0.0037005767],"category_scores_gemma":[0.0028408978,0.00040294533,0.0004827798,0.00054680754,0.00045768093,0.00084491447,0.00064083346,0.0005969549,0.0005455891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030755656,0.0002539294,0.008512379,0.00046134452,0.00012305166,0.00042742025,0.0003909168,0.4675043,0.057103533,0.0137248505,0.013313398,0.4378773],"study_design_scores_gemma":[0.000060276816,0.00045078807,0.0028853915,0.00003115558,0.000034760375,0.00027877858,0.00012994425,0.94351566,0.029126788,0.0073376233,0.016117059,0.000031758835],"about_ca_topic_score_codex":0.0036401434,"about_ca_topic_score_gemma":0.008296804,"teacher_disagreement_score":0.0037005767,"about_ca_system_score_codex":0.0008761992,"about_ca_system_score_gemma":0.0009481474,"threshold_uncertainty_score":0.012379706},"labels":[],"label_agreement":null},{"id":"W3143008962","doi":"10.1109/aspdac.2011.5722215","title":"Area-efficient FPGA logic elements: Architecture and synthesis","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Logic optimization; Logic synthesis; Lookup table; Logic block; Logic family; Programmable logic array; Functional decomposition; Field-programmable gate array; Logic gate; Trimming; Sequential logic; Programmable logic device; Parallel computing; Leverage (statistics); Computer architecture; Algorithm; Embedded system; Artificial intelligence","score_opus":0.02449781595460505,"score_gpt":0.1957363852504816,"score_spread":0.17123856929587655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143008962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06548738,0.0010379859,0.9080468,0.00022558417,0.00005606972,0.00010705445,0.00010018373,0.00064212066,0.024296729],"genre_scores_gemma":[0.39149588,0.0008330653,0.6009001,0.000092121176,0.000035690668,0.00009987078,0.00015204836,0.00006790568,0.0063231895],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998907,0.000019266472,0.0000061006854,0.00001466306,0.000053324286,0.000015974358],"domain_scores_gemma":[0.9999256,0.000025825257,0.000010108572,0.000014604844,0.00002097001,0.0000028736931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013525678,0.00023909891,0.00012488989,0.0002602234,0.00014340926,0.00041148608,0.0004216812,0.00025828625,0.0018601986],"category_scores_gemma":[0.00037489424,0.00012850227,0.00017601626,0.00035077683,0.00021623829,0.0004540185,0.00012510837,0.00027735636,0.00050678564],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013265779,0.000071665614,0.00084888755,0.00043424155,0.000025730109,0.0001969494,0.000106919324,0.22783107,0.16530932,0.2212864,0.0030687607,0.38068733],"study_design_scores_gemma":[0.00005424711,0.0004124383,0.0011700592,0.00009367431,0.000034724308,0.00052046566,0.000063051135,0.7562488,0.14372599,0.051020745,0.046629902,0.000025917725],"about_ca_topic_score_codex":0.00051703514,"about_ca_topic_score_gemma":0.0015070338,"teacher_disagreement_score":0.0018601986,"about_ca_system_score_codex":0.00036818592,"about_ca_system_score_gemma":0.00036057664,"threshold_uncertainty_score":0.006223023},"labels":[],"label_agreement":null},{"id":"W3143897082","doi":"10.1007/s10878-021-00757-7","title":"The Steiner cycle and path cover problem on interval graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Surrey Memorial Hospital; Simon Fraser University; Fraser Health","funders":"Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Steiner tree problem; Combinatorics; Mathematics; Hamiltonian path; Path (computing); Cover (algebra); Longest path problem; Discrete mathematics; Set cover problem; Dominating set; Graph; Shortest path problem; Computer science; Set (abstract data type); Vertex (graph theory)","score_opus":0.004398170932766899,"score_gpt":0.19789507340397589,"score_spread":0.193496902471209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143897082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11640301,0.0015712066,0.86114293,0.0008087613,0.00008134713,0.00024348639,0.0011858485,0.0007084962,0.01785491],"genre_scores_gemma":[0.59900534,0.0017623306,0.39003408,0.0002130236,0.00015665757,0.0002669411,0.002487039,0.00021686598,0.0058576777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00025963466,0.00007224743,0.00027442715,0.00034886485,0.00020371574],"domain_scores_gemma":[0.99805933,0.0013103617,0.00019368503,0.00023327718,0.000120869554,0.00008248673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640234,0.0005603098,0.00077476504,0.0008420789,0.00053443504,0.0012965847,0.0011232198,0.0009284772,0.005524217],"category_scores_gemma":[0.0039728945,0.00043065706,0.00079201855,0.0022027013,0.00068474404,0.0030294103,0.0011819302,0.0010752139,0.00051990146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006638421,0.00023222384,0.0019940243,0.00089175656,0.00010615508,0.0007036569,0.0004371639,0.38328838,0.011793657,0.27556807,0.017583251,0.30673787],"study_design_scores_gemma":[0.00010986578,0.00020421953,0.0010923732,0.0000680897,0.000053880955,0.0009611156,0.00027086044,0.66016465,0.0066549233,0.3166791,0.013696883,0.000044067667],"about_ca_topic_score_codex":0.0021661918,"about_ca_topic_score_gemma":0.0016540415,"teacher_disagreement_score":0.005524217,"about_ca_system_score_codex":0.00097189925,"about_ca_system_score_gemma":0.00081658945,"threshold_uncertainty_score":0.01848036},"labels":[],"label_agreement":null},{"id":"W3150149142","doi":"10.1109/aspdac.2011.5722305","title":"An integer programming placement approach to FPGA clock power reduction","year":2011,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Clock skew; Digital clock manager; Clock network; Clock gating; CPU multiplier; Computer science; Field-programmable gate array; Integer programming; Synchronous circuit; Reduction (mathematics); Static timing analysis; Skew; Routing (electronic design automation); Dynamic demand; Clock rate; Electronic engineering; Embedded system; Power (physics); Clock signal; Engineering; Mathematics; Algorithm; Jitter; Telecommunications; Chip","score_opus":0.026024550565928735,"score_gpt":0.22797989032749408,"score_spread":0.20195533976156535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150149142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025933993,0.00011668137,0.9936848,0.000101929625,0.000026589527,0.00002139442,0.000014537657,0.000105892745,0.0033346922],"genre_scores_gemma":[0.120988056,0.0005342785,0.8717834,0.00013867192,0.000085630854,0.0001323343,0.000057927027,0.00011074609,0.0061691036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961853,0.00013507705,0.000019354842,0.00004654282,0.00014678297,0.0000337681],"domain_scores_gemma":[0.9997794,0.000109623674,0.000036720347,0.000020949477,0.000045616693,0.0000076587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045657717,0.00067640666,0.00038746707,0.00038747833,0.00031128345,0.0006994505,0.00059687806,0.00038501006,0.0027726197],"category_scores_gemma":[0.0010110447,0.00038918274,0.00040706524,0.0006089122,0.00037795198,0.0005270718,0.00036667116,0.00091304944,0.0005096377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058414575,0.00007938996,0.00014764468,0.00012853295,0.000020459755,0.00011522664,0.00006444081,0.81753147,0.014548896,0.047706034,0.0019778279,0.117621526],"study_design_scores_gemma":[0.000012592204,0.00005756492,0.000039525094,0.0000103097145,0.000009081232,0.00004773369,0.000014889604,0.9831472,0.004375462,0.008552077,0.0037276251,0.0000059781514],"about_ca_topic_score_codex":0.0008456398,"about_ca_topic_score_gemma":0.0017192839,"teacher_disagreement_score":0.0027726197,"about_ca_system_score_codex":0.00045802767,"about_ca_system_score_gemma":0.0007272741,"threshold_uncertainty_score":0.009275377},"labels":[],"label_agreement":null},{"id":"W3159717212","doi":"10.1109/iscas51556.2021.9401562","title":"Analog Layout Placement for FinFET Technology Using Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Leverage (statistics); Computer science; Reinforcement learning; Analog multiplier; Analogue electronics; Page layout; Process (computing); Computer engineering; Computer architecture; Artificial intelligence; Engineering; Computer hardware; Analog signal; Electrical engineering; Electronic circuit","score_opus":0.019697238196305606,"score_gpt":0.25247244360131227,"score_spread":0.23277520540500665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159717212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03558061,0.0002168709,0.9587269,0.000112953436,0.000059834903,0.0000613275,0.000021204203,0.0008643324,0.004356014],"genre_scores_gemma":[0.7349676,0.00011361923,0.26167583,0.00008807463,0.000020606942,0.000063553256,0.000034101085,0.000055029876,0.0029815077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998617,0.000024365829,0.000006170819,0.000032207896,0.00005856609,0.000017003602],"domain_scores_gemma":[0.99972945,0.00010032344,0.000055756667,0.000030793282,0.00006243963,0.000021184005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288316,0.0005854531,0.00028720847,0.00026875638,0.000281562,0.0002912059,0.0006349464,0.00048316672,0.0018799352],"category_scores_gemma":[0.0006151646,0.00024639207,0.00025320152,0.00023681152,0.00033781785,0.00039917085,0.00039504402,0.00045641421,0.0002453627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007562394,0.0000627009,0.0006819727,0.00008301531,0.000021368644,0.00011552936,0.00005053153,0.8494363,0.02598684,0.0026361174,0.0009833461,0.11986666],"study_design_scores_gemma":[0.000010731982,0.00006486419,0.00013212193,0.0000051568045,0.0000044685657,0.000030423855,0.000005488395,0.9938851,0.0042996863,0.0008760884,0.00068127975,0.0000045393854],"about_ca_topic_score_codex":0.0024959382,"about_ca_topic_score_gemma":0.004933332,"teacher_disagreement_score":0.0024959382,"about_ca_system_score_codex":0.0006368631,"about_ca_system_score_gemma":0.0007204833,"threshold_uncertainty_score":0.0062890053},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02337800119548627,"score_gpt":0.23485294282619915,"score_spread":0.21147494163071287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166559827","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01122352,0.2830787,0.47970027,0.006118957,0.0020199502,0.000380498,0.0003884095,0.0012055567,0.21588413],"genre_scores_gemma":[0.14574713,0.30197582,0.46740118,0.0027365298,0.0024205176,0.00057154946,0.0008143151,0.00041306397,0.077919886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934036,0.000111984635,0.000064341715,0.00011273535,0.00032065736,0.0000498672],"domain_scores_gemma":[0.99949443,0.00013318744,0.000033713553,0.000065297805,0.00023501436,0.000038429673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090197474,0.0007344542,0.00029716836,0.0012977676,0.00041229278,0.0024607854,0.0009330546,0.001298076,0.0036243466],"category_scores_gemma":[0.0012173129,0.0006253953,0.0002947713,0.0011979766,0.0013105583,0.0020571768,0.00071155373,0.002099787,0.0029382454],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089985624,0.000051391617,0.00096085237,0.0011588092,0.00002433226,0.00026396857,0.00035184852,0.010523839,0.007012872,0.37408316,0.022209601,0.5832694],"study_design_scores_gemma":[0.00002699099,0.00017341686,0.0010929262,0.0006476812,0.000018264811,0.0016636868,0.0001118931,0.013895528,0.004136058,0.07670366,0.9014597,0.00007024183],"about_ca_topic_score_codex":0.001509466,"about_ca_topic_score_gemma":0.0011948062,"teacher_disagreement_score":0.0036243466,"about_ca_system_score_codex":0.0010779055,"about_ca_system_score_gemma":0.0010100078,"threshold_uncertainty_score":0.012124658},"labels":[],"label_agreement":null},{"id":"W3168334689","doi":"10.1186/s42774-021-00074-x","title":"A new multi-level algorithm for balanced partition problem on large scale directed graphs","year":2021,"lang":"en","type":"article","venue":"Advances in Aerodynamics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Aerodynamics Research and Development Center; National Natural Science Foundation of China","keywords":"Graph partition; Partition (number theory); Partition problem; Cluster analysis; Computer science; Algorithm; Frequency partition of a graph; Theoretical computer science; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Artificial intelligence","score_opus":0.010618390845147357,"score_gpt":0.2563474883941447,"score_spread":0.24572909754899733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168334689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018748188,0.000113791655,0.97882617,0.00012331005,0.000022363101,0.000059670314,0.000035700567,0.00049532845,0.0015754986],"genre_scores_gemma":[0.29182956,0.000095501106,0.7050762,0.00010185429,0.000029172728,0.0001864959,0.00023556412,0.00018325415,0.002262423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995635,0.00008864437,0.000023085593,0.00010652805,0.00013617742,0.00008197442],"domain_scores_gemma":[0.99952173,0.00017307182,0.00006104553,0.000068235335,0.000114897295,0.00006111946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005084075,0.0007474312,0.0009393454,0.0011232392,0.00076293014,0.0011017412,0.0015232235,0.000975363,0.0033418015],"category_scores_gemma":[0.0012548036,0.0004440717,0.0005837395,0.000832472,0.0005021244,0.0017089017,0.0016687306,0.00087875506,0.00046694995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002072714,0.00014358941,0.0012800108,0.0001527289,0.000052850246,0.00008049905,0.00017257337,0.67846644,0.015395052,0.036931463,0.0047313524,0.2623862],"study_design_scores_gemma":[0.000027466713,0.000032021628,0.00007482193,0.0000045223646,0.000004379741,0.000017763039,0.000018088751,0.9933287,0.0012907824,0.004362419,0.00083491433,0.0000040820173],"about_ca_topic_score_codex":0.0027011363,"about_ca_topic_score_gemma":0.0036369525,"teacher_disagreement_score":0.0033418015,"about_ca_system_score_codex":0.0011455116,"about_ca_system_score_gemma":0.0009974821,"threshold_uncertainty_score":0.011179388},"labels":[],"label_agreement":null},{"id":"W317001884","doi":"","title":"Proceedings of the 22st Annual Symposium on Integrated Circuits and Systems Design: Chip on the Dunes, SBCCI 2009, Natal, Brazil, August 31 - September 03, 2009","year":2009,"lang":"en","type":"article","venue":"Symposium on Integrated Circuits and Systems Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Chip; System on a chip; Engineering; Telecommunications; Embedded system","score_opus":0.019313384306271133,"score_gpt":0.219492695547199,"score_spread":0.20017931124092786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W317001884","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047061432,0.09287119,0.31620938,0.011637514,0.051589806,0.00094061525,0.0029397716,0.007274333,0.46947598],"genre_scores_gemma":[0.07315575,0.026224097,0.06889563,0.001316256,0.0023011654,0.00017755432,0.0033981786,0.0014936451,0.8230377],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935037,0.00011400808,0.000027903812,0.00008515341,0.00033502575,0.00008759486],"domain_scores_gemma":[0.9987639,0.00015441563,0.000025745609,0.0001707951,0.0007027492,0.00018248826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013067119,0.0010908096,0.0011345185,0.00084220007,0.0006969958,0.0024054835,0.000948362,0.0008391289,0.06086579],"category_scores_gemma":[0.001286964,0.0004359187,0.00057990185,0.00070862053,0.0006450511,0.00078826176,0.00083539507,0.0017595591,0.02241514],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042402346,0.00026242706,0.0017524812,0.00029697744,0.00011318387,0.00029666015,0.00018219098,0.0023028827,0.01648322,0.0072505446,0.6126929,0.35794252],"study_design_scores_gemma":[0.000049749822,0.00034948654,0.0028843463,0.00015385072,0.000104672625,0.00067462726,0.0001275848,0.011605838,0.014041445,0.002776383,0.96718985,0.00004215353],"about_ca_topic_score_codex":0.007841534,"about_ca_topic_score_gemma":0.044424783,"teacher_disagreement_score":0.06086579,"about_ca_system_score_codex":0.0013682721,"about_ca_system_score_gemma":0.0020017943,"threshold_uncertainty_score":0.20361638},"labels":[],"label_agreement":null},{"id":"W3182769310","doi":"10.1109/rtas52030.2021.00061","title":"Work in Progress: Path-based Graph Partition for Parallel Hardware-accelerated Functional Verification","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Research and Development","keywords":"Computer science; Parallel computing; Graph partition; Partition (number theory); Directed acyclic graph; Scheduling (production processes); Partition problem; Very-large-scale integration; Critical path method; Graph; Theoretical computer science; Algorithm; Embedded system; Mathematics; Mathematical optimization","score_opus":0.03826321316868462,"score_gpt":0.2383112089487506,"score_spread":0.200047995780066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182769310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024487333,0.0025492862,0.96432096,0.0005581524,0.0002427136,0.00017279254,0.000116549585,0.0023953032,0.0051569412],"genre_scores_gemma":[0.20588496,0.0032663424,0.78060627,0.00027700476,0.00025764093,0.00023285754,0.0010547724,0.00060241896,0.0078177545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993444,0.00015778097,0.000037380458,0.00016679669,0.00021784949,0.000075694894],"domain_scores_gemma":[0.99853945,0.00035984302,0.00007046469,0.00041863834,0.0005303245,0.000081280756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009974041,0.0008589751,0.00071755267,0.0010136149,0.0005438661,0.0009927333,0.0018399241,0.0007544136,0.006095164],"category_scores_gemma":[0.0016277668,0.0003482324,0.001037176,0.0013225356,0.0006732114,0.0023709936,0.00082564575,0.00097600115,0.0013356471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032677522,0.0003044965,0.0010670946,0.000538583,0.000118741875,0.00015789359,0.00044553075,0.1031642,0.052043803,0.023215337,0.011424768,0.8071927],"study_design_scores_gemma":[0.00014682912,0.000790124,0.0010391537,0.000069693924,0.00012323861,0.00032397942,0.00019630507,0.8511307,0.063712485,0.017558279,0.06483629,0.00007292091],"about_ca_topic_score_codex":0.0032266807,"about_ca_topic_score_gemma":0.0016527048,"teacher_disagreement_score":0.006095164,"about_ca_system_score_codex":0.0006196585,"about_ca_system_score_gemma":0.0013231309,"threshold_uncertainty_score":0.020390391},"labels":[],"label_agreement":null},{"id":"W3187519750","doi":"10.1016/j.disopt.2021.100657","title":"The Bipartite Boolean Quadric Polytope","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Quadric; Combinatorics; Discrete mathematics; Bipartite graph; Clique; Duality (order theory); Graph","score_opus":0.004837548440651212,"score_gpt":0.1978723109585278,"score_spread":0.1930347625178766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187519750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18085054,0.00080447755,0.6638568,0.0012114207,0.00013095677,0.00009792349,0.000852102,0.00019169506,0.15200414],"genre_scores_gemma":[0.85047376,0.0009511141,0.10845545,0.00040998572,0.00009465207,0.00010928496,0.00083343114,0.00013503351,0.038537167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.000074292475,0.000005984745,0.000038044414,0.000087569824,0.000034621342],"domain_scores_gemma":[0.9997938,0.00008560713,0.000020261486,0.000023764444,0.000049158956,0.000027451853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031702573,0.00030528576,0.00045707537,0.00058312505,0.0003696201,0.0009374401,0.00039734357,0.00037836764,0.011540327],"category_scores_gemma":[0.0010841525,0.00020421599,0.00024063712,0.0006415579,0.00074398215,0.0006480909,0.0006436712,0.0006637264,0.0008189096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006766782,0.000044427354,0.00070691865,0.0001276498,0.000023353725,0.00009023025,0.000048974878,0.09281965,0.003144419,0.84852785,0.0076049236,0.046794046],"study_design_scores_gemma":[0.000053896307,0.00011462406,0.0016524608,0.000059360395,0.000016187685,0.00030539813,0.000111017165,0.48199803,0.0022136928,0.49040362,0.023044985,0.000026708893],"about_ca_topic_score_codex":0.002548373,"about_ca_topic_score_gemma":0.0026477769,"teacher_disagreement_score":0.011540327,"about_ca_system_score_codex":0.0005002782,"about_ca_system_score_gemma":0.0004329642,"threshold_uncertainty_score":0.038606226},"labels":[],"label_agreement":null},{"id":"W3193692689","doi":"10.1145/3465373","title":"A Deep Learning Framework to Predict Routability for FPGA Circuit Placement","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Overfitting; Convolutional neural network; Deep learning; Process (computing); Computer engineering; Artificial intelligence; Placement; Netlist; Computer architecture; Artificial neural network; Parallel computing; Algorithm; Machine learning; Embedded system; Circuit design; Physical design","score_opus":0.01829405432440499,"score_gpt":0.23635761236458508,"score_spread":0.2180635580401801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193692689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049986698,0.00046240812,0.943773,0.0002560488,0.000045659286,0.00003981342,0.00031165467,0.003150207,0.0019745892],"genre_scores_gemma":[0.7741366,0.00033684357,0.21979164,0.00013822273,0.00004173183,0.00009950789,0.0008563979,0.00016005304,0.004439101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985933,0.00002082418,0.0000073719184,0.00004319836,0.00004435037,0.000024846058],"domain_scores_gemma":[0.99965525,0.00012911526,0.000056110446,0.000046043875,0.00009724899,0.000016257267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028548882,0.0011127923,0.0003638392,0.0006284707,0.00019210271,0.0004889943,0.0011423875,0.00063132617,0.001864005],"category_scores_gemma":[0.0011861088,0.00046853928,0.00039629234,0.00045174814,0.0003196007,0.0007846244,0.00037136595,0.0009705838,0.00041607898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032118925,0.000027285847,0.0007667656,0.000020148316,0.000017409613,0.000030148578,0.0000072098965,0.9463103,0.0025830742,0.0010026929,0.0009122259,0.04829067],"study_design_scores_gemma":[0.0000012124087,0.0000075234843,0.00007642075,0.0000014179185,0.0000023554653,0.000004991592,0.0000010388445,0.9985576,0.00069676276,0.0005051987,0.000144421,0.00000109447],"about_ca_topic_score_codex":0.01164285,"about_ca_topic_score_gemma":0.02406074,"teacher_disagreement_score":0.01164285,"about_ca_system_score_codex":0.0012283418,"about_ca_system_score_gemma":0.0012290856,"threshold_uncertainty_score":0.023150146},"labels":[],"label_agreement":null},{"id":"W3196467229","doi":"10.1109/tvlsi.2021.3107404","title":"Efficient Performance Modeling for Automated CMOS Analog Circuit Synthesis","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Netlist; Computer science; Circuit extraction; Electronic engineering; Network topology; CMOS; Equivalent circuit; Transistor; Topology (electrical circuits); Computer engineering; Algorithm; Computer hardware; Engineering; Electrical engineering; Voltage","score_opus":0.019417589222570582,"score_gpt":0.2264605211824901,"score_spread":0.20704293195991952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196467229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008902144,0.000087200584,0.9871459,0.000046079884,0.000008343682,0.000027991435,0.00009476065,0.0015583779,0.002129209],"genre_scores_gemma":[0.6597886,0.0003166526,0.33613053,0.000051881805,0.000028112634,0.00022297751,0.00039891308,0.00046166932,0.002600636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957794,0.00008968381,0.0000216239,0.00006244379,0.00021530755,0.000033074295],"domain_scores_gemma":[0.9995491,0.00016815326,0.000060211998,0.00014437303,0.000069599184,0.000008564703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037416033,0.00093198713,0.00038944086,0.0006722673,0.00034430754,0.0006528414,0.0008271687,0.0004305895,0.0022465375],"category_scores_gemma":[0.0015036968,0.00039445772,0.00058951776,0.00044963826,0.0003648051,0.0012408568,0.00044917266,0.0007500055,0.00068193104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001825749,0.000018660568,0.00033787862,0.00004314751,0.000015305108,0.000029760608,0.00002836302,0.9255568,0.013729255,0.013971451,0.00053544715,0.045715775],"study_design_scores_gemma":[0.0000016587778,0.000008469522,0.000053815977,0.000002974287,0.0000029273988,0.000010513224,0.000002403213,0.992725,0.003052556,0.003434761,0.00070173404,0.000003208151],"about_ca_topic_score_codex":0.003123126,"about_ca_topic_score_gemma":0.003574359,"teacher_disagreement_score":0.003123126,"about_ca_system_score_codex":0.0010012949,"about_ca_system_score_gemma":0.00097346347,"threshold_uncertainty_score":0.007515371},"labels":[],"label_agreement":null},{"id":"W3197603378","doi":"10.1109/tcad.2021.3109863","title":"RLPlace: Using Reinforcement Learning and Smart Perturbations to Optimize FPGA Placement","year":2021,"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":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; VMware; Google","keywords":"Field-programmable gate array; Computer science; Reinforcement learning; Simulated annealing; Quality (philosophy); Parallel computing; Algorithm; Artificial intelligence; Embedded system","score_opus":0.03147460674607729,"score_gpt":0.23712456196530796,"score_spread":0.20564995521923066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197603378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056072775,0.00034157868,0.93525743,0.00017656208,0.00008790765,0.00008989084,0.000051371768,0.0047238497,0.003198665],"genre_scores_gemma":[0.755364,0.00013830367,0.24122077,0.00015049161,0.000036169276,0.00012391528,0.000095991294,0.00027554564,0.0025948777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999668,0.00009108852,0.000016423326,0.00007549063,0.00010731377,0.00004161306],"domain_scores_gemma":[0.9994061,0.0002629997,0.00011324839,0.00009212123,0.00008521397,0.0000403047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056992745,0.00090025325,0.00054366345,0.000387957,0.00024094846,0.0004874276,0.0012779412,0.0007100036,0.001905255],"category_scores_gemma":[0.001858188,0.0003425185,0.0003934884,0.00026106808,0.0005705514,0.0006035857,0.0007330666,0.0008278038,0.0004648677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011130446,0.00006641262,0.0006445932,0.000052026742,0.00004032822,0.000069915484,0.000037293314,0.90247643,0.0087784175,0.0023951835,0.0009858494,0.08434227],"study_design_scores_gemma":[0.000017567952,0.00007146657,0.00007698964,0.0000035866303,0.0000063723282,0.00001550028,0.0000045606475,0.9957996,0.0027491718,0.0006836547,0.00056641793,0.000005092338],"about_ca_topic_score_codex":0.0034753315,"about_ca_topic_score_gemma":0.004194981,"teacher_disagreement_score":0.0034753315,"about_ca_system_score_codex":0.00066060014,"about_ca_system_score_gemma":0.000864944,"threshold_uncertainty_score":0.006910205},"labels":[],"label_agreement":null},{"id":"W3199073795","doi":"10.1109/mlcad52597.2021.9531243","title":"Effective Machine-Learning Models for Predicting Routability During FPGA Placement","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Boosting (machine learning); Computer science; Routing (electronic design automation); Field-programmable gate array; Simple (philosophy); Stack (abstract data type); Algorithm; Machine learning; Parallel computing; Artificial intelligence; Computer engineering; Embedded system","score_opus":0.011180650174050306,"score_gpt":0.2180569008370414,"score_spread":0.2068762506629911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199073795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085247,0.00086941366,0.9103357,0.00026328897,0.0000965655,0.000043466243,0.0002028758,0.0015770358,0.001364745],"genre_scores_gemma":[0.82156813,0.00043887654,0.17473349,0.00014236175,0.000106553365,0.00009712071,0.0005870328,0.00012338419,0.00220309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993461,0.00020931463,0.000034499302,0.00011897623,0.0002035396,0.00008750406],"domain_scores_gemma":[0.99686384,0.0019402766,0.00028512982,0.0003078907,0.0005224036,0.000080511585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015075605,0.0012333298,0.0010669597,0.00096806267,0.00043460066,0.00097142986,0.0013527741,0.0011150717,0.0012764338],"category_scores_gemma":[0.00477343,0.0005414728,0.00063822686,0.00094519975,0.0003370161,0.001410595,0.0005870255,0.0016869169,0.00076061336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045712102,0.00004783269,0.0012364351,0.000020057001,0.000025496174,0.00002079009,0.000011842425,0.94417375,0.0013679618,0.00061002444,0.00066796417,0.051771995],"study_design_scores_gemma":[9.678056e-7,0.000015224797,0.00012728725,0.0000021089481,0.000003695595,0.000005062207,0.0000021026162,0.9988558,0.00043831902,0.00046158722,0.0000858293,0.0000019469644],"about_ca_topic_score_codex":0.0030166812,"about_ca_topic_score_gemma":0.0055721016,"teacher_disagreement_score":0.0030166812,"about_ca_system_score_codex":0.00069416454,"about_ca_system_score_gemma":0.0006859622,"threshold_uncertainty_score":0.0079728365},"labels":[],"label_agreement":null},{"id":"W3204115212","doi":"10.1109/tvlsi.2021.3109560","title":"Analog Circuit Design Using Symbolic Math Toolboxes: Demonstrative Examples","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Analogue electronics; Electronic engineering; Electronic circuit; Representation (politics); Parasitic extraction; Circuit design; Computer engineering; Algorithm; Engineering; Electrical engineering","score_opus":0.044292664488729004,"score_gpt":0.24585190853968122,"score_spread":0.2015592440509522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204115212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060300967,0.00074158824,0.97441894,0.00018286824,0.000044466957,0.00009016456,0.00011279539,0.0013425438,0.017036542],"genre_scores_gemma":[0.1563583,0.0017463138,0.8331127,0.00010322258,0.00005399465,0.00032945964,0.00018332087,0.0002971699,0.007815355],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994419,0.00017578578,0.000037243903,0.000035299032,0.00027978225,0.000029886614],"domain_scores_gemma":[0.9990533,0.0006701334,0.000043114294,0.00008650109,0.00012977538,0.000017082364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082404504,0.00098045,0.00045300493,0.0007422769,0.00043086545,0.0007600326,0.0008695484,0.0009090568,0.010249307],"category_scores_gemma":[0.002374269,0.00032622888,0.0004720143,0.00073022215,0.0007008698,0.0007130927,0.00061793963,0.0008775908,0.0024589743],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020799173,0.00021031387,0.00053696736,0.0020571847,0.00008039838,0.001126738,0.0007091503,0.30516335,0.045311246,0.2917257,0.010715189,0.34215587],"study_design_scores_gemma":[0.00016694148,0.00036759942,0.00035908914,0.00031529256,0.000052772542,0.0012596893,0.00013545442,0.7297776,0.040881455,0.10182633,0.12479804,0.000059753176],"about_ca_topic_score_codex":0.0006244179,"about_ca_topic_score_gemma":0.0010506605,"teacher_disagreement_score":0.010249307,"about_ca_system_score_codex":0.00043865526,"about_ca_system_score_gemma":0.00036700655,"threshold_uncertainty_score":0.034287393},"labels":[],"label_agreement":null},{"id":"W3211377203","doi":"10.1016/j.orl.2021.10.005","title":"The pairwise flowtime network construction problem","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Connection (principal bundle); Mathematics; Combinatorics; Time complexity; Discrete mathematics; Computer science; Mathematical optimization; Algorithm","score_opus":0.024144724458390502,"score_gpt":0.2807077763147023,"score_spread":0.2565630518563118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211377203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06884121,0.00038162826,0.894128,0.003721614,0.00020767178,0.00030466646,0.0010909861,0.00045341376,0.030870836],"genre_scores_gemma":[0.4710405,0.0013187337,0.4935309,0.0008867549,0.00035074324,0.00073743326,0.0033592721,0.0005252979,0.028250368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988158,0.00045906098,0.000039245406,0.00033867388,0.00018041441,0.00016686591],"domain_scores_gemma":[0.99592835,0.002715084,0.00029291198,0.00050137646,0.00025263306,0.00030965797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284814,0.00090115005,0.0008760969,0.0006685507,0.0012895016,0.0020115555,0.0021020442,0.0020957293,0.016090814],"category_scores_gemma":[0.008446761,0.00071562344,0.0011910332,0.0014983311,0.0012268154,0.006523738,0.0022339744,0.003023419,0.001121075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036293367,0.00031846747,0.0011021456,0.0006155012,0.00009651947,0.00023492893,0.00025195844,0.23229356,0.0031929393,0.58530253,0.029700013,0.14652851],"study_design_scores_gemma":[0.00013036423,0.00015627735,0.000542857,0.00006117184,0.000055090142,0.00020878046,0.00016069027,0.26232508,0.003100322,0.7189874,0.014243731,0.000028191089],"about_ca_topic_score_codex":0.0016168377,"about_ca_topic_score_gemma":0.0019596815,"teacher_disagreement_score":0.016090814,"about_ca_system_score_codex":0.0015099534,"about_ca_system_score_gemma":0.0020792987,"threshold_uncertainty_score":0.053829134},"labels":[],"label_agreement":null},{"id":"W3215814272","doi":"10.32920/ryerson.14647368.v1","title":"Parallel Implementation of Non-slicing Floorplans with MPI and OpenMP","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Parallel computing; Computer science; Floorplan; Benchmark (surveying); Multiprocessing; Very-large-scale integration; Slicing; Computation; Tree (set theory); Computer architecture; Embedded system; Algorithm","score_opus":0.010706930939589066,"score_gpt":0.259707047487965,"score_spread":0.24900011654837595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215814272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028095929,0.00012658007,0.9540153,0.000088770794,0.00007048474,0.00009835369,0.00029270165,0.011234026,0.0059777657],"genre_scores_gemma":[0.2131888,0.00013690486,0.7808197,0.00004368229,0.000021094385,0.00022808522,0.0011011845,0.0009038186,0.0035567174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963284,0.00006345937,0.000030041907,0.0000499153,0.0001745355,0.000049164966],"domain_scores_gemma":[0.99940085,0.00018574487,0.000050474053,0.0001482231,0.00018555719,0.00002911802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038846716,0.0006993639,0.0004598224,0.0006909753,0.0005644369,0.0006840518,0.0012047517,0.0003613466,0.004096584],"category_scores_gemma":[0.0014540518,0.0003722154,0.00055901305,0.00071196613,0.00032414123,0.0006012228,0.0005489272,0.0006189941,0.0008168965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036058665,0.00020551174,0.0026859425,0.00043217567,0.00017833954,0.00042998567,0.00038636776,0.48255306,0.050316934,0.021532321,0.012342422,0.42857638],"study_design_scores_gemma":[0.000046638674,0.00006264618,0.0006939695,0.000009933082,0.000019086301,0.00006587804,0.0000378727,0.9623285,0.023733009,0.006272447,0.006711744,0.000018339193],"about_ca_topic_score_codex":0.005416627,"about_ca_topic_score_gemma":0.0056363977,"teacher_disagreement_score":0.005416627,"about_ca_system_score_codex":0.00035775077,"about_ca_system_score_gemma":0.0009014463,"threshold_uncertainty_score":0.013704479},"labels":[],"label_agreement":null},{"id":"W3216491306","doi":"10.1109/tvlsi.2021.3102088","title":"High-Dimensional Many-Objective Bayesian Optimization for LDE-Aware Analog IC Sizing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Foundation for Innovation","keywords":"Sizing; Bayesian optimization; Computer science; Dimension (graph theory); Mathematical optimization; Computer engineering; Electronic engineering; Engineering; Artificial intelligence; Mathematics","score_opus":0.00880592322359947,"score_gpt":0.21828826331407286,"score_spread":0.2094823400904734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216491306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008027548,0.00013173735,0.99032694,0.00006957135,0.000010322423,0.000021616444,0.000021552962,0.00014566207,0.0012450021],"genre_scores_gemma":[0.45207343,0.00023883786,0.5443079,0.00022370463,0.00003426273,0.00027085512,0.00023262955,0.00018548314,0.002432927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995215,0.00015738374,0.000018084938,0.0000675081,0.00019676439,0.000038820323],"domain_scores_gemma":[0.9991683,0.00052987435,0.00008134714,0.000056666973,0.00012697214,0.00003691817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874001,0.0008123806,0.00091376394,0.00070340984,0.00033648027,0.00066861854,0.00093051913,0.00087300414,0.0020732149],"category_scores_gemma":[0.002559479,0.0006043936,0.00066716917,0.0006280102,0.00057324086,0.0008521671,0.0009287985,0.0010028492,0.00028904813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023196724,0.000022818913,0.00029662004,0.00003315377,0.000020596324,0.00001559606,0.00001889715,0.9662171,0.0014780017,0.003695873,0.00039617193,0.027781976],"study_design_scores_gemma":[0.000003422943,0.000008196521,0.00004766745,0.000002381575,0.0000022062297,0.0000044365975,0.0000019788497,0.9983961,0.00022812115,0.0011528386,0.00015079007,0.0000018504422],"about_ca_topic_score_codex":0.0026738045,"about_ca_topic_score_gemma":0.0039377464,"teacher_disagreement_score":0.0026738045,"about_ca_system_score_codex":0.0006739172,"about_ca_system_score_gemma":0.000989123,"threshold_uncertainty_score":0.006935656},"labels":[],"label_agreement":null},{"id":"W4200335229","doi":"10.32920/17303846","title":"Investigating The Efficiency Of The VPR And COFFE Area Models In Predicting The Layout Area Of FPGA Lookup Tables","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McGill University","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Lookup table; Computer science; Block (permutation group theory); Benchmark (surveying); Embedded system; Mathematics; Geometry; Geography","score_opus":0.029610208371433935,"score_gpt":0.21355779931383623,"score_spread":0.1839475909424023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200335229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8354286,0.0009737345,0.15829985,0.00019127251,0.00003896398,0.000077735305,0.00032565885,0.0013717139,0.0032924302],"genre_scores_gemma":[0.95572287,0.00024324581,0.042705018,0.00003276542,0.0000073354186,0.000044159286,0.00021437583,0.00006294456,0.00096722227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00011898276,0.000024474204,0.00009995074,0.000150288,0.000045306224],"domain_scores_gemma":[0.9945543,0.004437647,0.00031072542,0.0002851964,0.00037749752,0.000034574037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437154,0.0008139947,0.00040987934,0.0008671246,0.00023162743,0.00062010606,0.000788669,0.00084051205,0.00070858706],"category_scores_gemma":[0.007184401,0.0003647201,0.0004788102,0.00065906165,0.0002813232,0.0011034255,0.0002721188,0.00044871512,0.00023323034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001744202,0.000064315034,0.010206844,0.000060780447,0.000046126177,0.000057319892,0.00004795463,0.9461375,0.0056508807,0.00069411396,0.0002845186,0.036575295],"study_design_scores_gemma":[0.0000028008888,0.000052363255,0.0008849752,0.0000031957788,0.000004948794,0.000016767232,0.000007792424,0.9965643,0.0023039768,0.00006365966,0.0000906358,0.000004486697],"about_ca_topic_score_codex":0.017551376,"about_ca_topic_score_gemma":0.015989231,"teacher_disagreement_score":0.017551376,"about_ca_system_score_codex":0.00068162085,"about_ca_system_score_gemma":0.0006415377,"threshold_uncertainty_score":0.0348984},"labels":[],"label_agreement":null},{"id":"W4200447807","doi":"10.32920/17303846.v1","title":"Investigating The Efficiency Of The VPR And COFFE Area Models In Predicting The Layout Area Of FPGA Lookup Tables","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McGill University","funders":"","keywords":"Field-programmable gate array; Routing (electronic design automation); Lookup table; Computer science; Block (permutation group theory); Benchmark (surveying); Embedded system; Mathematics; Geometry; Geography","score_opus":0.029610208371433935,"score_gpt":0.21355779931383623,"score_spread":0.1839475909424023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200447807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8354286,0.0009737345,0.15829985,0.00019127251,0.00003896398,0.000077735305,0.00032565885,0.0013717139,0.0032924302],"genre_scores_gemma":[0.95572287,0.00024324581,0.042705018,0.00003276542,0.0000073354186,0.000044159286,0.00021437583,0.00006294456,0.00096722227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00011898276,0.000024474204,0.00009995074,0.000150288,0.000045306224],"domain_scores_gemma":[0.9945543,0.004437647,0.00031072542,0.0002851964,0.00037749752,0.000034574037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437154,0.0008139947,0.00040987934,0.0008671246,0.00023162743,0.00062010606,0.000788669,0.00084051205,0.00070858706],"category_scores_gemma":[0.007184401,0.0003647201,0.0004788102,0.00065906165,0.0002813232,0.0011034255,0.0002721188,0.00044871512,0.00023323034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001744202,0.000064315034,0.010206844,0.000060780447,0.000046126177,0.000057319892,0.00004795463,0.9461375,0.0056508807,0.00069411396,0.0002845186,0.036575295],"study_design_scores_gemma":[0.0000028008888,0.000052363255,0.0008849752,0.0000031957788,0.000004948794,0.000016767232,0.000007792424,0.9965643,0.0023039768,0.00006365966,0.0000906358,0.000004486697],"about_ca_topic_score_codex":0.017551376,"about_ca_topic_score_gemma":0.015989231,"teacher_disagreement_score":0.017551376,"about_ca_system_score_codex":0.00068162085,"about_ca_system_score_gemma":0.0006415377,"threshold_uncertainty_score":0.0348984},"labels":[],"label_agreement":null},{"id":"W4206801664","doi":"10.1109/icm52667.2021.9664954","title":"Using Machine Learning to Predict Operating Frequency During Placement in FPGA Designs","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Netlist; Computer science; Field-programmable gate array; Machine learning; Design flow; Regression; Artificial intelligence; Computer engineering; Computer hardware; Embedded system; Mathematics","score_opus":0.032476833279040794,"score_gpt":0.2565671384650938,"score_spread":0.22409030518605302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206801664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42326242,0.0011621861,0.5708519,0.00030825453,0.00006059169,0.000035225614,0.00018558321,0.0024287512,0.0017050509],"genre_scores_gemma":[0.9493362,0.00017326466,0.04946586,0.000032148055,0.000021853788,0.000021386588,0.00014891943,0.000048273345,0.0007521786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.00014219646,0.000022900631,0.000110259316,0.00013349028,0.00006773595],"domain_scores_gemma":[0.9972957,0.0018816858,0.0003495424,0.00018987567,0.00024529127,0.000037933798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076628366,0.0009080964,0.0005950618,0.0006148407,0.00027758465,0.00054156285,0.0007088735,0.0007420113,0.00061490544],"category_scores_gemma":[0.0044956305,0.0003890186,0.0003376054,0.00059354893,0.000292091,0.0008900651,0.00024602658,0.00082165666,0.00031770862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005126985,0.000034519242,0.0029902232,0.000020348336,0.000018601748,0.000038776325,0.000013140919,0.9387995,0.0025022845,0.00017980025,0.00020499494,0.05514642],"study_design_scores_gemma":[0.0000013598024,0.00002961818,0.00044416683,0.0000025403026,0.0000028798029,0.000015540298,0.0000042739616,0.9973133,0.0017745126,0.00032824083,0.000080911355,0.0000025472307],"about_ca_topic_score_codex":0.0036846937,"about_ca_topic_score_gemma":0.005456798,"teacher_disagreement_score":0.0036846937,"about_ca_system_score_codex":0.0006154167,"about_ca_system_score_gemma":0.0005551645,"threshold_uncertainty_score":0.0073264837},"labels":[],"label_agreement":null},{"id":"W4211258324","doi":"10.1145/611835.611838","title":"Using logic duplication to improve performance in FPGAs","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Path (computing); Computer science; Critical path method; Programmable logic device; Logic synthesis; Logic optimization; Data deduplication; Logic gate; Parallel computing; Gene duplication; Algorithm; Embedded system; Engineering; Programming language","score_opus":0.025479367273861124,"score_gpt":0.2480734802009621,"score_spread":0.22259411292710096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211258324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44605163,0.0028109234,0.535017,0.0005500629,0.00024375418,0.000093263676,0.000056624816,0.0040788013,0.011097893],"genre_scores_gemma":[0.7733921,0.0008148406,0.22020434,0.00029072454,0.00021594172,0.000043471984,0.00011666727,0.00024638564,0.0046756384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925333,0.00013524936,0.0000628833,0.00010061918,0.00030763994,0.00014018409],"domain_scores_gemma":[0.9983877,0.0007187862,0.00025329628,0.0003234544,0.0002628565,0.00005388167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291364,0.00082730385,0.0004810466,0.0008760389,0.00049439276,0.00075015594,0.0014592321,0.00054353464,0.0021595787],"category_scores_gemma":[0.0029205629,0.0003800921,0.00030131705,0.00089036376,0.00048338762,0.0017964399,0.00070507993,0.00047921797,0.0007635786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010760851,0.00019271318,0.004180517,0.00036899318,0.00011565884,0.0014874567,0.00025596315,0.14304379,0.31225255,0.016496863,0.0036803007,0.51684916],"study_design_scores_gemma":[0.00018369239,0.0028396433,0.0038948883,0.00007528806,0.00019771096,0.0037431654,0.000105215404,0.29058278,0.6564933,0.010262174,0.031527415,0.000094725525],"about_ca_topic_score_codex":0.0005338857,"about_ca_topic_score_gemma":0.00081403495,"teacher_disagreement_score":0.0021595787,"about_ca_system_score_codex":0.00074485753,"about_ca_system_score_gemma":0.0005122508,"threshold_uncertainty_score":0.0072244406},"labels":[],"label_agreement":null},{"id":"W4213131631","doi":"10.1145/3501803","title":"RapidLayout: Fast Hard Block Placement of FPGA-optimized Systolic Arrays Using Evolutionary Algorithm","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; University of Waterloo; Mitacs; Sun Yat-sen University","keywords":"Computer science; Algorithm; Placement; Parallel computing; Field-programmable gate array; Block (permutation group theory); Simulated annealing; Routing (electronic design automation); Minimum bounding box; Bootstrapping (finance); Computer hardware; Embedded system; Circuit design; Physical design; Mathematics","score_opus":0.018276673021964496,"score_gpt":0.21781229927105503,"score_spread":0.19953562624909052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213131631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07205506,0.00043473407,0.88273317,0.00023787968,0.00016214715,0.00016793092,0.00040270435,0.02813731,0.015669163],"genre_scores_gemma":[0.31133485,0.00019725437,0.6766151,0.0002140049,0.0000312278,0.00021489579,0.0009777985,0.002312534,0.008102297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998142,0.000041241303,0.000007872993,0.000035533787,0.00007022378,0.000030920437],"domain_scores_gemma":[0.99972373,0.0001388797,0.000027368844,0.00004775565,0.0000474442,0.000014764469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045027005,0.0009829758,0.0003630598,0.00034574675,0.00026316303,0.00048627768,0.0010604146,0.0005549285,0.008814491],"category_scores_gemma":[0.00096874544,0.0004005204,0.00048807924,0.00026743667,0.0003141701,0.00055151974,0.0005777604,0.0007064884,0.0012378773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018250933,0.00010774811,0.0012901659,0.00025092356,0.00006893005,0.00020314247,0.00008596141,0.669753,0.03045612,0.008800026,0.017635044,0.27116635],"study_design_scores_gemma":[0.00007802144,0.00012503774,0.00027286177,0.000018034983,0.000011003473,0.00004975674,0.000022097029,0.9746164,0.013597425,0.0034628375,0.0077333357,0.000013172347],"about_ca_topic_score_codex":0.002614839,"about_ca_topic_score_gemma":0.006041623,"teacher_disagreement_score":0.008814491,"about_ca_system_score_codex":0.0004916361,"about_ca_system_score_gemma":0.0009495111,"threshold_uncertainty_score":0.029487371},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021714337896414457,"score_gpt":0.20268336025317465,"score_spread":0.1809690223567602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213423202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008165795,0.00013427224,0.98821276,0.000044817487,0.000020199708,0.000035936075,0.000024618694,0.0008231772,0.0025384543],"genre_scores_gemma":[0.5288992,0.00015514047,0.4672507,0.00010155438,0.00002559536,0.00018372295,0.00014534623,0.00018570408,0.0030530263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975497,0.00004749797,0.000014148064,0.000057324094,0.00009679481,0.000029221379],"domain_scores_gemma":[0.9996419,0.00015957313,0.000039818402,0.000058388046,0.00008318566,0.000017178976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043237853,0.0006965844,0.00044978684,0.00044427085,0.00023361939,0.00041035455,0.00087859266,0.00048691424,0.002771278],"category_scores_gemma":[0.0009311674,0.00032610513,0.0005196889,0.00030286913,0.0003941254,0.0005337071,0.00056056835,0.0007364398,0.0003825898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004285854,0.000040448835,0.00033914423,0.000094007264,0.000032288197,0.0000651711,0.000036432237,0.8003977,0.012463194,0.0070137773,0.0008128582,0.17866214],"study_design_scores_gemma":[0.000008413676,0.000026086,0.000033575074,0.000003687646,0.0000056936024,0.000014859996,0.0000029394198,0.9945985,0.002241363,0.0023188319,0.00074327696,0.0000026842656],"about_ca_topic_score_codex":0.0019303213,"about_ca_topic_score_gemma":0.002938525,"teacher_disagreement_score":0.002771278,"about_ca_system_score_codex":0.0006423564,"about_ca_system_score_gemma":0.00075467816,"threshold_uncertainty_score":0.009270906},"labels":[],"label_agreement":null},{"id":"W4220782754","doi":"10.1186/s13059-022-02645-7","title":"Author Correction: Benchmarking transposable element annotation methods for creation of a streamlined, comprehensive pipeline","year":2022,"lang":"en","type":"erratum","venue":"Genome biology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Transposable element; Benchmarking; Pipeline (software); Biology; Computational biology; Annotation; Human genetics; Genome; Genetics; Data science; Computer science; Gene; Programming language","score_opus":0.02890398508704715,"score_gpt":0.3353251674681216,"score_spread":0.3064211823810744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220782754","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005064176,0.00060064293,0.007013296,0.04085092,0.9354224,0.00006052917,0.005399153,0.0033620875,0.0067846244],"genre_scores_gemma":[0.032867193,0.0046761613,0.053269513,0.080891445,0.13618517,0.00050431525,0.024505036,0.022497633,0.6446036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994107,0.00067660917,0.00078548316,0.0008317726,0.0032027105,0.00039634109],"domain_scores_gemma":[0.9390458,0.011608723,0.00187319,0.0043045073,0.04111637,0.0020515425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036470504,0.0016302072,0.0018314752,0.0032868206,0.003958181,0.003831608,0.0034147436,0.0048757507,0.13332838],"category_scores_gemma":[0.07694299,0.0010289208,0.0012418908,0.00271779,0.0021515666,0.0023455145,0.0028613147,0.0075754197,0.07150762],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040483297,0.000007945799,0.000095422765,0.0001313623,0.000011320808,0.00024237431,0.0000469251,0.000075503114,0.00025838063,0.0008170629,0.9892476,0.009025662],"study_design_scores_gemma":[0.000044508786,0.000023487431,0.000647789,0.00024209799,0.00004097437,0.00068490364,0.00011895458,0.00043270856,0.0018484931,0.002041989,0.9938214,0.000052708812],"about_ca_topic_score_codex":0.017767204,"about_ca_topic_score_gemma":0.02798437,"teacher_disagreement_score":0.13332838,"about_ca_system_score_codex":0.0032828178,"about_ca_system_score_gemma":0.0065369485,"threshold_uncertainty_score":0.44602787},"labels":[],"label_agreement":null},{"id":"W4226144797","doi":"10.1007/978-3-030-98832-6_49","title":"Quantitative Analysis of Informational Significance of SWEBOK Knowledge Areas in IEEE/ACM Curriculum Guidelines","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Curriculum; Computer science; Psychology; Pedagogy","score_opus":0.03136443883641031,"score_gpt":0.2783706916736247,"score_spread":0.2470062528372144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226144797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.919186,0.00047083388,0.010720367,0.0011274142,0.000028809109,0.0001587885,0.0025186052,0.00020376561,0.06558531],"genre_scores_gemma":[0.9932104,0.000101346224,0.0032618623,0.000051198873,0.000015090804,0.00006846647,0.0008164869,0.000029105406,0.0024461763],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9912033,0.0026997027,0.00068381795,0.00071816484,0.004216299,0.00047867018],"domain_scores_gemma":[0.8293297,0.13423817,0.010523646,0.0031762982,0.020630892,0.0021012714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822171,0.00010798889,0.00018967691,0.0074665076,0.00077589735,0.0030157021,0.0005474023,0.0004946905,0.006536639],"category_scores_gemma":[0.111457326,0.00015203419,0.0001688721,0.0063977772,0.0010748149,0.002606389,0.0016260179,0.00087639707,0.00066978566],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068979594,0.0004784976,0.51208985,0.000803365,0.00014205911,0.00029074427,0.018822793,0.005561142,0.0051706186,0.05573019,0.008403051,0.39181793],"study_design_scores_gemma":[0.000047247624,0.0003761345,0.8515092,0.0005126371,0.00020987421,0.0004080696,0.036682356,0.031169498,0.0075240354,0.033423655,0.038061276,0.000076010314],"about_ca_topic_score_codex":0.0047352747,"about_ca_topic_score_gemma":0.006033302,"teacher_disagreement_score":0.0074665076,"about_ca_system_score_codex":0.0018795622,"about_ca_system_score_gemma":0.0018765803,"threshold_uncertainty_score":0.025502324},"labels":[],"label_agreement":null},{"id":"W4229764280","doi":"10.1109/eurdac.1992.246233","title":"Efficient constrained encoding for VLSI sequential logic synthesis","year":2003,"lang":"en","type":"article","venue":"Proceedings EURO-DAC '92: European Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encoding (memory); Heuristic; Computer science; Asynchronous communication; Sequential logic; Variety (cybernetics); Algorithm; State (computer science); Theoretical computer science; Parallel computing; Arithmetic; Logic gate; Artificial intelligence; Mathematics","score_opus":0.05243470574356956,"score_gpt":0.24200893338452087,"score_spread":0.1895742276409513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229764280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030549405,0.00028377195,0.95938015,0.00017155528,0.00003181229,0.00009770023,0.00022350416,0.0012842508,0.007977864],"genre_scores_gemma":[0.3379218,0.0002299049,0.65663844,0.00013941606,0.000025413994,0.0002778742,0.0008012694,0.00023193457,0.0037339947],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948955,0.00017291347,0.000034717385,0.00006465669,0.00017467099,0.00006351118],"domain_scores_gemma":[0.9993962,0.0003422577,0.00005075978,0.00009925912,0.00009361902,0.000017872566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000468886,0.0005437106,0.00041610957,0.0007343727,0.00043540684,0.0007753134,0.0007822176,0.0003959311,0.006976691],"category_scores_gemma":[0.0017395217,0.00028363854,0.00035905142,0.0011210375,0.00044852972,0.0011867915,0.0008333661,0.0005974222,0.00074982934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041861832,0.00014124831,0.00048507162,0.0002924925,0.00002863906,0.00019380865,0.000117490374,0.29187748,0.026921041,0.13036062,0.008344969,0.5408185],"study_design_scores_gemma":[0.0000662742,0.00013254202,0.00013612259,0.000038246435,0.0000139797,0.000093813615,0.000036368117,0.922774,0.011765631,0.057531532,0.0073943385,0.00001721234],"about_ca_topic_score_codex":0.0016885543,"about_ca_topic_score_gemma":0.0038838177,"teacher_disagreement_score":0.006976691,"about_ca_system_score_codex":0.000830373,"about_ca_system_score_gemma":0.0012235508,"threshold_uncertainty_score":0.02333939},"labels":[],"label_agreement":null},{"id":"W4230336076","doi":"10.1109/date.2010.5457151","title":"A power optimization method for CMOS Op-Amps using sub-space based geometric programming","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geometric programming; Monomial; CMOS; Convex optimization; Mathematical optimization; Transistor; Space (punctuation); Computer science; Regular polygon; Constraint (computer-aided design); Power (physics); Voltage; Electronic engineering; Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Discrete mathematics","score_opus":0.014328292748706504,"score_gpt":0.2706430490692564,"score_spread":0.2563147563205499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230336076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014229852,0.00003259512,0.9976278,0.000030329278,0.000006415973,0.000008511829,0.000009717755,0.00006389775,0.00079774135],"genre_scores_gemma":[0.19059256,0.00032890416,0.8034757,0.00008399322,0.000036267254,0.00021196839,0.0001036547,0.00024811176,0.0049189636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998592,0.000042046748,0.0000065094055,0.000019380268,0.000059520735,0.000013302561],"domain_scores_gemma":[0.9998585,0.000071510236,0.000014585797,0.000014547483,0.00003473504,0.000006172871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034863965,0.0007468573,0.00063411583,0.0004004946,0.0002823483,0.00048737094,0.0008493468,0.0004395185,0.0024932732],"category_scores_gemma":[0.00056022196,0.00039853092,0.00080366957,0.00065661775,0.00044713638,0.0007139198,0.00054157834,0.0008800061,0.00054187805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001024181,0.000007802132,0.00008043901,0.000032544125,0.00001056816,0.000022988914,0.000025795884,0.93456244,0.002812244,0.020209083,0.0005234046,0.04170248],"study_design_scores_gemma":[0.0000018928064,0.000010563732,0.000013895527,0.0000016414934,0.0000021646358,0.000010401793,0.0000030180227,0.995492,0.00043332187,0.0031747478,0.00085440546,0.000001922009],"about_ca_topic_score_codex":0.0016673417,"about_ca_topic_score_gemma":0.0023545262,"teacher_disagreement_score":0.0024932732,"about_ca_system_score_codex":0.00056711055,"about_ca_system_score_gemma":0.0007304101,"threshold_uncertainty_score":0.008340776},"labels":[],"label_agreement":null},{"id":"W4230667489","doi":"10.1109/wsc.2007.4419650","title":"Optimizing time warp simulation with reinforcement learning techniques","year":2007,"lang":"en","type":"article","venue":"2007 Winter Simulation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Benchmark (surveying); Bellman equation; Dynamic programming; Function (biology); Bounded function; State (computer science); Optimal control; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.01691587200443344,"score_gpt":0.2577633236223327,"score_spread":0.24084745161789922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230667489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045328707,0.0001057522,0.9518477,0.00012891252,0.000017548584,0.00007328477,0.000014054325,0.0003553265,0.0021287785],"genre_scores_gemma":[0.8821888,0.000101740705,0.11616606,0.00004621573,0.000012067597,0.00020400809,0.000027009351,0.000055362325,0.0011988283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995989,0.00016274789,0.000021234799,0.000063569634,0.00010376919,0.000049748323],"domain_scores_gemma":[0.9978387,0.0016035233,0.00018669726,0.00012205851,0.00017790752,0.00007111508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257755,0.00075719156,0.0007842148,0.00037338515,0.00031697558,0.0005829859,0.0009426424,0.00074917974,0.0017399811],"category_scores_gemma":[0.0043282253,0.00041212948,0.00038959362,0.00028619627,0.0009534749,0.00083818025,0.0007582512,0.0011754351,0.00018549724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018798299,0.000013104343,0.0001115484,0.000007945337,0.000005254257,0.000009857643,0.000009427477,0.9943743,0.00041578748,0.0014089652,0.00003728334,0.0035876418],"study_design_scores_gemma":[0.0000056333247,0.000008393981,0.000008281966,9.393997e-7,0.00000122773,0.0000016303837,0.0000013341659,0.99902046,0.0002536377,0.0006523613,0.000045236186,8.882216e-7],"about_ca_topic_score_codex":0.003986011,"about_ca_topic_score_gemma":0.002768383,"teacher_disagreement_score":0.003986011,"about_ca_system_score_codex":0.00087428436,"about_ca_system_score_gemma":0.0011592208,"threshold_uncertainty_score":0.00792563},"labels":[],"label_agreement":null},{"id":"W4232625310","doi":"10.1145/503057.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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Retiming; Computer science; Field-programmable gate array; Gate array; Routing (electronic design automation); Parallel computing; Combinational logic; Algorithm; Electronic circuit; Logic gate; Embedded system; Engineering","score_opus":0.021977691626485916,"score_gpt":0.21168669329966935,"score_spread":0.18970900167318344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232625310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017884301,0.0011799227,0.9733854,0.00015749385,0.0001349122,0.000058883827,0.000044788463,0.002082697,0.0050716256],"genre_scores_gemma":[0.3844106,0.00085791823,0.60631734,0.0002715307,0.00008011284,0.0001028318,0.00017358719,0.00019913394,0.007586935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997167,0.00006346905,0.000012585744,0.000048440696,0.00013515062,0.000023594106],"domain_scores_gemma":[0.9996731,0.00009878474,0.000059026057,0.00007398896,0.000082511375,0.000012608922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030846536,0.00042548348,0.00019279137,0.00043714684,0.00037660627,0.00042797072,0.0005423408,0.00038965195,0.0027524605],"category_scores_gemma":[0.0011818188,0.00022810158,0.00026379206,0.00043339407,0.00025244534,0.00053717935,0.00025699762,0.000506291,0.00062619866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019524146,0.0000634268,0.0008757153,0.0002074958,0.00005773755,0.00024222005,0.00012847659,0.3005138,0.07099521,0.036581255,0.0056474875,0.5844919],"study_design_scores_gemma":[0.000070443624,0.0004954762,0.0009881112,0.000053155894,0.00005553519,0.00034957984,0.00004259538,0.89042825,0.051386923,0.021867158,0.03422193,0.000040761326],"about_ca_topic_score_codex":0.0033025322,"about_ca_topic_score_gemma":0.0073252744,"teacher_disagreement_score":0.0033025322,"about_ca_system_score_codex":0.0009369887,"about_ca_system_score_gemma":0.0007033931,"threshold_uncertainty_score":0.009207845},"labels":[],"label_agreement":null},{"id":"W4232809888","doi":"10.1007/978-0-387-30162-4_69","title":"Circuit Placement","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.015496608379691827,"score_gpt":0.20329742567141884,"score_spread":0.187800817291727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232809888","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341898,0.008035131,0.39031184,0.00059784297,0.001841133,0.0002657754,0.0011211428,0.008029275,0.5874559],"genre_scores_gemma":[0.039927013,0.01040801,0.32927433,0.0007242792,0.0006524453,0.00026051968,0.0036831042,0.0014250239,0.6136454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997863,0.000013759395,0.000008706641,0.000047017857,0.00012576165,0.000018506376],"domain_scores_gemma":[0.9998512,0.000019577132,0.000006677536,0.000052340376,0.000058357957,0.000011746776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012676242,0.0013270873,0.00060777983,0.0014090488,0.00056484697,0.0013090039,0.0014235881,0.00074933824,0.12582248],"category_scores_gemma":[0.00039585907,0.0005260236,0.00048183155,0.001779013,0.00030496082,0.0009599746,0.00087151764,0.0009043072,0.08421862],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039925173,0.000040755047,0.00007847638,0.00039839005,0.000017263917,0.00011460292,0.00003612192,0.005945728,0.010370676,0.036054257,0.14371039,0.8031934],"study_design_scores_gemma":[0.000026522055,0.00010257447,0.00023665308,0.0001587779,0.000026039623,0.0010221946,0.00003286999,0.013047519,0.013709838,0.045013756,0.9266003,0.000023003875],"about_ca_topic_score_codex":0.0005126289,"about_ca_topic_score_gemma":0.0017136476,"teacher_disagreement_score":0.12582248,"about_ca_system_score_codex":0.00046373982,"about_ca_system_score_gemma":0.00077298004,"threshold_uncertainty_score":0.42091817},"labels":[],"label_agreement":null},{"id":"W4234183293","doi":"10.1109/aspdac.2002.994967","title":"Probabilistic analysis of rectilinear Steiner trees","year":2003,"lang":"en","type":"article","venue":"Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Steiner tree problem; Probabilistic logic; Very-large-scale integration; Computer science; Set (abstract data type); Interconnection; Tree (set theory); Statistical model; Algorithm; Probabilistic analysis of algorithms; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Combinatorics; Programming language","score_opus":0.05023175393092778,"score_gpt":0.25355997425688653,"score_spread":0.20332822032595876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234183293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02782496,0.0006936135,0.96762276,0.0002444468,0.00002142125,0.00003896937,0.0002632464,0.00025688825,0.00303377],"genre_scores_gemma":[0.7424206,0.00275736,0.24676096,0.00022636166,0.00018327654,0.00028361045,0.0013328356,0.0004323617,0.0056026275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717677,0.00074961694,0.00013107326,0.00046123358,0.0012224498,0.00025882607],"domain_scores_gemma":[0.9881925,0.007606257,0.0015495269,0.0011432646,0.0013121138,0.0001963657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026498076,0.0007465279,0.0009412694,0.0022568947,0.0008789578,0.001603725,0.0013952067,0.0009249692,0.0040319343],"category_scores_gemma":[0.015314262,0.0010645529,0.0012246054,0.003196209,0.0013564457,0.0035326604,0.0014346015,0.0014067113,0.0007114924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094175266,0.000015144308,0.0017923623,0.00009876093,0.000055557954,0.00009191197,0.00009754705,0.8420398,0.003161628,0.12645078,0.0013651974,0.024737066],"study_design_scores_gemma":[0.000006615616,0.00002135547,0.0006056475,0.000011198887,0.000014181299,0.0000833738,0.000017583257,0.94539446,0.00078609044,0.051720418,0.0013209938,0.000018060622],"about_ca_topic_score_codex":0.0028140922,"about_ca_topic_score_gemma":0.0029969877,"teacher_disagreement_score":0.0040319343,"about_ca_system_score_codex":0.0016589905,"about_ca_system_score_gemma":0.0009989128,"threshold_uncertainty_score":0.014013708},"labels":[],"label_agreement":null},{"id":"W4234246562","doi":"10.1109/iccad.2005.1560189","title":"Mixed-size placement via line search","year":2005,"lang":"en","type":"article","venue":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scaling; Computer science; Simple (philosophy); Line (geometry); Sampling (signal processing); Algorithm; Line search; Function (biology); Mathematical optimization; Mathematics; Geometry","score_opus":0.07272725290455787,"score_gpt":0.2939019442810032,"score_spread":0.22117469137644533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234246562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009934902,0.00016608922,0.9795155,0.00009685006,0.000042342268,0.00008150827,0.000077810604,0.002728634,0.007356387],"genre_scores_gemma":[0.13750705,0.00011239034,0.8566655,0.00013681695,0.000027510965,0.00023863574,0.00017437148,0.00036218585,0.0047756196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995653,0.00008152783,0.000019612153,0.00006928065,0.00022379152,0.000040412975],"domain_scores_gemma":[0.9994319,0.00022301645,0.00008602831,0.00011612843,0.00011357893,0.000029365867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003315232,0.00085130066,0.00048089572,0.0011239005,0.00046607395,0.00066917,0.0013378947,0.00074948824,0.009916567],"category_scores_gemma":[0.0014822496,0.00037549427,0.00034176034,0.0008087222,0.00041796116,0.00087539305,0.0011358578,0.00065370183,0.0025687132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019490816,0.00018909208,0.0012321695,0.00032167116,0.00008274935,0.00021733812,0.00016821228,0.25751427,0.057535402,0.03567182,0.012208246,0.6346641],"study_design_scores_gemma":[0.000088781286,0.0002500732,0.0003182966,0.000028033257,0.000018264045,0.00019374702,0.000041061743,0.94926333,0.018719207,0.012966398,0.018085143,0.0000276078],"about_ca_topic_score_codex":0.0011785569,"about_ca_topic_score_gemma":0.0037971118,"teacher_disagreement_score":0.009916567,"about_ca_system_score_codex":0.00046160456,"about_ca_system_score_gemma":0.0006641988,"threshold_uncertainty_score":0.033174217},"labels":[],"label_agreement":null},{"id":"W4234875748","doi":"10.1109/dac.1992.227777","title":"TEMPT: technology mapping for the exploration of FPGA architectures with hard-wired connections","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Netlist; Field-programmable gate array; Computer science; Set (abstract data type); Parallel computing; Embedded system","score_opus":0.07288281590620302,"score_gpt":0.2520814451196865,"score_spread":0.17919862921348348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234875748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061727405,0.0004444675,0.9133152,0.00018136937,0.00005000746,0.0001927416,0.00042429144,0.009393718,0.014270861],"genre_scores_gemma":[0.20408362,0.00025497563,0.7874365,0.00007453321,0.00002042547,0.0003403839,0.00082117727,0.0007077647,0.006260648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.000045069675,0.000008796734,0.000023218849,0.000057897323,0.000024670297],"domain_scores_gemma":[0.99965096,0.00020233403,0.000029300572,0.000043156957,0.000055540866,0.000018736078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036691982,0.0009947366,0.00038500456,0.0008069944,0.00044119213,0.0007572006,0.0008066238,0.000467734,0.011446017],"category_scores_gemma":[0.001428911,0.00036805787,0.0008447724,0.00051462144,0.0003689229,0.0011826747,0.0008406326,0.0005455901,0.0015370182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000501561,0.00015284015,0.0051435106,0.00049982313,0.00010453981,0.00049804855,0.00034179125,0.38749382,0.022570627,0.04200195,0.020014979,0.5206765],"study_design_scores_gemma":[0.000071913935,0.000118643075,0.00041228015,0.00003743577,0.000021891825,0.00015368292,0.00007356122,0.96371377,0.007390916,0.01979311,0.008199642,0.000013097275],"about_ca_topic_score_codex":0.0013015653,"about_ca_topic_score_gemma":0.002446607,"teacher_disagreement_score":0.011446017,"about_ca_system_score_codex":0.00043893236,"about_ca_system_score_gemma":0.0007792788,"threshold_uncertainty_score":0.0382908},"labels":[],"label_agreement":null},{"id":"W4235520433","doi":"10.1109/aspdac.2004.1337565","title":"An approach for reducing dynamic power consumption in synchronous sequential digital designs","year":2004,"lang":"en","type":"article","venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Retiming; Dynamic voltage scaling; Computer science; Benchmark (surveying); Scaling; Sequential logic; Dynamic demand; Combinational logic; Power (physics); Digital electronics; Voltage; Parallel computing; Algorithm; Electronic circuit; Logic gate; Mathematics; Engineering","score_opus":0.030050040300585872,"score_gpt":0.25423693336913966,"score_spread":0.2241868930685538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235520433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048509404,0.0006379874,0.94639385,0.00019364958,0.00003704795,0.000051398718,0.000038707316,0.0012259836,0.0029119495],"genre_scores_gemma":[0.43675098,0.00053824676,0.55886865,0.00020064705,0.000054633536,0.00014552126,0.00010544105,0.00014991082,0.0031859258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997193,0.00005407985,0.00001949145,0.00005318286,0.000119471355,0.00003443437],"domain_scores_gemma":[0.9996872,0.00010467381,0.00005097387,0.00008988457,0.00005306858,0.000014232494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027705534,0.00068522256,0.0003276527,0.0005837017,0.0003720385,0.0003713757,0.0007806088,0.0003304979,0.0015312714],"category_scores_gemma":[0.00078645773,0.00027313197,0.00037085105,0.0007756415,0.0003031323,0.000799728,0.00043364207,0.0003938841,0.0003042473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023098507,0.0001522381,0.0007570084,0.00024279508,0.00005231209,0.00015786357,0.00016693762,0.19694561,0.16214329,0.021348078,0.0024447066,0.6153582],"study_design_scores_gemma":[0.00012419464,0.00085523096,0.0011180919,0.00003846398,0.00012301012,0.00046348193,0.00007556097,0.8450131,0.10153473,0.03165167,0.018974323,0.00002824167],"about_ca_topic_score_codex":0.0008767537,"about_ca_topic_score_gemma":0.0025787286,"teacher_disagreement_score":0.0015312714,"about_ca_system_score_codex":0.0004985316,"about_ca_system_score_gemma":0.00076207344,"threshold_uncertainty_score":0.005122602},"labels":[],"label_agreement":null},{"id":"W4236097829","doi":"10.1109/iccad.2006.320150","title":"Timing Model Reduction for Hierarchical Timing Analysis","year":2006,"lang":"en","type":"article","venue":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Static timing analysis; Reduction (mathematics); Computer science; Algorithm; Block (permutation group theory); Hierarchical database model; Star (game theory); Mathematics; Data mining","score_opus":0.061136294365063154,"score_gpt":0.29371543404476447,"score_spread":0.2325791396797013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236097829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00586427,0.000059914604,0.99247277,0.000031319963,0.000012501747,0.000030862342,0.0000493311,0.0007247566,0.0007542741],"genre_scores_gemma":[0.21508087,0.00017741881,0.78105366,0.00013953533,0.00002935052,0.00013668375,0.00064400455,0.00041513494,0.0023232969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998743,0.0002574545,0.00007548719,0.00018758565,0.0005950662,0.00014140763],"domain_scores_gemma":[0.9987697,0.000399929,0.000115711984,0.00038230192,0.00030325752,0.000029036757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729922,0.0009008492,0.0005731808,0.0011153495,0.00051045103,0.0006548467,0.00112171,0.00035113367,0.0026321046],"category_scores_gemma":[0.002300896,0.00045687714,0.0014712806,0.00073244824,0.0004386155,0.0012964766,0.0009341919,0.0013868925,0.0006522366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024551974,0.00011168654,0.0016427907,0.00025979342,0.00012074143,0.00017939282,0.00022034445,0.48718503,0.055263575,0.09839408,0.0042082528,0.35216883],"study_design_scores_gemma":[0.000019102223,0.000065116896,0.00022032713,0.000015798903,0.000041765845,0.00007612958,0.000028375256,0.9377434,0.01896147,0.03706553,0.0057443655,0.000018583196],"about_ca_topic_score_codex":0.0038761124,"about_ca_topic_score_gemma":0.006678519,"teacher_disagreement_score":0.0038761124,"about_ca_system_score_codex":0.0009859904,"about_ca_system_score_gemma":0.0017436194,"threshold_uncertainty_score":0.008805275},"labels":[],"label_agreement":null},{"id":"W4236875804","doi":"10.1109/iccad.1996.571342","title":"Directional bias and non-uniformity in FPGA global routing architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Placement; Computer science; Channel (broadcasting); Key (lock); Field-programmable gate array; Horizontal and vertical; Chip; Topology (electrical circuits); Electronic engineering; Parallel computing; Computer architecture; Electrical engineering; Computer network; Computer hardware; Telecommunications; Embedded system; Engineering; Physical design; Mathematics; Geometry; Circuit design","score_opus":0.01766529659440104,"score_gpt":0.21374269259747017,"score_spread":0.19607739600306912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236875804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.945659,0.000472641,0.050573744,0.00006385553,0.000008629241,0.000008917361,0.000019955349,0.000078251614,0.0031150337],"genre_scores_gemma":[0.9892972,0.00018557336,0.009912756,0.000014995881,0.000005996577,0.0000073992283,0.00001556673,0.000020852049,0.0005396341],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997923,0.00006208151,0.000012363735,0.00003959105,0.00005280566,0.00004088947],"domain_scores_gemma":[0.9988832,0.0005822611,0.0002137502,0.00017646968,0.000117321084,0.000027014283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034940196,0.00023196824,0.00016020877,0.00019066459,0.00014902322,0.00039129297,0.00023603362,0.00014537644,0.001013362],"category_scores_gemma":[0.0020241567,0.00015295447,0.00008301168,0.0002680452,0.00027835454,0.00080556533,0.00026108004,0.00016085258,0.00014253429],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010909836,0.00010440607,0.018446757,0.00024377425,0.00007640268,0.0004169444,0.00025762603,0.34936932,0.42664889,0.040034592,0.0005662513,0.16274416],"study_design_scores_gemma":[0.0001407854,0.0022461994,0.028318424,0.000054469154,0.00019700434,0.001288121,0.00028912094,0.5206697,0.4152887,0.023608372,0.007831312,0.00006791855],"about_ca_topic_score_codex":0.00035512887,"about_ca_topic_score_gemma":0.0009408071,"teacher_disagreement_score":0.001013362,"about_ca_system_score_codex":0.0002809059,"about_ca_system_score_gemma":0.00013945391,"threshold_uncertainty_score":0.0033900738},"labels":[],"label_agreement":null},{"id":"W4237150254","doi":"10.1109/vlsi-soc.2012.7332115","title":"FPGA power reduction by guarded evaluation considering physical information","year":2012,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Netlist; Field-programmable gate array; Computer science; Routing (electronic design automation); Reduction (mathematics); Dynamic demand; Power consumption; Resource consumption; Design flow; Embedded system; Power analysis; Power (physics); Flow (mathematics); Cryptography; Algorithm; Mathematics","score_opus":0.012898149793095556,"score_gpt":0.24323604929108653,"score_spread":0.23033789949799097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237150254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34537554,0.0015985387,0.6411473,0.00031421517,0.00010721395,0.00009506415,0.000104476974,0.0031644804,0.008093186],"genre_scores_gemma":[0.872441,0.00023388866,0.12568289,0.00008587388,0.000022001383,0.000016340295,0.000050996776,0.00012374674,0.0013433382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00010463444,0.000027922202,0.00005344699,0.00018500941,0.00008329449],"domain_scores_gemma":[0.99882835,0.0005219061,0.00015179689,0.00027309608,0.0001961264,0.000028662627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842722,0.00074657553,0.0003799095,0.00054266036,0.00021427967,0.0010609359,0.0010034838,0.00034585095,0.002469735],"category_scores_gemma":[0.0020775304,0.00019853411,0.00033807836,0.0003915023,0.00052081206,0.0015995922,0.00037251782,0.000472026,0.00023541374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016312256,0.00021437467,0.0040958486,0.00032009397,0.0000810992,0.00063522346,0.00013266134,0.40738434,0.23131284,0.018164061,0.0017804423,0.3342478],"study_design_scores_gemma":[0.000088942914,0.0009220743,0.0011029697,0.000036246096,0.00012097262,0.0003330258,0.000029499472,0.8074686,0.18109901,0.005382697,0.003378788,0.000037073987],"about_ca_topic_score_codex":0.0015639076,"about_ca_topic_score_gemma":0.0022251755,"teacher_disagreement_score":0.002469735,"about_ca_system_score_codex":0.00067509606,"about_ca_system_score_gemma":0.0009471938,"threshold_uncertainty_score":0.008262157},"labels":[],"label_agreement":null},{"id":"W4238119721","doi":"10.32920/ryerson.14648718.v1","title":"Minimizing the layout area of 2-input look up tables","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Routing (electronic design automation); Block (permutation group theory); Computer science; Router; Field-programmable gate array; Integrated circuit layout; Benchmark (surveying); Place and route; Computer hardware; Multiplexing; Embedded system; Computer network; Integrated circuit; Telecommunications; Mathematics","score_opus":0.02525693990355,"score_gpt":0.2258160281992281,"score_spread":0.20055908829567812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238119721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40556806,0.0016594388,0.57196,0.00047111462,0.00008927145,0.00012351859,0.00039550493,0.0021099523,0.01762312],"genre_scores_gemma":[0.6748697,0.0005594494,0.3192279,0.000102039674,0.000027480452,0.00010902022,0.00028398537,0.00050520455,0.0043152086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.00020236516,0.000030677886,0.000091263595,0.00016295534,0.00008360782],"domain_scores_gemma":[0.9979929,0.0012797693,0.00023073323,0.00027119095,0.00019311164,0.00003237691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043126362,0.00077788474,0.0004705924,0.00046735632,0.0003244176,0.0009891536,0.0008554257,0.00042124887,0.0035312574],"category_scores_gemma":[0.003098134,0.00043334658,0.00036048432,0.00053190446,0.00033281362,0.0012147728,0.0004811287,0.0004185712,0.00070679275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005011881,0.000106072126,0.0037552419,0.00076656585,0.00008774488,0.0005092807,0.00035743637,0.5478596,0.17316858,0.023625715,0.004678042,0.24458453],"study_design_scores_gemma":[0.000098641096,0.0008075312,0.0037956124,0.000080378326,0.00013899498,0.0008744744,0.00024713448,0.83835226,0.12321871,0.01557337,0.016762659,0.000050214923],"about_ca_topic_score_codex":0.0006958204,"about_ca_topic_score_gemma":0.0020120628,"teacher_disagreement_score":0.0035312574,"about_ca_system_score_codex":0.0005896973,"about_ca_system_score_gemma":0.000818502,"threshold_uncertainty_score":0.011813223},"labels":[],"label_agreement":null},{"id":"W4238593108","doi":"10.1109/iccad.2002.1167616","title":"Incremental placement for layout-driven optimizations on FPGAs","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Netlist; Computer science; Logic optimization; Logic synthesis; Place and route; Restructuring; Field-programmable gate array; Logic block; Placement; Logic gate; Logic family; Parallel computing; Computer architecture; Programmable logic device; Computer engineering; Algorithm; Physical design; Embedded system; Circuit design","score_opus":0.07900521087211489,"score_gpt":0.291412927817465,"score_spread":0.2124077169453501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238593108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03714437,0.0004406174,0.953089,0.00009506605,0.000058710368,0.000081866834,0.00007523492,0.0038443434,0.0051708976],"genre_scores_gemma":[0.3624257,0.0003328247,0.633041,0.00008158477,0.000042862128,0.000104357954,0.00029893295,0.00035100468,0.0033216977],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998048,0.000038571383,0.000009596499,0.000027725311,0.000087502915,0.000031749718],"domain_scores_gemma":[0.99980825,0.000076058626,0.000023165136,0.000048947328,0.000035946745,0.000007611969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830806,0.0006027185,0.00032054022,0.00059177517,0.0003200925,0.00039874887,0.00075181096,0.00027097008,0.0032481316],"category_scores_gemma":[0.0007075226,0.00029715704,0.00028906798,0.0004690887,0.0002620034,0.000575526,0.00051085895,0.00039473534,0.0006250413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002864656,0.000060210252,0.0009514566,0.00017064315,0.000038446313,0.0002478634,0.00010540094,0.35509524,0.052695356,0.019038888,0.0053756866,0.5659344],"study_design_scores_gemma":[0.000077244,0.0002026461,0.0006261817,0.000025339787,0.000042057116,0.000242796,0.000055330296,0.93083304,0.03396537,0.01771661,0.016191479,0.000021959204],"about_ca_topic_score_codex":0.0018345698,"about_ca_topic_score_gemma":0.0045047947,"teacher_disagreement_score":0.0032481316,"about_ca_system_score_codex":0.00044731417,"about_ca_system_score_gemma":0.000451067,"threshold_uncertainty_score":0.010866046},"labels":[],"label_agreement":null},{"id":"W4239075140","doi":"10.21203/rs.3.rs-359089/v1","title":"A New Multi-level Algorithms for Balanced Partition Problem on Large Scale Directed Graphs","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Aerodynamics Research and Development Center; National Natural Science Foundation of China","keywords":"Partition (number theory); Computer science; Scale (ratio); Algorithm; Mathematics; Combinatorics; Physics","score_opus":0.10681327905304573,"score_gpt":0.3800277494543114,"score_spread":0.2732144704012657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239075140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017626151,0.0001700577,0.9802628,0.0001305911,0.000019699073,0.000047386624,0.00003415993,0.00033562456,0.0013736159],"genre_scores_gemma":[0.3166514,0.00016076636,0.68025523,0.00010834304,0.000037146157,0.000177652,0.00022741959,0.00017583698,0.0022062305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.00014257479,0.00003166977,0.00012950756,0.00017293524,0.00009189261],"domain_scores_gemma":[0.99926406,0.00028887592,0.000099441546,0.00010971909,0.00015625058,0.00008152495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683026,0.0008102973,0.0009461503,0.0012308301,0.000702134,0.0013304587,0.0016878438,0.0010109749,0.0029280374],"category_scores_gemma":[0.0018058617,0.00046723674,0.0006176688,0.0010764042,0.0005840514,0.0021258045,0.001754555,0.0010136453,0.00042228602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021961794,0.00016236557,0.0012675547,0.000185006,0.00006037237,0.00006779689,0.00019302343,0.68150073,0.013721196,0.060925968,0.0043777437,0.23731872],"study_design_scores_gemma":[0.000024658892,0.000036477624,0.00007943191,0.000005786209,0.00000504607,0.000019965342,0.000020448808,0.9894461,0.0014560359,0.0080521135,0.000849329,0.000004591306],"about_ca_topic_score_codex":0.0020507104,"about_ca_topic_score_gemma":0.0026650892,"teacher_disagreement_score":0.0029280374,"about_ca_system_score_codex":0.0012899793,"about_ca_system_score_gemma":0.00088347844,"threshold_uncertainty_score":0.009795308},"labels":[],"label_agreement":null},{"id":"W4240011581","doi":"10.1109/aspdac.2010.5419877","title":"Symmetry-aware TCG-based placement design under complex multi-group constraints for analog circuit layouts","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive closure; Computer science; Representation (politics); Graph; Integrated circuit layout; Time complexity; Algorithm; Symmetry (geometry); Set (abstract data type); Topology (electrical circuits); Computational complexity theory; Theoretical computer science; Mathematics; Discrete mathematics; Integrated circuit; Combinatorics; Geometry","score_opus":0.07553143801172356,"score_gpt":0.2747646273056059,"score_spread":0.19923318929388234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240011581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021783771,0.000042829834,0.9757658,0.00004913697,0.000018610668,0.00005073036,0.000021795582,0.0003806784,0.0018866761],"genre_scores_gemma":[0.42172775,0.00009584788,0.5768102,0.000057189023,0.000024529088,0.000101296864,0.00009930871,0.00009868071,0.0009852452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956816,0.00012147589,0.000028528519,0.000052967207,0.00019310479,0.00003572393],"domain_scores_gemma":[0.99942136,0.00019704492,0.00010839844,0.000158549,0.00009253727,0.00002206829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036218084,0.0005535281,0.00045535018,0.0005631268,0.00042320503,0.00053395866,0.0008463657,0.00035204052,0.0021179374],"category_scores_gemma":[0.0012469058,0.00023468854,0.00036783423,0.00057063677,0.0005366031,0.00092308916,0.0005460279,0.00044782078,0.00039324554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002623775,0.00010146156,0.0007529855,0.00023917873,0.000043073484,0.00040318095,0.00026561317,0.46624437,0.109369665,0.0646891,0.0028859822,0.35474303],"study_design_scores_gemma":[0.00005590686,0.00015849713,0.00018266201,0.000010637692,0.000015262733,0.00020818762,0.00004213187,0.9494901,0.03190224,0.0145275835,0.0033926454,0.000014106072],"about_ca_topic_score_codex":0.0009327445,"about_ca_topic_score_gemma":0.00158699,"teacher_disagreement_score":0.0021179374,"about_ca_system_score_codex":0.00046729352,"about_ca_system_score_gemma":0.00075455883,"threshold_uncertainty_score":0.007085204},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; 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","score_opus":0.06249537015885398,"score_gpt":0.28237616494298573,"score_spread":0.21988079478413175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241249008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857738,0.001194087,0.8974617,0.0003588987,0.000061731116,0.000085861015,0.000032903987,0.0014183812,0.010809019],"genre_scores_gemma":[0.5168613,0.0012308946,0.475296,0.00023416385,0.000046761274,0.0000816556,0.00009084408,0.00029902408,0.0058593503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.00024000483,0.000036311936,0.000087402535,0.0003647299,0.000053404103],"domain_scores_gemma":[0.99670035,0.0025416957,0.00016635172,0.00024310284,0.0003191263,0.000029314699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011205785,0.00068339135,0.00045553167,0.0007717127,0.00029081528,0.0014872638,0.0007505943,0.0005670946,0.0021301252],"category_scores_gemma":[0.006280598,0.00047663378,0.00033856655,0.00062750553,0.0003517007,0.0013915217,0.0004563657,0.00049724214,0.00041665093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020560605,0.000119765056,0.002536708,0.00010351613,0.000061595,0.00009585188,0.0000793172,0.53402305,0.015508985,0.014608542,0.0009740002,0.431683],"study_design_scores_gemma":[0.000023095216,0.00009924905,0.00064506603,0.000013924114,0.000023915394,0.000074350835,0.000019644633,0.9855112,0.006873457,0.0043003866,0.0024048735,0.0000108964305],"about_ca_topic_score_codex":0.00238821,"about_ca_topic_score_gemma":0.0062608593,"teacher_disagreement_score":0.00238821,"about_ca_system_score_codex":0.0006355809,"about_ca_system_score_gemma":0.0005214747,"threshold_uncertainty_score":0.0071259737},"labels":[],"label_agreement":null},{"id":"W4241903622","doi":"10.1109/aspdac.2008.4483939","title":"Large-scale fixed-outline floorplanning design using convex optimization techniques","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Floorplan; Mathematical optimization; Computer science; Voronoi diagram; Minification; Convex optimization; Regular polygon; Graph; Mathematics; Theoretical computer science","score_opus":0.0293150775017935,"score_gpt":0.23663767064324662,"score_spread":0.20732259314145313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241903622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027054371,0.000038906903,0.99599886,0.000017908691,0.000003980849,0.00002999127,0.00002068341,0.00032696928,0.0008573297],"genre_scores_gemma":[0.121239506,0.00012025817,0.8766852,0.000026059666,0.0000081064445,0.0001911984,0.00015086732,0.00016372137,0.0014150761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959797,0.000105829975,0.000015775682,0.000060193117,0.0001700446,0.000050284027],"domain_scores_gemma":[0.9996244,0.00018418966,0.000049515573,0.00004682683,0.00007663244,0.000018390347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005599809,0.0010131008,0.0007533736,0.000530728,0.00033239537,0.00053921074,0.0010802586,0.0003789183,0.0022264747],"category_scores_gemma":[0.00085600914,0.00045167175,0.00066919834,0.0006586061,0.00044402533,0.00054260396,0.00065479433,0.000757167,0.00044080077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133729845,0.000014515061,0.00011757476,0.000041472424,0.000011147471,0.000040825405,0.000024505114,0.94086105,0.004451901,0.0055267545,0.0007868848,0.04810999],"study_design_scores_gemma":[0.0000061797446,0.000030723742,0.00006154111,0.0000037031132,0.000004006629,0.000027207065,0.000008100208,0.9940692,0.00214058,0.0026932145,0.00095073035,0.000004800006],"about_ca_topic_score_codex":0.0027160523,"about_ca_topic_score_gemma":0.0046114824,"teacher_disagreement_score":0.0027160523,"about_ca_system_score_codex":0.0005270163,"about_ca_system_score_gemma":0.0014239846,"threshold_uncertainty_score":0.0074483156},"labels":[],"label_agreement":null},{"id":"W4242232961","doi":"10.1109/date.2010.5457088","title":"Leveraging dominators for preprocessing QBF","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preprocessor; Conjunctive normal form; Computer science; Very-large-scale integration; Algorithm; True quantified Boolean formula; Time complexity; Computational complexity theory; Process (computing); Theoretical computer science; Computation; Artificial intelligence; Programming language","score_opus":0.007577734978648513,"score_gpt":0.22073527213707117,"score_spread":0.21315753715842264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242232961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014127269,0.00014091833,0.9787145,0.0002923083,0.000026616026,0.00017676128,0.0001625782,0.0023605446,0.003998497],"genre_scores_gemma":[0.1645192,0.00028092705,0.83007133,0.0002706167,0.00004875494,0.00024568595,0.0008660753,0.00067473983,0.0030226677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983991,0.00046850054,0.000112262846,0.0003411723,0.0004376747,0.0002413377],"domain_scores_gemma":[0.9942835,0.0037533129,0.00030144077,0.00093352405,0.00065911526,0.00006905575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015181011,0.0012756129,0.0008521865,0.0011557686,0.0010096807,0.0014607628,0.0017349361,0.000994439,0.010406232],"category_scores_gemma":[0.008333732,0.0007274772,0.0015992464,0.0013466931,0.0011224673,0.0031038797,0.0018067954,0.00224965,0.0018954013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004648381,0.000314599,0.001346484,0.00096590345,0.000093721166,0.0005146717,0.00049778854,0.1865666,0.07178198,0.12582508,0.012152445,0.59947586],"study_design_scores_gemma":[0.00019401978,0.0003311773,0.0005861003,0.00011697236,0.00007875443,0.00042836936,0.00018158306,0.70164126,0.08960847,0.1764203,0.030343935,0.000069031994],"about_ca_topic_score_codex":0.0032450317,"about_ca_topic_score_gemma":0.005520428,"teacher_disagreement_score":0.010406232,"about_ca_system_score_codex":0.0012370563,"about_ca_system_score_gemma":0.0024243998,"threshold_uncertainty_score":0.03481227},"labels":[],"label_agreement":null},{"id":"W4242254166","doi":"10.1145/611839.611842","title":"Automatic transistor and physical design of FPGA tiles from an architectural specification","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Place and route; Netlist; Schematic; Design layout record; Router; Embedded system; Lookup table; Computer hardware; Process (computing); Integrated circuit layout; Computer architecture; Integrated circuit; Engineering; Electrical engineering; Circuit extraction; Operating system; Voltage","score_opus":0.01827725736220543,"score_gpt":0.2206740602273176,"score_spread":0.20239680286511216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242254166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05139111,0.00014656762,0.92766786,0.00008180793,0.00006094885,0.00015044787,0.00054480997,0.008936711,0.011019741],"genre_scores_gemma":[0.3371393,0.00019580254,0.65329456,0.00012691635,0.0000296606,0.00027730176,0.0015696228,0.0015861996,0.005780554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997297,0.000051034993,0.000021566033,0.00003892652,0.00013068884,0.000028045153],"domain_scores_gemma":[0.99965775,0.00013513505,0.00003546073,0.00007838265,0.0000827667,0.000010387624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302043,0.0005287724,0.0003203407,0.0005462075,0.0002167986,0.0007141743,0.00058534264,0.00024122682,0.0050526485],"category_scores_gemma":[0.000882706,0.0003482203,0.00048590094,0.00027791594,0.00032837258,0.00041991938,0.0003677806,0.00038408092,0.0012295493],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002574654,0.000067319845,0.0034329258,0.00079910265,0.000087979584,0.00094765105,0.00043769865,0.33093315,0.30576313,0.04978999,0.01438448,0.29309902],"study_design_scores_gemma":[0.00012558815,0.00038466384,0.0026450988,0.00008011049,0.00005932602,0.00072161976,0.00016927235,0.6823359,0.23219897,0.014934395,0.06629101,0.00005399821],"about_ca_topic_score_codex":0.00052054384,"about_ca_topic_score_gemma":0.001080815,"teacher_disagreement_score":0.0050526485,"about_ca_system_score_codex":0.00042987592,"about_ca_system_score_gemma":0.0006506835,"threshold_uncertainty_score":0.016902804},"labels":[],"label_agreement":null},{"id":"W4243927247","doi":"10.1109/edac.1990.136631","title":"Transistor placement and interconnect algorithms for leaf cell synthesis","year":2002,"lang":"en","type":"article","venue":"Proceedings of the European Design Automation Conference, 1990., EDAC.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); Carleton University","funders":"","keywords":"Routing (electronic design automation); Chaining; Transistor; Computer science; Algorithm; Interconnection; Placement; Set (abstract data type); Metric (unit); Routing table; Parallel computing; Physical design; Engineering; Embedded system; Electrical engineering; Circuit design; Computer network; Routing protocol; Voltage","score_opus":0.038765431086630074,"score_gpt":0.20607168351157593,"score_spread":0.16730625242494584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243927247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032644812,0.0001425431,0.99251735,0.000039724335,0.000017800248,0.000028742108,0.000061512765,0.0010039285,0.0029239426],"genre_scores_gemma":[0.053178027,0.00023988103,0.9415089,0.000053337528,0.000019458575,0.000110258734,0.0003939528,0.00030118137,0.0041949837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979454,0.000039068287,0.000015714197,0.000046194476,0.000082555,0.000021884915],"domain_scores_gemma":[0.99972755,0.00009431474,0.000023670835,0.00005607459,0.00008652761,0.000011814064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025940174,0.00061669346,0.00038116617,0.00071565417,0.00046731377,0.00081051054,0.00082683377,0.00044145444,0.005968346],"category_scores_gemma":[0.00083101174,0.00027063934,0.0004405874,0.0009121195,0.0003640139,0.0008341852,0.00056548667,0.00079097017,0.0023371808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001150228,0.000050570543,0.00047056912,0.00021434236,0.000023481292,0.0001176746,0.00016316868,0.23113383,0.033996843,0.10632706,0.009787549,0.6175999],"study_design_scores_gemma":[0.000060659408,0.00010924901,0.00023986914,0.000036460868,0.000021370699,0.00018742734,0.000047829515,0.88025165,0.025467157,0.05781789,0.03573599,0.000024505414],"about_ca_topic_score_codex":0.0020498908,"about_ca_topic_score_gemma":0.0032991513,"teacher_disagreement_score":0.005968346,"about_ca_system_score_codex":0.00081880466,"about_ca_system_score_gemma":0.0006621214,"threshold_uncertainty_score":0.019966066},"labels":[],"label_agreement":null},{"id":"W4244552270","doi":"10.1109/socc52499.2021.9739496","title":"Dynamic Power Analysis of Standard-Cell FPGA Fabrics","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stratix; Field-programmable gate array; Software portability; Computer science; Embedded system; Application-specific integrated circuit; Power analysis; Standard cell; Dynamic demand; Power (physics); Reconfigurable computing; Computer hardware; Integrated circuit; Operating system; Algorithm","score_opus":0.004115572483494668,"score_gpt":0.20778413610152527,"score_spread":0.2036685636180306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244552270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97944504,0.00024957865,0.014120479,0.000041248655,0.000013587116,0.000020517946,0.0003579327,0.00033042618,0.0054210853],"genre_scores_gemma":[0.9961022,0.00007408871,0.0026052403,0.000011842271,0.0000022567533,0.000012137934,0.000147342,0.000033292705,0.0010115771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982905,0.000018558652,0.000009183099,0.00003235893,0.00006745891,0.00004335392],"domain_scores_gemma":[0.9997199,0.00012586416,0.00004454238,0.000043377317,0.000057802423,0.000008414081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012594156,0.00036792998,0.00016746693,0.00037178505,0.00010462117,0.0002918374,0.000436757,0.00017666545,0.0025535743],"category_scores_gemma":[0.00047342066,0.00009511105,0.00019150742,0.00036011616,0.00016327076,0.0004287785,0.00012997071,0.0001608713,0.00021831034],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008181025,0.000199828,0.012723701,0.00043906667,0.00012260092,0.001037373,0.00013993362,0.6056796,0.3026624,0.004416248,0.0015455434,0.07021564],"study_design_scores_gemma":[0.00003877366,0.00086932734,0.01204875,0.000021931199,0.00006547197,0.00033943274,0.00010127662,0.7370373,0.2450221,0.000948804,0.0034856796,0.000021102576],"about_ca_topic_score_codex":0.0011157905,"about_ca_topic_score_gemma":0.0015712745,"teacher_disagreement_score":0.0025535743,"about_ca_system_score_codex":0.0005464257,"about_ca_system_score_gemma":0.00020153499,"threshold_uncertainty_score":0.008542597},"labels":[],"label_agreement":null},{"id":"W4244639180","doi":"10.1145/611823.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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Netlist; Simulated annealing; Field-programmable gate array; Computer science; Placement; Lookup table; Exploit; Routing (electronic design automation); Parallel computing; Reconfigurable computing; Computer hardware; Embedded system; Physical design; Algorithm; Circuit design","score_opus":0.012069945974130214,"score_gpt":0.22692480863411527,"score_spread":0.21485486265998505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244639180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024520854,0.00025491236,0.9664715,0.00019833256,0.000074027186,0.00007120986,0.00002591862,0.003322762,0.0050605563],"genre_scores_gemma":[0.25286967,0.00018227349,0.74364614,0.000066651985,0.00002495667,0.00021936596,0.000049634447,0.00028397408,0.0026573688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996939,0.00013735659,0.0000103690945,0.00002418862,0.000113165566,0.000021037935],"domain_scores_gemma":[0.99947137,0.00030142037,0.00004214101,0.00008355227,0.00008709473,0.00001444755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055510097,0.00051518664,0.00034311073,0.00035042036,0.00028960838,0.00038319826,0.000541867,0.0006335739,0.0031414814],"category_scores_gemma":[0.0015428029,0.00039300867,0.00035098442,0.000460661,0.00037796694,0.00028121244,0.00041723665,0.0007038021,0.00052916084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012535023,0.00003266652,0.00042338838,0.00012281312,0.000042039796,0.00008169618,0.00011337416,0.84983176,0.025472602,0.016972441,0.0016203165,0.10516151],"study_design_scores_gemma":[0.000018695588,0.00003921921,0.00008837738,0.000005162916,0.0000062904837,0.000019810437,0.0000065043173,0.98918355,0.00552341,0.0021285089,0.0029756837,0.0000047835942],"about_ca_topic_score_codex":0.0015360613,"about_ca_topic_score_gemma":0.002555426,"teacher_disagreement_score":0.0031414814,"about_ca_system_score_codex":0.0004941737,"about_ca_system_score_gemma":0.00064448727,"threshold_uncertainty_score":0.010509312},"labels":[],"label_agreement":null},{"id":"W4246056576","doi":"10.1109/aspdac.2004.1337686","title":"Interconnect capacitance estimation for FPGAs","year":2005,"lang":"en","type":"article","venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Capacitance; Field-programmable gate array; Routing (electronic design automation); Noise (video); Computer science; Dynamic demand; Electronic engineering; CMOS; Bounding overwatch; Interconnection; Power (physics); Embedded system; Engineering; Artificial intelligence; Telecommunications","score_opus":0.025833801124650255,"score_gpt":0.23631121189645632,"score_spread":0.21047741077180607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246056576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06759961,0.0007099584,0.9288202,0.00018165272,0.000018146562,0.000017846613,0.00016945934,0.0010092375,0.0014738799],"genre_scores_gemma":[0.8799768,0.00079274445,0.11639251,0.000053051896,0.00003886093,0.000032187578,0.00041576254,0.000119467215,0.0021786673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949884,0.00011058399,0.000022201391,0.00011536338,0.00022118623,0.000031905645],"domain_scores_gemma":[0.99909043,0.00038296997,0.0001587773,0.00017344068,0.00017506191,0.000019317298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031460798,0.00040416775,0.0003263919,0.0007455741,0.00022098445,0.00056514825,0.00041561836,0.0003746086,0.0007936376],"category_scores_gemma":[0.003283047,0.00032919727,0.00022485352,0.00077688025,0.00022868931,0.00079879083,0.0002948579,0.00042593738,0.00024785334],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006032896,0.000015805434,0.002585688,0.00007112822,0.00003311636,0.000119541146,0.00002965105,0.8426709,0.02365368,0.0039372,0.0010700102,0.12575294],"study_design_scores_gemma":[0.0000024557378,0.000019875237,0.0008087448,0.0000058084506,0.0000036507674,0.000078633275,0.000004483024,0.9918675,0.0047922693,0.0015234761,0.0008873129,0.000005834844],"about_ca_topic_score_codex":0.0043466105,"about_ca_topic_score_gemma":0.0039298446,"teacher_disagreement_score":0.0043466105,"about_ca_system_score_codex":0.000856167,"about_ca_system_score_gemma":0.0006590058,"threshold_uncertainty_score":0.008642614},"labels":[],"label_agreement":null},{"id":"W4246691826","doi":"10.32920/ryerson.14648718","title":"Minimizing the layout area of 2-input look up tables","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Routing (electronic design automation); Block (permutation group theory); Computer science; Router; Field-programmable gate array; Integrated circuit layout; Benchmark (surveying); Computer hardware; Multiplexing; Embedded system; Computer network; Integrated circuit; Telecommunications; Mathematics","score_opus":0.02525693990355,"score_gpt":0.2258160281992281,"score_spread":0.20055908829567812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246691826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40556806,0.0016594388,0.57196,0.00047111462,0.00008927145,0.00012351859,0.00039550493,0.0021099523,0.01762312],"genre_scores_gemma":[0.6748697,0.0005594494,0.3192279,0.000102039674,0.000027480452,0.00010902022,0.00028398537,0.00050520455,0.0043152086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.00020236516,0.000030677886,0.000091263595,0.00016295534,0.00008360782],"domain_scores_gemma":[0.9979929,0.0012797693,0.00023073323,0.00027119095,0.00019311164,0.00003237691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043126362,0.00077788474,0.0004705924,0.00046735632,0.0003244176,0.0009891536,0.0008554257,0.00042124887,0.0035312574],"category_scores_gemma":[0.003098134,0.00043334658,0.00036048432,0.00053190446,0.00033281362,0.0012147728,0.0004811287,0.0004185712,0.00070679275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005011881,0.000106072126,0.0037552419,0.00076656585,0.00008774488,0.0005092807,0.00035743637,0.5478596,0.17316858,0.023625715,0.004678042,0.24458453],"study_design_scores_gemma":[0.000098641096,0.0008075312,0.0037956124,0.000080378326,0.00013899498,0.0008744744,0.00024713448,0.83835226,0.12321871,0.01557337,0.016762659,0.000050214923],"about_ca_topic_score_codex":0.0006958204,"about_ca_topic_score_gemma":0.0020120628,"teacher_disagreement_score":0.0035312574,"about_ca_system_score_codex":0.0005896973,"about_ca_system_score_gemma":0.000818502,"threshold_uncertainty_score":0.011813223},"labels":[],"label_agreement":null},{"id":"W4246796329","doi":"10.1109/dac.1990.114892","title":"System simulation of printed circuit boards including packages and connectors","year":2002,"lang":"en","type":"article","venue":"27th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantic EMC (Canada)","funders":"","keywords":"Printed circuit board; Computer science; Integrated circuit packaging; Circuit extraction; Electronic packaging; Engineering drawing; Electrical engineering; Electronic engineering; Engineering; Integrated circuit; Equivalent circuit; Operating system; Voltage","score_opus":0.10636625896206409,"score_gpt":0.2685288992032618,"score_spread":0.1621626402411977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246796329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054997638,0.00014060621,0.9334044,0.000062072424,0.00006181486,0.000071038296,0.00018807476,0.0021732133,0.0089012],"genre_scores_gemma":[0.8517372,0.0002308182,0.13942517,0.000047151916,0.000030788386,0.00026196596,0.00034495053,0.00020881146,0.0077131637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977046,0.000071085036,0.0000125815,0.000024176128,0.00009415217,0.000027452103],"domain_scores_gemma":[0.9996086,0.00021203505,0.00002643974,0.000048359896,0.00008294445,0.000021641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028286994,0.0006012932,0.00055359746,0.00030318348,0.0002496542,0.00063072,0.0007849008,0.0006771016,0.004876456],"category_scores_gemma":[0.0008938671,0.00030130355,0.00040550556,0.0003737646,0.00028409917,0.0006663733,0.00032164712,0.00047076092,0.00057753385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032666023,0.000021232889,0.0002675707,0.000051887077,0.000020878399,0.00006439223,0.000037128302,0.98231596,0.0048585767,0.003410941,0.0003240033,0.008594753],"study_design_scores_gemma":[0.000008789306,0.00002269767,0.00005692768,0.0000026083571,0.0000043276073,0.000012947763,0.0000035757673,0.9969079,0.0018296418,0.0004537546,0.0006944574,0.0000024013734],"about_ca_topic_score_codex":0.002381213,"about_ca_topic_score_gemma":0.002277868,"teacher_disagreement_score":0.004876456,"about_ca_system_score_codex":0.00033869984,"about_ca_system_score_gemma":0.00049592793,"threshold_uncertainty_score":0.016313374},"labels":[],"label_agreement":null},{"id":"W4246960621","doi":"10.1109/iccad.2000.896456","title":"General models for optimum arbitrary-dimension FPGA switch box designs","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Topology (electrical circuits); Network topology; Dimension (graph theory); Path (computing); Mathematics; Combinatorics; Computer network; Embedded system","score_opus":0.048688602633949495,"score_gpt":0.23212504713796064,"score_spread":0.18343644450401114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246960621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13021114,0.00095466396,0.8315321,0.00064582616,0.000040246858,0.00013699319,0.0006654083,0.00023613079,0.035577465],"genre_scores_gemma":[0.8407428,0.001547753,0.13110258,0.00019888928,0.00006968772,0.0003962461,0.00057048554,0.00012242443,0.025249181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.000084459345,0.000013821193,0.000082474755,0.00007174913,0.00009386076],"domain_scores_gemma":[0.99948573,0.0002672666,0.000102881386,0.00006152451,0.000038524962,0.00004408278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051959377,0.0009429874,0.00090177153,0.0004783253,0.00038266147,0.0012630792,0.0009161583,0.0010881792,0.00955309],"category_scores_gemma":[0.0017795423,0.0007447529,0.0010912524,0.00068396406,0.0009470057,0.0018416755,0.0009837961,0.0011893649,0.0005856111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007158376,0.00002646226,0.00026255441,0.00008483686,0.00002286299,0.00009585061,0.000058174766,0.8008895,0.0014150545,0.19114318,0.0012745599,0.004655313],"study_design_scores_gemma":[0.000039297352,0.000039356197,0.00023316541,0.000015156578,0.000018983468,0.000080048565,0.000036153702,0.88130814,0.0005812945,0.11442674,0.003211821,0.000009976099],"about_ca_topic_score_codex":0.0015231974,"about_ca_topic_score_gemma":0.002500085,"teacher_disagreement_score":0.00955309,"about_ca_system_score_codex":0.001519224,"about_ca_system_score_gemma":0.0005970015,"threshold_uncertainty_score":0.03195834},"labels":[],"label_agreement":null},{"id":"W4248081385","doi":"10.1109/iccad.1990.129931","title":"A detailed router for field-programmable gate arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Router; Routing (electronic design automation); Computer science; Interconnection; Routing algorithm; Gate array; Parallel computing; Field (mathematics); Embedded system; Computer network; Routing protocol; Mathematics","score_opus":0.01919086254441044,"score_gpt":0.20655236987145645,"score_spread":0.187361507327046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248081385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011341325,0.00048448477,0.9654029,0.00016582357,0.00012524685,0.00016748664,0.00048423646,0.011526216,0.010302187],"genre_scores_gemma":[0.15112285,0.0005448443,0.81134635,0.00027319603,0.000080129124,0.0002644669,0.0029627348,0.00041884242,0.03298655],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980026,0.000036331738,0.000014962265,0.000042032043,0.00008282866,0.000023580018],"domain_scores_gemma":[0.9997558,0.000055682147,0.000018458535,0.000086862594,0.00006991297,0.000013174711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021977833,0.0004410927,0.00032427014,0.0005278896,0.00031850897,0.00071472995,0.00087799475,0.0005380961,0.014115624],"category_scores_gemma":[0.0005856789,0.00031012463,0.00036729217,0.00048702754,0.0002079499,0.001077709,0.00038946854,0.00054943335,0.0028745201],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033788342,0.00011529479,0.0010976255,0.00033386544,0.00011551149,0.0002879058,0.000074331096,0.15030254,0.06307656,0.09054792,0.05276528,0.6409453],"study_design_scores_gemma":[0.0001762422,0.00067004294,0.0015566816,0.000052519823,0.0001088972,0.0008530684,0.000029437751,0.71044827,0.05454309,0.038197152,0.19326991,0.00009469367],"about_ca_topic_score_codex":0.0013719964,"about_ca_topic_score_gemma":0.0035613752,"teacher_disagreement_score":0.014115624,"about_ca_system_score_codex":0.00048157878,"about_ca_system_score_gemma":0.00053709385,"threshold_uncertainty_score":0.04722148},"labels":[],"label_agreement":null},{"id":"W4248168031","doi":"10.1145/611839.611841","title":"Design of FPGA interconnect for multilevel metalization","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Interconnection; Routing (electronic design automation); Computer science; Exploit; Topology (electrical circuits); Dimension (graph theory); Hierarchy; Scaling; Embedded system; Computer network; Electrical engineering; Engineering; Mathematics","score_opus":0.04161591048762313,"score_gpt":0.24606562240394603,"score_spread":0.20444971191632288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248168031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4415639,0.00093759084,0.49241924,0.00071247044,0.00014725392,0.00012644289,0.0002448774,0.002063006,0.061785206],"genre_scores_gemma":[0.8629824,0.0002928959,0.13200147,0.00010929694,0.000023154795,0.000058415357,0.00012631429,0.000055210057,0.004350896],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999918,0.000012800485,0.000004317863,0.000013972344,0.000026279446,0.000024697498],"domain_scores_gemma":[0.99991965,0.000012430505,0.000015612517,0.000017896546,0.000026385791,0.000008021077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007727164,0.00017258538,0.00013361748,0.00023496483,0.00022758628,0.0003960476,0.0003660924,0.00019600894,0.0017652175],"category_scores_gemma":[0.00024028198,0.00010560384,0.00013836804,0.00021832991,0.00014528859,0.00027528935,0.00023840075,0.0001906635,0.00039729621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026777803,0.00008182337,0.0048108404,0.00046352026,0.00009050564,0.0007842785,0.00026302368,0.25579208,0.36155006,0.06599543,0.011106556,0.29879406],"study_design_scores_gemma":[0.000091212816,0.000902101,0.0043132133,0.000100675126,0.00009089794,0.0007865406,0.00019369548,0.7658012,0.14952946,0.014942981,0.06320332,0.000044727898],"about_ca_topic_score_codex":0.00092668633,"about_ca_topic_score_gemma":0.0033769798,"teacher_disagreement_score":0.0017652175,"about_ca_system_score_codex":0.0004620113,"about_ca_system_score_gemma":0.00033305102,"threshold_uncertainty_score":0.0059052706},"labels":[],"label_agreement":null},{"id":"W4248286858","doi":"10.1109/n-ssc.2004.6500036","title":"CICC celebrates 26 years of innovation, education, and communication","year":2004,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Society Newsletter","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Business; Engineering management; Engineering","score_opus":0.011464113626978705,"score_gpt":0.24298867439215224,"score_spread":0.23152456076517353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248286858","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010710296,0.027610747,0.012234721,0.08770227,0.16032244,0.00035023573,0.0027511523,0.0048139165,0.6935043],"genre_scores_gemma":[0.02499122,0.008781473,0.0065516345,0.0058126855,0.009862665,0.00011751548,0.0020629861,0.0010384297,0.9407814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971818,0.00013285557,0.000045506156,0.00022196096,0.0018652364,0.0005526102],"domain_scores_gemma":[0.9930657,0.0001814549,0.00019060647,0.00035900893,0.0031406193,0.0030626592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034247593,0.0012405118,0.0008558647,0.001954889,0.0028243337,0.0063057034,0.0009965897,0.002471016,0.07812941],"category_scores_gemma":[0.004322114,0.0002957174,0.00054313487,0.0018057224,0.0011703584,0.0020664758,0.0029232441,0.004245732,0.053684596],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006258244,0.000035156692,0.00019708401,0.000056704303,0.0000064322476,0.00007475466,0.000049384704,0.000073144314,0.00076961174,0.004854063,0.9430619,0.050759256],"study_design_scores_gemma":[0.000003587362,0.000027812648,0.00043250356,0.000021496397,0.000002136218,0.000066124085,0.000046412428,0.000058656486,0.0002720808,0.00035829225,0.9987041,0.0000068037293],"about_ca_topic_score_codex":0.007023874,"about_ca_topic_score_gemma":0.021580031,"teacher_disagreement_score":0.07812941,"about_ca_system_score_codex":0.0034998679,"about_ca_system_score_gemma":0.004675323,"threshold_uncertainty_score":0.26136893},"labels":[],"label_agreement":null},{"id":"W4249099118","doi":"10.1145/611851.611875","title":"Synthetic circuit generation using clustering and iteration","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Electronic circuit; Cluster analysis; Computer engineering; Routing (electronic design automation); Path (computing); Netlist; Algorithm; Embedded system; Engineering; Artificial intelligence","score_opus":0.038698831075028556,"score_gpt":0.21956467715342598,"score_spread":0.18086584607839742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249099118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27902934,0.00014028765,0.71071154,0.00016265026,0.000064610125,0.0003423555,0.000473098,0.0019490706,0.0071270764],"genre_scores_gemma":[0.6480071,0.000085655774,0.34786588,0.000058683523,0.000014610341,0.000451993,0.0010290792,0.0002331006,0.0022539385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993631,0.00018019714,0.000031324886,0.00011542431,0.00024848143,0.0000613686],"domain_scores_gemma":[0.996637,0.0018285855,0.00023505514,0.000597648,0.0006381332,0.00006367426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008980994,0.0005525458,0.0003721029,0.0008973958,0.00032897544,0.00046470293,0.0008965766,0.0006055295,0.001619288],"category_scores_gemma":[0.0045110304,0.00025840374,0.00046869944,0.00064635446,0.00053141796,0.00042432867,0.0005157057,0.00045626936,0.00025608527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016936605,0.00008685321,0.0026341917,0.0001641793,0.000037654256,0.00019076817,0.00019970933,0.87879205,0.02724895,0.019107133,0.0018184158,0.06955082],"study_design_scores_gemma":[0.000024719138,0.00010274997,0.00039363003,0.0000071110703,0.000008378729,0.00008251383,0.00002567456,0.9723508,0.020854821,0.004162932,0.0019748341,0.0000118105845],"about_ca_topic_score_codex":0.0015103417,"about_ca_topic_score_gemma":0.0015322202,"teacher_disagreement_score":0.001619288,"about_ca_system_score_codex":0.00073625275,"about_ca_system_score_gemma":0.00055184343,"threshold_uncertainty_score":0.005417049},"labels":[],"label_agreement":null},{"id":"W4250067423","doi":"10.1145/503049.503052","title":"Circuit design of routing switches","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Computer science; Benchmark (surveying); Very-large-scale integration; Electronic circuit; Transistor; Logic gate; Circuit switching; Logic synthesis; Electronic engineering; Embedded system; Electrical engineering; Computer network; Engineering; Algorithm; Voltage","score_opus":0.053136683840399636,"score_gpt":0.19464615835084725,"score_spread":0.14150947451044762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250067423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08900059,0.00085573934,0.87921953,0.0002745168,0.0002906729,0.00019745549,0.00020525506,0.0016516153,0.028304594],"genre_scores_gemma":[0.72831976,0.000702633,0.26284164,0.00021923843,0.000065787026,0.00013322235,0.0002270459,0.00012430984,0.007366365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999889,0.000019770996,0.000009013196,0.000026520556,0.000034764995,0.000020757147],"domain_scores_gemma":[0.99986887,0.000037544276,0.00001618402,0.000019008485,0.00004919984,0.000009169358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017607516,0.00024758835,0.00013443976,0.00021989467,0.00020806416,0.0005695913,0.000731723,0.00020015177,0.0036325732],"category_scores_gemma":[0.0003656639,0.00013669011,0.00015570478,0.0001809796,0.00016449855,0.00044689374,0.00013531277,0.00021887661,0.0005889893],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047501875,0.00009107869,0.002203186,0.0007160598,0.000114379436,0.00043668225,0.00017649448,0.11605204,0.3808052,0.10625187,0.006400668,0.38627726],"study_design_scores_gemma":[0.0001840928,0.0013412246,0.002020246,0.00012112727,0.00020539151,0.0010323022,0.0001281238,0.4532131,0.4109972,0.027044164,0.10366189,0.0000512213],"about_ca_topic_score_codex":0.000404721,"about_ca_topic_score_gemma":0.00087696715,"teacher_disagreement_score":0.0036325732,"about_ca_system_score_codex":0.00043018788,"about_ca_system_score_gemma":0.00035207727,"threshold_uncertainty_score":0.012152195},"labels":[],"label_agreement":null},{"id":"W4250954305","doi":"10.1109/aspdac.2001.913381","title":"Combinatorial routing analysis and design of universal switch blocks","year":2002,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"","keywords":"Routing (electronic design automation); Block (permutation group theory); Computer science; Set (abstract data type); Decomposition; Dimension (graph theory); Constraint (computer-aided design); Topology (electrical circuits); Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Embedded system","score_opus":0.02423002539524414,"score_gpt":0.2055888944431886,"score_spread":0.18135886904794446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250954305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2374298,0.0005052539,0.7362688,0.00011966422,0.000019661666,0.00004770488,0.00013512974,0.00034775006,0.025126169],"genre_scores_gemma":[0.8934985,0.00038222029,0.10070402,0.00005699203,0.000017168899,0.00008091893,0.00018421622,0.000097932454,0.0049780067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963474,0.00013136664,0.000017080607,0.000054365257,0.0000941437,0.000068354944],"domain_scores_gemma":[0.9996388,0.00014913389,0.000060699294,0.0000739565,0.000054926328,0.000022531553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037838946,0.00037456542,0.0004016602,0.0005315692,0.00023907633,0.0008602951,0.0005355122,0.00030562445,0.0027183767],"category_scores_gemma":[0.0009809032,0.00037941456,0.0005230677,0.0006683118,0.00056215294,0.0009650742,0.0004233515,0.0003188982,0.000279806],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099869285,0.000033088407,0.00088533305,0.00010382842,0.000029454966,0.00013262036,0.000065056374,0.7686731,0.014835747,0.16914138,0.0009667772,0.04503376],"study_design_scores_gemma":[0.000010401053,0.00004791923,0.00040904572,0.000009560111,0.000019324762,0.00007484247,0.000025863554,0.96060795,0.003963479,0.03246205,0.002361795,0.000007682806],"about_ca_topic_score_codex":0.0015246484,"about_ca_topic_score_gemma":0.00202919,"teacher_disagreement_score":0.0027183767,"about_ca_system_score_codex":0.0008263875,"about_ca_system_score_gemma":0.00049742585,"threshold_uncertainty_score":0.00909394},"labels":[],"label_agreement":null},{"id":"W4251343752","doi":"10.1109/eurdac.1992.246230","title":"Routing algorithms for multi-chip modules","year":2003,"lang":"en","type":"article","venue":"Proceedings EURO-DAC '92: European Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Static routing; Routing (electronic design automation); Link-state routing protocol; Equal-cost multi-path routing; Policy-based routing; Placement; Multipath routing; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Algorithm; Channel (broadcasting); Distributed computing; Computer network; Physical design; Routing protocol; Embedded system; Circuit design","score_opus":0.09028723337086844,"score_gpt":0.26703503960550923,"score_spread":0.1767478062346408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251343752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016546499,0.00062483095,0.99252737,0.00008857564,0.00007306045,0.000064237174,0.00007913463,0.0008405461,0.004047582],"genre_scores_gemma":[0.04110168,0.0010241809,0.94650877,0.00011549418,0.00006625149,0.00033126798,0.00049056025,0.00037827028,0.009983471],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943393,0.00012947134,0.000058932015,0.000103403465,0.00022468246,0.000049505055],"domain_scores_gemma":[0.99943286,0.00016969725,0.000050973493,0.00012969908,0.0002022002,0.000014600098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073262205,0.0008555423,0.0006046777,0.0012830427,0.00067256397,0.0015806652,0.0013148899,0.00096675515,0.012435257],"category_scores_gemma":[0.0020690656,0.00046366773,0.00089689356,0.0013542688,0.00046071986,0.0017452253,0.00097623176,0.0009965317,0.004602552],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060681494,0.000031694784,0.0003226474,0.00030431536,0.000059784426,0.00007475569,0.0001338821,0.26571703,0.0048780576,0.1348906,0.009741073,0.5837854],"study_design_scores_gemma":[0.00006047834,0.00006130046,0.00025019833,0.00009779489,0.000036683927,0.00021691427,0.000047117563,0.78033316,0.0053489073,0.14452972,0.06898212,0.000035565863],"about_ca_topic_score_codex":0.0014725631,"about_ca_topic_score_gemma":0.00248556,"teacher_disagreement_score":0.012435257,"about_ca_system_score_codex":0.0010220737,"about_ca_system_score_gemma":0.00076356257,"threshold_uncertainty_score":0.04160011},"labels":[],"label_agreement":null},{"id":"W4251855355","doi":"10.1109/aspdac.2010.5419880","title":"A performance-constrained template-based layout retargeting algorithm for analog integrated circuits","year":2010,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retargeting; Parasitic extraction; Computer science; Integrated circuit layout; Algorithm; Set (abstract data type); Analogue electronics; Integer programming; Standard cell; Electronic circuit; IC layout editor; Design layout record; Circuit extraction; Integrated circuit; Electronic engineering; Engineering; Artificial intelligence; Equivalent circuit","score_opus":0.011369565169900932,"score_gpt":0.21241767457492255,"score_spread":0.20104810940502163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251855355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006062666,0.000043627886,0.99210066,0.00002187082,0.000007160884,0.00001969646,0.000020077623,0.0010727363,0.00065145025],"genre_scores_gemma":[0.18831646,0.00009289576,0.8089944,0.00005529197,0.000014606953,0.0000943439,0.00016168262,0.0003240543,0.0019461984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.00004902851,0.000012544005,0.00007095096,0.00013786352,0.000024520183],"domain_scores_gemma":[0.9995908,0.00018453017,0.00006059471,0.00007499794,0.00007586289,0.000013134202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003426802,0.0006811951,0.00041594956,0.00042139046,0.00023205519,0.00036461718,0.00090238085,0.0004580489,0.0017690185],"category_scores_gemma":[0.0011902585,0.00033296944,0.00045383268,0.00045044415,0.00030821227,0.00052760914,0.00050948374,0.00065035955,0.00052299217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008639521,0.000045945628,0.00032536502,0.00008169537,0.000039901428,0.00006736099,0.00006671839,0.50149477,0.08477744,0.0069061937,0.0017584211,0.4043498],"study_design_scores_gemma":[0.000013000882,0.000056064193,0.00015721553,0.00000365642,0.000011633584,0.000059459773,0.0000046403893,0.9749809,0.020772694,0.0020723643,0.0018584955,0.000009982411],"about_ca_topic_score_codex":0.001750326,"about_ca_topic_score_gemma":0.0025142436,"teacher_disagreement_score":0.0017690185,"about_ca_system_score_codex":0.0005866874,"about_ca_system_score_gemma":0.0007080501,"threshold_uncertainty_score":0.0059179068},"labels":[],"label_agreement":null},{"id":"W4254348042","doi":"10.1109/aspdac.2003.1195042","title":"On improving FPGA routability applying multi-level switch boxes","year":2003,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Lethbridge","funders":"","keywords":"Field-programmable gate array; Routing (electronic design automation); Computer science; Kernel (algebra); Embedded system; Extension (predicate logic); Placement; Parallel computing; Computer hardware; Physical design; Mathematics; Circuit design","score_opus":0.03508341948293945,"score_gpt":0.22141111134759192,"score_spread":0.18632769186465248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254348042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15009926,0.0010953947,0.8397255,0.000101048514,0.00007184551,0.00006262576,0.000039231072,0.0011392172,0.0076659485],"genre_scores_gemma":[0.5939407,0.0009686839,0.39951646,0.00012390027,0.000077045814,0.00006849304,0.00011841672,0.00015168857,0.005034662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971503,0.00008138397,0.000019640396,0.000055137465,0.0000842576,0.000044511373],"domain_scores_gemma":[0.9995327,0.0002097222,0.00005776355,0.00012979706,0.000053841755,0.000016167784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042942722,0.0005174751,0.0003256009,0.00041499245,0.00022697171,0.0004318616,0.0006131092,0.0003112992,0.002533872],"category_scores_gemma":[0.00078225636,0.00015468503,0.00032795835,0.00032319667,0.0002668483,0.001083531,0.0005635236,0.00040502244,0.0005557124],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000548407,0.000108473796,0.0015725954,0.00046008974,0.000081443344,0.00038739783,0.00016342451,0.21463814,0.3193566,0.03774176,0.0012106212,0.42373115],"study_design_scores_gemma":[0.00020681333,0.0020311477,0.0026898189,0.00009668044,0.00017027615,0.0010762349,0.00009519934,0.5723584,0.35261256,0.019804358,0.048795957,0.00006255477],"about_ca_topic_score_codex":0.00025337562,"about_ca_topic_score_gemma":0.00053948787,"teacher_disagreement_score":0.002533872,"about_ca_system_score_codex":0.00023736559,"about_ca_system_score_gemma":0.00024419368,"threshold_uncertainty_score":0.008476675},"labels":[],"label_agreement":null},{"id":"W4254745643","doi":"10.1145/512195.512197","title":"Finding shortest paths in large network systems","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dijkstra's algorithm; Suurballe's algorithm; Shortest path problem; Computer science; Pathfinding; Yen's algorithm; Floyd–Warshall algorithm; Shortest Path Faster Algorithm; K shortest path routing; Graph; A* search algorithm; Algorithm; Scalability; Average path length; Theoretical computer science","score_opus":0.01381417334087049,"score_gpt":0.21817233968009103,"score_spread":0.20435816633922055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254745643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04846897,0.0008022776,0.9453038,0.00026232327,0.000037500733,0.00013665856,0.00027930184,0.0018111564,0.0028979662],"genre_scores_gemma":[0.31991366,0.00077964936,0.67340523,0.00006221384,0.000039795937,0.00025396477,0.0011072865,0.00031298943,0.004125199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00023829936,0.00007115081,0.0002715395,0.00026230857,0.00012323726],"domain_scores_gemma":[0.9975782,0.0016243856,0.00021448046,0.00024648063,0.00025530864,0.000081088125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007855993,0.0009505783,0.00083819905,0.0019636136,0.0016363296,0.0014349418,0.0013601072,0.00095897814,0.0040044524],"category_scores_gemma":[0.0055301404,0.00071005366,0.000405068,0.002828086,0.00088916416,0.0040057097,0.0018256457,0.0006888569,0.0007415377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021365721,0.00007399622,0.0014895528,0.00042874904,0.00008106119,0.0003004565,0.00044355492,0.7818586,0.0058416096,0.037832823,0.0050248443,0.16641115],"study_design_scores_gemma":[0.00006702201,0.000056834313,0.00043700944,0.000023985222,0.000026881215,0.00016834585,0.00023571371,0.9095708,0.0042842147,0.07597537,0.009129077,0.000024672954],"about_ca_topic_score_codex":0.0070337453,"about_ca_topic_score_gemma":0.008698473,"teacher_disagreement_score":0.0070337453,"about_ca_system_score_codex":0.0012567915,"about_ca_system_score_gemma":0.0010594422,"threshold_uncertainty_score":0.013985574},"labels":[],"label_agreement":null},{"id":"W4255023136","doi":"10.32920/ryerson.14647368","title":"Parallel Implementation of Non-slicing Floorplans with MPI and OpenMP","year":2021,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Parallel computing; Computer science; Floorplan; Benchmark (surveying); Multiprocessing; Very-large-scale integration; Slicing; Computation; Computer architecture; Embedded system; Algorithm","score_opus":0.010706930939589066,"score_gpt":0.259707047487965,"score_spread":0.24900011654837595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255023136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028095929,0.00012658007,0.9540153,0.000088770794,0.00007048474,0.00009835369,0.00029270165,0.011234026,0.0059777657],"genre_scores_gemma":[0.2131888,0.00013690486,0.7808197,0.00004368229,0.000021094385,0.00022808522,0.0011011845,0.0009038186,0.0035567174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963284,0.00006345937,0.000030041907,0.0000499153,0.0001745355,0.000049164966],"domain_scores_gemma":[0.99940085,0.00018574487,0.000050474053,0.0001482231,0.00018555719,0.00002911802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038846716,0.0006993639,0.0004598224,0.0006909753,0.0005644369,0.0006840518,0.0012047517,0.0003613466,0.004096584],"category_scores_gemma":[0.0014540518,0.0003722154,0.00055901305,0.00071196613,0.00032414123,0.0006012228,0.0005489272,0.0006189941,0.0008168965],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036058665,0.00020551174,0.0026859425,0.00043217567,0.00017833954,0.00042998567,0.00038636776,0.48255306,0.050316934,0.021532321,0.012342422,0.42857638],"study_design_scores_gemma":[0.000046638674,0.00006264618,0.0006939695,0.000009933082,0.000019086301,0.00006587804,0.0000378727,0.9623285,0.023733009,0.006272447,0.006711744,0.000018339193],"about_ca_topic_score_codex":0.005416627,"about_ca_topic_score_gemma":0.0056363977,"teacher_disagreement_score":0.005416627,"about_ca_system_score_codex":0.00035775077,"about_ca_system_score_gemma":0.0009014463,"threshold_uncertainty_score":0.013704479},"labels":[],"label_agreement":null},{"id":"W4255752943","doi":"10.1007/978-1-4419-0739-4_2","title":"Background","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Computer science; Computer architecture; FPGA prototype; Transistor; Electronic engineering; Embedded system; Engineering; Electrical engineering","score_opus":0.018988971257094617,"score_gpt":0.20589156790583954,"score_spread":0.18690259664874492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255752943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008007566,0.005591422,0.007862717,0.0031095657,0.0026947171,0.00016205087,0.0020756186,0.00058869284,0.9771145],"genre_scores_gemma":[0.0034655444,0.0054514455,0.003376141,0.0016516553,0.00076257717,0.00011404629,0.0019415524,0.00020512326,0.983032],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952376,0.000039738206,0.000017238977,0.00012037851,0.00022062418,0.000078202065],"domain_scores_gemma":[0.99938405,0.00008370751,0.000026395512,0.00006813892,0.00030480954,0.00013273579],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005468738,0.0008235725,0.0004701055,0.0015493289,0.0013369273,0.0024876725,0.0014260685,0.0011048601,0.42243743],"category_scores_gemma":[0.0017131428,0.00023892845,0.00037497556,0.0014311138,0.00047500595,0.0021364132,0.0015174095,0.0012209789,0.28884897],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006106596,0.00009600329,0.00022034172,0.0003476964,0.0000034772224,0.00011629313,0.00020693288,0.0002429649,0.0009111501,0.07050303,0.627248,0.30004308],"study_design_scores_gemma":[0.0000020737596,0.0000109725315,0.000089809335,0.00008512948,0.0000012537197,0.00006865037,0.000032664433,0.00003282444,0.00013092291,0.004668334,0.9948748,0.0000026428295],"about_ca_topic_score_codex":0.0031282504,"about_ca_topic_score_gemma":0.0051569045,"teacher_disagreement_score":0.5775626,"about_ca_system_score_codex":0.0012073145,"about_ca_system_score_gemma":0.002437783,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4255840877","doi":"10.1109/dac.1992.227805","title":"An efficient algorithm for microword length minimization","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Minification; Computer science; Graph; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Programming language","score_opus":0.03351824797113805,"score_gpt":0.2569164784611113,"score_spread":0.22339823048997326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255840877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017330137,0.00017377138,0.9928514,0.00011239239,0.000077955796,0.00010312958,0.000063682004,0.0017025447,0.0031821164],"genre_scores_gemma":[0.021590168,0.0001639472,0.97137195,0.0001056805,0.00004336759,0.00031051246,0.00033901102,0.00040680022,0.0056684692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.00009583858,0.00005343385,0.00017298837,0.00033680146,0.000089636465],"domain_scores_gemma":[0.9994129,0.00019198471,0.000046957415,0.000111652036,0.00020812273,0.000028439776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050058897,0.001586774,0.0009656965,0.0016345722,0.0010742592,0.0013866198,0.0017791562,0.001422007,0.0142258825],"category_scores_gemma":[0.0018892239,0.0006626722,0.00093339116,0.0017106923,0.0007017242,0.001946745,0.002010389,0.00140777,0.0067578247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001714181,0.000103293445,0.00032481886,0.00029073673,0.000053992513,0.00013244862,0.00012827119,0.07668924,0.021335622,0.042622875,0.022457603,0.8356898],"study_design_scores_gemma":[0.00022048737,0.00019836628,0.0003809733,0.000069444504,0.00005001919,0.0005177127,0.00012355608,0.82235175,0.020229567,0.09558462,0.060211316,0.00006214958],"about_ca_topic_score_codex":0.0014641852,"about_ca_topic_score_gemma":0.0029542851,"teacher_disagreement_score":0.0142258825,"about_ca_system_score_codex":0.00079167786,"about_ca_system_score_gemma":0.0014090114,"threshold_uncertainty_score":0.047590256},"labels":[],"label_agreement":null},{"id":"W4256228596","doi":"10.1109/isocc.2018.8649963","title":"ISOCC 2018 Front Matter","year":2018,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Samsung; University of Tokushima; Polytechnique Montréal","keywords":"Front (military); Computer science; Geology; Oceanography","score_opus":0.007659060495802687,"score_gpt":0.20087769663575777,"score_spread":0.19321863613995507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256228596","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010162944,0.0016864208,0.007293211,0.0028110568,0.014035265,0.00027333308,0.0034887462,0.0070882537,0.96230745],"genre_scores_gemma":[0.004569468,0.0013159985,0.0020214634,0.00080814393,0.0026788136,0.00009629121,0.0044664885,0.0014947221,0.9825485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990458,0.000051728177,0.000049364928,0.00013001027,0.00058674737,0.00013636789],"domain_scores_gemma":[0.9958656,0.00016304855,0.00012633273,0.0004757514,0.0027097536,0.00065957505],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008510687,0.0010004939,0.0008432829,0.0026619264,0.001419681,0.004658505,0.0013587084,0.0020878382,0.7254369],"category_scores_gemma":[0.0026225185,0.00041924606,0.000557146,0.00208913,0.0004610623,0.0016743977,0.0009965346,0.0014727224,0.73639715],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003576345,0.000019899378,0.00006986342,0.0001399655,0.0000029164692,0.000043287273,0.0000111121735,0.00008797334,0.0013325055,0.0019337353,0.92318815,0.07313492],"study_design_scores_gemma":[0.0000065919794,0.000017771887,0.00015516541,0.000035746154,0.0000024417413,0.00005241757,0.000010549928,0.00018385939,0.00059033604,0.0003863435,0.9985536,0.0000051455245],"about_ca_topic_score_codex":0.002238672,"about_ca_topic_score_gemma":0.0041861203,"teacher_disagreement_score":0.27456307,"about_ca_system_score_codex":0.0014211945,"about_ca_system_score_gemma":0.0018861154,"threshold_uncertainty_score":0.3916309},"labels":[],"label_agreement":null},{"id":"W4256429711","doi":"10.1109/date.2007.364599","title":"A Symbolic Methodology for the Verification of Analog and Mixed Signal Designs","year":2007,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Symbolic computation; Symbolic trajectory evaluation; Computer science; Representation (politics); Set (abstract data type); Computation; SIGNAL (programming language); Theoretical computer science; Mixed-signal integrated circuit; Symbolic data analysis; Algebra over a field; Algorithm; Programming language; Mathematics; Integrated circuit; Model checking","score_opus":0.10975798568040666,"score_gpt":0.3126082362462768,"score_spread":0.20285025056587014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256429711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015046353,0.00011584982,0.99711406,0.000043019936,0.00002451777,0.000030764495,0.00001884916,0.00032216863,0.00082608993],"genre_scores_gemma":[0.15850084,0.00044076119,0.8386148,0.00009592984,0.000071939176,0.0001928809,0.000113312075,0.00011124066,0.0018582321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787164,0.00054796116,0.00021174476,0.00023141231,0.0010218144,0.0001153674],"domain_scores_gemma":[0.99840003,0.00079447735,0.00011466201,0.00036200343,0.0002948475,0.00003411975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201995,0.00074453006,0.00067297084,0.0013443475,0.0006470661,0.0014143579,0.001329833,0.0006172674,0.002191691],"category_scores_gemma":[0.0041194493,0.0004709855,0.001245845,0.0006179352,0.0022736054,0.002001439,0.0012340113,0.0015454862,0.00068377896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007638437,0.000067347544,0.00033256935,0.00044590488,0.00008310793,0.0003741614,0.00033504475,0.049478438,0.0419784,0.76679474,0.0011861909,0.13884768],"study_design_scores_gemma":[0.000098412565,0.0003399734,0.00021722064,0.0002024331,0.00010210827,0.0007566894,0.000063684914,0.424138,0.06858112,0.4619478,0.043466914,0.0000855639],"about_ca_topic_score_codex":0.0008452954,"about_ca_topic_score_gemma":0.0007612493,"teacher_disagreement_score":0.002191691,"about_ca_system_score_codex":0.0010784268,"about_ca_system_score_gemma":0.001666837,"threshold_uncertainty_score":0.010682702},"labels":[],"label_agreement":null},{"id":"W4280548669","doi":"10.1016/j.micpro.2022.104563","title":"Measuring the effect of track count and wire segment length on the layout area of switch blocks for tile-based FPGAs","year":2022,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Block (permutation group theory); Flexibility (engineering); Routing (electronic design automation); Logic block; Metric (unit); Floorplan; Computer hardware; Embedded system; Engineering; Mathematics","score_opus":0.01238930526602027,"score_gpt":0.19411208806279728,"score_spread":0.181722782796777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280548669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931035,0.00023216402,0.0056242933,0.000022332139,0.000013060664,0.000007902988,0.00013912853,0.00021007782,0.0006475609],"genre_scores_gemma":[0.99643034,0.000075409414,0.0028125753,0.000013956925,0.0000063041757,0.0000071809977,0.000107478714,0.000031823558,0.0005149231],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996344,0.000061134975,0.000023929933,0.00009833482,0.00013186227,0.00005030701],"domain_scores_gemma":[0.9964116,0.0021812632,0.00067093165,0.0002644472,0.0003820867,0.0000896615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031203995,0.0003455066,0.00021504247,0.00043368855,0.00018866573,0.00036123293,0.00042172484,0.00033656065,0.0013661959],"category_scores_gemma":[0.0024596036,0.00022627489,0.00019228394,0.0005597536,0.00017549706,0.0005361752,0.0001921914,0.00021589939,0.00025114798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030364566,0.00017895662,0.0421887,0.00019472912,0.00013515855,0.00028139763,0.00016201726,0.039628506,0.86475253,0.00024115834,0.0003745303,0.04882586],"study_design_scores_gemma":[0.000046214856,0.0035809819,0.10115549,0.000012018672,0.00018213305,0.00048396995,0.00011218013,0.07928796,0.81369627,0.000108875225,0.0012977393,0.00003612263],"about_ca_topic_score_codex":0.0009862023,"about_ca_topic_score_gemma":0.002444211,"teacher_disagreement_score":0.0013661959,"about_ca_system_score_codex":0.00037418728,"about_ca_system_score_gemma":0.00022900221,"threshold_uncertainty_score":0.004570365},"labels":[],"label_agreement":null},{"id":"W4280560843","doi":"10.23919/date54114.2022.9774530","title":"CR&amp;P: An Efficient Co-operation between Routing and Placement","year":2022,"lang":"en","type":"article","venue":"2022 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Routing (electronic design automation); Physical design; Electronic design automation; Placement; Design flow; CONTEST; Network routing; Place and route; Integer programming; Distributed computing; Embedded system; Circuit design; Algorithm","score_opus":0.0573484131648651,"score_gpt":0.2814321515290119,"score_spread":0.2240837383641468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280560843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070692664,0.00014262025,0.9847403,0.00012187303,0.000046019348,0.00012328578,0.000047992078,0.0031537479,0.0045548663],"genre_scores_gemma":[0.153554,0.00013582908,0.8418561,0.000111365596,0.000038708662,0.00014927256,0.00017538625,0.00044786083,0.0035313866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998252,0.0003644167,0.000086890555,0.00031200683,0.00080530107,0.0001793838],"domain_scores_gemma":[0.9985726,0.00038270227,0.000185247,0.0005477424,0.00024240618,0.00006931714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014426543,0.001031224,0.00080212177,0.0011488879,0.0007108322,0.0015871426,0.0027450114,0.0008747273,0.005985034],"category_scores_gemma":[0.003058356,0.0005334332,0.0007573716,0.0010374177,0.0010011046,0.001710112,0.0022883147,0.0013767888,0.0017895313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023695447,0.00023877855,0.0012065597,0.0003295337,0.00007379625,0.00044176902,0.00018897804,0.27516422,0.02801561,0.06603171,0.015490207,0.61258185],"study_design_scores_gemma":[0.000051628158,0.00019481292,0.00019327531,0.000025819338,0.000029202616,0.00032752557,0.000039827257,0.95714647,0.014944762,0.013570355,0.013452075,0.000024165784],"about_ca_topic_score_codex":0.0031106598,"about_ca_topic_score_gemma":0.0049779387,"teacher_disagreement_score":0.005985034,"about_ca_system_score_codex":0.0008866899,"about_ca_system_score_gemma":0.003181886,"threshold_uncertainty_score":0.020021915},"labels":[],"label_agreement":null},{"id":"W4280571518","doi":"10.23919/date54114.2022.9774699","title":"Deep Reinforcement Learning for Analog Circuit Structure Synthesis","year":2022,"lang":"en","type":"article","venue":"2022 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Reinforcement learning; Construct (python library); Set (abstract data type); Reliability (semiconductor); Circuit extraction; Circuit design; Computer engineering; Artificial intelligence; Equivalent circuit; Engineering; Electrical engineering; Embedded system; Programming language; Voltage","score_opus":0.04201048525884097,"score_gpt":0.2475071451572473,"score_spread":0.20549665989840635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280571518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071344553,0.00015379209,0.9902388,0.000050922245,0.000016363552,0.000020156633,0.000013996207,0.00044265372,0.001928824],"genre_scores_gemma":[0.67113656,0.00017103553,0.32433975,0.00010787158,0.000026805761,0.00012863833,0.00007336956,0.00009325541,0.00392267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.00004729785,0.0000105632635,0.000040741423,0.00008814401,0.00003082033],"domain_scores_gemma":[0.99969983,0.00015233776,0.000031820495,0.000034707868,0.00006533565,0.00001596951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000490039,0.000529746,0.00043636851,0.000308764,0.00021223332,0.00034062073,0.00081580936,0.00045420657,0.00229276],"category_scores_gemma":[0.0009212659,0.00025097205,0.00033408395,0.00022707584,0.00046041494,0.0004892738,0.00051429216,0.000905516,0.00028854207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043727185,0.000047682915,0.00031200846,0.00007002053,0.000024353121,0.00004376298,0.000032760705,0.84057117,0.0087373555,0.011995793,0.0006916832,0.13742968],"study_design_scores_gemma":[0.000004678449,0.000018332017,0.000024144969,0.0000026454345,0.0000023245545,0.0000059005247,0.0000012454993,0.99610424,0.0011590376,0.0022848817,0.0003908232,0.0000017066368],"about_ca_topic_score_codex":0.0027298776,"about_ca_topic_score_gemma":0.0037033467,"teacher_disagreement_score":0.0027298776,"about_ca_system_score_codex":0.00074917014,"about_ca_system_score_gemma":0.00077065773,"threshold_uncertainty_score":0.007670045},"labels":[],"label_agreement":null},{"id":"W4282036953","doi":"10.1109/fccm53951.2022.9786176","title":"Evaluating the impact of using multiple-metal layers on the layout area of switch blocks for tile-based FPGAs in FinFET 7nm","year":2022,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Block (permutation group theory); Computer science; Tile; Dimension (graph theory); Embedded system; Materials science","score_opus":0.11993569619568333,"score_gpt":0.35602898393206084,"score_spread":0.2360932877363775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282036953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9502394,0.00046414716,0.04685652,0.000075023,0.000026648171,0.000022079872,0.00019928519,0.00042090737,0.0016961193],"genre_scores_gemma":[0.98895967,0.00012090655,0.01047243,0.000015928925,0.0000029246344,0.000008068215,0.00007888328,0.000028172899,0.0003130409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999736,0.0000612772,0.00001407346,0.000064602726,0.00008184249,0.000042124117],"domain_scores_gemma":[0.9979976,0.0014200922,0.00021700427,0.00015568151,0.0001745705,0.000035128483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000403545,0.0006856093,0.00028660859,0.0003592553,0.00022340572,0.0005403908,0.0006261873,0.0005523912,0.0007498165],"category_scores_gemma":[0.0020945051,0.00031138823,0.00040375974,0.0003985406,0.00022124566,0.0010492267,0.00026951026,0.0002867518,0.0001341437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016377604,0.00003889636,0.005450865,0.000057904635,0.0000333246,0.00006288636,0.0000214992,0.96921,0.011053239,0.00021712408,0.00010346656,0.013587019],"study_design_scores_gemma":[0.0000047900016,0.00023482171,0.002265544,0.0000060480706,0.0000267692,0.000041096613,0.000022168479,0.98225015,0.014861308,0.00009956441,0.00017762823,0.000010137098],"about_ca_topic_score_codex":0.011149974,"about_ca_topic_score_gemma":0.018612457,"teacher_disagreement_score":0.011149974,"about_ca_system_score_codex":0.0007926441,"about_ca_system_score_gemma":0.0004909091,"threshold_uncertainty_score":0.022170126},"labels":[],"label_agreement":null},{"id":"W4283687422","doi":"10.1109/isqed54688.2022.9806228","title":"Routability-driven Global Routing with 3D Congestion Estimation Using a Customized Neural Network","year":2022,"lang":"en","type":"article","venue":"2022 23rd International Symposium on Quality Electronic Design (ISQED)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Routing (electronic design automation); Computer science; Artificial neural network; Estimation; Computer network; Embedded system; Real-time computing; Artificial intelligence; Engineering; Systems engineering","score_opus":0.019961367447600555,"score_gpt":0.27823394752510594,"score_spread":0.25827258007750536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283687422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06435194,0.00019535398,0.92967254,0.00010334476,0.00004238689,0.000057668876,0.000104733015,0.0027398956,0.0027322362],"genre_scores_gemma":[0.7635739,0.0001424844,0.23274459,0.00009737185,0.000016679056,0.00009996788,0.00026002503,0.00015402609,0.002911055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984264,0.000016340357,0.0000068365416,0.00005401343,0.000055036482,0.000025083149],"domain_scores_gemma":[0.99976283,0.000059797585,0.00004486357,0.000044209402,0.00007594921,0.000012389573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002967004,0.00082439336,0.0003962672,0.00055105786,0.00018486934,0.000533465,0.00096266647,0.00047728186,0.0013755719],"category_scores_gemma":[0.0007330666,0.00035000674,0.00048945966,0.0003840079,0.00030213056,0.0006812461,0.00059381087,0.0004720573,0.00020242935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008307432,0.000042129617,0.0014512072,0.000052178653,0.000052114992,0.00007335361,0.00004247697,0.8267513,0.020913733,0.0020966572,0.0011344441,0.1473073],"study_design_scores_gemma":[0.0000023423925,0.000020398596,0.0001722576,0.000002136388,0.000007154397,0.000010896852,0.000002484837,0.9970144,0.0021686358,0.00034884858,0.00024678008,0.000003665228],"about_ca_topic_score_codex":0.0076679457,"about_ca_topic_score_gemma":0.01158126,"teacher_disagreement_score":0.0076679457,"about_ca_system_score_codex":0.0009087637,"about_ca_system_score_gemma":0.0007614586,"threshold_uncertainty_score":0.01524663},"labels":[],"label_agreement":null},{"id":"W4283701272","doi":"10.1109/isqed54688.2022.9806266","title":"Multi-Objective Variation-Aware Sizing for Analog CNFET Circuits","year":2022,"lang":"en","type":"article","venue":"2022 23rd International Symposium on Quality Electronic Design (ISQED)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Process variation; Carbon nanotube field-effect transistor; Computer science; Electronic circuit; Sizing; Robustness (evolution); Electronic engineering; Analogue electronics; Transistor; Process (computing); Field-effect transistor; Engineering; Electrical engineering; Voltage","score_opus":0.030396991637106973,"score_gpt":0.28997532716396696,"score_spread":0.25957833552686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283701272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07166909,0.00030137989,0.9234226,0.000096427815,0.000026855188,0.00008626669,0.000048142803,0.00024220713,0.0041070455],"genre_scores_gemma":[0.7401672,0.00015640224,0.25690562,0.00007552293,0.000013455785,0.00020732105,0.00010469133,0.000099077886,0.0022707754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973553,0.00006908644,0.000009406285,0.000048381124,0.00010623145,0.00003144067],"domain_scores_gemma":[0.9996315,0.00019875568,0.00005956356,0.000020345205,0.00007307045,0.000016783522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062084495,0.00092697196,0.00047473342,0.0006281311,0.0002499991,0.00047691393,0.0006107434,0.0004963171,0.0011223283],"category_scores_gemma":[0.0009967254,0.00026517973,0.00057555287,0.0003407315,0.00031293966,0.00040026024,0.00041710978,0.00045500242,0.00011179297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012944284,0.000017301703,0.00026274772,0.000033115502,0.000012357543,0.000022479864,0.000017225608,0.9743945,0.0059611895,0.0010967568,0.00014382222,0.01802551],"study_design_scores_gemma":[0.000004223969,0.000028235048,0.00014101794,0.0000031561992,0.0000051468514,0.000007699807,0.0000059093695,0.997428,0.0014366364,0.0006284693,0.0003087385,0.0000027197555],"about_ca_topic_score_codex":0.0023757785,"about_ca_topic_score_gemma":0.0029294745,"teacher_disagreement_score":0.0023757785,"about_ca_system_score_codex":0.0007338914,"about_ca_system_score_gemma":0.0007923665,"threshold_uncertainty_score":0.0053248405},"labels":[],"label_agreement":null},{"id":"W4285346953","doi":"10.1109/rsp53691.2021.9806205","title":"Heterogeneous Logic Implementation for Adders in VTR","year":2021,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Adder; Verilog; Computer science; Field-programmable gate array; Logic block; Routing (electronic design automation); Block (permutation group theory); Computer architecture; Logic synthesis; Scheme (mathematics); Parallel computing; Logic gate; Critical path method; Design flow; Computer hardware; Embedded system; Engineering; Algorithm","score_opus":0.021583703447223393,"score_gpt":0.28815596696771595,"score_spread":0.26657226352049257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285346953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20743921,0.0017714881,0.74885917,0.00029883327,0.0002175806,0.00018502156,0.0005208672,0.0042192414,0.036488585],"genre_scores_gemma":[0.7059283,0.00032029249,0.28562474,0.00020668715,0.000031155316,0.00005491926,0.00050419464,0.00024849692,0.0070811687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964416,0.000052888397,0.000034230005,0.00007991639,0.00012574568,0.00006309993],"domain_scores_gemma":[0.99972516,0.000068035544,0.000043631455,0.00009063696,0.00005998364,0.000012552324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027334326,0.0004454362,0.00030170742,0.0005242262,0.00032668986,0.001288272,0.0010567271,0.00029796985,0.005951611],"category_scores_gemma":[0.00059605885,0.00020485838,0.00047589917,0.000536666,0.00025652294,0.0010263465,0.00053751224,0.0004105479,0.0008860662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071440026,0.00016412202,0.0011940154,0.0006130269,0.00015152995,0.00078214606,0.00021420004,0.1534927,0.35461867,0.084980965,0.005208425,0.39786592],"study_design_scores_gemma":[0.00014294368,0.0012099704,0.0019222182,0.00012110435,0.00020994426,0.0013250328,0.00017528363,0.6006123,0.30547804,0.030761816,0.057960685,0.00008066334],"about_ca_topic_score_codex":0.0012048234,"about_ca_topic_score_gemma":0.0039325953,"teacher_disagreement_score":0.005951611,"about_ca_system_score_codex":0.00068501197,"about_ca_system_score_gemma":0.0005567272,"threshold_uncertainty_score":0.019910157},"labels":[],"label_agreement":null},{"id":"W4287236889","doi":"10.48550/arxiv.2104.03546","title":"Graph Partitioning and Sparse Matrix Ordering using Reinforcement\\n Learning and Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Dense graph; Reinforcement learning; Sparse matrix; Adjacency matrix; Graph; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Mathematics; Line graph; Pathwidth","score_opus":0.04123634730311696,"score_gpt":0.18606070754357898,"score_spread":0.14482436024046202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287236889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009467202,0.00008178811,0.9884178,0.00009167734,0.000019382855,0.000029837964,0.000034799115,0.00052499044,0.0013325975],"genre_scores_gemma":[0.23613602,0.00014568608,0.7580271,0.00015665859,0.000049533355,0.00012489982,0.00036807012,0.0003019446,0.00469016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.00006951588,0.000012406871,0.000077141776,0.00009610461,0.00003834882],"domain_scores_gemma":[0.9994116,0.00026349348,0.0000728358,0.00011062433,0.00009703288,0.000044556593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037200237,0.0009539475,0.0007045406,0.00082057464,0.00047058478,0.0006308585,0.0011598018,0.00079484435,0.0025684335],"category_scores_gemma":[0.0017701868,0.00047938447,0.0005583328,0.00079633377,0.00082899694,0.0013250685,0.0010256119,0.0012265367,0.00055651594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087969274,0.000068923335,0.0005479753,0.00008332457,0.00003428303,0.000091157795,0.00009524999,0.800464,0.009231505,0.02957121,0.0025482927,0.15717626],"study_design_scores_gemma":[0.0000060658676,0.00001159672,0.000035799156,0.0000027719893,0.0000021180492,0.00001121748,0.0000055647133,0.9921733,0.001176904,0.0059994743,0.00057264965,0.0000025290954],"about_ca_topic_score_codex":0.00908766,"about_ca_topic_score_gemma":0.019340789,"teacher_disagreement_score":0.00908766,"about_ca_system_score_codex":0.0010297868,"about_ca_system_score_gemma":0.0011013189,"threshold_uncertainty_score":0.018069506},"labels":[],"label_agreement":null},{"id":"W4289827721","doi":"10.1109/ipdpsw55747.2022.00198","title":"EDAML 2022 Invited Speaker 5: Combining Optimization and Machine Learning in Physical Design","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Heuristics; Machine learning; Artificial intelligence; Robustness (evolution); Optimization problem; Reinforcement learning; Online machine learning; Mathematical optimization; Active learning (machine learning); Algorithm; Mathematics","score_opus":0.015755746062909682,"score_gpt":0.2355472832429048,"score_spread":0.2197915371799951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289827721","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065773292,0.034052916,0.1785207,0.107957214,0.13959375,0.00034550636,0.0029943204,0.0058388226,0.5241195],"genre_scores_gemma":[0.041728623,0.012370814,0.041811246,0.00919697,0.026071604,0.00025786567,0.0025704058,0.0024597351,0.8635328],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998741,0.00030096952,0.00005371872,0.00024303737,0.0005213436,0.00014001536],"domain_scores_gemma":[0.9987483,0.00034973834,0.00003426184,0.000084375046,0.0005623257,0.00022092194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442312,0.0012283261,0.0008220573,0.00091908424,0.0009107643,0.004794698,0.0017818979,0.003236743,0.13437648],"category_scores_gemma":[0.0039969,0.000521039,0.0010956513,0.00083772826,0.00070710166,0.0028741607,0.0019152245,0.0037916035,0.06285596],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020031052,0.000058608635,0.00026315937,0.0002821307,0.000032491087,0.00014373414,0.0000884807,0.003207324,0.0021933923,0.0349669,0.8072666,0.15129693],"study_design_scores_gemma":[0.000024396304,0.000064397245,0.00032303226,0.0001498102,0.00001478327,0.00012278977,0.00006621542,0.00483022,0.0016647128,0.015516244,0.97719157,0.000031885273],"about_ca_topic_score_codex":0.0013459489,"about_ca_topic_score_gemma":0.0024381937,"teacher_disagreement_score":0.13437648,"about_ca_system_score_codex":0.0023067312,"about_ca_system_score_gemma":0.0010726056,"threshold_uncertainty_score":0.44953412},"labels":[],"label_agreement":null},{"id":"W4292308109","doi":"10.2139/ssrn.4191872","title":"A New Trust-Region-Based Phase Envelope Construction Algorithm","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Envelope (radar); Algorithm; Phase (matter); Computer science; Telecommunications; Physics","score_opus":0.006242635752251582,"score_gpt":0.21559879329997295,"score_spread":0.20935615754772136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292308109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012157419,0.00005444621,0.9977824,0.000020907872,0.000014561385,0.000018936302,0.000018120725,0.00025850456,0.00061647553],"genre_scores_gemma":[0.091142714,0.00019062022,0.9045956,0.00007524124,0.000040200714,0.000110372195,0.00027951328,0.0001921215,0.0033735489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992218,0.00015831896,0.00004882545,0.00013576006,0.00036680812,0.00006854104],"domain_scores_gemma":[0.9989458,0.000357367,0.0000957763,0.00022210817,0.00033946225,0.000039530412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083153695,0.00082030526,0.001115426,0.0009370967,0.0004573558,0.0011614265,0.0013341423,0.0009936284,0.0059289164],"category_scores_gemma":[0.0030800237,0.000514801,0.00086637755,0.0012243039,0.00049231254,0.0016963079,0.0016032448,0.0012102782,0.002947222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045931476,0.00010957076,0.00043462543,0.00017505234,0.000070374444,0.00011259337,0.00010769523,0.181675,0.03280493,0.029972944,0.006003762,0.7480742],"study_design_scores_gemma":[0.00003325707,0.00008604504,0.00010838302,0.000012809301,0.000020402258,0.0001600574,0.000014118303,0.9795253,0.009826746,0.006130317,0.0040657767,0.0000167826],"about_ca_topic_score_codex":0.001432815,"about_ca_topic_score_gemma":0.0011783633,"teacher_disagreement_score":0.0059289164,"about_ca_system_score_codex":0.00049319956,"about_ca_system_score_gemma":0.00095545105,"threshold_uncertainty_score":0.01983416},"labels":[],"label_agreement":null},{"id":"W4296700647","doi":"10.18280/isi.270403","title":"Accurate Power Estimation Identity for DSP Blocks Targeted to FPGAs","year":2022,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digital signal processing; Computer science; Suite; Power (physics); Field-programmable gate array; Block (permutation group theory); Identity (music); Embedded system; Computer engineering; Computer hardware; Mathematics","score_opus":0.011427840728735376,"score_gpt":0.23789237540657285,"score_spread":0.22646453467783748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296700647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059578784,0.00032962306,0.93211424,0.000059954324,0.000044359203,0.00007794049,0.00016129711,0.0025385655,0.0050951946],"genre_scores_gemma":[0.70033234,0.0004213273,0.29075262,0.00006642846,0.000026250787,0.0001030057,0.0006132849,0.0004136796,0.0072711785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999054,0.00015263942,0.000050577462,0.00018463223,0.00048786603,0.000070251066],"domain_scores_gemma":[0.999298,0.00017813509,0.00010406127,0.00018957428,0.00021809191,0.000012040453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061899534,0.0010130054,0.00050832436,0.00065985485,0.00022742382,0.0008067007,0.0009114323,0.0004026539,0.00318774],"category_scores_gemma":[0.0025480362,0.00035743037,0.0004605831,0.00039946378,0.00022548491,0.001070698,0.0005113727,0.0007549781,0.0014646797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004827993,0.00018217422,0.005933387,0.00052318076,0.00010296467,0.00033444268,0.00030322597,0.34265846,0.14589201,0.012219443,0.0038687866,0.48749918],"study_design_scores_gemma":[0.000020220716,0.0003526275,0.002499762,0.000044748987,0.000047661586,0.0003854548,0.000043746033,0.85185206,0.1330087,0.0022544025,0.009464154,0.000026586655],"about_ca_topic_score_codex":0.001229756,"about_ca_topic_score_gemma":0.0018426647,"teacher_disagreement_score":0.00318774,"about_ca_system_score_codex":0.00056927785,"about_ca_system_score_gemma":0.0006703074,"threshold_uncertainty_score":0.010664046},"labels":[],"label_agreement":null},{"id":"W4297958057","doi":"","title":"Optimization of meshed electrical networks by increasing algebraic connectivity","year":2017,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Algebraic number; Mathematics","score_opus":0.00725811079250767,"score_gpt":0.20355023255956506,"score_spread":0.19629212176705738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297958057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37954864,0.0006455686,0.57662785,0.0007192058,0.0001222655,0.00006924332,0.00013166755,0.0003007968,0.04183477],"genre_scores_gemma":[0.96649945,0.00023366665,0.030324483,0.00003968764,0.000022448508,0.000032037387,0.000036938975,0.000049943075,0.0027613244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998926,0.000038399725,0.0000035353614,0.00001903867,0.000023691886,0.000022658152],"domain_scores_gemma":[0.999411,0.0003758627,0.000088407716,0.000027388634,0.00006721312,0.00003022523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024721827,0.00047980054,0.0003120328,0.00047391752,0.00023441012,0.0005560216,0.00049704383,0.0004348487,0.0044049844],"category_scores_gemma":[0.0019216952,0.00020818936,0.00019732381,0.00040483268,0.00034773163,0.00070208777,0.00058987073,0.00030654718,0.00023573518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044262964,0.000016970145,0.00033809748,0.000042056505,0.000009114347,0.000031413136,0.000015568703,0.9757362,0.002534266,0.006413485,0.00036399637,0.0144546805],"study_design_scores_gemma":[0.000010248578,0.000057225418,0.0001439793,0.0000057084867,0.0000073688116,0.00001903827,0.000016833548,0.99430037,0.0008365197,0.003910743,0.0006893779,0.0000025948345],"about_ca_topic_score_codex":0.00069944846,"about_ca_topic_score_gemma":0.0017315727,"teacher_disagreement_score":0.0044049844,"about_ca_system_score_codex":0.00049908407,"about_ca_system_score_gemma":0.00025221103,"threshold_uncertainty_score":0.014736176},"labels":[],"label_agreement":null},{"id":"W4308659767","doi":"10.1109/vlsi-soc54400.2022.9939580","title":"Guiding FPGA Detailed Placement via Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Reinforcement learning; Computer science; Field-programmable gate array; Reinforcement; Computer architecture; Embedded system; Artificial intelligence; Engineering; Structural engineering","score_opus":0.017120597731932943,"score_gpt":0.21318589210845248,"score_spread":0.19606529437651954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308659767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04888596,0.00035103055,0.9412903,0.00032284443,0.00006452872,0.00007322663,0.000074218864,0.0026510523,0.0062868316],"genre_scores_gemma":[0.79000276,0.0001587004,0.20536144,0.00022559165,0.000027370688,0.00009503276,0.0001287095,0.00022626713,0.0037741303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00009755489,0.000014251535,0.00007546925,0.000117763135,0.00006892779],"domain_scores_gemma":[0.9988262,0.000656446,0.00013755525,0.00013549952,0.00018489617,0.000059368755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009254646,0.001024079,0.00061624695,0.00041262578,0.0003209613,0.00069665944,0.0010371982,0.0006986021,0.0036831745],"category_scores_gemma":[0.003089231,0.00044937307,0.00034583613,0.00031034055,0.0007446226,0.0007615848,0.0006618419,0.0010021591,0.00076565193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046362427,0.000024649542,0.00045563187,0.00002586938,0.000007891364,0.00002853393,0.000017270397,0.9578024,0.0013901289,0.0015831207,0.000995629,0.03762252],"study_design_scores_gemma":[0.000008786989,0.00002935697,0.000047466467,0.0000040065443,0.0000028243778,0.000010537683,0.0000047314365,0.99777406,0.0006139253,0.0010955362,0.00040632198,0.0000023689524],"about_ca_topic_score_codex":0.0049339635,"about_ca_topic_score_gemma":0.010276466,"teacher_disagreement_score":0.0049339635,"about_ca_system_score_codex":0.00092380005,"about_ca_system_score_gemma":0.0017893713,"threshold_uncertainty_score":0.012321472},"labels":[],"label_agreement":null},{"id":"W4310251946","doi":"10.1287/ijoc.2022.1248","title":"Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Integer programming; Branch and bound; Cutting-plane method; Branch and cut; Tree (set theory); Computer science; Simple (philosophy); Operations research; Linear programming; Search tree; Upper and lower bounds; Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Programming language; Epistemology","score_opus":0.05094025746411535,"score_gpt":0.2295837514378738,"score_spread":0.17864349397375845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310251946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055679935,0.009296783,0.94485885,0.016327564,0.0009053367,0.00016866914,0.0001737957,0.00032184483,0.022379212],"genre_scores_gemma":[0.09955859,0.024111865,0.8593238,0.0038987985,0.0019217454,0.00063189515,0.0008827905,0.0010280849,0.00864238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929322,0.0032873128,0.00029889765,0.0006077094,0.0025099234,0.00036396467],"domain_scores_gemma":[0.9800417,0.016531996,0.0005701442,0.0012542665,0.0012990779,0.00030290615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008900562,0.0013330698,0.001346792,0.0012704167,0.0014210525,0.0066532125,0.003114326,0.0036033753,0.011080015],"category_scores_gemma":[0.034933336,0.0013108379,0.0014816215,0.0029720992,0.0030094506,0.010701338,0.0038621542,0.012828108,0.0040576723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001513723,0.00012624204,0.0005154741,0.0008076536,0.000042220505,0.00024621663,0.00042011033,0.068205595,0.0010403037,0.5817242,0.027197134,0.31952348],"study_design_scores_gemma":[0.000040129955,0.00009628053,0.00015990851,0.00045609768,0.00001548804,0.00024212265,0.00029776967,0.09036665,0.001172938,0.8574009,0.049717184,0.0000344942],"about_ca_topic_score_codex":0.0012345038,"about_ca_topic_score_gemma":0.0013524888,"teacher_disagreement_score":0.011080015,"about_ca_system_score_codex":0.0011833665,"about_ca_system_score_gemma":0.0025379092,"threshold_uncertainty_score":0.047071278},"labels":[],"label_agreement":null},{"id":"W4312743307","doi":"10.1177/17483026221130680","title":"Using data-mining techniques to improve combinatorial optimization algorithms","year":2022,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Heuristics; Cluster analysis; Simulated annealing; Algorithm; Granularity; Data mining; Machine learning","score_opus":0.0296336662235397,"score_gpt":0.2934519870529521,"score_spread":0.2638183208294124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312743307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010293136,0.0005838523,0.9850781,0.0006063277,0.000101556274,0.00012702806,0.00019780941,0.0013426407,0.0016696554],"genre_scores_gemma":[0.07451958,0.00041710574,0.92314243,0.00026871724,0.00007325325,0.00022515505,0.00053671096,0.00023663223,0.0005804937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967636,0.0011139538,0.0003303105,0.0006006834,0.0010423864,0.00014896556],"domain_scores_gemma":[0.9854779,0.008646113,0.0009793747,0.0021947878,0.0025514865,0.00015024691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056331307,0.002353254,0.0019179016,0.004108284,0.0011022063,0.0024881528,0.002841245,0.0018221153,0.002265113],"category_scores_gemma":[0.025981953,0.0013988927,0.0022774865,0.003470595,0.001002098,0.0039881202,0.0015688938,0.0035184799,0.001056168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018200222,0.00043774594,0.005880488,0.00043006052,0.0004302238,0.00011733578,0.00015761933,0.684197,0.0035393753,0.02227756,0.0033207114,0.27902982],"study_design_scores_gemma":[0.00004418815,0.00007350037,0.00030775502,0.000044258664,0.00004548929,0.00004180818,0.000037537455,0.9710744,0.0031863826,0.02224529,0.0028842667,0.000015022208],"about_ca_topic_score_codex":0.0033683057,"about_ca_topic_score_gemma":0.00493694,"teacher_disagreement_score":0.0056331307,"about_ca_system_score_codex":0.0014959394,"about_ca_system_score_gemma":0.0023032627,"threshold_uncertainty_score":0.029791176},"labels":[],"label_agreement":null},{"id":"W4313854516","doi":"10.1109/icm56065.2022.10005468","title":"An Adaptive Sequential Decision Making Flow for FPGAs using Machine Learning","year":2022,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Computer science; Flow (mathematics); Design flow; Machine learning; Computer architecture; Artificial intelligence; Embedded system; Computer engineering","score_opus":0.03454467919921973,"score_gpt":0.2865079282869275,"score_spread":0.2519632490877078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313854516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032622432,0.00005870372,0.99550337,0.00003102796,0.000016106264,0.000041235333,0.00001566982,0.0005229083,0.00054878084],"genre_scores_gemma":[0.17788248,0.00011915345,0.8197722,0.000086754124,0.00004669842,0.00013808906,0.00009207623,0.00009098875,0.0017715917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995384,0.00011155462,0.000027531298,0.00011163401,0.00016263175,0.000048196558],"domain_scores_gemma":[0.99938905,0.00033862356,0.000060414295,0.00006544595,0.00012308505,0.000023381364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593766,0.00069820846,0.0005274133,0.000576742,0.0003576197,0.00055561046,0.0009594845,0.0005137549,0.0040395507],"category_scores_gemma":[0.0014869219,0.00032554567,0.0004112353,0.000440398,0.0003978494,0.0006186362,0.00039920016,0.0009890915,0.000677839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016315276,0.000098734585,0.0005454639,0.00013832195,0.00003903589,0.00008519997,0.00004450639,0.3869985,0.011364258,0.009478069,0.001817531,0.58922726],"study_design_scores_gemma":[0.000013303871,0.000060894257,0.00008672286,0.0000068797513,0.0000064127375,0.000027469187,0.000003977748,0.9916046,0.0037262663,0.0032891321,0.0011686301,0.000005725602],"about_ca_topic_score_codex":0.0022923583,"about_ca_topic_score_gemma":0.0033730199,"teacher_disagreement_score":0.0040395507,"about_ca_system_score_codex":0.00053687196,"about_ca_system_score_gemma":0.0011345067,"threshold_uncertainty_score":0.013513684},"labels":[],"label_agreement":null},{"id":"W4316924672","doi":"10.18609/cgti.2022.209","title":"Innovating in iPSC differentiation &amp; engineering","year":2022,"lang":"en","type":"article","venue":"Cell and Gene Therapy Insights","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chemistry; Cell biology; Engineering; Biology","score_opus":0.011583485698980522,"score_gpt":0.18147300390203616,"score_spread":0.16988951820305564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316924672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017166326,0.043083474,0.7698108,0.023162058,0.011340628,0.00021078603,0.0002606984,0.0013061588,0.13365903],"genre_scores_gemma":[0.12927608,0.07463467,0.519106,0.012628693,0.0038432456,0.0002386505,0.00035753698,0.00079451525,0.25912055],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856347,0.00014426878,0.00008300483,0.00017769681,0.0009664254,0.00006518064],"domain_scores_gemma":[0.99884194,0.0003598664,0.00008581141,0.000120567674,0.0004890163,0.000102795995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026233105,0.00042754746,0.00026045425,0.00079516787,0.00032397933,0.0019913255,0.000610955,0.00095629983,0.003696455],"category_scores_gemma":[0.0013537148,0.0002909989,0.00031703056,0.0006114158,0.0012198711,0.0014203956,0.00056700374,0.0018410507,0.0030292356],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000778986,0.000084907864,0.0010566456,0.00056705525,0.000024131587,0.0004789071,0.00048775694,0.002983577,0.14326829,0.14705694,0.05536256,0.6485512],"study_design_scores_gemma":[0.000013743184,0.00014763018,0.00037500073,0.000096703545,0.000016720405,0.0012234584,0.00011253961,0.0042425347,0.11229336,0.019363677,0.8620882,0.000026381615],"about_ca_topic_score_codex":0.0003625937,"about_ca_topic_score_gemma":0.0008672282,"teacher_disagreement_score":0.003696455,"about_ca_system_score_codex":0.0008147551,"about_ca_system_score_gemma":0.0006760371,"threshold_uncertainty_score":0.0138735175},"labels":[],"label_agreement":null},{"id":"W4318224776","doi":"10.29292/jics.v17i3.648","title":"Towards a Reference Place and Route Flow for Academic Research","year":2022,"lang":"en","type":"article","venue":"Journal of Integrated Circuits and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"CONTEST; Computer science; Routing (electronic design automation); Placement; Physical design; Convergence (economics); Flow (mathematics); Work (physics); Closure (psychology); Network routing; Quality (philosophy); Distributed computing; Computer engineering; Computer network; Circuit design; Embedded system; Mathematics; Mechanical engineering; Engineering","score_opus":0.09628015786767685,"score_gpt":0.32215874314364923,"score_spread":0.22587858527597238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318224776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021933261,0.0054532466,0.89638954,0.0077513396,0.0012437474,0.001014593,0.0028776163,0.023737848,0.0395988],"genre_scores_gemma":[0.05977878,0.0030467918,0.9155435,0.0010292763,0.00025664683,0.0006863835,0.008710665,0.0035908865,0.0073570753],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.978375,0.008856942,0.0016469802,0.002199158,0.0076118414,0.0013100913],"domain_scores_gemma":[0.95177704,0.007934617,0.0020123653,0.0132364,0.023577718,0.0014619173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027295994,0.0026626633,0.0014312256,0.0072971177,0.001951134,0.010703877,0.007099453,0.004347283,0.01544516],"category_scores_gemma":[0.065377496,0.0013347752,0.0013528314,0.009101858,0.0016304316,0.01258611,0.004109219,0.0039031345,0.016099973],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007199369,0.0012478401,0.0038562852,0.0019035077,0.00008569196,0.0002787257,0.0011867625,0.03935175,0.011090701,0.16799542,0.07795989,0.6943235],"study_design_scores_gemma":[0.00037571142,0.0015682399,0.0024627799,0.0023891067,0.00016298034,0.0005134098,0.001795103,0.1673751,0.045112874,0.1829035,0.5950904,0.00025086247],"about_ca_topic_score_codex":0.005742776,"about_ca_topic_score_gemma":0.0052296007,"teacher_disagreement_score":0.027295994,"about_ca_system_score_codex":0.0055319243,"about_ca_system_score_gemma":0.011670202,"threshold_uncertainty_score":0.14435673},"labels":[],"label_agreement":null},{"id":"W4318256895","doi":"10.1145/3557988.3569714","title":"A Machine Learning Approach for Accelerating SimPL-Based Global Placement for FPGA's","year":2022,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada); University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Process (computing); Upper and lower bounds; Parallel computing; Range (aeronautics); Algorithm; Embedded system; Operating system; Mathematics; Materials science","score_opus":0.029182161719011196,"score_gpt":0.2532017452201226,"score_spread":0.22401958350111142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318256895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013617795,0.00015785074,0.98007005,0.00011138176,0.000038790524,0.00004615988,0.000035960802,0.0038263414,0.0020956073],"genre_scores_gemma":[0.3617744,0.00014639385,0.63239986,0.00022296717,0.00007104886,0.00013622563,0.000278701,0.0002330529,0.004737404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995346,0.000065650034,0.00002274242,0.00009983492,0.00021384412,0.000063319894],"domain_scores_gemma":[0.99943763,0.00016036868,0.00009074079,0.000104271625,0.00017591835,0.000030992203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865867,0.0010495106,0.00077697565,0.0008162938,0.00050017424,0.00068507955,0.0014206182,0.0006879413,0.003556718],"category_scores_gemma":[0.0015849053,0.00041915115,0.0005200739,0.0006814591,0.00052718766,0.0007773301,0.00083981553,0.00093350804,0.0010844654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107278574,0.0000662359,0.00066232804,0.00005965909,0.000023179144,0.00004251531,0.000038445993,0.6691029,0.005894805,0.0036697967,0.002627046,0.3177058],"study_design_scores_gemma":[0.0000050724325,0.00002442242,0.00006501611,0.000001924006,0.000002315924,0.000013138357,0.0000038216785,0.99753726,0.0012031482,0.00071473577,0.00042674915,0.000002529003],"about_ca_topic_score_codex":0.0047148233,"about_ca_topic_score_gemma":0.008710507,"teacher_disagreement_score":0.0047148233,"about_ca_system_score_codex":0.0010319444,"about_ca_system_score_gemma":0.001507526,"threshold_uncertainty_score":0.011898458},"labels":[],"label_agreement":null},{"id":"W4318685218","doi":"10.1145/3566097.3567894","title":"Area-Driven FPGA Logic Synthesis Using Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the 28th Asia and South Pacific Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Netlist; Computer science; Reinforcement learning; Electronic circuit; Field-programmable gate array; Artificial intelligence; Algorithm; Computer hardware; Engineering","score_opus":0.04891981962249125,"score_gpt":0.23118123418274789,"score_spread":0.18226141456025663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318685218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11641528,0.00023387281,0.87341994,0.00028148046,0.000053813063,0.00015142432,0.00006364179,0.0015542285,0.007826343],"genre_scores_gemma":[0.87860495,0.000056161945,0.119168475,0.00010065676,0.000016952168,0.00011728016,0.00005807511,0.00005642161,0.0018209307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.00006696428,0.000010827244,0.00005552551,0.00008268978,0.00004904756],"domain_scores_gemma":[0.99905914,0.0005515447,0.00012069733,0.00008350977,0.00014903577,0.000036218935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144477,0.000623975,0.00045422456,0.000356226,0.00023151265,0.00040156752,0.0008804531,0.00051937986,0.001901654],"category_scores_gemma":[0.0019784577,0.0003151312,0.0003221864,0.00021072125,0.0005510471,0.00044774756,0.00040985705,0.00079672004,0.0002782728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027751288,0.000038939357,0.00042833254,0.000019431847,0.000011765998,0.000021236094,0.000011618878,0.97125906,0.0021574444,0.0012190613,0.00030636825,0.02449896],"study_design_scores_gemma":[0.0000071411246,0.00002040276,0.00004268288,0.0000019691017,0.0000021564276,0.00000487928,0.0000015231543,0.9985769,0.0006148985,0.0006070358,0.000119121745,0.000001265044],"about_ca_topic_score_codex":0.003938747,"about_ca_topic_score_gemma":0.0063132844,"teacher_disagreement_score":0.003938747,"about_ca_system_score_codex":0.0007500677,"about_ca_system_score_gemma":0.0010286612,"threshold_uncertainty_score":0.007831633},"labels":[],"label_agreement":null},{"id":"W4320802294","doi":"10.1109/ccdc55256.2022.10033897","title":"Gate-level Circuit Partitioning Algorithm Based on Cut Vertex and Betweenness Centrality","year":2022,"lang":"en","type":"article","venue":"2022 34th Chinese Control and Decision Conference (CCDC)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Betweenness centrality; Algorithm; Computer science; Vertex (graph theory); Logic gate; Centrality; Overhead (engineering); Parallel computing; Mathematics; Theoretical computer science; Combinatorics; Graph","score_opus":0.021940511106329535,"score_gpt":0.2359177682546239,"score_spread":0.21397725714829438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320802294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350741,0.0001618428,0.961364,0.00008928506,0.00002677137,0.00015451944,0.00009842407,0.00096784043,0.0036299108],"genre_scores_gemma":[0.40306446,0.00021106056,0.59102285,0.00007728573,0.000022208356,0.00028734992,0.00071172306,0.00024042484,0.004362567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996743,0.000039999948,0.000018968572,0.00008096048,0.00013467051,0.000051079103],"domain_scores_gemma":[0.9997094,0.00007950956,0.000026919053,0.000031211668,0.00013395499,0.000018994093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023075126,0.0007207577,0.0007334436,0.0013979218,0.0008042683,0.00090075773,0.0010646909,0.0005184233,0.0028402982],"category_scores_gemma":[0.0009011633,0.0003062279,0.0006003524,0.0009818719,0.00038217002,0.0010070624,0.00063742115,0.0004795945,0.0003889687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016875239,0.00009260211,0.002155458,0.00013926567,0.000076448814,0.00018176906,0.00020424862,0.612836,0.033308566,0.026863465,0.0039650043,0.32000843],"study_design_scores_gemma":[0.000025047335,0.000037420068,0.000277605,0.000006154068,0.00001751797,0.000084844985,0.00002869709,0.9865404,0.0060124043,0.005325905,0.0016345062,0.000009529244],"about_ca_topic_score_codex":0.00930507,"about_ca_topic_score_gemma":0.010618192,"teacher_disagreement_score":0.00930507,"about_ca_system_score_codex":0.0012292793,"about_ca_system_score_gemma":0.0014823017,"threshold_uncertainty_score":0.018501818},"labels":[],"label_agreement":null},{"id":"W4321021655","doi":"10.1109/tcad.2023.3245979","title":"Signal-Division-Aware Analog Circuit Topology Synthesis Aided by Transfer Learning","year":2023,"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":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; State Key Laboratory of Millimeter Waves; Canada Foundation for Innovation","keywords":"Computer science; Overhead (engineering); Division (mathematics); Topology (electrical circuits); High-level synthesis; Generalization; Network topology; Operational amplifier; Electronic engineering; Scheme (mathematics); Amplifier; Computer engineering; Engineering; Embedded system; Electrical engineering; Field-programmable gate array; Mathematics; Telecommunications; Arithmetic; Bandwidth (computing)","score_opus":0.02758136896053593,"score_gpt":0.2206906462353084,"score_spread":0.19310927727477248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321021655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014448806,0.00010131215,0.98011094,0.00006171856,0.000020939968,0.00006476493,0.000028639726,0.0016217775,0.0035411126],"genre_scores_gemma":[0.635389,0.000110797606,0.36115417,0.00012287474,0.000025298643,0.00015547822,0.0001399318,0.00013407535,0.0027683491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998342,0.0000280952,0.00000976827,0.00004661403,0.00006044288,0.00002089057],"domain_scores_gemma":[0.9996512,0.00014041118,0.000051960316,0.0000797363,0.00005928647,0.0000172991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035950472,0.00056987314,0.00035638595,0.00035878384,0.00022336077,0.00037565592,0.00079977297,0.00039055396,0.0036144312],"category_scores_gemma":[0.0008861358,0.00022673338,0.0003457097,0.0002769996,0.00042167478,0.0006712216,0.00054275914,0.0007766311,0.00061787455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092416696,0.000096563555,0.0006130656,0.00017435514,0.000033723463,0.00012788811,0.00009362832,0.48794374,0.06267574,0.011372853,0.0019131269,0.43486288],"study_design_scores_gemma":[0.000011235745,0.00005374858,0.00006907769,0.000004721256,0.00000608186,0.000041714262,0.0000055405603,0.98644817,0.009358118,0.0027500133,0.0012472518,0.0000043640043],"about_ca_topic_score_codex":0.00094603444,"about_ca_topic_score_gemma":0.0020027356,"teacher_disagreement_score":0.0036144312,"about_ca_system_score_codex":0.00044283518,"about_ca_system_score_gemma":0.00058937084,"threshold_uncertainty_score":0.012091458},"labels":[],"label_agreement":null},{"id":"W4362473375","doi":"10.3390/e25040597","title":"Gate-Level Circuit Partitioning Algorithm Based on Clustering and an Improved Genetic Algorithm","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Central South University; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Algorithm; Cluster analysis; Computer science; Genetic algorithm; Artificial intelligence; Machine learning","score_opus":0.023088189336178806,"score_gpt":0.23708410285821332,"score_spread":0.2139959135220345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362473375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018116713,0.00011024226,0.9790491,0.00007115264,0.000018059083,0.000058135985,0.00003091209,0.0005465758,0.0019991759],"genre_scores_gemma":[0.33285224,0.00019731764,0.6629313,0.00009940792,0.000023996454,0.00022366611,0.00032730508,0.00012461377,0.0032201072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995321,0.00008105371,0.000025001527,0.00011059147,0.00020093172,0.00005040458],"domain_scores_gemma":[0.9997197,0.00008269317,0.00002623775,0.000039802973,0.00011865725,0.00001292344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035445497,0.0006186898,0.00068861234,0.0011685035,0.0005830256,0.0005657508,0.0011597167,0.0007833955,0.001522692],"category_scores_gemma":[0.0010394447,0.00028108968,0.0006391366,0.0009824558,0.00042257013,0.00085213257,0.00054776116,0.0005653142,0.00031654284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007187801,0.000058219513,0.000989533,0.00006226208,0.000060625553,0.000069950554,0.000104229,0.73338056,0.022892598,0.016257662,0.0015506493,0.2245018],"study_design_scores_gemma":[0.00001633559,0.0000335135,0.00027346256,0.000004182408,0.000015065119,0.00006116008,0.000010208669,0.9919342,0.0034958625,0.0028500648,0.0012974758,0.000008526003],"about_ca_topic_score_codex":0.006428513,"about_ca_topic_score_gemma":0.0059291213,"teacher_disagreement_score":0.006428513,"about_ca_system_score_codex":0.0010882496,"about_ca_system_score_gemma":0.0011849734,"threshold_uncertainty_score":0.0127821565},"labels":[],"label_agreement":null},{"id":"W4362638787","doi":"10.1145/3590962","title":"CRP2.0: A Fast and Robust Cooperation between Routing and Placement in Advanced Technology Nodes","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Policy-based routing; Static routing; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Placement; Physical design; Multipath routing; Interdependence; Dynamic Source Routing; Computer network; Routing protocol; Embedded system","score_opus":0.018532246439521463,"score_gpt":0.23643783554779124,"score_spread":0.2179055891082698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362638787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023106059,0.0004696509,0.9550315,0.00024309025,0.000101638514,0.00026270415,0.0001730295,0.014641216,0.0059711607],"genre_scores_gemma":[0.18332171,0.00024018601,0.80977225,0.00020564113,0.000040367446,0.00027885032,0.00070004753,0.0011997962,0.004241177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792504,0.00047419922,0.00009065505,0.00028013848,0.0010107628,0.00021908616],"domain_scores_gemma":[0.9982393,0.00052280823,0.00021806665,0.0005635505,0.00034754738,0.0001085912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024389625,0.002097047,0.0009563272,0.0012409532,0.000680107,0.0016194793,0.0036117274,0.0012835994,0.0044566947],"category_scores_gemma":[0.0042470344,0.0009929215,0.001188999,0.00097376225,0.00064898405,0.0019911106,0.0026208113,0.0016982842,0.0015041499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032004013,0.00025709337,0.0022275331,0.00033612686,0.00012757961,0.0002707164,0.00020707761,0.5750328,0.022212373,0.017434562,0.02039218,0.36118194],"study_design_scores_gemma":[0.00004788186,0.00016563895,0.00030498134,0.00001841881,0.000027516437,0.00008015401,0.000031987158,0.9788174,0.00622475,0.0052628126,0.008994797,0.00002357366],"about_ca_topic_score_codex":0.0046748216,"about_ca_topic_score_gemma":0.008125604,"teacher_disagreement_score":0.0046748216,"about_ca_system_score_codex":0.0012717728,"about_ca_system_score_gemma":0.002954152,"threshold_uncertainty_score":0.014909148},"labels":[],"label_agreement":null},{"id":"W4364322167","doi":"10.1109/tsusc.2023.3263172","title":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Graph partition; Computer science; Critical path method; Longest path problem; Graph; Partition (number theory); Theoretical computer science; Parallel computing; Algorithm; Mathematics; Shortest path problem; Combinatorics; Engineering","score_opus":0.014743603443448921,"score_gpt":0.2775236043878273,"score_spread":0.26278000094437837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364322167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013461496,0.0008674279,0.98133105,0.00016965014,0.00006222021,0.00011939316,0.00016225208,0.0021981208,0.0016283215],"genre_scores_gemma":[0.31328467,0.00090643635,0.6802438,0.00022870877,0.000112119524,0.0002779835,0.0013307059,0.0005836444,0.003031924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.000084553234,0.000030003535,0.00014630026,0.00021624105,0.00006743782],"domain_scores_gemma":[0.9986513,0.00046582092,0.00022863646,0.00032132494,0.00027012228,0.00006279851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672589,0.0012346273,0.00061963167,0.0022583297,0.0008401673,0.00080313213,0.0011154297,0.00057911914,0.0022212616],"category_scores_gemma":[0.0021908404,0.00047631445,0.0010036955,0.0017736811,0.00061024877,0.0018508452,0.0011686344,0.0012522879,0.00069565495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023916141,0.00015843516,0.0019415575,0.00045179672,0.00012528808,0.00040096542,0.0005007772,0.26236132,0.05608243,0.029489588,0.016764635,0.6314841],"study_design_scores_gemma":[0.000056357556,0.0001511008,0.0014649209,0.00005985915,0.000085674386,0.00046671802,0.0003074015,0.8859427,0.031248873,0.053546637,0.026625244,0.000044480104],"about_ca_topic_score_codex":0.0033738199,"about_ca_topic_score_gemma":0.005839551,"teacher_disagreement_score":0.0033738199,"about_ca_system_score_codex":0.00079176424,"about_ca_system_score_gemma":0.0014163496,"threshold_uncertainty_score":0.0074308515},"labels":[],"label_agreement":null},{"id":"W4366724629","doi":"10.1109/mdat.2023.3250618","title":"Interview With Prof. Sung-Mo (Steve) Kang","year":2023,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Library science; Management; Supervisor; Engineering; Telecommunications; Art history; Sociology; Art; Computer science","score_opus":0.03209006010813522,"score_gpt":0.22322703486375514,"score_spread":0.19113697475561992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366724629","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052127414,0.008012029,0.0009063255,0.92992294,0.02957308,0.00025817496,0.0006440803,0.00030456,0.02516619],"genre_scores_gemma":[0.028708905,0.0082635665,0.0010547612,0.79791224,0.008648543,0.00091087143,0.00037588485,0.000228592,0.15389661],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992404,0.00025406614,0.000035895573,0.000121581244,0.0001635036,0.00018457953],"domain_scores_gemma":[0.99545777,0.0006475278,0.00014242418,0.000050544226,0.0015958657,0.0021059252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020731664,0.00071205705,0.0007575044,0.0006748362,0.0050644195,0.001908284,0.00080943265,0.0050703073,0.05129622],"category_scores_gemma":[0.007977723,0.00047796406,0.0004022062,0.0006438681,0.0009045936,0.0028015743,0.0018364465,0.010478406,0.0232671],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002234237,0.000032731066,0.00035729216,0.000047062615,0.000001873378,0.00024940635,0.00083737756,0.000024782006,0.00010581165,0.0002528582,0.9909184,0.0071499706],"study_design_scores_gemma":[0.000018981653,0.00006434786,0.001507777,0.00018706046,0.000004573317,0.0013552392,0.010901416,0.000102923645,0.00013096852,0.00034454837,0.9853448,0.00003731051],"about_ca_topic_score_codex":0.010077178,"about_ca_topic_score_gemma":0.016242482,"teacher_disagreement_score":0.05129622,"about_ca_system_score_codex":0.0031836864,"about_ca_system_score_gemma":0.004078855,"threshold_uncertainty_score":0.17160296},"labels":[],"label_agreement":null},{"id":"W4368232696","doi":"10.1109/tcad.2023.3272582","title":"Koios 2.0: Open-Source Deep Learning Benchmarks for FPGA Architecture and CAD Research","year":2023,"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":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"Vector Institute; VMware; National Science Foundation","keywords":"Benchmark (surveying); Field-programmable gate array; Computer science; Computer architecture; Suite; CAD; Computer engineering; Verilog; Electronic design automation; Embedded system; Parallel computing; Engineering","score_opus":0.0593460382996578,"score_gpt":0.2861478695518774,"score_spread":0.2268018312522196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368232696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40852436,0.011095111,0.23267417,0.0017720136,0.0011085446,0.0013265733,0.08849537,0.1620862,0.09291771],"genre_scores_gemma":[0.51374733,0.003396893,0.2662179,0.00080176647,0.00010994886,0.0016976391,0.18847826,0.014156771,0.011393533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806255,0.00041177182,0.00022949686,0.00021771471,0.00086245907,0.00021602456],"domain_scores_gemma":[0.9960855,0.0016984484,0.0003504686,0.00064986787,0.0010684311,0.00014735415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020778775,0.0026887294,0.00052607275,0.0026880659,0.0004452757,0.0012387596,0.0037668343,0.001215851,0.006096166],"category_scores_gemma":[0.008184131,0.0007190011,0.0008968432,0.0035228692,0.00059088075,0.0013929562,0.0010611714,0.001581976,0.0026254398],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016817271,0.0011590468,0.017866656,0.0042560785,0.00043618103,0.0005800027,0.00028544365,0.4187007,0.020256484,0.025398014,0.2864546,0.22292514],"study_design_scores_gemma":[0.00073583284,0.0009961706,0.009290163,0.00035443492,0.00013124928,0.0004753169,0.00017744466,0.7733185,0.05895474,0.017045284,0.13839713,0.00012374409],"about_ca_topic_score_codex":0.007815848,"about_ca_topic_score_gemma":0.012500231,"teacher_disagreement_score":0.007815848,"about_ca_system_score_codex":0.0016056095,"about_ca_system_score_gemma":0.0017804862,"threshold_uncertainty_score":0.02039367},"labels":[],"label_agreement":null},{"id":"W4378800899","doi":"10.1145/3583781.3590312","title":"RL-Ripper:","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Calgary","funders":"","keywords":"Computer science; Reinforcement learning; Heuristics; Routing (electronic design automation); Heuristic; Distributed computing; Artificial intelligence; Computer network","score_opus":0.00907235228150013,"score_gpt":0.19239736923045025,"score_spread":0.18332501694895012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378800899","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011368319,0.000773442,0.9655731,0.00028683152,0.00014187791,0.00016320114,0.00018653058,0.011085117,0.010421665],"genre_scores_gemma":[0.3794111,0.00085989974,0.60019726,0.0007627348,0.00012964467,0.00050811924,0.0008009172,0.002081977,0.015248346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937135,0.0001520175,0.00003652702,0.00016515577,0.00019063921,0.000084331914],"domain_scores_gemma":[0.9986625,0.0006534205,0.00014957509,0.0002643431,0.00021696607,0.000053385098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044471,0.0014375055,0.0010590269,0.0006833089,0.00042976384,0.0011785058,0.0025259254,0.0013434254,0.008887768],"category_scores_gemma":[0.0034054047,0.0005735078,0.0008558497,0.0004503888,0.00096578355,0.0014472819,0.0013300052,0.0019269427,0.0025586854],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016283382,0.00013762171,0.0011358395,0.00031259574,0.000113484704,0.00011080479,0.00006811625,0.7523952,0.005649883,0.013102084,0.011212456,0.21559891],"study_design_scores_gemma":[0.000029014116,0.00011144299,0.00009647172,0.000020651305,0.0000220705,0.00005767208,0.000012062249,0.9865031,0.003609562,0.0044620903,0.0050611966,0.0000146086495],"about_ca_topic_score_codex":0.003135821,"about_ca_topic_score_gemma":0.005957016,"teacher_disagreement_score":0.008887768,"about_ca_system_score_codex":0.0008349562,"about_ca_system_score_gemma":0.0014994458,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4380610161","doi":"10.12737/2219-0767-2023-16-2-85-93","title":"Routing buses impact analysis on the results on modeling standard digital cell on CMOS 28 nm","year":2023,"lang":"en","type":"article","venue":"Modeling of systems and processes","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mitel (Canada)","funders":"","keywords":"Netlist; Routing (electronic design automation); Standard cell; Standard deviation; Set (abstract data type); Computer science; Simulation; CMOS; Real-time computing; Algorithm; Electronic engineering; Embedded system; Statistics; Integrated circuit; Engineering; Mathematics","score_opus":0.033232416721153415,"score_gpt":0.2527429747662627,"score_spread":0.21951055804510927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380610161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8605681,0.0007256259,0.126742,0.0001517725,0.0000422227,0.000037783775,0.00061153696,0.0011274489,0.009993508],"genre_scores_gemma":[0.98846984,0.00023256979,0.009633129,0.000019340776,0.000004875348,0.000014320237,0.0002396763,0.00011854488,0.0012677353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982685,0.00004206985,0.0000081110975,0.000028641552,0.00006971227,0.000024588322],"domain_scores_gemma":[0.9993374,0.00039105435,0.00006217453,0.000076845325,0.00012447203,0.000008033595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002402962,0.0004124003,0.00018645515,0.00031194536,0.00014777081,0.00030437292,0.00038874702,0.00031043318,0.001957328],"category_scores_gemma":[0.0013830133,0.00012668097,0.00038213885,0.00030353718,0.00013411492,0.00045145673,0.00014675768,0.00018236817,0.00030383078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001975449,0.00003340132,0.006193325,0.00030936234,0.000060269278,0.0003745327,0.00015565778,0.8671994,0.09309111,0.003918741,0.00066227745,0.027804397],"study_design_scores_gemma":[0.000007149989,0.0002742841,0.0024710917,0.000017863342,0.000071914816,0.00015064198,0.000058956026,0.90075386,0.09221653,0.00087181776,0.003091194,0.000014758149],"about_ca_topic_score_codex":0.0027832321,"about_ca_topic_score_gemma":0.0034763848,"teacher_disagreement_score":0.0027832321,"about_ca_system_score_codex":0.00047568834,"about_ca_system_score_gemma":0.0002951836,"threshold_uncertainty_score":0.006547928},"labels":[],"label_agreement":null},{"id":"W4382403108","doi":"10.3390/designs7040082","title":"Optimal Domain-Partitioning Algorithm for Real-Life Transportation Networks and Finite Element Meshes","year":2023,"lang":"en","type":"article","venue":"Designs","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Polygon mesh; Finite element method; Computer science; Algorithm; Tetrahedron; Heuristic; Volume mesh; Mathematical optimization; Mesh generation; Mathematics; Engineering; Structural engineering; Geometry","score_opus":0.02558619326825956,"score_gpt":0.24935381494174144,"score_spread":0.22376762167348188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382403108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031809646,0.00008255348,0.99485403,0.000038595917,0.000017428876,0.000026273361,0.000019996296,0.00019258488,0.0015875736],"genre_scores_gemma":[0.08480703,0.0001444802,0.9124681,0.00004283627,0.000012922356,0.0001695793,0.00017844836,0.0001212295,0.002055287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997769,0.000056732704,0.000013453305,0.00004665739,0.000079355996,0.000026863498],"domain_scores_gemma":[0.9997805,0.00008912045,0.000022742679,0.000032187156,0.00006446927,0.000010956405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036244336,0.00050657074,0.00040575708,0.00068295765,0.00041545814,0.0005246636,0.0007285911,0.0006120448,0.0033468653],"category_scores_gemma":[0.0009941397,0.0002470651,0.00043689585,0.0005988773,0.000427767,0.00062291796,0.00062826823,0.00058794237,0.0009182207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086630695,0.000052950123,0.0006598138,0.0001758636,0.000027031718,0.000089811205,0.00016067205,0.68238044,0.010401035,0.04428081,0.0049492363,0.25673565],"study_design_scores_gemma":[0.000011045756,0.000017166167,0.00008928962,0.000009989778,0.0000041555677,0.00004797545,0.000026617923,0.983958,0.0024775462,0.008412875,0.0049400693,0.000005269507],"about_ca_topic_score_codex":0.0026142893,"about_ca_topic_score_gemma":0.003386523,"teacher_disagreement_score":0.0033468653,"about_ca_system_score_codex":0.00055630784,"about_ca_system_score_gemma":0.0007932981,"threshold_uncertainty_score":0.011196375},"labels":[],"label_agreement":null},{"id":"W4383749638","doi":"10.1109/fccm57271.2023.00057","title":"Reformulating the FPGA Routability Prediction Problem with Machine Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Routing (electronic design automation); Computer science; Compiler; Programmable logic array; Embedded system; Field (mathematics); Computer architecture; Gate array; Programmable Array Logic; Logic synthesis; Parallel computing; Computer engineering; Logic gate; Algorithm; Operating system; Mathematics","score_opus":0.010037119380978182,"score_gpt":0.19598174461832527,"score_spread":0.1859446252373471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383749638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022449415,0.0006882159,0.96417314,0.0016216883,0.00019898664,0.00007332964,0.00039313818,0.0008198128,0.009582252],"genre_scores_gemma":[0.71940243,0.0013779224,0.25736484,0.00065969996,0.0007038624,0.00021157661,0.0012434017,0.00053541927,0.018500896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.00039182254,0.000058462203,0.0003834263,0.0003904856,0.0002554552],"domain_scores_gemma":[0.99360967,0.0044631865,0.00047128755,0.00068093085,0.00066518533,0.000109756846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019793098,0.0011514554,0.0011988241,0.0010240191,0.00061969925,0.0017074122,0.0022297555,0.0017889217,0.010802677],"category_scores_gemma":[0.013617044,0.00086263695,0.00088687957,0.0014961567,0.001384055,0.0042790496,0.0015583453,0.0029178371,0.0013680239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087705135,0.00005124149,0.0011628992,0.00013020966,0.00003101987,0.00017337337,0.000042467,0.8606589,0.0005357635,0.048585862,0.007162744,0.08137784],"study_design_scores_gemma":[0.000009281277,0.000014909279,0.00013894612,0.000014807385,0.0000061189603,0.000032114825,0.000011370401,0.958813,0.00028623882,0.03962508,0.001042749,0.000005457326],"about_ca_topic_score_codex":0.01080758,"about_ca_topic_score_gemma":0.009739236,"teacher_disagreement_score":0.01080758,"about_ca_system_score_codex":0.0017353576,"about_ca_system_score_gemma":0.0019359124,"threshold_uncertainty_score":0.036138594},"labels":[],"label_agreement":null},{"id":"W4384158358","doi":"10.1109/aiiot58121.2023.10174303","title":"Path Balancing for Reducing Dynamic Power Consumption in Digital Designs Containing IP-Blocks","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Computational complexity theory; Path (computing); Computation; Power (physics); Combinational logic; Integer programming; Digital electronics; Integer (computer science); Parallel computing; Logic gate; Algorithm; Electronic circuit; Engineering","score_opus":0.02025489193778845,"score_gpt":0.25567357867198487,"score_spread":0.23541868673419641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384158358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06493512,0.0012202308,0.92415965,0.00020194933,0.00006546213,0.00012641221,0.000080286234,0.00110662,0.00810434],"genre_scores_gemma":[0.69076127,0.0008442201,0.30141693,0.00017322232,0.000057433357,0.00016379288,0.00014873715,0.0003638773,0.006070585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996755,0.00007690007,0.000019943649,0.00005763588,0.00010494036,0.00006512174],"domain_scores_gemma":[0.9996599,0.00016293128,0.00006045603,0.000046581692,0.000051867497,0.00001828645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036626868,0.0010983689,0.0003615592,0.00079302746,0.00047252732,0.0007565003,0.00094010244,0.00036572196,0.005843691],"category_scores_gemma":[0.0010510294,0.00034434808,0.00043923684,0.0008465081,0.0002950086,0.0012829126,0.00055925734,0.00049134047,0.0006781898],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058044144,0.00022132511,0.0012001978,0.00058655697,0.0001032737,0.00031067664,0.00025225888,0.31465608,0.19232945,0.031726874,0.0035728274,0.45446008],"study_design_scores_gemma":[0.000096986936,0.0010959787,0.0008119808,0.00009175536,0.0002482551,0.0006148628,0.00012586704,0.8352431,0.1084546,0.029640378,0.023529023,0.000047214096],"about_ca_topic_score_codex":0.0007211479,"about_ca_topic_score_gemma":0.0021546674,"teacher_disagreement_score":0.005843691,"about_ca_system_score_codex":0.0006057529,"about_ca_system_score_gemma":0.00078516523,"threshold_uncertainty_score":0.019549131},"labels":[],"label_agreement":null},{"id":"W4384833499","doi":"10.1145/3597031.3597054","title":"Breaking Boundaries: Optimizing FPGA CAD with Flexible and Multi-threaded Re-Clustering","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Generality; Design flow; CAD; Limiting; Electronic design automation; Cluster analysis; Block (permutation group theory); Embedded system; Engineering drawing; Engineering; Artificial intelligence","score_opus":0.0328468532435029,"score_gpt":0.2516286160893555,"score_spread":0.2187817628458526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384833499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14223816,0.00093931536,0.83288413,0.00022594535,0.000111572575,0.00016548244,0.00009744107,0.0052027507,0.01813525],"genre_scores_gemma":[0.6100728,0.00027211805,0.3836871,0.000104186605,0.000022611299,0.000096958334,0.00027227952,0.00081934733,0.0046526287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993585,0.000077110795,0.000032862314,0.00010289694,0.000306638,0.000122032994],"domain_scores_gemma":[0.99925107,0.00017385579,0.000096380805,0.00028498983,0.00015503232,0.000038719434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046995273,0.00072695327,0.000490991,0.0006311012,0.00040504948,0.0010280743,0.0014713136,0.0005657282,0.003465007],"category_scores_gemma":[0.002203936,0.0003891994,0.0002986151,0.00075075205,0.00043923163,0.0014054853,0.0009624596,0.00069123216,0.0012407387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022361199,0.00014601838,0.0015762001,0.00019334543,0.00003548768,0.00017536481,0.00026079925,0.5101861,0.060440313,0.013615278,0.004876744,0.40827078],"study_design_scores_gemma":[0.000032981323,0.00020464545,0.0008046797,0.000026021866,0.000018885201,0.00012927644,0.00008291575,0.95640105,0.02831408,0.0054043815,0.00855863,0.000022482194],"about_ca_topic_score_codex":0.0022220523,"about_ca_topic_score_gemma":0.0046096267,"teacher_disagreement_score":0.003465007,"about_ca_system_score_codex":0.0007604717,"about_ca_system_score_gemma":0.0010625573,"threshold_uncertainty_score":0.011591554},"labels":[],"label_agreement":null},{"id":"W4385831788","doi":"10.1109/icet58434.2023.10211575","title":"A Partitioning Algorithm Based-on Vertex-degree of Undirected Graph for VLSI Circuit Simulations","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Very-large-scale integration; Graph partition; Adjacency list; Partition (number theory); Algorithm; Computer science; Electronic circuit; Vertex (graph theory); Cluster analysis; Breadth-first search; Undirected graph; Graph; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.04946002213238111,"score_gpt":0.2583337447833242,"score_spread":0.20887372265094312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385831788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010166684,0.000068747504,0.98782444,0.000027479746,0.000015784564,0.000038868468,0.000034967765,0.0004213378,0.0014017344],"genre_scores_gemma":[0.28026295,0.00030258388,0.7170315,0.00003262696,0.000016031481,0.00020453143,0.0002854653,0.00016450117,0.0016997561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983394,0.000039106435,0.000010448307,0.000035314053,0.000063879546,0.00001722536],"domain_scores_gemma":[0.9998287,0.00006404586,0.000018904639,0.000025625122,0.000053161853,0.000009532712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019280995,0.00063162984,0.0003727539,0.00066204654,0.00045603412,0.00045996116,0.0007676273,0.00034642976,0.0013156314],"category_scores_gemma":[0.0007250427,0.00026954725,0.00047299304,0.0005676835,0.00028489606,0.0007753695,0.00041045863,0.00040551287,0.00025004035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044900124,0.000028166729,0.00096801453,0.00008292696,0.000036296682,0.00005515567,0.000083011546,0.86070615,0.016188478,0.021575294,0.0009481989,0.09928342],"study_design_scores_gemma":[0.000006894923,0.000022899743,0.00013676455,0.0000048859742,0.000008257574,0.000033087992,0.000012292408,0.9908076,0.0038988988,0.0033719158,0.0016900685,0.0000064903143],"about_ca_topic_score_codex":0.0041312776,"about_ca_topic_score_gemma":0.005679158,"teacher_disagreement_score":0.0041312776,"about_ca_system_score_codex":0.0005554296,"about_ca_system_score_gemma":0.0007212015,"threshold_uncertainty_score":0.008214474},"labels":[],"label_agreement":null},{"id":"W4385834439","doi":"10.1109/tcad.2023.3305579","title":"ILPGRC: ILP-Based Global Routing Optimization With Cell Movements","year":2023,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Routing (electronic design automation); Computer science; Scalability; Integer programming; Speedup; Convergence (economics); Mathematical optimization; Parallel computing; Electronic circuit; Distributed computing; Algorithm; Mathematics; Embedded system; Engineering","score_opus":0.02085004310382225,"score_gpt":0.20937510457765235,"score_spread":0.1885250614738301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385834439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009933076,0.00023898725,0.983115,0.000120786186,0.00005208383,0.000066583896,0.000092226765,0.0018441326,0.0045371256],"genre_scores_gemma":[0.3441067,0.0002840262,0.6472007,0.0003178865,0.000058100617,0.0004175018,0.00062372524,0.0011517798,0.0058395197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.00015648885,0.00001718134,0.00010072211,0.00015454466,0.0000869905],"domain_scores_gemma":[0.99937314,0.00037727488,0.00007533346,0.00008003489,0.00007168249,0.000022507335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077043666,0.0017502968,0.0010711362,0.0006460321,0.00043790447,0.00085430004,0.0014293302,0.0010056323,0.0061117816],"category_scores_gemma":[0.0014073317,0.0005688751,0.0009981951,0.00069837313,0.00076762546,0.0008992386,0.0011119451,0.0014637734,0.0007395169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036276764,0.000023960172,0.00011574295,0.000051161605,0.000020020503,0.000041615163,0.000024204051,0.9724114,0.0021588716,0.00310365,0.0013211744,0.020691894],"study_design_scores_gemma":[0.000012090161,0.000025245685,0.000020669047,0.000004088124,0.000006739759,0.000010711779,0.000006377395,0.9967444,0.0007638879,0.0015934004,0.0008095259,0.0000028066281],"about_ca_topic_score_codex":0.0037883827,"about_ca_topic_score_gemma":0.0041776174,"teacher_disagreement_score":0.0061117816,"about_ca_system_score_codex":0.0007582291,"about_ca_system_score_gemma":0.0013299272,"threshold_uncertainty_score":0.020445883},"labels":[],"label_agreement":null},{"id":"W4386159713","doi":"10.1109/iseda59274.2023.10218622","title":"A Multi-Objective Optimization Algorithm Based on Deep Learning for Circuit Partition","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Partition (number theory); Computer science; Algorithm; Partition problem; Graph; Theoretical computer science; Mathematics","score_opus":0.021871157752923785,"score_gpt":0.24099475528251896,"score_spread":0.21912359752959518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386159713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01554561,0.00031946637,0.98085487,0.00018759658,0.000040208342,0.000070597795,0.00006467942,0.0011084008,0.0018086468],"genre_scores_gemma":[0.39294162,0.00023749705,0.5992762,0.00049699715,0.00006607249,0.00054900517,0.0006136148,0.0003060149,0.005512985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996631,0.00006375586,0.000019798412,0.00010140911,0.00007880648,0.00007316424],"domain_scores_gemma":[0.99957055,0.00023787352,0.000041832216,0.0000291897,0.000091768954,0.000028798113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065472187,0.001636433,0.0014965757,0.0010681195,0.00049668463,0.0006943442,0.0016439,0.0016134284,0.003993617],"category_scores_gemma":[0.0013490635,0.0007202434,0.00088978495,0.0009869674,0.0005569336,0.0011522982,0.0011277061,0.0016418345,0.00050725904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007453877,0.00008401978,0.00049251225,0.000058348298,0.000049910468,0.00003604587,0.00002688837,0.84006023,0.0017898573,0.003081484,0.0022076792,0.15203844],"study_design_scores_gemma":[0.000007510766,0.000013576746,0.000025118372,0.0000021396556,0.0000030231588,0.0000037261457,0.0000022003035,0.9989261,0.00018759786,0.0006914529,0.00013621352,0.0000013707346],"about_ca_topic_score_codex":0.008703687,"about_ca_topic_score_gemma":0.010780905,"teacher_disagreement_score":0.008703687,"about_ca_system_score_codex":0.0012797937,"about_ca_system_score_gemma":0.001844776,"threshold_uncertainty_score":0.01730603},"labels":[],"label_agreement":null},{"id":"W4386828169","doi":"10.1007/s11590-023-02058-w","title":"Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Line (geometry); Constant (computer programming); Approximation algorithm; Line segment; Discrete mathematics; Euclidean geometry; Point (geometry); Tree (set theory); Computer science; Geometry","score_opus":0.010013078112781465,"score_gpt":0.21826461661679858,"score_spread":0.20825153850401712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386828169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02898165,0.0005097138,0.9608592,0.00045361955,0.00008994957,0.000097826494,0.00029290473,0.0011217592,0.0075934064],"genre_scores_gemma":[0.2241326,0.00037910967,0.76991254,0.00017882213,0.000063856714,0.00024124107,0.00091002363,0.00016126095,0.004020619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944216,0.0001427,0.00002838349,0.00009188247,0.00017191119,0.0001229065],"domain_scores_gemma":[0.99923694,0.00041819827,0.000088925925,0.000100708436,0.00011060415,0.00004452234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639462,0.0009713863,0.0012297361,0.0010753731,0.00061371835,0.0011131909,0.0017843082,0.0014850795,0.008419405],"category_scores_gemma":[0.0024832,0.000535742,0.0007657883,0.0021691395,0.00037672996,0.0018068539,0.0010676892,0.001392894,0.0013018288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006134434,0.0003027773,0.0010666358,0.00034242807,0.000092615745,0.00015905587,0.00018263621,0.6753863,0.006123317,0.027144818,0.015076218,0.27350977],"study_design_scores_gemma":[0.00008795659,0.00009059489,0.0001999251,0.00001915341,0.000020226427,0.00009667966,0.000049269634,0.9864201,0.00094004185,0.010219359,0.0018475092,0.000009211712],"about_ca_topic_score_codex":0.0038132423,"about_ca_topic_score_gemma":0.0057074195,"teacher_disagreement_score":0.008419405,"about_ca_system_score_codex":0.0012075348,"about_ca_system_score_gemma":0.0015405935,"threshold_uncertainty_score":0.028165698},"labels":[],"label_agreement":null},{"id":"W4387123818","doi":"10.1109/sbcci60457.2023.10261650","title":"FPGA Placement: Dynamic Decision Making Via Machine Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Netlist; Field-programmable gate array; Computer science; Placement; Set (abstract data type); Design flow; Multi-core processor; Parallel computing; Central processing unit; Embedded system; Computer architecture; Computer engineering; Physical design; Computer hardware; Circuit design","score_opus":0.00851885835249342,"score_gpt":0.24872406537069874,"score_spread":0.24020520701820533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387123818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03294048,0.00033815517,0.9583317,0.00042441575,0.000074378135,0.00012569573,0.00010418078,0.0029679516,0.004693029],"genre_scores_gemma":[0.6385511,0.00023952492,0.35750917,0.0003271475,0.00011192074,0.00017189785,0.0002793716,0.0001920441,0.0026179678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992931,0.00022005683,0.00003847653,0.00017434628,0.00017822767,0.00009578183],"domain_scores_gemma":[0.99784064,0.0014471983,0.00020722025,0.0001738775,0.00027727732,0.000053799537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049894,0.0009261139,0.0008052341,0.0008286522,0.0004798506,0.00092237483,0.0014426777,0.0008557881,0.004446387],"category_scores_gemma":[0.0040229904,0.000482881,0.0004441483,0.00064967346,0.00056238525,0.0011409759,0.00072673993,0.0013671148,0.0009812126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000182157,0.00017731581,0.0012965474,0.000083243714,0.000038442842,0.00005668949,0.000038471815,0.6346683,0.003777319,0.0031138153,0.0038500114,0.35271776],"study_design_scores_gemma":[0.000011455165,0.000025525154,0.000091075395,0.000005206796,0.0000037547557,0.000009951916,0.000006751223,0.9963766,0.001098149,0.0020104267,0.00035727373,0.0000038740623],"about_ca_topic_score_codex":0.0036949064,"about_ca_topic_score_gemma":0.007051478,"teacher_disagreement_score":0.004446387,"about_ca_system_score_codex":0.0010756729,"about_ca_system_score_gemma":0.0016509058,"threshold_uncertainty_score":0.014874637},"labels":[],"label_agreement":null},{"id":"W4387164718","doi":"10.1109/tcad.2023.3320984","title":"Statistical Hardware Design With Multimodel Active Learning","year":2023,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Computer science; Design space exploration; Field-programmable gate array; Machine learning; Bayesian optimization; Computer engineering; Hardware architecture; Statistical model; Artificial intelligence; Computer hardware; Embedded system; Software","score_opus":0.036241633955858256,"score_gpt":0.23054797562275114,"score_spread":0.1943063416668929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387164718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027631584,0.00007363958,0.9961099,0.00008318697,0.000013343786,0.00001730639,0.000018339608,0.0004352125,0.00048591418],"genre_scores_gemma":[0.44341302,0.00019396603,0.55235004,0.0003200647,0.00006519529,0.00039674982,0.00023336333,0.00021311697,0.0028144752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992188,0.00028752818,0.000038616516,0.0001480088,0.00024219784,0.0000648819],"domain_scores_gemma":[0.9970521,0.0019278559,0.00024309053,0.00025898629,0.00044156212,0.00007645405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017098498,0.00095969334,0.0009363752,0.00083749613,0.0003193555,0.0010534022,0.0018059321,0.0013403778,0.0024594527],"category_scores_gemma":[0.0047832127,0.00077298924,0.0009654307,0.000627694,0.00073538115,0.0012119157,0.0009482924,0.0017976047,0.00061096257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003623335,0.000035252317,0.00028870325,0.00003306552,0.000026803564,0.000016430678,0.000024043109,0.9461077,0.0010586942,0.003962178,0.00048590262,0.047925003],"study_design_scores_gemma":[0.0000023687974,0.000006664283,0.000010528736,0.0000011252757,0.0000011073399,0.0000018957609,9.00036e-7,0.9985084,0.00024422645,0.0011087782,0.00011267127,0.0000012324838],"about_ca_topic_score_codex":0.0022725132,"about_ca_topic_score_gemma":0.0031973897,"teacher_disagreement_score":0.0024594527,"about_ca_system_score_codex":0.00090793375,"about_ca_system_score_gemma":0.001101758,"threshold_uncertainty_score":0.00904268},"labels":[],"label_agreement":null},{"id":"W4388214731","doi":"10.1109/fpl60245.2023.00016","title":"Titan 2.0: Enabling Open-Source CAD Evaluation with a Modern Architecture Capture","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Stratix; Titan (rocket family); Computer science; Field-programmable gate array; Architecture; Computer architecture; Embedded system; Benchmarking; Parallel computing; Memory footprint; Operating system; Engineering","score_opus":0.024588631513883373,"score_gpt":0.2565920021842202,"score_spread":0.2320033706703368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388214731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15573676,0.0012257469,0.5336214,0.0006634716,0.0007556337,0.0010827922,0.016367266,0.21667053,0.073876396],"genre_scores_gemma":[0.46192008,0.0009817677,0.42270803,0.0005820832,0.0001056672,0.0010506605,0.057579055,0.03704622,0.018026544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860966,0.00022271482,0.000079080484,0.00011915747,0.0008346094,0.00013481453],"domain_scores_gemma":[0.99809617,0.0006831053,0.000117391544,0.00049398094,0.0005501084,0.00005924349],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020898608,0.0012276412,0.00036352302,0.0013383942,0.00032941982,0.0010943422,0.002019334,0.00059235137,0.018930258],"category_scores_gemma":[0.005425899,0.0007190268,0.0007610012,0.0010882874,0.00038785863,0.0011743685,0.0010351948,0.0010477179,0.0032173526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012404897,0.0007840944,0.012608574,0.001670795,0.00034023143,0.0007287446,0.0008472504,0.22605701,0.044457924,0.03302347,0.284106,0.3941355],"study_design_scores_gemma":[0.0005251816,0.00082507037,0.007505763,0.0002370536,0.00009242412,0.0006286704,0.00019780124,0.7184879,0.059724968,0.009360563,0.2022451,0.00016946386],"about_ca_topic_score_codex":0.004697418,"about_ca_topic_score_gemma":0.0074936096,"teacher_disagreement_score":0.99798065,"about_ca_system_score_codex":0.00088080764,"about_ca_system_score_gemma":0.0014063871,"threshold_uncertainty_score":0.06332803},"labels":[],"label_agreement":null},{"id":"W4388214753","doi":"10.1109/fpl60245.2023.00026","title":"Tear Down The Wall: Unified and Efficient Intra-and Inter-Cluster Routing for FPGAs","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Router; Routing (electronic design automation); Static routing; Field-programmable gate array; Distributed computing; Computer network; Embedded system; Parallel computing; Routing protocol","score_opus":0.013278907193128237,"score_gpt":0.2267734085530284,"score_spread":0.21349450135990017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388214753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3353145,0.002492115,0.623927,0.00046163108,0.00016227014,0.00018203245,0.0003840225,0.022486294,0.014590126],"genre_scores_gemma":[0.6964949,0.00030300522,0.29493865,0.00018309253,0.00002843043,0.00007317352,0.00073116977,0.00074559933,0.006502092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941504,0.00014540013,0.00003043024,0.000103128514,0.00015095795,0.00015514162],"domain_scores_gemma":[0.99951875,0.00008829885,0.000052694137,0.00019927036,0.00009688461,0.000044126213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078619726,0.00094917003,0.00048812135,0.00075718074,0.00054024503,0.0010978036,0.0021125355,0.00046625503,0.0020094612],"category_scores_gemma":[0.0010848768,0.00041613157,0.00042008757,0.0007601543,0.00047743798,0.0014159085,0.000854062,0.000723295,0.000583095],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006915734,0.0002195057,0.0028466352,0.00015636113,0.000119092874,0.00022422391,0.00021048916,0.524268,0.040902138,0.0145792905,0.017321358,0.39846134],"study_design_scores_gemma":[0.00007464228,0.0005351312,0.0010944405,0.000020677937,0.000040545747,0.0000883903,0.00008768763,0.96796083,0.018302541,0.005197444,0.006551711,0.000045949568],"about_ca_topic_score_codex":0.00935616,"about_ca_topic_score_gemma":0.02159667,"teacher_disagreement_score":0.00935616,"about_ca_system_score_codex":0.0011844187,"about_ca_system_score_gemma":0.0015816166,"threshold_uncertainty_score":0.018603444},"labels":[],"label_agreement":null},{"id":"W4389166704","doi":"10.1109/iccad57390.2023.10323720","title":"Design and Optimization of Low-Dropout Voltage Regulator Using Relational Graph Neural Network and Reinforcement Learning in Open-Source SKY130 Process","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Reinforcement learning; Network topology; Graph; Dropout (neural networks); Circuit design; Computer engineering; Artificial intelligence; Machine learning; Theoretical computer science; Embedded system","score_opus":0.021850919234680445,"score_gpt":0.24247644395358456,"score_spread":0.22062552471890412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389166704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052784167,0.000395724,0.93761283,0.00021377394,0.000035472454,0.000082292085,0.000063215564,0.0015702888,0.0072422284],"genre_scores_gemma":[0.90254605,0.00013818008,0.0948523,0.00008367963,0.000009859508,0.00008365945,0.00007284565,0.00009585129,0.0021176038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997749,0.000033556928,0.0000078374305,0.000059042817,0.00009436141,0.000030286046],"domain_scores_gemma":[0.99984646,0.000053096825,0.000033410233,0.00001575347,0.000041291045,0.000010003521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040115893,0.00056920055,0.00038107767,0.0002566049,0.00020864063,0.0005521799,0.00092698383,0.0005196131,0.0018144941],"category_scores_gemma":[0.000606723,0.00022580805,0.00038465124,0.00021863925,0.00045114674,0.00058104267,0.0003814808,0.00060413306,0.00022184006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030999094,0.000035957386,0.0003962288,0.000061633364,0.000020705756,0.00006395107,0.000024097979,0.9446275,0.011654672,0.004588274,0.00049876847,0.03799716],"study_design_scores_gemma":[0.0000042943516,0.000020237536,0.0000400513,0.0000017551657,0.0000040044174,0.000006373449,0.0000018585898,0.9974585,0.0017040384,0.00050731766,0.0002495084,0.0000020104371],"about_ca_topic_score_codex":0.0045623593,"about_ca_topic_score_gemma":0.00777753,"teacher_disagreement_score":0.0045623593,"about_ca_system_score_codex":0.00086295477,"about_ca_system_score_gemma":0.0010310728,"threshold_uncertainty_score":0.0090715885},"labels":[],"label_agreement":null},{"id":"W4390490815","doi":"10.1145/3639055","title":"Evaluating the Impact of Using Multiple-Metal Layers on the Layout Area of Switch Blocks for Tile-Based FPGAs in FinFET 7nm","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tile; Field-programmable gate array; Computer science; Parallel computing; Computer architecture; Materials science; Embedded system; Composite material","score_opus":0.08032565914206566,"score_gpt":0.33076737371923914,"score_spread":0.25044171457717346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390490815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9667285,0.00045978354,0.030209066,0.00006376718,0.000024202089,0.000023422843,0.0002339341,0.00038546635,0.0018717308],"genre_scores_gemma":[0.98942006,0.00013481914,0.00991873,0.000017103412,0.0000029882963,0.000009532519,0.000100205325,0.000033760727,0.00036276964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997322,0.00006323416,0.000013794373,0.000056493045,0.00008754313,0.000046625813],"domain_scores_gemma":[0.9982292,0.0012319825,0.00020356783,0.0001384971,0.000162899,0.000033806307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039832963,0.00068471313,0.00030944063,0.00037733203,0.00022228618,0.00051342207,0.00065351964,0.00057020946,0.0009409918],"category_scores_gemma":[0.0019830405,0.00029399444,0.00043406637,0.0004187077,0.00020079498,0.00094042224,0.00026326394,0.00028170057,0.00015286436],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022598622,0.000047873666,0.006328012,0.000089585075,0.000044722256,0.00009408458,0.000027896805,0.9608713,0.016725471,0.0002489241,0.00014986204,0.015146409],"study_design_scores_gemma":[0.000007869086,0.0004077481,0.0034000839,0.000009823515,0.000039417053,0.000058222857,0.00003896307,0.9701568,0.025445664,0.00011922163,0.00030101882,0.000015198613],"about_ca_topic_score_codex":0.011216403,"about_ca_topic_score_gemma":0.017710747,"teacher_disagreement_score":0.011216403,"about_ca_system_score_codex":0.0008017592,"about_ca_system_score_gemma":0.00047705334,"threshold_uncertainty_score":0.02230221},"labels":[],"label_agreement":null},{"id":"W4390576950","doi":"10.1137/1.9781611977912.22","title":"Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Eigenvalues and eigenvectors; Multiplicative function; Algorithm; Directed graph; Relaxation (psychology); Mathematics; Vertex (graph theory); Computer science; Linear programming; Combinatorics; Mathematical optimization; Graph; Discrete mathematics","score_opus":0.06993008728173788,"score_gpt":0.24925096009821698,"score_spread":0.1793208728164791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390576950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002086856,0.000116889416,0.9950675,0.00005744367,0.00002435468,0.00004272252,0.000042484957,0.00039944565,0.00216234],"genre_scores_gemma":[0.03865458,0.00024468702,0.9562356,0.00008285083,0.00003563424,0.00016671554,0.0002700899,0.00027977733,0.0040301634],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947363,0.00012460648,0.000026279218,0.00013634746,0.00016791638,0.00007127393],"domain_scores_gemma":[0.99923325,0.00041516655,0.000057041103,0.0001263796,0.00012992248,0.000038158218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069324067,0.0015123831,0.00096909486,0.0011090862,0.0006067953,0.0012868078,0.0018816788,0.001021967,0.007978924],"category_scores_gemma":[0.002263064,0.0007932792,0.000857696,0.0016079771,0.0006000229,0.002883423,0.0018928681,0.0023838389,0.0024870252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014933741,0.00015968514,0.0002281571,0.0003430508,0.000046364516,0.00011687091,0.00018589065,0.3476711,0.011371689,0.15921113,0.013538463,0.46697828],"study_design_scores_gemma":[0.000032574335,0.000028694925,0.000049831717,0.000023934568,0.000007997664,0.0000658056,0.00003468988,0.9056552,0.0027641223,0.08628291,0.0050422605,0.000011924512],"about_ca_topic_score_codex":0.001808097,"about_ca_topic_score_gemma":0.0027308862,"teacher_disagreement_score":0.007978924,"about_ca_system_score_codex":0.0010829247,"about_ca_system_score_gemma":0.0009390385,"threshold_uncertainty_score":0.026692152},"labels":[],"label_agreement":null},{"id":"W4390606148","doi":"10.1109/icm60448.2023.10378891","title":"An Adaptive Analytical FPGA Placement flow based on Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Reinforcement learning; Computer science; Placement; Reduction (mathematics); Gate array; State (computer science); Computer engineering; Embedded system; Computer architecture; Parallel computing; Artificial intelligence; Physical design; Algorithm; Circuit design","score_opus":0.022423305879259857,"score_gpt":0.252283605503137,"score_spread":0.22986029962387713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390606148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0335234,0.00010702833,0.96108186,0.00021253037,0.000051229443,0.00010191301,0.000017650507,0.0006291913,0.004275283],"genre_scores_gemma":[0.8201883,0.00011504724,0.17563984,0.00015135645,0.000034762154,0.00014850654,0.00003982172,0.00005571986,0.0036266325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997453,0.000060742943,0.000009776273,0.000057797384,0.0000787657,0.00004759759],"domain_scores_gemma":[0.99938893,0.00029771146,0.00009062904,0.000033156146,0.00014096919,0.000048593574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423854,0.00066992803,0.0005605208,0.00042006458,0.00033815703,0.00052817445,0.0009964003,0.00070197973,0.0021624886],"category_scores_gemma":[0.0018930637,0.00028049244,0.00028785077,0.00022399376,0.000591778,0.00047905924,0.00060806895,0.0007648807,0.00029513153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052967687,0.00007354845,0.00058431725,0.000027721115,0.000015684627,0.00004637917,0.00003103383,0.94804645,0.0029361555,0.0033405826,0.0006690126,0.044176053],"study_design_scores_gemma":[0.000007793785,0.000028583616,0.000037873207,0.0000021850133,0.0000022396064,0.0000074568584,0.0000026200637,0.9989003,0.00033726817,0.0005039425,0.00016767273,0.0000019952363],"about_ca_topic_score_codex":0.0040419092,"about_ca_topic_score_gemma":0.004500537,"teacher_disagreement_score":0.0040419092,"about_ca_system_score_codex":0.0007508715,"about_ca_system_score_gemma":0.001396488,"threshold_uncertainty_score":0.008036792},"labels":[],"label_agreement":null},{"id":"W4391382572","doi":"10.1109/mwscas57524.2023.10405922","title":"Design Space Exploration in the Physical-Design of an AI-Processor at 12 nm Using Relative-Placement Methodology","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Macro; Placement; Computer science; Reduction (mathematics); Electronic design automation; Physical design; Computer Aided Design; Engineering drawing; Computer hardware; Embedded system; Circuit design; Engineering; Operating system; Mathematics; Programming language; Geometry","score_opus":0.2686630754760615,"score_gpt":0.36424553999559367,"score_spread":0.09558246451953217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391382572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2225621,0.0005630694,0.7624475,0.00017277533,0.000048427228,0.00009006,0.00009422755,0.0016811453,0.012340693],"genre_scores_gemma":[0.52849317,0.00017680746,0.46759382,0.00005323182,0.000008240613,0.00008661712,0.000092429174,0.00012671748,0.0033689826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974245,0.00007818435,0.000009672858,0.000025448742,0.00012148746,0.00002279049],"domain_scores_gemma":[0.99972385,0.00013796304,0.000033404223,0.000039032195,0.00005717763,0.00000857821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004089154,0.000405783,0.00019040951,0.00036182316,0.00023394058,0.0003476804,0.0003794285,0.00020870034,0.0029262728],"category_scores_gemma":[0.0007317763,0.00015553174,0.00022750624,0.0003579724,0.00024424025,0.00041116923,0.00022831045,0.00036745644,0.0002993668],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035605833,0.00014522849,0.0018263063,0.0006069668,0.00006814292,0.00040610353,0.00053767767,0.39779127,0.2033238,0.029884944,0.0024445676,0.3626089],"study_design_scores_gemma":[0.00012861849,0.0017568206,0.002432815,0.000044209657,0.00006629007,0.0007003348,0.00020555177,0.76808655,0.1848341,0.012732345,0.02897109,0.000041287236],"about_ca_topic_score_codex":0.0006312008,"about_ca_topic_score_gemma":0.0018933745,"teacher_disagreement_score":0.0029262728,"about_ca_system_score_codex":0.00034769534,"about_ca_system_score_gemma":0.00051927293,"threshold_uncertainty_score":0.009789288},"labels":[],"label_agreement":null},{"id":"W4391429101","doi":"10.1109/icfpt59805.2023.00006","title":"A Deep-Learning Data-Driven Approach for Reducing FPGA Routing Runtimes","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Routing (electronic design automation); Field-programmable gate array; Deep learning; Parallel computing; Artificial intelligence; Computer network; Embedded system","score_opus":0.03938491760042639,"score_gpt":0.26235862266096266,"score_spread":0.22297370506053626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391429101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08893748,0.00065559905,0.9014158,0.00045709193,0.00008423957,0.00007133049,0.00032064534,0.005344711,0.0027129962],"genre_scores_gemma":[0.63190114,0.00022180311,0.3620564,0.000344174,0.00005256359,0.0001668054,0.0010337462,0.00026275543,0.0039605666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997112,0.000036296886,0.000014392976,0.00008509607,0.000100054276,0.000052827774],"domain_scores_gemma":[0.9994043,0.00022348782,0.000070315655,0.00009523993,0.0001832551,0.000023467952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052879454,0.0011424146,0.00059795566,0.0005573454,0.00027623505,0.0005514286,0.0016409367,0.00061786984,0.0018065313],"category_scores_gemma":[0.0016878521,0.00042454677,0.00045203397,0.0005714358,0.00043550765,0.0009091019,0.0006230242,0.0013554507,0.00047492172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001502105,0.00018820666,0.0013838508,0.0000804252,0.000047526093,0.00006550562,0.00003279693,0.66136044,0.014974769,0.002501221,0.004122898,0.31509215],"study_design_scores_gemma":[0.000008300324,0.00003487632,0.0001229846,0.0000032075275,0.000006804234,0.00000877276,0.0000047825483,0.9948454,0.0035379191,0.0009892194,0.00043488867,0.00000286483],"about_ca_topic_score_codex":0.006258311,"about_ca_topic_score_gemma":0.013131415,"teacher_disagreement_score":0.006258311,"about_ca_system_score_codex":0.0010375861,"about_ca_system_score_gemma":0.0017670299,"threshold_uncertainty_score":0.012443781},"labels":[],"label_agreement":null},{"id":"W4391455291","doi":"10.1109/icfpt59805.2023.00027","title":"Into the Third Dimension: Architecture Exploration Tools for 3D Reconfigurable Acceleration Devices","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer architecture; Computer science; Field-programmable gate array; Design space exploration; Reconfigurable computing; Embedded system; Three-dimensional integrated circuit; Electronic design automation; Chip; Telecommunications","score_opus":0.047513085848725684,"score_gpt":0.26145033658670025,"score_spread":0.21393725073797457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391455291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012030039,0.00068809104,0.9430981,0.00029872684,0.00010203137,0.00009992478,0.0015598016,0.027655793,0.014467436],"genre_scores_gemma":[0.096954085,0.0011445154,0.88527423,0.00036208556,0.00003769932,0.0003641448,0.0032530087,0.005318051,0.0072921393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00007893233,0.000020718071,0.000041902615,0.0001891014,0.00004324652],"domain_scores_gemma":[0.9995691,0.00023103596,0.000031564825,0.000081433885,0.000066873414,0.000019991148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007668739,0.0010364663,0.00040433923,0.0007337162,0.00039350244,0.0015665338,0.0015465409,0.00089950126,0.011595974],"category_scores_gemma":[0.0012309473,0.0006321426,0.0016863493,0.00045113644,0.0005304003,0.0014466771,0.0010544127,0.0013208147,0.0023178812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028060863,0.00021507655,0.0043211207,0.0014992534,0.0002675159,0.001172329,0.0013749654,0.3617094,0.039220534,0.21406704,0.062203087,0.31366906],"study_design_scores_gemma":[0.00010337409,0.00009182041,0.00085085735,0.00025763313,0.00006500073,0.00045948665,0.0001813822,0.6936306,0.02120841,0.046971135,0.23609236,0.000087978864],"about_ca_topic_score_codex":0.0017561986,"about_ca_topic_score_gemma":0.0044708857,"teacher_disagreement_score":0.011595974,"about_ca_system_score_codex":0.00054570247,"about_ca_system_score_gemma":0.00079314655,"threshold_uncertainty_score":0.03879237},"labels":[],"label_agreement":null},{"id":"W4392605854","doi":"10.1007/978-3-031-52113-3_5","title":"Fractional Bamboo Trimming and Distributed Windows Scheduling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Computer science; Trimming; Bamboo; Scheduling (production processes); Parallel computing; Distributed computing; Operating system; Mathematical optimization; Mathematics; Composite material","score_opus":0.011523361404668742,"score_gpt":0.22604654121482046,"score_spread":0.2145231798101517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392605854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056897614,0.0009925868,0.9245645,0.00011730579,0.000261042,0.000037744707,0.000051340634,0.0010279386,0.016049895],"genre_scores_gemma":[0.6827748,0.00052758725,0.29675192,0.00009355074,0.00010360358,0.00005836573,0.00011622887,0.00026368923,0.019310178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990785,0.000012448627,0.0000034378827,0.000024654371,0.000028301902,0.0000232989],"domain_scores_gemma":[0.99985695,0.000046577097,0.00001773685,0.0000403771,0.000022231638,0.000016076241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015236362,0.0004141688,0.00044100103,0.00041439608,0.00047924105,0.0005047647,0.0007366781,0.00030762897,0.005347099],"category_scores_gemma":[0.00054086535,0.0001949971,0.00022953561,0.0007502786,0.00031278425,0.0006968165,0.00040696704,0.00063742656,0.0005698264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012699239,0.0001502623,0.00032622585,0.0001979343,0.000041741023,0.00018654756,0.00012063211,0.22857814,0.14171816,0.099665105,0.005387989,0.52235734],"study_design_scores_gemma":[0.00006354138,0.00020425013,0.00052435993,0.000030031257,0.000027200698,0.00018551183,0.000046108547,0.8788646,0.043808404,0.0627217,0.013499725,0.000024516667],"about_ca_topic_score_codex":0.0011627964,"about_ca_topic_score_gemma":0.0022687777,"teacher_disagreement_score":0.005347099,"about_ca_system_score_codex":0.00058302336,"about_ca_system_score_gemma":0.0004639434,"threshold_uncertainty_score":0.01788783},"labels":[],"label_agreement":null},{"id":"W4393520386","doi":"10.5281/zenodo.7240327","title":"Koios benchmarks' netlist files (BLIF format)","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"National Science Foundation","keywords":"Netlist; Computer science; Programming language; Computer hardware","score_opus":0.01939754294858081,"score_gpt":0.21663053638278154,"score_spread":0.19723299343420073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393520386","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010155679,0.00035170515,0.00046502048,0.00011411696,0.00006354583,0.000049296734,0.9912282,0.0039017543,0.0028108186],"genre_scores_gemma":[0.0008147693,0.00010869011,0.00073566096,0.00004875496,0.000006192281,0.00010770223,0.9971047,0.0002179044,0.00085558597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988745,0.00014085672,0.000112331945,0.00027193734,0.0004076886,0.00019274125],"domain_scores_gemma":[0.9987055,0.0003972117,0.000108972214,0.0003175211,0.00035738878,0.000113414695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009577186,0.004813312,0.0016301196,0.0041240626,0.00090233877,0.0020439988,0.0046401895,0.0027964597,0.05183811],"category_scores_gemma":[0.0039017457,0.00092895416,0.0016302855,0.0052297446,0.00043725377,0.0011763754,0.0014309094,0.002348567,0.08331465],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012303902,0.00007899875,0.00049958826,0.0009262206,0.00003821493,0.000061297935,0.000012361504,0.0019248808,0.00038438404,0.0005345591,0.98882943,0.0065869475],"study_design_scores_gemma":[0.00073981815,0.00014112421,0.003463725,0.00036920086,0.000065761866,0.00032736253,0.00006189255,0.0065448787,0.0026605644,0.0033310493,0.98223674,0.000057872374],"about_ca_topic_score_codex":0.014413766,"about_ca_topic_score_gemma":0.02589373,"teacher_disagreement_score":0.05183811,"about_ca_system_score_codex":0.0017379359,"about_ca_system_score_gemma":0.0017806015,"threshold_uncertainty_score":0.17341578},"labels":[],"label_agreement":null},{"id":"W4393578439","doi":"10.1145/3626202.3637572","title":"From Topology to Realization in FPGA/VPR Routing","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Computer science; Router; Compiler; Equal-cost multi-path routing; Routing (electronic design automation); Parallel computing; Field-programmable gate array; Static routing; Embedded system; Metrics; Application-specific integrated circuit; Routing table; Computer network; Routing protocol; Operating system","score_opus":0.010207253347528216,"score_gpt":0.2500416055364113,"score_spread":0.23983435218888308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393578439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082834,0.0010178656,0.84163785,0.00096699165,0.0001835916,0.0000715187,0.00024365883,0.003417439,0.08163258],"genre_scores_gemma":[0.5980641,0.0014233418,0.38678527,0.00024230732,0.000057964025,0.00010035785,0.0004546487,0.0009578848,0.011914098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959487,0.000126823,0.000020702671,0.000052517484,0.00015068562,0.000054355307],"domain_scores_gemma":[0.9996588,0.00011175708,0.000033769462,0.0001155673,0.00005852813,0.000021651816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046118803,0.00028808962,0.00021509785,0.0005888038,0.00034337988,0.0017440576,0.00072727306,0.0003958413,0.003989221],"category_scores_gemma":[0.0013725712,0.0003176296,0.00028011962,0.00051481405,0.0009422443,0.0016218795,0.00063838233,0.00063870515,0.0013380725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010806023,0.00004268657,0.0012995051,0.0002951188,0.000025839481,0.00081043085,0.00039942557,0.21009059,0.030293,0.4752636,0.0065962034,0.27477553],"study_design_scores_gemma":[0.00004468577,0.00031147536,0.0012317464,0.0002456055,0.000037377293,0.0014974597,0.0005119439,0.43923986,0.048603702,0.34826875,0.15992579,0.0000816733],"about_ca_topic_score_codex":0.0008086428,"about_ca_topic_score_gemma":0.0015323464,"teacher_disagreement_score":0.003989221,"about_ca_system_score_codex":0.0005541291,"about_ca_system_score_gemma":0.00035537477,"threshold_uncertainty_score":0.013345242},"labels":[],"label_agreement":null},{"id":"W4393971401","doi":"10.1002/9781119763222.ch6","title":"Computation of Fields Via Integration Along Steepest Descent Path","year":2024,"lang":"en","type":"other","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computation; Gradient descent; Path (computing); Computer science; Descent (aeronautics); Method of steepest descent; Algorithm; Mathematical optimization; Mathematics; Physics; Artificial intelligence; Meteorology; Computer network","score_opus":0.008845803846726716,"score_gpt":0.22153467550086614,"score_spread":0.2126888716541394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393971401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011241469,0.00016162467,0.98040444,0.00009828635,0.00002743986,0.000025497442,0.00004136757,0.00046286752,0.0075370553],"genre_scores_gemma":[0.24064234,0.00046459775,0.7441935,0.00010209625,0.000037598176,0.000110393106,0.0002436147,0.0004906568,0.013715182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983084,0.000039875526,0.000008988407,0.000017963728,0.000080123566,0.00002225244],"domain_scores_gemma":[0.9996637,0.00015317221,0.000021105825,0.00003490531,0.00010522042,0.000021898375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238818,0.0004920583,0.0004734078,0.00064788497,0.00042149474,0.001098129,0.00068762637,0.0005027733,0.0042266115],"category_scores_gemma":[0.0017307114,0.00026132085,0.0003495109,0.000470559,0.0004542144,0.0009069575,0.00057481707,0.0006186132,0.0015200061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013186716,0.000050140425,0.001443799,0.00023925735,0.00005645956,0.00029375232,0.0002206246,0.5371855,0.015082906,0.27349392,0.0040858104,0.167716],"study_design_scores_gemma":[0.0000071495874,0.000016376887,0.000107699554,0.000010426325,0.0000036573258,0.00004289814,0.000018172741,0.9701623,0.002970976,0.023292424,0.0033612633,0.000006658069],"about_ca_topic_score_codex":0.0021865936,"about_ca_topic_score_gemma":0.003197233,"teacher_disagreement_score":0.0042266115,"about_ca_system_score_codex":0.0006723019,"about_ca_system_score_gemma":0.0010342909,"threshold_uncertainty_score":0.014139473},"labels":[],"label_agreement":null},{"id":"W4396958733","doi":"10.1007/s11036-024-02343-7","title":"A Survey on Smart Optimisation Techniques for 6G-oriented Integrated Circuits Design","year":2023,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Survey research; Integrated circuit; Computer architecture; Systems engineering; Engineering; Electronic engineering; Business; Operating system","score_opus":0.025280528166018394,"score_gpt":0.25546562729569594,"score_spread":0.23018509912967755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396958733","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009690128,0.070874825,0.87138474,0.00045461676,0.00032775497,0.00012867352,0.00018252336,0.0013158938,0.045640808],"genre_scores_gemma":[0.19461331,0.085515834,0.68276125,0.00083237403,0.0006428743,0.0002739376,0.0010652421,0.00083628396,0.03345896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956506,0.000076381584,0.00003631256,0.0000775927,0.00020804904,0.000036610938],"domain_scores_gemma":[0.9996815,0.00012073716,0.0000451743,0.00006571958,0.00007791609,0.000008992448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042060268,0.0012338173,0.0007178249,0.0011791144,0.00025614855,0.0010485158,0.0015739391,0.00064240745,0.009589446],"category_scores_gemma":[0.00084605365,0.0005937271,0.0007484982,0.0017976792,0.000280386,0.0010234646,0.00049692165,0.00079235487,0.0034673675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001265583,0.00006590325,0.0005082417,0.0016887393,0.000105207284,0.00010463025,0.000073873205,0.04823656,0.028326519,0.04129768,0.008776062,0.87069],"study_design_scores_gemma":[0.00015893481,0.0010307255,0.0018195634,0.0011802639,0.00034002753,0.0017618515,0.00011544893,0.34012058,0.067291886,0.077625595,0.5084429,0.000112221824],"about_ca_topic_score_codex":0.00080186425,"about_ca_topic_score_gemma":0.0016183123,"teacher_disagreement_score":0.009589446,"about_ca_system_score_codex":0.0006677866,"about_ca_system_score_gemma":0.000672457,"threshold_uncertainty_score":0.032079875},"labels":[],"label_agreement":null},{"id":"W4396976032","doi":"10.1145/3664286","title":"Applying reinforcement learning to learn best net to rip and re-route in global routing","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute","keywords":"Computer science; Reinforcement learning; Net (polyhedron); Routing (electronic design automation); Artificial intelligence; Machine learning; Computer network","score_opus":0.017003432013078117,"score_gpt":0.25719917338602283,"score_spread":0.24019574137294472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396976032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04516262,0.00033578364,0.94966483,0.00020153237,0.000058100246,0.0000681492,0.000035689536,0.001372446,0.0031008525],"genre_scores_gemma":[0.87618864,0.00014770875,0.12023922,0.00020228863,0.000040638468,0.00010410176,0.00008824324,0.0001657546,0.0028234394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.00012388309,0.000022578675,0.00013211394,0.00012397552,0.000094397314],"domain_scores_gemma":[0.9985683,0.0007515297,0.00018814797,0.00016542897,0.00022937461,0.0000971336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317894,0.0010252681,0.0010365458,0.00047032087,0.00030266133,0.00071309914,0.0013810219,0.00078091345,0.0024536804],"category_scores_gemma":[0.0033032165,0.00038684774,0.00042444255,0.00027687024,0.0009927322,0.0011209704,0.0009427471,0.0012302223,0.0003742003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049610113,0.000053209926,0.00079108734,0.00003455469,0.000025224494,0.000042417876,0.000029259476,0.94551337,0.0016155682,0.0025061134,0.00067025505,0.048669238],"study_design_scores_gemma":[0.0000073055608,0.000034232133,0.00005303443,0.0000034562677,0.0000054738043,0.0000075002777,0.0000048682423,0.9976901,0.0005083712,0.0014621578,0.00022059106,0.0000030208755],"about_ca_topic_score_codex":0.003702812,"about_ca_topic_score_gemma":0.005444212,"teacher_disagreement_score":0.003702812,"about_ca_system_score_codex":0.0008384466,"about_ca_system_score_gemma":0.0014106642,"threshold_uncertainty_score":0.008208394},"labels":[],"label_agreement":null},{"id":"W4399487315","doi":"10.1145/3649476.3658793","title":"Generalizable and Relation Sensitive Netlist Representation for Analog Circuit Design","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Netlist; Relation (database); Representation (politics); Computer science; Circuit extraction; Computer hardware; Equivalent circuit; Electrical engineering; Engineering; Data mining; Voltage","score_opus":0.04530070946466474,"score_gpt":0.2605373131465432,"score_spread":0.21523660368187847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010666632,0.00021288886,0.983472,0.00014104602,0.000027204902,0.00004053913,0.00040557692,0.0019281022,0.0031060192],"genre_scores_gemma":[0.5398893,0.00048564989,0.4517368,0.00018797514,0.00004305291,0.00023597272,0.0014453952,0.00027672166,0.005699034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997999,0.00004838756,0.000010909781,0.000041754392,0.00008300108,0.000016007523],"domain_scores_gemma":[0.99962056,0.00014723878,0.000042128933,0.000117102645,0.000062914456,0.0000099394565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026891733,0.0006073542,0.00036096512,0.00065849,0.00016647141,0.0007522026,0.0009017869,0.00050641695,0.0046278704],"category_scores_gemma":[0.0014269217,0.0002469193,0.000531458,0.00064265856,0.0003279574,0.0013003431,0.00054122665,0.0008029033,0.0007424934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044629945,0.00004195567,0.00043497232,0.000119498465,0.000032252265,0.000070151174,0.000050939692,0.78574455,0.0066698836,0.032758765,0.0030344077,0.17099807],"study_design_scores_gemma":[0.0000052676864,0.000013426222,0.00008400285,0.000008028149,0.000007490927,0.000025075136,0.000007358689,0.9676013,0.0015276923,0.028147893,0.0025686661,0.0000037489851],"about_ca_topic_score_codex":0.0018186452,"about_ca_topic_score_gemma":0.005429654,"teacher_disagreement_score":0.0046278704,"about_ca_system_score_codex":0.000568435,"about_ca_system_score_gemma":0.0006933087,"threshold_uncertainty_score":0.01548183},"labels":[],"label_agreement":null},{"id":"W4399886260","doi":"10.1145/3625223.3649266","title":"The Impact of Heterogeneous Logic on Adders and Multipliers in VTR","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Adder; Arithmetic; Logic gate; Logic synthesis; Parallel computing; Programming language; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.016629321997731757,"score_gpt":0.26445036351862666,"score_spread":0.2478210415208949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399886260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49791944,0.0015606704,0.485614,0.000346131,0.00012456361,0.00011277945,0.00010629078,0.0013777126,0.012838424],"genre_scores_gemma":[0.87492365,0.00027706567,0.122642614,0.00016076781,0.000017380153,0.000027285927,0.000058042955,0.00016059008,0.0017324825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877816,0.00029221113,0.00009637195,0.00020232207,0.00049619784,0.00013470542],"domain_scores_gemma":[0.996833,0.001714495,0.0005339294,0.00058079266,0.00028177805,0.000056093828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806136,0.00053654326,0.00029674085,0.0005204242,0.00035546097,0.000901771,0.0011174004,0.00033567863,0.002031514],"category_scores_gemma":[0.0039139832,0.00030972218,0.00036560203,0.00044386028,0.00048312848,0.0017298269,0.0006903964,0.00040840716,0.00022260241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008925943,0.00016991668,0.007481878,0.00060703844,0.00018459467,0.0017479399,0.00030295778,0.3316378,0.30018118,0.05037965,0.0011926816,0.3052217],"study_design_scores_gemma":[0.0001116644,0.002510358,0.004560448,0.00015461193,0.0003614254,0.0026515261,0.00026046773,0.630578,0.31936502,0.018937085,0.020428503,0.000080879436],"about_ca_topic_score_codex":0.0010501222,"about_ca_topic_score_gemma":0.0028547568,"teacher_disagreement_score":0.002031514,"about_ca_system_score_codex":0.00060818344,"about_ca_system_score_gemma":0.0006010652,"threshold_uncertainty_score":0.006796062},"labels":[],"label_agreement":null},{"id":"W4399886299","doi":"10.1145/3625223.3649269","title":"Extending Memory Compatibility with Yosys Front-End in VTR Flow","year":2023,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Compatibility (geochemistry); Computer science; Front and back ends; Operating system; Materials science; Composite material","score_opus":0.014047924878856121,"score_gpt":0.21751232739652712,"score_spread":0.203464402517671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399886299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083069324,0.0010370839,0.78573084,0.0005198558,0.00033078287,0.00042256323,0.0013870862,0.10349343,0.02400899],"genre_scores_gemma":[0.46278727,0.00069823366,0.5023497,0.0011343106,0.00014414417,0.00043985122,0.0038417338,0.01091548,0.017689325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869907,0.0002935731,0.00016605921,0.00020491148,0.00046559403,0.00017075078],"domain_scores_gemma":[0.9966203,0.0012230169,0.0002891521,0.0011742658,0.0006363134,0.000056945846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020599754,0.00080843363,0.0004410393,0.0011897219,0.00026159032,0.0015412846,0.0018592816,0.0005275086,0.011805458],"category_scores_gemma":[0.006139148,0.0007102134,0.0009333782,0.00043468166,0.0004918768,0.0020645063,0.0013620685,0.0010250537,0.0028748221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017929518,0.00037503577,0.008405112,0.0013281041,0.00013727852,0.0009809604,0.0012795721,0.05247343,0.100545615,0.04143088,0.03799664,0.7532545],"study_design_scores_gemma":[0.0006787725,0.0011364302,0.0045146425,0.000503177,0.00026421432,0.0009902818,0.00022266322,0.41314515,0.2789279,0.028770233,0.27066344,0.000183175],"about_ca_topic_score_codex":0.002270324,"about_ca_topic_score_gemma":0.0027756644,"teacher_disagreement_score":0.011805458,"about_ca_system_score_codex":0.00068678084,"about_ca_system_score_gemma":0.0014242098,"threshold_uncertainty_score":0.039493144},"labels":[],"label_agreement":null},{"id":"W4400020740","doi":"10.1109/tnsm.2024.3419051","title":"Preemptive Prediction-Based Placement of Time-Critical SFCs With VNF Sharing at the Edge","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence","score_opus":0.00792640342129182,"score_gpt":0.20299816659373723,"score_spread":0.1950717631724454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400020740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16538791,0.0007011396,0.8255853,0.0002289339,0.00024022908,0.0001363761,0.000080065554,0.0014899536,0.0061500724],"genre_scores_gemma":[0.9244677,0.000111975525,0.07371265,0.000058026522,0.000025507345,0.000027948372,0.000041995307,0.000027750348,0.0015264199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995937,0.000066519366,0.000025353393,0.000079217534,0.00012321102,0.000111978414],"domain_scores_gemma":[0.99944824,0.00011620855,0.00010745207,0.00009934536,0.00015412024,0.000074594944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035608438,0.000678929,0.0005117096,0.00044001781,0.0005982866,0.00051020755,0.0011585773,0.00041440065,0.0015563375],"category_scores_gemma":[0.0009598987,0.00020586171,0.0002747678,0.00037925708,0.00038534953,0.00047447128,0.00046168265,0.0003907575,0.0002683045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080800237,0.00016284724,0.0028177062,0.00013501488,0.000040518724,0.0005648024,0.00021190445,0.70731527,0.067954324,0.0065407474,0.0037013844,0.20974745],"study_design_scores_gemma":[0.00001777385,0.0001618123,0.00030838462,0.0000074723266,0.000009501796,0.00014715933,0.000037487553,0.985355,0.011372916,0.0013592555,0.0012116801,0.000011519344],"about_ca_topic_score_codex":0.0069493745,"about_ca_topic_score_gemma":0.009229506,"teacher_disagreement_score":0.0069493745,"about_ca_system_score_codex":0.0008662607,"about_ca_system_score_gemma":0.0014512624,"threshold_uncertainty_score":0.013817847},"labels":[],"label_agreement":null},{"id":"W4400234134","doi":"10.1109/iscas58744.2024.10558520","title":"Reinforcement-Learning-Based Foggy-Aware Optimal Placement Method for Analog and MixedSignal Circuits","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"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":"Reinforcement learning; Computer science; Reinforcement; Analogue electronics; Electronic circuit; Artificial intelligence; Electrical engineering; Engineering","score_opus":0.014156752381373951,"score_gpt":0.2669021949000231,"score_spread":0.25274544251864917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400234134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013258796,0.00017256815,0.98444897,0.00009011472,0.000027879576,0.000026509426,0.000009443162,0.0002222511,0.00174352],"genre_scores_gemma":[0.82406163,0.00016350062,0.17232476,0.00012994708,0.000030350935,0.00011918224,0.0000356359,0.00006996133,0.0030649442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998561,0.000035984827,0.0000065350123,0.000032140822,0.000041927367,0.000027199267],"domain_scores_gemma":[0.9997166,0.00015260378,0.000041568637,0.000015062415,0.00005476343,0.000019358553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004744349,0.0006798607,0.000728218,0.00041601516,0.000307697,0.00039023184,0.000773022,0.0007270391,0.0015087317],"category_scores_gemma":[0.0007799679,0.00037309126,0.0004869235,0.00027274634,0.0005764565,0.00038500034,0.0005280275,0.0005977044,0.00014094463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002734813,0.000017575629,0.00020718724,0.000028277267,0.000015790883,0.000036190468,0.000022599907,0.9731625,0.001970402,0.002179647,0.00031397858,0.022018494],"study_design_scores_gemma":[0.0000038395247,0.000010399601,0.000024288678,0.0000014328373,0.000002200245,0.0000037970117,0.000001284795,0.9992054,0.00019045167,0.00045455163,0.000101196354,0.0000012308543],"about_ca_topic_score_codex":0.0058841608,"about_ca_topic_score_gemma":0.0054987264,"teacher_disagreement_score":0.0058841608,"about_ca_system_score_codex":0.00075794087,"about_ca_system_score_gemma":0.00093827915,"threshold_uncertainty_score":0.011699855},"labels":[],"label_agreement":null},{"id":"W4400966981","doi":"10.1016/j.compositesa.2024.108379","title":"Data-driven thermal modeling of in-situ Automated Fiber Placement","year":2024,"lang":"en","type":"article","venue":"Composites Part A Applied Science and Manufacturing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Materials science; In situ; Composite material; Thermal; Fiber; Thermodynamics","score_opus":0.025203215375306082,"score_gpt":0.2557525295585128,"score_spread":0.2305493141832067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400966981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27890182,0.00030681555,0.7134013,0.00018538078,0.00006504412,0.00007783234,0.00043441745,0.0008255478,0.0058018356],"genre_scores_gemma":[0.9825439,0.000094640905,0.014849521,0.000017971503,0.000007097987,0.00007754295,0.00012105149,0.00004196114,0.002246333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987733,0.000019607876,0.0000046936802,0.00003966963,0.000040625593,0.000018039207],"domain_scores_gemma":[0.99974126,0.00012049637,0.00003615029,0.000026334204,0.000063925356,0.0000119643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026529076,0.00058254733,0.00042865833,0.00021661365,0.00024012008,0.00041983777,0.00086406217,0.0007103115,0.0012298474],"category_scores_gemma":[0.0007412685,0.00041705728,0.00040358235,0.0001812725,0.00046885648,0.0006167429,0.00030261112,0.00062467624,0.0002009214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001292394,0.000007818801,0.00021269837,0.000012142516,0.0000028934314,0.0000145796785,0.000008871522,0.99606115,0.0017523385,0.0001756626,0.00003144763,0.0017074887],"study_design_scores_gemma":[4.9323035e-7,0.0000031479126,0.000057831017,5.155683e-7,4.7827325e-7,0.000001651136,8.600606e-7,0.9993812,0.00046386663,0.00005954183,0.000029615494,7.51346e-7],"about_ca_topic_score_codex":0.011003297,"about_ca_topic_score_gemma":0.008241938,"teacher_disagreement_score":0.011003297,"about_ca_system_score_codex":0.00075332733,"about_ca_system_score_gemma":0.0007215346,"threshold_uncertainty_score":0.02187848},"labels":[],"label_agreement":null},{"id":"W4401202373","doi":"10.48550/arxiv.2407.19905","title":"The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Steiner tree problem; Combinatorics; Mathematics; Tree (set theory); Relaxation (psychology); Psychology; Neuroscience","score_opus":0.1119836001463613,"score_gpt":0.1933004115758624,"score_spread":0.08131681142950109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401202373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13784847,0.006051445,0.722502,0.012059563,0.00076479674,0.0002794286,0.00196031,0.0008206389,0.11771343],"genre_scores_gemma":[0.5855473,0.0048249867,0.3805531,0.0038126532,0.000803619,0.00053257996,0.0024907906,0.0010589587,0.020376055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974261,0.00060595473,0.00011913673,0.0006573588,0.0006052623,0.000586232],"domain_scores_gemma":[0.99017406,0.007761209,0.00047886063,0.0006522514,0.00046860368,0.00046501574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038344937,0.0017130068,0.0019654385,0.00095477165,0.0011185091,0.003162485,0.0020588574,0.0021358533,0.010720164],"category_scores_gemma":[0.016309492,0.0007852127,0.0015989961,0.0018840726,0.0019060702,0.0069201617,0.0026601863,0.008006993,0.0013481304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014366289,0.0005817729,0.0017446937,0.001767924,0.00019677207,0.00067639863,0.00095625216,0.24168795,0.010479869,0.5960361,0.03146869,0.11296698],"study_design_scores_gemma":[0.00012960685,0.00024256599,0.00072346727,0.00025300457,0.00008694989,0.0008443509,0.00034171634,0.35333627,0.004094697,0.6195579,0.020352386,0.000037076614],"about_ca_topic_score_codex":0.0010884819,"about_ca_topic_score_gemma":0.0013229557,"teacher_disagreement_score":0.010720164,"about_ca_system_score_codex":0.0022605828,"about_ca_system_score_gemma":0.0014826575,"threshold_uncertainty_score":0.035862505},"labels":[],"label_agreement":null},{"id":"W4401863344","doi":"10.1145/3637528.3671895","title":"RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"End-to-end principle; Computer science; Placer mining; Graph; Artificial neural network; Parallel computing; Artificial intelligence; Geology; Theoretical computer science","score_opus":0.008779542969212524,"score_gpt":0.22035137153792392,"score_spread":0.2115718285687114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401863344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028173601,0.00026224618,0.9525233,0.00016673928,0.00011548967,0.00008376633,0.00024421336,0.014460417,0.0039701653],"genre_scores_gemma":[0.4028631,0.00023107787,0.5837995,0.00024289126,0.00004074527,0.0001871123,0.0007568093,0.0012698133,0.0106089935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998405,0.000020586742,0.0000064646238,0.000047517664,0.00006574,0.000019088655],"domain_scores_gemma":[0.9997385,0.00008667548,0.000043943055,0.000052436895,0.00006309012,0.000015299993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685955,0.0009904734,0.0003902808,0.00054333784,0.00022570236,0.00050856307,0.0014672547,0.0007441456,0.004548711],"category_scores_gemma":[0.0009952001,0.00039698047,0.00041633093,0.0003355115,0.0003142231,0.0006982051,0.0005804379,0.00084020174,0.00097637466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018909713,0.00009311092,0.00095123507,0.00017879879,0.0000852386,0.00016499952,0.000058969566,0.65826863,0.023295164,0.0058636153,0.0077543943,0.3030967],"study_design_scores_gemma":[0.000018102392,0.00006993102,0.00015099382,0.0000060231405,0.000012797892,0.00004141537,0.000008379946,0.98705125,0.008402277,0.0018922529,0.0023361593,0.0000104164865],"about_ca_topic_score_codex":0.0050825346,"about_ca_topic_score_gemma":0.014361754,"teacher_disagreement_score":0.0050825346,"about_ca_system_score_codex":0.00073663733,"about_ca_system_score_gemma":0.0008588257,"threshold_uncertainty_score":0.015216887},"labels":[],"label_agreement":null},{"id":"W4402073352","doi":"10.1142/s0217595924500258","title":"Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights","year":2024,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China; Zhejiang University of Water Resources and Electric Power","keywords":"Parameterized complexity; Steiner tree problem; Vertex (graph theory); Mathematics; Combinatorics; Treewidth; Discrete mathematics; Graph; Computer science; Pathwidth; Line graph","score_opus":0.04196131371238212,"score_gpt":0.31087166920946213,"score_spread":0.26891035549708003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402073352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09160351,0.0016376255,0.88479745,0.0014159335,0.00026414916,0.00027193673,0.0014057951,0.0019184382,0.016685147],"genre_scores_gemma":[0.5134507,0.0017815018,0.46822608,0.0006561152,0.0002492364,0.0005294995,0.0038833022,0.0012319406,0.00999158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981476,0.00045120504,0.000082118204,0.0005134258,0.00049592566,0.00030979209],"domain_scores_gemma":[0.99442035,0.0030748686,0.0006695186,0.0009035438,0.0005088608,0.00042274606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014288484,0.0030027393,0.0022786616,0.0011750226,0.0010113708,0.0026118152,0.0041518235,0.0020544797,0.008635928],"category_scores_gemma":[0.014498366,0.00087453896,0.0016792358,0.0028061594,0.0010484398,0.006723709,0.002973439,0.0031428973,0.0013100398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004063369,0.0001729291,0.0009069746,0.00044146928,0.000082622966,0.00021535088,0.00019829048,0.8472393,0.002377441,0.08234388,0.011664743,0.053950623],"study_design_scores_gemma":[0.00003908394,0.000058989277,0.00017025445,0.000034762907,0.000032750573,0.00008606298,0.00008538623,0.92518103,0.00045746475,0.0707333,0.003108653,0.000012317065],"about_ca_topic_score_codex":0.0060176235,"about_ca_topic_score_gemma":0.00809076,"teacher_disagreement_score":0.008635928,"about_ca_system_score_codex":0.003739026,"about_ca_system_score_gemma":0.0022681453,"threshold_uncertainty_score":0.028890073},"labels":[],"label_agreement":null},{"id":"W4402475585","doi":"10.1109/ccece59415.2024.10667338","title":"A Recursive Partitioning Approach to Improving Hypergraph Partitioning","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Hypergraph; Recursive partitioning; Computer science; Parallel computing; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Machine learning","score_opus":0.00886469763933031,"score_gpt":0.20168195109339793,"score_spread":0.1928172534540676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102057615,0.000536387,0.984279,0.00011569292,0.000038813894,0.00010264478,0.00008948074,0.00078137795,0.0038507949],"genre_scores_gemma":[0.11922657,0.0005760552,0.8744132,0.00018894041,0.00006536178,0.00023787536,0.0006525566,0.0004542843,0.0041851974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988632,0.00029547504,0.000061863095,0.00026481439,0.0003760327,0.00013857923],"domain_scores_gemma":[0.9985145,0.00054736744,0.00010199692,0.00030314707,0.00046707282,0.00006590996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090884935,0.0012126693,0.00093883136,0.0019508315,0.00086465647,0.0011756283,0.0018267897,0.000942673,0.0048177866],"category_scores_gemma":[0.0032518825,0.00057074067,0.0013267739,0.0020195819,0.00069532095,0.0023866051,0.0015492309,0.001355452,0.0015757512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016370243,0.00016795218,0.001475718,0.0003594222,0.00013042684,0.00022341001,0.00044847385,0.3882511,0.033329163,0.04891656,0.009535546,0.5169985],"study_design_scores_gemma":[0.00004299567,0.00013176352,0.0005467984,0.00003922888,0.00006023421,0.00019089087,0.00010380081,0.9581258,0.00883284,0.017772937,0.014122297,0.000030467163],"about_ca_topic_score_codex":0.006418148,"about_ca_topic_score_gemma":0.010085678,"teacher_disagreement_score":0.006418148,"about_ca_system_score_codex":0.0008705391,"about_ca_system_score_gemma":0.0015289227,"threshold_uncertainty_score":0.016117096},"labels":[],"label_agreement":null},{"id":"W4402500849","doi":"10.48550/arxiv.2408.08449","title":"Machine Learning for Optimization-Based Separation of Mixed-Integer Rounding Cuts","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Rounding; Integer (computer science); Separation (statistics); Computer science; Integer programming; Mathematical optimization; Algorithm; Mathematics; Machine learning; Programming language; Operating system","score_opus":0.043855588304896706,"score_gpt":0.19887066843722784,"score_spread":0.15501508013233112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402500849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014318699,0.00041182595,0.9808367,0.00031196672,0.00005006986,0.00010180815,0.0001589303,0.0009399831,0.0028700323],"genre_scores_gemma":[0.3324484,0.00034380823,0.6622173,0.0003485181,0.00008875044,0.0005140174,0.0012235169,0.00038536437,0.0024303389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984106,0.00065026904,0.00008822982,0.00035026367,0.00037346693,0.00012712463],"domain_scores_gemma":[0.99449795,0.0039379336,0.00043791404,0.00049880054,0.00053709047,0.0000903713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026297409,0.0016635188,0.0011468978,0.0011333536,0.0004998425,0.0014438885,0.0015016841,0.0012872786,0.004215432],"category_scores_gemma":[0.011518926,0.0007864007,0.0014098382,0.0011128554,0.0010786718,0.0013929716,0.0012258459,0.0033956699,0.0009298646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007564984,0.0000809088,0.00080410996,0.00013593693,0.000036332654,0.00003839221,0.000041653093,0.9075334,0.00093992724,0.014163908,0.0024241656,0.07372568],"study_design_scores_gemma":[0.000007804533,0.000016555809,0.000044413602,0.000009277398,0.000003049242,0.000006701986,0.0000045800834,0.9922192,0.00033447144,0.006967325,0.00038435048,0.0000022685642],"about_ca_topic_score_codex":0.002150727,"about_ca_topic_score_gemma":0.0027811143,"teacher_disagreement_score":0.004215432,"about_ca_system_score_codex":0.0014649107,"about_ca_system_score_gemma":0.0014601245,"threshold_uncertainty_score":0.014101982},"labels":[],"label_agreement":null},{"id":"W4402593076","doi":"10.1109/tcad.2024.3462904","title":"Automated Topology Synthesis of Analog Integrated Circuits With Frequency Compensation","year":2024,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Postdoctoral Science Foundation of Guangxi Province of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Compensation (psychology); Analogue electronics; Topology (electrical circuits); Computer science; Electronic engineering; Electronic circuit; Electrical engineering; Engineering; Psychology","score_opus":0.02133183242283132,"score_gpt":0.2254494546427416,"score_spread":0.20411762221991028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402593076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012616413,0.00015479105,0.98364085,0.000047815807,0.000020209218,0.00003884552,0.000042004584,0.0005292367,0.002909832],"genre_scores_gemma":[0.5365901,0.0002375369,0.46047005,0.000055949404,0.000028843082,0.00012997056,0.00015776853,0.0001541175,0.002175648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968004,0.00007766944,0.000016226768,0.00005986475,0.00013263198,0.000033580698],"domain_scores_gemma":[0.99974185,0.00010862675,0.000027760445,0.000059698097,0.000052990963,0.000009048263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032425777,0.00043701997,0.0003627289,0.00046524766,0.0003131041,0.00039022553,0.0005604727,0.00030884586,0.0017571864],"category_scores_gemma":[0.0007499773,0.00023963362,0.0004904201,0.00046897496,0.0004335203,0.00045893106,0.00038491466,0.00044686775,0.0003438924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005550507,0.000028672204,0.00034610668,0.00017400798,0.000027234253,0.000093588336,0.0000660553,0.65915614,0.0551091,0.047622845,0.001208708,0.23611201],"study_design_scores_gemma":[0.000021642563,0.00006727563,0.00013066918,0.0000076749275,0.000012663231,0.000050506962,0.000011555619,0.9647973,0.015245834,0.015311009,0.004334976,0.000008935206],"about_ca_topic_score_codex":0.0015269978,"about_ca_topic_score_gemma":0.0024390938,"teacher_disagreement_score":0.0017571864,"about_ca_system_score_codex":0.0005177638,"about_ca_system_score_gemma":0.0009944552,"threshold_uncertainty_score":0.0058783293},"labels":[],"label_agreement":null},{"id":"W4402835945","doi":"10.1109/isvlsi61997.2024.00049","title":"Boosting Multiple Multipliers Packing on FPGA DSP Blocks via Truncation and Compensation-based Approximation","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Boosting (machine learning); Field-programmable gate array; Digital signal processing; Computer science; Truncation (statistics); Compensation (psychology); Parallel computing; Computer hardware; Artificial intelligence","score_opus":0.013009273712594421,"score_gpt":0.2162666488218434,"score_spread":0.203257375109249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402835945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07021254,0.00037151057,0.92280203,0.00013201065,0.000101551195,0.00005201995,0.00004398746,0.0014682196,0.004816058],"genre_scores_gemma":[0.5734861,0.0002640817,0.4196243,0.00016568686,0.000055278513,0.000074862466,0.00015001257,0.000111709975,0.0060680225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996351,0.00004370652,0.000022824888,0.00004935816,0.00020393016,0.000045003348],"domain_scores_gemma":[0.99944717,0.00017820841,0.0000867823,0.00012085434,0.00013756401,0.000029472454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043631648,0.00054423994,0.0004362196,0.00039455434,0.00026282505,0.00053248374,0.0007020751,0.00034718408,0.0020690192],"category_scores_gemma":[0.001584093,0.00022030556,0.0002787941,0.00039494722,0.00035148114,0.00071675575,0.0005688035,0.00065328984,0.0007727635],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006351268,0.0001548344,0.0022495543,0.00015874022,0.000051981024,0.00033942435,0.00015279079,0.44579858,0.08646522,0.023790184,0.004235134,0.43596843],"study_design_scores_gemma":[0.000014076531,0.000116303745,0.00021816292,0.000015693176,0.000009749041,0.00008543554,0.0000124131875,0.9687176,0.026020916,0.0018719981,0.0029083923,0.000009275457],"about_ca_topic_score_codex":0.0015857975,"about_ca_topic_score_gemma":0.0025527985,"teacher_disagreement_score":0.0020690192,"about_ca_system_score_codex":0.00045451822,"about_ca_system_score_gemma":0.00082129077,"threshold_uncertainty_score":0.0069215894},"labels":[],"label_agreement":null},{"id":"W4403023860","doi":"10.1109/iccims61672.2024.10690349","title":"Optimized FPGA-Based 16-bits Squarers Using LUTs and a Divide-and-Conquer Approach","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Divide and conquer algorithms; Computer science; Field-programmable gate array; Computer architecture; Parallel computing; Computer hardware; Algorithm","score_opus":0.018267259448035502,"score_gpt":0.22798629173866544,"score_spread":0.20971903229062994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403023860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12221884,0.0014779677,0.85133916,0.00036473284,0.00020226349,0.0002635956,0.00023302596,0.0066674487,0.017233012],"genre_scores_gemma":[0.2934046,0.00046364628,0.6958905,0.0001345516,0.0000616854,0.0001327895,0.00035685507,0.00021092192,0.009344375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966824,0.000050867915,0.0000313782,0.00006787128,0.00013228542,0.000049423106],"domain_scores_gemma":[0.99968135,0.000100599806,0.000052416697,0.00006194612,0.00008769526,0.000016015336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027573196,0.000718575,0.00053291814,0.00054014544,0.00034778367,0.0008345534,0.00065424846,0.0003472574,0.0059909914],"category_scores_gemma":[0.0007195086,0.0003126316,0.00039951692,0.000682836,0.00031172417,0.0009426366,0.00035009717,0.00045919453,0.0014999934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008317121,0.00017584112,0.0012477979,0.0004591346,0.00013200068,0.00033654348,0.00024420817,0.10428524,0.16752525,0.03223746,0.008878176,0.6836466],"study_design_scores_gemma":[0.0003605069,0.0012094337,0.0013108155,0.000085871965,0.00016381599,0.0008041017,0.00015776357,0.67738324,0.25755727,0.009373213,0.051490996,0.000102941754],"about_ca_topic_score_codex":0.002124388,"about_ca_topic_score_gemma":0.004946939,"teacher_disagreement_score":0.0059909914,"about_ca_system_score_codex":0.0006036757,"about_ca_system_score_gemma":0.0010572865,"threshold_uncertainty_score":0.020041823},"labels":[],"label_agreement":null},{"id":"W4403165789","doi":"10.61091/jcmcc122-13","title":"Fractional Vertex Cover Reliability of Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cover (algebra); Reliability (semiconductor); Vertex (graph theory); Combinatorics; Vertex cover; Mathematics; Graph; Physics; Engineering; Quantum mechanics","score_opus":0.008706361647812341,"score_gpt":0.23684661620236158,"score_spread":0.22814025455454923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7451358,0.0009496594,0.2389469,0.0005376739,0.000041845145,0.000053400738,0.00055730244,0.00036298667,0.01341447],"genre_scores_gemma":[0.9876908,0.00024236077,0.0110819265,0.000034186192,0.00003340908,0.000032584434,0.00016320958,0.000044192653,0.0006772995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991405,0.00023814494,0.000031871095,0.00014331842,0.00023706566,0.00020910519],"domain_scores_gemma":[0.99170697,0.0060429866,0.00077759934,0.00065737346,0.0005924449,0.00022267783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177502,0.00039319776,0.00062462536,0.0016922558,0.0005815258,0.0010133055,0.0008849309,0.0006033829,0.0019767296],"category_scores_gemma":[0.013535516,0.00039332485,0.00038013377,0.0012495088,0.00094331766,0.001739274,0.00059799047,0.00057189126,0.00017915621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031883508,0.000056321438,0.006914649,0.0001733473,0.000042554784,0.00023448163,0.00026662758,0.76900995,0.0066752005,0.17750514,0.0027184878,0.03608452],"study_design_scores_gemma":[0.000015863756,0.000059307848,0.0031453916,0.000023946317,0.000023366361,0.00019421923,0.0000862437,0.83674186,0.0025564427,0.15598997,0.0011440443,0.000019485416],"about_ca_topic_score_codex":0.0025728778,"about_ca_topic_score_gemma":0.002023189,"teacher_disagreement_score":0.0025728778,"about_ca_system_score_codex":0.001820892,"about_ca_system_score_gemma":0.00054713653,"threshold_uncertainty_score":0.013211548},"labels":[],"label_agreement":null},{"id":"W4403331456","doi":"10.1109/access.2024.3478832","title":"An Open-Source AMS Circuit Optimization Framework Based on Reinforcement Learning—From Specifications to Layouts","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Open source; Artificial intelligence; Computer architecture; Programming language; Software","score_opus":0.06595372534878907,"score_gpt":0.3090599298475921,"score_spread":0.24310620449880305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403331456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00544711,0.00009366431,0.98855317,0.00007697066,0.000024662615,0.00003814764,0.000065707536,0.0028348933,0.002865662],"genre_scores_gemma":[0.4537093,0.00016912587,0.53978974,0.00014414555,0.00005561648,0.00024809825,0.00024303985,0.0007992747,0.004841676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965715,0.00007254738,0.000012549483,0.00006403628,0.00015769734,0.000036057972],"domain_scores_gemma":[0.999663,0.00014480745,0.000037923674,0.000042338073,0.000085940934,0.000026085423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501621,0.0006791018,0.00054407114,0.00037760497,0.00024090918,0.00063702214,0.0015041727,0.0008010586,0.0050130854],"category_scores_gemma":[0.0015920753,0.00032279175,0.0006593717,0.00026423557,0.0005485323,0.00060461345,0.00078027375,0.0010228626,0.0007319207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030079575,0.000028426048,0.00025270393,0.000043586875,0.000016681322,0.000039248487,0.00001821173,0.9416985,0.002650758,0.008870548,0.0010286096,0.04532271],"study_design_scores_gemma":[0.0000076000697,0.000012972814,0.000024765366,0.0000023086425,0.0000022053687,0.000008195323,0.0000014027431,0.99644583,0.0006144664,0.001991323,0.0008866481,0.0000023152616],"about_ca_topic_score_codex":0.0038647659,"about_ca_topic_score_gemma":0.005017925,"teacher_disagreement_score":0.0050130854,"about_ca_system_score_codex":0.0007619351,"about_ca_system_score_gemma":0.0011469394,"threshold_uncertainty_score":0.016770422},"labels":[],"label_agreement":null},{"id":"W4405709599","doi":"10.23919/emc.2003.10806210","title":"Modeling and Simulation of Electrical Interconnects, Packages and Devices for Highspeed Applications","year":2003,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Electronic engineering; Electrical engineering; Engineering","score_opus":0.016080316567936494,"score_gpt":0.2542492122811001,"score_spread":0.2381688957131636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405709599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020789208,0.0034035584,0.94931716,0.00058741844,0.0002558306,0.00015581888,0.0008039203,0.0023422628,0.022344878],"genre_scores_gemma":[0.48010457,0.013315712,0.46441358,0.00041985724,0.0003726987,0.0015530771,0.0029527284,0.0010896414,0.035778154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967766,0.00007641102,0.00001685748,0.000024621419,0.00017675561,0.000027798373],"domain_scores_gemma":[0.99975294,0.0001158943,0.000026290021,0.00004311146,0.000047928144,0.0000137545285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036496652,0.0010087399,0.00084299763,0.0004480048,0.00039068153,0.0011849265,0.0016259166,0.001821986,0.0047014616],"category_scores_gemma":[0.0009263862,0.00057363877,0.0010462267,0.00078305736,0.0003359165,0.0012218527,0.0004978518,0.0009729039,0.0019343246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001758957,0.000017587592,0.00022738133,0.00015337326,0.000027275419,0.00006935646,0.00003833845,0.96629715,0.0051312647,0.011690021,0.0021199477,0.014210766],"study_design_scores_gemma":[0.000010480945,0.00002513735,0.00014933346,0.000014031717,0.000013747792,0.000051661198,0.00000806911,0.9848564,0.001545367,0.003742798,0.009575766,0.0000072521952],"about_ca_topic_score_codex":0.002737895,"about_ca_topic_score_gemma":0.0033065446,"teacher_disagreement_score":0.0047014616,"about_ca_system_score_codex":0.0005327292,"about_ca_system_score_gemma":0.00095031067,"threshold_uncertainty_score":0.015727997},"labels":[],"label_agreement":null},{"id":"W4405767988","doi":"10.1007/978-3-031-77426-3_10","title":"Enhancing K-Way Circuit Partitioning: A Deep Reinforcement Learning Methodology","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence","score_opus":0.07926175215237737,"score_gpt":0.305504035482383,"score_spread":0.22624228333000562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405767988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028036345,0.0002213265,0.96397525,0.00010138537,0.00004598234,0.000035089673,0.000031038286,0.0006124182,0.0069411835],"genre_scores_gemma":[0.66970336,0.00021221084,0.320591,0.00015641628,0.000028630604,0.00007763894,0.00007833746,0.00014698169,0.0090054115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998648,0.00003247342,0.0000053650715,0.000030480598,0.00004136188,0.000025477038],"domain_scores_gemma":[0.9997434,0.00011506721,0.000026819567,0.000046783076,0.000053176533,0.000014746803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027488888,0.0005802316,0.0004601359,0.00028368883,0.00027233968,0.0004512442,0.0012357385,0.0006378684,0.0043451865],"category_scores_gemma":[0.0007118274,0.00028841005,0.0003784948,0.00032237748,0.00039250046,0.00078722625,0.0006098415,0.0008374538,0.0005237445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079252866,0.000090479916,0.00037185705,0.00008677784,0.0000407397,0.000051667106,0.000046011653,0.7617867,0.01511619,0.0142337335,0.0019145831,0.20618196],"study_design_scores_gemma":[0.0000042887655,0.000034531156,0.000049705566,0.000004867981,0.000007866295,0.000017942757,0.0000056225977,0.99314076,0.0023903209,0.0036266926,0.00071490166,0.0000026101243],"about_ca_topic_score_codex":0.0021315992,"about_ca_topic_score_gemma":0.0045074364,"teacher_disagreement_score":0.0043451865,"about_ca_system_score_codex":0.0005518889,"about_ca_system_score_gemma":0.00055310305,"threshold_uncertainty_score":0.014536083},"labels":[],"label_agreement":null},{"id":"W4406135336","doi":"10.1016/j.aej.2024.12.077","title":"An Auto-Adjusting Hybrid Quantum Genetic Algorithm-Spectre platform for the multi-objective optimization of analog circuit sizing","year":2025,"lang":"en","type":"article","venue":"Alexandria Engineering Journal","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Viet Nam National University Ho Chi Minh City","keywords":"Sizing; Genetic algorithm; Quantum; Optimization algorithm; Computer science; Algorithm; Electronic engineering; Mathematical optimization; Mathematics; Engineering; Machine learning; Physics; Chemistry","score_opus":0.014320476623969727,"score_gpt":0.23326555394190757,"score_spread":0.21894507731793783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406135336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064867064,0.00018282517,0.92773503,0.000120334276,0.000037382204,0.00007255214,0.000028482742,0.0005836329,0.006372745],"genre_scores_gemma":[0.6681955,0.00009950339,0.32905576,0.00007204026,0.000009353894,0.00015478715,0.000046336478,0.00004661358,0.0023201727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983454,0.00005180191,0.000004443057,0.000019684825,0.0000714533,0.000018141742],"domain_scores_gemma":[0.9998115,0.000103002596,0.000017948874,0.00001926627,0.000039251274,0.000009081035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047514314,0.00035642995,0.0003843551,0.00043029326,0.00027932783,0.00045896802,0.00063784077,0.00051471125,0.0015097226],"category_scores_gemma":[0.0007934761,0.00022326135,0.00034610246,0.00031635005,0.00038981042,0.00028047452,0.00046946268,0.0004408678,0.00014865962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028143335,0.000040833736,0.00044964923,0.000029402407,0.000028106535,0.00003570676,0.000029514023,0.9459913,0.00580139,0.0075630294,0.0003443954,0.039658546],"study_design_scores_gemma":[0.0000060620437,0.00002016727,0.00005435093,0.0000018610533,0.0000029870241,0.0000061541195,0.000002635371,0.9984339,0.0005793464,0.00060336414,0.00028708292,0.0000022235624],"about_ca_topic_score_codex":0.0024695047,"about_ca_topic_score_gemma":0.0031905018,"teacher_disagreement_score":0.0024695047,"about_ca_system_score_codex":0.00042670403,"about_ca_system_score_gemma":0.00065543485,"threshold_uncertainty_score":0.00505054},"labels":[],"label_agreement":null},{"id":"W4406727639","doi":"10.11606/d.45.2024.tde-22012025-113608","title":"On rounding algorithms for the 2-edge-connected spanning subgraph problem","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Rounding; Enhanced Data Rates for GSM Evolution; Computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.01817764118082507,"score_gpt":0.26852990811366434,"score_spread":0.2503522669328393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406727639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017402362,0.004534918,0.9509564,0.0017235981,0.00048407525,0.00042565973,0.0004879845,0.0018127989,0.022172116],"genre_scores_gemma":[0.13682307,0.0031745976,0.8501959,0.0013538821,0.00048381125,0.00086962787,0.0011830914,0.00061235577,0.005303747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632263,0.0014403532,0.00025245245,0.00062382553,0.0008040145,0.0005567974],"domain_scores_gemma":[0.9927215,0.0050841393,0.00041948026,0.0011334432,0.0005002035,0.00014110275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034124774,0.0028113667,0.0019349875,0.0014442537,0.0019339556,0.003357649,0.002421204,0.0022201238,0.0070517617],"category_scores_gemma":[0.014497529,0.0009625384,0.0026351744,0.0032996251,0.0017305978,0.0052674017,0.0032040118,0.005745031,0.0029144068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087096624,0.0005800254,0.0013173717,0.0007056637,0.0001353686,0.00021416534,0.0005178708,0.4530097,0.004055792,0.19999488,0.032148104,0.30645013],"study_design_scores_gemma":[0.00022828921,0.00014558212,0.0002936619,0.00020616816,0.00007635064,0.00018936672,0.00019815336,0.7104268,0.0019687053,0.27292094,0.013292066,0.000053914107],"about_ca_topic_score_codex":0.0053687957,"about_ca_topic_score_gemma":0.0056173536,"teacher_disagreement_score":0.0070517617,"about_ca_system_score_codex":0.0026107782,"about_ca_system_score_gemma":0.0030858666,"threshold_uncertainty_score":0.023590505},"labels":[],"label_agreement":null},{"id":"W4407362419","doi":"10.1109/rsp64122.2024.10870942","title":"Invited Paper--Circuit Partitioning with Reinforcement Learning and Edge-Based Initialization","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Initialization; Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Programming language","score_opus":0.011584886393516696,"score_gpt":0.21189103346333862,"score_spread":0.20030614706982192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407362419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02082431,0.000830449,0.95965946,0.0006168178,0.00035250012,0.00010857597,0.000059486898,0.001516879,0.016031561],"genre_scores_gemma":[0.54538816,0.0006823911,0.42798817,0.0004790779,0.00028688408,0.00016878256,0.00034447273,0.0005240124,0.02413797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995528,0.00013498742,0.000017606877,0.00010521717,0.00014448982,0.000044811513],"domain_scores_gemma":[0.99905986,0.00045379915,0.000048534508,0.00011840277,0.00025464603,0.00006472653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081771734,0.0006722852,0.0005728001,0.00046930788,0.00041205014,0.0008858467,0.0012663491,0.0008482877,0.011582799],"category_scores_gemma":[0.0026767917,0.00031553104,0.00055884814,0.00041843395,0.00043679238,0.0011299272,0.00086089043,0.001183566,0.002237653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018885975,0.00013273594,0.0010574637,0.00013561246,0.00005600516,0.000110266556,0.000072360446,0.6340482,0.006933793,0.015703823,0.010056414,0.33150443],"study_design_scores_gemma":[0.000016675498,0.000059195205,0.0001114708,0.000013342841,0.000008905752,0.00004249941,0.000010656392,0.98818445,0.0028118861,0.0039659925,0.004766567,0.0000083071955],"about_ca_topic_score_codex":0.0021217766,"about_ca_topic_score_gemma":0.0025680498,"teacher_disagreement_score":0.011582799,"about_ca_system_score_codex":0.0007484383,"about_ca_system_score_gemma":0.00067402155,"threshold_uncertainty_score":0.038748324},"labels":[],"label_agreement":null},{"id":"W4407560990","doi":"10.3390/technologies13020081","title":"Research on Circuit Partitioning Algorithm Based on Partition Connectivity Clustering and Tabu Search","year":2025,"lang":"en","type":"article","venue":"Technologies","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Science Foundation of Hainan Province","keywords":"Tabu search; Cluster analysis; Partition (number theory); Benchmark (surveying); Algorithm; Graph partition; Computer science; Vertex (graph theory); Mathematics; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.06252756984955835,"score_gpt":0.3266941586500502,"score_spread":0.2641665888004918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407560990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020484641,0.0030917523,0.96808517,0.00018281925,0.000097447075,0.000114853574,0.00006837381,0.0009910344,0.006884019],"genre_scores_gemma":[0.33030686,0.0039533763,0.65842444,0.00026054177,0.00012813222,0.0004707308,0.0006837965,0.0003922613,0.005379859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993337,0.00015172848,0.00003950087,0.00013971952,0.00026853802,0.00006678107],"domain_scores_gemma":[0.99944884,0.00018735534,0.000053439773,0.00006471426,0.00022599046,0.000019553507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056465296,0.0009545438,0.0011073722,0.0022048801,0.00089859706,0.0011192801,0.0014785053,0.00080592505,0.0032786357],"category_scores_gemma":[0.0016901514,0.00044180301,0.00079046533,0.0029303688,0.0006203735,0.0018982765,0.0005246571,0.00075492734,0.00065277604],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010691435,0.00008884686,0.0014262577,0.0005626017,0.000111563335,0.00005055037,0.00017984721,0.3442691,0.011131072,0.035522394,0.0047196653,0.60183114],"study_design_scores_gemma":[0.000051842857,0.00009784992,0.0006876724,0.000044230776,0.000053213877,0.00015383004,0.00007725742,0.9736032,0.005830587,0.010972537,0.008397014,0.000030909643],"about_ca_topic_score_codex":0.007482121,"about_ca_topic_score_gemma":0.0053366255,"teacher_disagreement_score":0.007482121,"about_ca_system_score_codex":0.0013695589,"about_ca_system_score_gemma":0.0016241611,"threshold_uncertainty_score":0.0148771405},"labels":[],"label_agreement":null},{"id":"W4408146705","doi":"10.1109/icmla61862.2024.00012","title":"Leveraging A* Pathfinding for Efficient Deep Reinforcement Learning in Obstacle-Dense Environments","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thales (Canada)","funders":"","keywords":"Pathfinding; Reinforcement learning; Computer science; Obstacle; Artificial intelligence; Human–computer interaction; Theoretical computer science; Graph; Geography","score_opus":0.01343362425897058,"score_gpt":0.21927688925410566,"score_spread":0.20584326499513508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408146705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033451512,0.00010034995,0.9635224,0.00009120339,0.000031884076,0.000023114719,0.000017639019,0.0009041747,0.001857669],"genre_scores_gemma":[0.74377114,0.00011283157,0.25374323,0.00010488351,0.000017590524,0.000057402085,0.00006420579,0.000072225215,0.0020565859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998784,0.00001984073,0.000006770455,0.000031924916,0.000039319017,0.000023711034],"domain_scores_gemma":[0.99969053,0.00010783941,0.00004393843,0.000053383872,0.000070657894,0.000033589633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906739,0.0005194893,0.00033422216,0.00021429335,0.00022249653,0.00042717185,0.00087523874,0.0004306392,0.0011056298],"category_scores_gemma":[0.0008188865,0.00022828889,0.00020161725,0.00018756425,0.00038230064,0.00067228137,0.0008574426,0.0007374127,0.0003493012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001248207,0.00017735828,0.0018013684,0.00007997549,0.000058155507,0.00013237186,0.00008476874,0.6695894,0.044851776,0.009589151,0.0017589594,0.27175182],"study_design_scores_gemma":[0.000007711924,0.00005506118,0.00011615738,0.0000032162127,0.0000044942135,0.000021956368,0.000005755197,0.9934616,0.0032917752,0.002286862,0.0007412229,0.000004283152],"about_ca_topic_score_codex":0.0025306127,"about_ca_topic_score_gemma":0.0031320148,"teacher_disagreement_score":0.0025306127,"about_ca_system_score_codex":0.00028530677,"about_ca_system_score_gemma":0.00075563166,"threshold_uncertainty_score":0.005031824},"labels":[],"label_agreement":null},{"id":"W4408735932","doi":"10.1016/j.eng.2025.03.020","title":"An Exact Algorithm for Placement Optimization in Circuit Design","year":2025,"lang":"en","type":"article","venue":"Engineering","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Optimization algorithm; Mathematical optimization; Mathematics","score_opus":0.012105796683843373,"score_gpt":0.22594848984908525,"score_spread":0.21384269316524188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408735932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009458508,0.0001806868,0.9946115,0.00007563235,0.00003894092,0.00006855605,0.000062261606,0.00054565,0.0034709207],"genre_scores_gemma":[0.031379692,0.00026144346,0.9644983,0.00009328732,0.00004590062,0.00035500753,0.0002318349,0.00019166908,0.002942893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992132,0.00017961785,0.000040230723,0.00014394692,0.00032345924,0.0000993581],"domain_scores_gemma":[0.9988667,0.0007213414,0.000067782785,0.00010990896,0.00020501958,0.000029266892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554615,0.0022059996,0.0015771051,0.001462204,0.0010021634,0.0012655617,0.0016335788,0.0013210915,0.0128060505],"category_scores_gemma":[0.0030715521,0.0009713794,0.001244349,0.0023062155,0.00085886335,0.0013548551,0.001393292,0.0019361419,0.0035355487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006516869,0.00007514416,0.00024139335,0.0002301184,0.000038511473,0.00007328706,0.000068661655,0.7122777,0.0017684902,0.025976667,0.00802735,0.25115746],"study_design_scores_gemma":[0.000040358194,0.000036998543,0.000044355842,0.000017993429,0.00000926315,0.000038345697,0.000017177834,0.9763189,0.00044595066,0.019022973,0.00400116,0.000006572442],"about_ca_topic_score_codex":0.0065132207,"about_ca_topic_score_gemma":0.010018228,"teacher_disagreement_score":0.0128060505,"about_ca_system_score_codex":0.0014477576,"about_ca_system_score_gemma":0.002675785,"threshold_uncertainty_score":0.04284054},"labels":[],"label_agreement":null},{"id":"W4408791630","doi":"10.1109/access.2025.3553743","title":"Generative AI for Analog Integrated Circuit Design: Methodologies and Applications","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generative Design; Computer architecture; Generative grammar; Artificial intelligence; Engineering","score_opus":0.12777345340857676,"score_gpt":0.3848454682543568,"score_spread":0.25707201484578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408791630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026492758,0.05503318,0.930929,0.0006726034,0.00012334944,0.00010892009,0.00018727891,0.00049466704,0.009801672],"genre_scores_gemma":[0.15975027,0.093054585,0.73738664,0.00064110203,0.0003027237,0.00062334613,0.00084776763,0.00035921572,0.0070343665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991326,0.00033247797,0.000065252316,0.00015445451,0.0002898318,0.000025494608],"domain_scores_gemma":[0.99720925,0.0022152944,0.00010698838,0.00021787072,0.00022277463,0.000027801043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014020116,0.0010762095,0.0007567087,0.0017520272,0.00028419695,0.0014873942,0.0015064534,0.0009135342,0.003992191],"category_scores_gemma":[0.004486246,0.0005520494,0.0013405113,0.0019599316,0.0010351796,0.0012453314,0.0009738647,0.0012541417,0.0011055414],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002626336,0.00006472531,0.0013653466,0.0061699045,0.00027858382,0.00014812565,0.00038616554,0.18392396,0.004125179,0.11993932,0.0048516616,0.6787207],"study_design_scores_gemma":[0.000028506936,0.00016297669,0.001150704,0.0021262106,0.00020007683,0.0007083679,0.00022116557,0.56871957,0.0058066584,0.28456104,0.13622229,0.00009245783],"about_ca_topic_score_codex":0.00195991,"about_ca_topic_score_gemma":0.0028339415,"teacher_disagreement_score":0.003992191,"about_ca_system_score_codex":0.0008586588,"about_ca_system_score_gemma":0.0011393066,"threshold_uncertainty_score":0.013355255},"labels":[],"label_agreement":null},{"id":"W4410295132","doi":"10.1109/edaps64431.2024.10988466","title":"Machine Learning based Netlisting for Hand-drawn Circuit Schematics with Subcircuits for High-Speed Applications","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Schematic; Computer science; Computer architecture; Electrical engineering; Engineering","score_opus":0.022249029713486104,"score_gpt":0.2349051326424329,"score_spread":0.2126561029289468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410295132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026617339,0.000548684,0.9554234,0.00015810691,0.00008861808,0.00014989161,0.0005366031,0.0059677036,0.010509746],"genre_scores_gemma":[0.20146152,0.0006134824,0.7879311,0.00012788185,0.000030944284,0.00013545457,0.00087986805,0.00033172278,0.008488087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992144,0.000014986257,0.000006192659,0.000017884431,0.0000326246,0.0000067990613],"domain_scores_gemma":[0.99971193,0.00014319977,0.000033631703,0.000052380474,0.00005086946,0.0000079622705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013925778,0.00058538455,0.00023255973,0.00086458476,0.0002077985,0.0006174389,0.0006334408,0.00027664463,0.016244356],"category_scores_gemma":[0.00074925966,0.00019786585,0.0002511159,0.0008249576,0.00024991427,0.0008452092,0.00023139655,0.00042039904,0.0016392524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019502401,0.000046634534,0.0007633311,0.00051501195,0.000040101728,0.0004108848,0.00017310925,0.046541933,0.11355685,0.017344186,0.0066763237,0.8137367],"study_design_scores_gemma":[0.00008250118,0.0005155822,0.0032894225,0.00023120405,0.00010733433,0.0017789291,0.000162601,0.6336472,0.22172354,0.024412168,0.11397961,0.00006986403],"about_ca_topic_score_codex":0.0011785412,"about_ca_topic_score_gemma":0.0047438554,"teacher_disagreement_score":0.016244356,"about_ca_system_score_codex":0.00042118845,"about_ca_system_score_gemma":0.00042178694,"threshold_uncertainty_score":0.054342747},"labels":[],"label_agreement":null},{"id":"W4410344137","doi":"10.1145/3734798","title":"VTR 9: Open-Source CAD for Fabric and Beyond FPGA Architecture Exploration","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo; Cerebral Diagnostics (Canada); University of Toronto","funders":"Google","keywords":"Computer science; Field-programmable gate array; CAD; Architecture; Computer architecture; Embedded system; Open source; Computer hardware; Operating system; Engineering drawing; Software","score_opus":0.01694436650770665,"score_gpt":0.24345839648382095,"score_spread":0.2265140299761143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410344137","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009874168,0.00095116644,0.6898901,0.00038821195,0.00041821977,0.0003934685,0.013511156,0.2121538,0.07241973],"genre_scores_gemma":[0.13461226,0.0020520233,0.658625,0.0007865666,0.00015950498,0.0015682536,0.061213426,0.079216324,0.06176664],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988632,0.000119970726,0.00005454335,0.0000965288,0.0007435985,0.00012214808],"domain_scores_gemma":[0.99898535,0.00035485154,0.000070657225,0.0002525022,0.000287132,0.00004953005],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011205733,0.0017159563,0.0005948605,0.0014172258,0.0004009668,0.0015359318,0.003513356,0.0011017512,0.06861792],"category_scores_gemma":[0.003004257,0.00101963,0.0014453675,0.00082428806,0.00035689116,0.0015396827,0.0014789616,0.0017215254,0.019599607],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005123498,0.00025845485,0.0022235338,0.0013570093,0.00016939767,0.00064809935,0.00027572,0.10713006,0.03433987,0.048876353,0.3611868,0.4430223],"study_design_scores_gemma":[0.00046666674,0.000299714,0.0013203745,0.0003224424,0.00006033268,0.0007703017,0.00006572093,0.3590668,0.040131774,0.019210938,0.5781188,0.00016609924],"about_ca_topic_score_codex":0.0031650793,"about_ca_topic_score_gemma":0.0063567115,"teacher_disagreement_score":0.99648666,"about_ca_system_score_codex":0.0008512732,"about_ca_system_score_gemma":0.0016340729,"threshold_uncertainty_score":0.22954977},"labels":[],"label_agreement":null},{"id":"W4411319152","doi":"10.1145/3717823.3718271","title":"Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman","year":2025,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Supercritical fluid; Monotone polygon; Computer science; Resolution (logic); Electronic circuit; Mathematics; Artificial intelligence; Geometry; Engineering","score_opus":0.010432146389410344,"score_gpt":0.2331253876517962,"score_spread":0.22269324126238585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2909191,0.002442305,0.6207445,0.003473272,0.00012312725,0.0001951828,0.00039912865,0.0011133124,0.08059003],"genre_scores_gemma":[0.87692434,0.00078177213,0.11395995,0.0008044557,0.00013624747,0.0002654891,0.00024292074,0.000282863,0.0066020717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639916,0.00066942256,0.00019003818,0.0006975786,0.0013429736,0.0007008962],"domain_scores_gemma":[0.97615004,0.017663946,0.0014581666,0.0027512994,0.0011558535,0.0008206436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032540467,0.0009151336,0.0011099386,0.0022131517,0.0015182804,0.003743745,0.0022931611,0.0021128615,0.008214676],"category_scores_gemma":[0.02707964,0.0008715775,0.0017873385,0.0014083264,0.0049105454,0.007886856,0.0040461575,0.005968533,0.00076389406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004625787,0.000122677,0.0027515162,0.00028402955,0.00008421558,0.00026780454,0.0004464565,0.0471233,0.013715098,0.89391774,0.0030374492,0.037787095],"study_design_scores_gemma":[0.000061377876,0.00012201979,0.0008595302,0.00009362196,0.00006482091,0.00036339724,0.00014328441,0.22648281,0.017650507,0.7497805,0.0043101516,0.000067988636],"about_ca_topic_score_codex":0.0013051801,"about_ca_topic_score_gemma":0.0021985967,"teacher_disagreement_score":0.008214676,"about_ca_system_score_codex":0.002829131,"about_ca_system_score_gemma":0.0010494476,"threshold_uncertainty_score":0.02748084},"labels":[],"label_agreement":null},{"id":"W4412695933","doi":"10.1145/3754339","title":"Analog and Mixed-Signal IC Modeling and Optimization: An Artificial Intelligence Perspective","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Mixed-signal integrated circuit; Perspective (graphical); Artificial intelligence; Domain (mathematical analysis); Machine learning; Categorization; Analogue electronics; Integrated circuit; Computer engineering; Electronic circuit","score_opus":0.023520556912250166,"score_gpt":0.2606866833356658,"score_spread":0.23716612642341564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412695933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048012254,0.0075624837,0.977414,0.0011546452,0.00007910494,0.000022835688,0.000071689115,0.00018229905,0.008711674],"genre_scores_gemma":[0.5659264,0.04298885,0.37722728,0.00069389143,0.0009148281,0.00023649198,0.00033868046,0.00020078961,0.0114728175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00015313833,0.00002082575,0.00005904223,0.0001723716,0.000024114099],"domain_scores_gemma":[0.9994773,0.00032841015,0.0000575564,0.000063093845,0.00006230552,0.000011348973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932187,0.00084522367,0.0008336858,0.00070857897,0.00023288392,0.0013575422,0.0009903135,0.0008793833,0.00119785],"category_scores_gemma":[0.0013939064,0.00041283647,0.00068297394,0.0009341723,0.0010266933,0.0013246667,0.0005721503,0.0011597213,0.00041549854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014853924,0.000026681128,0.0005549939,0.0002577712,0.000042099822,0.000045976598,0.000042913918,0.82417095,0.00213175,0.11132978,0.0012494124,0.06013283],"study_design_scores_gemma":[0.000002511175,0.000022111948,0.0001713147,0.00003438629,0.000009151657,0.000029579773,0.000010238888,0.947644,0.0007002557,0.04524135,0.0061269123,0.00000824238],"about_ca_topic_score_codex":0.0013865359,"about_ca_topic_score_gemma":0.0012200426,"teacher_disagreement_score":0.0013865359,"about_ca_system_score_codex":0.00057369017,"about_ca_system_score_gemma":0.0006840664,"threshold_uncertainty_score":0.004194975},"labels":[],"label_agreement":null},{"id":"W4412736065","doi":"10.1016/j.segan.2025.101890","title":"Distributed alternating direction method of multipliers approach for the power distribution network reconfiguration","year":2025,"lang":"en","type":"article","venue":"Sustainable Energy Grids and Networks","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Control reconfiguration; Power (physics); Distribution (mathematics); Computer science; Distributed computing; Physics; Mathematics; Embedded system; Quantum mechanics","score_opus":0.004207788460870558,"score_gpt":0.2196350846448573,"score_spread":0.21542729618398673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412736065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001795011,0.0002173966,0.9952205,0.000060066846,0.000057757235,0.00001422231,0.000012966899,0.000080884754,0.002541264],"genre_scores_gemma":[0.1441791,0.0006516634,0.84624743,0.0000947217,0.000098024015,0.00016182063,0.00007935078,0.00009684006,0.008391006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989235,0.00004750264,0.000004482749,0.000013751593,0.00003487217,0.000006954302],"domain_scores_gemma":[0.9998462,0.00007382154,0.000013539576,0.0000141007,0.000046243942,0.000006047609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028155986,0.00058817974,0.00035409018,0.00030042583,0.00019375667,0.00041208154,0.00050106033,0.0003849897,0.004761656],"category_scores_gemma":[0.00062769966,0.00020176571,0.00026970793,0.00041803802,0.0002127802,0.00048577986,0.0003067448,0.00074433174,0.00078429666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017708604,0.000083704515,0.0003150377,0.0003309899,0.00007952421,0.00010042444,0.000079805235,0.43195716,0.020283503,0.09791926,0.007781747,0.44089168],"study_design_scores_gemma":[0.000018594383,0.000049410413,0.00006016427,0.000010300927,0.000008189542,0.00004882792,0.000007964389,0.9846727,0.0017489262,0.007967211,0.005401507,0.000006204542],"about_ca_topic_score_codex":0.00061672786,"about_ca_topic_score_gemma":0.0015572171,"teacher_disagreement_score":0.004761656,"about_ca_system_score_codex":0.00020032724,"about_ca_system_score_gemma":0.00039048545,"threshold_uncertainty_score":0.015929341},"labels":[],"label_agreement":null},{"id":"W4413321036","doi":"10.23919/ispsd62843.2025.11118084","title":"A Dynamic Gate Driver with Auto-Patterning to Reduce Ringing and Switching Loss","year":2025,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ringing; Computer science; Logic gate; Electronic engineering; Engineering; Telecommunications; Algorithm","score_opus":0.0032057607731032917,"score_gpt":0.21676096696364358,"score_spread":0.2135552061905403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413321036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6989218,0.0006995475,0.25124633,0.00062691217,0.0005219764,0.00030422956,0.000852746,0.011000857,0.035825655],"genre_scores_gemma":[0.88317674,0.0002938127,0.088551275,0.00036439253,0.00006186334,0.00013229583,0.00048291712,0.0010304019,0.025906218],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999897,0.0000048017932,0.000007785254,0.00003573503,0.000037549882,0.000017201393],"domain_scores_gemma":[0.9997849,0.00003912533,0.00003310611,0.00006657855,0.000059666174,0.000016579748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010015823,0.00030511993,0.00019064223,0.000189458,0.00019053102,0.0004994065,0.00092934334,0.00031139978,0.0034905092],"category_scores_gemma":[0.00031058415,0.00019048613,0.00015740354,0.00020539215,0.00014193835,0.00045339827,0.00027656,0.00036025385,0.0010655416],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063386484,0.000076507196,0.00031012556,0.000067925335,0.000008224051,0.00014545153,0.00008019629,0.00082423387,0.9640036,0.0016422907,0.002896345,0.029881591],"study_design_scores_gemma":[0.00002177382,0.00018379538,0.0012308059,0.0000065853374,0.000014257942,0.00039071383,0.000021294534,0.018991617,0.9573359,0.00029463644,0.021492131,0.00001643574],"about_ca_topic_score_codex":0.0004725606,"about_ca_topic_score_gemma":0.0012766831,"teacher_disagreement_score":0.0034905092,"about_ca_system_score_codex":0.00034862885,"about_ca_system_score_gemma":0.00029741158,"threshold_uncertainty_score":0.011676908},"labels":[],"label_agreement":null},{"id":"W4414603913","doi":"10.1109/tcomm.2025.3615774","title":"Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Decoding methods; Lattice (music); Algebraic number; Additive white Gaussian noise; Error detection and correction; Coding (social sciences); Generator matrix; List decoding; Concatenated error correction code","score_opus":0.037425545459896375,"score_gpt":0.2737209845405429,"score_spread":0.2362954390806465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005415019,0.00025767862,0.9880598,0.00018327613,0.00004377757,0.000048099926,0.00006241237,0.00019976949,0.005730122],"genre_scores_gemma":[0.28165853,0.0009255952,0.7110179,0.00026790012,0.00013030012,0.0002002098,0.00020253504,0.00010020839,0.0054967776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.0006143387,0.00008684679,0.00017386438,0.0005913545,0.00015610181],"domain_scores_gemma":[0.99846125,0.0005783862,0.000132515,0.000387967,0.0003208223,0.000119139186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012962994,0.0008027962,0.0006566613,0.00077567,0.0008182821,0.0019259701,0.0010401352,0.00081524433,0.002360918],"category_scores_gemma":[0.0030305507,0.00041851273,0.000614049,0.00094299234,0.0015934788,0.0017873428,0.0019620517,0.0015100036,0.001359494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024377441,0.00007646753,0.00058646547,0.00018796601,0.000036316585,0.00020036109,0.0002442749,0.13403207,0.020734642,0.71203846,0.003176133,0.12844314],"study_design_scores_gemma":[0.000092510905,0.00033270734,0.00015670127,0.0000785326,0.000028278986,0.00051409286,0.00009606318,0.67147976,0.024293737,0.27958798,0.023237564,0.00010202388],"about_ca_topic_score_codex":0.0012347902,"about_ca_topic_score_gemma":0.0014172797,"teacher_disagreement_score":0.002360918,"about_ca_system_score_codex":0.0012133031,"about_ca_system_score_gemma":0.001874238,"threshold_uncertainty_score":0.008803129},"labels":[],"label_agreement":null},{"id":"W4414769834","doi":"10.4230/lipics.esa.2025.29","title":"The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Dominating set; Security token; Parameterized complexity; Control reconfiguration; Vertex (graph theory); Bounded function; Maximal independent set; Independent set; Pathwidth","score_opus":0.04951096408318916,"score_gpt":0.28166396013357514,"score_spread":0.23215299605038597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414769834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31989992,0.0029144925,0.6251839,0.0064118807,0.00042786385,0.00040435503,0.0018911593,0.002085093,0.040781353],"genre_scores_gemma":[0.89901525,0.0016296962,0.08261376,0.0008365485,0.00034887248,0.00033899109,0.0016002172,0.00039663192,0.013220112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997326,0.00054835767,0.00018296753,0.00082737574,0.0005109187,0.00060435885],"domain_scores_gemma":[0.9885639,0.0077146892,0.0008796707,0.0015939568,0.00048612797,0.00076168805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016084411,0.00097330724,0.0011815875,0.0006998832,0.0016721602,0.0028495437,0.0025541903,0.0018266592,0.006581885],"category_scores_gemma":[0.011894953,0.00060054444,0.0015528152,0.0015816949,0.0024716682,0.0078530945,0.003454556,0.0037709055,0.0007407943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071932306,0.00024016145,0.0020291964,0.00095026015,0.00012416577,0.0007779528,0.0010954177,0.45402786,0.0111546805,0.4300124,0.015746797,0.08312176],"study_design_scores_gemma":[0.00014744123,0.00020946535,0.0010486235,0.000085883694,0.00008282718,0.0007042294,0.0005132623,0.43314964,0.0063677034,0.5456165,0.012010655,0.00006372979],"about_ca_topic_score_codex":0.0028123306,"about_ca_topic_score_gemma":0.0022149624,"teacher_disagreement_score":0.006581885,"about_ca_system_score_codex":0.0024135995,"about_ca_system_score_gemma":0.0011908159,"threshold_uncertainty_score":0.022018552},"labels":[],"label_agreement":null},{"id":"W4415947855","doi":"10.48550/arxiv.2510.15930","title":"Implémentation Efficiente de Fonctions de Convolution sur FPGA à l'Aide de Blocs Paramétrables et d'Approximations Polynomiales","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Field-programmable gate array; Convolution (computer science); Convolutional neural network; Routing (electronic design automation); Resource (disambiguation); Artificial neural network; Selection (genetic algorithm)","score_opus":0.047186191283737064,"score_gpt":0.2901680122472983,"score_spread":0.24298182096356125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415947855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090899624,0.00044379968,0.9018748,0.00008103711,0.000036632897,0.00002510063,0.000081771126,0.002480593,0.0040765624],"genre_scores_gemma":[0.6995316,0.00038338784,0.2969502,0.00003723363,0.000014262379,0.000045522505,0.0001418991,0.00014017132,0.0027557104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999796,0.00005778752,0.000012438927,0.00003292025,0.00007376701,0.000027185599],"domain_scores_gemma":[0.999534,0.00025693089,0.00005042112,0.00007803346,0.00006906647,0.000011550709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174234,0.0005828275,0.00035296334,0.00026750093,0.00015885419,0.00057467964,0.00040620042,0.00035195443,0.0014841994],"category_scores_gemma":[0.0012421925,0.00022102766,0.0003286579,0.00026185505,0.00027393393,0.00047820815,0.00023288082,0.0004041562,0.00052779197],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019716928,0.000052764455,0.0015168682,0.00017845661,0.000055794506,0.0001563957,0.00006513906,0.711774,0.061731216,0.018197078,0.0013597164,0.20471537],"study_design_scores_gemma":[0.000005430365,0.00003382704,0.0002212772,0.0000066099356,0.000005432219,0.0000424236,0.0000037392074,0.9810797,0.016735759,0.0007316501,0.0011295247,0.0000046147247],"about_ca_topic_score_codex":0.003718199,"about_ca_topic_score_gemma":0.0046844296,"teacher_disagreement_score":0.003718199,"about_ca_system_score_codex":0.0006177415,"about_ca_system_score_gemma":0.0004712397,"threshold_uncertainty_score":0.0073931217},"labels":[],"label_agreement":null},{"id":"W4416576669","doi":"10.3390/microelectronics1020006","title":"Scaling the Area of Synthesizable FPGA Tiles Across Semiconductor Process Nodes","year":2025,"lang":"en","type":"article","venue":"Microelectronics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Field-programmable gate array; Scaling; Process (computing); Routing (electronic design automation); Benchmarking; Place and route","score_opus":0.006798110372653086,"score_gpt":0.24594536348598567,"score_spread":0.23914725311333257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416576669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71753126,0.00078352704,0.26818863,0.00015367313,0.00009541728,0.000092808674,0.00047411895,0.0020008867,0.010679586],"genre_scores_gemma":[0.93096447,0.00026650794,0.06708502,0.00002966106,0.000009719696,0.00006310006,0.00027055512,0.00012301908,0.0011879442],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996501,0.000035011923,0.000020350417,0.00009528144,0.00017467239,0.000024481194],"domain_scores_gemma":[0.9988257,0.00043667285,0.00023316484,0.00020598853,0.00028152234,0.000017008355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052855874,0.0004599598,0.00020799055,0.0006370121,0.00017627642,0.0004706104,0.00046348918,0.00031866538,0.0009517596],"category_scores_gemma":[0.00271169,0.00017249786,0.00025252622,0.00045801263,0.00020768499,0.00070733856,0.00026364773,0.00031513843,0.00030193303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024621421,0.00010330887,0.024260884,0.000308952,0.00012040538,0.00033566053,0.00034833341,0.3216314,0.44776392,0.005141205,0.001108012,0.19863164],"study_design_scores_gemma":[0.000018964938,0.00058768154,0.021725088,0.000043356606,0.000067264955,0.00028900697,0.00015937042,0.49948627,0.46864876,0.002351851,0.0065790103,0.00004338117],"about_ca_topic_score_codex":0.0009866849,"about_ca_topic_score_gemma":0.0020927188,"teacher_disagreement_score":0.0009866849,"about_ca_system_score_codex":0.0004371335,"about_ca_system_score_gemma":0.00032147238,"threshold_uncertainty_score":0.003183961},"labels":[],"label_agreement":null},{"id":"W4416676700","doi":"10.1109/tcpmt.2025.3614737","title":"Corrections to “Stable HIPPO-Based Circuit Macro-Modeling”","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Components Packaging and Manufacturing Technology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Equivalent circuit; Integrated circuit; Network analysis; Electronic circuit; Circuit design; Transient analysis; Control theory (sociology)","score_opus":0.017829663256093684,"score_gpt":0.23713007161565666,"score_spread":0.219300408359563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416676700","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005890783,0.0013438959,0.7420528,0.0063641206,0.020142974,0.00017813857,0.009579547,0.046315793,0.16813189],"genre_scores_gemma":[0.14711753,0.0017713018,0.45953044,0.009902629,0.0029558772,0.0007414814,0.01220475,0.06953664,0.29623932],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991548,0.0001353515,0.000035787707,0.00010966515,0.0004782979,0.000086156164],"domain_scores_gemma":[0.9990835,0.0001270619,0.000034973793,0.00039571154,0.00031934495,0.000039390517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057934166,0.0017158221,0.00070230995,0.0009649424,0.0010647238,0.0018506206,0.0029483512,0.0015089666,0.1109486],"category_scores_gemma":[0.003807781,0.00089960155,0.0012059088,0.0007924994,0.0007322036,0.0031662018,0.0015962434,0.004631037,0.055326253],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016849792,0.000044762022,0.00044498133,0.00024084811,0.00006534237,0.00032530687,0.00021057844,0.012572582,0.007434098,0.361216,0.5546652,0.062611684],"study_design_scores_gemma":[0.000051797215,0.000037356516,0.00045556147,0.000091043934,0.000029860854,0.00031710946,0.00005245043,0.059941065,0.012391325,0.11642832,0.81011546,0.00008859055],"about_ca_topic_score_codex":0.005896419,"about_ca_topic_score_gemma":0.012606173,"teacher_disagreement_score":0.1109486,"about_ca_system_score_codex":0.002242135,"about_ca_system_score_gemma":0.0011565121,"threshold_uncertainty_score":0.37116003},"labels":[],"label_agreement":null},{"id":"W4417065140","doi":"10.1145/3779435","title":"Multi-Agent Reinforcement Learning in Designing the Low-Dropout Regulator Circuits","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Canada Excellence Research Chairs, Government of Canada","keywords":"Sizing; Reinforcement learning; Automation; Particle swarm optimization; Electronic design automation; Process (computing); Rendering (computer graphics); Engineering design process","score_opus":0.015634768870744924,"score_gpt":0.2408618695294796,"score_spread":0.2252271006587347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417065140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025708623,0.00016683694,0.97087485,0.00012223105,0.00002351839,0.000067553025,0.000008002317,0.0003295043,0.0026989211],"genre_scores_gemma":[0.8523984,0.00012405573,0.14503725,0.000115633324,0.000017354092,0.00014521244,0.000020304744,0.00003114221,0.002110575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967384,0.00010017121,0.000013085007,0.00005721895,0.00010992499,0.000045767385],"domain_scores_gemma":[0.9994248,0.00030398648,0.000092721784,0.000036678455,0.00010487453,0.0000370685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092993095,0.0005416726,0.0005873879,0.00026409756,0.00026205662,0.0005853516,0.00072917354,0.00067768845,0.0011125766],"category_scores_gemma":[0.0017601615,0.00030695956,0.00028912476,0.00019801308,0.00063217274,0.00045469526,0.00049764116,0.00075098925,0.00020512735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041227213,0.00003519584,0.00028272523,0.00004188436,0.000012167952,0.000044576613,0.00003467696,0.9679759,0.0026359311,0.0029318058,0.00026984623,0.025694031],"study_design_scores_gemma":[0.0000068881022,0.000023765435,0.000028209424,0.0000019922993,0.000002456312,0.0000056490617,0.0000028405213,0.9988349,0.00046723944,0.000417166,0.00020723531,0.0000015909434],"about_ca_topic_score_codex":0.0024261165,"about_ca_topic_score_gemma":0.0022673837,"teacher_disagreement_score":0.0024261165,"about_ca_system_score_codex":0.00048097025,"about_ca_system_score_gemma":0.0011051265,"threshold_uncertainty_score":0.004918039},"labels":[],"label_agreement":null},{"id":"W4417169614","doi":"10.1109/icecs66544.2025.11270804","title":"Leveraging Convolutional Autoencoders for Post-Layout Performance Estimation of Analog ICs","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Convolutional neural network; Inference; Pattern recognition (psychology); Floorplan; Analogue electronics; Feature (linguistics); Feature extraction; Convolution (computer science)","score_opus":0.012530137359657382,"score_gpt":0.24611794592229708,"score_spread":0.2335878085626397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417169614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051332522,0.00020267969,0.9449892,0.00010037028,0.000025629679,0.00002058827,0.00010369433,0.0017359465,0.0014893117],"genre_scores_gemma":[0.8706309,0.00022119634,0.12557991,0.00009589331,0.00002686942,0.000057269688,0.00045985964,0.00023230241,0.0026958114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.00003551397,0.000010226521,0.000053830267,0.00008865214,0.00003094858],"domain_scores_gemma":[0.9994343,0.0002898436,0.00006904627,0.000081156766,0.00011027587,0.000015317059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047642982,0.0009304202,0.00031879576,0.00042474875,0.0001302218,0.00044335684,0.0007087505,0.00042550193,0.0010374666],"category_scores_gemma":[0.0018712424,0.000442524,0.0003925567,0.00024517023,0.00032192108,0.00063306955,0.00039720023,0.0009413334,0.00037821254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032730477,0.000029200677,0.000869752,0.00003259827,0.00003224111,0.000026658761,0.000015537067,0.93029255,0.010790685,0.0011927483,0.0004409957,0.05624426],"study_design_scores_gemma":[9.479959e-7,0.000007817879,0.00016354021,0.000001975051,0.0000027860915,0.000004807658,0.0000010832659,0.99630463,0.0029981204,0.0003742029,0.00013831395,0.0000017751224],"about_ca_topic_score_codex":0.0043174666,"about_ca_topic_score_gemma":0.0071485573,"teacher_disagreement_score":0.0043174666,"about_ca_system_score_codex":0.0006615792,"about_ca_system_score_gemma":0.00066578446,"threshold_uncertainty_score":0.008584678},"labels":[],"label_agreement":null},{"id":"W4417327756","doi":"10.1145/3778036","title":"Corrigendum: VTR 9: Open-Source CAD for Fabric and Beyond FPGA Architecture Exploration","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo; Cerebral Diagnostics (Canada); University of Toronto","funders":"","keywords":"CAD; Field-programmable gate array; Architecture; Reconfigurable computing; FPGA prototype","score_opus":0.02288544452266987,"score_gpt":0.2453232970090476,"score_spread":0.2224378524863777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417327756","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012898556,0.0032491074,0.049021993,0.03778568,0.7822457,0.0003056269,0.011473865,0.032688595,0.08193951],"genre_scores_gemma":[0.016579002,0.0045410357,0.03424302,0.016132869,0.061117504,0.00039844416,0.0232089,0.024333693,0.8194455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943956,0.00037288654,0.00035912136,0.00062209636,0.003914625,0.00033560285],"domain_scores_gemma":[0.9631738,0.0028385092,0.00088718516,0.0024346493,0.02923354,0.001432269],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025234073,0.0017688476,0.0016244913,0.0040130503,0.0016327525,0.0043219374,0.0029631585,0.0031227116,0.38155264],"category_scores_gemma":[0.036941912,0.0010844934,0.0013360444,0.002128102,0.0009993846,0.0026499638,0.0031149269,0.0027883532,0.23092344],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021419515,0.0000059704444,0.00005888466,0.000077773126,0.000006171162,0.00007771834,0.000011559084,0.00016059644,0.0003458966,0.000765639,0.9797004,0.018767968],"study_design_scores_gemma":[0.00002406245,0.000031996136,0.00033495054,0.000097595694,0.00002044765,0.00029620517,0.00002621227,0.0012618342,0.0014353329,0.0011973588,0.9952384,0.000035663343],"about_ca_topic_score_codex":0.005268326,"about_ca_topic_score_gemma":0.009089469,"teacher_disagreement_score":0.38155264,"about_ca_system_score_codex":0.002806198,"about_ca_system_score_gemma":0.0025698766,"threshold_uncertainty_score":0.8821401},"labels":[],"label_agreement":null},{"id":"W4417337665","doi":"10.1109/iceccme64568.2025.11277649","title":"A Dataset for Selecting a Faster to Route Solution During the Early Stages of FPGA Placement","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Simulated annealing; Routing (electronic design automation); Benchmark (surveying); Suite; Field-programmable gate array; Selection (genetic algorithm)","score_opus":0.014968031127931955,"score_gpt":0.263506198496317,"score_spread":0.24853816736838505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417337665","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45243374,0.004398165,0.21424994,0.0021986754,0.0015021617,0.0019252183,0.24824975,0.035179563,0.0398627],"genre_scores_gemma":[0.33143607,0.0008643633,0.30785283,0.00041019017,0.000108965636,0.0014268545,0.3464935,0.0012596985,0.010147484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993438,0.00009962263,0.000054122367,0.00017799363,0.00025324358,0.00007114333],"domain_scores_gemma":[0.9981668,0.00058297854,0.00016378949,0.00038018366,0.0006226624,0.00008359679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395215,0.0018072262,0.00072412816,0.0017917892,0.0006337934,0.0009968588,0.0019923693,0.0015393039,0.0063429475],"category_scores_gemma":[0.0038782838,0.00047418324,0.001165269,0.00167301,0.00038161848,0.00081067544,0.0007574152,0.0013666339,0.0029735747],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008792803,0.0011498876,0.015471958,0.0027738085,0.00027121397,0.0009870682,0.00018527739,0.3170729,0.025283158,0.004592927,0.27611342,0.35521907],"study_design_scores_gemma":[0.00043444155,0.0010216662,0.01592177,0.00020614816,0.00011525341,0.00089384866,0.00034689988,0.80146945,0.04015594,0.005196216,0.13414916,0.00008925122],"about_ca_topic_score_codex":0.004981026,"about_ca_topic_score_gemma":0.017652582,"teacher_disagreement_score":0.0063429475,"about_ca_system_score_codex":0.0010839114,"about_ca_system_score_gemma":0.0013011866,"threshold_uncertainty_score":0.021219254},"labels":[],"label_agreement":null},{"id":"W612637280","doi":"","title":"An Efficient Shortest Distance Decomposition Algorithm for Large-Scale Transportation Network Problems","year":2014,"lang":"en","type":"article","venue":"Transportation Research Board 93rd Annual MeetingTransportation Research Board","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Algorithm; Partition (number theory); Computer science; Flow network; Heuristic; Domain (mathematical analysis); Boundary (topology); Scale (ratio); Graph; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.024391584481572644,"score_gpt":0.33933463750880954,"score_spread":0.3149430530272369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W612637280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008209363,0.00020878956,0.9888837,0.00010986257,0.000036072553,0.00006929362,0.000066259054,0.0003887552,0.0020279207],"genre_scores_gemma":[0.11786538,0.00025276624,0.8789377,0.00004810369,0.000030703908,0.00017310336,0.0003864068,0.000104241924,0.002201535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00012947265,0.000025630123,0.0000795898,0.00016071023,0.00004416207],"domain_scores_gemma":[0.9994497,0.0002499123,0.000055819422,0.0000544932,0.00014497427,0.00004508757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512906,0.0010233037,0.00088528637,0.00086226757,0.0006631997,0.00085570454,0.00094510836,0.000766673,0.0022742169],"category_scores_gemma":[0.001964553,0.00039107932,0.0006920241,0.0011396935,0.00040027036,0.0011753606,0.001012944,0.0013246086,0.00069292827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010487808,0.00008895423,0.00043795683,0.0001327028,0.000028819783,0.000060990184,0.000112131915,0.7583537,0.004786981,0.020295093,0.0043520103,0.21124572],"study_design_scores_gemma":[0.000016624572,0.000021248172,0.00004914648,0.000004793812,0.0000033997076,0.000022489057,0.000016924194,0.99350435,0.0006147747,0.0041754213,0.0015672009,0.0000037042753],"about_ca_topic_score_codex":0.004754491,"about_ca_topic_score_gemma":0.00513115,"teacher_disagreement_score":0.004754491,"about_ca_system_score_codex":0.0009874151,"about_ca_system_score_gemma":0.0017424388,"threshold_uncertainty_score":0.009453595},"labels":[],"label_agreement":null},{"id":"W6902968859","doi":"10.1016/j.tre.2025.104317","title":"Expansion of bi-modal express transit networks − a hybrid optimization approach","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Calgary","keywords":"Rail transit; Hybrid system; Transit (satellite); Genetic algorithm; Optimization problem; Public transport","score_opus":0.05079707550349272,"score_gpt":0.32071672181634187,"score_spread":0.26991964631284915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902968859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052624226,0.00066168077,0.9236382,0.00030554782,0.000050759874,0.00012874136,0.00009736415,0.00019438978,0.022299118],"genre_scores_gemma":[0.71657854,0.0010414319,0.2674994,0.00015234016,0.00005684577,0.0003249864,0.0001925536,0.000103714614,0.014050296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996289,0.0001307941,0.000011101171,0.00006420826,0.00010762904,0.00005735077],"domain_scores_gemma":[0.9997632,0.00011997259,0.000027489103,0.000021917018,0.000043425054,0.00002396033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070658437,0.00077595835,0.0006766285,0.0009394407,0.00044306976,0.0016416899,0.0014034945,0.0012291347,0.0035730428],"category_scores_gemma":[0.0007958122,0.0005874184,0.0009471491,0.0012005806,0.0005374851,0.001792051,0.0016421395,0.0010312658,0.00030912337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020296258,0.00002905941,0.0002002258,0.00004530269,0.000015918506,0.00005028247,0.00003365182,0.9723077,0.0010066963,0.012342073,0.00033795694,0.013610907],"study_design_scores_gemma":[0.0000038459852,0.000015023976,0.00005545605,0.000004452189,0.000005092285,0.000015857075,0.000022529775,0.9966149,0.00014250599,0.0022005357,0.0009167128,0.0000031373975],"about_ca_topic_score_codex":0.006798791,"about_ca_topic_score_gemma":0.007545648,"teacher_disagreement_score":0.006798791,"about_ca_system_score_codex":0.001109345,"about_ca_system_score_gemma":0.0010224496,"threshold_uncertainty_score":0.013518453},"labels":[],"label_agreement":null},{"id":"W6910346424","doi":"10.48336/zmmm-4z03","title":"Automated topology synthesis for analog integrated circuits","year":2023,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Integrated circuit; Electronic design automation; Process (computing); Circuit design; Automation; Computation; Sizing; Circuit extraction; Integrated circuit design","score_opus":0.035886324772656,"score_gpt":0.2637229486468699,"score_spread":0.2278366238742139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910346424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061419946,0.00036914504,0.9866393,0.00009949019,0.000037907306,0.00006364379,0.00011061685,0.0016940971,0.0048437756],"genre_scores_gemma":[0.22133756,0.0006255238,0.7730222,0.00008560622,0.000030114814,0.00021390995,0.00051797373,0.00039309633,0.0037739621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968064,0.0000790672,0.000017746901,0.000057077636,0.00014353271,0.000022048705],"domain_scores_gemma":[0.9996904,0.00014658914,0.00002442726,0.000074217445,0.00005566789,0.00000872587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039541625,0.0006528106,0.00041751334,0.00078244606,0.00035001055,0.00060437317,0.00062716624,0.00042328332,0.00507151],"category_scores_gemma":[0.0011377892,0.00039601006,0.00094431755,0.00043339265,0.00042458985,0.0007409609,0.00057753385,0.00086774695,0.0008926504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003663053,0.000045446486,0.0004624044,0.00042122437,0.000045429282,0.00013372338,0.00008673576,0.49792734,0.045863193,0.07178582,0.004394297,0.37879768],"study_design_scores_gemma":[0.000024833784,0.000050451188,0.00014823,0.00003114219,0.000014462919,0.000084725616,0.00002026113,0.93536377,0.012761839,0.036864366,0.014623528,0.000012460231],"about_ca_topic_score_codex":0.0012271291,"about_ca_topic_score_gemma":0.0020959575,"teacher_disagreement_score":0.00507151,"about_ca_system_score_codex":0.00077942025,"about_ca_system_score_gemma":0.00075760373,"threshold_uncertainty_score":0.016965926},"labels":[],"label_agreement":null},{"id":"W6927484181","doi":"10.34726/hss.2013.23219","title":"A new partition-based heuristic for the Steiner tree problem in large graphs","year":2013,"lang":"de","type":"article","venue":"reposiTUm (TU Wien)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Graph theory","score_opus":0.00869429609720999,"score_gpt":0.21276276119930596,"score_spread":0.20406846510209598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6927484181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06967658,0.002870019,0.9092078,0.0006434195,0.0005556921,0.0005586438,0.00041344273,0.0030831592,0.012991173],"genre_scores_gemma":[0.22990872,0.0010398884,0.7587909,0.00037053318,0.00016121428,0.0005385866,0.0013291924,0.0004803093,0.0073806187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.00011820027,0.00003374833,0.0001137443,0.00018286538,0.000120778255],"domain_scores_gemma":[0.99931765,0.00026608468,0.000065540335,0.000094178125,0.00015792744,0.00009864898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053565623,0.0011135712,0.0013204124,0.001672263,0.0009295603,0.0014941365,0.0022809478,0.0016449819,0.00575957],"category_scores_gemma":[0.00204506,0.00077738863,0.0010694574,0.0019509186,0.0005312253,0.0019104779,0.0013996856,0.0009946869,0.0013562656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005181472,0.00042421522,0.0013977025,0.0005039057,0.00015258421,0.0003239623,0.0002288453,0.51609004,0.014539872,0.01359806,0.014173532,0.4380491],"study_design_scores_gemma":[0.00015028816,0.00016461406,0.00046831815,0.00004271908,0.00006577951,0.00018042544,0.00008001415,0.9826689,0.0022585639,0.007040809,0.0068484093,0.000031120555],"about_ca_topic_score_codex":0.0058280467,"about_ca_topic_score_gemma":0.008657775,"teacher_disagreement_score":0.0058280467,"about_ca_system_score_codex":0.0012771367,"about_ca_system_score_gemma":0.00200032,"threshold_uncertainty_score":0.019267678},"labels":[],"label_agreement":null},{"id":"W6930504932","doi":"10.5281/zenodo.12827109","title":"Fig. 4 in The Arthropod Associates of 155 North American Cynipid Oak Galls","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gall; Nearctic ecozone; Fagaceae; Taxonomy (biology); Floristics; Arthropod","score_opus":0.01697878330350285,"score_gpt":0.21865409585265166,"score_spread":0.2016753125491488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930504932","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96937907,0.00033788438,0.0005636014,0.000033463446,0.000009225294,0.000031539566,0.014312917,0.00008504848,0.015247308],"genre_scores_gemma":[0.9685516,0.00027230612,0.002305109,0.000042342544,0.000007419165,0.000052149517,0.016074853,0.000034937846,0.012659253],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999138,0.000009355069,0.000005793337,0.000038221115,0.000015491505,0.000017291719],"domain_scores_gemma":[0.9997694,0.00003462231,0.00008398388,0.000031213065,0.0000414898,0.000039268863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009263192,0.00016441214,0.00008889017,0.0010302906,0.00046204013,0.0003321163,0.00010209617,0.00010398135,0.014605744],"category_scores_gemma":[0.00019304523,0.00008542565,0.00018891433,0.00086105656,0.00015674424,0.00015183918,0.0003219957,0.00009965881,0.0024396195],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005454218,0.0000415937,0.8807958,0.00021116175,0.00009420655,0.00035543894,0.0011345024,0.00034819997,0.040737685,0.00041428834,0.007691233,0.06763047],"study_design_scores_gemma":[0.0000014714533,0.000018672297,0.99488455,0.000007640372,0.000009895866,0.00019931463,0.00021103422,0.00005656508,0.000453001,0.000029459026,0.004126803,0.0000016995087],"about_ca_topic_score_codex":0.009292925,"about_ca_topic_score_gemma":0.030630684,"teacher_disagreement_score":0.014605744,"about_ca_system_score_codex":0.00019380322,"about_ca_system_score_gemma":0.0001232457,"threshold_uncertainty_score":0.048861027},"labels":[],"label_agreement":null},{"id":"W6957570961","doi":"10.60692/fayrj-ped32","title":"Optimal control results for impulsive fractional delay integrodifferential equations of order 1 < r < 2 via sectorial operator","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Optimal control; Operator (biology); Nonlinear system; Order (exchange); Point (geometry); Fractional calculus","score_opus":0.019982515213713085,"score_gpt":0.21917353186744531,"score_spread":0.19919101665373223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957570961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11313294,0.0015073265,0.86429447,0.00075416977,0.00010895029,0.000037614318,0.000035571513,0.000063022286,0.020065997],"genre_scores_gemma":[0.97125095,0.0009192018,0.022241786,0.00008066739,0.000034660385,0.000038006372,0.000018205075,0.000011748475,0.005404688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988127,0.00003320299,0.0000081426115,0.000021525717,0.000038479942,0.000017435517],"domain_scores_gemma":[0.9997718,0.00010914507,0.00004201277,0.000011489617,0.000050306295,0.000015263833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058380933,0.0005270889,0.0004219494,0.00038428843,0.000284782,0.000770171,0.00032380363,0.00044323094,0.0014772691],"category_scores_gemma":[0.00095590035,0.00016632891,0.00042611078,0.0002275149,0.0008725753,0.0006256564,0.0005469306,0.000625646,0.00007239344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011392946,0.00006255436,0.00080985687,0.00021468947,0.000047504644,0.000249559,0.00033657195,0.4772853,0.025125502,0.47237423,0.00072297285,0.022657333],"study_design_scores_gemma":[0.00001576668,0.00006728216,0.00024251964,0.000015324787,0.0000140510865,0.000038045397,0.0000602357,0.9477673,0.0019009389,0.048861947,0.0010046414,0.000011922206],"about_ca_topic_score_codex":0.0020699312,"about_ca_topic_score_gemma":0.0012014008,"teacher_disagreement_score":0.0020699312,"about_ca_system_score_codex":0.00077335356,"about_ca_system_score_gemma":0.00079331925,"threshold_uncertainty_score":0.0056111217},"labels":[],"label_agreement":null},{"id":"W6977586799","doi":"10.6084/m9.figshare.26640943","title":"Additional file 3 of Long-term humoral and cellular immunity after primary SARS-CoV-2 infection: a 20-month longitudinal study","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University Health Network; Toronto General Hospital","funders":"","keywords":"Cellular immunity; Immune system; Statistical analysis; Humoral immunity; Longitudinal study; Wilcoxon signed-rank test; Interleukin 4; Interleukin 2; Longitudinal data","score_opus":0.03162485995955267,"score_gpt":0.25186699428024006,"score_spread":0.2202421343206874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977586799","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071870495,0.00004203065,0.0005484773,0.0001617205,0.000044591372,0.00027082,0.9962543,0.00033418278,0.0016251154],"genre_scores_gemma":[0.027399598,0.00032512043,0.0068995445,0.001191865,0.0002179953,0.0055287234,0.926573,0.0011263535,0.030737853],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9992306,0.00010908806,0.0001647924,0.00015102541,0.00025292116,0.00009168754],"domain_scores_gemma":[0.98423785,0.010101924,0.0011700507,0.0013931969,0.0026540214,0.00044295596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016918136,0.00084416725,0.0011307115,0.0011862557,0.00082591485,0.0012699056,0.0015058023,0.0011565997,0.8624941],"category_scores_gemma":[0.027063094,0.00041505852,0.0007339295,0.0017248056,0.00024398843,0.001483387,0.00077577087,0.0006693157,0.12953994],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013207275,0.0002120493,0.0048657353,0.0032984056,0.00008414251,0.0001822889,0.000076014534,0.00044937117,0.00027654093,0.00049875095,0.9645296,0.024206407],"study_design_scores_gemma":[0.007900938,0.0014705423,0.06645416,0.0060770763,0.00033875302,0.0021443167,0.0005393514,0.0025554341,0.002028932,0.0072246636,0.9030796,0.00018630811],"about_ca_topic_score_codex":0.005550012,"about_ca_topic_score_gemma":0.009314408,"teacher_disagreement_score":0.8624941,"about_ca_system_score_codex":0.0008603685,"about_ca_system_score_gemma":0.0014567176,"threshold_uncertainty_score":0.1961354},"labels":[],"label_agreement":null},{"id":"W6987253941","doi":"","title":"Software for mesh partitioning","year":2010,"lang":"en","type":"dissertation","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computation; Software; Graph; Finite element method; Mesh generation; Range (aeronautics)","score_opus":0.009461660098427136,"score_gpt":0.2225803870111723,"score_spread":0.21311872691274517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987253941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001772893,0.0007228248,0.7635758,0.00022495213,0.0002477234,0.00031943817,0.006443592,0.19693685,0.029755892],"genre_scores_gemma":[0.04003342,0.0024377732,0.77348113,0.000735869,0.0002106682,0.0018808437,0.041542623,0.077217795,0.062459774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991844,0.00007846098,0.00010226286,0.00012305984,0.0004355484,0.000076184544],"domain_scores_gemma":[0.99852115,0.00048748354,0.00007668421,0.0003087469,0.00054618693,0.000059788286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008535782,0.0018129798,0.00107752,0.002012131,0.0007324566,0.0017854881,0.0033115945,0.0013528817,0.10405883],"category_scores_gemma":[0.003946083,0.0012431944,0.0020457385,0.0016798147,0.00044496768,0.0026414406,0.0021265764,0.0020089832,0.053877275],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040422013,0.00012895143,0.0012215858,0.0017132472,0.00018231176,0.00049041555,0.0005239694,0.037659064,0.022347067,0.039395057,0.3608723,0.5350619],"study_design_scores_gemma":[0.0002441828,0.00007692109,0.0009864593,0.0002559353,0.00008279206,0.00094238453,0.00010629688,0.12367298,0.026046414,0.040445853,0.8070216,0.0001181656],"about_ca_topic_score_codex":0.0019003592,"about_ca_topic_score_gemma":0.002338492,"teacher_disagreement_score":0.10405883,"about_ca_system_score_codex":0.0007156889,"about_ca_system_score_gemma":0.00097301335,"threshold_uncertainty_score":0.34811145},"labels":[],"label_agreement":null},{"id":"W6991706004","doi":"","title":"Improving FPGA Placement with Dynamically Adaptive Stochastic Tunneling","year":2010,"lang":"en","type":"article","venue":"Journal of International Crisis and Risk Communication Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Field-programmable gate array; Simulated annealing; Suite; Reduction (mathematics); Schedule; Routing (electronic design automation); Software","score_opus":0.021739657055164497,"score_gpt":0.31508524605154886,"score_spread":0.29334558899638435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991706004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10535463,0.00012449696,0.89138997,0.00006754479,0.000024066318,0.00003623859,0.00001366047,0.0010909399,0.0018983418],"genre_scores_gemma":[0.6817199,0.000080887236,0.31691277,0.000041828655,0.000013079473,0.000036910948,0.000044859975,0.00012344314,0.001026345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.00007385834,0.000015307169,0.00004090438,0.00011946188,0.000033220476],"domain_scores_gemma":[0.99965,0.00013793916,0.000048746693,0.00008253009,0.00006498285,0.00001579267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044264257,0.00036892362,0.00033499705,0.0004499384,0.00031199027,0.00032939788,0.0008743577,0.0003308825,0.0009353952],"category_scores_gemma":[0.0014467901,0.000256024,0.00033094306,0.00034383094,0.0003147274,0.0005124684,0.00053317344,0.0003881499,0.0001981808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011971201,0.00005478898,0.0013017115,0.000046470912,0.000030209972,0.00008251873,0.000083589664,0.78500235,0.042896163,0.007643568,0.00073330256,0.16200562],"study_design_scores_gemma":[0.0000148421195,0.00009203197,0.0002977542,0.0000027716872,0.00000864395,0.00007156884,0.000012526671,0.98838603,0.008839755,0.0013073758,0.00095939037,0.00000740193],"about_ca_topic_score_codex":0.0014598471,"about_ca_topic_score_gemma":0.0026356708,"teacher_disagreement_score":0.0014598471,"about_ca_system_score_codex":0.0004113584,"about_ca_system_score_gemma":0.00062306935,"threshold_uncertainty_score":0.0031292439},"labels":[],"label_agreement":null},{"id":"W6991933582","doi":"","title":"International Conference on Parallel Processing workshops proceedings ; 18 - 21 August 2002, Vancouver, B.C., Canada","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Parallel processing; Data processing","score_opus":0.027596932442190462,"score_gpt":0.2207115529013121,"score_spread":0.19311462045912164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991933582","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028594207,0.034772623,0.34244722,0.016897796,0.02599239,0.0011358531,0.0067157852,0.020220628,0.5232235],"genre_scores_gemma":[0.042497218,0.015843764,0.06815174,0.000926743,0.0013788139,0.0002282768,0.008484737,0.0013352967,0.86115336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938,0.00006967939,0.000033092132,0.00012132116,0.00029157722,0.00010430012],"domain_scores_gemma":[0.99843687,0.00012362155,0.000024831375,0.0001710596,0.000953078,0.00029045512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379333,0.0016152506,0.0010992588,0.0011837183,0.0016423246,0.003596086,0.0014198411,0.0011300655,0.12041251],"category_scores_gemma":[0.0014741009,0.00066969317,0.00053159025,0.0015214151,0.000606904,0.0016728259,0.0011678304,0.0021118843,0.084880985],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004314362,0.00016900101,0.00075788755,0.00026333507,0.00005381919,0.0002486894,0.00016146273,0.0012982378,0.0059245396,0.005813182,0.72678894,0.2580894],"study_design_scores_gemma":[0.00007747864,0.00016674274,0.0025988016,0.00015159197,0.00006512072,0.0006505582,0.00025463523,0.012520999,0.0053533595,0.0044555166,0.97367203,0.000033088487],"about_ca_topic_score_codex":0.03342262,"about_ca_topic_score_gemma":0.06829992,"teacher_disagreement_score":0.12041251,"about_ca_system_score_codex":0.0013641372,"about_ca_system_score_gemma":0.004374307,"threshold_uncertainty_score":0.40282},"labels":[],"label_agreement":null},{"id":"W6992979114","doi":"","title":"MultiQueue-Based FPGA Routing: Relaxed A* Priority Ordering for Improved Parallelism","year":2024,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; VMware; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Field-programmable gate array; Scheduling (production processes); Routing (electronic design automation); Equal-cost multi-path routing; Benchmark (surveying); Critical path method; Queue; Place and route","score_opus":0.012794439328311834,"score_gpt":0.25725385868080847,"score_spread":0.24445941935249663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992979114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20665698,0.0011461397,0.77403665,0.00047946064,0.00022798414,0.0001763478,0.0001960479,0.0056151845,0.011465207],"genre_scores_gemma":[0.57303697,0.00024136776,0.42142573,0.00020643407,0.000043912383,0.00010251411,0.00031153555,0.00030515643,0.0043263347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926406,0.00015959208,0.00007544738,0.00012673097,0.00022252757,0.00015162925],"domain_scores_gemma":[0.99852055,0.00036362535,0.00014472862,0.0005452019,0.0003139143,0.00011196557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095482764,0.00044993777,0.0005504841,0.00063182216,0.0005204977,0.0012579724,0.0018594213,0.0004065235,0.0036047949],"category_scores_gemma":[0.0022278184,0.00033607602,0.000392667,0.00083437486,0.00038906827,0.0017702415,0.0008667995,0.001037914,0.0006552469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014306592,0.00069930195,0.0042176023,0.0003252636,0.000074684605,0.00026039212,0.0003531003,0.22746329,0.08661162,0.059555087,0.011859147,0.6071498],"study_design_scores_gemma":[0.00031822314,0.0006766964,0.0008950573,0.000036837428,0.000040481696,0.0001744559,0.00008841197,0.92679274,0.036580276,0.019109795,0.015230172,0.000056830213],"about_ca_topic_score_codex":0.005508033,"about_ca_topic_score_gemma":0.0111986995,"teacher_disagreement_score":0.005508033,"about_ca_system_score_codex":0.0010900986,"about_ca_system_score_gemma":0.0022001297,"threshold_uncertainty_score":0.012059271},"labels":[],"label_agreement":null},{"id":"W7011726493","doi":"","title":"Mixing buffers and pass transistors in FPGA routing architecture","year":2001,"lang":"en","type":"other","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mixing (physics); Field-programmable gate array; Routing (electronic design automation); Transistor; Architecture","score_opus":0.008383809605480734,"score_gpt":0.2354768337465003,"score_spread":0.22709302414101956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011726493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06330625,0.0040116212,0.8539563,0.0006675176,0.00050134485,0.00020681127,0.00027972145,0.005025993,0.07204452],"genre_scores_gemma":[0.4066875,0.003155438,0.42007843,0.00034015265,0.00023895441,0.0001595087,0.00043812866,0.0008163707,0.16808558],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998337,0.00004286538,0.000012127922,0.000035043344,0.000051078285,0.000025030879],"domain_scores_gemma":[0.99976605,0.00009617011,0.000022656624,0.000050215993,0.000049050075,0.000015763806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003663424,0.00068171305,0.0002886978,0.0006472653,0.00039800094,0.0017800819,0.0011351433,0.00053877995,0.022496562],"category_scores_gemma":[0.0006865626,0.00045649562,0.00019418816,0.0009827618,0.00036333315,0.0015650606,0.00050490303,0.00067266147,0.0039299345],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015020798,0.00018121168,0.0011644043,0.0005516084,0.00006912398,0.00043103143,0.0002999469,0.057453487,0.10930163,0.24527071,0.026923342,0.55685145],"study_design_scores_gemma":[0.00025603993,0.0015240381,0.00089690613,0.00025869807,0.00031402425,0.0009484335,0.00020093605,0.45073095,0.26097497,0.09683628,0.1869651,0.00009366262],"about_ca_topic_score_codex":0.0021957085,"about_ca_topic_score_gemma":0.007837124,"teacher_disagreement_score":0.022496562,"about_ca_system_score_codex":0.00077476323,"about_ca_system_score_gemma":0.00058988144,"threshold_uncertainty_score":0.075258434},"labels":[],"label_agreement":null},{"id":"W7014269565","doi":"","title":"Parallel FPGA Routing with On-the-Fly Net Decomposition","year":2024,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; VMware; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Router; Scalability; Speedup; Field-programmable gate array; Routing (electronic design automation); Scheduling (production processes); Baseline (sea); Path (computing)","score_opus":0.01075766068769782,"score_gpt":0.24081768669773082,"score_spread":0.230060026010033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014269565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.148242,0.00037215324,0.8119058,0.00020397743,0.00012180083,0.00014379593,0.0003127971,0.017030949,0.021666775],"genre_scores_gemma":[0.3669826,0.00017566842,0.62180203,0.00011105821,0.000025487107,0.00010468844,0.0010232261,0.00068217213,0.009092992],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977,0.00003210601,0.00001127599,0.000044747107,0.000094159666,0.000047735364],"domain_scores_gemma":[0.9997181,0.000058933656,0.000029915296,0.00011154807,0.00006132217,0.000020076328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025580366,0.0006266225,0.00039818557,0.0005558507,0.00021053349,0.0006992129,0.0009685535,0.00028743417,0.006599224],"category_scores_gemma":[0.0004867952,0.00023506365,0.00040383363,0.00043631444,0.0002450735,0.00086087524,0.00041539298,0.0004825132,0.001141159],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004953981,0.0002947032,0.0020379552,0.0002530876,0.00010828728,0.0002677783,0.00010866218,0.3246729,0.10827513,0.020618025,0.016973833,0.5258942],"study_design_scores_gemma":[0.00011033391,0.00023770815,0.0008046807,0.00001724562,0.00002866325,0.00019181326,0.000037384816,0.938928,0.037535693,0.0081173815,0.01396788,0.000023267503],"about_ca_topic_score_codex":0.0035189479,"about_ca_topic_score_gemma":0.008025357,"teacher_disagreement_score":0.006599224,"about_ca_system_score_codex":0.00061453466,"about_ca_system_score_gemma":0.0008375882,"threshold_uncertainty_score":0.022076607},"labels":[],"label_agreement":null},{"id":"W7014364441","doi":"","title":"Partial parallelization of graph partitioning algorithm METIS","year":2004,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metis; Graph; Graph partition; Computation; Graph theory; Algorithm design","score_opus":0.008157820742773008,"score_gpt":0.23130457616716815,"score_spread":0.22314675542439513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014364441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27777818,0.0011997006,0.66527706,0.0007899978,0.0002573352,0.00031796878,0.0010610579,0.008124629,0.04519405],"genre_scores_gemma":[0.60239965,0.0003361062,0.373898,0.00012977204,0.00007780529,0.00023544286,0.0022194004,0.00079080724,0.019913094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.000052147265,0.000014525003,0.00007105736,0.00009700939,0.00006859206],"domain_scores_gemma":[0.9996045,0.000095591175,0.000017394339,0.0001158435,0.00014490756,0.000021787926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019317007,0.0006152927,0.0004994493,0.00054184423,0.00067802466,0.000652066,0.0006367924,0.0003029506,0.011193041],"category_scores_gemma":[0.0006907149,0.00022158177,0.0005228913,0.00069652963,0.00028630544,0.00068277185,0.00052431267,0.0003179583,0.0015972878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011292208,0.000254407,0.0015606739,0.00047354796,0.000093283226,0.00027030602,0.0002363157,0.16759361,0.08851221,0.023911297,0.024016242,0.69194883],"study_design_scores_gemma":[0.00022316624,0.00035938577,0.002205465,0.000019406101,0.000063683154,0.0003111045,0.00012919321,0.9019278,0.06267338,0.01703877,0.015028716,0.000019921075],"about_ca_topic_score_codex":0.0058214995,"about_ca_topic_score_gemma":0.012658285,"teacher_disagreement_score":0.011193041,"about_ca_system_score_codex":0.00059118075,"about_ca_system_score_gemma":0.0010930487,"threshold_uncertainty_score":0.037444413},"labels":[],"label_agreement":null},{"id":"W7017163985","doi":"","title":"Approches primales et duales pour l'énumération des chambres d'un arrangement d'hyperplans réel - Le rapport complet","year":2025,"lang":"en","type":"report","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Hyperplane; Matroid; Completeness (order theory); Cardinality (data modeling); Affine transformation; Linear programming; Set (abstract data type); Algebraic number; Semiring","score_opus":0.03203503542487369,"score_gpt":0.2434137369661433,"score_spread":0.21137870154126961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017163985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007236713,0.00014225839,0.98928493,0.00007433635,0.000018831306,0.000040241357,0.000057924903,0.00020672845,0.0029380554],"genre_scores_gemma":[0.04994594,0.00016641141,0.94659996,0.000035461217,0.000029391656,0.00012799032,0.00025843907,0.00010594703,0.0027304497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888366,0.00027847473,0.00006225818,0.000265871,0.00039934728,0.00011030449],"domain_scores_gemma":[0.99870265,0.0006354375,0.00010816069,0.00028932857,0.00018771336,0.00007674263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077147,0.00093599065,0.0010361184,0.0014543149,0.00070407277,0.0026807524,0.0016282953,0.0011179183,0.0074400366],"category_scores_gemma":[0.003239364,0.00077914255,0.0012871315,0.001435122,0.0014185855,0.0028592993,0.0019604575,0.0023409307,0.0018855168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025278432,0.00021957101,0.001335646,0.00043200236,0.000059528575,0.00010622829,0.00032550184,0.16318601,0.01238036,0.39862606,0.00470099,0.41837522],"study_design_scores_gemma":[0.00008148531,0.00020130338,0.0004774405,0.00008475864,0.00003114758,0.00029922562,0.0001813465,0.8241543,0.00854679,0.14448984,0.021409474,0.00004287599],"about_ca_topic_score_codex":0.0014390382,"about_ca_topic_score_gemma":0.0026629004,"teacher_disagreement_score":0.0074400366,"about_ca_system_score_codex":0.0011287739,"about_ca_system_score_gemma":0.0012799675,"threshold_uncertainty_score":0.02488941},"labels":[],"label_agreement":null},{"id":"W7020619181","doi":"","title":"Low-power multi-threshold CMOS circuits optimization and CAD tool design","year":2004,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"CMOS; Application-specific integrated circuit; Leakage (economics); Subthreshold conduction; Microelectronics; Transistor; Sizing; Circuit design; Reduction (mathematics); Integrated circuit design","score_opus":0.014768785461832573,"score_gpt":0.20298810209498927,"score_spread":0.1882193166331567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020619181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026922066,0.0009452294,0.9425466,0.00028937025,0.000058582893,0.0001170901,0.00033755077,0.0026095323,0.026174013],"genre_scores_gemma":[0.26182032,0.0011459001,0.720404,0.00013024964,0.000026691729,0.0002817519,0.000799685,0.0003889118,0.015002441],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997868,0.000036673962,0.000010096918,0.000024548302,0.000120178796,0.000021683045],"domain_scores_gemma":[0.9998197,0.000065316744,0.000016928525,0.00003207143,0.000060537528,0.000005466427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021583766,0.0004318519,0.00027259192,0.0005645908,0.000199303,0.0006955618,0.00073054066,0.00031323396,0.006311971],"category_scores_gemma":[0.00061960774,0.0002722631,0.0003265329,0.000601264,0.0001256895,0.00042689728,0.000232593,0.00035617946,0.0012636526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007932907,0.00007899086,0.00085169217,0.00039652773,0.000042071966,0.00014574813,0.00007601623,0.40266445,0.08026043,0.029924463,0.010620412,0.47485983],"study_design_scores_gemma":[0.000049464306,0.00011944756,0.00087723165,0.000042431984,0.000029334315,0.00020585692,0.000033154178,0.9066976,0.045376852,0.010767899,0.03578065,0.000020202713],"about_ca_topic_score_codex":0.0013605846,"about_ca_topic_score_gemma":0.0038292806,"teacher_disagreement_score":0.006311971,"about_ca_system_score_codex":0.00053137925,"about_ca_system_score_gemma":0.00075817166,"threshold_uncertainty_score":0.02111566},"labels":[],"label_agreement":null},{"id":"W7028217537","doi":"","title":"Efficient Octree-based 3 Dimensional Pathfinding","year":2024,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pathfinding; Octree; Representation (politics); Path (computing); Grid; Graph; Flexibility (engineering); Computation; Computer graphics","score_opus":0.010648101797531194,"score_gpt":0.21891750234597118,"score_spread":0.20826940054843998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028217537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03163675,0.00007113865,0.9621793,0.000052095853,0.000019524045,0.00007495574,0.0002549194,0.0025082654,0.003203067],"genre_scores_gemma":[0.24305214,0.00017019833,0.7515461,0.00004255019,0.00000583513,0.0001522793,0.00090890814,0.000413506,0.0037084916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983704,0.000030988627,0.000011315614,0.000026423397,0.00007204068,0.000022229437],"domain_scores_gemma":[0.99954385,0.00019522561,0.000040880477,0.00009832901,0.00009045294,0.000031278843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019095805,0.00047454203,0.00041013223,0.0006389073,0.00038702297,0.00079132,0.0010932559,0.00042751976,0.0032073183],"category_scores_gemma":[0.0011530855,0.00036867784,0.0005322798,0.0005452938,0.0003183156,0.0010198535,0.0011827676,0.000571618,0.0008225325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002800674,0.00014832312,0.0020528578,0.00021168671,0.00007711666,0.00023657715,0.00052420626,0.5116826,0.0255167,0.02971105,0.007306623,0.4222522],"study_design_scores_gemma":[0.000020277927,0.00004326358,0.00026070583,0.000012292992,0.000007996564,0.00007186284,0.000056544104,0.98162514,0.006486533,0.006602485,0.004798431,0.000014498036],"about_ca_topic_score_codex":0.0073072696,"about_ca_topic_score_gemma":0.015025965,"teacher_disagreement_score":0.0073072696,"about_ca_system_score_codex":0.0004404169,"about_ca_system_score_gemma":0.00071221625,"threshold_uncertainty_score":0.014529467},"labels":[],"label_agreement":null},{"id":"W7065631118","doi":"","title":"Fast Heuristic Techniques for FPGA Placement based on Multilevel Clustering","year":2003,"lang":"en","type":"article","venue":"The Atrium (University of Guelph)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Heuristic; Cluster analysis; Sign (mathematics); Gate array; Digital electronics; Programmable logic device; Logic gate","score_opus":0.017847502034413182,"score_gpt":0.21095302089118967,"score_spread":0.1931055188567765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7065631118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029302014,0.00079150946,0.9554209,0.00019107695,0.0001621816,0.0002252242,0.00014411777,0.0016781491,0.012084892],"genre_scores_gemma":[0.26735684,0.0004949146,0.7250181,0.00008361881,0.00005881209,0.0002075244,0.00037197303,0.0002012662,0.0062069036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965787,0.000061932624,0.00001716582,0.00005065593,0.00014846864,0.00006389887],"domain_scores_gemma":[0.9996201,0.00014250941,0.000047332494,0.00006701409,0.000096663774,0.000026391324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032197146,0.00088024634,0.00080303417,0.0019608876,0.00079054746,0.00080970995,0.001149761,0.000639714,0.009014885],"category_scores_gemma":[0.0013321565,0.00046539315,0.00070142536,0.0016478451,0.00033404538,0.0008380369,0.0008217848,0.0005181002,0.0019103731],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027739833,0.00009351642,0.0006322501,0.0002021961,0.000062345585,0.00010784964,0.000107837914,0.5630796,0.01121872,0.012116672,0.0077962913,0.4043053],"study_design_scores_gemma":[0.00004919695,0.00013679524,0.00031876477,0.000027088106,0.000018564531,0.00009718598,0.00005919047,0.98599875,0.0030166432,0.0059223054,0.0043362826,0.000019226012],"about_ca_topic_score_codex":0.0066937483,"about_ca_topic_score_gemma":0.013901655,"teacher_disagreement_score":0.009014885,"about_ca_system_score_codex":0.0010928035,"about_ca_system_score_gemma":0.0012152236,"threshold_uncertainty_score":0.030157745},"labels":[],"label_agreement":null},{"id":"W7095561659","doi":"","title":"Toronto, ON","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Complex programmable logic device; Simulated annealing; Programmable logic device; Logic synthesis; Programmable logic array; Programmable logic controller","score_opus":0.01298394285280654,"score_gpt":0.18857107877298823,"score_spread":0.1755871359201817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095561659","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007541304,0.0016176766,0.00051660504,0.0013590158,0.00072212034,0.000046451638,0.0032589252,0.00034549454,0.9913796],"genre_scores_gemma":[0.0017602475,0.00087734195,0.0003057262,0.00027814292,0.000040100105,0.000016700547,0.0014719759,0.00009733306,0.9951525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993666,0.000044342218,0.000028518605,0.00019065013,0.00024285587,0.00012709742],"domain_scores_gemma":[0.9991667,0.00009147679,0.000034376793,0.00011196902,0.00040780942,0.00018764053],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000372005,0.0010330352,0.0006686421,0.0010742263,0.0026810062,0.0039944765,0.0008366681,0.0014060985,0.8318909],"category_scores_gemma":[0.0008750203,0.00042558648,0.00044182834,0.0017324704,0.0007190186,0.0013510694,0.0021420983,0.0014361475,0.6544278],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015721828,0.00007517389,0.0014729168,0.0004465915,0.000021412077,0.000659769,0.00039220773,0.00056161475,0.001919522,0.021399975,0.75067884,0.22221474],"study_design_scores_gemma":[0.000008181449,0.00001137794,0.0007184832,0.00008942183,0.0000027082099,0.00006370555,0.00010578442,0.00006635539,0.00011814831,0.00046212578,0.9983494,0.000004297613],"about_ca_topic_score_codex":0.046223246,"about_ca_topic_score_gemma":0.12472219,"teacher_disagreement_score":0.16810912,"about_ca_system_score_codex":0.0030875746,"about_ca_system_score_gemma":0.0034924652,"threshold_uncertainty_score":0.23978728},"labels":[],"label_agreement":null},{"id":"W7095777721","doi":"","title":"A dynamic diffusion optimization method for irregular finite element graph partitioning,” The","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computation; Finite element method; Graph; Heuristics; Graph partition; Load balancing (electrical power); Graph theory","score_opus":0.006998421151511156,"score_gpt":0.23073787363724996,"score_spread":0.2237394524857388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095777721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006206122,0.00012074087,0.99149925,0.00012787414,0.000025208145,0.000026916867,0.000025328074,0.00018748034,0.0017811252],"genre_scores_gemma":[0.136505,0.00015111767,0.85890955,0.00009592944,0.000022788327,0.00014830577,0.00010007815,0.0001365784,0.003930728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998435,0.00004098499,0.0000071411123,0.000025023319,0.00007249809,0.000010886798],"domain_scores_gemma":[0.9998374,0.00007885736,0.000018044751,0.000014380852,0.00004025497,0.000011041502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003361178,0.00040092377,0.0003039991,0.0004903542,0.00030706462,0.00028409372,0.0005892863,0.0005076922,0.0026662443],"category_scores_gemma":[0.0007679793,0.00025737623,0.00029263285,0.00034210816,0.00036146736,0.0004193192,0.00048254928,0.00046646997,0.0003764087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008937932,0.000049707098,0.0005668887,0.00016141374,0.000036710593,0.00005625692,0.00007799728,0.7770819,0.03189887,0.018510424,0.0028200164,0.16865046],"study_design_scores_gemma":[0.000008375752,0.00000946288,0.000044896973,0.0000032807427,0.0000019561514,0.000014805338,0.0000043198065,0.9958039,0.0015815858,0.0008707806,0.0016535075,0.0000030792226],"about_ca_topic_score_codex":0.002754789,"about_ca_topic_score_gemma":0.004168621,"teacher_disagreement_score":0.002754789,"about_ca_system_score_codex":0.0006160717,"about_ca_system_score_gemma":0.0007328703,"threshold_uncertainty_score":0.008919418},"labels":[],"label_agreement":null},{"id":"W7095863864","doi":"","title":"Stochastic Spatial Routing for Reconfigurable","year":2013,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Routing (electronic design automation); Obstacle; Scheme (mathematics); Field-programmable gate array; Sketch; Implementation; Reconfigurable computing; Path (computing)","score_opus":0.011476829836949675,"score_gpt":0.20136184425361559,"score_spread":0.18988501441666591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095863864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051376782,0.00034989486,0.9264064,0.00022885606,0.000053719767,0.00006671928,0.00012333078,0.0018159241,0.019578358],"genre_scores_gemma":[0.53773665,0.0002907525,0.45455736,0.00012891463,0.000023746114,0.0001409689,0.00020159825,0.00020290133,0.0067172023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974436,0.00006745725,0.000013269332,0.00003522717,0.000114576746,0.000025149951],"domain_scores_gemma":[0.9995307,0.00018244261,0.00006151589,0.00013782147,0.00007258595,0.0000150470805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031617878,0.00031345713,0.00019660548,0.00032812534,0.00032797022,0.00053531677,0.000521223,0.00035707548,0.0047916686],"category_scores_gemma":[0.0012299177,0.00016550721,0.00022271769,0.0004650344,0.00040630015,0.0006406835,0.00047646047,0.00035515596,0.0007123099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012615047,0.000049324168,0.0007617538,0.00020583278,0.00002823597,0.00011222184,0.00006712387,0.6321908,0.04093174,0.1514669,0.004731601,0.16932824],"study_design_scores_gemma":[0.000023753344,0.000106792795,0.0003427077,0.000015455784,0.00001172371,0.00014109926,0.000027334872,0.9316207,0.016585456,0.034156416,0.01695534,0.000013337564],"about_ca_topic_score_codex":0.0012162587,"about_ca_topic_score_gemma":0.003675478,"teacher_disagreement_score":0.0047916686,"about_ca_system_score_codex":0.00069335924,"about_ca_system_score_gemma":0.00082651555,"threshold_uncertainty_score":0.016029775},"labels":[],"label_agreement":null},{"id":"W7096408914","doi":"","title":"The effect of logic block granularity on deep-submicron FPGA performance and density,” M.A.Sc thesis","year":2001,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Granularity; Reproduction; Field-programmable gate array; Object (grammar); Government (linguistics)","score_opus":0.005706866964370105,"score_gpt":0.19146061390884453,"score_spread":0.1857537469444744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096408914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573625,0.003960767,0.015868992,0.0009475461,0.00017219607,0.000023499597,0.00037344507,0.0008617526,0.02042929],"genre_scores_gemma":[0.99108255,0.00038542616,0.0059342715,0.00007232695,0.00003526161,0.0000070327706,0.00016957855,0.000039205523,0.0022743256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.000102430764,0.000021110525,0.00006523344,0.000101570564,0.000073215066],"domain_scores_gemma":[0.9973024,0.0016765287,0.00025098684,0.0002991383,0.00034792043,0.00012306232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058754435,0.0001895198,0.0001249049,0.00023302894,0.0001965858,0.00044132848,0.00040596988,0.0002454439,0.0034018948],"category_scores_gemma":[0.0039595235,0.00017744557,0.000091315225,0.00029421004,0.00016231535,0.0010003557,0.00032959075,0.00020767389,0.00068886706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00742736,0.0003181152,0.041512415,0.00045297662,0.00014326259,0.0010280466,0.0004068654,0.117760696,0.25063276,0.008432341,0.024603093,0.54728204],"study_design_scores_gemma":[0.00032685357,0.0056538796,0.08055716,0.00015729525,0.00027038372,0.0024967603,0.00054571213,0.39279974,0.48053306,0.0056027295,0.030955402,0.0001010539],"about_ca_topic_score_codex":0.0009341345,"about_ca_topic_score_gemma":0.0035944495,"teacher_disagreement_score":0.0034018948,"about_ca_system_score_codex":0.0003729625,"about_ca_system_score_gemma":0.0002636842,"threshold_uncertainty_score":0.011380494},"labels":[],"label_agreement":null},{"id":"W7097389683","doi":"","title":"Parallel Synthesis of Large Combinational Circuits for FPGAs","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinational logic; Partition (number theory); Logic synthesis; Digital electronics; Computation; Register-transfer level; Sequential logic; Interconnection; Field-programmable gate array","score_opus":0.02109942822801255,"score_gpt":0.2293240281689985,"score_spread":0.20822459994098594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097389683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24141133,0.00089191354,0.73469573,0.0002566146,0.00015515815,0.00025978414,0.00046045164,0.0057477606,0.016121304],"genre_scores_gemma":[0.66058797,0.0002303834,0.33381635,0.000075337244,0.000053462165,0.00018820063,0.00049435016,0.00017492363,0.0043790047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974984,0.000053945307,0.000017005545,0.00006225627,0.000079157486,0.00003776142],"domain_scores_gemma":[0.9996125,0.00019117047,0.000033430748,0.00006557743,0.00007415521,0.00002321646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025284302,0.0007884469,0.00054907997,0.00068217324,0.00044657348,0.00056215294,0.0006774763,0.00030001823,0.0066524125],"category_scores_gemma":[0.00049997686,0.00028225005,0.00061119057,0.0007128294,0.00029873184,0.0004500684,0.00036099524,0.0003972296,0.0007799445],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005974568,0.00013592321,0.0009808168,0.0006454891,0.00013923629,0.0006723124,0.00016183208,0.49968573,0.109222494,0.013875935,0.004242921,0.36963978],"study_design_scores_gemma":[0.00017925935,0.0004665794,0.0009553494,0.00003933118,0.00008606267,0.000215892,0.00007473504,0.9000612,0.0692861,0.016281456,0.012331259,0.000022789902],"about_ca_topic_score_codex":0.0020411508,"about_ca_topic_score_gemma":0.0045597767,"teacher_disagreement_score":0.0066524125,"about_ca_system_score_codex":0.0008601578,"about_ca_system_score_gemma":0.0006670153,"threshold_uncertainty_score":0.022254527},"labels":[],"label_agreement":null},{"id":"W7105641753","doi":"10.1109/ijcnn64981.2025.11229099","title":"Dual Graph Neural Networks for Optimizing Circuit Partitioning: A Synergistic Approach","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Graph partition; Partition (number theory); Graph; Node (physics); Artificial neural network; Key (lock)","score_opus":0.024849877211822333,"score_gpt":0.23739953759720275,"score_spread":0.21254966038538042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105641753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037243407,0.0008233462,0.95349175,0.0003779918,0.0000663711,0.00006534997,0.00004901278,0.00053264375,0.0073501966],"genre_scores_gemma":[0.5538817,0.0005225853,0.43910602,0.00032808044,0.00007526039,0.00013220456,0.00020631922,0.00015623268,0.0055916435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962425,0.000119684984,0.000012247082,0.0000863655,0.00010718522,0.00005023181],"domain_scores_gemma":[0.999613,0.00017035865,0.000042231033,0.00004943296,0.00009580207,0.000029241815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005707537,0.0012582007,0.00071449124,0.00097207143,0.00032273697,0.00077359646,0.0012312416,0.0009538093,0.0029708124],"category_scores_gemma":[0.001443892,0.0004032487,0.000528174,0.0008955691,0.00048529392,0.0014029953,0.0011481625,0.00079659326,0.0004983727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001050357,0.000117105985,0.00049473305,0.00009408985,0.00006769377,0.00006273129,0.000039165145,0.81408274,0.0060288445,0.0092072915,0.0014290666,0.1682716],"study_design_scores_gemma":[0.000007055619,0.00003845162,0.00006978098,0.00000459687,0.000014956088,0.000019153387,0.000011908055,0.9950034,0.0009313391,0.0032330966,0.00066339714,0.000002887725],"about_ca_topic_score_codex":0.002252142,"about_ca_topic_score_gemma":0.0051732054,"teacher_disagreement_score":0.0029708124,"about_ca_system_score_codex":0.0007078693,"about_ca_system_score_gemma":0.0008191496,"threshold_uncertainty_score":0.009938359},"labels":[],"label_agreement":null},{"id":"W7117052908","doi":"10.1109/icsj66986.2025.11302602","title":"Digital-Twin-Driven Machine Learning for Thermal Optimization of Flip-Chip Packages","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bayesian optimization; Bayesian probability; Thermal; Thermal resistance; Ball grid array; Work (physics)","score_opus":0.00906152705938497,"score_gpt":0.22573185896286893,"score_spread":0.21667033190348395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117052908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025298512,0.00022748766,0.9723022,0.00008955933,0.000030341553,0.000031842435,0.000034554683,0.0007849616,0.0012006671],"genre_scores_gemma":[0.70917964,0.00013468892,0.2871732,0.00018311088,0.00003967316,0.00017143178,0.00021557203,0.00022849363,0.0026741652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00014381846,0.000012494359,0.000064368745,0.000099674195,0.00004159178],"domain_scores_gemma":[0.99937016,0.00037521042,0.000041875475,0.000043148535,0.00014282844,0.000026851723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014259184,0.00080630946,0.0007847373,0.0005113403,0.0003424338,0.0006081226,0.0012458569,0.0008843388,0.0013372176],"category_scores_gemma":[0.0022154988,0.00057913957,0.0006260963,0.0004788214,0.0007829126,0.0006928774,0.0007652154,0.0012766302,0.00027490722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025926784,0.000022105069,0.00017872769,0.000018985253,0.000016594217,0.000007202238,0.00000864299,0.9780507,0.0008278092,0.0018370779,0.00020949157,0.018796671],"study_design_scores_gemma":[0.0000011005293,0.0000038780986,0.00001672262,6.728478e-7,7.940002e-7,9.4340857e-7,5.269089e-7,0.99931896,0.00018580352,0.00042108414,0.000048950304,6.7607357e-7],"about_ca_topic_score_codex":0.00422481,"about_ca_topic_score_gemma":0.00400338,"teacher_disagreement_score":0.00422481,"about_ca_system_score_codex":0.0009122907,"about_ca_system_score_gemma":0.0012688714,"threshold_uncertainty_score":0.00840044},"labels":[],"label_agreement":null},{"id":"W7123334896","doi":"10.1109/icm66518.2025.11322520","title":"Effective Partitioning Approaches for High Performance FPGA Routing","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Scalability; Field-programmable gate array; Routing (electronic design automation); Workload; Multi-core processor; Parallelism (grammar); Scheduling (production processes); Thread (computing)","score_opus":0.018021350018006945,"score_gpt":0.22250295654695637,"score_spread":0.20448160652894942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123334896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020681491,0.002282678,0.96675104,0.00018840429,0.000062736326,0.00006919818,0.000029761823,0.00050011964,0.009434605],"genre_scores_gemma":[0.37458262,0.0026744264,0.61778486,0.00018242265,0.00007950371,0.0001538638,0.00014342339,0.0002151516,0.00418384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943954,0.00016291882,0.000019302037,0.00004838258,0.0002755488,0.000054315773],"domain_scores_gemma":[0.99952507,0.00019684825,0.000058660436,0.00010838457,0.000093679504,0.000017466959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052784936,0.0005679546,0.00034091782,0.0005908892,0.00045242067,0.000817502,0.0007968647,0.0005058595,0.0023657614],"category_scores_gemma":[0.0012933655,0.0002608807,0.00026761164,0.00056174345,0.00047278727,0.0010854345,0.0007308947,0.0006206935,0.0006036027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013244877,0.00008546521,0.00063201936,0.0002758643,0.00006793837,0.00014620014,0.0001499904,0.54763716,0.053863388,0.11050526,0.0040543643,0.28244993],"study_design_scores_gemma":[0.000054407057,0.00020407191,0.00048429027,0.000047105594,0.00003865116,0.00025624072,0.00008344838,0.90547484,0.019896787,0.05074629,0.022688754,0.000025150215],"about_ca_topic_score_codex":0.00072429347,"about_ca_topic_score_gemma":0.001682108,"teacher_disagreement_score":0.0023657614,"about_ca_system_score_codex":0.0005764903,"about_ca_system_score_gemma":0.000500452,"threshold_uncertainty_score":0.007914305},"labels":[],"label_agreement":null},{"id":"W7127350437","doi":"10.1109/icfpt67023.2025.00043","title":"Congestion-Aware CAD Optimizations for Routing-Constrained FPGAs","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Multipath routing; Equal-cost multi-path routing; Benchmark (surveying); Static routing; Field-programmable gate array; Critical path method; Path (computing); Minification","score_opus":0.01207941861877767,"score_gpt":0.25890302294324324,"score_spread":0.24682360432446557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127350437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22381943,0.0006779437,0.76100624,0.00020892081,0.00005901561,0.00008992174,0.00017525328,0.0026182623,0.011345015],"genre_scores_gemma":[0.83375895,0.00015021046,0.16320774,0.000054105738,0.000013514856,0.000045031135,0.00016736411,0.0002184897,0.002384645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984074,0.000033301727,0.0000068500835,0.000020707568,0.0000682258,0.000030199897],"domain_scores_gemma":[0.99967504,0.00014804787,0.000055277145,0.000044999524,0.00006279774,0.000013796926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024823623,0.000720951,0.00028442437,0.00070032227,0.00026346557,0.0005148415,0.00055121025,0.00022569463,0.0024658414],"category_scores_gemma":[0.0011515432,0.00032972055,0.00021333477,0.00037349784,0.00023984643,0.0004461661,0.000432635,0.00030567078,0.00023269969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008329879,0.000052301333,0.0016533091,0.000072822506,0.000032832944,0.00010799205,0.00004567454,0.881119,0.021358408,0.0046436703,0.0015339488,0.089296736],"study_design_scores_gemma":[0.000009559503,0.000035145844,0.00031392256,0.000004397915,0.000007258013,0.000024392013,0.000013310845,0.9943163,0.003424605,0.0010019656,0.0008449365,0.0000042587653],"about_ca_topic_score_codex":0.0035857433,"about_ca_topic_score_gemma":0.012534911,"teacher_disagreement_score":0.0035857433,"about_ca_system_score_codex":0.000653939,"about_ca_system_score_gemma":0.0006805994,"threshold_uncertainty_score":0.008249044},"labels":[],"label_agreement":null},{"id":"W7127395105","doi":"10.1109/icfpt67023.2025.00042","title":"Efficient FPGA Resource Graph Learning with Graph Neural Networks for Router Runtime Prediction","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Router; Field-programmable gate array; Convolutional neural network; Artificial neural network; Routing (electronic design automation); Graph; Key (lock); Resource (disambiguation)","score_opus":0.005103181421566539,"score_gpt":0.19567787911054296,"score_spread":0.19057469768897642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127395105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10850017,0.0005997605,0.8748635,0.0006625689,0.0001402489,0.00009010244,0.000630612,0.009416119,0.0050968803],"genre_scores_gemma":[0.78971815,0.00023720354,0.2045965,0.00020722533,0.000047602727,0.00008565378,0.0011706307,0.0003205173,0.0036165495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980813,0.000031478656,0.000008053854,0.00006573216,0.00004729934,0.000039235347],"domain_scores_gemma":[0.9994904,0.00021435796,0.00006135324,0.00009317268,0.00011260012,0.000028106922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002677165,0.0008865441,0.0004664731,0.0007639272,0.00028499414,0.0005957246,0.0011919911,0.00060247787,0.0028151537],"category_scores_gemma":[0.0017896071,0.0003869001,0.00037523266,0.00067518716,0.00030493175,0.0012419488,0.00039191078,0.0009491099,0.0005448987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007679393,0.000054878958,0.0013798556,0.000036508005,0.000028539607,0.000036891313,0.000010373699,0.89532155,0.002339653,0.002563498,0.0034605772,0.09469086],"study_design_scores_gemma":[0.0000021718758,0.0000050160925,0.00007781767,0.0000011266942,0.0000021344024,0.0000030338058,0.0000019162828,0.9981608,0.00048271325,0.0011189295,0.00014306992,0.0000014232131],"about_ca_topic_score_codex":0.018831896,"about_ca_topic_score_gemma":0.038489435,"teacher_disagreement_score":0.018831896,"about_ca_system_score_codex":0.0014440137,"about_ca_system_score_gemma":0.0012388021,"threshold_uncertainty_score":0.03744459},"labels":[],"label_agreement":null},{"id":"W7132875402","doi":"","title":"Machine Learning for Cutting Planes in Mixed Integer Linear Programming","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer programming; Linear programming; Cutting-plane method; Artificial neural network; Feature selection; Graph; Constraint (computer-aided design); Constraint programming; Column generation","score_opus":0.01808971292237653,"score_gpt":0.31969596156181596,"score_spread":0.3016062486394394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132875402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024964337,0.00092075614,0.9913263,0.00035606744,0.00005321663,0.000045570105,0.000052544096,0.0004591979,0.0042898925],"genre_scores_gemma":[0.08727794,0.0015543068,0.90544635,0.00036815432,0.00016453105,0.00033468744,0.00037430547,0.00053790404,0.0039418545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987676,0.0005264864,0.00006757366,0.00018527363,0.00036621926,0.00008682301],"domain_scores_gemma":[0.996804,0.0025004002,0.0001621324,0.0001841249,0.00029132026,0.000058063702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019091517,0.0017542043,0.001023199,0.00084665325,0.00045552666,0.0018076324,0.001219709,0.0010815663,0.00633434],"category_scores_gemma":[0.0073172133,0.0008760639,0.001255738,0.0011805013,0.0011677486,0.0015319642,0.0015969998,0.004240643,0.0018161928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062530744,0.00009478571,0.00057011767,0.00042727034,0.0000581324,0.00005779432,0.00009287972,0.6959503,0.0017075924,0.09497102,0.006901627,0.19910593],"study_design_scores_gemma":[0.000012304485,0.00002197343,0.000042682124,0.0000441807,0.0000043785467,0.000010889647,0.0000101257965,0.95903015,0.00059643516,0.03700355,0.0032183428,0.000004958644],"about_ca_topic_score_codex":0.002044022,"about_ca_topic_score_gemma":0.0035917864,"teacher_disagreement_score":0.00633434,"about_ca_system_score_codex":0.0012941937,"about_ca_system_score_gemma":0.0014769125,"threshold_uncertainty_score":0.021190464},"labels":[],"label_agreement":null},{"id":"W7132923394","doi":"","title":"Synthesizeable Heterogeneous FPGA Fabrics","year":2019,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Stratix; Suite; Process (computing); FPGA prototype; Carry (investment); Reconfigurable computing","score_opus":0.016154035128383423,"score_gpt":0.28176001858931826,"score_spread":0.26560598346093484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132923394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4028558,0.0008369352,0.50882,0.00019579139,0.00021280357,0.00031811954,0.0011030617,0.0053820335,0.08027544],"genre_scores_gemma":[0.77545714,0.00038449254,0.20784646,0.00007201289,0.000026591995,0.00012385813,0.0010901324,0.0003420811,0.014657138],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984527,0.000017095419,0.000009160471,0.00003627794,0.000057283258,0.000034801422],"domain_scores_gemma":[0.99986744,0.000034537978,0.000015201111,0.000041937365,0.000031596748,0.000009185816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014744526,0.0003468587,0.00017168366,0.0002822288,0.00018611428,0.00045393733,0.00033761133,0.0001811424,0.0044502825],"category_scores_gemma":[0.00031583654,0.00015785836,0.00023481187,0.00021697643,0.00011963553,0.00029695878,0.00023400347,0.00025318968,0.0006998312],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018630859,0.00010106584,0.001571217,0.0004058278,0.000038992788,0.0007701974,0.0001691316,0.13074793,0.497211,0.03166552,0.004587083,0.3325457],"study_design_scores_gemma":[0.00012507036,0.0007529642,0.003682252,0.000088759414,0.000057868278,0.0011342174,0.00015952472,0.37279785,0.5047545,0.011656561,0.10475452,0.000035918147],"about_ca_topic_score_codex":0.00035777877,"about_ca_topic_score_gemma":0.000877345,"teacher_disagreement_score":0.0044502825,"about_ca_system_score_codex":0.00030626002,"about_ca_system_score_gemma":0.0002537484,"threshold_uncertainty_score":0.014887691},"labels":[],"label_agreement":null},{"id":"W7132936008","doi":"","title":"Design Mapping And Optimization For Field Programmable Gate Arrays With Embedded Networks On Chip","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Netlist; Field-programmable gate array; Gate array; Design flow; Place and route; Latency (audio); Bandwidth (computing); System on a chip; Electronic design automation; Network on a chip","score_opus":0.028531560003283215,"score_gpt":0.2834819846349308,"score_spread":0.2549504246316476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132936008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11734382,0.0016834358,0.8465135,0.00047925027,0.00009205691,0.00015822584,0.000118428856,0.001006364,0.03260483],"genre_scores_gemma":[0.4819892,0.0010617411,0.50166696,0.00016469932,0.00003355346,0.00018744428,0.00025084324,0.0002552884,0.014390204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997713,0.00007229499,0.000007243105,0.000023449113,0.00010004407,0.000025680602],"domain_scores_gemma":[0.99980134,0.00009859504,0.000028438188,0.000020338863,0.000044126737,0.000007221203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032377895,0.000625063,0.00018997211,0.00037843978,0.00025643417,0.00046693216,0.0004117329,0.00023915544,0.003238585],"category_scores_gemma":[0.00089404,0.00024557402,0.00021458369,0.0004109592,0.00021475276,0.0003814533,0.0002900795,0.0003354726,0.00042168907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038564776,0.00009058996,0.0007795654,0.00016114573,0.000024147565,0.00008952567,0.000060477385,0.7155398,0.022799818,0.014604235,0.0029938864,0.24281824],"study_design_scores_gemma":[0.000018155855,0.00014956972,0.00046226778,0.000019802517,0.000014676345,0.00006042079,0.000049459642,0.96541125,0.011894652,0.010020332,0.0118923085,0.000007142802],"about_ca_topic_score_codex":0.0021395322,"about_ca_topic_score_gemma":0.005317325,"teacher_disagreement_score":0.003238585,"about_ca_system_score_codex":0.0006445419,"about_ca_system_score_gemma":0.0010045221,"threshold_uncertainty_score":0.0108341575},"labels":[],"label_agreement":null},{"id":"W7132936157","doi":"","title":"Automated FPGA design, verification and layout","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Field-programmable gate array; Process (computing); Integrated circuit layout; IC layout editor; Page layout; FPGA prototype; Design layout record; Electronic design automation","score_opus":0.02126753463756011,"score_gpt":0.3060845718431392,"score_spread":0.2848170372055791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132936157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023263413,0.00077367754,0.94918215,0.00016910156,0.00012498887,0.00019871748,0.0003461331,0.009191697,0.016750056],"genre_scores_gemma":[0.20692928,0.000878313,0.77649736,0.00012789779,0.00006591341,0.00029866782,0.0011875287,0.00093932246,0.013075765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980292,0.00033622983,0.0001048818,0.00023459778,0.0011604631,0.00013459398],"domain_scores_gemma":[0.99761826,0.00076200184,0.00016072657,0.0007850736,0.0006427628,0.000031175863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090604543,0.0007789819,0.00059740996,0.0010163448,0.000686827,0.0012282524,0.000963741,0.0005435295,0.008895823],"category_scores_gemma":[0.0033930212,0.00052505283,0.0005507166,0.00058836816,0.00047941948,0.0008424216,0.00058510614,0.00068484066,0.0034336203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014451215,0.000058087942,0.0007386497,0.00037428268,0.000042409378,0.0003030379,0.00015028578,0.0687805,0.076413,0.01823995,0.0105200475,0.82423526],"study_design_scores_gemma":[0.0002976999,0.00078340527,0.0053288527,0.00031410257,0.00009506743,0.0020802366,0.0002565443,0.4005588,0.3291465,0.043094248,0.21789807,0.00014658803],"about_ca_topic_score_codex":0.0020861856,"about_ca_topic_score_gemma":0.0031027382,"teacher_disagreement_score":0.008895823,"about_ca_system_score_codex":0.0007719002,"about_ca_system_score_gemma":0.0017359739,"threshold_uncertainty_score":0.029759467},"labels":[],"label_agreement":null},{"id":"W7132988041","doi":"","title":"Increasing FPGA CAD Adaptability using Reinforcement Learning and Smart Perturbations","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; VMware","keywords":"Adaptability; Field-programmable gate array; Exploit; CAD; Critical path method; Block (permutation group theory); Reinforcement learning; Path (computing)","score_opus":0.023747556715854986,"score_gpt":0.3119064644131156,"score_spread":0.2881589076972606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132988041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16622236,0.0002956696,0.82537705,0.0003428529,0.000066955705,0.00014029734,0.00003240043,0.0014076406,0.0061147716],"genre_scores_gemma":[0.9184131,0.00012184644,0.07948747,0.00012587526,0.000023525106,0.00011150707,0.00003581609,0.00007243459,0.001608442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994916,0.00013223669,0.000026055295,0.0001347186,0.00013576252,0.000079670135],"domain_scores_gemma":[0.9982999,0.001007051,0.00025251767,0.00019128011,0.00015862397,0.000090660134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983129,0.0010228261,0.000588542,0.0004065392,0.00032780986,0.00073061336,0.0010309987,0.00072676415,0.0015618942],"category_scores_gemma":[0.003955629,0.00043646086,0.00050221273,0.00019514648,0.0008724839,0.0008248424,0.0010112812,0.0010782122,0.00027729743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007366564,0.00008105145,0.0010316109,0.000040421524,0.00002294916,0.00005165798,0.000054900866,0.9475641,0.0070432387,0.0027749296,0.0003029265,0.040958468],"study_design_scores_gemma":[0.000012755464,0.000058305144,0.00012993833,0.0000044142243,0.0000059068,0.000012647357,0.0000060963716,0.9971275,0.0012796855,0.001086675,0.00027155,0.0000044574117],"about_ca_topic_score_codex":0.002324301,"about_ca_topic_score_gemma":0.002839481,"teacher_disagreement_score":0.002324301,"about_ca_system_score_codex":0.0007829152,"about_ca_system_score_gemma":0.0007686023,"threshold_uncertainty_score":0.0058085322},"labels":[],"label_agreement":null},{"id":"W7132988363","doi":"","title":"Architecture and CAD Techniques for Efficient FPGA Implementation of Machine Learning and Other Applications","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Flexibility (engineering); Convolutional neural network; Convolution (computer science); Software; Architecture; Reconfigurable computing; Kernel (algebra); Artificial neural network","score_opus":0.0090377371999655,"score_gpt":0.33652820650948356,"score_spread":0.3274904693095181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132988363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043447785,0.0013962851,0.9151463,0.00041999435,0.00018547488,0.00019177684,0.00025629852,0.003825648,0.035130445],"genre_scores_gemma":[0.28659454,0.0010399676,0.6976366,0.00014176893,0.000041896787,0.00017561174,0.0005252364,0.0003306856,0.013513648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977607,0.00002483963,0.000013374671,0.000024783692,0.00013596963,0.000025014022],"domain_scores_gemma":[0.99976367,0.000062879306,0.00002792041,0.000058123078,0.0000801755,0.0000071950367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025755493,0.00047215942,0.0001757466,0.00051155157,0.00022224084,0.000523135,0.00051493867,0.00032759993,0.009582026],"category_scores_gemma":[0.00063134934,0.00031412902,0.00035566775,0.00041552327,0.000166803,0.00048525273,0.00021304065,0.00072295347,0.001780576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015471931,0.000096972326,0.0014388326,0.0007081469,0.000051573126,0.00030988763,0.0001660374,0.12944992,0.21524411,0.047195457,0.01060211,0.5945822],"study_design_scores_gemma":[0.00013344329,0.0005991916,0.002867415,0.00019845007,0.00007657063,0.0010059564,0.000092083894,0.60888714,0.20021915,0.01312084,0.17274536,0.00005438429],"about_ca_topic_score_codex":0.0012754507,"about_ca_topic_score_gemma":0.0029183587,"teacher_disagreement_score":0.009582026,"about_ca_system_score_codex":0.00053220824,"about_ca_system_score_gemma":0.00081876956,"threshold_uncertainty_score":0.03205502},"labels":[],"label_agreement":null},{"id":"W7133014279","doi":"","title":"Fast CAD for FPGAs","year":2014,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; CAD; Routing (electronic design automation); Process (computing); FPGA prototype; Reconfigurable computing; Reduction (mathematics)","score_opus":0.015239062565291285,"score_gpt":0.31255763309588996,"score_spread":0.2973185705305987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133014279","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057443106,0.0067408914,0.80504906,0.0013154602,0.0014190999,0.00030898492,0.0012910574,0.011384463,0.16674666],"genre_scores_gemma":[0.07865407,0.00648297,0.76148736,0.00062308373,0.0003201778,0.0004606708,0.003384757,0.0021894032,0.14639752],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992755,0.00008380289,0.000026888667,0.00008502086,0.00047735538,0.000051460018],"domain_scores_gemma":[0.99916375,0.00022887182,0.000029367035,0.00020534162,0.0003402712,0.000032343443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063693535,0.0009815351,0.00050128513,0.0014385806,0.0006438531,0.0018205756,0.001143302,0.00085214793,0.069284245],"category_scores_gemma":[0.0021410221,0.0006764624,0.0007655391,0.0009747527,0.0004002902,0.0013410111,0.0010657111,0.0016395623,0.018983621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010892733,0.000044125478,0.00058928924,0.0007746327,0.000050871633,0.0002828269,0.00018478851,0.028656393,0.022323957,0.18776016,0.115163535,0.6440605],"study_design_scores_gemma":[0.00006694157,0.00012378818,0.0006852711,0.00029756574,0.00002896811,0.00069230166,0.00008451722,0.06935218,0.019376203,0.041423105,0.8678182,0.000050991774],"about_ca_topic_score_codex":0.0013097093,"about_ca_topic_score_gemma":0.003182777,"teacher_disagreement_score":0.069284245,"about_ca_system_score_codex":0.00097501406,"about_ca_system_score_gemma":0.00092423806,"threshold_uncertainty_score":0.23177892},"labels":[],"label_agreement":null},{"id":"W7133044443","doi":"","title":"Technology migration for hard Ips","year":2003,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bibliographical Society of Canada; University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Process (computing); TRACE (psycholinguistics); Design technology; Port (circuit theory); Key (lock); Architecture; Power (physics)","score_opus":0.018033390110788236,"score_gpt":0.3027783493887197,"score_spread":0.2847449592779315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133044443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16746801,0.0008368173,0.7915061,0.0005951841,0.00016273672,0.0001988935,0.0001010302,0.0016081829,0.03752296],"genre_scores_gemma":[0.54118776,0.0005741576,0.4395145,0.000324194,0.000048958722,0.00015008509,0.00028251988,0.00038991086,0.017527882],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993599,0.00013598875,0.000045119305,0.00010312893,0.0002831766,0.000072663024],"domain_scores_gemma":[0.99895823,0.0003213425,0.00014375271,0.00038576397,0.00013840052,0.000052481435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047087783,0.00047216666,0.00027378014,0.0006491038,0.0006037431,0.0011153644,0.00090729154,0.0005337394,0.004481955],"category_scores_gemma":[0.0025324563,0.00027588423,0.00032007633,0.0005849498,0.00048518635,0.0015842295,0.0013585357,0.001037907,0.00082183717],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018728821,0.0001330354,0.0026352657,0.00034498103,0.000035813948,0.0008455159,0.0005288796,0.10992839,0.095125616,0.10824283,0.0076640085,0.6743283],"study_design_scores_gemma":[0.000111529116,0.00051865185,0.002748343,0.00012847528,0.000059886373,0.0016130732,0.00051892054,0.5383608,0.14958756,0.17739417,0.12889244,0.000066286404],"about_ca_topic_score_codex":0.00047180895,"about_ca_topic_score_gemma":0.0009833481,"teacher_disagreement_score":0.004481955,"about_ca_system_score_codex":0.0004517981,"about_ca_system_score_gemma":0.00070661097,"threshold_uncertainty_score":0.014993608},"labels":[],"label_agreement":null},{"id":"W7133087281","doi":"","title":"Device Placement Optimization with Deep Reinforcement Learning","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pipeline (software); Reinforcement learning; Deep learning; Artificial neural network; Deep neural networks; Generalizability theory; Scheduling (production processes); Granularity","score_opus":0.01492511900388855,"score_gpt":0.2835500901668331,"score_spread":0.26862497116294454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133087281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03126237,0.00046285565,0.95939827,0.00038585873,0.000119179225,0.00010663817,0.000102792816,0.0017649238,0.006397128],"genre_scores_gemma":[0.782319,0.00021286185,0.20963655,0.00028000103,0.000049300488,0.00021264252,0.00021585276,0.00025918146,0.0068145515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995881,0.00007739258,0.000021767672,0.00011658581,0.00010980744,0.000086295186],"domain_scores_gemma":[0.99930763,0.0003368455,0.00008219122,0.00008369552,0.00012739086,0.00006230474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872791,0.0012816179,0.0010205426,0.00042784325,0.00045977987,0.00087413867,0.0015399848,0.0011007121,0.0042720237],"category_scores_gemma":[0.0020511583,0.0006309364,0.0006082397,0.00038668775,0.00091288675,0.0011652235,0.0013196893,0.0018376609,0.0006022063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038340542,0.000030814397,0.00030592055,0.00003940455,0.000009603353,0.00004504619,0.000020062233,0.9671409,0.0011066303,0.0042370833,0.0010928717,0.025933284],"study_design_scores_gemma":[0.0000064141377,0.000019090892,0.000025936364,0.0000033964116,0.000002505064,0.0000067375413,0.0000050096096,0.99657035,0.00039487367,0.0026242319,0.0003396135,0.0000018463592],"about_ca_topic_score_codex":0.0039657135,"about_ca_topic_score_gemma":0.006630536,"teacher_disagreement_score":0.0042720237,"about_ca_system_score_codex":0.0016819679,"about_ca_system_score_gemma":0.0016636432,"threshold_uncertainty_score":0.0142912865},"labels":[],"label_agreement":null},{"id":"W7133197846","doi":"10.5753/eradse.2025.16932","title":"Modelo de refinamento em paralelo para malhas de elementos finitos","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); GLUE; Finite element method; 3d model","score_opus":0.019163837631545822,"score_gpt":0.2778028173552908,"score_spread":0.25863897972374494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133197846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15086767,0.0006865676,0.82678056,0.00048644515,0.00016418533,0.00011522075,0.000519545,0.0020006665,0.018379133],"genre_scores_gemma":[0.8727966,0.0006237437,0.10489352,0.00009598976,0.000031197837,0.00022591428,0.00031699994,0.000360441,0.02065559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.00004568173,0.0000151081595,0.00007165188,0.00010424541,0.000049725753],"domain_scores_gemma":[0.99946195,0.00023220082,0.000052712556,0.00010135448,0.00011705782,0.000034802815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038303717,0.0005902588,0.000594097,0.00044157906,0.00062401395,0.0015572862,0.0014535285,0.0014297869,0.008302953],"category_scores_gemma":[0.0016132671,0.0005490742,0.00086051686,0.0004697792,0.00073698984,0.0016001125,0.0009093058,0.00091385754,0.0009930785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014754955,0.000046006273,0.001760718,0.00011900777,0.000025853938,0.00017516797,0.00020001947,0.95263535,0.013148753,0.015855787,0.0006473614,0.015238362],"study_design_scores_gemma":[0.000015384085,0.00005656448,0.00035651238,0.000013939512,0.000015693853,0.000059688587,0.000061745675,0.9881246,0.0048438655,0.0031340763,0.0033078066,0.000010065507],"about_ca_topic_score_codex":0.0064258645,"about_ca_topic_score_gemma":0.005566128,"teacher_disagreement_score":0.008302953,"about_ca_system_score_codex":0.001051699,"about_ca_system_score_gemma":0.0011486155,"threshold_uncertainty_score":0.027776182},"labels":[],"label_agreement":null},{"id":"W7140458299","doi":"10.1109/fpl68686.2025.00056","title":"Using Data to Reduce Uncertainty in FPGA Routing","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Routing (electronic design automation); Field-programmable gate array; Ideal (ethics); Closure (psychology); Network routing; Retard","score_opus":0.10326613648350451,"score_gpt":0.34837182880878964,"score_spread":0.24510569232528512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140458299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11365241,0.00070881424,0.87834394,0.001082007,0.00011890838,0.000080156446,0.0010772059,0.0025409271,0.002395555],"genre_scores_gemma":[0.82572347,0.00029617306,0.17115146,0.00020051887,0.000056770776,0.00011726854,0.0011164537,0.00025660577,0.0010813371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986896,0.00030028433,0.00009867305,0.00029735707,0.0005109416,0.00010313911],"domain_scores_gemma":[0.9834579,0.010428532,0.001651829,0.002351222,0.0019490162,0.00016133065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017205947,0.0011486986,0.0008258755,0.0013059294,0.0005750854,0.001587086,0.0013128427,0.0010650895,0.0012903664],"category_scores_gemma":[0.022890268,0.0008421928,0.00062131585,0.0011122692,0.0008160912,0.0032673392,0.0010348689,0.0020479173,0.00042187262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016603203,0.000063901745,0.0066668293,0.00008666974,0.00003190421,0.000078798934,0.00008057349,0.88879544,0.0033991912,0.0057969666,0.0011116994,0.09372197],"study_design_scores_gemma":[0.000006050549,0.00004137111,0.00054166367,0.000016242528,0.0000075263106,0.00002099467,0.000017499682,0.98488927,0.004680066,0.008855325,0.00091205956,0.000011969912],"about_ca_topic_score_codex":0.0038338818,"about_ca_topic_score_gemma":0.0062253415,"teacher_disagreement_score":0.0038338818,"about_ca_system_score_codex":0.0013879013,"about_ca_system_score_gemma":0.0013698257,"threshold_uncertainty_score":0.010069907},"labels":[],"label_agreement":null},{"id":"W7140692658","doi":"10.1109/fpl68686.2025.00068","title":"Compile in Seconds and Run on an FPGA with DynaRapid","year":2025,"lang":"","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Field-programmable gate array; Compile time; Compiler; Key (lock)","score_opus":0.006051528091407388,"score_gpt":0.22169109976548404,"score_spread":0.21563957167407666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140692658","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030071042,0.00061711663,0.49847338,0.00026271143,0.00032172515,0.00047593532,0.004230488,0.4195027,0.04604497],"genre_scores_gemma":[0.27680272,0.000770268,0.6059971,0.000502197,0.000086946726,0.0008981972,0.017096085,0.04849334,0.04935315],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938834,0.00007406664,0.000044494536,0.00016631588,0.0002350755,0.00009171758],"domain_scores_gemma":[0.9991534,0.000273582,0.00006642941,0.00024777814,0.00021146082,0.000047348993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005358301,0.0014595641,0.00045199282,0.00090960704,0.0003791304,0.0010460364,0.0010388473,0.00038190544,0.034401953],"category_scores_gemma":[0.0019579988,0.0007618073,0.0005921275,0.00043647253,0.00044927088,0.00084150373,0.0007365408,0.0006674194,0.028789826],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014320115,0.00021582808,0.0053518293,0.0016965482,0.00024140361,0.0007200242,0.0005918968,0.027260225,0.08357576,0.01433401,0.17215808,0.69242245],"study_design_scores_gemma":[0.0004932089,0.0009319922,0.008042612,0.00027312417,0.0001620295,0.0015979267,0.00031741525,0.15941855,0.25071263,0.01644601,0.5613305,0.00027404437],"about_ca_topic_score_codex":0.0015220642,"about_ca_topic_score_gemma":0.0026770374,"teacher_disagreement_score":0.034401953,"about_ca_system_score_codex":0.00066609326,"about_ca_system_score_gemma":0.0011692491,"threshold_uncertainty_score":0.11508602},"labels":[],"label_agreement":null},{"id":"W7148362437","doi":"10.70675/5559690az1cf0z4119z83c3zc03ef82e2977","title":"Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning","year":2017,"lang":"","type":"dissertation","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Partition (number theory); Processor scheduling","score_opus":0.028830410806294945,"score_gpt":0.3173507336935314,"score_spread":0.28852032288723645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148362437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.329284,0.00053503027,0.65561265,0.0006534668,0.00010212867,0.00016992116,0.00018028598,0.0008179607,0.012644477],"genre_scores_gemma":[0.917836,0.00018000918,0.07910607,0.00008351309,0.000014214736,0.00016684749,0.00014163443,0.00014216505,0.002329522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967396,0.00014029353,0.000010371786,0.00004538132,0.00008185833,0.000048153703],"domain_scores_gemma":[0.99916744,0.0005173551,0.00007011707,0.000055917506,0.00012824412,0.000060901224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006281416,0.0007290137,0.00058830815,0.00085936935,0.0006512744,0.0011640759,0.00088833127,0.0010258373,0.002419752],"category_scores_gemma":[0.002096223,0.00041407152,0.0008646367,0.00064041035,0.000643291,0.0009161474,0.0008026861,0.00049608795,0.0002789999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004266551,0.000018660472,0.0004260698,0.000032601656,0.000012586944,0.000032096585,0.00003631048,0.99031675,0.0016913906,0.0027290501,0.00013719243,0.0045245034],"study_design_scores_gemma":[0.000005489796,0.000010185476,0.000100021825,0.0000024074943,0.0000023727162,0.0000038086662,0.0000099297085,0.9980793,0.0003402361,0.0012661574,0.00017783184,0.0000023471362],"about_ca_topic_score_codex":0.008991962,"about_ca_topic_score_gemma":0.005567274,"teacher_disagreement_score":0.008991962,"about_ca_system_score_codex":0.0012473274,"about_ca_system_score_gemma":0.0012183773,"threshold_uncertainty_score":0.017879248},"labels":[],"label_agreement":null}]}